Multiprocessor scheduling with few preemptions

Consider the problem of scheduling a set of periodically arriving tasks on a multiprocessor with the goal of meeting deadlines. Processors are identical and have the same speed. Tasks can be preempted and they can migrate between processors. We propose an algorithm with a utilization bound of 66% and with few preemptions. It can trade a higher utilization bound for more preemption and in doing so it has a utilization bound of 100%.

Implementation of a dominance protocol for wireless medium access

Consider the problem of scheduling sporadic message transmission requests with deadlines. For wired channels, this has been achieved successfully using the CAN bus. For wireless channels, researchers have recently proposed a similar solution; a collision-free medium access control (MAC) protocol that implements static-priority scheduling. Unfortunately no implementation has been reported, yet. We implement and evaluate it to find that the implementation indeed is collision-free and prioritized. This allows us to develop schedulability analysis for the implementation. We measure the response times of messages in our implementation and find that our new response-time analysis indeed offers an upper bound on the response times. This enables a new class of wireless real-time systems with timeliness guarantees for sporadic messages and it opens-up a new research area: schedulability analysis for wireless networks.

Collision-free prioritized medium access in the presence of hidden nodes without relying on out-of-band signaling

Consider the problem of sharing a wireless channel between a set of computer nodes. Hidden nodes exist and there is no base station. Each computer node hosts a set of sporadic message streams where a message stream releases messages with real-time deadlines. We propose a collision-free wireless medium access control (MAC) protocol which implements staticpriority scheduling. The MAC protocol allows multiple masters and is fully distributed. It neither relies on synchronized clocks nor out-of-band signaling; it is an adaptation to a wireless channel of the dominance protocol used in the CAN bus. But unlike that protocol, our protocol does not require a node having the ability to receive an incoming bit from the channel while transmitting to the channel. Our protocol has the key feature of not only being prioritized and collision-free but also dealing successfully with hidden nodes. This key feature enables schedulability analysis of sporadic message streams in multihop networks.

Collision-free prioritized medium access control in wireless networks with hidden nodes

We propose a collision-free medium access control (MAC) protocol, which implements static-priority scheduling and works in the presence of hidden nodes. The MAC protocol allows multiple masters and is fully distributed; it is an adaptation to a wireless channel of the dominance protocol used in the CAN bus. But unlike that protocol, our protocol does not require a node having the ability to sense the channel while transmitting to the channel. Our protocol is collision-free even in the presence of hidden nodes and it achieves this without synchronized clocks or out-of-band busy tones. In addition, the protocol is designed to ensure that many non-interfering nodes can transmit in parallel and it functions for both broadcast and unicast transmissions.

Task assignment algorithms for two-type heterogeneous multiprocessors

Consider the problem of assigning implicit-deadline sporadic tasks on a heterogeneous multiprocessor platform comprising two different types of processors—such a platform is referred to as two-type platform. We present two low degree polynomial time-complexity algorithms, SA and SA-P, each providing the following guarantee. For a given two-type platform and a task set, if there exists a task assignment such that tasks can be scheduled to meet deadlines by allowing them to migrate only between processors of the same type (intra-migrative), then (i) using SA, it is guaranteed to find such an assignment where the same restriction on task migration applies but given a platform in which processors are 1+α/2 times faster and (ii) SA-P succeeds in finding a task assignment where tasks are not allowed to migrate between processors (non-migrative) but given a platform in which processors are 1+α times faster. The parameter 0<α≤1 is a property of the task set; it is the maximum of all the task utilizations that are no greater than 1. We evaluate average-case performance of both the algorithms by generating task sets randomly and measuring how much faster processors the algorithms need (which is upper bounded by 1+α/2 for SA and 1+α for SA-P) in order to output a feasible task assignment (intra-migrative for SA and non-migrative for SA-P). In our evaluations, for the vast majority of task sets, these algorithms require significantly smaller processor speedup than indicated by their theoretical bounds. Finally, we consider a special case where no task utilization in the given task set can exceed one and for this case, we (re-)prove the performance guarantees of SA and SA-P. We show, for both of the algorithms, that changing the adversary from intra-migrative to a more powerful one, namely fully-migrative, in which tasks can migrate between processors of any type, does not deteriorate the performance guarantees. For this special case, we compare the average-case performance of SA-P and a state-of-the-art algorithm by generating task sets randomly. In our evaluations, SA-P outperforms the state-of-the-art by requiring much smaller processor speedup and by running orders of magnitude faster.

