Search results for " Complexity"
showing 10 items of 623 documents
Exact results for accepting probabilities of quantum automata
2001
One of the properties of Kondacs-Watrous model of quantum finite automata (QFA) is that the probability of the correct answer for a QFA cannot be amplified arbitrarily. In this paper, we determine the maximum probabilities achieved by QFAs for several languages. In particular, we show that any language that is not recognized by an RFA (reversible finite automaton) can be recognized by a QFA with probability at most 0.7726...
Amount of nonconstructivity in deterministic finite automata
2010
AbstractWhen D. Hilbert used nonconstructive methods in his famous paper on invariants (1888), P. Gordan tried to prevent the publication of this paper considering these methods as non-mathematical. L.E.J. Brouwer in the early twentieth century initiated intuitionist movement in mathematics. His slogan was “nonconstructive arguments have no value for mathematics”. However, P. Erdös got many exciting results in discrete mathematics by nonconstructive methods. It is widely believed that these results either cannot be proved by constructive methods or the proofs would have been prohibitively complicated. The author (Freivalds, 2008) [10] showed that nonconstructive methods in coding theory are…
Tracking evolutionary trends towards increasing complexity: a case study in Cyanobacteria
2020
AbstractProgressive evolution, the tendency towards increasing complexity, is a controversial issue in Biology, whose resolution requires a proper measurement of complexity. Genomes are the best entities to address this challenge, as they record the history and information gaining of organisms in their ongoing biotic and environmental interactions. Using six metrics of genome complexity, none of which is primarily associated to biological function, we measure genome complexity in 91 genomes from the phylum Cyanobacteria. Several phylogenetic analyses reveal the existence of progressive evolution towards higher genome complexity: 1) all the metrics detect strong phylogenetic signals; 2) ridg…
Strategic Management Simulations: the German Case
1995
This chapter initially considers the rationale and potential value of games and simulations for managerial and executive assessment. Several shortcomings of existing techniques are discussed. In contrast, characteristics of the Strategic Management Simulations (SMS) are described in terms of applicability, reliability, construct validity, predictive validity and other factors. This chapter provides validity information about a German version of the SMS system via a case analysis procedure with two German samples.
Parallel Algorithms for Listing Well-Formed Parentheses Strings
1998
We present two cost-optimal parallel algorithms generating the set of all well-formed parentheses strings of length 2n with constant delay for each generated string. In our first algorithm we generate in lexicographic order well-formed parentheses strings represented by bitstrings, and in the second one we use the representation by weight sequences. In both cases the computational model is based on an architecture CREW PRAM, where each processor performs the same algorithm simultaneously on a different set of data. Different processors can access the shared memory at the same time to read different data in the same or different memory locations, but no two processors are allowed to write i…
Facilitating Access to Health Web Pages with Different Language Complexity Levels
2019
The number of people looking for health information on the Internet is constantly growing. When searching for health information, different types of users, such as patients, clinicians or medical researchers, have different needs and should easily find the information they are looking for based on their specific requirements. However, generic search engines do not make any distinction among the users and, often, overload them with the provided amount of information. On the other hand, specific search engines mostly work on medical literature and specialized web sites are often not free and contain focused information built by hand. This paper presents a method to facilitate the search of he…
Assessing complexity in learning outcomes : a comparison between the SOLO taxonomy and the model of hierarchical complexity
2015
An important aspect of higher education is to educate students who can manage complex relationships and solve complex problems. Teachers need to be able to evaluate course content with regard to complexity, as well as evaluate students’ ability to assimilate complex content and express it in the form of a learning outcome. One model for evaluating complexity is the Structure of Observed Learning Outcomes (SOLO) taxonomy. The aim of this analysis is to address the limitations of the SOLO taxonomy in detecting the more subtle differences of the learning outcomes and to clarify the concept of learning modes. This is done by analysing the SOLO taxonomy by means of the model of hierarchical comp…
The Anthropological Setting of Polysynthesis
2017
Abstract A sociolinguistically oriented study of polysynthesis literature reveals one rather striking observation. Varieties often cited as being incontrovertibly polysynthetic include languages from many different language families and different areas of the world. But many of these languages have a number of social characteristics in common: they are spoken in relatively small, traditional, non-industrialized communities, over relatively small territories. This chapter suggests that this is not a coincidence. There seems to be considerable agreement in the literature, for instance, that polysynthetic languages are ‘highly’, ‘extremely’, or ‘extraordinarily’ complex. And the literature on …
Quantum search of spatial regions
2003
Can Grover's algorithm speed up search of a physical region - for example a 2-D grid of size sqrt(n) by sqrt(n)? The problem is that sqrt(n) time seems to be needed for each query, just to move amplitude across the grid. Here we show that this problem can be surmounted, refuting a claim to the contrary by Benioff. In particular, we show how to search a d-dimensional hypercube in time O(sqrt n) for d at least 3, or O((sqrt n)(log n)^(3/2)) for d=2. More generally, we introduce a model of quantum query complexity on graphs, motivated by fundamental physical limits on information storage, particularly the holographic principle from black hole thermodynamics. Our results in this model include a…
Reconfigurable electrical interconnection strategies for photovoltaic arrays: A review
2014
Non-uniform irradiance significantly decreases the power delivered by solar photovoltaic arrays. A promising technique for compensating these power losses relies on dynamically reconfiguring the electrical connections between photovoltaic modules. This paper presents the current state-of-the-art strategies for photovoltaic array reconfiguration in order to increase the power output under partial shading and mismatch conditions. The different approaches have been compared in terms of effectiveness of the control algorithms, monitored electrical and environmental variables, overall hardware complexity and specific features of each solution. Finally, the most challenging aspects of the reconfi…