Optimal 3D Angle of Arrival Sensor Placement with Gaussian Priors

Sensor placement is an important factor that may significantly affect the localization performance of a sensor network. This paper investigates the sensor placement optimization problem in three-dimensional (3D) space for angle of arrival (AOA) target localization with Gaussian priors. We first show that under the A-optimality criterion, the optimization problem can be transferred to be a diagonalizing process on the AOA-based Fisher information matrix (FIM). Secondly, we prove that the FIM follows the invariance property of the 3D rotation, and the Gaussian covariance matrix of the FIM can be diagonalized via 3D rotation. Based on this finding, an optimal sensor placement method using 3D rotation was created for when prior information exists as to the target location. Finally, several simulations were carried out to demonstrate the effectiveness of the proposed method. Compared with the existing methods, the mean squared error (MSE) of the maximum a posteriori (MAP) estimation using the proposed method is lower by at least 25% when the number of sensors is between 3 and 6, while the estimation bias remains very close to zero (smaller than 0.15 m).     

Optimal wire ordering and spacing in low power semiconductor design

A key issue for high integration circuit design in the semiconductor industry are power constraints that stem from the need for heat removal and reliability or battery lifetime limitations. As the power consumption depends heavily on the capacitances between adjacent wires, determining the optimal ordering and spacing of parallel wires is an important issue in the design of low power chips. As it turns out, optimal wire spacing is a convex optimization problem, whereas the optimal wire ordering is combinatorial in nature, containing (a special class of) the Minimum Hamilton Path problem. While the latter is ${\mathcal{NP}}A key issue for high integration circuit design in the semiconductor industry are power constraints that stem from the need for heat removal and reliability or battery lifetime limitations. As the power consumption depends heavily on the capacitances between adjacent wires, determining the optimal ordering and spacing of parallel wires is an important issue in the design of low power chips. As it turns out, optimal wire spacing is a convex optimization problem, whereas the optimal wire ordering is combinatorial in nature, containing (a special class of) the Minimum Hamilton Path problem. While the latter is -hard in general, the present paper provides an algorithm that solves the coupled ordering and spacing problem for N parallel wires to optimality. Dedicated to Prof. Martin Gr?tschel on the occasion of his 60th birthday.     

基于病毒猴群算法的传感器优化布置方法研究

将病毒进化理论引入到猴群算法中,提出了一种用于传感器优化布置的病毒猴群算法。采用双重编码的方式,克服了原猴群算法只能解决连续变量优化问题的缺陷;在猴群中引入生物病毒机制对其进行感染,通过病毒和猴群的分工协作,来实现猴群个体之间纵向和横向的信息交流,以此维持个体的多样性,来大幅度增强算法的局部搜索能力;并将猴群不断的进行分类,采用大病毒和小病毒分别对其进行感染操作,加强算法的搜索精度。文末以大连国贸大厦为例,进行了参数敏感性分析以及传感器优化布置方案的选择,结果表明,病毒猴群算法的搜索效率较原猴群算法有了大幅提高,能较好地解决传感器优化布置问题。     

基于免疫猴群算法的传感器优化布置方法研究

将生物界中的免疫机制引入到猴群算法中,提出了一种用于传感器优化布置的免疫猴群算法。采用双重编码的方式,克服了原猴群算法只能解决连续变量优化问题的缺陷;采用混沌搜索的方式初始化猴群位置,以保证猴子能够均匀分布,提高了算法的全局搜索能力;通过在爬过程中引入深度爬的方式,增强了算法的局部搜索能力;在爬过程结束后加入基于浓度选择的机制对猴群进行初次选择,并对位置最优的猴子进行免疫克隆操作,以此保证猴群的多样性;在望过程结束后加入基于适应度的二次选择,并对位置较差的猴子进行免疫疫苗注射,以此提高算法的收敛能力。文末以大连世贸大厦为例,进行了参数敏感性分析以及传感器优化布置方案的选择,结果表明,免疫猴群算法的搜索效率较原猴群算法有了大幅提高,能较好地解决传感器优化布置问题。     

A method for the selection of sensor and actuator locations

A new and efficient technique for determining optimal locations of sensors and actuators of intelligent structures is presented. The optimization of sensor and actuator locations is based on the 1st order singular value perturbations of observability and controllability. Using this method the optimal placements of sensors and actuators of the intelligent structurer can be selected. Two numerical examples are given to demonstrate the applications of the method. The impulse responses of structures due to different locations of actuators with the same control law are analyzed in detail. The project supported by the National Natural Science Foundation of China and the Mechanical Technique Development Foundation of China     

Eigenvalue completions by affine varieties

In this paper we provide new necessary and sufficient conditions for a general class of eigenvalue completion problems.

     

Focusing performance of a multilayer Laue lens with layer placement error described by dynamical diffraction theory

The multilayer Laue lens (MLL) is essentially a linear zone plate with large aspect ratio, which can theoretically focus hard X‐rays to well below 1 nm with high efficiency when ideal structures are used. However, the focusing performance of a MLL depends heavily on the quality of the layers, especially the layer placement error which always exists in real MLLs. Here, a dynamical modeling approach, based on the coupled wave theory, is proposed to study the focusing performance of a MLL with layer placement error. The result of simulation shows that this method can be applied to various forms of layer placement error.     

Solving a novel multiobjective placement problem of recloser and distributed generation sources in simultaneous mode by improved harmony search algorithm

This article deals with optimal placement of Distributed Generation (DG) sources and recloser in simultaneous mode and develops an improved harmony search (iHS) algorithm to solve it. For this, two important control parameters have been adjusted to reach better solution from simple HS algorithm to obtain better solution from simple HS algorithm. The proposed multiobjective function consists of two parts; first is improving reliability indices and second is minimizing power loss. The reliability indices have been selected based on satisfactory requirements of costumer and electric company as well as response to transient and permanent faults. Then, four reliability indices has been used in objective function; that is, system average interruption duration index (SAIDI), cost of energy not supplied, momentary average interruption frequency index, and system average interruption frequency index (SAIFI). Simulation has been performed on a practical distribution network in North West of Iran. Three scenarios have been introduced; that is, scenario (i) First, placement of DGs, and then recloser, scenario (ii) First, placement of recloser, and then DG, and scenario (iii) simultaneous placement of DG and recloser. Also, three cases are defined based on the number of used DG and recloser. Results of the proposed algorithm have been compared with related values of particle swarm optimization and simple HS algorithms. The core contribution of the presented study is introducing several novel indices to analyze and discuss the obtained results from simulation. © 2014 Wiley Periodicals, Inc. Complexity 21: 328–339, 2015     

Conformational splitting: A more powerful criterion for dead‐end elimination

Dead‐end elimination (DEE) is a powerful theorem for selecting optimal protein side‐chain orientations from a large set of discrete conformations. The present work describes a new approach to dead‐end elimination that effectively splits conformational space into partitions to more efficiently eliminate dead‐ending rotamers. Split DEE makes it possible to complete protein design calculations that were previously intractable due to the combinatorial explosion of intermediate conformations generated during the convergence process. © 2000 John Wiley & Sons, Inc. J Comput Chem 21: 999–1009, 2000     

退化时滞系统的极点配置

This paper deals with the pole placement of the singular system Ex~.=Ax(t) Dx(t-(?)) Bu, y=Cx, where x∈R~n,u∈R~m,and y∈R~n are its state,control input and measure output respectively;E,A∈R~(n×n),B∈R~(n×m),and C∈R~((?)×n) are constant matrices.It is also assumed that rankE相似文献