Search results for "Server"
showing 10 items of 586 documents
In vitro carious lesion detection on D-, E-, and F-speed radiographic films
2004
Abstract Objectives To compare the accuracy in detection of interproximal natural carious lesions in vitro between Ultraspeed (D), Ektaspeed Plus (E), and Insight (F) radiographic films. Study design Ten observers indicated on a 5-point scale their confidence in detecting an interproximal lesion in 240 surfaces (120 extracted teeth) with noncavitated carious lesions. Truth was assessed microscopically from hemisections. The areas (Az) beneath receiver operating characteristic (ROC) curves were pairwise compared and used for a 2-way analysis of variance. Results Az values were significantly correlated with observers ( P = .002; Eta = 0.671) and film type ( P = .003; Eta = 0.412). E differe…
Achieving Fair Load Balancing by Invoking a Learning Automata-Based Two-Time-Scale Separation Paradigm.
2020
Author's accepted manuscript. © 2020 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. In this article, we consider the problem of load balancing (LB), but, unlike the approaches that have been proposed earlier, we attempt to resolve the problem in a fair manner (or rather, it would probably be more appropriate to describe it as an ε-fair manner because, although the LB…
Self-stabilizing Balls & Bins in Batches
2016
A fundamental problem in distributed computing is the distribution of requests to a set of uniform servers without a centralized controller. Classically, such problems are modelled as static balls into bins processes, where m balls (tasks) are to be distributed to n bins (servers). In a seminal work, [Azar et al.; JoC'99] proposed the sequential strategy Greedy[d] for n = m. When thrown, a ball queries the load of d random bins and is allocated to a least loaded of these. [Azar et al.; JoC'99] showed that d=2 yields an exponential improvement compared to d=1. [Berenbrink et al.; JoC'06] extended this to m ⇒ n, showing that the maximal load difference is independent of m for d=2 (in contrast…
Discrete-timeH − ∕ H ∞ sensor fault detection observer design for nonlinear systems with parameter uncertainty
2013
SUMMARY This work concerns robust sensor fault detection observer (SFDO) design for uncertain and disturbed discrete-time Takagi–Sugeno (T–S) systems using H − ∕ H ∞ criterion. The principle of the proposed approach is based on simultaneously minimizing the perturbation effect and maximizing the fault effect on the residual vector. Furthermore, by introducing slack decision matrices and taking advantage of the descriptor formulation, less conservative sufficient conditions are proposed leading to easier linear matrix inequalities (LMIs). Moreover, the proposed (SFDO) design conditions allow dealing with unmeasurable premise variables. Finally, a numerical example and a truck–trailer system…
Notice of Violation of IEEE Publication Principles: Robust Observer Design for Unknown Inputs Takagi–Sugeno Models
2013
This paper deals with the observer design for Takagi-Sugeno (T-S) fuzzy models subject to unknown inputs and disturbance affecting both states and outputs of the system. Sufficient conditions to design an unknown input T-S observer are given in linear matrix inequality (LMI) terms. Both continuous-time and discrete-time cases are studied. Relaxations are introduced by using intermediate variables. Extension to the case of unmeasured decision variables is also given. A numerical example is given to illustrate the effectiveness of the given results.
Design of robust observer for T-S fuzzy time-delayed systems subject to unknown inputs
2013
In this paper, a novel approach is proposed to design a robust observer for a class of Takagi-Sugeno (T-S) fuzzy models with unknown inputs and delays. The main contribution of this paper is to consider unknown inputs and a mixed neutral and discrete delay in the model. Also, the system is subject to disturbances, which are imposed on both state and output signals. Delay-dependent sufficient conditions for the design of an unknown input T-S observer with time delays are given in terms of linear matrix inequalities (LMIs). Some relaxations are introduced by using intermediate variables. A numerical example is given to illustrate the effectiveness of the given results.
Towards Dynamic Scripted pNFS Layouts
2012
Today's network file systems consist of a variety of complex subprotocols and backend storage classes. The data is typically spread over multiple data servers to achieve higher levels of performance and reliability. A metadata server is responsible for creating the mapping of a file to these data servers. It is hard to map application specific access patterns to storage system specific features, which can result in a degraded IO performance. We present an NFSv4.1/pNFS protocol extension that integrates the client's ability to provide hints and I/O advices to metadata servers. We define multiple storage classes and allow the client to choose which type of storage fits best for its desired ac…
One Phase Commit: A Low Overhead Atomic Commitment Protocol for Scalable Metadata Services
2012
As the number of client machines in high end computing clusters increases, the file system cannot keep up with the resulting volume of requests, using a centralized metadata server. This problem will be even more prominent with the advent of the exascale computing age. In this context, the centralized metadata server represents a bottleneck for the scaling of the file system performance as well as a single point of failure. To overcome this problem, file systems are evolving from centralized metadata services to distributed metadata services. The metadata distribution raises a number of additional problems that must be taken into account. In this paper we will focus on the problem of managi…
Identification and enumeration of contacts based on localization data to reduce the risk of infection
2021
Kontaktu identificēšana un uzskaitīšana, izmantojot lokalizācijas datus, dod iespēju samazināt inficēšanās risku. Ātra iespēja uzskaitīt un identificēt potenciālos kontaktus starp cilvēkiem dod iespēju ātri ierobežot Covid-19 izplatību starp cilvēkiem. Bakalaura darbs norit projekta “Multdisciplināra pieeja Covid-19 un citu nākotnes epidēmiju monitorēšanai, kontrolei un ierobežošanai Latvijā” ietvaros, kur tiek analizēti izsekošanas sensoru dati telpā. Darbā tiek izstrādāts un testēts datu ielādes modelis, kas dod iespēju veikt attiecīgās datu transformācijas un atlasīšanas, lai precīzi identificētu un uzskaitītu cilvēku kontaktus telpā. Tiek apskatītas dažādas vizualizācijas kā izkliedes d…
Performance Analysis of Memory Cloning Solutions in Mobile Edge Computing
2018
This paper deals with the problem of service migration in the emerging scenarios of Mobile Edge Computing. Mobile edge computing is achieved by moving the traditional cloud infrastructures, exploited by many today applications, close to the network edge in order to reduce the response times in the so called tactile-internet. However, because of user mobility, such an application architecture may pose the problem of service migration in case of handover from one server site to another. After introducing the current solutions for dealing with service migration and, in particular, the approaches based on service decomposition into multiple layers, we quantify the migration time and the service…