Influence of system size on spatiotemporal dynamics of a model for plastic instability: Projecting low-dimensional and extensive chaos

This work is a continuation of our efforts to quantify the irregular scalar stress signals from the Ananthakrishna model for the Portevin-Le Chatelier instability observed under constant strain rate deformation conditions. Stress related to the spatial average of the dislocation activity is a dynamical variable that also determines the time evolution of dislocation densities. We carry out detailed investigations on the nature of spatiotemporal patterns of the model realized in the form of different types of dislocation bands seen in the entire instability domain and establish their connection to the nature of stress serrations. We then characterize the spatiotemporal dynamics of the model equations by computing the Lyapunov dimension as a function of the drive parameter. The latter scales with the system size only for low strain rates, where isolated dislocation bands are seen, and at high strain rates, where fully propagating bands are seen. At intermediate applied strain rates corresponding to the partially propagating bands, the Lyapunov dimension exhibits two distinct slopes, one for small system sizes and another for large. This feature is rationalized by demonstrating that the spatiotemporal patterns for small system sizes are altered from the partially propagating band types to isolated burst type. This in turn allows us to reconfirm that low-dimensional chaos is projected from the stress signals as long as there is a one-to-one correspondence between the bursts of dislocation bands and the stress drops. We then show that the stress signals in the regime of partially to fully propagative bands have features of extensive chaos by calculating the correlation dimension density. We also show that the correlation dimension density also depends on the system size. A number of issues related to the system size dependence of the Lyapunov dimension density and the correlation dimension density are discussed.

A self-adaptive migration model genetic algorithm for data mining applications

Data mining involves nontrivial process of extracting knowledge or patterns from large databases. Genetic Algorithms are efficient and robust searching and optimization methods that are used in data mining. In this paper we propose a Self-Adaptive Migration Model GA (SAMGA), where parameters of population size, the number of points of crossover and mutation rate for each population are adaptively fixed. 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 and a set of actual classification datamining problems. Michigan style of classifier was used to build the classifier and the system was tested with machine learning databases of Pima Indian Diabetes database, Wisconsin Breast Cancer database and few others. The performance of our algorithm is better than others.

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

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

Group Testing-Based Spectrum Hole Search for Cognitive Radios

This paper investigates the use of adaptive group testing to find a spectrum hole of a specified bandwidth in a given wideband of interest. We propose a group testing-based spectrum hole search algorithm that exploits sparsity in the primary spectral occupancy by testing a group of adjacent subbands in a single test. This is enabled by a simple and easily implementable sub-Nyquist sampling scheme for signal acquisition by the cognitive radios (CRs). The sampling scheme deliberately introduces aliasing during signal acquisition, resulting in a signal that is the sum of signals from adjacent subbands. Energy-based hypothesis tests are used to provide an occupancy decision over the group of subbands, and this forms the basis of the proposed algorithm to find contiguous spectrum holes of a specified bandwidth. We extend this framework to a multistage sensing algorithm that can be employed in a variety of spectrum sensing scenarios, including noncontiguous spectrum hole search. Furthermore, we provide the analytical means to optimize the group tests with respect to the detection thresholds, number of samples, group size, and number of stages to minimize the detection delay under a given error probability constraint. Our analysis allows one to identify the sparsity and SNR regimes where group testing can lead to significantly lower detection delays compared with a conventional bin-by-bin energy detection scheme; the latter is, in fact, a special case of the group test when the group size is set to 1 bin. We validate our analytical results via Monte Carlo simulations.

Design and implementation of spectrum sensing for cognitive radios with a frequency-hopping primary system

In this work, spectrum sensing for cognitive radios is considered in the presence of multiple Primary Users (PU) using frequency-hopping communication over a set of frequency bands. The detection performance of the Fast Fourier Transform (FFT) Average Ratio (FAR) algorithm is obtained in closed-form, for a given FFT size and number of PUs. The effective throughput of the Secondary Users (SU) is formulated as an optimization problem with a constraint on the maximum allowable interference on the primary network. Given the hopping period of the PUs, the sensing duration that maximizes the SU throughput is derived. The results are validated using Monte Carlo simulations. Further, an implementation of the FAR algorithm on the Lyrtech (now, Nutaq) small form factor software defined radio development platform is presented, and the performance recorded through the hardware is observed to corroborate well with that obtained through simulations, allowing for implementation losses. (C) 2015 Elsevier B.V. All rights reserved.

Effect of myonuclear number and mitochondrial fusion on Drosophila indirect flight muscle organization and size

