Ultimate periodicity of b-recognisable sets : a quasilinear procedure

It is decidable if a set of numbers, whose representation in a base b is a regular language, is ultimately periodic. This was established by Honkala in 1986. We give here a structural description of minimal automata that accept an ultimately periodic set of numbers. We then show that it can verified in linear time if a given minimal automaton meets this description. This thus yields a O(n log(n)) procedure for deciding whether a general deterministic automaton accepts an ultimately periodic set of numbers.Comment: presented at DLT 201

Acting against common bunt: exploration of various control methods

Common bunt (Tilletia caries, Tilletia foetida) is a fungal disease with a large ability to spread. Consequences may be rejection of grains for sale or even a large decrease of yield. Different trials were carried out in organic farming in a research project (funded by the French Ministry of Agriculture between 2008 and 2011) to achieve a better control of common bunt. Results confirm that the resistance of wheat cultivars is a factor to consider. Despite most varieties currently cultivated in organic farming are sensitive to common bunt, some cultivars appeared to be resistant to the races tested. Concerning seed treatment, no product is available for organic farming and 100% efficient; but several solutions have been identified. Only one product is currently authorized for common bunt control on cereals (cerall), it has a significant but sometimes irregular efficiency. Products with acetic acid (white vinegar) or with a base of mustard flour (Tillecur) have similar results. Copper products at low level (reduced to about 500g Cu/t) give a very good level of protection. Before using those solutions, prevention is essential to mobilise, through diversified crop rotations, field observation, seed choice, regular analysis of farm seed, cleaning of machinery

Estimating Bandwidth Requirements using Flow-level Measurements

Bandwidth provisioning is an important task of network management and it is done aiming to meet desired levels of quality of service. Current practices of provisioning are mostly based on rules-of-thumb and use coarse traffic measurements that may lead to problems of under and over dimensioning of links. Several solutions have already been proposed, in which link provisioning is done by measuring and analyzing network traffic at the packet-level. However, high-speed traffic rates as observed nowadays demand scalable measurement solutions. In this regard, flow monitoring seems to be a promising approach. Many software tools and network equipment already provide flow monitoring. But, flows result in inherent information loss due to the aggregation of packets details, i.e. only a summary of traffic characteristics is provided. The poster will present a flow-based approach that overcomes the problem of traffic information loss and enable the use of flows in place of packet measurements for bandwidth provisioning. Among other results we will show that outcomes from the proposed flow-based approach can be as good as the ones obtained with packet-level measurements

INTERACTION BETWEEN ARGON AND DOPANTS IN SPUTTERED a-Si : H

The concentrations of As, B, H, Ar and Si in sputtered a-Si : H are measured by helium Rutherford backscattering and nuclear reactions analysis. Excess or deficit of hydrogen and argon by comparison with intrinsic a-Si : H are found in presence of dopants at high deposition rate. This is related to the plasma deposition method and would suggest micro grain structure in the deposited layer

Enumeration and Decidable Properties of Automatic Sequences

We show that various aspects of k-automatic sequences -- such as having an unbordered factor of length n -- are both decidable and effectively enumerable. As a consequence it follows that many related sequences are either k-automatic or k-regular. These include many sequences previously studied in the literature, such as the recurrence function, the appearance function, and the repetitivity index. We also give some new characterizations of the class of k-regular sequences. Many results extend to other sequences defined in terms of Pisot numeration systems

On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases

This article studies the expressive power of finite automata recognizing sets of real numbers encoded in positional notation. We consider Muller automata as well as the restricted class of weak deterministic automata, used as symbolic set representations in actual applications. In previous work, it has been established that the sets of numbers that are recognizable by weak deterministic automata in two bases that do not share the same set of prime factors are exactly those that are definable in the first order additive theory of real and integer numbers. This result extends Cobham's theorem, which characterizes the sets of integer numbers that are recognizable by finite automata in multiple bases. In this article, we first generalize this result to multiplicatively independent bases, which brings it closer to the original statement of Cobham's theorem. Then, we study the sets of reals recognizable by Muller automata in two bases. We show with a counterexample that, in this setting, Cobham's theorem does not generalize to multiplicatively independent bases. Finally, we prove that the sets of reals that are recognizable by Muller automata in two bases that do not share the same set of prime factors are exactly those definable in the first order additive theory of real and integer numbers. These sets are thus also recognizable by weak deterministic automata. This result leads to a precise characterization of the sets of real numbers that are recognizable in multiple bases, and provides a theoretical justification to the use of weak automata as symbolic representations of sets.Comment: 17 page

