Search results for " Programming"
showing 10 items of 1616 documents
Pre-emption in resource-constrained project scheduling
2008
Abstract The Resource-Constrained Project Scheduling Project (RCPSP), together with some of its extensions, has been widely studied. A fundamental assumption in this basic problem is that activities in progress are non-preemptable. Very little effort has been made to uncover the potential benefits of discrete activity pre-emption, and the papers dealing with this issue have reached the conclusion that it has little effect on project length when constant resource availability levels are defined. In this paper we show how three basic elements of many heuristics for the RCPSP – codification, serial SGS and double justification – can be adapted to deal with interruption. The paper is mainly foc…
An adaptive multimeme algorithm for designing HIV multidrug therapies.
2007
This paper proposes a period representation for modeling the multidrug HIV therapies and an Adaptive Multimeme Algorithm (AMmA) for designing the optimal therapy. The period representation offers benefits in terms of flexibility and reduction in dimensionality compared to the binary representation. The AMmA is a memetic algorithm which employs a list of three local searchers adaptively activated by an evolutionary framework. These local searchers, having different features according to the exploration logic and the pivot rule, have the role of exploring the decision space from different and complementary perspectives and, thus, assisting the standard evolutionary operators in the optimizati…
MAC learning
2016
Cognition as a way to deal with the challenges of future wireless networks has been largely considered by the recent literature, with a main focus on physical layer adaptability and dynamic spectrum access. In this demo, we show how a simple cognition mechanism can be also applied at the MAC layer, by exploiting the emerging paradigm of programmable wireless cards. The idea is using the formal definition of simple MAC protocol components and platform-independent representation of channel events gathered from the wireless node, for emulating the behavior of protocols which are not currently running on the network, learning about their expected performance, and dynamically reconfiguring the w…
Reaction-diffusion on dynamic inhibition areas: A bio-inspired link scheduling algorithm
2014
We present the Dynamic Inhibition Areas Reaction-Diffusion (DIA-RD) algorithm, a distributed medium access control protocol that globally maximizes the spatial reusability (number of simultaneous transmissions per unit area) of wireless sensor networks. This algorithm is able, in consequence, to minimize the number of time slots needed to schedule the set of demanded links, making it very efficient to solve the Shortest Link Schedule problem. DIA-RD combines accurate interference management, provided by the use of dynamic inhibition areas based on the physical interference model; and global intelligent behavior, provided by the bio-inspired technique known as Reaction-Diffusion. This techni…
Dissemination protocol for Heterogeneous Cooperative Vehicular Networks
2012
International audience; The difficulties associated with network connectivity, unreliable channels, and city environment characteristics make data dissemination task in vehicular urban networks a real challenge. Recently, some interesting solutions have been proposed to perform data dissemination in this environment. Starting from the analysis of these solutions, we present a new dissemination protocol named DHVN (Dissemination protocol for Heterogeneous Cooperative Vehicular Networks) that considers: (i) roads topology, (ii) network connectivity and possible partitioning in case of low traffic density, and (iii) heterogeneous communication capabilities of the vehicles. We compare our proto…
Fast narrowing-driven partial evaluation for inductively sequential programs
2005
Narrowing-driven partial evaluation is a powerful technique for the specialization of (first-order) functional and functional logic programs. However, although it gives good results on small programs, it does not scale up well to realistic problems (e.g., interpreter specialization). In this work, we introduce a faster partial evaluation scheme by ensuring the termination of the process offline . For this purpose, we first characterize a class of programs which are quasi-terminating , i.e., the computations performed with needed narrowing—the symbolic computation mechanism of narrowing-driven partial evaluation—only contain finitely many different terms (and, thus, partial evaluation termi…
Motion Cueing Algorithms: A Review
2017
Robotic motion platforms are commonly used in motion-based vehicle simulation. However, the reproduction of realistic accelerations within a reduced workspace is a major challenge. Thus, high-level control strategies commonly referred to as motion cueing algorithms (MCA) are required to convert the simulated vehicle physical state into actual motion for the motion platform. This paper reviews the most important strategies for the generation of motion cues in simulators, listing the advantages and drawbacks of the different solutions. The motion cueing problem, a general scheme and the four most common approaches – classical washout, adaptive washout, optimal control and model predictive con…
Combining hashing and enciphering algorithms for epidemiological analysis of gathered data.
2008
Summary Objectives: Compiling individual records coming from different sources is necessary for multi-center studies. Legal aspects can be satisfied by implementing anonymization procedures. When using these procedures with a different key for each study it becomes almost impossible to link records from separate data collections. Methods: The originality of the method relies on the way the combination of hashing and enciphering techniques is performed: like in asymmetric encryption, two keys are used but the private key depends on the patient’s identity. Results: The combination of hashing and enciphering techniques provides a great improvement in the overall security of the proposed scheme…
New descent rules for solving the linear semi-infinite programming problem
1994
The algorithm described in this paper approaches the optimal solution of a continuous semi-infinite linear programming problem through a sequence of basic feasible solutions. The descent rules that we present for the improvement step are quite different when one deals with non-degenerate or degenerate extreme points. For the non-degenerate case we use a simplex-type approach, and for the other case a search direction scheme is applied. Some numerical examples illustrating the method are given.
Generalized wavelets design using Kernel methods. Application to signal processing
2013
Abstract Multiresolution representations of data are powerful tools in signal processing. In Harten’s framework, multiresolution transforms are defined by predicting finer resolution levels of information from coarser ones using an operator, called the prediction operator, and defining details (or wavelet coefficients) that are the difference between the exact values and the predicted values. In this paper we present a multiresolution scheme using local polynomial regression theory in order to design a more accurate prediction operator. The stability of the scheme is proved and the order of the method is calculated. Finally, some results are presented comparing our method with the classical…