Influence of pulse repetition rate on temperature rise and working time during composite filling removal with the Er : YAG laser

Objective: The purpose of this study was to assess the efficacy of Er:YAG laser energy for composite resin removal and the influence of pulse repetition rate on the thermal alterations occurring during laser ablation. Materials and Methods: Composite resin filling was placed in cavities (1.0 mm deep) prepared in bovine teeth and the specimens were randomly assigned to five groups according to the technique used for composite filling removal. In group I (controls), the restorations were removed using a high-speed diamond bur. In the other groups, the composite fillings were removed using an Er: YAG laser with different pulse repetition rates: group 2-2 Hz; group 3-4 Hz; group 4-6 Hz; and group 5-10 Hz. The time required for complete removal of the restorative material and the temperature changes were recorded. Results: Temperature rise during composite resin removal with the Er: YAG laser occurred in the substrate underneath the restoration and was directly proportional to the increase in pulse repetition rate. None of the groups had a temperature increase during composite filling removal of more than 5.6 degrees C, which is considered the critical point above which irreversible thermal damage to the pulp may result. Regarding the time for composite filling removal, all the laser-ablated groups (except for group 5 [10 Hz]) required more time than the control group for complete elimination of the material from the cavity walls. Conclusion: Under the tested conditions, Er: YAG laser irradiation was efficient for composite resin ablation and did not cause a temperature increase above the limit considered safe for the pulp. Among the tested pulse repetition rates, 6 Hz produced minimal temperature change compared to the control group (high-speed bur), and allowed composite filling removal within a time period that is acceptable for clinical conditions.

Generalized Coupled Algebraic Riccati Equations for Discrete-time Markov Jump with Multiplicative Noise Systems

In this paper we consider the existence of the maximal and mean square stabilizing solutions for a set of generalized coupled algebraic Riccati equations (GCARE for short) associated to the infinite-horizon stochastic optimal control problem of discrete-time Markov jump with multiplicative noise linear systems. The weighting matrices of the state and control for the quadratic part are allowed to be indefinite. We present a sufficient condition, based only on some positive semi-definite and kernel restrictions on some matrices, under which there exists the maximal solution and a necessary and sufficient condition under which there exists the mean square stabilizing solution fir the GCARE. We also present a solution for the discounted and long run average cost problems when the performance criterion is assumed be composed by a linear combination of an indefinite quadratic part and a linear part in the state and control variables. The paper is concluded with a numerical example for pension fund with regime switching.

Economic design of an X chart for short-run production

The aim of this paper is to present an economical design of an X chart for a short-run production. The process mean starts equal to mu(0) (in-control, State I) and in a random time it shifts to mu(1) > mu(0) (out-of-control, State II). The monitoring procedure consists of inspecting a single item at every m produced ones. If the measurement of the quality characteristic does not meet the control limits, the process is stopped, adjusted, and additional (r - 1) items are inspected retrospectively. The probabilistic model was developed considering only shifts in the process mean. A direct search technique is applied to find the optimum parameters which minimizes the expected cost function. Numerical examples illustrate the proposed procedure. (C) 2009 Elsevier B.V. All rights reserved.

Do Terrestrial Tank Bromeliads in Brazil Create Safe Sites for Palm Establishment or Act as Natural Traps for Its Dispersed Seeds ?

This study shows for the first time that terrestrial tank bromeliads from Brazilian restinga can act as natural traps for dispersed palm Euterpe edulis seeds. Such bromeliads, which are shade intolerant, gain benefits by limiting palm recruitment since they hinder canopy formation and, consequently, increase luminosity over its aggregates.

Practical parallel coset enumeration

Coset enumeration is a most important procedure for investigating finitely presented groups. We present a practical parallel procedure for coset enumeration on shared memory processors. The shared memory architecture is particularly interesting because such parallel computation is both faster and cheaper. The lower cost comes when the program requires large amounts of memory, and additional CPU's. allow us to lower the time that the expensive memory is being used. Rather than report on a suite of test cases, we take a single, typical case, and analyze the performance factors in-depth. The parallelization is achieved through a master-slave architecture. This results in an interesting phenomenon, whereby the CPU time is divided into a sequential and a parallel portion, and the parallel part demonstrates a speedup that is linear in the number of processors. We describe an early version for which only 40% of the program was parallelized, and we describe how this was modified to achieve 90% parallelization while using 15 slave processors and a master. In the latter case, a sequential time of 158 seconds was reduced to 29 seconds using 15 slaves.

Structuring real-time Object-Z specifications