Mechanisms involved in establishing the organization and numbers of fibres in a muscle are not completely understood. During Drosophila indirect flight muscle (IFM) formation, muscle growth is achieved by both incorporating hundreds of nuclei, and hypertrophy. As a result, IFMs provide a good model with which to understand the mechanisms that govern overall muscle organization and growth. We present a detailed analysis of the organization of dorsal longitudinal muscles (DLMs), a subset of the IFMs. We show that each DLM is similar to a vertebrate fascicle and consists of multiple muscle fibres. However, increased fascicle size does not necessarily change the number of constituent fibres, but does increase the number of myofibrils packed within the fibres. We also find that altering the number of myoblasts available for fusion changes DLM fascicle size and fibres are loosely packed with myofibrils. Additionally, we show that knock down of genes required for mitochondrial fusion causes a severe reduction in the size of DLM fascicles and fibres. Our results establish the organization levels of DLMs and highlight the importance of the appropriate number of nuclei and mitochondrial fusion in determining the overall organization, growth and size of DLMs. (C) 2013 Elsevier Inc. All rights reserved.

Factors influencing seasonal and monthly changes in the group size of chital or axis deer in southern India

Chital or axis deer (Axis axis) form fluid groups that change in size temporally and in relation to habitat. Predictions of hypotheses relating animal density, rainfall, habitat structure, and breeding seasonality, to changes in chital group size were assessed simultaneously using multiple regression models of monthly data collected over a 2 yr period in Guindy National Park, in southern India. Over 2,700 detections of chital groups were made during four seasons in three habitats (forest, scrubland and grassland). In scrubland and grassland, chital group size was positively related to animal density, which increased with rainfall. This suggests that in these habitats, chital density increases in relation to food availability, and group sizes increase due to higher encounter rate and fusion of groups. The density of chital in forest was inversely related to rainfall, but positively to the number of fruiting tree species and availability of fallen litter, their forage in this habitat. There was little change in mean group size in the forest, although chital density more than doubled during the dry season and summer. Dispersion of food items or the closed nature of the forest may preclude formation of larger groups. At low densities, group sizes in all three habitats were similar. Group sizes increased with chital density in scrubland and grassland, but more rapidly in the latter—leading to a positive relationship between openness and mean group size at higher densities. It is not clear, however, that this relationship is solely because of the influence of habitat structure. The rutting index (monthly percentage of adult males in hard antler) was positively related to mean group size in forest and scrubland, probably reflecting the increase in group size due to solitary males joining with females during the rut. The fission-fusion system of group formation in chital is thus interactively influenced by several factors. Aspects that need further study, such as interannual variability, are highlighted.

Evolution of polyandry by reduction in progeny number variance in structured populations

When there is a variation in the quality of males in a population, multiple mating can lead to an increase in the genetic fitness of a female by reducing the variance of the progeny number. The extent of selective advantage obtainable by this process is investigated for a population subdivided into structured demes. It is seen that for a wide range of model parameters (deme size, distribution of male quality, local resource level), multiple mating leads to a considerable increase in the fitness. Frequency-dependent selection or a stable coexistence between polyandry and monandry can also result when the possible costs involved in multiple mating are taken into account.

On Finding the Natural Number of Topics with Latent Dirichlet Allocation: Some Observations

It is important to identify the ``correct'' number of topics in mechanisms like Latent Dirichlet Allocation(LDA) as they determine the quality of features that are presented as features for classifiers like SVM. In this work we propose a measure to identify the correct number of topics and offer empirical evidence in its favor in terms of classification accuracy and the number of topics that are naturally present in the corpus. We show the merit of the measure by applying it on real-world as well as synthetic data sets(both text and images). In proposing this measure, we view LDA as a matrix factorization mechanism, wherein a given corpus C is split into two matrix factors M-1 and M-2 as given by C-d*w = M1(d*t) x Q(t*w).Where d is the number of documents present in the corpus anti w is the size of the vocabulary. The quality of the split depends on ``t'', the right number of topics chosen. The measure is computed in terms of symmetric KL-Divergence of salient distributions that are derived from these matrix factors. We observe that the divergence values are higher for non-optimal number of topics - this is shown by a `dip' at the right value for `t'.

Design of speaker identification schemes for large number of speakers (A)

Design of speaker identification schemes for a small number of speakers (around 10) with a high degree of accuracy in controlled environment is a practical proposition today. When the number of speakers is large (say 50–100), many of these schemes cannot be directly extended, as both recognition error and computation time increase monotonically with population size. The feature selection problem is also complex for such schemes. Though there were earlier attempts to rank order features based on statistical distance measures, it has been observed only recently that the best two independent measurements are not the same as the combination in two's for pattern classification. We propose here a systematic approach to the problem using the decision tree or hierarchical classifier with the following objectives: (1) Design of optimal policy at each node of the tree given the tree structure i.e., the tree skeleton and the features to be used at each node. (2) Determination of the optimal feature measurement and decision policy given only the tree skeleton. Applicability of optimization procedures such as dynamic programming in the design of such trees is studied. The experimental results deal with the design of a 50 speaker identification scheme based on this approach.

H I deficiency in cluster spiral galaxies - Dependence on galaxy size

