Transition to complete synchronization in phase-coupled oscillators with nearest neighbor coupling

We investigate synchronization in a Kuramoto-like model with nearest neighbor coupling. Upon analyzing the behavior of individual oscillators at the onset of complete synchronization, we show that the time interval between bursts in the time dependence of the frequencies of the oscillators exhibits universal scaling and blows up at the critical coupling strength. We also bring out a key mechanism that leads to phase locking. Finally, we deduce forms for the phases and frequencies at the onset of complete synchronization.

Studies of solute self-association by sedimentation equilibrium: allowance for effects of thermodynamic non-ideality beyond the consequences of nearest-neighbor interactions

A sedimentation equilibrium study of a-chymotrypsin self-association in acetate-chloride buffer, pH 4.1 I 0.05, has been used to illustrate determination of a dimerization constant under conditions where thermodynamic non-ideality is manifested beyond the consequences of nearest-neighbor interactions. Because the expressions for the experimentally determinable interaction parameters comprise a mixture of equilibrium constant and excluded volume terms, the assignment of reasonable magnitudes to the relevant virial coefficients describing non-associative cluster formation is essential for the evaluation of a reliable estimate of the dimerization constant. Determination of these excluded volume parameters by numerical integration over the potential-of-mean-force is shown to be preferable to their calculation by approximate analytical solutions of the integral for this relatively small enzyme monomer with high net charge (+ 10) under conditions of low ionic strength (0.05 M). (C) 2001 Elsevier Science B.V. All rights reserved.

Distance Transforms on Gray-Level Surfaces

This thesis studies gray-level distance transforms, particularly the Distance Transform on Curved Space (DTOCS). The transform is produced by calculating distances on a gray-level surface. The DTOCS is improved by definingmore accurate local distances, and developing a faster transformation algorithm. The Optimal DTOCS enhances the locally Euclidean Weighted DTOCS (WDTOCS) with local distance coefficients, which minimize the maximum error from the Euclideandistance in the image plane, and produce more accurate global distance values.Convergence properties of the traditional mask operation, or sequential localtransformation, and the ordered propagation approach are analyzed, and compared to the new efficient priority pixel queue algorithm. The Route DTOCS algorithmdeveloped in this work can be used to find and visualize shortest routes between two points, or two point sets, along a varying height surface. In a digital image, there can be several paths sharing the same minimal length, and the Route DTOCS visualizes them all. A single optimal path can be extracted from the route set using a simple backtracking algorithm. A new extension of the priority pixel queue algorithm produces the nearest neighbor transform, or Voronoi or Dirichlet tessellation, simultaneously with the distance map. The transformation divides the image into regions so that each pixel belongs to the region surrounding the reference point, which is nearest according to the distance definition used. Applications and application ideas for the DTOCS and its extensions are presented, including obstacle avoidance, image compression and surface roughness evaluation.

Shared feature extraction for nearest neighbor face recognition

In this paper, we propose a new supervised linearfeature extraction technique for multiclass classification problemsthat is specially suited to the nearest neighbor classifier (NN).The problem of finding the optimal linear projection matrix isdefined as a classification problem and the Adaboost algorithmis used to compute it in an iterative way. This strategy allowsthe introduction of a multitask learning (MTL) criterion in themethod and results in a solution that makes no assumptions aboutthe data distribution and that is specially appropriated to solvethe small sample size problem. The performance of the methodis illustrated by an application to the face recognition problem.The experiments show that the representation obtained followingthe multitask approach improves the classic feature extractionalgorithms when using the NN classifier, especially when we havea few examples from each class

Modified Large Margin Nearest Neighbor Metric Learning for Regression

The main objective of this letter is to formulate a new approach of learning a Mahalanobis distance metric for nearest neighbor regression from a training sample set. We propose a modified version of the large margin nearest neighbor metric learning method to deal with regression problems. As an application, the prediction of post-operative trunk 3-D shapes in scoliosis surgery using nearest neighbor regression is described. Accuracy of the proposed method is quantitatively evaluated through experiments on real medical data.

Unusual Yang-Lee edge singularity in the one-dimensional axial-next-to-nearest-neighbor Ising model

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Transition to complete synchronization in phase-coupled oscillators with nearest neighbor coupling

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Influence of nearest-neighbor Coulomb interactions on the phase diagram of the ferromagnetic Kondo model

The influence of a nearest-neighbor Coulomb repulsion of strength V on the properties of the ferromagnetic Kondo model is analyzed using computational techniques. The Hamiltonian studied here is defined on a chain using localized S = 1/2 spins, and one orbital per site. Special emphasis is given to the influence of the Coulomb repulsion on the regions of phase separation recently discovered in this family of models, as well as on the double-exchange-induced ferromagnetic ground state. When phase separation dominates at V= 0, the Coulomb interaction breaks the large domains of the two competing phases into small islands of one phase embedded into the other. This is in agreement with several experimental results, as discussed in the text. Vestiges of the original phase separation regime are found in the spin structure factor as incommensurate peaks, even at large values of V. In the ferromagnetic regime close to density n = 0.5, the Coulomb interaction induces tendencies to charge ordering without altering the fully polarized character of the state. This regime of charge-ordered ferromagnetism may be related with experimental observations of a similar phase by Chen and Cheong [Phys. Rev. Lett. 76, 4042 (1996)]. Our results reinforce the recently introduced notion [see, e.g., S. Yunoki et al., Phys. Rev. Lett. 80, 845 (1998)] that in realistic models for manganites analyzed with unbiased many-body techniques, the ground state properties arise from a competition between ferromagnetism and phase-separation - charge-ordering tendencies. ©1999 The American Physical Society.

Quantum-error correction on linear-nearest-neighbor qubit arrays

A quantum circuit implementing 5-qubit quantum-error correction on a linear-nearest-neighbor architecture is described. The canonical decomposition is used to construct fast and simple gates that incorporate the necessary swap operations allowing the circuit to achieve the same depth as the current least depth circuit. Simulations of the circuit's performance when subjected to discrete and continuous errors are presented. The relationship between the error rate of a physical qubit and that of a logical qubit is investigated with emphasis on determining the concatenated error correction threshold.

An empirical study of Hoelfding Racing for model selction in K-nearest neighbor classification

Racing algorithms have recently been proposed as a general-purpose method for performing model selection in machine teaming algorithms. In this paper, we present an empirical study of the Hoeffding racing algorithm for selecting the k parameter in a simple k-nearest neighbor classifier. Fifteen widely-used classification datasets from UCI are used and experiments conducted across different confidence levels for racing. The results reveal a significant amount of sensitivity of the k-nn classifier to its model parameter value. The Hoeffding racing algorithm also varies widely in its performance, in terms of the computational savings gained over an exhaustive evaluation. While in some cases the savings gained are quite small, the racing algorithm proved to be highly robust to the possibility of erroneously eliminating the optimal models. All results were strongly dependent on the datasets used.