Provably Good Task Assignment for Two-Type Heterogeneous Multiprocessors Using Cutting Planes

Consider scheduling of real-time tasks on a multiprocessor where migration is forbidden. Specifically, consider the problem of determining a task-to-processor assignment for a given collection of implicit-deadline sporadic tasks upon a multiprocessor platform in which there are two distinct types of processors. For this problem, we propose a new algorithm, LPC (task assignment based on solving a Linear Program with Cutting planes). The algorithm offers the following guarantee: for a given task set and a platform, if there exists a feasible task-to-processor assignment, then LPC succeeds in finding such a feasible task-to-processor assignment as well but on a platform in which each processor is 1.5 × faster and has three additional processors. For systems with a large number of processors, LPC has a better approximation ratio than state-of-the-art algorithms. To the best of our knowledge, this is the first work that develops a provably good real-time task assignment algorithm using cutting planes.

Real-time scheduling with resource sharing on heterogeneous multiprocessors

Consider the problem of scheduling a task set τ of implicit-deadline sporadic tasks to meet all deadlines on a t-type heterogeneous multiprocessor platform where tasks may access multiple shared resources. The multiprocessor platform has m k processors of type-k, where k∈{1,2,…,t}. The execution time of a task depends on the type of processor on which it executes. The set of shared resources is denoted by R. For each task τ i , there is a resource set R i ⊆R such that for each job of τ i , during one phase of its execution, the job requests to hold the resource set R i exclusively with the interpretation that (i) the job makes a single request to hold all the resources in the resource set R i and (ii) at all times, when a job of τ i holds R i , no other job holds any resource in R i . Each job of task τ i may request the resource set R i at most once during its execution. A job is allowed to migrate when it requests a resource set and when it releases the resource set but a job is not allowed to migrate at other times. Our goal is to design a scheduling algorithm for this problem and prove its performance. We propose an algorithm, LP-EE-vpr, which offers the guarantee that if an implicit-deadline sporadic task set is schedulable on a t-type heterogeneous multiprocessor platform by an optimal scheduling algorithm that allows a job to migrate only when it requests or releases a resource set, then our algorithm also meets the deadlines with the same restriction on job migration, if given processors 4×(1+MAXP×⌈|P|×MAXPmin{m1,m2,…,mt}⌉) times as fast. (Here MAXP and |P| are computed based on the resource sets that tasks request.) For the special case that each task requests at most one resource, the bound of LP-EE-vpr collapses to 4×(1+⌈|R|min{m1,m2,…,mt}⌉). To the best of our knowledge, LP-EE-vpr is the first algorithm with proven performance guarantee for real-time scheduling of sporadic tasks with resource sharing on t-type heterogeneous multiprocessors.

Response Time Analysis of Slotted WiDOM in Noisy Wireless Channels

International Conference on Emerging Technologies and Factory Automation (ETFA 2015), Industrial Communication Technologies and Systems, Luxembourg, Luxembourg.

Diterpenos de Copaifera reticulata Ducke com atividade larvicida contra Aedes aegypti (L.) (Diptera, Culicidae)

