2,161 research outputs found
Evaluation of Burst Failure Robustness of Control Systems in the Fog
Get PDFThis paper investigates the robustness of control systems when a controller is run in a Fog environment. Control systems in the Fog are introduced and a discussion regarding relevant faults is presented. A preliminary investigation of the robustness properties of a MinSeg case study is presented and commented. The discussion is then used to outline future lines of research
Postal de Claudio Vivas a Maruja Vieira, junio 23 de 1955
No full textPostal de Claudio Vivas a Maruja Vieira, felicitándola por el reconocimiento que le fue otorgado a la autora de poemasPostcard from Claudio Vivas to Maruja Vieira, congratulating her for the recognition given to the author of poems.Publicación, fondo Maruja Vieira, carpeta 1, folio
QRT FIFO automata, breadth-first grammars and their relations.
No full textAbstractSome classes of queue automata (deterministic and nondeterministic), i.e. machines equipped with one or more FIFO tapes, and corresponding languages are considered. For quasi-real-time (QRT) deterministic machines, recognition power, closure properties and counting capabilities are studied. For such machines, by showing that the language LJ=∪Jj=1 Lj, Lj={ban1b…aNJcaNJb} can be recognized with J queues but not with fewer, an infinite hierarchy theorem, which contradicts the known results for nondeterministic machines, is proved. Restricted palindromes can be recognized with two queues.We introduce a generative system for some queue languages, the breadth-first context-free grammars (BCF), which are the same as context-free grammars but for the ordering of terminals which is breadth-first, i.e. the least recently produced nonterminal symbol must be rewritten first. BCF languages are recognized essentially by stateless queue automata; they are semilinear, closed with respect to permutation and homomorphism, but not with respect to intersection with regular sets. A periodicity property (pumping lemma) is proved for BCF languages, whence comparisons with other families are obtained.Finally, a homomorphic characterization of any queue language is presented: L=h(R∩B), where h is a homomorphism (nonerasing if L is QRT), R a regular set and B a BCF language. The result can be extended to multiqueue automata
Bacterial endosymbiont localization in Hyalesthes obsoletus, the insect vector of Bois Noir in Vitis vinifera
Get PDFElena Gonella1, Ilaria Negri1, Massimo Marzorati2†, Mauro Mandrioli3, Luciano Sacchi4, Massimo Pajoro1, Elena Crotti2, Emanuela Clementi4, Rosemarie Tedeschi1, Claudio Bandi5, Alberto Alma1* and Daniele Daffonchio2
DMAC: Deadline-Miss-Aware Control
Get PDFThe real-time implementation of periodic controllers requires solving a co-design problem, in which the choice of the controller sampling period is a crucial element. Classic design techniques limit the period exploration to safe values, that guarantee the correct execution of the controller alongside the remaining real-time load, i.e., ensuring that the controller worst-case response time does not exceed its deadline. This paper presents DMAC: the first formally-grounded controller design strategy that explores shorter periods, thus explicitly taking into account the possibility of missing deadlines. The design leverages information about the probability that specific sub-sequences of deadline misses are experienced. The result is a fixed controller, that on average works as the ideal clairvoyant time-varying controller that possesses knowledge of deadline hits and misses. We obtain a safe estimate of the hit and miss events using the scenario theory, that allows us to provide probabilistic guarantees. The paper analyzes controllers implemented using the Logical Execution Time paradigm and three different strategies to handle deadline miss events: killing the job, letting the job continue but skipping the next activation, and letting the job continue using a limited queue of jobs. Our experimental results show that our design proposal – i.e., that exploring the space where deadline can be missed and handled with different strategies – greatly outperforms classical control design techniques
“Dialogue between Translators and Authors. The Example of Claudio Magris”
No full textThe paper focuses on the forms of cooperation between authors and their translator(s) in all cases in which the two operate simultaneously. This issue is explored on the example of the Trieste-born author Claudio Magris, who cultivates a very close relationship with most of his translators.
Writing and translation have been coexisting in this author throughout his career and have resulted in the heightened sensitivity of Magris the author with regards to translation, as the first part of the analysis shows. The second part describes the dialogue between Magris and the translators of his works, and ends with the more general question of the significance and role of such a form of exchange
Consideraciones sobre la poética de Claudio Rodríguez
Get PDFThe purpose of this paper is to study the poetics of Claudio Rodríguez, delimiting its components and trying to clarify them and to present them as a whole. The author left some pages written on his conception of poetry that encourage reflection and, in some cases, interpretation. So with his conception of poetry as a gift and inebriation, as an alliance and condemnation or celebration (giving title to his collections of poems), or with notions such as «participation», «living contemplation», «living expression » or «personal rhythm» that make up his way of understanding the poetic process.El propósito de este artículo es estudiar la poética de Claudio Rodríguez, deslindando sus componentes y tratando de clarificarlos y presentarlos en su conjunto. El autor dejó escritas algunas páginas sobre su concepción de la poesía que animan a la reflexión y, en algunos casos, a la interpretación. Así sucede con su concepción de la poesía como un don y una ebriedad, como alianza y condena o como celebración (que dan título a sus poemarios), o con nociones como las de «participación», «contemplación viva», «expresión viva» o «ritmo personal», que configuran su forma de entender el proceso poético
Dynamic Models for the Formal Verification of Big Data Applications Via Stochastic Model Checking
No full textBig Data Applications (BDAs) manage so much data to require a cluster of machines for computation and storage. Their execution often has temporal constraints, such as deadlines to process the data. BDAs are executed within Big Data Frameworks (BDFs), that provide mechanisms to automatically manage the complexity of the computation distribution. For a BDA to fulfill its deadline when executed in a BDF, online dynamic resource allocation policies should be in place. The introduction of control for such resource allocation calls for formal verification of the closed-loop system. Model checkers verify the correct behaviour of programs, and in principle they could be used to prove properties on the BDF execution. However, the complexity of BDFs makes it infeasible to directly model the BDAs and BDFs. We propose a formalism to associate the execution of a BDA with afirst-principle dynamic simulation model that can be used for model checking in the place of the real application, making the verification viable in practice. We introduce our formalism, apply it to a well assessed framework, and test its capabilities. We show that our solution is able to capture the dynamics and prove properties of the BDA execution using a stochastic model checker
- …
