Search results for "Complexity"
showing 10 items of 1094 documents
Connectivity Influences on Nonlinear Dynamics in Weakly-Synchronized Networks: Insights from Rössler Systems, Electronic Chaotic Oscillators, Model a…
2019
Natural and engineered networks, such as interconnected neurons, ecological and social networks, coupled oscillators, wireless terminals and power loads, are characterized by an appreciable heterogeneity in the local connectivity around each node. For instance, in both elementary structures such as stars and complex graphs having scale-free topology, a minority of elements are linked to the rest of the network disproportionately strongly. While the effect of the arrangement of structural connections on the emergent synchronization pattern has been studied extensively, considerably less is known about its influence on the temporal dynamics unfolding within each node. Here, we present a compr…
On the Evaluation of Images Complexity: A Fuzzy Approach
2006
The inherently multidimensional problem of evaluating the complexity of an image is of a certain relevance in both computer science and cognitive psychology. Computer scientists usually analyze spatial dimensions, to deal with automatic vision problems, such as feature-extraction. Psychologists seem more interested in the temporal dimension of complexity, to explore attentional models. Is it possible, by merging both approaches, to define an more general index of visual complexity? We have defined a fuzzy mathematical model of visual complexity, using a specific entropy function; results obtained by applying this model to pictorial images have a strong correlation with ones from an experime…
One-Counter Verifiers for Decidable Languages
2013
Condon and Lipton (FOCS 1989) showed that the class of languages having a space-bounded interactive proof system (IPS) is a proper subset of decidable languages, where the verifier is a probabilistic Turing machine. In this paper, we show that if we use architecturally restricted verifiers instead of restricting the working memory, i.e. replacing the working tape(s) with a single counter, we can define some IPS’s for each decidable language. Such verifiers are called two-way probabilistic one-counter automata (2pca’s). Then, we show that by adding a fixed-size quantum memory to a 2pca, called a two-way one-counter automaton with quantum and classical states (2qcca), the protocol can be spac…
Modified mode-coupling theory for the collective dynamics of simple liquids
2011
Recently it has been shown that mode-coupling theory, which accounts for the salient features of glassy relaxation near the liquid–glass transition, is also capable of describing the collective excitations of simple liquids away from the glass transition. In order to further improve the agreement between theory and computer simulations on Lennard-Jones argon we modify MCT by taking binary collisions into account. This, in fact, improves the agreement. We also show that multiplying the memory function of the original theory with a reduction factor leads to similar results.
Syntactic complexity in Finnish-background EFL learners’ writing at CEFR levels A1–B2
2022
Eurooppalaisen viitekehyksen (EVK) merkitys kielikoulutukselle on lisännyt tutkimusta sen taitotasojen kielellisistä piirteistä; tarkempi tieto näistä piirteistä auttaisi EVK:n soveltamista opetusmateriaalien, kurssien ja arviointin laatimiseen. Tutkimuksessa selvitettiin eroavatko EVK:n tasot toisistaan syntaksin kompleksisuuden perusteella. Suomalaiset 14- ja 17-vuotiaat englannin oppijat (N=379) kirjoittivat kolme kirjoitelmaa, jotka arvioitiin EVK:n taitotasoille. Arviointiaineisto tutkittiin monitahoisella Rasch-analyysillä ja tekstien piirteet selvitettiin automaattisilla analyysiohjelmilla. Tuloksien perusteella alimpia EVK-tasoja (A1–A2) erotti selvimmin toisistaan lauseiden ja T-yk…
Limits and Criticalities of Predictions and Forecasting in Complex Social and Economic Scenarios: A Cybernetics Key
2014
Predictions play a key role in assuring the status of “rationality” in decisions. Nevertheless, in the field of social sciences and economics, predictions fail to correctly depict the oncoming scenarios. Why is it so difficult to achieve quantitative prediction of social and economic systems? Can science provide reliable predictions of social and economic paths that can be used to implement effective interventions? As in the notorious “El Farol bar problem” depicted by Brian Arthur (Am Econ Rev 84:406–411, 1994), the validity of predictive models is more a social issue than a matter of good mathematics. Predictability in social systems is due to limited knowledge of society and human behavi…
Sphingomonas fennica sp. nov. and Sphingomonas haloaromaticamans sp. nov., outliers of the genus Sphingomonas.
2007
Bacterial isolates obtained from polychlorophenol-contaminated sites in Finland (strain K101T) and from a Dutch drinking water well (strain A175T) were characterized taxonomically. 16S rRNA gene sequence analysis, determination of DNA G+C content, physiological characterization, estimation of the ubiquinone and polar lipid patterns and fatty acid content revealed that strains K101T and A175T were similar to Sphingomonas wittichii RW1T but also showed pronounced differences. The DNA G+C contents of the two novel strains were 63.6 and 66.1 mol%, respectively. On the basis of these results, two novel species of the genus Sphingomonas are described, for which the names Sphingomonas haloaromatic…
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)]