This paper presents a means of structuring specifications in real-time Object-Z: an integration of Object-Z with the timed refinement calculus. Incremental modification of classes using inheritance and composition of classes to form multi-component systems are examined. Two approaches to the latter are considered: using Object-Z's notion of object instantiation and introducing a parallel composition operator similar to those found in process algebras. The parallel composition operator approach is both more concise and allows more general modelling of concurrency. Its incorporation into the existing semantics of real-time Object-Z is presented.

Real-time detection of pneumothorax using electrical impedance tomogyaphy

Objectives: Pneumothorax is a frequent complication during mechanical ventilation. Electrical impedance tomography (EIT) is a noninvasive tool that allows real-time imaging of regional ventilation. The purpose of this study was to 1) identify characteristic changes in the EIT signals associated with pneumothoraces; 2) develop and fine-tune an algorithm for their automatic detection; and 3) prospectively evaluate this algorithm for its sensitivity and specificity in detecting pneumothoraces in real time. Design: Prospective controlled laboratory animal investigation. Setting: Experimental Pulmonology Laboratory of the University of Sao Paulo. Subjects: Thirty-nine anesthetized mechanically ventilated supine pigs (31.0 +/- 3.2 kg, mean +/- SD). Interventions. In a first group of 18 animals monitored by EIT, we either injected progressive amounts of air (from 20 to 500 mL) through chest tubes or applied large positive end-expiratory pressure (PEEP) increments to simulate extreme lung overdistension. This first data set was used to calibrate an EIT-based pneumothorax detection algorithm. Subsequently, we evaluated the real-time performance of the detection algorithm in 21 additional animals (with normal or preinjured lungs), submitted to multiple ventilatory interventions or traumatic punctures of the lung. Measurements and Main Results: Primary EIT relative images were acquired online (50 images/sec) and processed according to a few imaging-analysis routines running automatically and in parallel. Pneumothoraces as small as 20 mL could be detected with a sensitivity of 100% and specificity 95% and could be easily distinguished from parenchymal overdistension induced by PEEP or recruiting maneuvers, Their location was correctly identified in all cases, with a total delay of only three respiratory cycles. Conclusions. We created an EIT-based algorithm capable of detecting early signs of pneumothoraces in high-risk situations, which also identifies its location. It requires that the pneumothorax occurs or enlarges at least minimally during the monitoring period. Such detection was operator-free and in quasi real-time, opening opportunities for improving patient safety during mechanical ventilation.

Energy expenditure during 2nd week of an ultra-endurance run around Australia

Purpose: For ultra-endurance athletes, whose energy expenditure is likely to be at the extremes of human tolerance for sustained periods of time, there is increased concern regarding meeting energy needs. Due to the lack of data outlining the energy requirements of such athletes, it is possible that those participating in ultra-endurance exercise are compromising performance, as well as health, as a result of inadequate nutrition and energy intake. To provide insight into this dilemma, we have presented a case study of a 37-yr-old ultra-marathon runner as he runs around the coast of Australia. Methods: Total energy expenditure was measured over a 2-wk period using the doubly labeled water technique. Results: The average total energy expenditure of the case subject was 6321 kcal.d(-1). Based on the expected accuracy and precision of the doubly labeled water technique the subject's total energy expenditure might range between 6095 and 6550 kcal.d(-1). The subject's average daily water turnover was 6.083 L over the 14-d period and might range between 5.9 L and 6.3 L.d(-1). Conclusions: This information will provide a guide to the energy requirements of ultra-endurance running and enable athletes, nutritionists, and coaches to optimize performance without compromising the health of the participant.

Molecular rates parallel diversification contrasts between carnivorous plant sister lineages

In the carnivorous plant family Lentibulariaceae, the bladderwort lineage (Utricularia and Genlisea) is substantially more species-rich and morphologically divergent than its sister lineage, the butterworts (Pinguicula). Bladderworts have a relaxed body plan that has permitted the evolution of terrestrial, epiphytic, and aquatic forms that capture prey in intricately designed suction bladders or corkscrew-shaped lobster-pot traps. In contrast, the flypaper-trapping butterworts maintain vegetative structures typical of angiosperms. We found that bladderwort genomes evolve significantly faster across seven loci (the trnL intron, the second trnL exon, the trnL-F intergenic spacer, the rps16 intron, rbcL, coxI, and 5.8S rDNA) representing all three genomic compartments. Generation time differences did not show a significant association. We relate these findings to the contested speciation rate hypothesis, which postulates a relationship between increased nucleotide substitution and increased cladogenesis. (C) 2002 The Willi Hennig Society.

The relationship of natural killer cell counts, perforin mRNA and CD2 expression to post-exercise natural killer cell activity in humans

