Narrow Results

We introduce a logic to express structural properties of automata with string inputs and, possibly, outputs in some monoid. In this logic, the set of predicates talking about the output values is parametric. We then consider three particular automata models (finite automata, transducers and automata weighted by integers here called sum-automata) and instantiate the generic logic for each of them. We give tight complexity results for the three logics with respect to the model-checking problem, depending on whether the formula is fixed or not. We study the expressiveness of our logics by expressing classical structural patterns characterising for instance finite ambiguity and polynomial ambiguity in the case of finite automata, determinisability and finite-valuedness in the case of transducers and sum-automata. As a consequence of our complexity results, we directly obtain that these classical properties can be decided in polynomial time.

Viterbi algorithm is the most popular algorithm used to decode the convolution code, but its computational complexity increases exponentially with the increasing constraint length due to a large number of Trellis transitions. However, high constraint length is necessary to improve the accuracy of the decoding process for the high rate convolution code. In particular, the Add-Compare-Select (ACS) module of the Viterbi Decoder will have large numbers of trellis states and trellis transitions with increased constraint lengths, which give rise to high hardware complexity and large power consumption. As the performance of the Viterbi decoder mainly depends on its efficient implementation of the ACS module, in the literature, several methods are presented for the implementation of ACS for the Viterbi decoder. The methods based on Precharge Half Buffer (PCHB) and Weak Conditioned Half Buffer, Shannon’s decomposition circuits, body-biased pseudo-NMOS logic and Quasi Delay Insensitive (QDI) timing model performance is analyzed. The methods are implemented using CMOS technology. In this paper, FinFET and CNTFET-based ACS implementation is performed. From the analysis, it has been found that the Carbon Nanotube-based implementation is better in performance when compared to the CMOS and FinFET technology. The proposed QDI model and retiming circuits for ACS block operate above 1GHz with high driving current and low power.

This paper proposes two probabilistic extensions of variants of the OWL Lite description language, which are essential for advanced applications like information retrieval. The first step follows the axiomatic approach of combining description logics and Horn clauses: Subsets of OWL Lite are mapped in a sound and complete way onto Horn predicate logics (Datalog variants). Compared to earlier approaches, a larger fraction of OWL Lite can be transformed by switching to Datalog with equality in the head; however, some OWL Lite constructs cannot be transformed completely into Datalog. By using probabilistic Datalog, the new probabilistic OWL Lite subsets (both with support for Horn rules) are defined, and the semantics are given by the semantics of the corresponding probabilistic Datalog program. As inference engines for probabilistic Datalog are available, description logics and information retrieval systems can easily be combined.

The knowledge about hidden variables in physics, (Bohr's-Schrödinger theories) and their developments, boundaries seem more and more fuzzy at physical scales. Also some other new theories give to both time and space as much fuzziness. The classical theory, (school of Copenhagen's) and also Heisenberg and Louis de Broglie give us the idea of a dual wave and particle parts such the way we observe. Thus, the Pondichery interpretation recently developed by Cramer and al. gives to the time part this duality. According Cramer, there could be a little more to this duality, some late or advanced waves of time that have been confirmed and admitted as possible solutions with the Maxwell's equations. We developed here a possible pattern that could matched in the sequence between Space and both retarded and advanced time wave in the “Cramer handshake” in locality of the present when the observation is made everything become local.