Towards comparable simulations of cooperating objects and wireless sensor networks

Simulators are indispensable tools to support the development and testing of cooperating objects such as wireless sensor networks (WSN). However, it is often not possible to compare the results of different simulation tools. Thus, the goal of this paper is the specification of a generic simulation platform for cooperating objects. We propose a platform that consists of a set of simulators that together fulfill desired simulator properties. We show that to achieve comparable results the use of a common specification language for the software-under-test is not feasible. Instead, we argue that using common input formats for the simulated environment and common output formats for the results is useful. This again motivates that a simulation tool consisting of a set of existing simulators that are able to use common scenario-input and can produce common output which will bring us a step closer to the vision of achieving comparable simulation results.

Finding an upper bound on the increase in execution time due to contention on the memory bus in COTS-based multicore systems

Contention on the memory bus in COTS based multicore systems is becoming a major determining factor of the execution time of a task. Analyzing this extra execution time is non-trivial because (i) bus arbitration protocols in such systems are often undocumented and (ii) the times when the memory bus is requested to be used are not explicitly controlled by the operating system scheduler; they are instead a result of cache misses. We present a method for finding an upper bound on the extra execution time of a task due to contention on the memory bus in COTS based multicore systems. This method makes no assumptions on the bus arbitration protocol (other than assuming that it is work-conserving).

Multiprocessor real-time scheduling considering concurrency and urgency

It has been widely studied how to schedule real-time tasks on multiprocessor platforms. Several studies find optimal scheduling policies for implicit deadline task systems, but it is hard to understand how each policy utilizes the two important aspects of scheduling real-time tasks on multiprocessors:inter-job concurrency and job urgency. In this paper, we introduce a new scheduling policy that considers these two properties. We prove that the policy is optimal for the special case when the execution time of all tasks are equally one and deadlines are implicit, and observe that the policy is a new concept in that it is not an instance of Pfair or ERfair. It remains open to find a schedulability condition for general task systems under our scheduling policy.

Dimensioning and worst-case analysis of cluster-tree sensor networks

Modeling the fundamental performance limits of Wireless Sensor Networks (WSNs) is of paramount importance to understand their behavior under the worst-case conditions and to make the appropriate design choices. This is particular relevant for time-sensitive WSN applications, where the timing behavior of the network protocols (message transmission must respect deadlines) impacts on the correct operation of these applications. In that direction this paper contributes with a methodology based on Network Calculus, which enables quick and efficient worst-case dimensioning of static or even dynamically changing cluster-tree WSNs where the data sink can either be static or mobile. We propose closed-form recurrent expressions for computing the worst-case end-to-end delays, buffering and bandwidth requirements across any source-destination path in a cluster-tree WSN. We show how to apply our methodology to the case of IEEE 802.15.4/ZigBee cluster-tree WSNs. Finally, we demonstrate the validity and analyze the accuracy of our methodology through a comprehensive experimental study using commercially available technology, namely TelosB motes running TinyOS.

Online robust optimization framework for QoS guarantees in distributed soft real-time systems

In distributed soft real-time systems, maximizing the aggregate quality-of-service (QoS) is a typical system-wide goal, and addressing the problem through distributed optimization is challenging. Subtasks are subject to unpredictable failures in many practical environments, and this makes the problem much harder. In this paper, we present a robust optimization framework for maximizing the aggregate QoS in the presence of random failures. We introduce the notion of K-failure to bound the effect of random failures on schedulability. Using this notion we define the concept of K-robustness that quantifies the degree of robustness on QoS guarantee in a probabilistic sense. The parameter K helps to tradeoff achievable QoS versus robustness. The proposed robust framework produces optimal solutions through distributed computations on the basis of Lagrangian duality, and we present some implementation techniques. Our simulation results show that the proposed framework can probabilistically guarantee sub-optimal QoS which remains feasible even in the presence of random failures.

Tempo de clampeamento e fatores associados à reserva de ferro de neonatos a termo