The objective of this study was to evaluate the larvicidal activity of diterpenoids obtained from the oil-resin of Copaifera reticulata against Aedes aegypti larvae, the principal vector of dengue and urban yellow fever. Four diterpenes were obtained from oil-resin extraction with organic solvents and subsequent chromatographic and spectroscopic procedures allowed to isolation and identification of these compounds as 3-b-acetoxylabdan-8(17)-13-dien-15-oic acid (1), alepterolic acid (2), 3-b-hidroxylabdan-8(17)-en-15-oic acid (3), and ent-agatic acid (4). Each compound was previously dissolved in dimethylsulphoxide, and distilled water was added to obtain the desired concentrations. Twenty larvae of third instars were placed into plastic beckers, containing the solution test (25 mL), in a five repetitions scheme, and their mortality, indicated by torpor and darkening of the cephalic capsule, was recorded after 48h. Probit analyses were used to determine lethal concentrations (LC50 and LC90) and their respective 95% confidence intervals. This study showed that only diterpenoids 1 and 2 exhibited larvicidal properties with LC50 of 0.8 ppm and 87.3 ppm, respectively, revealing the former as the most toxic compound against third instars of Ae. aegypti. Therefore, this compound seems to be an interesting source for new metabolite to be exploited.

Semantics bias in cross-national comparative analyses : Is it good or bad to have "fair" health?

The Health Behavior in School-aged Children is a cross-national study collecting data on social and health indicators on adolescents in 43 countries. The study provides comparable data on health behaviors and health outcomes through the use of a common protocol, which have been a back bone of the study sine its initiation in 1983. Recent years, researchers within the study have noticed a questionable comparability on the widely used item on self-rated health. One of the four response categories to the item "Would you say your health is….?" showed particular variation, as the response category "Fair" varied from 20 % in Latvia and Moldova to 3-4 % in Bulgaria and Macedonia. A qualitative mini-survey of the back-translations showed that the response category "Fair" had a negative slant in 25 countries, a positive slant in 10 countries and was considered neutral in 9 countries. This finding indicates that there are what may be called semantic issues affecting comparability in international studies, since the same original word (in an English original) is interpreted differently across countries and cultures. The paper test and discuss a few possible explanations to this, however, only leaving to future studies to hold a cautious approach to international comparisons if working with the self-rated health item with four response categories.

Floristic, edaphic and structural characteristics of flooded and unflooded forests in the lower Rio Purús region of central Amazonia, Brazil

Despite a natural history interest in the early 1900s, relatively little ecological research has been carried out in the Rio Purús basin of central Amazonia, Brazil. Here we describe a new study area in the region of Lago Uauaçú with an emphasis on the climate, forest structure and composition, and soil characteristics between adjacent unflooded (terra firme) and seasonally inundated forests; situated within both the white-water (várzea) and black-water (igapó) drainage systems that dominate the landscape. The climate was found to be typical of that of the central Amazon. Várzea forest soils had high concentrations of nutrients, while terra firme and igapó soils were comparatively nutrient-poor. Terra firme forests were the most floristically diverse forest type, whereas várzea was intermediate, and igapó the most species-poor. The Lecythidaceae was the most important family in terra firme while the Euphorbiaceae was the most important in both várzea and igapó. There were significant differences between forest types in terms of number of saplings, canopy cover and understorey density. In contrasting our results with other published information, we conclude that the Lago Uauaçú region consists of a typical central Amazonian forest macro-mosaic, but is a unique area with high conservation value due to the intimate juxtaposition of terra firme, várzea and igapó forests.

On the head of the macropetalichthyids, with certain remarks on the head of the other arthrodires / by Erik A:son Stensiö -- Oliver Cummings Farrington -- editor.

v.4:no.4(1925)

Transferring QTL technology to the pig breeding industry (PigQTech) - a demonstration project

