Continuation of limit cycles near saddle homoclinic points using splines in phase space

We present a new algorithm for continuation of limit cycles of autonomous systems as a system parameter is varied. The algorithm works in phase space with an ordered set of points on the limit cycle, along with spline interpolation. Currently popular algorithms in bifurcation analysis packages compute time-domain approximations of limit cycles using either shooting or collocation. The present approach seems useful for continuation near saddle homoclinic points, where it encounters a corner while time-domain methods essentially encounter a discontinuity (a relatively short period of rapid variation). Other phase space-based algorithms use rescaled arclength in place of time, but subsequently resemble the time-domain methods. Compared to these, we introduce additional freedom through a variable stretching of arclength based on local curvature, through the use of an auxiliary index-based variable. Several numerical examples are presented. Comparisons with results from the popular package, MATCONT, are favorable close to saddle homoclinic points.

Document page layout analysis using Harris corner points

Extraction of text areas from the document images with complex content and layout is one of the challenging tasks. Few texture based techniques have already been proposed for extraction of such text blocks. Most of such techniques are greedy for computation time and hence are far from being realizable for real time implementation. In this work, we propose a modification to two of the existing texture based techniques to reduce the computation. This is accomplished with Harris corner detectors. The efficiency of these two textures based algorithms, one based on Gabor filters and other on log-polar wavelet signature, are compared. A combination of Gabor feature based texture classification performed on a smaller set of Harris corner detected points is observed to deliver the accuracy and efficiency.

Quenching across quantum critical points: Role of topological patterns

We introduce a one-dimensional version of the Kitaev model consisting of spins on a two-legged ladder and characterized by Z(2) invariants on the plaquettes of the ladder. We map the model to a fermionic system and identify the topological sectors associated with different Z2 patterns in terms of fermion occupation numbers. Within these different sectors, we investigate the effect of a linear quench across a quantum critical point. We study the dominant behavior of the system by employing a Landau-Zener-type analysis of the effective Hamiltonian in the low-energy subspace for which the effective quenching can sometimes be non-linear. We show that the quenching leads to a residual energy which scales as a power of the quenching rate, and that the power depends on the topological sectors and their symmetry properties in a non-trivial way. This behavior is consistent with the general theory of quantum quenching, but with the correlation length exponent nu being different in different sectors. Copyright (C) EPLA, 2010

Points-to Analysis as a System of Linear Equations

We propose a novel formulation of the points-to analysis as a system of linear equations. With this, the efficiency of the points-to analysis can be significantly improved by leveraging the advances in solution procedures for solving the systems of linear equations. However, such a formulation is non-trivial and becomes challenging due to various facts, namely, multiple pointer indirections, address-of operators and multiple assignments to the same variable. Further, the problem is exacerbated by the need to keep the transformed equations linear. Despite this, we successfully model all the pointer operations. We propose a novel inclusion-based context-sensitive points-to analysis algorithm based on prime factorization, which can model all the pointer operations. Experimental evaluation on SPEC 2000 benchmarks and two large open source programs reveals that our approach is competitive to the state-of-the-art algorithms. With an average memory requirement of mere 21MB, our context-sensitive points-to analysis algorithm analyzes each benchmark in 55 seconds on an average.

Role of multicritical points in addressing some key problems concerning condensed matter science

We illustrate the potential of using higher order critical points in the deeper understanding of several interesting problems of condensed matter science, e.g. critical adsorption, finite size effects, morphology of critical fluctuations, reversible aggregation of colloids, dynamics of the ordering process, etc.

Distributed computation of fixed points of infinity-nonexpansive maps

The distributed implementation of an algorithm for computing fixed points of an infinity-nonexpansive map is shown to converge to the set of fixed points under very general conditions.

Hyperbranched polyurethanes with varying spacer segments between the branching points

Hyperbranched polyurethanes, with varying oligoethyleneoxy spacer segments between the branching points, have been synthesized by a one-pot approach starting from the appropriately designed carbonyl azide that incorporates the different spacer segments. The structures of monomers and polymers were confirmed by IR and H-1-NMR spectroscopy. The solution viscosity of the polymers suggested that they were of reasonably high molecular weight. Reversal of terminal functional groups was achieved by preparing the appropriate monohydroxy dicarbonyl azide monomer. The large number of terminal isocyanate groups at the chain ends of such hyperbranched macromolecules caused them to crosslink prior to its isolation. However, carrying out the polymerization in the presence of 1 equiv of a capping agent, such as an alcohol, resulted in soluble polymers with carbamate chain ends. Using a biphenyl-containing alcohol as a capping agent, we have also prepared novel hyperbranched perbranched polyurethanes with pendant mesogenic segments. These mesogen-containing polyurethanes, however, did not exhibit liquid crystallinity probably due to the wholly aromatic rigid polymer backbone. (C) 1996 John Wiley & Sons, Inc.

Role of free valences and spin densities on the migrating atom in location of saddle points in radical-exchange reactions

The principle of the conservation of bond orders during radical-exchange reactions is examined using Mayer's definition of bond orders. This simple intuitive approximation is not valid in a quantitative sense. Ab initio results reveal that free valences (or spin densities) develop on the migrating atom during reactions. For several examples of hydrogen-transfer reactions, the sum of the reaction coordinate bond orders in the transition state was found to be 0.92 +/- 0.04 instead of the theoretical 1.00 because free valences (or spin densities) develop on the migrating atom during reactions. It is shown that free valence is almost equal to the square of the spin density on the migrating hydrogen atom and the maxima in the free valence (or spin density) profiles coincide (or nearly coincide) with the saddle points in the corresponding energy profiles.

