Streamline topology and dilute particle dynamics in a Karman vortex street flow

Three types of streamline topology in a Karman vortex street flow are shown under the variation of spatial parameters. For the motion of dilute particles in the Karman vortex street flow, there exist a route of bifurcation to a chaotic orbit and more attractors in a bifurcation diagram for the proportion of particle density to fluid density. Along with the increase of spatial parameters in the flow field, the bifurcation process is suspended, as well as more and more attractors emerge. In the motion of dilute particles, a drag term and gravity term dominate and result in the bifurcation phenomenon.

Outline and computational approaches of protein misfolding.

Protein misfolding is a general causation of classical conformational diseases and many pathogenic changes that are the result of structural conversion. Here I review recent progress in clinical and computational approaches for each stage of the misfolding process, aiming to present readers an outline for swift comprehension of this field.

Topology of toroidal helical fields in non-circular cross-sectional tokamaks

The ordinary differential magnetic field line equations are solved numerically; the tokamak magnetic structure is studied on Hefei Tokamak-7 Upgrade (HT-7U) when the equilibrium field with a monotonic q-profile is perturbed by a helical magnetic field. We find that a single mode (m, n) helical perturbation can cause the formation of islands on rational surfaces with q = m/n and q = (m +/- 1, +/- 2, +/- 3,...)/n due to the toroidicity and plasma shape (i.e. elongation and triangularity), while there are many undestroyed magnetic surfaces called Kolmogorov-Arnold-Moser (KAM) barriers on irrational surfaces. The islands on the same rational surface do not have the same size. When the ratio between the perturbing magnetic field B-r(r) and the toroidal magnetic field amplitude B(phi)0 is large enough, the magnetic island chains on different rational surfaces will overlap and chaotic orbits appear in the overlapping area, and the magnetic field becomes stochastic. It is remarkable that the stochastic layer appears first in the plasma edge region.

A novel three-dimensional imaging array recording and computational method by means of coded cameras reconstruction

In this paper, we propose a novel three-dimensional imaging method by which the object is captured by a coded cameras array (CCA) and computationally reconstructed as a series of longitudinal layered surface images of the object. The distribution of cameras in array, named code pattern, is crucial for reconstructed images fidelity when the correlation decoding is used. We use DIRECT global optimization algorithm to design the code patterns that possess proper imaging property. We have conducted primary experiments to verify and test the performance of the proposed method with a simple discontinuous object and a small-scale CCA including nine cameras. After certain procedures such as capturing, photograph integrating, computational reconstructing and filtering, etc., we obtain reconstructed longitudinal layered surface images of the object with higher signal-to-noise ratio. The results of experiments show that the proposed method is feasible. It is a promising method to be used in fields such as remote sensing, machine vision, etc. (c) 2006 Elsevier GmbH. All rights reserved.

Genome-wide computational identification of microRNAs and their targets in the deep-branching eukaryote Giardia lamblia

Using a combined computational program. we identified 50 potential microRNAs (miRNAs) in Giardia lamblia. one of the most primitive unicellular eukaryotes. These miRNAs are unique to G. lamblia and no homologues have been found in other organisms; miRNAs.

Computational information geometry and its applications

Digitization is the main feature of modern Information Science. Conjoining the digits and the coordinates, the relation between Information Science and high-dimensional space is consanguineous, and the information issues are transformed to the geometry problems in some high-dimensional spaces. From this basic idea, we propose Computational Information Geometry (CIG) to make information analysis and processing. Two kinds of applications of CIG are given, which are blurred image restoration and pattern recognition. Experimental results are satisfying. And in this paper, how to combine with groups of simple operators in some 2D planes to implement the geometrical computations in high-dimensional space is also introduced. Lots of the algorithms have been realized using software.