A branch-and-bound method for the minimum k−enclosing ball problem

The minimum k-enclosing ball problem seeks the ball with smallest radius that contains at least k of m given points. This problem is NP-hard. We present a branch-and-bound algorithm on the tree of the subsets of k points to solve this problem. Our method is able to solve the problem exactly in a short amount of time for small and medium sized datasets.     

Phase transition in the one-dimensional pair-hopping model with unusual one-electron hopping

By modifying the conventional one-electron hopping behavior, we study effects of an occupation-dependent hopping on the ground state of the half-filled one-dimensional pair-hopping model. At weak coupling, the use of bosonization and renormalization-group analysis techniques helps to derive the phase diagram. Such unusual hopping is shown to drive a spin-gap transition and to introduce a new region where the triplet superconducting instability dominates for positively small pair-hopping interaction.     

Improved error performance for generalised spatial modulation with enhanced spectral efficiency

The existing analytical average bit error rate (ABER) expression of conventional generalised spatial modulation (CGSM) does not agree well with the Monte Carlo simulation results in the low signal‐to‐noise ratio (SNR) region. Hence, the first contribution of this paper is to derive a new and easy way to evaluate analytical ABER expression that improves the validation of the simulation results at low SNRs. Secondly, a novel system termed CGSM with enhanced spectral efficiency (CGSM‐ESE) is presented. This system is realised by applying a rotation angle to one of the two active transmit antennas. As a result, the overall spectral efficiency is increased by 1 bit/s/Hz when compared with the equivalent CGSM system. In order to validate the simulation results of CGSM‐ESE, the third contribution is to derive an analytical ABER expression. Finally, to improve the ABER performance of CGSM‐ESE, three link adaptation algorithms are developed. By assuming full knowledge of the channel at the receiver, the proposed algorithms select a subset of channel gain vector (CGV) pairs based on the Euclidean distance between all CGV pairs, CGV splitting, CGV amplitudes, or a combination of these.     

应用膨胀算法提取目标的直接定位算法

为了解决被动雷达系统中的多发射源定位问题，提出了一种基于多重信号分类(MUSIC)算法和图像膨胀(IE)算法的直接定位方法。该方法结合了谱分析中的MUSIC思想，通过对接收量测协方差矩阵进行特征分析求解目标的位置。首先，在目标个数未知的前提下，利用Akaike信息准则(AIC)来确定模型阶数；然后，推导了基于MUSIC的定位代价函数；之后，利用图像膨胀算法处理得到的代价函数平面；最后，膨胀处理后的输出为目标个数及目标位置的估计值。提出的算法有效地解决了目标检测及提取的问题，能够确定多个目标的位置坐标，为后续的定位性能分析提供可能性，也保证了算法的完整性。进一步地分析了多个临近目标情况下影响目标提取性能的主要因素。     

基于三相幅度测量的相控阵天线快速校准方法

提出了一种基于三相幅度测量的相控阵天线快速校准方法。该方法将天线阵列进行分组,利用每种分组在三种配相下的阵面合成场幅度测量值,可解算出各个天线单元的初始幅相值。该方法仅需幅度测量,避免了相位测量误差影响单元幅相值的计算精度,而且所需幅度测量次数仅为(2N+1)次,可显著提高校准时效性。另外,利用分组思想,同时改变多个单元相位,使总辐射场的幅度变化显著,提升校准准确性。仿真结果表明:校准后相位均方根误差为2.2°,幅度均方根误差为0.2 dB。     

Thermally induced solid-state transformation of cimetidine. A multi-spectroscopic/chemometrics determination of the kinetics of the process and structural elucidation of one of the products as a stable N3-enamino tautomer

Exposure of cimetidine (CIM) to dry heat (160–180 °C) afforded, upon cooling, a glassy solid containing new and hitherto unknown products. The kinetics of this process was studied by a second order chemometrics-assisted multi-spectroscopic approach. Proton and carbon-13 nuclear magnetic resonance (NMR), as well as ultraviolet and infrared spectroscopic data were jointly used, whereas multivariate curve resolution with alternating least squares (MCR-ALS) was employed as the chemometrics method to extract process information. It was established that drug degradation follows a first order kinetics.