Fixed points in a Hopfield model with random asymmetric interactions

We calculate analytically the average number of fixed points in the Hopfield model of associative memory when a random antisymmetric part is added to the otherwise symmetric synaptic matrix. Addition of the antisymmetric part causes an exponential decrease in the total number of fixed points. If the relative strength of the antisymmetric component is small, then its presence does not cause any substantial degradation of the quality of retrieval when the memory loading level is low. We also present results of numerical simulations which provide qualitative (as well as quantitative for some aspects) confirmation of the predictions of the analytic study. Our numerical results suggest that the analytic calculation of the average number of fixed points yields the correct value for the typical number of fixed points.

Modelling plane mixing layers using vortex points and sheets

We present here a critical assessment of two vortex approaches (both two-dimensional) to the modelling of turbulent mixing layers. In the first approach the flow is represented by point vortices, and in the second it is simulated as the evolution of a continuous vortex sheet composed of short linear elements or ''panels''. The comparison is based on fresh simulations using approximately the same number of elements in either model, paying due attention in both to the boundary conditions far downstream as well as those on the splitter plate from which the mixing layer issues. The comparisons show that, while both models satisfy the well-known invariants of vortex dynamics approximately to the same accuracy, the vortex panel model, although ultimately not convergent, leads to smoother roll-up and values of stresses and moments that are in closer agreement with the experiment, and has a higher computational efficiency for a given degree of convergence on moments. The point vortex model, while faster for a given number of elements, produces an unsatisfactory roll-up which (for the number of elements used) is rendered worse by the incorporation of the Van der Vooren correction for sheet curvature.

Novel phase-transition behavior near liquid/liquid critical points of aqueous solutions: Formation of a third phase at the interface

We report a novel phase behavior in aqueous solutions of simple organic solutes near their liquid/liquid critical points, where a solid-like third phase appears at the liquid/liquid interface. The phenomenon has been found in three different laboratories. It appears in many aqueous systems of organic solutes and becomes enhanced upon the addition of salt to these solutions.

A method of tracking the peak power points for a variable speed wind energy conversion system

In this paper, a method of tracking the peak power in a wind energy conversion system (WECS) is proposed, which is independent of the turbine parameters and air density. The algorithm searches for the peak power by varying the speed in the desired direction. The generator is operated in the speed control mode with the speed reference being dynamically modified in accordance with the magnitude and direction of change of active power. The peak power points in the P-omega curve correspond to dP/domega = 0. This fact is made use of in the optimum point search algorithm. The generator considered is a wound rotor induction machine whose stator is connected directly to the grid and the rotor is fed through back-to-back pulse-width-modulation (PWM) converters. Stator flux-oriented vector control is applied to control the active and reactive current loops independently. The turbine characteristics are generated by a dc motor fed from a commercial dc drive. All of the control loops are executed by a single-chip digital signal processor (DSP) controller TMS320F240. Experimental results show that the performance of the control algorithm compares well with the conventional torque control method.

Scalable Context-Sensitive Points-To Analysis Using Multi-Dimensional Bloom Filters

Context-sensitive points-to analysis is critical for several program optimizations. However, as the number of contexts grows exponentially, storage requirements for the analysis increase tremendously for large programs, making the analysis non-scalable. We propose a scalable flow-insensitive context-sensitive inclusion-based points-to analysis that uses a specially designed multi-dimensional bloom filter to store the points-to information. Two key observations motivate our proposal: (i) points-to information (between pointer-object and between pointer-pointer) is sparse, and (ii) moving from an exact to an approximate representation of points-to information only leads to reduced precision without affecting correctness of the (may-points-to) analysis. By using an approximate representation a multi-dimensional bloom filter can significantly reduce the memory requirements with a probabilistic bound on loss in precision. Experimental evaluation on SPEC 2000 benchmarks and two large open source programs reveals that with an average storage requirement of 4MB, our approach achieves almost the same precision (98.6%) as the exact implementation. By increasing the average memory to 27MB, it achieves precision upto 99.7% for these benchmarks. Using Mod/Ref analysis as the client, we find that the client analysis is not affected that often even when there is some loss of precision in the points-to representation. We find that the NoModRef percentage is within 2% of the exact analysis while requiring 4MB (maximum 15MB) memory and less than 4 minutes on average for the points-to analysis. Another major advantage of our technique is that it allows to trade off precision for memory usage of the analysis.

A Fast Linear Separability Test by Projection of Positive Points on Subspaces

A geometric and non parametric procedure for testing if two finite set of points are linearly separable is proposed. The Linear Separability Test is equivalent to a test that determines if a strictly positive point h > 0 exists in the range of a matrix A (related to the points in the two finite sets). The algorithm proposed in the paper iteratively checks if a strictly positive point exists in a subspace by projecting a strictly positive vector with equal co-ordinates (p), on the subspace. At the end of each iteration, the subspace is reduced to a lower dimensional subspace. The test is completed within r ≤ min(n, d + 1) steps, for both linearly separable and non separable problems (r is the rank of A, n is the number of points and d is the dimension of the space containing the points). The worst case time complexity of the algorithm is O(nr3) and space complexity of the algorithm is O(nd). A small review of some of the prominent algorithms and their time complexities is included. The worst case computational complexity of our algorithm is lower than the worst case computational complexity of Simplex, Perceptron, Support Vector Machine and Convex Hull Algorithms, if d