OBJETIVO : Analisar o impacto do tempo de clampeamento e parâmetros obstétricos, biológicos e socioeconômicos sobre a reserva de ferro de neonatos nascidos a termo. MÉTODOS : Estudo transversal pelo qual foram avaliados os parâmetros hematológicos de neonatos de Viçosa, MG, de outubro de 2011 a julho de 2012. Foram coletados 7 mL de sangue do cordão umbilical de 144 neonatos a termo e sem baixo peso. Os parâmetros investigados foram: hemograma completo, ferro sérico, ferritina e proteína C-reativa. O tempo de clampeamento do cordão umbilical foi mensurado utilizando cronômetro digital sem interferir nos procedimentos do parto. Os dados de nascimento foram coletados nas Declarações de Nascidos Vivos e as demais informações foram obtidas com a mãe do neonato por aplicação de questionário no primeiro mês pós-parto. Realizou-se análise de regressão linear múltipla visando a estimar a influência de variáveis obstétricas, biológicas e socioeconômicas nos níveis de ferritina ao nascer. RESULTADOS : A mediana de ferritina foi 130,3 µg/L (n = 129, mínimo de 16,4 e máximo 420,5 µg/L), a média de ferro sérico foi 137,9 μg/dL (n = 144, dp = 39,29) e de hemoglobina, 14,7 g/dL (n = 144, dp = 1,47). O tempo mediano de clampeamento do cordão foi 36 segundos, variando entre sete e 100. A análise bivariada detectou associação entre os níveis de ferritina e a cor da criança, tempo de clampeamento de 60 segundos, tipo de parto, a presença de diabetes gestacional e a renda per capita da família. Renda per capita, número de consultas pré-natais e o comprimento ao nascer contribuíram com 22,0% da variação dos níveis de ferritina na análise múltipla. CONCLUSÕES : A reserva de ferro ao nascer sofreu influência de características biológicas, obstétricas e sociais. O combate à anemia deve envolver a implementação de um critério de clampeamento tardio do cordão umbilical para as diretrizes de trabalho de parto, bem como a criação de políticas voltadas para a redução das desigualdades sociais e melhoria da qualidade do atendimento pré-natal.

The utilization bound of uniprocessor preemptive slack-monotonic scheduling is 50%

Consider the problem of scheduling a set of sporadically arriving implicit-deadline tasks to meet deadlines on a uniprocessor. Static-priority scheduling is considered using the slack-monotonic priority-assignment scheme. We prove that its utilization bound is 50%.

Dynamic QoS adaptation of inter- dependent task sets in cooperative embedded systems

Due to the growing complexity and dynamism of many embedded application domains (including consumer electronics, robotics, automotive and telecommunications), it is increasingly difficult to react to load variations and adapt the system's performance in a controlled fashion within an useful and bounded time. This is particularly noticeable when intending to benefit from the full potential of an open distributed cooperating environment, where service characteristics are not known beforehand and tasks may exhibit unrestricted QoS inter-dependencies. This paper proposes a novel anytime adaptive QoS control policy in which the online search for the best set of QoS levels is combined with each user's personal preferences on their services' adaptation behaviour. Extensive simulations demonstrate that the proposed anytime algorithms are able to quickly find a good initial solution and effectively optimise the rate at which the quality of the current solution improves as the algorithms are given more time to run, with a minimum overhead when compared against their traditional versions.

A framework for the response time analysis of fixed-priority tasks with stochastic inter-arrival times

Real-time scheduling usually considers worst-case values for the parameters of task (or message stream) sets, in order to provide safe schedulability tests for hard real-time systems. However, worst-case conditions introduce a level of pessimism that is often inadequate for a certain class of (soft) real-time systems. In this paper we provide an approach for computing the stochastic response time of tasks where tasks have inter-arrival times described by discrete probabilistic distribution functions, instead of minimum inter-arrival (MIT) values.

Prevalence of anemia and associated factors in older adults: evidence from the SABE Study

