Logic Characterization of Invisibly Structured Languages: The Case of Floyd Languages

Operator precedence grammars define a classical Boolean and deterministic context-free language family (called Floyd languages or FLs). FLs have been shown to strictly include the well-known Visibly Pushdown Languages, and enjoy the same nice closure properties. In this paper we provide a complete characterization of FLs in terms of a suitable Monadic Second-Order Logic. Traditional approaches to logic characterization of formal languages refer explicitly to the structures over which they are interpreted - e.g, trees or graphs - or to strings that are isomorphic to the structure, as in parenthesis languages. In the case of FLs, instead, the syntactic structure of input strings is “invisible” and must be reconstructed through parsing. This requires that logic formulae encode some typical context-free parsing actions, such as shift-reduce ones

The PAPAGENO Parallel-Parser Generator

The increasing use of multicore processors has deeply transformed computing paradigms and applications. The wide availability of multicore systems had an impact also in the field of compiler technology, although the research on deterministic parsing did not prove to be effective in exploiting the architectural advantages, the main impediment being the inherent sequential nature of traditional LL and LR algorithms. We present PAPAGENO, an automated parser generator relying on operator precedence grammars. We complemented the PAPAGENO-generated parallel parsers with parallel lexing techniques, obtaining near-linear speedups on multicore machines, and the same speed as Bison parsers on sequential execution

Attribute grammar evolution

The final publication is available at Springer via http://dx.doi.org/10.1007/11499305_19Proceedings of First International Work-Conference on the Interplay Between Natural and Artificial Computation, IWINAC 2005, Las Palmas, Canary Islands, Spain, June 15-18, 2005This paper describes Attribute Grammar Evolution (AGE), a new Automatic Evolutionary Programming algorithm that extends standard Grammar Evolution (GE) by replacing context-free grammars by attribute grammars. GE only takes into account syntactic restrictions to generate valid individuals. AGE adds semantics to ensure that both semantically and syntactically valid individuals are generated. Attribute grammars make it possible to semantically describe the solution. The paper shows empirically that AGE is as good as GE for a classical problem, and proves that including semantics in the grammar can improve GE performance. An important conclusion is that adding too much semantics can make the search difficult

Towards the design of a super-language of ALGOL 68 for the Standard Prelude (Excerpt)

The problems concerning SIZETY definitions in an Unabridged Machine-Independent Standard Prelude for ALGOL 68 are examined and tentative solutions are given

Robot life: simulation and participation in the study of evolution and social behavior.

This paper explores the case of using robots to simulate evolution, in particular the case of Hamilton's Law. The uses of robots raises several questions that this paper seeks to address. The first concerns the role of the robots in biological research: do they simulate something (life, evolution, sociality) or do they participate in something? The second question concerns the physicality of the robots: what difference does embodiment make to the role of the robot in these experiments. Thirdly, how do life, embodiment and social behavior relate in contemporary biology and why is it possible for robots to illuminate this relation? These questions are provoked by a strange similarity that has not been noted before: between the problem of simulation in philosophy of science, and Deleuze's reading of Plato on the relationship of ideas, copies and simulacra

Direct flux and current vector control for induction motor drives using model predictive control theory

The study presents the direct flux and current vector control of an induction motor (IM) drive, which is a relatively newer and promising control strategy, through the use of model predictive control (MPC) techniques. The results highlight that the fast flux control nature of direct flux control strategy is further enhanced by MPC. Predictive control is applied in two of its variants, namely the finite control set and modulated MPC, and the advantages and limitations of the two are underlined. This work also highlights, through experimental results, the importance of prioritising the flux part of the cost function which is particularly significant in the case of an IM drive. The performance of the MPC-based approach is compared with the proportional-integral controller, which also prioritises the flux control loop, under various operating regions of the drive such as in the flux-weakening regime. Simulations show the performance expected with different control strategies which is then verified through experiments

First-Order Logic Definability of Free Languages

Operator Precedence Grammars (OPGs) define a deterministic class of context-free languages, which extend input-driven languages and still enjoy many properties: they are closed w.r.t. Boolean operations, concatenation and Kleene star; the emptiness problem is decidable; they are recognized by a suitable model of pushdown automaton; they can be characterized in terms of a monadic second-order logic. Also, they admit efficient parallel parsing. In this paper we introduce a subclass of OPGs, namely Free Grammars (FrGs); we prove some of its basic properties, and that, for each such grammar G, a first-order logic formula ψ can effectively be built so that L(G) is the set of all and only strings satisfying ψ. FrGs were originally introduced for grammatical inference of programming languages. Our result can naturally boost their applicability; to this end, a tool is made freely available for the semiautomatic construction of FrGs

Clinical relevance of biomarkers of oxidative stress

SIGNIFICANCE Oxidative stress is considered to be an important component of various diseases. A vast number of methods have been developed and used in virtually all diseases to measure the extent and nature of oxidative stress, ranging from oxidation of DNA to proteins, lipids, and free amino acids. Recent Advances: An increased understanding of the biology behind diseases and redox biology has led to more specific and sensitive tools to measure oxidative stress markers, which are very diverse and sometimes very low in abundance. CRITICAL ISSUES The literature is very heterogeneous. It is often difficult to draw general conclusions on the significance of oxidative stress biomarkers, as only in a limited proportion of diseases have a range of different biomarkers been used, and different biomarkers have been used to study different diseases. In addition, biomarkers are often measured using nonspecific methods, while specific methodologies are often too sophisticated or laborious for routine clinical use. FUTURE DIRECTIONS Several markers of oxidative stress still represent a viable biomarker opportunity for clinical use. However, positive findings with currently used biomarkers still need to be validated in larger sample sizes and compared with current clinical standards to establish them as clinical diagnostics. It is important to realize that oxidative stress is a nuanced phenomenon that is difficult to characterize, and one biomarker is not necessarily better than others. The vast diversity in oxidative stress between diseases and conditions has to be taken into account when selecting the most appropriate biomarker. Antioxid. Redox Signal. 00, 000-000