45 resultados para Distributed generator
Resumo:
A physical random number generator based on the intrinsic randomness of quantum mechanics is described. The random events are realized by the choice of single photons between the two outputs of a beamsplitter. We present a simple device, which minimizes the impact of the photon counters’ noise, dead-time and after pulses.
Resumo:
Recent advancements in cloud computing have enabled the proliferation of distributed applications, which require management and control of multiple services. However, without an efficient mechanism for scaling services in response to changing environmental conditions and number of users, application performance might suffer, leading to Service Level Agreement (SLA) violations and inefficient use of hardware resources. We introduce a system for controlling the complexity of scaling applications composed of multiple services using mechanisms based on fulfillment of SLAs. We present how service monitoring information can be used in conjunction with service level objectives, predictions, and correlations between performance indicators for optimizing the allocation of services belonging to distributed applications. We validate our models using experiments and simulations involving a distributed enterprise information system. We show how discovering correlations between application performance indicators can be used as a basis for creating refined service level objectives, which can then be used for scaling the application and improving the overall application's performance under similar conditions.
Resumo:
We describe a system for performing SLA-driven management and orchestration of distributed infrastructures composed of services supporting mobile computing use cases. In particular, we focus on a Follow-Me Cloud scenario in which we consider mobile users accessing cloud-enable services. We combine a SLA-driven approach to infrastructure optimization, with forecast-based performance degradation preventive actions and pattern detection for supporting mobile cloud infrastructure management. We present our system's information model and architecture including the algorithmic support and the proposed scenarios for system evaluation.
Resumo:
The intention of an authentication and authorization infrastructure (AAI) is to simplify and unify access to different web resources. With a single login, a user can access web applications at multiple organizations. The Shibboleth authentication and authorization infrastructure is a standards-based, open source software package for web single sign-on (SSO) across or within organizational boundaries. It allows service providers to make fine-grained authorization decisions for individual access of protected online resources. The Shibboleth system is a widely used AAI, but only supports protection of browser-based web resources. We have implemented a Shibboleth AAI extension to protect web services using Simple Object Access Protocol (SOAP). Besides user authentication for browser-based web resources, this extension also provides user and machine authentication for web service-based resources. Although implemented for a Shibboleth AAI, the architecture can be easily adapted to other AAIs.
Resumo:
We investigate the problem of distributed sensors' failure detection in networks with a small number of defective sensors, whose measurements differ significantly from the neighbor measurements. We build on the sparse nature of the binary sensor failure signals to propose a novel distributed detection algorithm based on gossip mechanisms and on Group Testing (GT), where the latter has been used so far in centralized detection problems. The new distributed GT algorithm estimates the set of scattered defective sensors with a low complexity distance decoder from a small number of linearly independent binary messages exchanged by the sensors. We first consider networks with one defective sensor and determine the minimal number of linearly independent messages needed for its detection with high probability. We then extend our study to the multiple defective sensors detection by modifying appropriately the message exchange protocol and the decoding procedure. We show that, for small and medium sized networks, the number of messages required for successful detection is actually smaller than the minimal number computed theoretically. Finally, simulations demonstrate that the proposed method outperforms methods based on random walks in terms of both detection performance and convergence rate.
Resumo:
The Doctoral Workshop on Distributed Systems was held at Les Plans-sur-Bex, Switzerland, from June 26-28, 2013. Ph.D. students from the Universities of Neuchâtel and Bern as well as the University of Applied Sciences of Fribourg presented their current research work and discussed recent research results. This technical report includes the extended abstracts of the talks given during the workshop.
Resumo:
Web-scale knowledge retrieval can be enabled by distributed information retrieval, clustering Web clients to a large-scale computing infrastructure for knowledge discovery from Web documents. Based on this infrastructure, we propose to apply semiotic (i.e., sub-syntactical) and inductive (i.e., probabilistic) methods for inferring concept associations in human knowledge. These associations can be combined to form a fuzzy (i.e.,gradual) semantic net representing a map of the knowledge in the Web. Thus, we propose to provide interactive visualizations of these cognitive concept maps to end users, who can browse and search the Web in a human-oriented, visual, and associative interface.
Resumo:
As the complexity of active medical implants increases, the task of embedding a life-long power supply at the time of implantation becomes more challenging. A periodic renewal of the energy source is often required. Human energy harvesting is, therefore, seen as a possible remedy. In this paper, we present a novel idea to harvest energy from the pressure-driven deformation of an artery by the principle of magneto-hydrodynamics. The generator relies on a highly electrically conductive fluid accelerated perpendicularly to a magnetic field by means of an efficient lever arm mechanism. An artery with 10 mm inner diameter is chosen as a potential implantation site and its ability to drive the generator is established. Three analytical models are proposed to investigate the relevant design parameters and to determine the existence of an optimal configuration. The predicted output power reaches 65 μW according to the first two models and 135 μW according to the third model. It is found that the generator, designed as a circular structure encompassing the artery, should not exceed a total volume of 3 cm3.
Resumo:
Ventricular assist devices (VADs) are blood pumps that offer an option to support the circulation of patients with severe heart failure. Since a failing heart has a remaining pump function, its interaction with the VAD influences the hemodynamics. Ideally, the heart's action is taken into account for actuating the device such that the device is synchronized to the natural cardiac cycle. To realize this in practice, a reliable real-time algorithm for the automatic synchronization of the VAD to the heart rate is required. This paper defines the tasks such an algorithm needs to fulfill: the automatic detection of irregular heart beats and the feedback control of the phase shift between the systolic phases of the heart and the assist device. We demonstrate a possible solution to these problems and analyze its performance in two steps. First, the algorithm is tested using the MIT-BIH arrhythmia database. Second, the algorithm is implemented in a controller for a pulsatile and a continuous-flow VAD. These devices are connected to a hybrid mock circulation where three test scenarios are evaluated. The proposed algorithm ensures a reliable synchronization of the VAD to the heart cycle, while being insensitive to irregularities in the heart rate.
Resumo:
Replacement intervals of implantable medical devices are commonly dictated by battery life. Therefore, intracorporeal energy harvesting has the potential to reduce the number of surgical interventions by extending the life cycle of active devices. Given the accumulated experience with intravascular devices such as stents, heart valves, and cardiac assist devices, the idea to harvest a small fraction of the hydraulic energy available in the cardiovascular circulation is revisited. The aim of this article is to explore the technical feasibility of harvesting 1 mW electric power using a miniature hydrodynamic turbine powered by about 1% of the cardiac output flow in a peripheral artery. To this end, numerical modelling of the fluid mechanics and experimental verification of the overall performance of a 1:1 scale friction turbine are performed in vitro. The numerical flow model is validated for a range of turbine configurations and flow conditions (up to 250 mL/min) in terms of hydromechanic efficiency; up to 15% could be achieved with the nonoptimized configurations of the study. Although this article does not entail the clinical feasibility of intravascular turbines in terms of hemocompatibility and impact on the circulatory system, the numerical model does provide first estimates of the mechanical shear forces relevant to blood trauma and platelet activation. It is concluded that the time-integrated shear stress exposure is significantly lower than in cardiac assist devices due to lower flow velocities and predominantly laminar flow.
Resumo:
In this work, we propose a distributed rate allocation algorithm that minimizes the average decoding delay for multimedia clients in inter-session network coding systems. We consider a scenario where the users are organized in a mesh network and each user requests the content of one of the available sources. We propose a novel distributed algorithm where network users determine the coding operations and the packet rates to be requested from the parent nodes, such that the decoding delay is minimized for all clients. A rate allocation problem is solved by every user, which seeks the rates that minimize the average decoding delay for its children and for itself. Since this optimization problem is a priori non-convex, we introduce the concept of equivalent packet flows, which permits to estimate the expected number of packets that every user needs to collect for decoding. We then decompose our original rate allocation problem into a set of convex subproblems, which are eventually combined to obtain an effective approximate solution to the delay minimization problem. The results demonstrate that the proposed scheme eliminates the bottlenecks and reduces the decoding delay experienced by users with limited bandwidth resources. We validate the performance of our distributed rate allocation algorithm in different video streaming scenarios using the NS-3 network simulator. We show that our system is able to take benefit of inter-session network coding for simultaneous delivery of video sessions in networks with path diversity.