Root-locus practical sketching rules for fractional-order system

For integer-order systems, there are well-known practical rules for RL sketching. Nevertheless, these rules cannot be directly applied to fractional-order (FO) systems. Besides, the existing literature on this topic is scarce and exclusively focused on commensurate systems, usually expressed as the ratio of two noninteger polynomials. The practical rules derived for those do not apply to other symbolic expressions, namely, to transfer functions expressed as the ratio of FO zeros and poles. However, this is an important case as it is an extension of the classical integer-order problem usually addressed by control engineers. Extending the RL practical sketching rules to such FO systems will contribute to decrease the lack of intuition about the corresponding system dynamics. This paper generalises several RL practical sketching rules to transfer functions specified as the ratio of FO zeros and poles. The subject is presented in a didactic perspective, being the rules applied to several examples.

Multidimensional scaling for orthodontic root resorption

The paper investigates the risk factors for the severity of orthodontic root resorption. The multidimensional scaling (MDS) visualization method is used to investigate the experimental data from patients who received orthodontic treatment at the Department of Orthodontics and Dentofacial Orthopedics, Faculty of Dentistry, “Carol Davila” University of Medicine and Pharmacy, during a period of 4 years. The clusters emerging in the MDS plots reveal features and properties not easily captured by classical statistical tools. The results support the adoption of MDS for tackling the dentistry information and overcoming noise embedded into the data. The method introduced in this paper is rapid, efficient, and very useful for treating the risk factors for the severity of orthodontic root resorption.

Pre-run-time schedulability analysis of P-NET fieldbus networks

P-NET is a fieldbus industrial communication standard, which uses a Virtual Token Passing MAC mechanism. In this paper we establish pre-run-time schedulability conditions for supporting real-time traffic with P-NET. Essentially we provide formulae to evaluate the minimum message deadline, ensuring the transmission of real-time messages within a maximum time bound

Run-time monitoring approach for the shark kernel

Typically common embedded systems are designed with high resource constraints. Static designs are often chosen to address very specific use cases. On contrast, a dynamic design must be used if the system must supply a real-time service where the input may contain factors of indeterminism. Thus, adding new functionality on these systems is often accomplished by higher development time, tests and costs, since new functionality push the system complexity and dynamics to a higher level. Usually, these systems have to adapt themselves to evolving requirements and changing service requests. In this perspective, run-time monitoring of the system behaviour becomes an important requirement, allowing to dynamically capturing the actual scheduling progress and resource utilization. For this to succeed, operating systems need to expose their internal behaviour and state, making it available to the external applications, usually using a run-time monitoring mechanism. However, such mechanism can impose a burden in the system itself if not wisely used. In this paper we explore this problem and propose a framework, which is intended to provide this run-time mechanism whilst achieving code separation, run-time efficiency and flexibility for the final developer.

Root locus of fractional linear systems

In this paper an algorithm for the calculation of the root locus of fractional linear systems is presented. The proposed algorithm takes advantage of present day computational resources and processes directly the characteristic equation, avoiding the limitations revealed by standard methods. The results demonstrate the good performance for different types of expressions.

A self-healing real-time system based on run-time self-reconfiguration

The new generations of SRAM-based FPGA (field programmable gate array) devices are the preferred choice for the implementation of reconfigurable computing platforms intended to accelerate processing in real-time systems. However, FPGA's vulnerability to hard and soft errors is a major weakness to robust configurable system design. In this paper, a novel built-in self-healing (BISH) methodology, based on run-time self-reconfiguration, is proposed. A soft microprocessor core implemented in the FPGA is responsible for the management and execution of all the BISH procedures. Fault detection and diagnosis is followed by repairing actions, taking advantage of the dynamic reconfiguration features offered by new FPGA families. Meanwhile, modular redundancy assures that the system still works correctly

On-line defragmentation for run-time partially reconfigurable FPGAs