The aim of the project has been to demonstrate how the farm animal breeding industry can utilise gene mapping technology to accelerate genetic improvement. Previous theoretical studies had suggested that the use of marker assisted selection could potentially increase the annual improvement for quantitative traits like backfat with about 10% and for more difficult traits such as meat quality and reproduction by as much as 40-60% compared with existing technology. The work has comprised two major tasks: 1. Commercially relevant populations have been screened for segregation at QTLs identified in experimental populations. The aim has been to establish optimal strategies for QTL detection in commercial pig populations and the extent to which QTLs explaining major phenotypic differences between divergent lines used in experimental studies also explain quantitative variation within commercial lines. The results are important for specifying future strategies for finding economically valuable QTLs. 2. Marker assisted backcrossing has been used to demonstrate how a QTL allele can be introgressed from one breed to another. The work has focused on the major fatness QTL on pig chromosome 4 previously identified in a wild pig/Large White intercross. The end result was not designed to be a commercially viable product in its own right, but the process has validated a number of points of major importance for the exploitation of QTLs in livestock.

Blood pressure changes after renal denervation at 10 European expert centers.

We did a subject-level meta-analysis of the changes (Δ) in blood pressure (BP) observed 3 and 6 months after renal denervation (RDN) at 10 European centers. Recruited patients (n=109; 46.8% women; mean age 58.2 years) had essential hypertension confirmed by ambulatory BP. From baseline to 6 months, treatment score declined slightly from 4.7 to 4.4 drugs per day. Systolic/diastolic BP fell by 17.6/7.1 mm Hg for office BP, and by 5.9/3.5, 6.2/3.4, and 4.4/2.5 mm Hg for 24-h, daytime and nighttime BP (P0.03 for all). In 47 patients with 3- and 6-month ambulatory measurements, systolic BP did not change between these two time points (P0.08). Normalization was a systolic BP of <140 mm Hg on office measurement or <130 mm Hg on 24-h monitoring and improvement was a fall of 10 mm Hg, irrespective of measurement technique. For office BP, at 6 months, normalization, improvement or no decrease occurred in 22.9, 59.6 and 22.9% of patients, respectively; for 24-h BP, these proportions were 14.7, 31.2 and 34.9%, respectively. Higher baseline BP predicted greater BP fall at follow-up; higher baseline serum creatinine was associated with lower probability of improvement of 24-h BP (odds ratio for 20-μmol l(-1) increase, 0.60; P=0.05) and higher probability of experiencing no BP decrease (OR, 1.66; P=0.01). In conclusion, BP responses to RDN include regression-to-the-mean and remain to be consolidated in randomized trials based on ambulatory BP monitoring. For now, RDN should remain the last resort in patients in whom all other ways to control BP failed, and it must be cautiously used in patients with renal impairment.

Cerebrospinal fluid in the diagnosis of multiple sclerosis: a consensus report.

The Committee of the European Concerted Action for Multiple Sclerosis (Charcot Foundation) organised five workshops to discuss CSF analytical standards in the diagnosis of multiple sclerosis. This consensus report from 12 European countries summarises the results of those workshops. It is hoped that neurologists will confer with their colleagues in clinical chemistry to arrange the best possible local practice. The most sensitive method for the detection of oligoclonal immunoglobulin bands is isoelectric focusing. The same amounts of IgG in parallel CSF and serum samples are used and oligoclonal bands are revealed with IgG specific antibody staining. All laboratories performing isoelectric focusing should check their technique at least annually using "blind" standards for the five different CSF and serum patterns. Quantitative measurements of IgG production in the CNS are less sensitive than isoelectric focusing. The preferred method for detection of blood-CSF barrier dysfunction is the albumin quotient. The CSF albumin or total protein concentrations are less satisfactory. These results must be interpreted with reference to the age of the patient and the local method of determination. Cells should be counted. The normal value is no more than 4 cells/microliters. Among evolving optional tests, measurement of the combined local synthesis of antibodies against measles, rubella, and/or varicella zoster could represent a significant advance if it offers higher specificity (not sensitivity) for identifying chronic rather than acute inflammation. Other tests that may have useful correlations with clinical indices include those for oligoclonal free light chains, IgM, IgA, or myelin basic protein concentrations.