Search results for " Simulation"
showing 10 items of 4034 documents
Thermoelastic stress analysis by means of an infrared scanner and a two-dimensional fast Fourier transform-based lock-in technique
2008
An infrared thermographic experimental set-up has been proposed and evaluated towards the capability to measure thermoelastic-effect-induced temperature changes. A standard infrared thermocamera with a nominal noise-equivalent temperature difference (NETD) resolution of 0.12 K has been employed to measure the temperature from unidirectional glass-reinforced plastic tensile coupons under cyclic sinusoidal loads. The raster scanning mode of the camera single detector produces a time delay in acquiring the signal from two succeeding pixels on the same row, and from consecutive scanned rows. By exploiting the acquired dwell times, it was possible to produce a periodic pattern on the thermal ma…
Transport of Mobile Particles in an Immobile Environment: Computer Simulations of Sodium Silicates
2007
Molecular dynamics (MD) simulations of various sodium silicate melts, (Na2O)x(SiO2) with x=2, 3, 20, are presented. In these systems, the mobility of sodium ions is much higher, often by orders of magnitude, than that of the silicon and oxygen atoms forming a tetrahedral network structure. We show that the high mobility of sodium is intimately related to the chemical ordering in sodium silicates. A network of percolating sodium-rich channels is formed in the static structure that serve as diffusion channels for the sodium ions. This channel network is revealed in static structure factors by a prepeak at the wavenumber q=0.95 A-1. Inelastic neutron scattering experiments of sodium silicate m…
Checkpointing Workflows for Fail-Stop Errors
2017
International audience; We consider the problem of orchestrating the exe- cution of workflow applications structured as Directed Acyclic Graphs (DAGs) on parallel computing platforms that are subject to fail-stop failures. The objective is to minimize expected overall execution time, or makespan. A solution to this problem consists of a schedule of the workflow tasks on the available processors and of a decision of which application data to checkpoint to stable storage, so as to mitigate the impact of processor failures. For general DAGs this problem is hopelessly intractable. In fact, given a solution, computing its expected makespan is still a difficult problem. To address this challenge,…
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…
Justification and RCPSP: A technique that pays
2005
Abstract The objective of this paper is to show that justification is a simple technique that can be easily incorporated in diverse algorithms for the resource-constrained project scheduling problem––improving the quality of the schedules generated without generally requiring more computing time. The results of incorporating this technique in 22 different algorithms are shown. Fifteen of the new algorithms that use double justification outperform seven of the best heuristic algorithms that do not use justification. The tests have been performed on the standard test set j120 for the RCPSP generated using ProGen.
Design and implementation of a course scheduling system using Tabu Search
2002
Abstract Building a course timetable is a difficult and lengthy task which universities devote a large amount of human and material resources to every year. We have developed a computer package to solve this problem. The program runs on a PC and the user may set the objectives and parameters from among a wide range of possibilities. It has a user-friendly interface for the user to input the relevant data and obtain the corresponding results. The optimization process is based on a set of heuristic algorithms. The core is a Tabu Search procedure for which several strategies have been developed and tested in order to get a fast and powerful algorithm. The first tests of the package have produc…
Serial In-network Processing for Large Stationary Wireless Sensor Networks
2017
International audience; In wireless sensor networks, a serial processing algorithm browses nodes one by one and can perform different tasks such as: creating a schedule among nodes, querying or gathering data from nodes, supplying nodes with data, etc. Apart from the fact thatserial algorithms totally avoid collisions, numerous recent works have confirmed that these algorithms reduce communications andconsiderably save energy and time in large-dense networks. Yet, due to the path construction complexity, the proposed algorithmsare not optimal and their performances can be further enhanced. To do so, in the present paper, we propose a new serial processing algorithm that, in most of the case…
A hybrid genetic algorithm for the resource-constrained project scheduling problem
2008
Abstract In this paper we propose a Hybrid Genetic Algorithm (HGA) for the Resource-Constrained Project Scheduling Problem (RCPSP). HGA introduces several changes in the GA paradigm: a crossover operator specific for the RCPSP; a local improvement operator that is applied to all generated schedules; a new way to select the parents to be combined; and a two-phase strategy by which the second phase re-starts the evolution from a neighbour’s population of the best schedule found in the first phase. The computational results show that HGA is a fast and high quality algorithm that outperforms all state-of-the-art algorithms for the RCPSP known by the authors of this paper for the instance sets j…
Developing a Tool Point Control Scheme for a Hydraulic Crane Using Interactive Real-time Dynamic Simulation
2010
This paper describes the implementation of an interactive real-time dynamic simulation model of a hydraulic crane. The user input to the model is given continuously via joystick and output is presented continuously in a 3D animation. Using this simulation model, a tool point control scheme is developed for the specific crane, considering the saturation phenomena of the system and practical implementation. This paper describes the implementation of an interactive real-time dynamic simulation model of a hydraulic crane. The user input to the model is given continuously via joystick and output is presented continuously in a 3D animation. Using this simulation model, a tool point control scheme…