The subcycled Newmark algorithm

The popular Newmark algorithm, used for implicit direct integration of structural dynamics, is extended by means of a nodal partition to permit use of different timesteps in different regions of a structural model. The algorithm developed has as a special case an explicit-explicit subcycling algorithm previously reported by Belytschko, Yen and Mullen. That algorithm has been shown, in the absence of damping or other energy dissipation, to exhibit instability over narrow timestep ranges that become narrower as the number of degrees of freedom increases, making them unlikely to be encountered in practice. The present algorithm avoids such instabilities in the case of a one to two timestep ratio (two subcycles), achieving unconditional stability in an exponential sense for a linear problem. However, with three or more subcycles, the trapezoidal rule exhibits stability that becomes conditional, falling towards that of the central difference method as the number of subcycles increases. Instabilities over narrow timestep ranges, that become narrower as the model size increases, also appear with three or more subcycles. However by moving the partition between timesteps one row of elements into the region suitable for integration with the larger timestep these the unstable timestep ranges become extremely narrow, even in simple systems with a few degrees of freedom. As well, accuracy is improved. Use of a version of the Newmark algorithm that dissipates high frequencies minimises or eliminates these narrow bands of instability. Viscous damping is also shown to remove these instabilities, at the expense of having more effect on the low frequency response.

Small-World Effect in Epidemics Using Cellular Automata

The spread of an infectious disease in a population involves interactions leading to an epidemic outbreak through a network of contacts. Extending on Watts and Strogatz (1998) who showed that short-distance connections create a small-world effect, a model combining short-and long-distance probabilistic and regularly updated contacts helps considering spatial heterogeneity. The method is based on cellular automata. The presence of long-distance connections accelerates the small-world effect, as if the world shrank in proportion of their total number.

A Dynamical Modeling to Study the Adaptive Immune System and the Influence of Antibodies in the Immune Memory

Immunological systems have been an abundant inspiration to contemporary computer scientists. Problem solving strategies, stemming from known immune system phenomena, have been successfully applied to chall enging problems of modem computing. Simulation systems and mathematical modeling are also beginning use to answer more complex immunological questions as immune memory process and duration of vaccines, where the regulation mechanisms are not still known sufficiently (Lundegaard, Lund, Kesmir, Brunak, Nielsen, 2007). In this article we studied in machina a approach to simulate the process of antigenic mutation and its implications for the process of memory. Our results have suggested that the durability of the immune memory is affected by the process of antigenic mutation.and by populations of soluble antibodies in the blood. The results also strongly suggest that the decrease of the production of antibodies favors the global maintenance of immune memory.

Estimating the True Incidence of Rubella

The true incidence of infectious diseases is difficult to determine from surveillance or from notification data. The proportion of new infections of rubella yields a model from serological surveys. The discrepancy between results and official notification data before vaccination era leads one to suspect the presence of hidden infections. Simulation on 80% of effective vaccination coverage shows a similar discrepancy of the total number of infections compared to notification data.

Dynamics and Control of Stray Dog Populations

The population dynamics of stray dogs is simulated to assess the effects of sterilization and euthanasia. From simulations representing less than 5 years, sterilization is less efficient than euthanasia to reduce the stray dog population, considering similar rates, but the total number of sterilized dogs is less than the total number of euthanized dogs per km(2) per year. Over 20 years, both strategies have similar efficiency. Beyond a certain rate of dog abandonment, both strategies are inefficient.

On the relation between the conditional moment closure and unsteady flamelets

We consider the relation between the conditional moment closure (CMC) and the unsteady flamelet model (FM). The CMC equations were originally constructed as global equations, while FM was derived asymptotically for a thin reaction zone. The recent tendency is to use FM-type equations as global equations. We investigate the possible consequences and suggest a new version of FM: coordinate-invariant FM (CIFM). Unlike FM, CIFM complies with conditional properties of the exact transport equations which are used effectively in CMC. We analyse the assumptions needed to obtain another global version of FM: representative interactive flamelets (RIF), from original FM and demonstrate that, in homogeneous turbulence, one of these assumptions is equivalent to the main CMC hypothesis.

Analysis of flexural waves excited by rectangular contact type transducers

In this paper, an attempt was made to investigate a fundamental problem related to the flexural waves excited by rectangular transducers. Due to the disadvantages of the Green's function approach for solving this problem, a direct and effective method is proposed using a multiple integral transform method and contour integration technique. The explicit frequency domain solutions obtained from this newly developed method are convenient for understanding transducer behavior and theoretical optimization and experimental calibration of rectangular transducers. The time domain solutions can then be easily obtained by using the fast Fourier transform technique. (C) 2001 Elsevier Science B.V. All rights reserved.

Dendritic branching patterns of pyramidal cells in the visual cortex of the new world marmoset monkey, with comparative notes on the old world macaque monkey

