The chaotic simulated annealing algorithm for combinatorial optimization problems is examined in the light of the global bifurcation structure of the chaotic neural networks. We show that the result of the chaotic simulated annealing algorithm is primarily dependent upon the global bifurcation structure of the chaotic neural networks and unlike the stochastic simulated annealing infinitely slow...

Several algorithms in optimization, computer science and statistical mechanics are closely related to the problem of sampling from a Boltzmann distribution parameterized by the so-called temperature over a finite set. These include (i) Simulated Annealing (SA) [6], (ii) calculating the permanent of a nonnegative matrix [1], (iii) estimating the volume of a convex body [7], and (iv) computing pa...

An algorithm is developed to statistically find the best global fit of a nonlinear non-convex cost-function over a D-dimensional space. It is argued that this algorithm permits an annealing schedule for ''temperature'' T decreasing exponentially in annealing-time k, T = T 0 exp(−ck 1/D). The introduction of re-annealing also permits adaptation to changing sensitivities in the multi-dimensional ...

In this study simulation and optimization of an industrial acetylene hydrogenation reactor was studied. Three well known kinetic models were used for a nearly similar catalyst to predict the industrial data. Due to the complexity of the reactions, none of the offered kinetic models could be considered as an exact kinetic model and it is necessary to determine the kinetic parameters. One of the ...

Identifying computational tasks suitable for (future) quantum computers is an active field of research. Here we explore utilizing the purpose solving differential equations. We consider two approaches: (i) basis encoding and fixed-point arithmetic on a digital computer, (ii) representing high-order Runge-Kutta methods as optimization problems annealers. As realizations applied to two-dimensiona...

We study the performance of quantum annealing for systems with ground-state degeneracy by directly solving the Schrödinger equation for small systems and quantum Monte Carlo simulations for larger systems. The results indicate that quantum annealing may not be well suited to identify all degenerate ground-state configurations, although the value of the ground-state energy is often efficiently e...

The very intense radiation environment of the planned Compressed Baryonic Matter (CBM) experiment at the international research center FAIR makes radiation hardness a very important issue for the Silicon Tracking System (STS). The STS will consist of eight stations of double sided strip detectors at a distance between 25 cm to 100 cm downstream of the target. It is expected that the total integ...

In Saccharomyces cerevisiae, Rad52 protein plays an essential role in the repair of DNA double-stranded breaks (DSBs). Rad52 and its orthologs possess the unique capacity to anneal single-stranded DNA (ssDNA) complexed with its cognate ssDNA-binding protein, RPA. This annealing activity is used in multiple mechanisms of DSB repair: single-stranded annealing, synthesis-dependent strand annealing...

In this work, we propose a Hybrid particle swarm optimization-Simulated annealing algorithm and present a comparison with i) Simulated annealing algorithm and ii) Back propagation algorithm for training neural networks. These neural networks were then tested on a classification task. In particle swarm optimization behaviour of a particle is influenced by the experiential knowledge of the partic...

An annealing time of 30-45 seconds is commonly used in PCR reactions. Increase in annealing time up o 2-3 minutes did not appreciably influence the outcome of the PCR reactions. However, as the polymerase has some reduced activity between 45 and 65 C (interval in which most annealing temperature are chosen), longer annealing times may increase the likelihood of unspecific amplification products...