289 resultados para dynamic traffic assignment
Resumo:
In this paper, we propose a self Adaptive Migration Model for Genetic Algorithms, where parameters of population size, the number of points of crossover and mutation rate for each population are fixed adaptively. Further, the migration of individuals between populations is decided dynamically. This paper gives a mathematical schema analysis of the method stating and showing that the algorithm exploits previously discovered knowledge for a more focused and concentrated search of heuristically high yielding regions while simultaneously performing a highly explorative search on the other regions of the search space. The effective performance of the algorithm is then shown using standard testbed functions, when compared with Island model GA(IGA) and Simple GA(SGA).
Resumo:
We propose and demonstrate a dynamic point spread function (PSF) for single and multiphoton fluorescence microscopy. The goal is to generate a PSF whose shape and size can be maneuvered from highly localized to elongated one, thereby allowing shallow-to-depth excitation capability during active imaging. The PSF is obtained by utilizing specially designed spatial filter and dynamically altering the filter parameters. We predict potential applications in nanobioimaging and fluorescence microscopy.
Resumo:
We propose and demonstrate a dynamic point spread function (PSF) for single and multiphoton fluorescence microscopy. The goal is to generate a PSF whose shape and size can be maneuvered from highly localized to elongated one, thereby allowing shallow-to-depth excitation capability during active imaging. The PSF is obtained by utilizing specially designed spatial filter and dynamically altering the filter parameters. We predict potential applications in nanobioimaging and fluorescence microscopy.
Resumo:
In this work a single edge notched plate (SEN(T)) subjected to a tensile stress pulse is analysed, using a 2D plane strain dynamic finite element procedure. The interaction of the notch with a pre-nucleated hole ahead of it is examined. The background material is modelled by the Gurson constitutive law and ductile failure by microvoid coalescence in the ligament connecting the notch and the hole is simulated. Both rate independent and rate dependent material behaviour is considered. The notch tip region is subjected to a range of loading rates j by varying the peak value and the rise time of the applied stress pulse. The results obtained from these simulations are compared with a three point bend (TPB) specimen subjected to impact loading analysed in an earlier work [3] The variation of J at fracture initiation, J(c), with average loading rate j is obtained from the finite element simulations. It is found that the functional relationship between J(c) and j is fairly independent of the specimen geometry and is only dependent on material behaviour.
Resumo:
The growth of characteristic length scales associated with dynamic heterogeneity in glass-forming liquids is investigated in an extensive computational study of a four-point, time-dependent structure factor defined from spatial correlations of mobility, for a model liquid for system sizes extending up to 351 232 particles, in constant-energy and constant-temperature ensembles. Our estimates for dynamic correlation lengths and susceptibilities are consistent with previous results from finite size scaling. We find scaling exponents that are inconsistent with predictions from inhomogeneous mode coupling theory and a recent simulation confirmation of these predictions.
Resumo:
CMPs enable simultaneous execution of multiple applications on the same platforms that share cache resources. Diversity in the cache access patterns of these simultaneously executing applications can potentially trigger inter-application interference, leading to cache pollution. Whereas a large cache can ameliorate this problem, the issues of larger power consumption with increasing cache size, amplified at sub-100nm technologies, makes this solution prohibitive. In this paper in order to address the issues relating to power-aware performance of caches, we propose a caching structure that addresses the following: 1. Definition of application-specific cache partitions as an aggregation of caching units (molecules). The parameters of each molecule namely size, associativity and line size are chosen so that the power consumed by it and access time are optimal for the given technology. 2. Application-Specific resizing of cache partitions with variable and adaptive associativity per cache line, way size and variable line size. 3. A replacement policy that is transparent to the partition in terms of size, heterogeneity in associativity and line size. Through simulation studies we establish the superiority of molecular cache (caches built as aggregations of molecules) that offers a 29% power advantage over that of an equivalently performing traditional cache.
Resumo:
Non-uniform sampling of a signal is formulated as an optimization problem which minimizes the reconstruction signal error. Dynamic programming (DP) has been used to solve this problem efficiently for a finite duration signal. Further, the optimum samples are quantized to realize a speech coder. The quantizer and the DP based optimum search for non-uniform samples (DP-NUS) can be combined in a closed-loop manner, which provides distinct advantage over the open-loop formulation. The DP-NUS formulation provides a useful control over the trade-off between bitrate and performance (reconstruction error). It is shown that 5-10 dB SNR improvement is possible using DP-NUS compared to extrema sampling approach. In addition, the close-loop DP-NUS gives a 4-5 dB improvement in reconstruction error.
Resumo:
Most of the structural elements like beams, cables etc. are flexible and should be modeled as distributed parameter systems (DPS) to represent the reality better. For large structures, the usual approach of 'modal representation' is not an accurate representation. Moreover, for excessive vibrations (possibly due to strong wind, earthquake etc.), external power source (controller) is needed to suppress it, as the natural damping of these structures is usually small. In this paper, we propose to use a recently developed optinial dynamic inversion technique to design a set of discrete controllers for this purpose. We assume that the control force to the structure is applied through finite number of actuators, which are located at predefined locations in the spatial domain. The method used in this paper determines control forces directly from the partial differential equation (PDE) model of the system. The formulation has better practical significance, both because it leads to a closed form solution of the controller (hence avoids computational issues) as well as because a set of discrete actuators along the spatial domain can be implemented with relative ease (as compared to a continuous actuator).
Resumo:
Combining the advanced techniques of optimal dynamic inversion and model-following neuro-adaptive control design, an efficient technique is presented for effective treatment of chronic myelogenous leukemia (CML). A recently developed nonlinear mathematical model for cell dynamics is used for the control (medication) synthesis. First, taking a set of nominal parameters, a nominal controller is designed based on the principle of optimal dynamic inversion. This controller can treat nominal patients (patients having same nominal parameters as used for the control design) effectively. However, since the parameters of an actual patient can be different from that of the ideal patient, to make the treatment strategy more effective and efficient, a model-following neuro-adaptive controller is augmented to the nominal controller. In this approach, a neural network trained online (based on Lyapunov stability theory) facilitates a new adaptive controller, computed online. From the simulation studies, this adaptive control design approach (treatment strategy) is found to be very effective to treat the CML disease for actual patients. Sufficient generality is retained in the theoretical developments in this paper, so that the techniques presented can be applied to other similar problem as well. Note that the technique presented is computationally non-intensive and all computations can be carried out online.
Resumo:
The problem of assigning customers to satellite channels is considered. Finding an optimal allocation of customers to satellite channels is a difficult combinatorial optimization problem and is shown to be NP-complete in an earlier study. We propose a genetic algorithm (GA) approach to search for the best/optimal assignment of customers to satellite channels. Various issues related to genetic algorithms such as solution representation, selection methods, genetic operators and repair of invalid solutions are presented. A comparison of this approach with the standard optimization method is presented to show the advantages of this approach in terms of computation time
Resumo:
The problem of time variant reliability analysis of existing structures subjected to stationary random dynamic excitations is considered. The study assumes that samples of dynamic response of the structure, under the action of external excitations, have been measured at a set of sparse points on the structure. The utilization of these measurements m in updating reliability models, postulated prior to making any measurements, is considered. This is achieved by using dynamic state estimation methods which combine results from Markov process theory and Bayes' theorem. The uncertainties present in measurements as well as in the postulated model for the structural behaviour are accounted for. The samples of external excitations are taken to emanate from known stochastic models and allowance is made for ability (or lack of it) to measure the applied excitations. The future reliability of the structure is modeled using expected structural response conditioned on all the measurements made. This expected response is shown to have a time varying mean and a random component that can be treated as being weakly stationary. For linear systems, an approximate analytical solution for the problem of reliability model updating is obtained by combining theories of discrete Kalman filter and level crossing statistics. For the case of nonlinear systems, the problem is tackled by combining particle filtering strategies with data based extreme value analysis. In all these studies, the governing stochastic differential equations are discretized using the strong forms of Ito-Taylor's discretization schemes. The possibility of using conditional simulation strategies, when applied external actions are measured, is also considered. The proposed procedures are exemplifiedmby considering the reliability analysis of a few low-dimensional dynamical systems based on synthetically generated measurement data. The performance of the procedures developed is also assessed based on a limited amount of pertinent Monte Carlo simulations. (C) 2010 Elsevier Ltd. All rights reserved.
Resumo:
The flapping equation for a rotating rigid helicopter blade is typically derived by considering (1)small flap angle, (2) small induced angle of attack and (3) linear aerodynamics. However, the use of nonlinear aerodynamics such as dynamic stall can make the assumptions of small angles suspect as shown in this paper. A general equation describing helicopter blade flap dynamics for large flap angle and large induced inflow angle of attack is derived. A semi-empirical dynamic stall aerodynamics model (ONERA model) is used. Numerical simulations are performed by solving the nonlinear flapping ordinary differential equation for steady state conditions and the validity of the small angle approximations are examined. It is shown that the small flapping assumption, and to a lesser extent, the small induced angle ofattack assumption, can lead to inaccurate predictions of the blade flap response in certain flight conditions for some rotors when nonlinear aerodynamics is considered. (C) 2010 Elsevier Inc. All rights reserved.