OBJECTIVE To assess the prevalence of anemia and associated factors in older adults. METHODS The prevalence and factors associated with anemia in older adults were studied on the basis of the results of the Saúde, Bem-Estar e Envelhecimento (SABE – Health, Welfare and Aging) study. A group of 1,256 individuals were interviewed during the third wave of the SABE study performed in Sao Paulo, SP, in 2010. The study included 60.4% females; the mean age of the participants was 70.4 years, and their average education was 5.3 years. The dependent variable was the presence of anemia (hemoglobin levels: 12 g/dL in women and 13 g/dL in men). Descriptive analysis and hierarchical logistic regression were performed. The independent variables were as follows: a) demographics: gender, age, and education and b) clinical characteristics: self-reported chronic diseases, presence of cognitive decline and depression symptoms, and body mass index. RESULTS The prevalence of anemia was 7.7% and was found to be higher in oldest adults. There was no difference between genders, although the hemoglobin distribution curve in women showed a displacement toward lower values in comparison with the distribution curve in men. Advanced age (OR = 1.07; 95%CI 0.57;1.64; p < 0.001), presence of diabetes (OR = 2.30; 95%CI 1.33;4.00; p = 0.003), cancer (OR = 2.72; 95%CI 1.2;6.11; p = 0.016), and presence of depression symptoms (OR = 1.75; 95%CI 1.06;2.88; p = 0.028) remained significant even after multiple analyses. CONCLUSIONS The prevalence of anemia in older adults was 7.7% and was mainly associated with advanced age and presence of chronic diseases. Thus, anemia can be an important marker in the investigation of health in older adults because it can be easily diagnosed and markedly affects the quality of life of older adults.

Conforto Térmico em Meio Hospitalar: o caso do Serviço de Esterilização.

Os hospitais constituem locais de trabalho bastante peculiares, concebidos quase exclusivamente em função das necessidades dos utentes, proporcionando aos seus trabalhadores condições laborais precárias. Os parâmetros especificados na legislação nacional respeitantes ao ambiente térmico, cingem-se aos valores de temperatura, humidade e velocidade do ar recomendados pelo DL nº 243/86 de 20 de Agosto e DL nº 79/2006 de 4 de Abril,respectivamente. Para além da conformidade legal dos parâmetros térmicos, este trabalho teve como objectivo determinar índices de conforto térmico, sensações e preferências, a partir de um estudo de campo efectuado no Serviço de Esterilização duma Unidade Hospitalar do Porto, durante os meses de Julho e Agosto de 2010. A determinação e interpretação analítica do conforto térmico, foi efectuada com base nos pressupostos das normas ISO 7726:1998, ISO 8996:2004 e ISO 7730:2005. Complementarmente aplicou-se um questionário para aferir as variáveis subjectivas, baseado na norma ISO 10551:1995. Verificou-se que os valores de humidade do ar obtidos durante a semana se enquadraram na gama de valores recomendados (50 a 70%). No que se refere à temperatura, os valores encontrados foram superiores ao recomendado (18 a 22ºC). No que respeita à velocidade do ar os valores obtidos ultrapassaram em certas ocasiões os 0,2 m/s recomendados. Relativamente aos índices de conforto, o PMV e o PPD ultrapassaram em alguns períodos da semana a gama recomendada de -0,5 a +0,5 e <10%, respectivamente. A aplicação do questionário permitiu verificar que no início do turno (44,7%) dos trabalhadores se sentia "confortável". Relativamente às preferências térmicas, no mesmo período a maioria dos trabalhadores questionados (39,7%) preferiam que o ambiente mantivesse as mesmas condições. No final do turno as sensações e preferências térmicas foram similares. Concluiu-se que eventualmente os índices PMV/PPD poderão ser inadequados para aferir a sensações de conforto em ambiente hospitalar.

Mineralização óssea em recém-nascidos pré-termo com diferente suprimento parentérico de cálcio e fósforo: resultados preliminares

