Generalized dynamical thermostating technique

We demonstrate that the Nosé method for constant-temperature molecular-dynamics simulation [Mol. Phys. 52, 255 (1984)] can be substantially generalized by the addition of auxiliary variables to encompass an infinite variety of Hamiltonian thermostats. Such thermostats can be used to enhance ergodicity in systems, such as the one-dimensional harmonic oscillator or certain molecular systems, for which the standard Nosé-Hoover methods fail to reproduce converged canonical distributions. In this respect the method is similar in spirit to the method of Nosé-Hoover chains, but is both more general and Hamiltonian in structure (which allows for the use of efficient symplectic integration schemes). In particular, we show that, within the generalized Nosé formalism outlined herein, any Hamiltonian system can be thermostated with any other, including a copy of itself. This gives one an enormous flexibility in choosing the form of the thermostating bath. Numerical experiments are included in which a harmonic oscillator is thermostated with a collection of noninteracting harmonic oscillators as well as by a soft billiard system.

Development of hardware accelerator for molecular dynamics simulations: a computation board that calculates nonbonded interactions in cooperation with fast multipole method

Evaluation of long-range Coulombic interactions still represents a bottleneck in the molecular dynamics (MD) simulations of biological macromolecules. Despite the advent of sophisticated fast algorithms, such as the fast multipole method (FMM), accurate simulations still demand a great amount of computation time due to the accuracy/speed trade-off inherently involved in these algorithms. Unless higher order multipole expansions, which are extremely expensive to evaluate, are employed, a large amount of the execution time is still spent in directly calculating particle-particle interactions within the nearby region of each particle. To reduce this execution time for pair interactions, we developed a computation unit (board), called MD-Engine II, that calculates nonbonded pairwise interactions using a specially designed hardware. Four custom arithmetic-processors and a processor for memory manipulation ("particle processor") are mounted on the computation board. The arithmetic processors are responsible for calculation of the pair interactions. The particle processor plays a central role in realizing efficient cooperation with the FMM. The results of a series of 50-ps MD simulations of a protein-water system (50,764 atoms) indicated that a more stringent setting of accuracy in FMM computation, compared with those previously reported, was required for accurate simulations over long time periods. Such a level of accuracy was efficiently achieved using the cooperative calculations of the FMM and MD-Engine II. On an Alpha 21264 PC, the FMM computation at a moderate but tolerable level of accuracy was accelerated by a factor of 16.0 using three boards. At a high level of accuracy, the cooperative calculation achieved a 22.7-fold acceleration over the corresponding conventional FMM calculation. In the cooperative calculations of the FMM and MD-Engine II, it was possible to achieve more accurate computation at a comparable execution time by incorporating larger nearby regions.

Classification of neural signals by a generalized correlation classifier based on radial basis functions

A common problem in neuroscience is to identify the features by which a set of measurements can be segregated into different classes, for example into different responses to sensory stimuli. A main difficulty is that the derived distributions are often high-dimensional and complex. Many multivariate analysis techniques, therefore, aim to find a simpler low-dimensional representation. Most of them either involve huge efforts in implementation and data handling or ignore important structures and relationships within the original data. We developed a dimension reduction method by means of radial basis functions (RBF), where only a system of linear equations has to be solved. We show that this approach can be regarded as an extension of a linear correlation-based classifier. The validity and reliability of this technique is demonstrated on artificial data sets. Its practical relevance is further confirmed by discriminating recordings from monkey visual cortex evoked by different stimuli.

Evolutionary partial differential equations for biomedical image processing

We are presenting here a model for processing space-time image sequences and applying them to 3D echo-cardiography. The non-linear evolutionary equations filter the sequence with keeping space-time coherent structures. They have been developed using ideas of regularized Perona-Malik an-isotropic diffusion and geometrical diffusion of mean curvature flow type (Malladi-Sethian), combined with Galilean invariant movie multi-scale analysis of Alvarez et al. A discretization of space-time filtering equations by means of finite volume method is discussed in detail. Computational results in processing of 3D echo-cardiographic sequences obtained by rotational acquisition technique and by real-time 3D echo volumetrics acquisition technique are presented. Quantitative error estimation is also provided.

Shape recovery algorithms using level sets in 2-D/3-D medical imagery: a state-of-the-art review

The class of geometric deformable models, also known as level sets, has brought tremendous impact to medical imagery due to its capability of topology preservation and fast shape recovery. In an effort to facilitate a clear and full understanding of these powerful state-of-the-art applied mathematical tools, this paper is an attempt to explore these geometric methods, their implementations and integration of regularizers to improve the robustness of these topologically independent propagating curves/surfaces. This paper first presents the origination of level sets, followed by the taxonomy of level sets. We then derive the fundamental equation of curve/surface evolution and zero-level curves/surfaces. The paper then focuses on the first core class of level sets, known as "level sets without regularizers." This class presents five prototypes: gradient, edge, area-minimization, curvature-dependent and application driven. The next section is devoted to second core class of level sets, known as "level sets with regularizers." In this class, we present four kinds: clustering-based, Bayesian bidirectional classifier-based, shape-based and coupled constrained-based. An entire section is dedicated to optimization and quantification techniques for shape recovery when used in the level set framework. Finally, the paper concludes with 22 general merits and four demerits on level sets and the future of level sets in medical image segmentation. We present applications of level sets to complex shapes like the human cortex acquired via MRI for neurological image analysis.

