Remote sensing of atmospheric duct parameters using simulated annealing

Simulated annealing is one of the robust optimization schemes. Simulated annealing mimics the annealing process of the slow cooling of a heated metal to reach a stable minimum energy state. In this paper, we adopt simulated annealing to study the problem of the remote sensing of atmospheric duct parameters for two different geometries of propagation measurement. One is from a single emitter to an array of radio receivers （vertical measurements）, and the other is from the radar clutter returns （horizontal measurements）. Basic principles of simulated annealing and its applications to refractivity estimation are introduced. The performance of this method is validated using numerical experiments and field measurements collected at the East China Sea. The retrieved results demonstrate the feasibility of simulated annealing for near real-time atmospheric refractivity estimation. For comparison, the retrievals of the genetic algorithm are also presented. The comparisons indicate that the convergence speed of simulated annealing is faster than that of the genetic algorithm, while the anti-noise ability of the genetic algorithm is better than that of simulated annealing.

Engine performance analysis and optimization of a dual-mode scramjet with varied inlet conditions

A dual-mode scramjet can operate in a wide range of flight conditions. Higher thrust can be generated by adopting suitable combustion modes. Based on the net thrust, an analysis and preliminary optimal design of a kerosene-fueled parameterized dual-mode scramjet at a cru- cial flight Mach number of 6 were investigated by using a modified quasi-one-dimensional method and simulated annealing strategy. Engine structure and heat release distrib- utions, affecting the engine thrust, were chosen as analytical parameters for varied inlet conditions （isolator entrance Mach number： 1.5-3.5）. Results show that different opti- mal heat release distributions and structural conditions can be obtained at five different inlet conditions. The highest net thrust of the parameterized dual-mode engine can be achieved by a subsonic combustion mode at an isolator entrance Mach number of 2.5. Additionally, the effects of heat release and scramjet structure on net thrust have been discussed. The present results and the developed analytical method can provide guidance for the design and optimization of high-performance dual-mode scramjets.

Optimal placement of magnets in Indus-2 storage ring

In Indus-2, by optimizing the position of the magnetic elements, using the simulated annealing algorithm, at different locations in the ring with their field errors, the effects on beam parameters have been minimized. Closed orbit distortion and beta beat are considerably reduced by optimizing the dipole and quadrupole magnets positions in the ring. For the Indus-2 storage ring, sextupole optimization gives insignificant improvement in dynamic aperture with chromaticity-correcting sextupoles. The magnets have been placed in the ring with the optimized sequence and storage of the beam has been achieved at injection energy without energizing any corrector magnets. Magnet sorting has led to the easy beam current accumulation and the measurement of parameters such as closed orbit distortion, beta function, dispersion, dynamic aperture etc.

A new neural network algorithm for planarization problems

To deal with the planarization problem widely used in many applications including routing very-large-scale integration （VLSI） circuits, this paper points out that only when its vertices are arranged in some specific order in a line can a planar graph be embedded on a line without any cross connections or cross edges. Energy function is proposed to meet the need of embedding a graph on a single line and route it correctly. A Hopfield network is designed according to the proposed energy function for such embedding and routing. The advantage of the proposed method is that it not only can detect if a graph is a planar one or not, but also can embed a planar graph or the maximal planar subgraph of a non-planar graph on a single line. In addition, simulated annealing is employed for helping the network to escape from local minima during the running of the Hopfield network. Experiments of the proposed method and its comparison with some existent conventional methods were performed and the results indicate that the proposed method is of great feasibility and effectiveness especially for the planarization problem of large graphs.