Search results for " Complexity"
showing 10 items of 623 documents
Verbal ordinal classification with multicriteria decision aiding
2008
Abstract Professionals in neuropsychology usually perform diagnoses of patients’ behaviour in a verbal rather than in a numerical form. This fact generates interest in decision support systems that process verbal data. It also motivates us to develop methods for the classification of such data. In this paper, we describe ways of aiding classification of a discrete set of objects, evaluated on set of criteria that may have verbal estimations, into ordered decision classes. In some situations, there is no explicit additional information available, while in others it is possible to order the criteria lexicographically. We consider both of these cases. The proposed Dichotomic Classification (DC…
A recurrent deep neural network model to measure sentence complexity for the Italian Language
2019
Text simplification (TS) is a natural language processing task devoted to the modification of a text in such a way that the grammar and structure of the phrases is greatly simplified, preserving the underlying meaning and information contents. In this paper we give a contribution to the TS field presenting a deep neural network model able to detect the complexity of italian sentences. In particular, the system gives a score to an input text that identifies the confidence level during the decision making process and that could be interpreted as a measure of the sentence complexity. Experiments have been carried out on one public corpus of Italian texts created specifically for the task of TS…
The dependency of the validity of information integration on cognitive variables and the judgement task
1980
Simple models of information integration focus essentially on the combination of the components of information. This research investigated whether cognitive variables in the constructs of intelligence and cognitive complexity, as well as concentration, could predict the conditions of simple models of judgement. As additional predictors, the two qualitative variables [type of information] and [experience of the judgement task] were introduced. Subjects judged three types of stimuli using the pair comparison method. The conditions of the judgement models were analysed in the framework of the conjoint-measurement approach. Five different regression functions provided mediocre approximations to…
Weak and strong recognition by 2-way randomized automata
1997
Languages weakly recognized by a Monte Carlo 2-way finite automaton with n states are proved to be strongly recognized by a Monte Carlo 2-way finite automaton with no(n) states. This improves dramatically over the previously known result by M.Karpinski and R.Verbeek [10] which is also nontrivial since these languages can be nonregular [5]. For tally languages the increase in the number of states is proved to be only polynomial, and these languages are regular.
The Importance of the Nurse’s Role in the Management of Complex Diabetic Outpatients: It is the Time to Manage Patient’s Multidimensions
2018
none
Nuclear DNA fractions with grossly different base ratios in the genome of the marine sponge Geodia cydonium
2008
The DNA of the marine sponge Geodia cydonium (G.c.), a member of the phylogenetically old phylum Porifera, was characterized by density gradient centrifugation and by determining its genetic complexity by reassociation kinetics. At least five subcomponents were identified by curve-fit analyses of analytical density gradient centrifugation profiles of total G.c.-DNA. Four of these subcomponents were isolated from total G.c.-DNA by preparative density gradient centrifugation. The GC-contents of the subcomponents were determined to be 36.4%, 44.0%, 58.7%, and 66.1%, respectively. To our knowledge, such an extreme heterogeneity of DNA composition has never before been observed for any organism.…
Mixed valence mono- and hetero-metallic grid catenanes
2015
Multicomponent self-assembly was employed to obtain, in the solid state, a series of mixed valence mono- and hetero-metallic grid catenanes, which were characterized by single crystal X-ray diffraction.
Longest Motifs with a Functionally Equivalent Central Block
2004
International audience; This paper presents a generalization of the notion of longest repeats with a block of k don't care symbols introduced by [Crochemore et al., LATIN 2004] (for k fixed) to longest motifs composed of three parts: a first and last that parameterize match (that is, match via some symbol renaming, initially unknown), and a functionally equivalent central block. Such three-part motifs are called longest block motifs. Different types of functional equivalence, and thus of matching criteria for the central block are considered, which include as a subcase the one treated in [Crochemore et al., LATIN 2004] and extend to the case of regular expressions with no Kleene closure or …
Algorithmic Information Theory and Computational Complexity
2013
We present examples where theorems on complexity of computation are proved using methods in algorithmic information theory. The first example is a non-effective construction of a language for which the size of any deterministic finite automaton exceeds the size of a probabilistic finite automaton with a bounded error exponentially. The second example refers to frequency computation. Frequency computation was introduced by Rose and McNaughton in early sixties and developed by Trakhtenbrot, Kinber, Degtev, Wechsung, Hinrichs and others. A transducer is a finite-state automaton with an input and an output. We consider the possibilities of probabilistic and frequency transducers and prove sever…
Transition Function Complexity of Finite Automata
2011
State complexity of finite automata in some cases gives the same complexity value for automata which intuitively seem to have completely different complexities. In this paper we consider a new measure of descriptional complexity of finite automata -- BC-complexity. Comparison of it with the state complexity is carried out here as well as some interesting minimization properties are discussed. It is shown that minimization of the number of states can lead to a superpolynomial increase of BC-complexity.