Introdução: Os recém-nascidos pré-termo estão em risco acrescido de desenvolver osteopénia, pela dificuldade no suprimento parentérico de aporte mineral suficiente. Existe uma grande amplitude de doses de cálcio e fósforo recomendadas para estes recém-nascidos por via parentérica, havendo também um elevado risco de precipitação mineral nestas soluções. A ultrassonografia quantitativa é um método recentemente utilizado para avaliação da mineralização óssea em recém-nascidos pré-termo. Objectivo: Medir a mineralização óssea a recém-nascidos pré-termo submetidos a nutrição parentérica com duas doses diferentes doses de cálcio e fósforo. Métodos: Foram incluídos recém-nascidos pré-termo (IGd<33semanas) consecutivos, com necessidade de aporte nutricional parentérico, que foram aleatorizados para receber um aporte parentérico diário de cálcio de 40-50mg.kg-1 (1,00-1,25 mmol.kg-1) (grupo Convencional) ou 70-80mg.kg-1 (1,75-2,00mmol.dl-1) (grupo Alta). Foi mantida a razão mássica Ca:P de 1,7:1 nos dois grupos. Foram efectuadas medições semanais por ultrassonografia quantitativa no ponto médio da tíbia, até serem atingidas as 40 semanas de idade de gestação corrigida. Estabeleceu-se um outro grupo (Controlo) referente apenas à mineralização óssea na primeira semana de vida de recém-nascidos (IGd<40 semanas), para reflectir a mineralização intrauterina. Resultados: Foram incluídos 19 recém-nascidos (grupo Convencional=7, grupo Alta=12), com (média±DP) IG 30,4±1.9 semanas e peso à nascença 1360±400g. Os recém-nascidos inclídos no grupo convencional apresentaram uma mineralização óssea significativamente inferior à dos controlos, o que não ocorreu quando comparados os grupos alta e controlo (para as 32 semanas de idade de gestação corrigida). Os recém-nascidos do grupo Convencional apresentaram ainda mineralização óssea significativamente mais baixa na terceira semana pós-natal, comparativamente com o grupo Alta (p=0,030). Conclusões: A manter-se a tendência, talvez haja um efeito benéfico de uma dose parentérica mais elevada de cálcio e fósforo na mineralização óssea de RNs pré-termo sem o risco de nefrocalcinose. A mineralização óssea intrauterina parece ser superior à do recém-nascido submetido a nutrição parentérica sem manipulação do seu aporte mineral; no entanto, a utilização de soluções parentéricas enriquecidas em minerais ósseos parece provocar uma mineralização óssea semelhante à adquirida no útero.

A genetic algorithm for project scheduling with multi-modes and renewable resources

This paper presents a genetic algorithm-based approach for project scheduling with multi-modes and renewable resources. In this problem activities of the project may be executed in more than one operating mode and renewable resource constraints are imposed. The objective function is the minimization of the project completion time. The idea of this approach is integrating a genetic algorithm with a schedule generation scheme. This study also proposes applying a local search procedure trying to yield a better solution when the genetic algorithm and the schedule generation scheme obtain a solution. The experimental results show that this algorithm is an effective method for solving this problem.

Project scheduling using a competitive genetic algorithm

- The resource constrained project scheduling problem (RCPSP) is a difficult problem in combinatorial optimization for which extensive investigation has been devoted to the development of efficient algorithms. During the last couple of years many heuristic procedures have been developed for this problem, but still these procedures often fail in finding near-optimal solutions. This paper proposes a genetic algorithm for the resource constrained project scheduling problem. The chromosome representation of the problem is based on random keys. The schedule is constructed using a heuristic priority rule in which the priorities and delay times of the activities are defined by the genetic algorithm. The approach was tested on a set of standard problems taken from the literature and compared with other approaches. The computational results validate the effectiveness of the proposed algorithm

A comparative analysis of fault injection methods via enhanced on-chip debug infrastructures

On-chip debug (OCD) features are frequently available in modern microprocessors. Their contribution to shorten the time-to-market justifies the industry investment in this area, where a number of competing or complementary proposals are available or under development, e.g. NEXUS, CJTAG, IJTAG. The controllability and observability features provided by OCD infrastructures provide a valuable toolbox that can be used well beyond the debugging arena, improving the return on investment rate by diluting its cost across a wider spectrum of application areas. This paper discusses the use of OCD features for validating fault tolerant architectures, and in particular the efficiency of various fault injection methods provided by enhanced OCD infrastructures. The reference data for our comparative study was captured on a workbench comprising the 32-bit Freescale MPC-565 microprocessor, an iSYSTEM IC3000 debugger (iTracePro version) and the Winidea 2005 debugging package. All enhanced OCD infrastructures were implemented in VHDL and the results were obtained by simulation within the same fault injection environment. The focus of this paper is on the comparative analysis of the experimental results obtained for various OCD configurations and debugging scenarios.