On-Line Instruction-checking in Pipelined Microprocessors

Microprocessors performances have increased by more than five orders of magnitude in the last three decades. As technology scales down, these components become inherently unreliable posing major design and test challenges. This paper proposes an instruction-checking architecture to detect erroneous instruction executions caused by both permanent and transient errors in the internal logic of a microprocessor. Monitoring the correct activation sequence of a set of predefined microprocessor control/status signals allow distinguishing between correctly and not correctly executed instruction

Current and innovative pharmacological options to treat typical and atypical trigeminal neuralgia

Trigeminal neuralgia is a representative neuropathic facial pain condition, characterised by unilateral paroxysmal pain in the distribution territory of one or more divisions of the trigeminal nerve, triggered by innocuous stimuli. A subgroup of patients with trigeminal neuralgia [TN (previously defined as atypical TN)] also suffer from concomitant continuous pain, i.e. a background pain between the paroxysmal attacks. The aim of this review is to provide current, evidence-based, knowledge about the pharmacological treatment of typical and atypical TN, with a specific focus on drugs in development. We searched for relevant papers within PubMed, EMBASE, the Cochrane Database of Systematic Reviews and the Clinical Trials database (ClinicalTrials.gov), taking into account publications up to February 2018. Two authors independently selected studies for inclusions, data extraction, and bias assessment. Carbamazepine and oxcarbazepine are the first-choice drugs for paroxysmal pain. When sodium channel blockers cannot reach full dosage because of side effects, an add-on treatment with lamotrigine or baclofen should be considered. In patients with atypical TN, both gabapentin and antidepressants are expected to be efficacious and should be tried as an add-on to oxcarbazepine or carbamazepine. Although carbamazepine and oxcarbazepine are effective in virtually the totality of patients, they are responsible for side effects causing withdrawal from treatment in an important percentage of cases. A new, better tolerated, Nav1.7 selective state-dependent, sodium channel blocker (vixotrigine) is under development. Future trials testing the effect of combination therapy in patients with TN are needed, especially in patients with concomitant continuous pain and in TN secondary to multiple sclerosis

Mineralisation of 2,4-dichlorophenoxyacetic acid by acoustic or hydrodynamic cavitation in conjunction with the advanced Fenton process

The mineralisation of 2,4-dichlorophenoxyacetic acid (2,4-D) in the presence of zero-valent iron and hydrogen peroxide (the Advanced Fenton process – AFP) whilst being subjected to acoustic or hydrodynamic cavitation is reported. If the reaction is merely stirred then there is 57% removal of TOC whilst on irradiation the figure is 64% although the latter reaction is more rapid. Use of ultrasound alone results in only 11% TOC removal in 60 min of treatment time. Addition of iron powder marginally enhances the extent of degradation but an appreciable increase is observed in the presence of hydrogen peroxide which acts as a source for hydroxyl radicals by Fenton chemistry as well as by dissociation in the presence of ultrasound. The use of hydrodynamic cavitation in conjunction with the advanced Fenton process has also been found to be a useful tool for continuous remediation of water contaminated with 2,4-D. After 20 minutes of treatment the residual TOC is reduced to 30% and this probably represents the remaining highly recalcitrant small organic molecules

Gathering Anonymous, Oblivious Robots on a Grid

We consider a swarm of $n$ autonomous mobile robots, distributed on a 2-dimensional grid. A basic task for such a swarm is the gathering process: All robots have to gather at one (not predefined) place. A common local model for extremely simple robots is the following: The robots do not have a common compass, only have a constant viewing radius, are autonomous and indistinguishable, can move at most a constant distance in each step, cannot communicate, are oblivious and do not have flags or states. The only gathering algorithm under this robot model, with known runtime bounds, needs $\mathcal{O}(n^2)$ rounds and works in the Euclidean plane. The underlying time model for the algorithm is the fully synchronous $\mathcal{FSYNC}$ model. On the other side, in the case of the 2-dimensional grid, the only known gathering algorithms for the same time and a similar local model additionally require a constant memory, states and "flags" to communicate these states to neighbors in viewing range. They gather in time $\mathcal{O}(n)$. In this paper we contribute the (to the best of our knowledge) first gathering algorithm on the grid that works under the same simple local model as the above mentioned Euclidean plane strategy, i.e., without memory (oblivious), "flags" and states. We prove its correctness and an $\mathcal{O}(n^2)$ time bound in the fully synchronous $\mathcal{FSYNC}$ time model. This time bound matches the time bound of the best known algorithm for the Euclidean plane mentioned above. We say gathering is done if all robots are located within a $2\times 2$ square, because in $\mathcal{FSYNC}$ such configurations cannot be solved

Il motore elettrico: un integratore perfetto?

Viene preso in esame l'uso del motore in corrente continua come servomotore e viene presentato un metodo per approssimarne il comportamento a quello di un motore ideale

Statistical Reliability Estimation of Microprocessor-Based Systems

What is the probability that the execution state of a given microprocessor running a given application is correct, in a certain working environment with a given soft-error rate? Trying to answer this question using fault injection can be very expensive and time consuming. This paper proposes the baseline for a new methodology, based on microprocessor error probability profiling, that aims at estimating fault injection results without the need of a typical fault injection setup. The proposed methodology is based on two main ideas: a one-time fault-injection analysis of the microprocessor architecture to characterize the probability of successful execution of each of its instructions in presence of a soft-error, and a static and very fast analysis of the control and data flow of the target software application to compute its probability of success. The presented work goes beyond the dependability evaluation problem; it also has the potential to become the backbone for new tools able to help engineers to choose the best hardware and software architecture to structurally maximize the probability of a correct execution of the target softwar