884 resultados para DTN,Opportunistic Routing,Contact Graph Routing,Opportunistic Contact Graph Routing,ION
Resumo:
Using Wireless Sensor Networks (WSNs) in healthcare systems has had a lot of attention in recent years. In much of this research tasks like sensor data processing, health states decision making and emergency message sending are done by a remote server. Many patients with lots of sensor data consume a great deal of communication resources, bring a burden to the remote server and delay the decision time and notification time. A healthcare application for elderly people using WSN has been simulated in this paper. A WSN designed for the proposed healthcare application needs efficient MAC and routing protocols to provide a guarantee for the reliability of the data delivered from the patients to the medical centre. Based on these requirements, A cross layer based on the modified versions of APTEEN and GinMAC has been designed and implemented, with new features, such as a mobility module and routes discovery algorithms have been added. Simulation results show that the proposed cross layer based protocol can conserve energy for nodes and provide the required performance such as life time of the network, delay and reliability for the proposed healthcare application.
Resumo:
Objectives: To investigate plantar pressure distribution in individuals with and without Patellofemoral Pain Syndrome during the Support phase of stair descent. Design: Observational case-control study. Participants: 30 Young adults With Patellofemoral Pain Syndrome and 44 matched controls. Main outcome measures: Contact area, peak pressure and pressure-time integral (Novel Pedar-X system) were evaluated in six plantar areas (medial, central and lateral rearfoot: midfoot; medial and lateral forefoot) during stair descent. Results: Contact area was greater in the Patellofemoral Pain Syndrome Group at medial rearfoot (p = 0.019) and midfoot (p < 0.001). Subjects with Patellofemoral pain Syndrome presented smaller peak pressures (p < 0.001). Conclusion: The pattern of plantar pressure distribution during stair descent in Patellofemoral Pain Syndrome Subjects was different from controls. This seems to be related to greater medial rearfoot and midfoot Support. Smaller plantar loads found in Patellofemoral Pain Syndrome subjects during stair descent reveal a more Cautious motor pattern in a challenging task. (C) 2009 Elsevier Ltd. All rights reserved.
Resumo:
The Tiete River and its tributary Pinheiros River receive a highly complex organic and inorganic pollutants load from sanitary sewage and industrial sources, as well as agricultural and agroindustrial activities. The aim of the present study was to evaluate the embryotoxic and teratogenic effects of sediments from selected locations in the Tiete River Basin by means of the sediment contact embryo toxicity assay with Danio rerio, in order to provide a comprehensive and realistic insight into the bioavailable hazard potential of these sediment samples. Lethal and sub-lethal effects were recorded, and high embryo toxicity could be found in the samples not only in the vicinity of the megacity Sao Paulo (Billings reservoir and Pinheiros River samples), but also downstream (in the reservoirs Barra Bonita, Promissao and Tres Irmaos). Results confirm that most toxicity is due to the discharges of the metropolitan area of Sao Paulo. However, they also indicate additional sources of pollutants along the river course, probably from industrial, agricultural and agroindustrial residues, which contribute to the degradation of each area. The sediment contact fish embryo test showed to be powerful tool to detect embryo toxicity in sediments, not only by being a sensitive method, but also for taking into account bioavailability. This test provides an ecological highly realistic and relevant exposure scenario, and should therefore be added in ecotoxicological sediment quality assessments. (C) 2011 Elsevier Inc. All rights reserved.
Resumo:
Isolated from the mycelium, of Scedosporium prolificans were complex glycoproteins (RMP-Sp), with three structurally related components (HPSEC). RMP-Sp contained 35% protein and 62% carbohydrate with Rha, Ara, Man, Gal, Glc, and GlcNH(2) in a 18:1:24:8:6:5 molar ratio. Methylation analysis showed mainly nonreducing end- of Galp (13%), nonreducing end- (9%),2-O-(13%), and 3-O-subst. Rhap (7%), nonreducing end-(11%), 2-O-(10%), 3-O-(14%), and 2,6-di-O-subst. Manp units (13%). Mild reductive P-elimination of RMP-Sp gave alpha-L-Rhap-(1-->2)-alpha-L-Rhap-(1-->3)-alpha-L-Rhap-(1-->3)-alpha-D-Manp-(1-->2)-D-Man-ol, with Man-ol substituted at O-6 with beta-D-Galp units, a related pentasaccharide lacking beta-D-Galp units, and beta-D-Galp-(1-->6)-[alpha-D-Manp-(1-->2)]-D-Man-ol in a 16:3:1 w/w ratio. Traces of Man-ol and Rha-ol were detected. ESI-MS showed HexHex-o1 and HCX(3-6)Hex-ol components. Three rhamnosyl units were peeled off successively from the penta- and hexasaccharide by ESI-MS-MS. The carbohydrate epitopes of RMP-Sp differ from those of the glycoprotein of Pseudallescheria boydii, a related opportunistic pathogen. (C) 2007 Elsevier B.V. All rights reserved.
Resumo:
We study the geometry of 3-manifolds generically embedded in R(n) by means of the analysis of the singularities of the distance-squared and height functions on them. We describe the local structure of the discriminant (associated to the distribution of asymptotic directions), the ridges and the flat ridges.
Resumo:
We analyze a threshold contact process on a square lattice in which particles are created on empty sites with at least two neighboring particles and are annihilated spontaneously. We show by means of Monte Carlo simulations that the process undergoes a discontinuous phase transition at a definite value of the annihilation parameter, in accordance with the Gibbs phase rule, and that the discontinuous transition exhibits critical behavior. The simulations were performed by using boundary conditions in which the sites of the border of the lattice are permanently occupied by particles.
Resumo:
We performed Monte Carlo simulations to investigate the steady-state critical behavior of a one-dimensional contact process with an aperiodic distribution of rates of transition. As in the presence of randomness, spatial fluctuations can lead to changes of critical behavior. For sufficiently weak fluctuations, we give numerical evidence to show that there is no departure from the universal critical behavior of the underlying uniform model. For strong spatial fluctuations, the analysis of the data indicates a change of critical universality class.
Resumo:
The InteGrade project is a multi-university effort to build a novel grid computing middleware based on the opportunistic use of resources belonging to user workstations. The InteGrade middleware currently enables the execution of sequential, bag-of-tasks, and parallel applications that follow the BSP or the MPI programming models. This article presents the lessons learned over the last five years of the InteGrade development and describes the solutions achieved concerning the support for robust application execution. The contributions cover the related fields of application scheduling, execution management, and fault tolerance. We present our solutions, describing their implementation principles and evaluation through the analysis of several experimental results. (C) 2010 Elsevier Inc. All rights reserved.
Resumo:
We provide a characterization of the Clifford Torus in S(3) via moving frames and contact structure equations. More precisely, we prove that minimal surfaces in S(3) with constant contact angle must be the Clifford Torus. Some applications of this result are then given, and some examples are discussed.
Resumo:
This Thesis Work will concentrate on a very interesting problem, the Vehicle Routing Problem (VRP). In this problem, customers or cities have to be visited and packages have to be transported to each of them, starting from a basis point on the map. The goal is to solve the transportation problem, to be able to deliver the packages-on time for the customers,-enough package for each Customer,-using the available resources- and – of course - to be so effective as it is possible.Although this problem seems to be very easy to solve with a small number of cities or customers, it is not. In this problem the algorithm have to face with several constraints, for example opening hours, package delivery times, truck capacities, etc. This makes this problem a so called Multi Constraint Optimization Problem (MCOP). What’s more, this problem is intractable with current amount of computational power which is available for most of us. As the number of customers grow, the calculations to be done grows exponential fast, because all constraints have to be solved for each customers and it should not be forgotten that the goal is to find a solution, what is best enough, before the time for the calculation is up. This problem is introduced in the first chapter: form its basics, the Traveling Salesman Problem, using some theoretical and mathematical background it is shown, why is it so hard to optimize this problem, and although it is so hard, and there is no best algorithm known for huge number of customers, why is it a worth to deal with it. Just think about a huge transportation company with ten thousands of trucks, millions of customers: how much money could be saved if we would know the optimal path for all our packages.Although there is no best algorithm is known for this kind of optimization problems, we are trying to give an acceptable solution for it in the second and third chapter, where two algorithms are described: the Genetic Algorithm and the Simulated Annealing. Both of them are based on obtaining the processes of nature and material science. These algorithms will hardly ever be able to find the best solution for the problem, but they are able to give a very good solution in special cases within acceptable calculation time.In these chapters (2nd and 3rd) the Genetic Algorithm and Simulated Annealing is described in details, from their basis in the “real world” through their terminology and finally the basic implementation of them. The work will put a stress on the limits of these algorithms, their advantages and disadvantages, and also the comparison of them to each other.Finally, after all of these theories are shown, a simulation will be executed on an artificial environment of the VRP, with both Simulated Annealing and Genetic Algorithm. They will both solve the same problem in the same environment and are going to be compared to each other. The environment and the implementation are also described here, so as the test results obtained.Finally the possible improvements of these algorithms are discussed, and the work will try to answer the “big” question, “Which algorithm is better?”, if this question even exists.