Low-latency atomic broadcast in the presence of contention

The Atomic Broadcast algorithm described in this paper can deliver messages in two communication steps, even if multiple processes broadcast at the same time. It tags all broadcast messages with the local real time, and delivers all messages in the order of these timestamps. Both positive and negative statements are used: “m broadcast at time 51” vs. “no messages broadcast between times 31 and 51”. To prevent crashed processes from blocking the system, the -elected leader broadcasts negative statements on behalf of the processes it suspects () to have crashed. A new cheap Generic Broadcast algorithm is used to ensure consistency between conflicting statements. It requires only a majority of correct processes (n > 2f) and, in failure-free runs, delivers all non-conflicting messages in two steps. The main algorithm satisfies several new lower bounds, which are proved in this paper.     

Behaviour based on decision matrices for a coordination between agents in a urban traffic simulation

This paper describes a multi-agent coordination mechanism applied to intersection simulation situations. In a goal of urban traffic simulation, we must consider the dynamic interactions between autonomous vehicles. The field of multi-agent systems provides us some studies for such systems, in particular on the coordination mechanisms. Conflicts between vehicles (i.e. agents) are very frequent in such applications, and they may cause deadlocks, particularly at intersections such as crossroads. Our approach is based on the solving of two player games/decision matrices which characterize three basic situations. An aggregation method generalizes to n-player games for complex crossroads. The objective of this approach consists in searching basic two-player matrices for solving n-agent problems. To explain the principle, we describe our approach for a particular case of crossroad with three agents. Finally, the obtained results have been examined via a tool of road traffic simulation, ARCHISIM. We assume also that the global traffic replicates the behavior of agents in different situations.     

Diagnosability Analysis of a Class of Hierarchical State Machines

This paper addresses the problem of fault detection and isolation for a particular class of discrete event dynamical systems called hierarchical finite state machines (HFSMs). A new version of the property of diagnosability for discrete event systems tailored to HFSMs is introduced. This notion, called L₁-diagnosability, captures the possibility of detecting an unobservable fault event using only high level observations of the behavior of an HFSM. Algorithms for testing L₁-diagnosability are presented. In addition, new methodologies are presented for studying the diagnosability properties of HFSMs that are not L₁-diagnosable. These methodologies avoid the complete expansion of an HFSM into its corresponding flat automaton by focusing the expansion on problematic indeterminate cycles only in the associated extended diagnoser.

Dynamique des lasers à fibre dopée à I’erbium

The dynamics of the erbium doped fiber laser is analysed both experimentally and theoretically. This laser operates spontaneously in self-pulsing, in sinusoidal or in CW regime. Experiments have allowed to determine the control parameters : the cavity losses, the pumping rate and the ion pairs concentration. An antiphase dynamics is observed when the laser operates simultaneously at 1.55 µn and 1.536 µm. The self-pulsing behavior is attributed to a fast energy transfer which occurs between two neighboring ions (pair induced quenching). A simple model considering the active medium as a mixture of isolated ions and ions pairs is developped and leads to a good qualitative agreement with the experimental results.     

Casein kinase 2 down-regulation and activation by polybasic peptides are mediated by acidic residues in the 55-64 region of the beta-subunit. A study with calmodulin as phosphorylatable substrate

The noncatalytic beta-subunit is responsible for the latency of casein kinase 2 (CK2) activity toward calmodulin. Twenty-one mutants of the beta-subunit bearing either deletions or Ala substitutions for charged residues in the 5-6, 55-70, and 171-178 sequences have been assayed for their ability to substitute for wild-type beta-subunit as a suppressor of activity toward calmodulin. The only mutations that reduced the ability of the beta-subunit to suppress calmodulin phosphorylation activity, though being compatible with normal reconstitution of CK2 holoenzyme, were those affecting Asp55, Glu57 and the whole triplet Glu59-Asp-Glu61. The activity of CK2 holoenzyme, either native or reconstituted, toward calmodulin can be elicited by a variety of polybasic effectors, including polylysine, polyarginine, salmine, and histones H4, H3, and, to a lesser extent, H2a and H2b. Histone H1 and polyamines are conversely ineffective. The latent "calmodulin kinase" activity of CK2 can also be specifically unmasked by a peptide (alpha[66-86]) reproducing a basic insert of the catalytic subunit. This effect is reversed by equimolar addition of a peptide (beta[55-71]) including the 55-64 acidic stretch of the beta-subunit. Comparable polylysine stimulation was observed with the holoenzymes reconstituted with either beta wt or the beta mutants capable of assembling with the alpha-subunit, with the notable exception of those bearing Ala substitutions for acidic residues at positions 55, 57, and 59-61. These were nearly insensitive to 42 nM polylysine, which conversely promotes a more than 10-fold increase of calmodulin phosphorylation with wild-type beta.(ABSTRACT TRUNCATED AT 250 WORDS)     

