Persistence Problem in Two-Dimensional Fluid Turbulence

We present a natural framework for studying the persistence problem in two-dimensional fluid turbulence by using the Okubo-Weiss parameter Lambda to distinguish between vortical and extensional regions. We then use a direct numerical simulation of the two-dimensional, incompressible Navier-Stokes equation with Ekman friction to study probability distribution functions (PDFs) of the persistence times of vortical and extensional regions by employing both Eulerian and Lagrangian measurements. We find that, in the Eulerian case, the persistence-time PDFs have exponential tails; by contrast, this PDF for Lagrangian particles, in vortical regions, has a power-law tail with an exponent theta = 2.9 +/- 0.2.

Stochastic Approximation Algorithms for Constrained Optimization via Simulation

We develop four algorithms for simulation-based optimization under multiple inequality constraints. Both the cost and the constraint functions are considered to be long-run averages of certain state-dependent single-stage functions. We pose the problem in the simulation optimization framework by using the Lagrange multiplier method. Two of our algorithms estimate only the gradient of the Lagrangian, while the other two estimate both the gradient and the Hessian of it. In the process, we also develop various new estimators for the gradient and Hessian. All our algorithms use two simulations each. Two of these algorithms are based on the smoothed functional (SF) technique, while the other two are based on the simultaneous perturbation stochastic approximation (SPSA) method. We prove the convergence of our algorithms and show numerical experiments on a setting involving an open Jackson network. The Newton-based SF algorithm is seen to show the best overall performance.

Perturbative corrections for staggered four-fermion operators

We present results for one-loop matching coefficients between continuum four-fermion operators, defined in the Naive Dimensional Regularization scheme, and staggered fermion operators of various types. We calculate diagrams involving gluon exchange between quark fines, and ''penguin'' diagrams containing quark loops. For the former we use Landau-gauge operators, with and without O(a) improvement, and including the tadpole improvement suggested by Lepage and Mackenzie. For the latter we use gauge-invariant operators. Combined with existing results for two-loop anomalous dimension matrices and one-loop matching coefficients, our results allow a lattice calculation of the amplitudes for KKBAR mixing and K --> pipi decays with all corrections of O(g2) included. We also discuss the mixing of DELTAS = 1 operators with lower dimension operators, and show that, with staggered fermions, only a single lower dimension operator need be removed by non-perturbative subtraction.

An Efficient Simulated Annealing With a Valid Solution Mechanism For TDMA Brodcast Scheduling problem

This paper presents an efficient Simulated Annealing with valid solution mechanism for finding an optimum conflict-free transmission schedule for a broadcast radio network. This is known as a Broadcast Scheduling Problem (BSP) and shown as an NP-complete problem, in earlier studies. Because of this NP-complete nature, earlier studies used genetic algorithms, mean field annealing, neural networks, factor graph and sum product algorithm, and sequential vertex coloring algorithm to obtain the solution. In our study, a valid solution mechanism is included in simulated annealing. Because of this inclusion, we are able to achieve better results even for networks with 100 nodes and 300 links. The results obtained using our methodology is compared with all the other earlier solution methods.

Pipelined ring algorithm for matrix multiplication on transputer networks: performance analysis and estimation

A parallel matrix multiplication algorithm is presented, and studies of its performance and estimation are discussed. The algorithm is implemented on a network of transputers connected in a ring topology. An efficient scheme for partitioning the input matrices is introduced which enables overlapping computation with communication. This makes the algorithm achieve near-ideal speed-up for reasonably large matrices. Analytical expressions for the execution time of the algorithm have been derived by analysing its computation and communication characteristics. These expressions are validated by comparing the theoretical results of the performance with the experimental values obtained on a four-transputer network for both square and irregular matrices. The analytical model is also used to estimate the performance of the algorithm for a varying number of transputers and varying problem sizes. Although the algorithm is implemented on transputers, the methodology and the partitioning scheme presented in this paper are quite general and can be implemented on other processors which have the capability of overlapping computation with communication. The equations for performance prediction can also be extended to other multiprocessor systems.

Stabilisation of unusual simultaneous binding of four cytosine nucleobases to copper(II) by a novel network of bifurcated hydrogen bonding

The crystal structure of tetrakis(cytosine)copper(II) perchlorate dihydrate has been determined. All the hydrogen atoms were obtained from Fourier-difference synthesis. The geometry around. copper is a bicapped octahedron (4 + 2 + 2*). The adjacent cytosine rings are oriented head-to-tail with respect to each other and are roughly at right angles to the co-ordination plane. The exocyclic oxo groups form an interligand, intracomplex hydrogen-bonding network above and below the co-ordination plane with the exocyclic amino groups of alternate cytosine bases. The EPR and electronic spectra are consistent with the retention of the solid-state structure in solution. The steric effect of the C(2)=O group of cytosine is offset by the presence of the intracomplex hydrogen-bonding network. The trend in Ei values of Cu-II-Cu-I couples for 1.4 complexes of cytosine, cytodine, pyridine, 2-methylpyridine and N-methylimidazole suggests that both steric effects and pi-delocalization in imidazole and pyridine ligands and the steric effect of C(2)=O in pyrimidine ligands are important in stabilising Cu-I relative to Cu-II.

