Search results for " complexity."
showing 10 items of 603 documents
Computational Models That Matter During a Global Pandemic Outbreak
2020
The COVID-19 pandemic is causing a dramatic loss of lives worldwide, challenging the sustainability of our health care systems, threatening economic meltdown, and putting pressure on the mental health of individuals (due to social distancing and lock-down measures). The pandemic is also posing severe challenges to the scientific community, with scholars under pressure to respond to policymakers’ demands for advice despite the absence of adequate, trusted data. Understanding the pandemic requires fine-grained data representing specific local conditions and the social reactions of individuals. While experts have built simulation models to estimate disease trajectories that may be enough to gu…
FO^2 with one transitive relation is decidable
2013
We show that the satisfiability problem for the two-variable first-order logic, FO^2, over transitive structures when only one relation is required to be transitive, is decidable. The result is optimal, as FO^2 over structures with two transitive relations, or with one transitive and one equivalence relation, are known to be undecidable, so in fact, our result completes the classification of FO^2-logics over transitive structures with respect to decidability. We show that the satisfiability problem is in 2-NExpTime. Decidability of the finite satisfiability problem remains open.
New results for finding common neighborhoods in massive graphs in the data stream model
2008
AbstractWe consider the problem of finding pairs of vertices that share large common neighborhoods in massive graphs. We give lower bounds for randomized, two-sided error algorithms that solve this problem in the data-stream model of computation. Our results correct and improve those of Buchsbaum, Giancarlo, and Westbrook [On finding common neighborhoods in massive graphs, Theoretical Computer Science, 299 (1–3) 707–718 (2004)]
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.