Supervisory control using variable lookahead policies

This paper deals with the efficient on-line calculation of supervisory controls for discrete event systems (DES's) in the framework of limited lookahead control policies (or LLPs) that we introduced in previous papers. In the LLP scheme, the control action after a given trace of events has been executed is calculated on-line on the basis of anN-step ahead projection of the behavior of the DES. To compute these controls, one must calculate after the execution of each event the supremal controllable sublanguage of a finite language with respect to another finite larger language. In our previous work, we showed how the required supremal controllable sublanguage calculation can be performed by using a backward dynamic programming algorithm over the nodes of the tree representation of these two languages. In this paper, we pursue the same approach for the calculation of LLP controls, but instead we adopt a forward calculation procedure over theN-level tree of interest. This forward procedure improves upon previous work by avoiding the explicit consideration of all the nodes of theN-level tree, while still permitting tree-to-tree recursiveness as enabled events are executed by the system. The forward search ends whenever a control decision can be made unambiguously or whenever the boundary of theN-level tree is reached, whichever comes first. This motivates the name Variable Lookahead Policy (or VLP) for this implementation of the LLP supervisory control scheme. This paper presents a general VLP algorithm and studies the properties of several special cases of it. The paper also discusses the implementation of the VLP algorithms and presents computational results regarding the application of these algorithms to a time-varying DES.     

Long short-term cognitive networks

Neural Computing and Applications - In this paper, we present a recurrent neural system named long short-term cognitive networks (LSTCNs) as a generalization of the short-term cognitive network...     

Nano-Scratching resistance of high-chromium white cast iron and its correlation with wear of cBN tool in machining

In this paper, a nano-scratch testing approach was used to measure and evaluate the abrasion wear resistance of high-chromium white cast irons in order to understand the wear mechanism in the interaction between the high-chromium white cast iron and the cBN cutting tool during the machining process. Scratch testing was performed on a nanoindentation instrument using a diamond indenter as the scratch tool. Linear multi-pass scratches in the same path were made on pre-worn surfaces of test materials. The correlation of the scratching resistance and tool wear measured from the machining is presented by the flank wear and maximum scratch depth. The appearance of the cutting edge on a cBN tool suggests that the abrasion wear is mainly related with a combined effect of the carbides and the matrix during machining the high-chromium white cast iron.     

Psychosocial aspects of children and families treated with hemodialysis

Introduction: The aim of this study was to analyze the selected psychosocial aspects of chronic kidney disease in children treated with hemodialysis (HD). Methods: The study included 25 children treated with HD aged 2 to 18 years and their parents. Data concerning the illness and socio‐demographic parameters was collected. We used the Paediatric Quality of Life Inventory (PedsQL) for patients and for their parents the PedsQL‐proxy version, General Health Questionnaire (GHQ‐12), Berlin Social Support Scales (BSSS), and the Caregivers Burden Scale (CBS) to evaluate health‐related quality of life (QoL) of HD children and their primary caregivers. Findings: In the PedsQL test, the QoL of HD children was lower than in healthy children. Children treated with HD assessed their QoL on the PedsQL questionnaire higher than the primary caregivers, on all subscales as well as an overall health‐related QoL. Scoring below 2 on the GHQ‐12 test was reported in 56% of mothers, which may indicate that psychological symptoms have intensified. There was no correlation between BSSS, CBS, and GHQ‐12. Discussion: The assessment of QoL in pediatric patients would allow for the earliest possible identification of their nonsomatic problems and irregularities. This could, consequently, contribute to improving QoL in both children with chronic kidney disease and their families.