On the complexity of computing and learning with multiplicative neural networks

In a great variety of neuron models, neural inputs are combined using the summing operation. We introduce the concept of multiplicative neural networks that contain units that multiply their inputs instead of summing them and thus allow inputs to interact nonlinearly. The class of multiplicative neural networks comprises such widely known and well-studied network types as higher-order networks and product unit networks. We investigate the complexity of computing and learning for multiplicative neural networks. In particular, we derive upper and lower bounds on the Vapnik-Chervonenkis (VC) dimension and the pseudo-dimension for various types of networks with multiplicative units. As the most general case, we consider feedforward networks consisting of product and sigmoidal units, showing that their pseudo-dimension is bounded from above by a polynomial with the same order of magnitude as the currently best-known bound for purely sigmoidal networks. Moreover, we show that this bound holds even when the unit type, product or sigmoidal, may be learned. Crucial for these results are calculations of solution set components bounds for new network classes. As to lower bounds, we construct product unit networks of fixed depth with super-linear VC dimension. For sigmoidal networks of higher order, we establish polynomial bounds that, in contrast to previous results, do not involve any restriction of the network order. We further consider various classes of higher-order units, also known as sigma-pi units, that are characterized by connectivity constraints. In terms of these, we derive some asymptotically tight bounds. Multiplication plays an important role in both neural modeling of biological behavior and computing and learning with artificial neural networks. We briefly survey research in biology and in applications where multiplication is considered an essential computational element. The results we present here provide new tools for assessing the impact of multiplication on the computational power and the learning capabilities of neural networks.

Wavelets in temporal and spatial processing of biomedical images

We review some of the most recent advances in the area of wavelet applications in medical imaging. We first review key concepts in the processing of medical images with wavelet transforms and multiscale analysis, including time-frequency tiling, overcomplete representations, higher dimensional bases, symmetry, boundary effects, translational invariance, orientation selectivity, and best-basis selection. We next describe some applications in magnetic resonance imaging, including activation detection and denoising of functional magnetic resonance imaging and encoding schemes. We then present an overview in the area of ultrasound, including computational anatomy with three-dimensional cardiac ultrasound. Next, wavelets in tomography are reviewed, including their relationship to the radon transform and applications in position emission tomography imaging. Finally, wavelet applications in digital mammography are reviewed, including computer-assisted diagnostic systems that support the detection and classification of small masses and methods of contrast enhancement.

On a class of support vector kernels based on frames in function Hilbert spaces

There has been an increasing interest in kernel-based techniques, such as support vector techniques, regularization networks, and gaussian processes. There are inner relationships among those techniques, with the kernel function playing a central role. This article discusses a new class of kernel functions derived from the so-called frames in a function Hilbert space.

A universal framework for 13C metabolic flux analysis

A general methodology is presented for the modeling, simulation, design, evaluation, and statistical analysis of (13)C-labeling experiments for metabolic flux analysis. The universal software framework 13C-FLUX was implemented to support all steps of this process. Guided by the example of anaplerotic flux determination in Corynebacterium glutamicum, the technical details of the model setup, experimental design, and data evaluation are discussed. It is shown how the network structure, the input substrate composition, the assumptions about fluxes, and the measurement configuration are specified within 13C-FLUX. Based on the network model, different experimental designs are computed depending on the goal of the investigations. Finally, a specific experiment is evaluated and the various statistical methods used to analyze the results are briefly explained. The appendix gives some details about the software implementation and availability.

An algorithmic overview of surface registration techniques for medical imaging

This paper presents a literature survey of automatic 3D surface registration techniques emphasizing the mathematical and algorithmic underpinnings of the subject. The relevance of surface registration to medical imaging is that there is much useful anatomical information in the form of collected surface points which originate from complimentary modalities and which must be reconciled. Surface registration can be roughly partitioned into three issues: choice of transformation, elaboration of surface representation and similarity criterion, and matching and global optimization. The first issue concerns the assumptions made about the nature of relationships between the two modalities, e.g. whether a rigid-body assumption applies, and if not, what type and how general a relation optimally maps one modality onto the other. The second issue determines what type of information we extract from the 3D surfaces, which typically characterizes their local or global shape, and how we organize this information into a representation of the surface which will lead to improved efficiency and robustness in the last stage. The last issue pertains to how we exploit this information to estimate the transformation which best aligns local primitives in a globally consistent manner or which maximizes a measure of the similarity in global shape of two surfaces. Within this framework, this paper discusses in detail each surface registration issue and reviews the state-of-the-art among existing techniques.