Vectorial Languages and Linear Temporal Logic

International audienceDetermining for a given deterministic complete automaton the sequence of visited states while reading a given word is the core of important problems with automata-based solutions, such as approximate string matching. The main difficulty is to do this computation efficiently, especially when dealing with very large texts. Considering words as vectors and working on them using vectorial (parallel) operations allows to solve the problem faster than in linear time using sequential computations. In this paper, we show first that the set of vectorial operations needed by an algorithm representing a given automaton depends only on the language accepted by the automaton. We give precise characterizations of vectorial algorithms for star-free, solvable and regular languages in terms of the vectorial operations allowed. We also consider classes of languages associated with restricted sets of vectorial operations and relate them with languages defined by fragments of linear temporal logic. Finally, we consider the converse problem of constructing an automaton from a given vectorial algorithm. As a byproduct, we show that the satisfiability problem for some extensions of linear-time temporal logic characterizing solvable and regular languages is PSPACE-complete

Acute Infections and Environmental Exposure to Organochlorines in Inuit Infants from Nunavik

The Inuit population of Nunavik (Canada) is exposed to immunotoxic organochlorines (OCs) mainly through the consumption of fish and marine mammal fat. We investigated the effect of perinatal exposure to polychlorinated biphenyls (PCBs) and dichlorodiphenyldichloroethylene (DDE) on the incidence of acute infections in Inuit infants. We reviewed the medical charts of a cohort of 199 Inuit infants during the first 12 months of life and evaluated the incidence rates of upper and lower respiratory tract infections (URTI and LRTIs, respectively), otitis media, and gastrointestinal (GI) infections. Maternal plasma during delivery and infant plasma at 7 months of age were sampled and assayed for PCBs and DDE. Compared to rates for infants in the first quartile of exposure to PCBs (least exposed), adjusted rate ratios for infants in higher quartiles ranged between 1.09 and 1.32 for URTIs, 0.99 and 1.39 for otitis, 1.52 and 1.89 for GI infections, and 1.16 and 1.68 for LRTIs during the first 6 months of follow-up. For all infections combined, the rate ratios ranged from 1.17 to 1.27. The effect size was similar for DDE exposure but was lower for the full 12-month follow-up. Globally, most rate ratios were > 1.0, but few were statistically significant (p < 0.05). No association was found when postnatal exposure was considered. These results show a possible association between prenatal exposure to OCs and acute infections early in life in this Inuit population

On Second-Order Monadic Monoidal and Groupoidal Quantifiers

We study logics defined in terms of second-order monadic monoidal and groupoidal quantifiers. These are generalized quantifiers defined by monoid and groupoid word-problems, equivalently, by regular and context-free languages. We give a computational classification of the expressive power of these logics over strings with varying built-in predicates. In particular, we show that ATIME(n) can be logically characterized in terms of second-order monadic monoidal quantifiers

The new scalar politics of evaluation: An emerging governance role for evaluation

In this article we analyze how roles for evaluation are described and argued for in key texts produced and/or promoted by three influential international networks: the High Level Forum on Aid Effectiveness; the Organisation for Economic Cooperation and Development Assistance Committee’s Network on Development Evaluation; and the Network of Networks for Impact Evaluation. We contend that these complex multilateral networks are working supranationally through soft power to promote: common standards of evaluation practice; a dominant model of evaluation (impact evaluation); and new evaluation roles, relationships and practices for the field of development. Moreover, we argue that this emerging complex multilateral agenda for evaluation may position evaluation and evaluators within a global governance strategy allowing greater influence to international development organizations. We conclude with a discussion of the implications of the analysis for evaluators working in the field of international development

Pine cone scale-inspired motile origami

Stimuli-sensitive hydrogels have received attention because of their potential applications in various fields. Stimuli-directed motion offers many practical applications, such as in drug delivery systems and actuators. Directed motion of asymmetric hydrogels has long been designed; however, few studies have investigated the motion control of symmetric hydrogels. We designed a pine cone scale-inspired movable temperature-sensitive symmetric hydrogel that contains Fe3O4. Alignment of Fe3O4 along the magnetic force is key in motion control in which Fe3O4 acts like fibers in a pine cone scale. Although a homogeneous temperature-sensitive hydrogel cannot respond to a temperature gradient, the Fe3O4-containing hydrogel demonstrates considerable bending motion. Varying degrees and directions of motion are easily facilitated by controlling the amount and alignment angle of the Fe3O4. The shape of the hydrogel layer also influences the morphological structure. This study introduced facile and low-cost methods to control various bending motions. These results can be applied to many fields of engineering, including industrial engineering.111Ysciescopu

Regular languages in NC1

We give several characterizations, in terms of formal logic, semigroup theory, and operations on languages, of the regular languages in the circuit complexity class AC0, thus answering a question of Chandra, Fortune, and Lipton. As a by-product, we are able to determine effectively whether a given regular language is in AC0 and to solve in part an open problem originally posed by McNaughton. Using recent lower-bound results of Razborov and Smolensky, we obtain similar characterizations of the family of regular languages recognized by constant-depth circuit families that include unbounded fan-in mod p addition gates for a fixed prime p along with unbounded fan-in boolean gates. We also obtain logical characterizations for the class of all languages recognized by nonuniform circuit families in which mod m gates (where m is not necessarily prime) are permitted. Comparison of this characterization with our previous results provides evidence for a conjecture concerning the regular languages in this class. A proof of this conjecture would show that computing the bit sum modulo p, where p is a prime not dividing m, is not AC0-reducible to addition mod m, and thus that MAJORITY is not AC0-reducible to addition mod m.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/30017/1/0000385.pd