Supersymmetry In The Two-Anyon Problem

We show that the problem of two anyons interacting through a simple harmonic potential or a Coulomb potential is supersymmetric. The supersymmetry operators map a theory described by statistics parameter θ to one described by π+θ. Thus fermions and bosons go into each other, while semions are supersymmetric by themselves. The simple harmonic problem has a Sp(4) symmetry for any value of θ which explains the energy degeneracies.

Synthesis of path generating flexible-link mechanisms

Flexible-link mechanisms are those linkage mechanisms (or structures) which are capable of motion by virtue of elastic deformation of one or more;links. In such mechanisms a single flexible link; can replace several rigid links and joints resulting in fewer links, fewer pin joints, reduced overall weight and reduced mechanical error. In spite of such clear advantages, contributions toward flexible-link mechanisms remain very scarce. The area of flexible-link mechanisms offers much scope for further exploration. This paper attempts to show the potential of flexible-link mechanisms in accomplishing a kinematic task like path generation. Synthesis of a four-bar mechanism with a flexible rocker for circular and straight line path generation is carried out. Displacement analysis of the structure is carried out using finite element method (FEM) and synthesis is formulated and solved as an optimization problem. Several numerical examples are presented for illustration. Based on the results obtained with these examples, the flexible-link mechanism considered shows good promise for-path generation.

Novel correlations in two dimensions: Two-body problem

We discuss a many-body Hamiltonian with two- and three-body interactions in two dimensions introduced recently by Murthy, Bhaduri and Sen. Apart from an analysis of some exact solutions in the many-body system, we analyse in detail the two-body problem which is completely solvable. We show that the solution of the two-body problem reduces to solving a known differential equation due to Heun. We show that the two-body spectrum becomes remarkably simple for large interaction strengths and the level structure resembles that of the Landau levels. We also clarify the 'ultraviolet' regularization which is needed to define an inverse-square potential properly and discuss its implications for our model.

On the problem of spurious patterns in neural associative memory models

The problem of spurious patterns in neural associative memory models is discussed, Some suggestions to solve this problem from the literature are reviewed and their inadequacies are pointed out, A solution based on the notion of neural self-interaction with a suitably chosen magnitude is presented for the Hebb learning rule. For an optimal learning rule based on linear programming, asymmetric dilution of synaptic connections is presented as another solution to the problem of spurious patterns, With varying percentages of asymmetric dilution it is demonstrated numerically that this optimal learning rule leads to near total suppression of spurious patterns. For practical usage of neural associative memory networks a combination of the two solutions with the optimal learning rule is recommended to be the best proposition.

Mean first passage time approach to the problem of optimal barrier subdivision for Kramer's escape rate

We consider the effect of subdividing the potential barrier along the reaction coordinate on Kramer's escape rate for a model potential, Using the known supersymmetric potential approach, we show the existence of an optimal number of subdivisions that maximizes the rate, We cast the problem as a mean first passage time problem of a biased random walker and obtain equivalent results, We briefly summarize the results of our investigation on the increase in the escape rate by placing a blow-torch in the unstable part of one of the potential wells. (C) 1999 Elsevier Science B.V. All rights reserved.

The complexity of certain incremental code generation problems

This paper looks at the complexity of four different incremental problems. The following are the problems considered: (1) Interval partitioning of a flow graph (2) Breadth first search (BFS) of a directed graph (3) Lexicographic depth first search (DFS) of a directed graph (4) Constructing the postorder listing of the nodes of a binary tree. The last problem arises out of the need for incrementally computing the Sethi-Ullman (SU) ordering [1] of the subtrees of a tree after it has undergone changes of a given type. These problems are among those that claimed our attention in the process of our designing algorithmic techniques for incremental code generation. BFS and DFS have certainly numerous other applications, but as far as our work is concerned, incremental code generation is the common thread linking these problems. The study of the complexity of these problems is done from two different perspectives. In [2] is given the theory of incremental relative lower bounds (IRLB). We use this theory to derive the IRLBs of the first three problems. Then we use the notion of a bounded incremental algorithm [4] to prove the unboundedness of the fourth problem with respect to the locally persistent model of computation. Possibly, the lower bound result for lexicographic DFS is the most interesting. In [5] the author considers lexicographic DFS to be a problem for which the incremental version may require the recomputation of the entire solution from scratch. In that sense, our IRLB result provides further evidence for this possibility with the proviso that the incremental DFS algorithms considered be ones that do not require too much of preprocessing.