Asteroseismic constraints on the OPAL opacity interpolation

The frequency difference between a model used only two-point interpolation of opacity and a model used piecewise linear interpolation of opacity is of the order of several microHertz at a certain stage, which is almost 10 times worse than the observational precision of p-modes of solar-like stars. Therefore, the two-point interpolation of opacity is unsuitable in modelling of solar-like stars with element diffusion.Comment: 2 pages, 1 figure; to appear in the Proceedings of IAU Symp. 252 "The Art of Modelling Stars in the 21st Century", Sanya, China, 6th-11th April 2008, (L. Deng, K.L. Chan & C. Chiosi, eds.

ETEA: A euclidean minimum spanning tree-Based evolutionary algorithm for multiobjective optimization

© the Massachusetts Institute of TechnologyAbstract The Euclidean minimum spanning tree (EMST), widely used in a variety of domains, is a minimum spanning tree of a set of points in the space, where the edge weight between each pair of points is their Euclidean distance. Since the generation of an EMST is entirely determined by the Euclidean distance between solutions (points), the properties of EMSTs have a close relation with the distribution and position information of solutions. This paper explores the properties of EMSTs and proposes an EMST-based Evolutionary Algorithm (ETEA) to solve multiobjective optimization problems (MOPs). Unlike most EMO algorithms that focus on the Pareto dominance relation, the proposed algorithm mainly considers distance-based measures to evaluate and compare individuals during the evolutionary search. Specifically in ETEA, four strategies are introduced: 1) An EMST-based crowding distance (ETCD) is presented to estimate the density of individuals in the population; 2) A distance comparison approach incorporating ETCD is used to assign the fitness value for individuals; 3) A fitness adjustment technique is designed to avoid the partial overcrowding in environmental selection; 4) Three diversity indicators-the minimum edge, degree, and ETCD-with regard to EMSTs are applied to determine the survival of individuals in archive truncation. From a series of extensive experiments on 32 test instances with different characteristics, ETEA is found to be competitive against five state-of-the-art algorithms and its predecessor in providing a good balance among convergence, uniformity, and spread.Engineering and Physical Sciences Research Council (EPSRC) of the United Kingdom under Grant EP/K001310/1, and the National Natural Science Foundation of China under Grant 61070088

Entanglement and quantum discord dynamics of two atoms under practical feedback control

We study the dynamics of two identical atoms resonantly coupled to a single-mode cavity under practical feedback control, and focus on the detection inefficiency. The entanglement is induced to vanish in finite time by the inefficiency of detection. Counterintuitively, the asymptotic entanglement and quantum discord can be increased by the inefficiency of detection. The noise of detection triggers control field to create entanglement and discord when no photon are emitted from the atoms. Furthermore, sudden change happens to the dynamics of entanglement.Comment: 5 pages, 4 figure

Inducing R&D investment with price ceilings

Though government intervention is prevalent in the market for research and development (R&D), most literature has focused on the use of subsidies, patents or joint research ventures to obtain the efficient R&D investment. By using a two-stage duopoly model in which firms first choose the level of investment and then output, our paper shows that the introduction of a price ceiling by the regulator will result in the optimal level of R&D. This interesting but counterintuitive result contrasts with the existing literature and advances our understanding about price ceilings.Research and development; Subsidy; Price ceiling

Cryptanalyzing a discrete-time chaos synchronization secure communication system

This paper describes the security weakness of a recently proposed secure communication method based on discrete-time chaos synchronization. We show that the security is compromised even without precise knowledge of the chaotic system used. We also make many suggestions to improve its security in future versions.Comment: 11 pages, 3 figures, latex forma

Throughput Maximization for UAV-Aided Backscatter Communication Networks

This paper investigates unmanned aerial vehicle (UAV)-aided backscatter communication (BackCom) networks, where the UAV is leveraged to help the backscatter device (BD) forward signals to the receiver. Based on the presence or absence of a direct link between BD and receiver, two protocols, namely transmit-backscatter (TB) protocol and transmit-backscatter-relay (TBR) protocol, are proposed to utilize the UAV to assist the BD. In particular, we formulate the system throughput maximization problems for the two protocols by jointly optimizing the time allocation, reflection coefficient and UAV trajectory. Different static/dynamic circuit power consumption models for the two protocols are analyzed. The resulting optimization problems are shown to be non-convex, which are challenging to solve. We first consider the dynamic circuit power consumption model, and decompose the original problems into three sub-problems, namely time allocation optimization with fixed UAV trajectory and reflection coefficient, reflection coefficient optimization with fixed UAV trajectory and time allocation, and UAV trajectory optimization with fixed reflection coefficient and time allocation. Then, an efficient iterative algorithm is proposed for both protocols by leveraging the block coordinate descent method and successive convex approximation (SCA) techniques. In addition, for the static circuit power consumption model, we obtain the optimal time allocation with a given reflection coefficient and UAV trajectory and the optimal reflection coefficient with low computational complexity by using the Lagrangian dual method. Simulation results show that the proposed protocols are able to achieve significant throughput gains over the compared benchmarks