977 resultados para Worst-case
Resumo:
Fieldbus networks aim at the interconnection of field devices such as sensors, actuators and small controllers. Therefore, they are an effective technology upon which Distributed Computer Controlled Systems (DCCS) can be built. DCCS impose strict timeliness requirements to the communication network. In essence, by timeliness requirements we mean that traffic must be sent and received within a bounded interval, otherwise a timing fault is said to occur. P-NET is a multi-master fieldbus standard based on a virtual token passing scheme. In P-NET each master is allowed to transmit only one message per token visit, which means that in the worst-case the communication response time could be derived considering that the token is fully utilised by all stations. However, such analysis can be proved to be quite pessimistic. In this paper we propose a more sophisticated P-NET timing analysis model, which considers the actual token utilisation by different masters. The major contribution of this model is to provide a less pessimistic, and thus more accurate, analysis for the evaluation of the worst-case communication response time in P-NET fieldbus networks.
Resumo:
"Many-core” systems based on the Network-on- Chip (NoC) architecture have brought into the fore-front various opportunities and challenges for the deployment of real-time systems. Such real-time systems need timing guarantees to be fulfilled. Therefore, calculating upper-bounds on the end-to-end communication delay between system components is of primary interest. In this work, we identify the limitations of an existing approach proposed by [1] and propose different techniques to overcome these limitations.
Resumo:
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.
Resumo:
Time-sensitive Wireless Sensor Network (WSN) applications require finite delay bounds in critical situations. This paper provides a methodology for the modeling and the worst-case dimensioning of cluster-tree WSNs. We provide a fine model of the worst-case cluster-tree topology characterized by its depth, the maximum number of child routers and the maximum number of child nodes for each parent router. Using Network Calculus, we derive “plug-and-play” expressions for the endto- end delay bounds, buffering and bandwidth requirements as a function of the WSN cluster-tree characteristics and traffic specifications. The cluster-tree topology has been adopted by many cluster-based solutions for WSNs. We demonstrate how to apply our general results for dimensioning IEEE 802.15.4/Zigbee cluster-tree WSNs. We believe that this paper shows the fundamental performance limits of cluster-tree wireless sensor networks by the provision of a simple and effective methodology for the design of such WSNs.
Resumo:
We investigate on-line prediction of individual sequences. Given a class of predictors, the goal is to predict as well as the best predictor in the class, where the loss is measured by the self information (logarithmic) loss function. The excess loss (regret) is closely related to the redundancy of the associated lossless universal code. Using Shtarkov's theorem and tools from empirical process theory, we prove a general upper bound on the best possible (minimax) regret. The bound depends on certain metric properties of the class of predictors. We apply the bound to both parametric and nonparametric classes ofpredictors. Finally, we point out a suboptimal behavior of the popular Bayesian weighted average algorithm.
Resumo:
The heat waves of 2003 in Western Europe and 2010 in Russia, commonly labelled as rare climatic anomalies outside of previous experience, are often taken as harbingers of more frequent extremes in the global warming-influenced future. However, a recent reconstruction of spring–summer temperatures for WE resulted in the likelihood of significantly higher temperatures in 1540. In order to check the plausibility of this result we investigated the severity of the 1540 drought by putting forward the argument of the known soil desiccation-temperature feedback. Based on more than 300 first-hand documentary weather report sources originating from an area of 2 to 3 million km2, we show that Europe was affected by an unprecedented 11-month-long Megadrought. The estimated number of precipitation days and precipitation amount for Central and Western Europe in 1540 is significantly lower than the 100-year minima of the instrumental measurement period for spring, summer and autumn. This result is supported by independent documentary evidence about extremely low river flows and Europe-wide wild-, forest- and settlement fires. We found that an event of this severity cannot be simulated by state-of-the-art climate models.
Resumo:
In the standard Vehicle Routing Problem (VRP), we route a fleet of vehicles to deliver the demands of all customers such that the total distance traveled by the fleet is minimized. In this dissertation, we study variants of the VRP that minimize the completion time, i.e., we minimize the distance of the longest route. We call it the min-max objective function. In applications such as disaster relief efforts and military operations, the objective is often to finish the delivery or the task as soon as possible, not to plan routes with the minimum total distance. Even in commercial package delivery nowadays, companies are investing in new technologies to speed up delivery instead of focusing merely on the min-sum objective. In this dissertation, we compare the min-max and the standard (min-sum) objective functions in a worst-case analysis to show that the optimal solution with respect to one objective function can be very poor with respect to the other. The results motivate the design of algorithms specifically for the min-max objective. We study variants of min-max VRPs including one problem from the literature (the min-max Multi-Depot VRP) and two new problems (the min-max Split Delivery Multi-Depot VRP with Minimum Service Requirement and the min-max Close-Enough VRP). We develop heuristics to solve these three problems. We compare the results produced by our heuristics to the best-known solutions in the literature and find that our algorithms are effective. In the case where benchmark instances are not available, we generate instances whose near-optimal solutions can be estimated based on geometry. We formulate the Vehicle Routing Problem with Drones and carry out a theoretical analysis to show the maximum benefit from using drones in addition to trucks to reduce delivery time. The speed-up ratio depends on the number of drones loaded onto one truck and the speed of the drone relative to the speed of the truck.
Resumo:
Teollisuuden jäähdytysjärjestelmiä tarvitaan prosessien lämpötilan ja paineen hal-litsemiseen. Vesi on käytetyin lämmönsiirtoaine hyvän saatavuutensa, halvan hin-nan ja korkean lämmönsiirtokyvyn ansiosta. Jäähdytysjärjestelmät jaetaan kolmeen päätyyppiin, joita ovat läpivirtausjäähdytys, suljettu ja avoin kiertojäähdytys. Kullakin järjestelmätyypillä on tyypilliset alatyyppinsä. Avoimella kiertojär-jestelmällä on eniten alatyyppejä, joista yleisin on jäähdytystorni. Jäähdytystorneja on kolmea tyyppiä: märkä-, kuiva ja hybriditorni. Kullakin järjestelmätyypillä on ominaiset piirteensä käyttökohteiden, ympäristövaikutusten, ohjattavuuden, investointi- ja käyttökulujen suhteen, joita tässä työssä esitellään. Työssä tutkitaan teollisuuden jäähdytysjärjestelmien esittelyn lisäksi erään ali-painekaasunpoistimen soveltuvuutta suljetun kiertojäähdytysjärjestelmän kaasun-poistoon. Suljettuun kiertojäähdytysjärjestelmään jää ilmaa täyttövaiheessa ja kul-keutuu liuenneena käytettävän jäähdytysveden mukana. Muodostuva ylikylläinen seos synnyttää veden sekaan ilmakuplia, jotka aiheuttavat korroosiota kemiallisesti ja kuluttamalla. Lisäksi kaasukuplat vievät tilavuutta nesteeltä. Tämä pienentää järjestelmän jäähdytystehoa merkittävästi, koska kaasun lämmönsiirtokyky verrat-tuna veden lämmönsiirtokykyyn on pieni. Työssä esitellään myös muita mahdolli-sia suljetun järjestelmän kaasulähteitä ja niiden aiheuttamia ongelmia. Alipainekaasunpoistimen kaasunerotustehokkuutta mitattiin jäähdytysvesinäyttei-den selkeytymisnopeudella ja lämmönsiirtimien tehon paranemisella. Kahden viikon tarkastelujaksolla selkeytymisajat paranivat 36–60 % eri mittauspaikoissa ja lämmönsiirtimien tehot paranivat 6–29 %. Järjestelmään kuitenkin jäi merkittävä määrä kaasua, vaikka laitteen käyttöä jatkettiin tarkastelujakson jälkeen, joten tavoitteisiin ei päästy. Tutkitun alipainekaasunpoistolaitteen ei todettu soveltuvan tehdasympäristöön kestämättömyyden, hankalakäyttöisyyden ja tehottomuuden takia. Tulokset kuitenkin osoittavat, että kaasunerotuksella on merkittävä vaikutus suljetun jäähdytysjärjestelmän toimivuuteen ja saavutettavaan jäähdytystehoon.
Resumo:
Service provider selection has been said to be a critical factor in the formation of supply chains. Through successful selection companies can attain competitive advantage, cost savings and more flexible operations. Service provider management is the next crucial step in outsourcing process after the selection has been made. Without proper management companies cannot be sure about the level of service they have bought and they may suffer from service provider's opportunistic behavior. In worst case scenario the buyer company may end up in locked-in situation in which it is totally dependent of the service provider. This thesis studies how the case company conducts its carrier selection process along with the criteria related to it. A model for the final selection is also provided. In addition, case company's carrier management procedures are reflected against recommendations from previous researches. The research was conducted as a qualitative case study on the principal company, Neste Oil Retail. A literature review was made on outsourcing, service provider selection and service provider management. On the basis of the literature review, this thesis ended up recommending Analytic hierarchy process as the preferred model for the carrier selection. Furthermore, Agency theory was seen to be a functional framework for carrier management in this study. Empirical part of this thesis was conducted in the case company by interviewing the key persons in the selection process, making observations and going through documentations related to the subject. According to the results from the study, both carrier selection process as well as carrier management were closely in line with suggestions from literature review. Analytic hierarchy process results revealed that the case company considers service quality as the most important criteria with financial situation and price of service following behind with almost identical weights with each other. Equipment and personnel was seen as the least important selection criterion. Regarding carrier management, the study resulted in the conclusion that the company should consider engaging more in carrier development and working towards beneficial and effective relationships. Otherwise, no major changes were recommended for the case company processes.
Resumo:
This paper presents a semi-synchronous pipeline scheme, here referred as single-pulse pipeline, to the problem of mapping pipelined circuits to a Field Programmable Gate Array (FPGA). Area and timing considerations are given for a general case and later applied to a systolic circuit as illustration. The single-pulse pipeline can manage asynchronous worst-case data completion and it is evaluated against two chosen asynchronous pipelining: a four-phase bundle-data pipeline and a doubly-latched asynchronous pipeline. The semi-synchronous pipeline proposal takes less FPGA area and operates faster than the two selected fully-asynchronous schemes for an FPGA case.
Resumo:
A two-dimensional numeric simulator is developed to predict the nonlinear, convective-reactive, oxygen mass exchange in a cross-flow hollow fiber blood oxygenator. The numeric simulator also calculates the carbon dioxide mass exchange, as hemoglobin affinity to oxygen is affected by the local pH value, which depends mostly on the local carbon dioxide content in blood. Blood pH calculation inside the oxygenator is made by the simultaneous solution of an equation that takes into account the blood buffering capacity and the classical Henderson-Hasselbach equation. The modeling of the mass transfer conductance in the blood comprises a global factor, which is a function of the Reynolds number, and a local factor, which takes into account the amount of oxygen reacted to hemoglobin. The simulator is calibrated against experimental data for an in-line fiber bundle. The results are: (i) the calibration process allows the precise determination of the mass transfer conductance for both oxygen and carbon dioxide; (ii) very alkaline pH values occur in the blood path at the gas inlet side of the fiber bundle; (iii) the parametric analysis of the effect of the blood base excess (BE) shows that V(CO2) is similar in the case of blood metabolic alkalosis, metabolic acidosis, or normal BE, for a similar blood inlet P(CO2), although the condition of metabolic alkalosis is the worst case, as the pH in the vicinity of the gas inlet is the most alkaline; (iv) the parametric analysis of the effect of the gas flow to blood flow ratio (Q(G)/Q(B)) shows that V(CO2) variation with the gas flow is almost linear up to Q(G)/Q(B) = 2.0. V(O2) is not affected by the gas flow as it was observed that by increasing the gas flow up to eight times, the V(O2) grows only 1%. The mass exchange of carbon dioxide uses the full length of the hollow-fiber only if Q(G)/Q(B) > 2.0, as it was observed that only in this condition does the local variation of pH and blood P(CO2) comprise the whole fiber bundle.
Resumo:
Engineering This investigation examined the rheological (viscosity and yield stress) and material property (density) characteristics of the thickened meal-time and videofluorscopy fluids provided by 10 major metropolitan hospitals. Differences in the thickness of thickened fluids were considered as a source of variability and potential hazard for inter-hospital transfers of dysphagic patients. The results indicated considerable differences in the viscosity, density, and yield stress of both meal-time and videofluoroscopy fluids. In theory, the results suggest that dysphagic patients transferred between hospitals could be placed on inappropriate levels of fluid thickness because of inherent differences in the rheology and material property characteristics of the fluids provided by different hospitals. Slowed improvement or medical complications are potential worst-case scenarios for dysphagic patients if the difference between the thick fluids offered by 2 hospitals are extreme. The investigation outlines the most appropriate way to assess the rheological and material property characteristics of thickened fluids. In addition, it suggests a plan of quality improvement to reduce the variability of the thickness of fluids offered at different hospitals.
Resumo:
The depletion of zeta-cypermethrin residues in bovine tissues and milk was studied. Beef cattle were treated three times at 3-week intervals with 1 ml 10 kg(-1) body weight of a 25 g litre(-1) or 50 g litre(-1) pour-on formulation (2.5 and 5.0 mg zeta-cypermethrin kg(-1) body weight) or 100 mg kg(-1) spray to simulate a likely worst-case treatment regime. Friesian and Jersey dairy cows were treated once with 2.5 mg zeta-cypermethrin kg(-1) in a pour-on formulation. Muscle, liver and kidney residue concentrations were generally less than the limit of detection (LOD = 0.01 mg kg(-1)). Residues in renal-fat and back-fat samples from animals treated with 2.5 mg kg(-1) all exceeded the limit of quantitation (LOQ = 0.05 mg kg(-1)), peaking at 10 days after treatment. Only two of five kidney fat samples were above the LOQ after 34 days, but none of the back-fat samples exceeded the LOQ at 28 days after treatment. Following spray treatments, fat residues were detectable in some animals but were below the LOQ at all sampling intervals. Zeta-cypermethrin was quantifiable (LOQ = 0.01 mg kg(-1)) in only one whole-milk sample from the Friesian cows (0.015 mg kg(-1), 2 days after treatment). In whole milk from Jersey cows, the mean concentration of zeta-cypermethrin peaked 1 day after treatment, at 0.015 mg kg(-1), and the highest individual sample concentration was 0.025 mg kg(-1) at 3 days after treatment. Residues in milk were not quantifiable beginning 4 days after treatment. The mean concentrations of zeta-cypermethrin in milk fat from Friesian and Jersey cows peaked two days after treatment at 0.197 mg kg(-1) and 0.377 mg kg(-1), respectively, and the highest individual sample concentrations were 2 days after treatment at 0.47 mg kg(-1) and 0.98 mg kg(-1), respectively. (C) 2001 Society of Chemical Industry.