986 resultados para Milling time
Improving the IEEE 802.15.4 Slotted CSMA/CA MAC for time-critical events in wireless sensor networks
Resumo:
In beacon-enabled mode, IEEE 802.15.4 is ruled by the slotted CSMA/CA Medium Access Control (MAC) protocol. The standard slotted CSMA/CA mechanism does not provide any means of differentiated services to improve the quality of service for timecritical events (such as alarms, time slot reservation, PAN management messages etc.). In this paper, we present and discuss practical service differentiation mechanisms to improve the performance of slotted CSMA/CA for time-critical events, with only minor add-ons to the protocol. The contribution of our proposal is more practical than theoretical since our initial requirement is to leave the original algorithm of the slotted CSMA/CA unchanged, but rather tuning its parameters adequately according to the criticality of the messages. We present a simulation study based on an accurate model of the IEEE 802.15.4 MAC protocol, to evaluate the differentiated service strategies. Four scenarios with different settings of the slotted CSMA/CA parameters are defined. Each scenario is evaluated for FIFO and Priority Queuing. The impact of the hiddennode problem is also analyzed, and a solution to mitigate it is proposed.
Resumo:
The IEEE 802.15.4 Medium Access Control (MAC) protocol is an enabling technology for time sensitive wireless sensor networks thanks to its Guaranteed-Time Slot (GTS) mechanism in the beacon-enabled mode. However, the protocol only supports explicit GTS allocation, i.e. a node allocates a number of time slots in each superframe for exclusive use. The limitation of this explicit GTS allocation is that GTS resources may quickly disappear, since a maximum of seven GTSs can be allocated in each superframe, preventing other nodes to benefit from guaranteed service. Moreover, the GTSs may be only partially used, resulting in wasted bandwidth. To overcome these limitations, this paper proposes i-GAME, an implicit GTS Allocation Mechanism in beacon-enabled IEEE 802.15.4 networks. The allocation is based on implicit GTS allocation requests, taking into account the traffic specifications and the delay requirements of the flows. The i-GAME approach enables the use of a GTS by multiple nodes, while all their (delay, bandwidth) requirements are still satisfied. For that purpose, we propose an admission control algorithm that enables to decide whether to accept a new GTS allocation request or not, based not only on the remaining time slots, but also on the traffic specifications of the flows, their delay requirements and the available bandwidth resources. We show that our proposal improves the bandwidth utilization compared to the explicit allocation used in the IEEE 802.15.4 protocol standard. We also present some practical considerations for the implementation of i-GAME, ensuring backward compatibility with the IEEE 801.5.4 standard with only minor add-ons.
Resumo:
The IEEE 802.15.4 protocol proposes a flexible communication solution for Low-Rate Wireless Personal Area Networks including sensor networks. It presents the advantage to fit different requirements of potential applications by adequately setting its parameters. When enabling its beacon mode, the protocol makes possible real-time guarantees by using its Guaranteed Time Slot (GTS) mechanism. This paper analyzes the performance of the GTS allocation mechanism in IEEE 802.15.4. The analysis gives a full understanding of the behavior of the GTS mechanism with regards to delay and throughput metrics. First, we propose two accurate models of service curves for a GTS allocation as a function of the IEEE 802.15.4 parameters. We then evaluate the delay bounds guaranteed by an allocation of a GTS using Network Calculus formalism. Finally, based on the analytic results, we analyze the impact of the IEEE 802.15.4 parameters on the throughput and delay bound guaranteed by a GTS allocation. The results of this work pave the way for an efficient dimensioning of an IEEE 802.15.4 cluster.
Resumo:
OBJECTIVE To identify gender differences in social support dimensions’ effect on adults’ leisure-time physical activity maintenance, type, and time.METHODS Longitudinal study of 1,278 non-faculty public employees at a university in Rio de Janeiro, RJ, Southeastern Brazil. Physical activity was evaluated using a dichotomous question with a two-week reference period, and further questions concerning leisure-time physical activity type (individual or group) and time spent on the activity. Social support was measured with the Medical Outcomes Study Social Support Scale. For the analysis, logistic regression models were adjusted separately by gender.RESULTS A multinomial logistic regression showed an association between material support and individual activities among women (OR = 2.76; 95%CI 1.2;6.5). Affective support was associated with time spent on leisure-time physical activity only among men (OR = 1.80; 95%CI 1.1;3.2).CONCLUSIONS All dimensions of social support that were examined influenced either the type of, or the time spent on, leisure-time physical activity. In some social support dimensions, the associations detected varied by gender. Future studies should attempt to elucidate the mechanisms involved in these gender differences.
Resumo:
The scarcity and diversity of resources among the devices of heterogeneous computing environments may affect their ability to perform services with specific Quality of Service constraints, particularly in dynamic distributed environments where the characteristics of the computational load cannot always be predicted in advance. Our work addresses this problem by allowing resource constrained devices to cooperate with more powerful neighbour nodes, opportunistically taking advantage of global distributed resources and processing power. Rather than assuming that the dynamic configuration of this cooperative service executes until it computes its optimal output, the paper proposes an anytime approach that has the ability to tradeoff deliberation time for the quality of the solution. 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 at each iteration, with an overhead that can be considered negligible.
Resumo:
Typically common embedded systems are designed with high resource constraints. Static designs are often chosen to address very specific use cases. On contrast, a dynamic design must be used if the system must supply a real-time service where the input may contain factors of indeterminism. Thus, adding new functionality on these systems is often accomplished by higher development time, tests and costs, since new functionality push the system complexity and dynamics to a higher level. Usually, these systems have to adapt themselves to evolving requirements and changing service requests. In this perspective, run-time monitoring of the system behaviour becomes an important requirement, allowing to dynamically capturing the actual scheduling progress and resource utilization. For this to succeed, operating systems need to expose their internal behaviour and state, making it available to the external applications, usually using a run-time monitoring mechanism. However, such mechanism can impose a burden in the system itself if not wisely used. In this paper we explore this problem and propose a framework, which is intended to provide this run-time mechanism whilst achieving code separation, run-time efficiency and flexibility for the final developer.
Resumo:
This paper proposes the calculation of fractional algorithms based on time-delay systems. The study starts by analyzing the memory properties of fractional operators and their relation with time delay. Based on the Fourier analysis an approximation of fractional derivatives through timedelayed samples is developed. Furthermore, the parameters of the proposed approximation are estimated by means of genetic algorithms. The results demonstrate the feasibility of the new perspective.
Resumo:
ABSTRACT OBJECTIVE To describe the waiting time for radiotherapy for patients with cervical cancer. METHODS This descriptive study was conducted with 342 cervical cancer cases that were referred to primary radiotherapy, in the Baixada Fluminense region, RJ, Southeastern Brazil, from October 1995 to August 2010. The waiting time was calculated using the recommended 60-day deadline as a parameter to obtaining the first cancer treatment and considering the date at which the diagnosis was confirmed, the date of first oncological consultation and date when the radiotherapy began. Median and proportional comparisons were made using the Kruskal Wallis and Chi-square tests. RESULTS Most of the women (72.2%) began their radiotherapy within 60 days from the diagnostic confirmation date. The median of this total waiting time was 41 days. This median worsened over the time period, going from 11 days (1995-1996) to 64 days (2009-2010). The median interval between the diagnostic confirmation and the first oncological consultation was 33 days, and between the first oncological consultation and the first radiotherapy session was four days. The median waiting time differed significantly (p = 0.003) according to different stages of the tumor, reaching 56 days, 35 days and 30 days for women whose cancers were classified up to IIA; from IIB to IIIB, and IVA-IVB, respectively. CONCLUSIONS Despite most of the women having had access to radiotherapy within the recommended 60 days, the implementation of procedures to define the stage of the tumor and to reestablish clinical conditions took a large part of this time, showing that at least one of these intervals needs to be improved. Even though the waiting times were ideal for all patients, the most advanced cases were quickly treated, which suggests that access to radiotherapy by women with cervical cancer has been reached with equity.
Resumo:
This study addresses the optimization of rational fraction approximations for the discrete-time calculation of fractional derivatives. The article starts by analyzing the standard techniques based on Taylor series and Padé expansions. In a second phase the paper re-evaluates the problem in an optimization perspective by tacking advantage of the flexibility of the genetic algorithms.
Resumo:
Dependability is a critical factor in computer systems, requiring high quality validation & verification procedures in the development stage. At the same time, digital devices are getting smaller and access to their internal signals and registers is increasingly complex, requiring innovative debugging methodologies. To address this issue, most recent microprocessors include an on-chip debug (OCD) infrastructure to facilitate common debugging operations. This paper proposes an enhanced OCD infrastructure with the objective of supporting the verification of fault-tolerant mechanisms through fault injection campaigns. This upgraded on-chip debug and fault injection (OCD-FI) infrastructure provides an efficient fault injection mechanism with improved capabilities and dynamic behavior. Preliminary results show that this solution provides flexibility in terms of fault triggering and allows high speed real-time fault injection in memory elements
Resumo:
Fault injection is frequently used for the verification and validation of dependable systems. When targeting real time microprocessor based systems the process becomes significantly more complex. This paper proposes two complementary solutions to improve real time fault injection campaign execution, both in terms of performance and capabilities. The methodology is based on the use of the on-chip debug mechanisms present in modern electronic devices. The main objective is the injection of faults in microprocessor memory elements with minimum delay and intrusiveness. Different configurations were implemented and compared in terms of performance gain and logic overhead.
Resumo:
As electronic devices get smaller and more complex, dependability assurance is becoming fundamental for many mission critical computer based systems. This paper presents a case study on the possibility of using the on-chip debug infrastructures present in most current microprocessors to execute real time fault injection campaigns. The proposed methodology is based on a debugger customized for fault injection and designed for maximum flexibility, and consists of injecting bit-flip type faults on memory elements without modifying or halting the target application. The debugger design is easily portable and applicable to different architectures, providing a flexible and efficient mechanism for verifying and validating fault tolerant components.
Resumo:
IEEE CIRCUITS AND SYSTEMS MAGAZINE, Third Quarter
Resumo:
Behavioral biometrics is one of the areas with growing interest within the biosignal research community. A recent trend in the field is ECG-based biometrics, where electrocardiographic (ECG) signals are used as input to the biometric system. Previous work has shown this to be a promising trait, with the potential to serve as a good complement to other existing, and already more established modalities, due to its intrinsic characteristics. In this paper, we propose a system for ECG biometrics centered on signals acquired at the subject's hand. Our work is based on a previously developed custom, non-intrusive sensing apparatus for data acquisition at the hands, and involved the pre-processing of the ECG signals, and evaluation of two classification approaches targeted at real-time or near real-time applications. Preliminary results show that this system leads to competitive results both for authentication and identification, and further validate the potential of ECG signals as a complementary modality in the toolbox of the biometric system designer.
Resumo:
ABSTRACT OBJECTIVE To evaluate the prevalence of leisure-time physical inactivity in Brazilian adolescents and their association with geographical and sociodemographic variables. METHODS The sample was composed by 74,589 adolescents participating in the Study of Cardiovascular Risks in Adolescents (ERICA). This cross-sectional study of school basis with national scope involved adolescents aged from 12 to 17 years in Brazilian cities with more than 100 thousand inhabitants. The prevalence of leisure-time physical inactivity was categorized according to the volume of weekly practice (< 300; 0 min). The prevalences were estimated for the total sample and by sex. Poisson regression models were used to assess associated factors. RESULTS The prevalence of leisure-time physical inactivity was 54.3% (95%CI 53.4-55.2), and higher for the female sex (70.7%, 95%CI 69.5-71.9) compared to the male (38.0%, 95%CI 36.7-39.4). More than a quarter of adolescents (26.5%, 95%CI 25.8-27.3) reported not practicing physical activity in the leisure time, a condition more prevalent for girls (39.8%, 95%CI 38.8-40.9) than boys (13.4%, 95%CI 12.4-14.4). For girls, the variables that were associated with physical inactivity were: reside in the Northeast (RP = 1.13, 95%CI 1.08-1.19), Southeast (RP = 1.16, 95%CI 1.11-1.22) and South (RP = 1.12, 95%CI 1.06-1.18); have 16-17 years (RP = 1.06, 95%CI 1.12-1.15); and belong to the lower economic class (RP = 1.33, 95%CI 1.20-1.48). The same factors, except reside in the Southeast and South, were also associated with not practicing physical activity in the leisure time for the same group. In males, as well as the region, being older (p < 0.001) and declaring to be indigenous (RP = 0.37, 95%CI 0.19-0.73) were also associated with not practicing physical activities in the leisure time. CONCLUSIONS The prevalence of leisure-time physical inactivity in Brazilian adolescents is high. It presents regional variations and is associated with age and low socioeconomic status. Special attention should be given to girls and to those who do not engage in any physical activity during the leisure time, so that they can adopt a more active lifestyle.