Search results for "Programming"
showing 10 items of 3090 documents
Probabilities to Accept Languages by Quantum Finite Automata
1999
We construct a hierarchy of regular languages such that the current language in the hierarchy can be accepted by 1-way quantum finite automata with a probability smaller than the corresponding probability for the preceding language in the hierarchy. These probabilities converge to 1/2.
Uncountable classical and quantum complexity classes
2018
It is known that poly-time constant-space quantum Turing machines (QTMs) and logarithmic-space probabilistic Turing machines (PTMs) recognize uncountably many languages with bounded error (A.C. Cem Say and A. Yakaryılmaz, Magic coins are useful for small-space quantum machines. Quant. Inf. Comput. 17 (2017) 1027–1043). In this paper, we investigate more restricted cases for both models to recognize uncountably many languages with bounded error. We show that double logarithmic space is enough for PTMs on unary languages in sweeping reading mode or logarithmic space for one-way head. On unary languages, for quantum models, we obtain middle logarithmic space for counter machines. For binary la…
Numerical approximation of mixed models for digital integrated circuits
1991
To analyse an electrical network many CAD (Computer Aided Design) circuit simulators are available today. The most well-known is probably SPICE -Nagel [1975]. Although this type of simulator is able to precisely compute the transient performances (as delay time), the usage of complete models of devices implies an extremely high time consumption. So, the circuit simulators are unappropriate for the initial stage of VLSI design where a high speed timing analyser (“timing simulator”) is required. To this goal, alternative approaches using either simpler device models or simpler numerical algorithms or easily computable formulae for delay time approximation, have been developed in the past deca…
Timed Sets, Functional Complexity, and Computability
2012
AbstractThe construction of various categories of “timed sets” is described in which the timing of maps is considered modulo a “complexity order”. The properties of these categories are developed: under appropriate conditions they form discrete, distributive restriction categories with an iteration. They provide a categorical basis for modeling functional complexity classes and allow the development of computability within these settings. Indeed, by considering “program objects” and the functions they compute, one can obtain models of computability – i.e. Turing categories – in which the total maps belong to specific complexity classes. Two examples of this are introduced in some detail whi…
Perimeter symmetrization of some dynamic and stationary equations involving the Monge-Ampère operator
2017
We apply the perimeter symmetrization to a two-dimensional pseudo-parabolic dynamic problem associated to the Monge-Ampere operator as well as to the second order elliptic problem which arises after an implicit time discretization of the dynamical equation. Curiously, the dynamical problem corresponds to a third order operator but becomes a singular second order parabolic equation (involving the 3-Laplacian operator) in the class of radially symmetric convex functions. Using symmetrization techniques some quantitative comparison estimates and several qualitative properties of solutions are given.
A diffusion model account of normal and impaired readers.
2004
Acquired aphasics and dyslexics with even very profound word reading impairments have been shown to perform relatively well on the lexical decision task (e.g., Buchanan, Hildebrandt, & MacKinnon, 1999), but direct contrasts with unimpaired participants data is often complicated by extremely long reaction times for patient data. The dissociation between lexical decision and word naming performance shown by these patients is of theoretical importance, and here we present an analysis of processing underlying the lexical decision task. We are able to determine what aspects of performance are affected by acquired aphasics in the lexical decision task. We fit lexical decision data from aphasic pa…
Semantics for Managing Systems in Heterogeneous and Distributed Environment
2002
The problem of legacy systems collaboration is being solved. Particularly we look at the collaboration as workflow in a distributed and heterogeneous environment. Attention is paid to the description of semantics for workflow process definition languages. There are many solutions how semantics can be decomposed into logical fragments, but the problem of obtaining reusable components that are easy to compile into desired specific semantics still remains. We evolve the division of semantics by semantic aspects whose description is based on abstract data types (pre-built components) and connectors (meta-programs to produce the glue code) between them. This paper offers a way in which semantic …
Santa Rosalia, the icon of biodiversity
2010
This article summarizes the results presented in a series of invited contributions which were submitted to celebrate the fiftieth anniversary of publication of the seminal article ‘‘Homage to Santa Rosalia or why are there so many kinds of animals’’ by G.E. Hutchinson. The authors were asked to explore old and new paradigms of biodiversity in aquatic ecosystems. The contributions by Hutchinson in this field are truly landmarks in the history of modern ecological sciences. The authors of the contributed articles, stimulated by one of the most fruitful concept articles in ecology that has appeared over the last half century, have shown that scientific investigation, although still seeking the…
Building Semantic Trees from XML Documents
2016
International audience; The distributed nature of the Web, as a decentralized system exchanging information between heterogeneous sources, has underlined the need to manage interoperability, i.e., the ability to automatically interpret information in Web documents exchanged between different sources, necessary for efficient information management and search applications. In this context, XML was introduced as a data representation standard that simplifies the tasks of interoperation and integration among heterogeneous data sources, allowing to represent data in (semi-) structured documents consisting of hierarchically nested elements and atomic attributes. However, while XML was shown most …
A novel XML document structure comparison framework based-on sub-tree commonalities and label semantics
2012
International audience; XML similarity evaluation has become a central issue in the database and information communities, its applications ranging over document clustering, version control, data integration and ranked retrieval. Various algorithms for comparing hierarchically structured data, XML documents in particular, have been proposed in the literature. Most of them make use of techniques for finding the edit distance between tree structures, XML documents being commonly modeled as Ordered Labeled Trees. Yet, a thorough investigation of current approaches led us to identify several similarity aspects, i.e., sub-tree related structural and semantic similarities, which are not sufficient…