Maximum Shannon Entropy, Minimum Fisher Information, and an Elementary Game

We formulate an elementary statistical game which captures the essence of some fundamental quantum experiments such as photon polarization and spin measurement. We explore and compare the significance of the principle of maximum Shannon entropy and the principle of minimum Fisher information in solving such a game. The solution based on the principle of minimum Fisher information coincides with the solution based on an invariance principle, and provides an informational explanation of Malus' law for photon polarization. There is no solution based on the principle of maximum Shannon entropy. The result demonstrates the merits of Fisher information, and the demerits of Shannon entropy, in treating some fundamental quantum problems. It also provides a quantitative example in support of a general philosophy: Nature intends to hide Fisher information, while obeying some simple rules.     

On the analysis of a dynamic evolutionary algorithm

Evolutionary algorithms are applied as problem-independent optimization algorithms. They are quite efficient in many situations. However, it is difficult to analyze even the behavior of simple variants of evolutionary algorithms like the (1+1) EA on rather simple functions. Nevertheless, only the analysis of the expected run time and the success probability within a given number of steps can guide the choice of the free parameters of the algorithms. Here static (1+1) EAs with a fixed mutation probability are compared with dynamic (1+1) EAs with a simple schedule for the variation of the mutation probability. The dynamic variant is first analyzed for functions typically chosen as example-functions for evolutionary algorithms. Afterwards, it is shown that it can be essential to choose the suitable variant of the (1+1) EA. More precisely, functions are presented where each static (1+1) EA has exponential expected run time while the dynamic variant has polynomial expected run time. For other functions it is shown that the dynamic (1+1) EA has exponential expected run time while a static (1+1) EA with a good choice of the mutation probability has polynomial run time with overwhelming probability.     

Scale Invariance Properties in the Simulated Annealing Algorithm

The Boltzmann distribution used in the steady-state analysis of the simulated annealing algorithm gives rise to several scale invariant properties. Scale invariance is first presented in the context of parallel independent processors and then extended to an abstract form based on lumping states together to form new aggregate states. These lumped or aggregate states possess all of the mathematical characteristics, forms and relationships of states (solutions) in the original problem in both first and second moments. These scale invariance properties therefore permit new ways of relating objective function values, conditional expectation values, stationary probabilities, rates of change of stationary probabilities and conditional variances. Such properties therefore provide potential applications in analysis, statistical inference and optimization. Directions for future research that take advantage of scale invariance are also discussed.     

Cosmic dust and our origins

The small solid particles in the space between the stars provide the surfaces for the production of many simple and complex molecules. Processes involving the effects of ultraviolet irradiation of the thin (hundredth micron) mantles are shown to produce a wide range of molecules and ions also seen in comets. Some of the more complex ones inferred from laboratory experiments are expected to play an important role in the origin of life. An outline of the chemical evolution of interstellar dust as observed and as studied in the laboratory is presented. Observations of comets are shown to provide substantial evidence for their being fluffy aggregates of interstellar dust as it was in the protosolar nebula, i.e. the interstellar cloud which collapsed to form the solar system. The theory that comets may have brought the progenitors of life to the earth is summarized.     

Interference of probabilities and number field structure of quantum models

We study the probabilistic consequences of the choice of the basic number field in the quantum formalism. We demonstrate that by choosing a number field for a linear space representation of quantum model it is possible to describe various interference phenomena. We analyse interference of probabilistic alternatives induced by real, complex, hyperbolic (Clifford) and p‐adic representations.     

A Facile Synthesis of α-Phenylthio-α,β-Unsatuated Esters

α-phenylthio-α，β-unsaturated esters 6 were synthesized by Witting reaction of 3.which were prepared by a phenylsulfenyllation-trans-ylidation reaction.     

Theoretical Study on the Reaction Mechanism between Dichlorocarbene and Armchair Single-walled Carbon Nanotubes

1 INTRODUCTION Carbon nanotubes have many potential applica- tions due to their unique structures and properties[1～4]. Physicists have been studying their electrical, me- chanical and other properties since their discove- ries[5, 6]. Recently, chemists are interested in carbon nanotubes because their properties can be altered by chemical functionalization[7～14], and these functiona- lized nanotubes can undergo further chemical trea- tment. So the potential application range of such na- …     

A solvent-free synthesis of coumarins using a Wells-Dawson heteropolyacid as catalyst

Substituted coumarins are synthesized from phenols and β-ketoesters by the Pechmann reaction, using a Wells-Dawson heteropolyacid (H₆P₂W₁₈O₆₂·24H₂O) as catalyst by a solvent-free procedure. This one requires low reaction times, 130 °C temperature and as little as 1 mol % of Wells-Dawson acid, obtaining good to excellent yields of coumarins. The catalyst showed to be reusable with no differences in the yields. The results are compared with those of the reactions performed in toluene solution. The presented synthetic procedure is a convenient, clean and fast alternative for synthesizing 4-substituted coumarins (17 examples).     

Free probability and the von Neumann algebrasof free groups

This short note summarizes the circumstances of the birth of free probability theory andsome of the recent achievements.     

Controlling an oscillating Jackson-type network having state-dependent service rates

We consider a Jackson-type network comprised of two queues having state-dependent service rates, in which the queue lengths evolve periodically, exhibiting noisy cycles. To reduce this noise a certain heuristic, utilizing regions in the phase space in which the system behaves almost deterministically, is applied. Using this heuristic, we show that in order to decrease the probability of a customers overflow in one of the queues in the network, the server in that same queue – contrary to intuition – should be shut down for a short period of time. Further noise reduction is obtained if the server in the second queue is briefly shut down as well, when certain conditions hold.