The basal dendritic arbors of 442 supragranular pyramidal cells in visual cortex of the marmoset monkey were compared by fractal analyses. As detailed in a previous study,(1) individual cells were injected with Lucifer Yellow and processed for a DAB reaction product. The basal dendritic arbors were drawn, in the tangential plane, and the fractal dimension (D) determined by the dilation method. The fractal dimensions were compared between cells in ten cortical areas containing cells involved in visual processing, including the primary visual area (Vi), the second visual area (V2), the dorsoanterior area (DA), the dorsomedial area (DM), the dorsolateral. area (DL), the middle temporal area (MT), the posterior parietal area (PP), the fundus of the superior temporal area (FST) and the caudal and rostral subdivisions of inferotemporal cortex (ITc and ITr, respectively). Of 45 pairwise interareal comparisons of the fractal dimension of neurones, 20 were significantly different. Moreover, comparison of data according to previously published visual processing pathways revealed a trend for cells with greater fractal dimensions in higher cortical areas. Comparison of the present results with those in homologous cortical areas in the macaque monkey(2) revealed some similarities between the two species. The similarity in the trends of D values of cells in both species may reflect developmental features which, result in different functional attributes.

Pyramidal neurones in macaque visual cortex: Interareal phenotypic variation of dendritic branching patterns

The basal dendritic arbors of over 500-layer III pyramidal neurones of the macaque cortex were compared by fractal analyses, which provides a measure of the space filling (or branching pattern) of dendritic arbors. Fractal values (D) of individual cells were compared between the cytochrome oxidase (CO)-rich blobs and CO-poor interblobs, of middle and upper layer III, and between sublaminae, in the primary visual area (Vi). These data were compared with those in the CO compartments in the second visual area (V2), and seven other extrastriate cortical areas. (V4, MT, LIP, 7a, TEO, TE and STP). There were significant differences in the fractal dimensions, and therefore the dendritic branching patterns, of cells in striate and extrastriate areas. Of the 55 possible pairwise comparisons of fractal dimension of neurones in different cortical areas (or CO compartments), 39 proved to be significantly different. The markedly different morphologies of pyramidal cells in the different cortical areas may be one of the features that determine the functional signatures of these cells by influencing the number of inputs received by, and propagation of potentials through, their dendritic arbors.

Fitting a mixture model to three-mode three-way data with missing information

When the data consist of certain attributes measured on the same set of items in different situations, they would be described as a three-mode three-way array. A mixture likelihood approach can be implemented to cluster the items (i.e., one of the modes) on the basis of both of the other modes simultaneously (i.e,, the attributes measured in different situations). In this paper, it is shown that this approach can be extended to handle three-mode three-way arrays where some of the data values are missing at random in the sense of Little and Rubin (1987). The methodology is illustrated by clustering the genotypes in a three-way soybean data set where various attributes were measured on genotypes grown in several environments.

Using clusters of computers for large QU-GENE simulation experiments

The QU-GENE Computing Cluster (QCC) is a hardware and software solution to the automation and speedup of large QU-GENE (QUantitative GENEtics) simulation experiments that are designed to examine the properties of genetic models, particularly those that involve factorial combinations of treatment levels. QCC automates the management of the distribution of components of the simulation experiments among the networked single-processor computers to achieve the speedup.

Stochastic Schrodinger equation approach to quantum noise in resonant tunneling current

We apply the quantum trajectory method to current noise in resonant tunneling devices. The results from dynamical simulation are compared with those from unconditional master equation approach. We show that the stochastic Schrodinger equation approach is useful in modeling the dynamical processes in mesoscopic electronic systems.

A mixture model-based approach to the clustering of microarray expression data

Motivation: This paper introduces the software EMMIX-GENE that has been developed for the specific purpose of a model-based approach to the clustering of microarray expression data, in particular, of tissue samples on a very large number of genes. The latter is a nonstandard problem in parametric cluster analysis because the dimension of the feature space (the number of genes) is typically much greater than the number of tissues. A feasible approach is provided by first selecting a subset of the genes relevant for the clustering of the tissue samples by fitting mixtures of t distributions to rank the genes in order of increasing size of the likelihood ratio statistic for the test of one versus two components in the mixture model. The imposition of a threshold on the likelihood ratio statistic used in conjunction with a threshold on the size of a cluster allows the selection of a relevant set of genes. However, even this reduced set of genes will usually be too large for a normal mixture model to be fitted directly to the tissues, and so the use of mixtures of factor analyzers is exploited to reduce effectively the dimension of the feature space of genes. Results: The usefulness of the EMMIX-GENE approach for the clustering of tissue samples is demonstrated on two well-known data sets on colon and leukaemia tissues. For both data sets, relevant subsets of the genes are able to be selected that reveal interesting clusterings of the tissues that are either consistent with the external classification of the tissues or with background and biological knowledge of these sets.

A simulated annealing algorithm for finding consensus sequences

Motivation: A consensus sequence for a family of related sequences is, as the name suggests, a sequence that captures the features common to most members of the family. Consensus sequences are important in various DNA sequencing applications and are a convenient way to characterize a family of molecules. Results: This paper describes a new algorithm for finding a consensus sequence, using the popular optimization method known as simulated annealing. Unlike the conventional approach of finding a consensus sequence by first forming a multiple sequence alignment, this algorithm searches for a sequence that minimises the sum of pairwise distances to each of the input sequences. The resulting consensus sequence can then be used to induce a multiple sequence alignment. The time required by the algorithm scales linearly with the number of input sequences and quadratically with the length of the consensus sequence. We present results demonstrating the high quality of the consensus sequences and alignments produced by the new algorithm. For comparison, we also present similar results obtained using ClustalW. The new algorithm outperforms ClustalW in many cases.