Search results for "Intelligence"
showing 10 items of 6959 documents
Combinations of discourse markers with repairs and repetitions in English, French and Spanish
2020
Abstract Discourse markers have a central role in planning and repairing processes of speech production. They relate with fluency and disfluency phenomena such as pauses, repetitions and reformulations. Their polyfunctionality is challenging and few form-function mappings are stable cross-linguistically. This study combines a functional and a structural approach to discourse markers and their combination with and within repetitions and self-repairs in native English, French and Spanish, in order to establish the inter-relation between these three fluency-related devices and to find potentially universal patterns of use. Qualitative coding and quantitative analyses of categories of markers a…
Aggregation of Risk Level Assessments Based on Fuzzy Equivalence Relation
2017
The paper deals with the problem of aggregation of risk level assessments. We describe the technique of a risk level evaluation taking into account values of the risk level obtained for objects which are in some sense equivalent. For this purpose we propose to use the construction of a general aggregation operator based on the corresponding fuzzy equivalence relation. Numerical example of the investment risk level aggregation using an equivalence relation obtained on the basis of different macroeconomic factors for countries of one region is considered.
On fixed points of the Burrows-Wheeler transform
2017
The Burrows-Wheeler Transform is a well known transformation widely used in Data Compression: important competitive compression software, such as Bzip (cf. [1]) and Szip (cf. [2]) and some indexing software, like the FM-index (cf. [3]), are deeply based on the Burrows Wheeler Transform. The main advantage of using BWT for data compression consists in its feature of "clustering" together equal characters. In this paper we show the existence of fixed points of BWT, i.e., words on which BWT has no effect. We show a characterization of the permutations associated to BWT of fixed points and we give the explicit form of fixed points on a binary ordered alphabet a, b having at most four b's and th…
Potential approach in marginalizing Gibbs models
1999
Abstract Given an undirected graph G or hypergraph potential H model for a given set of variables V , we introduce two marginalization operators for obtaining the undirected graph G A or hypergraph H A associated with a given subset A ⊂ V such that the marginal distribution of A factorizes according to G A or H A , respectively. Finally, we illustrate the method by its application to some practical examples. With them we show that potential approach allow defining a finer factorization or performing a more precise conditional independence analysis than undirected graph models. Finally, we explain connections with related works.
Uncertainty measures—Problems concerning additivity
2009
Additivity of an uncertainty measure on an MV-algebra has a clear meaning. If the divisibility is dropped, we come up to a so-called Girard algebra. There we discuss strong resp. weak additivity based on so-called divisible disjoint unions resp. on additivity for all sub-MV-algebras. We obtain a description of those extensions from additive measures on an MV-algebra to the canonical Girard algebra extension of pairs which are strongly additive and valuation measures. Finally, we prove the non-existence of strongly additive measure extensions, if the underlying MV-algebra is a finite chain with more than two non-trivial elements.
Measure-free conditioning and extensions of additive measures on finite MV-algebras
2010
Using the well known representation of any finite MV-algebra as a product of finite MV-chains as factors, we obtain a representation of its canonical extension as a Girard algebra product of the canonical extensions of the MV-chain factors. Based on this representation and using the results from our last paper, we characterize the additive measures on any finite MV-algebra resp. the weakly and the strongly additive measures on its canonical Girard algebra extension, and that as convex combinations of the corresponding measures on the respective factors. After that we apply the results to measure-free defined conditional events which for this reason are considered as elements of the canonica…
Capabilities of Ultrametric Automata with One, Two, and Three States
2016
Ultrametric automata use p-adic numbers to describe the random branching of the process of computation. Previous research has shown that ultrametric automata can have a significant decrease in computing complexity. In this paper we consider the languages that can be recognized by one-way ultrametric automata with one, two, and three states. We also show an example of a promise problem that can be solved by ultrametric integral automaton with three states.
Unavoidable sets and circular splicing languages
2017
Circular splicing systems are a formal model of a generative mechanism of circular words, inspired by a recombinant behaviour of circular DNA. They are defined by a finite alphabet A, an initial set I of circular words, and a set R of rules. In this paper, we focus on the still unknown relations between regular languages and circular splicing systems with a finite initial set and a finite set R of rules represented by a pair of letters ( ( 1 , 3 ) -CSSH systems). When R = A × A , it is known that the set of all words corresponding to the splicing language belongs to the class of pure unitary languages, introduced by Ehrenfeucht, Haussler, Rozenberg in 1983. They also provided a characteriza…
Querying the Guarded Fragment with Transitivity
2016
We study the problem of answering a union of Boolean conjunctive queries q against a database Δ, and a logical theory φ which falls in the guarded fragment with transitive guards (GF + TG). We trace the frontier between decidability and undecidability of the problem under consideration. Surprisingly, we show that query answering under GF2 + TG, i.e., the two-variable fragment of GF + TG, is already undecidable (even without equality), whereas its monadic fragment is decidable; in fact, it is 2exptime-complete in combined complexity and coNP-complete in data complexity. We also show that for a restricted class of queries, query answering under GF+TG is decidable. © 2013 Springer-Verlag.
On a generalization of Goguen's category Set(L)
2007
The paper considers a category which generalizes Goguen's category Set(L) of L-fuzzy sets with a fixed basis L. We show the necessary and sufficient conditions for the generalized category to be a quasitopos and consider additional inner structure supplied by the latter property.