Search results for " algorithm"
showing 10 items of 2538 documents
Network Slicing Enabled Resource Management for Service-Oriented Ultra-Reliable and Low-Latency Vehicular Networks
2020
Network slicing has been considered as a promising candidate to provide customized services for vehicular applications that have extremely high requirements of latency and reliability. However, the high mobility of vehicles poses significant challenges to resource management in such a stochastic vehicular environment with time-varying service demands. In this paper, we develop an online network slicing scheduling strategy for joint resource block (RB) allocation and power control in vehicular networks. The long-term time-averaged total system capacity is maximized while guaranteeing strict ultra-reliable and low-latency requirements of vehicle communication links, subject to stability const…
Distributed Leader Election and Computation of Local Identifiers for Programmable Matter
2019
International audience; The context of this paper is programmable matter, which consists of a set of computational elements, called particles, in an infinite graph. The considered infinite graphs are the square, triangular and king grids. Each particle occupies one vertex, can communicate with the adjacent particles, has the same clockwise direction and knows the local positions of neighborhood particles. Under these assumptions, we describe a new leader election algorithm affecting a variable to the particles, called the k-local identifier, in such a way that particles at close distance have each a different k-local identifier. For all the presented algorithms, the particles only need a O(…
Decremental 2- and 3-connectivity on planar graphs
1996
We study the problem of maintaining the 2-edge-, 2-vertex-, and 3-edge-connected components of a dynamic planar graph subject to edge deletions. The 2-edge-connected components can be maintained in a total ofO(n logn) time under any sequence of at mostO(n) deletions. This givesO(logn) amortized time per deletion. The 2-vertex- and 3-edge-connected components can be maintained in a total ofO(n log2n) time. This givesO(log2n) amortized time per deletion. The space required by all our data structures isO(n). All our time bounds improve previous bounds.
Actuators and sensors allocation for adjacent buildings vibration control
2012
This paper puts forward an actuators and sensors allocation approach to the design of the adjacent buildings vibration attenuation under seismic excitation. A full order model of an adjacent buildings system with the location information of actuators and sensors is considered and by retaining the modes which make the largest contributions to the model with the Modal Cost Analysis (MCA), a reduced order model is established so that the controller can be designed conveniently. In view of the fact that not all the states of the system can be measured by the sensors, a dynamic output feedback H ∞ controller is designed for the adjacent buildings system. By considering that the output powers of …
Convolutional architectures for virtual screening
2020
Abstract Background A Virtual Screening algorithm has to adapt to the different stages of this process. Early screening needs to ensure that all bioactive compounds are ranked in the first positions despite of the number of false positives, while a second screening round is aimed at increasing the prediction accuracy. Results A novel CNN architecture is presented to this aim, which predicts bioactivity of candidate compounds on CDK1 using a combination of molecular fingerprints as their vector representation, and has been trained suitably to achieve good results as regards both enrichment factor and accuracy in different screening modes (98.55% accuracy in active-only selection, and 98.88% …
Visual dynamic environment for distributed systems
2002
Algorithms, based on information fusion, are often embodied in visual perception systems. Distributed architectures have been recently proposed to perform integrated computation. The complexity of distributed systems regards both their design, and the software environment to develop applications. Visual and iconic programming style intends to provide expressive tools to implement, to debug, and to execute programs in distributed environment. Multi-layers graphs languages seem suitable to handle such complexity. This paper describes the design of a visual dynamic environment (VDE), which is based on a graph-grammar. A new class of dynamic visual interfaces is also introduced, and its propert…
2014 ESC Guidelines on the diagnosis and management of acute pulmonary embolism
2014
ACS : acute coronary syndrome AMPLIFY : Apixaban for the Initial Management of Pulmonary Embolism and Deep-Vein Thrombosis as First-line Therapy aPTT : activated partial thromboplastin time b.i.d. : bis in diem (twice daily) b.p.m. : beats per minute BNP : brain natriuretic peptide BP : blood pressure CI : confidence interval CO : cardiac output COPD : chronic obstructive pulmonary disease CPG : Committee for Practice Guidelines CRNM : clinically relevant non-major CT : computed tomographic/tomogram CTEPH : chronic thromboembolic pulmonary hypertension CUS : compression venous ultrasonography DSA : digital subtraction angiography DVT : deep vein thrombosis ELISA : enzyme-linked immunosorben…
Hot-spot detection and characterization of strombolian activity from MODIS infrared data
2014
Identifying and characterizing strombolian activity from space is a challenging task for satellite-based infrared systems. Stromboli volcano is a natural laboratory that offers a unique opportunity for refining thermal remote-sensing applications that involve transient phenomena and small to moderate hot-spots. A new simple and fast algorithm gave us the opportunity to revisit the MODIS-derived thermal output at Stromboli volcano over the last 13 years. The new algorithm includes both night-time and daytime data and shows high performance with the detection of small-amplitude thermal anomalies ( 1000 MW). The ...
An adaptive method for Volterra–Fredholm integral equations on the half line
2009
AbstractIn this paper we develop a direct quadrature method for solving Volterra–Fredholm integral equations on an unbounded spatial domain. These problems, when related to some important physical and biological phenomena, are characterized by kernels that present variable peaks along space. The method we propose is adaptive in the sense that the number of spatial nodes of the quadrature formula varies with the position of the peaks. The convergence of the method is studied and its performances are illustrated by means of a few significative examples. The parallel algorithm which implements the method and its performances are described.
Agent assisted interactive algorithm for computationally demanding multiobjective optimization problems
2015
Abstract We generalize the applicability of interactive methods for solving computationally demanding, that is, time-consuming, multiobjective optimization problems. For this purpose we propose a new agent assisted interactive algorithm. It employs a computationally inexpensive surrogate problem and four different agents that intelligently update the surrogate based on the preferences specified by a decision maker. In this way, we decrease the waiting times imposed on the decision maker during the interactive solution process and at the same time decrease the amount of preference information expected from the decision maker. The agent assisted algorithm is not specific to any interactive me…