LPNN-based approach for LASSO problem via a sequence of regularized minimizations

In compressive sampling theory, the least absolute shrinkage and selection operator (LASSO) is a representative problem. Nevertheless, the non-differentiable constraint impedes the use of Lagrange programming neural networks (LPNNs). We present in this article the -LPNN model, a novel algorithm that tackles the LASSO minimization together with the underlying theory support. First, we design a sequence of smooth constrained optimization problems, by introducing a convenient differentiable approximation to the non-differentiable -norm constraint. Next, we prove that the optimal solutions of the regularized intermediate problems converge to the optimal sparse signal for the LASSO. Then, for every regularized problem from the sequence, the -LPNN dynamic model is derived, and the asymptotic stability of its equilibrium state is established as well. Finally, numerical simulations are carried out to compare the performance of the proposed -LPNN algorithm with both the LASSO-LPNN model and a standard digital method.     

A model for semiconductor quantum dot molecule based on the current spin density functional theory

Based on the current spin density functional theory, a theoretical model of three vertically aligned semiconductor quantum dots is proposed and numerically studied. This quantum dot molecule (QDM) model is treated with realistic hard-wall confinement potential and external magnetic field in three-dimensional setting. Using the effective-mass approximation with band nonparabolicity, the many-body Hamiltonian results in a cubic eigenvalue problem from a finite difference discretization. A self-consistent algorithm for solving the Schrödinger-Poisson system by using the Jacobi-Davidson method and GMRES is given to illustrate the Kohn-Sham orbitals and energies of six electrons in the molecule with some magnetic fields. It is shown that the six electrons residing in the central dot at zero magnetic field can be changed to such that each dot contains two electrons with some feasible magnetic field. The Förster-Dexter resonant energy transfer may therefore be generated by two individual QDMs. This may motivate a new paradigm of Fermionic qubits for quantum computing in solid-state systems.     

A Least Squares Approach to Escalator Algorithms for Adaptive Filtering

In this paper, we introduce an escalator (ESC) algorithm based on the least squares (LS) criterion. The proposed algorithm is relatively insensitive to the eigenvalue spread ratio (ESR) of an input signal and has a faster convergence speed than the conventional ESC algorithms. This algorithm exploits the fast adaptation ability of least squares methods and the orthogonalization property of the ESC structure. From the simulation results, the proposed algorithm shows superior convergence performance.     

Bandpass filters using periodically loaded combline resonators

A novel combline filter is proposed for cellular‐radio base stations. The Q‐factor is significantly improved. The eigenvalue equation is expressed with the single‐team approximation in the gap region of the combline resonator. A two‐pole combline filter is designed. The calculation, simulation, and experiment results are presented and are in good agreement. © 2005 Wiley Periodicals, Inc. Int J RF and Microwave CAE, 2006.     

基于多模型半参数非线性回归模型的外弹道节省参数估计

双星定位系统的应用是外弹道估计中的一种发展趋势。文章给出基于双星、光雷的联合测量模型,建立基于半参数回归的外弹道节省参数估计模型;给出基于半参数回归的外弹道节省参数估计算法及计算步骤,并从理论上分析了基于半参数回归的外弹道节省参数估计算法能有效地消除非线性因素对参数估计性能的影响,其估计精度优于经典的节省参数建模方法,并通过仿真得到：该算法确实有效。     

Sparse synthetic aperture radar imaging with optimized azimuthal aperture

To counter the problem of acquiring and processing huge amounts of data for synthetic aperture radar(SAR)using traditional sampling techniques,a method for sparse SAR imaging with an optimized azimuthal aperture is presented.The equivalence of an azimuthal match filter and synthetic array beamforming is shown so that optimization of the azimuthal sparse aperture can be converted to optimization of synthetic array beamforming.The azimuthal sparse aperture,which is composed of a middle aperture and symmetrical bilateral apertures,can be obtained by optimization algorithms(density weighting and simulated annealing algorithms,respectively).Furthermore,sparse imaging of spectrum analysis SAR based on the optimized sparse aperture is achieved by padding zeros at null samplings and using a non-uniform Taylor window.Compared with traditional sampling,this method has the advantages of reducing the amount of sampling and alleviating the computational burden with acceptable image quality.Unlike periodic sparse sampling,the proposed method exhibits no image ghosts.The results obtained from airborne measurements demonstrate the effectiveness and superiority of the proposed method.     

一种新的码片内多径时延估计方法

根据信道冲激响应的稀疏特性,提出了一种频域的时延估计压缩感知模型,将时延估计问题转化为基于欠采样数据的稀疏向量估计问题.利用离散傅里叶变换(Discrete Fourier transform,DFT)矩阵的子矩阵所满足的受限等距性(Restricted isometry property,RIP)以及信道冲激响应的稀疏特性充分降低了时延估计所需数据量的要求.分析了本文模型具有码片内多径分辨能力以及良好抗噪性能的原因,并与多信号分类(Multiple signal classification,MUSIC)和旋转不变技术的信号参数估计(Estimation of signal parameters via rotational invariance technique,ESPRIT)算法的时延估计性能进行仿真比较.仿真结果表明,本文提出的方法不需要预知多径的条数,对码片内多径时延具有较高的估计精度,其时延估计性能在特定条件下优于MUSIC和ESPRIT算法.     

基于压缩感知的无线传感器网络的数据编码

近年来,基于压缩感知的无线传感器网络数据编码的研究取得了一定的进展,但大部分研究是基于"单跳"的传输模型或者没有考虑网络内节点之间的合作。本文提出了一种基于压缩感知和分簇的传感器网络数据编码方法。首先,节点根据自己的编号伪随机的产生一个M维的列向量,把感知的数据xi投影到此向量上,然后把自己的编号和投影的数据一同传输给簇头。簇头把收到的数据进行求和,并且把计算后的结果传送给下一个簇头,直到sink节点。通过仿真实验和理论分析,验证了本文提出的方法比传统的方法能更好地减少网络内数据传输量。     

An analytical and numerical study of the two-dimensional Bratu equation

Bratu's problem, which is the nonlinear eigenvalue equationu+ exp(u)=0 withu=0 on the walls of the unit square and as the eigenvalue, is used to develop several themes on applications of Chebyshev pseudospectral methods. The first is the importance ofsymmetry: because of invariance under the C₄ rotation group and parity in bothx andy, one can slash the size of the basis set by a factor of eight and reduce the CPU time by three orders of magnitude. Second, the pseudospectral method is ananalytical as well as a numerical tool: the simple approximation3.2A exp(–0.64A), whereA is the maximum value ofu(x, y), is derived via collocation with but a single interpolation point, but is quantitatively accurate for small and moderateA. Third, the Newton-Kantorovich/Chebyshev pseudospectral algorithm is so efficient that it is possible to compute good numerical solutions—five decimal places—on amicrocomputer inbasic. Fourth, asymptotic estimates of the Chebyshev coefficients can be very misleading: the coefficients for moderately or strongly nonlinear solutions to Bratu's equations fall off exponentially rather than algebraically withv untilv is so large that one has already obtained several decimal places of accuracy. The corner singularities, which dominate the behavior of the Chebyshev coefficients in thelimit v, are so weak as to be irrelevant, and replacing Bratu's problem by a more complicated and realistic equation would merely exaggerate the unimportance of the corner branch points even more.