From the available H I data on spiral galaxies in three rich Abell clusters and the Virgo Cluster, it is shown that galaxies with medium to large optical sizes tend to be more severely deficient in atomic hydrogen than the small galaxies. This is so both in terms of the fractional number of galaxies that are deficient and the amount of gas lost by a galaxy. The fraction of H I-deficient galaxies increases with size over most of the size range, saturating or dropping only for the largest galaxies. A comparative study is made of various currently accepted gas removal mechanisms, namely those which are a result of galaxy-intracluster medium interactions, e.g., ram pressure stripping, as well as those due to galaxy-galaxy interactions, i.e., collisions and tidal interactions. It is shown that, with the exception of tidal interactions, all of these mechanisms would produce a size dependence in H I deficiency that is the opposite of that observed. That is, the gas in the largest galaxies would be the least affected by these mechanisms. However, if there is significant mass segregation, these processes may give the trends observed in the size dependence of H I deficiency.

Fatigue crack propagation model and size effect in concrete using dimensional analysis

It is well known that fatigue in concrete causes excessive deformations and cracking leading to structural failures. Due to quasi-brittle nature of concrete and formation of a fracture process zone, the rate of fatigue crack growth depends on a number of parameters, such as, the tensile strength, fracture toughness, loading ratio and most importantly the structural size. In this work, an analytical model is proposed for estimating the fatigue crack growth in concrete by using the concepts of dimensional analysis and including the above parameters. Knowing the governed and the governing parameters of the physical problem and by using the concepts of self-similarity, a relationship is obtained between different parameters involved. It is shown that the proposed fatigue law is able to capture the size effect in plain concrete and agrees well with different experimental results. Through a sensitivity analysis, it is shown that the structural size plays a dominant role followed by loading ratio and the initial crack length in fatigue crack propagation. (C) 2010 Elsevier Ltd. All rights reserved.

Rainbow Connection Number and Radius

Rainbow connection number, rc(G), of a connected graph G is the minimum number of colours needed to colour its edges, so that every pair of vertices is connected by at least one path in which no two edges are coloured the same. In this note we show that for every bridgeless graph G with radius r, rc(G) <= r(r+2). We demonstrate that this bound is the best possible for rc(G) as a function of r, not just for bridgeless graphs, but also for graphs of any stronger connectivity. It may be noted that, for a general 1-connected graph G, rc(G) can be arbitrarily larger than its radius (K_{1,n} for instance). We further show that for every bridgeless graph G with radius r and chordality (size of a largest induced cycle) k, rc(G) <= rk. Hitherto, the only reported upper bound on the rainbow connection number of bridgeless graphs is 4n/5 - 1, where n is order of the graph [Caro et al., 2008]

Particle dynamics in the channel flow of a turbulent particle-gas suspension at high Stokes number. Part 2. Comparison of fluctuating force simulations and experiments

The particle and fluid velocity fluctuations in a turbulent gas-particle suspension are studied experimentally using two-dimensional particle image velocimetry with the objective of comparing the experiments with the predictions of fluctuating force simulations. Since the fluctuating force simulations employ force distributions which do not incorporate the modification of fluid turbulence due to the particles, it is of importance to quantify the turbulence modification in the experiments. For experiments carried out at a low volume fraction of 9.15 x 10(-5) (mass loading is 0.19), where the viscous relaxation time is small compared with the time between collisions, it is found that the gas-phase turbulence is not significantly modified by the presence of particles. Owing to this, quantitative agreement is obtained between the results of experiments and fluctuating force simulations for the mean velocity and the root mean square of the fluctuating velocity, provided that the polydispersity in the particle size is incorporated in the simulations. This is because the polydispersity results in a variation in the terminal velocity of the particles which could induce collisions and generate fluctuations; this mechanism is absent if all of the particles are of equal size. It is found that there is some variation in the particle mean velocity very close to the wall depending on the wall-collision model used in the simulations, and agreement with experiments is obtained only when the tangential wall-particle coefficient of restitution is 0.7. The mean particle velocity is in quantitative agreement for locations more than 10 wall units from the wall of the channel. However, there are systematic differences between the simulations and theory for the particle concentrations, possibly due to inadequate control over the particle feeding at the entrance. The particle velocity distributions are compared both at the centre of the channel and near the wall, and the shape of the distribution function near the wall obtained in experiments is accurately predicted by the simulations. At the centre, there is some discrepancy between simulations and experiment for the distribution of the fluctuating velocity in the flow direction, where the simulations predict a bi-modal distribution whereas only a single maximum is observed in the experiments, although both distributions are skewed towards negative fluctuating velocities. At a much higher particle mass loading of 1.7, where the time between collisions is smaller than the viscous relaxation time, there is a significant increase in the turbulent velocity fluctuations by similar to 1-2 orders of magnitude. Therefore, it becomes necessary to incorporate the modified fluid-phase intensity in the fluctuating force simulation; with this modification, the mean and mean-square fluctuating velocities are within 20-30% of the experimental values.