Dynamically reconfigurable systems have benefited from a new class of FPGAs recently introduced into the market, which allow partial and dynamic reconfiguration at run-time, enabling multiple independent functions from different applications to share the same device, swapping resources as needed. When the sequence of tasks to be performed is not predictable, resource allocation decisions have to be made on-line, fragmenting the FPGA logic space. A rearrangement may be necessary to get enough contiguous space to efficiently implement incoming functions, to avoid spreading their components and, as a result, degrading their performance. This paper presents a novel active replication mechanism for configurable logic blocks (CLBs), able to implement on-line rearrangements, defragmenting the available FPGA resources without disturbing those functions that are currently running.

Manutenção de colônia de anopheles darlingi root, 1926, em laboratório

Descreve-se a instalação e manutenção inicial de uma colônia de An. darlingi, no município de Araraquara, SP, como parte do programa de pesquisas em malária da Superintendência de Controle de Endemias - SUCEN. Participando-se de experiência semelhante descrita por CORRÊA na década de 70, apresenta as modificações sugeridas por outros autores e pela experiência de seis meses de funcionamento. A perspectiva c dc desenvolvimento de uma colônia com simplificações de técnicas e equipamentos. São dadas informações sobre alimentação de larvas e alados, duração dos estádios larvais, mortalidade e acasalamento.

Long-run consumption risk with durable goods : UK evidence for equity and bond markets

"It is a widely accepted fact that the consumption-based capital asset pricing model (CCAPM) fails to provide a good explanation of many important features of the behaviour of financial market returns in a large range of countries over a long period of time. However, within a representative consumer/investor model, it is hard to see how the basic structure of the consumption based model can be safely abandoned." [introdução]

Run-time defragmentation for dynamically reconfigurable hardware

Reconfigurable computing experienced a considerable expansion in the last few years, due in part to the fast run-time partial reconfiguration features offered by recent SRAM-based Field Programmable Gate Arrays (FPGAs), which allowed the implementation in real-time of dynamic resource allocation strategies, with multiple independent functions from different applications sharing the same logic resources in the space and temporal domains. However, when the sequence of reconfigurations to be performed is not predictable, the efficient management of the logic space available becomes the greatest challenge posed to these systems. Resource allocation decisions have to be made concurrently with system operation, taking into account function priorities and optimizing the space currently available. As a consequence of the unpredictability of this allocation procedure, the logic space becomes fragmented, with many small areas of free resources failing to satisfy most requests and so remaining unused. A rearrangement of the currently running functions is therefore necessary, so as to obtain enough contiguous space to implement incoming functions, avoiding the spreading of their components and the resulting degradation of system performance. A novel active relocation procedure for Configurable Logic Blocks (CLBs) is herein presented, able to carry out online rearrangements, defragmenting the available FPGA resources without disturbing functions currently running.

Undoubtable signs of CP-violation in Higgs decays at the LHC run 2

With the discovery of the Higgs boson at the Large Hadron Collider the high energy physics community's attention has now turned to understanding the properties of the Higgs boson, together with the hope of finding more scalars during run 2. In this work we discuss scenarios where using a combination of three decays, involving the 125 GeV Higgs boson, the Z boson and at least one more scalar, an indisputable signal of CP-violation arises. We use a complex two-Higgs doublet model as a reference model and present some benchmark points that have passed all current experimental and theoretical constraints, and that have cross sections large enough to be probed during run 2.

A Novel Run-Time Monitoring Architecture for Safe and Efficient Inline Monitoring

20th International Conference on Reliable Software Technologies - Ada-Europe 2015 (Ada-Europe 2015), Madrid, Spain.

Toward a Run-Time Verification Framework for Real-Time Safety-Critical Systems

Presented at SEMINAR "ACTION TEMPS RÉEL:INFRASTRUCTURES ET SERVICES SYSTÉMES". 10, Apr, 2015. Brussels, Belgium.