Language Emptiness of Continuous-Time Parametric Timed Automata

Parametric timed automata extend the standard timed automata with the possibility to use parameters in the clock guards. In general, if the parameters are real-valued, the problem of language emptiness of such automata is undecidable even for various restricted subclasses. We thus focus on the case where parameters are assumed to be integer-valued, while the time still remains continuous. On the one hand, we show that the problem remains undecidable for parametric timed automata with three clocks and one parameter. On the other hand, for the case with arbitrary many clocks where only one of these clocks is compared with (an arbitrary number of) parameters, we show that the parametric language emptiness is decidable. The undecidability result tightens the bounds of a previous result which assumed six parameters, while the decidability result extends the existing approaches that deal with discrete-time semantics only. To the best of our knowledge, this is the first positive result in the case of continuous-time and unbounded integer parameters, except for the rather simple case of single-clock automata

Recommendations for The Conduct of Economic Evaluations in Osteoporosis: Outcomes of An Experts’ Consensus Meeting Organized by The European Society for Clinical and Economic Aspects of Osteoporosis, Osteoarthritis and Musculoskeletal Diseases (ESCEO) And the US Branch of The International Osteoporosis Foundation

Summary Economic evaluations are increasingly used to assess the value of health interventions, but variable quality and heterogeneity limit the use of these evaluations by decision-makers. These recommendations provide guidance for the design, conduct, and reporting of economic evaluations in osteoporosis to improve their transparency, comparability, and methodologic standards. Introduction This paper aims to provide recommendations for the conduct of economic evaluations in osteoporosis in order to improve their transparency, comparability, and methodologic standards. Methods A working group was convened by the European Society for Clinical and Economic Aspects of Osteoporosis and Osteoarthritis to make recommendations for the design, conduct, and reporting of economic evaluations in osteoporosis, to define an osteoporosis-specific reference case to serve a minimum standard for all economic analyses in osteoporosis, to discuss methodologic challenges and initiate a call for research. A literature review, a face-to-face meeting in New York City (including 11 experts), and a review/approval by a larger group of experts worldwide (including 23 experts in total) were conducted. Results Recommendations on the type of economic evaluation, methods for economic evaluation, modeling aspects, base-case analysis and population, excess mortality, fracture costs and disutility, treatment characteristics, and model validation were provided. Recommendations for reporting economic evaluations in osteoporosis were also made and an osteoporosis-specific checklist was designed that includes items to report when performing an economic evaluation in osteoporosis. Further, 12 minimum criteria for economic evaluations in osteoporosis were identified and 12 methodologic challenges and need for further research were discussed. Conclusion While the working group acknowledges challenges and the need for further research, these recommendations are intended to supplement general and national guidelines for economic evaluations, improve transparency, quality, and comparability of economic evaluations in osteoporosis, and maintain methodologic standards to increase their use by decision-makers

Computer aided synthesis: a game theoretic approach

In this invited contribution, we propose a comprehensive introduction to game theory applied in computer aided synthesis. In this context, we give some classical results on two-player zero-sum games and then on multi-player non zero-sum games. The simple case of one-player games is strongly related to automata theory on infinite words. All along the article, we focus on general approaches to solve the studied problems, and we provide several illustrative examples as well as intuitions on the proofs.Comment: Invitation contribution for conference "Developments in Language Theory" (DLT 2017

European Association of Urology Position Paper on the Prevention of Infectious Complications Following Prostate Biopsy

Funding support: This work is supported by the European Association of Urology Guidelines Office.Peer reviewedPostprin