The aim of this study was to further investigate the mechanism of suppression of natural killer (NK) cell cytotoxic activity In peripheral blood following strenuous exercise. Blood was collected for analysis of NK cell concentration, cytotoxic activity, CD2 surface expression and perforin gene expression from runners (RUN, n = 6) and resting controls (CONTROL, n = 4) pre-exercise, 0, 1.5, 5, and 24 h following a 60-min treadmill run at 80% of VO2 peak. Natural killer cytotoxic activity, measured using a whole blood chromium release assay, fluctuated minimally in the CONTROL group and increased by 63% and decreased by 43% 0 and 1.5 h post-exercise, respectively, in the RUN group (group x time, P < 0.001). Lytic index (cytotoxic activity per cell) did not change. Perforin mRNA, measured using quantitative real-time polymerase chain reaction (ORT-PCR) decreased from pre- to post-exercise and remained decreased through 24 h, The decrease from pre- to 0 In post-exercise was seen predominately in the RUN group and was inversely correlated r = - 0.95) to pre-exercise perform mRNA. The NK cell surface expression of CD2 (lymphocyte function-associated antigen-2) was determined using fluorescent antibodies and flow cytometry, There was no change in the proportion of NK cells expressing CD2 or CD2 density, We conclude that (1) numerical redistribution accounted for most of the change in NK cytotoxic activity following a strenuous run, (2) decrease in perforin gene expression during the run was inversely related to pre-exercise levels but did not parallel changes in cytotoxic activity, and (3) CD2 surface expression was not affected by exercise.

The variety of variables in automated real-time refinement

The refinement calculus is a well-established theory for deriving program code from specifications. Recent research has extended the theory to handle timing requirements, as well as functional ones, and we have developed an interactive programming tool based on these extensions. Through a number of case studies completed using the tool, this paper explains how the tool helps the programmer by supporting the many forms of variables needed in the theory. These include simple state variables as in the untimed calculus, trace variables that model the evolution of properties over time, auxiliary variables that exist only to support formal reasoning, subroutine parameters, and variables shared between parallel processes.

Parallel implementation of vertex component analysis for hyperspectral endmember extraction

International Conference with Peer Review 2012 IEEE International Conference in Geoscience and Remote Sensing Symposium (IGARSS), 22-27 July 2012, Munich, Germany

Makespan computation for GPU threads running on a single streaming multiprocessor

Graphics processors were originally developed for rendering graphics but have recently evolved towards being an architecture for general-purpose computations. They are also expected to become important parts of embedded systems hardware -- not just for graphics. However, this necessitates the development of appropriate timing analysis techniques which would be required because techniques developed for CPU scheduling are not applicable. The reason is that we are not interested in how long it takes for any given GPU thread to complete, but rather how long it takes for all of them to complete. We therefore develop a simple method for finding an upper bound on the makespan of a group of GPU threads executing the same program and competing for the resources of a single streaming multiprocessor (whose architecture is based on NVIDIA Fermi, with some simplifying assunptions). We then build upon this method to formulate the derivation of the exact worst-case makespan (and corresponding schedule) as an optimization problem. Addressing the issue of tractability, we also present a technique for efficiently computing a safe estimate of the worstcase makespan with minimal pessimism, which may be used when finding an exact value would take too long.

Software transactional memory as a building block for parallel embedded realtime systems

The recent trends of chip architectures with higher number of heterogeneous cores, and non-uniform memory/non-coherent caches, brings renewed attention to the use of Software Transactional Memory (STM) as a fundamental building block for developing parallel applications. Nevertheless, although STM promises to ease concurrent and parallel software development, it relies on the possibility of aborting conflicting transactions to maintain data consistency, which impacts on the responsiveness and timing guarantees required by embedded real-time systems. In these systems, contention delays must be (efficiently) limited so that the response times of tasks executing transactions are upper-bounded and task sets can be feasibly scheduled. In this paper we assess the use of STM in the development of embedded real-time software, defending that the amount of contention can be reduced if read-only transactions access recent consistent data snapshots, progressing in a wait-free manner. We show how the required number of versions of a shared object can be calculated for a set of tasks. We also outline an algorithm to manage conflicts between update transactions that prevents starvation.

On the implementation of real-time slotbased task-splitting scheduling algorithms for multiprocessor systems

In this paper we discuss challenges and design principles of an implementation of slot-based tasksplitting algorithms into the Linux 2.6.34 version. We show that this kernel version is provided with the required features for implementing such scheduling algorithms. We show that the real behavior of the scheduling algorithm is very close to the theoretical. We run and discuss experiments on 4-core and 24-core machines.