A Dynamic Migration Model for self-adaptive Genetic Algorithms

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).

The buoyant plume above a heat source

The boundary-layer type conservation equations of mass, momentum and energy for the steady free turbulent flow in gravitational convection over heat sources are set up for both two-dimensional and axisymmetric cases. These are reduced to ordinary differential equations in a similarity parameter by suitable transformations. The three classical hypotheses of turbulent diffusion-the Constant Exchange Coefficient hypothesis, Prandtl's Momentum Transfer theory and Taylor's Vorticity Transfer theory-are then incorporated into these equations in succession. The resulting equations are solved numerically and the results compared with some experimental results on gravitational convection over heat sources reported by Rouse et al.

Generic Routing Rules and a Scalable Access Enhancement for the Network-on-Chip RECONNECT

RECONNECT is a Network-on-Chip using a honeycomb topology. In this paper we focus on properties of general rules applicable to a variety of routing algorithms for the NoC which take into account the missing links of the honeycomb topology when compared to a mesh. We also extend the original proposal [5] and show a method to insert and extract data to and from the network. Access Routers at the boundary of the execution fabric establish connections to multiple periphery modules and create a torus to decrease the node distances. Our approach is scalable and ensures homogeneity among the compute elements in the NoC. We synthesized and evaluated the proposed enhancement in terms of power dissipation and area. Our results indicate that the impact of necessary alterations to the fabric is negligible and effects the data transfer between the fabric and the periphery only marginally.

Note: Dynamic point spread function for single and multiphoton fluorescence microscopy

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.

Note: Dynamic point spread function for single and multiphoton fluorescence microscopy

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.

A comparative study of dynamic,ductile fracture initiation in two specimen configurations

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.

Analysis of Dynamic Heterogeneity in a Glass Former from the Spatial Correlations of Mobility

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.

Molecular Caches: A caching structure for dynamic creation of application-specific Heterogeneous cache regions

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.

Dynamic programming based optimum non-uniform samples for speech reconstruction and coding

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.

Guessing under source uncertainty with side information

We study the problem of guessing the realization of a finite alphabet source, when some side information is provided, in a setting where the only knowledge the guesser has about the source and the correlated side information is that the joint source is one among a family. We define a notion of redundancy, identify a quantity that measures this redundancy, and study its properties. We then identify good guessing strategies that minimize the supremum redundancy (over the family). The minimum value measures the richness of the uncertainty class.

Design and analysis of rate aware ad hoc 802.11 networks

802.11 WLANs are characterized by high bit error rate and frequent changes in network topology. The key feature that distinguishes WLANs from wired networks is the multi-rate transmission capability, which helps to accommodate a wide range of channel conditions. This has a significant impact on higher layers such as routing and transport levels. While many WLAN products provide rate control at the hardware level to adapt to the channel conditions, some chipsets like Atheros do not have support for automatic rate control. We first present a design and implementation of an FER-based automatic rate control state machine, which utilizes the statistics available at the device driver to find the optimal rate. The results show that the proposed rate switching mechanism adapts quite fast to the channel conditions. The hop count metric used by current routing protocols has proven itself for single rate networks. But it fails to take into account other important factors in a multi-rate network environment. We propose transmission time as a better path quality metric to guide routing decisions. It incorporates the effects of contention for the channel, the air time to send the data and the asymmetry of links. In this paper, we present a new design for a multi-rate mechanism as well as a new routing metric that is responsive to the rate. We address the issues involved in using transmission time as a metric and presents a comparison of the performance of different metrics for dynamic routing.

A neuro-adaptive augmented optimal dynamic inversion approach for effective and efficient treatment of chronic myelogenous leukemia

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.

Evolution and decay of cylindrical and spherical nonlinear acoustic waves generated by a sinusoidal source

The present work gives a comprehensive numerical study of the evolution and decay of cylindrical and spherical nonlinear acoustic waves generated by a sinusoidal source. Using pseudospectral and predictor–corrector implicit finite difference methods, we first reproduced the known analytic results of the plane harmonic problem to a high degree of accuracy. The non-planar harmonic problems, for which the amplitude decay is faster than that for the planar case, are then treated. The results are correlated with the known asymptotic results of Scott (1981) and Enflo (1985). The constant in the old-age formula for the cylindrical canonical problem is found to be 1.85 which is rather close to 2, ‘estimated’ analytically by Enflo. The old-age solutions exhibiting strict symmetry about the maximum are recovered; these provide an excellent analytic check on the numerical solutions. The evolution of the waves for different source geometries is depicted graphically.