Adaptive GLR-, Rao- and Wald-based CFAR detectors for a subspace signal embedded in structured Gaussian interference

The problem of detecting a subspace signal embedded in subspace Gaussian interference and thermal noise is studied in this paper. In this problem, both the signal-independent and signal-dependent interferences are assumed to be present, therefore the overall interference subspace covers the signal subspace. The approach of this paper extends previous works involving either of those two kinds of interferences. A set of secondary data containing only interference plus noise is employed to estimate the interference covariance matrix and the noise power. Three new detectors are designed via the generalized likelihood ratio (GLR), Rao and Wald tests, respectively. Their probabilities of false alarms (PFAs) and detections are analytically derived. The PFAs show that the new detectors have the constant false alarm rate (CFAR) property against the interference and noise. Numerical results show that the new detectors outperform their counterparts for the studied problem. Furthermore, the new detectors are less sensitive to the secondary data size and to the mismatched subspace signal than some other detectors, such as the GLR detector (GLRD), the adaptive matched filter (AMF), the adaptive subspace detector (ASD), etc.     

An experimental study of adaptive control for evolutionary algorithms

In this paper, we investigate how adaptive operator selection techniques are able to efficiently manage the balance between exploration and exploitation in an evolutionary algorithm, when solving combinatorial optimization problems. We introduce new high level reactive search strategies based on a generic algorithm's controller that is able to schedule the basic variation operators of the evolutionary algorithm, according to the observed state of the search. Our experiments on SAT instances show that reactive search strategies improve the performance of the solving algorithm.     

Friction compensation controller for load varying machine tool feed drive

The load applied to a machine tool feed drive changes during the machining process as material is removed. This load change alters the Coulomb friction of the feed drive. Because Coulomb friction accounts for a large part of the total friction the friction compensation control accuracy of the feed drives is limited if this nonlinear change in the applied load is not considered. This paper presents a new friction compensation method that estimates the machine tool load in real time and considers its effect on friction characteristics. A friction observer based on a Kalman filter with load estimation is proposed for friction compensation control considering the applied load change. A specially designed feed drive testbed that enables the applied load to be modified easily was constructed for experimental verification. Control performance and friction estimation accuracy are demonstrated experimentally using the testbed.     

A case-deletion diagnostic for penalized calibration estimators and BLUP under linear mixed models in survey sampling

The penalized calibration technique in survey sampling combines usual calibration and soft calibration by introducing a penalty term. Certain relevant estimates in survey sampling can be considered as penalized calibration estimates obtained as particular cases from an optimization problem with a common basic structure. In this framework, a case deletion diagnostic is proposed for a class of penalized calibration estimators including both design-based and model-based estimators. The diagnostic compares finite population parameter estimates and can be calculated from quantities related to the full data set. The resulting diagnostic is a function of the residual and leverage, as other diagnostics in regression models, and of the calibration weight, a singular feature in survey sampling. Moreover, a particular case, which includes the basic unit level model for small area estimation, is considered. Both a real and an artificial example are included to illustrate the diagnostic proposed. The results obtained clearly show that the proposed diagnostic depends on the calibration and soft-calibration variables, on the penalization term, as well as on the parameter to estimate.     

GOS+MU:一种查询对象选择新方法

在分析单一MU(Most Uncertainty)采样缺陷的基础上,提出一种"全局最优搜寻"方法 GOS(Global Optimal Search),并结合MU共同完成查询选择。GOS+MU方法中,GOS着眼全局寻找目标,在应用环境能提供的训练样本数量有限、分类器受训不充分时,该方法选择的对象学习价值高,能快速推进分类器学习进程;MU则能够在GOS采样失效情形下,利用分类器当前训练成果,选择查询不确定性最强的样本补充训练集。通过对网络商品的用户评论进行分类仿真,并比较其他采样学习方法的效果,证明了GOS+MU方法在压缩学习成本、提高训练效率方面的有效性。     

Stream-Based Data Sampling Mechanism for Process Object

Process object is the instance of process. Vertexes and edges are in the graph of process object. There are different types of the object itself and the associations between object. For the large-scale data, there are many changes reflected. Recently, how to find appropriate real-time data for process object becomes a hot research topic. Data sampling is a kind of finding c hanges o f p rocess o bjects. There i s r equirements f or s ampling to be adaptive to underlying distribution of data stream. In this paper, we have proposed a adaptive data sampling mechanism to find a ppropriate d ata t o m odeling. F irst o f all, we use concept drift to make the partition of the life cycle of process object. Then, entity community detection is proposed to find changes. Finally, we propose stream-based real-time optimization of data sampling. Contributions of this paper are concept drift, community detection, and stream-based real-time computing. Experiments show the effectiveness and feasibility of our proposed adaptive data sampling mechanism for process object.     

采用八叉树和OSG分页结点的海量点云三维可视化

针对现有海量点云可视化方法存在索引构建时间长、内存占用大等问题，研究一种八叉树索引结合OSG分页结点的快速可视化方法，可在占用较小内存的基础上快速建立点云索引并实时调度。采用八叉树索引结构对海量点云进行数据组织，建立各层级的八叉树结点并以文件映射的方式分块保存，对结点文件重组织转换为支持OSG渲染引擎的多分辨率点云数据。采用基于OSG分页结点的实时调度技术，对海量点云进行高质量可视化。与目前两款主流的点云数据处理商业软件进行实验对比分析，结果表明所提方法具有索引建立速度快、内存占用小等优点，同时可视化交互更加流畅，适用于各种配置计算机下海量点云数据的调度管理与实时可视化。     

Transport Map sampling with PGD model reduction for fast dynamical Bayesian data assimilation

The motivation of this work is to address real-time sequential inference of parameters with a full Bayesian formulation. First, the proper generalized decomposition (PGD) is used to reduce the computational evaluation of the posterior density in the online phase. Second, Transport Map sampling is used to build a deterministic coupling between a reference measure and the posterior measure. The determination of the transport maps involves the solution of a minimization problem. As the PGD model is quasi-analytical and under a variable separation form, the use of gradient and Hessian information speeds up the minimization algorithm. Eventually, uncertainty quantification on outputs of interest of the model can be easily performed due to the global feature of the PGD solution over all coordinate domains. Numerical examples highlight the performance of the method.     

Superior foetal electrocardiogram signal elicitation using a novel artificial intelligent Bayesian methodology

Innumerable casualties due to intrauterine hypoxia are a major worry during prenatal phase besides advanced patient monitoring with latest science and technology. Hence, the analysis of foetal electrocardiogram (fECG) signals is very vital in order to evaluate the foetal heart status for timely recognition of cardiac abnormalities. Regrettably, the latest technology in the cutting edge field of biomedical signal processing does not seem to yield the desired quality of fECG signals required by physicians, which is the major cause for the pathetic condition. The focus of this work is to extort non-invasive fECG signal with highest possible quality with a motive to support physicians in utilizing the methodology for the latest intrapartum monitoring technique called STAN (ST analysis) for forecasting intrapartum foetal hypoxia. However, the critical quandary is that the non-invasive fECG signals recorded from the maternal abdomen are affected by several interferences like power line interference, baseline drift interference, electrode motion interference, muscle movement interference and the maternal electrocardiogram (mECG) being the dominant interference. A novel hybrid methodology called BANFIS (Bayesian adaptive neuro fuzzy inference system) is proposed. The BANFIS includes a Bayesian filter and an adaptive neuro fuzzy filter for mECG elimination and non-linear artefacts removal to yield high quality fECG signal. Kalman filtering frame work has been utilized to estimate the nonlinear transformed mECG component in the abdominal electrocardiogram (aECG). The adaptive neuro fuzzy filter is employed to discover the nonlinearity of the nonlinear transformed version of mECG and to align the estimated mECG signal with the maternal component in the aECG signal for annulment. The outcomes of the investigation by the proposed BANFIS system proved valuable for STAN system for efficient prediction of foetal hypoxia.     

A novel approach to adaptive relational association rule mining

The paper focuses on the adaptive relational association rule mining problem. Relational association rules represent a particular type of association rules which describe frequent relations that occur between the features characterizing the instances within a data set. We aim at re-mining an object set, previously mined, when the feature set characterizing the objects increases. An adaptive relational association rule method, based on the discovery of interesting relational association rules, is proposed. This method, called ARARM (Adaptive Relational Association Rule Mining) adapts the set of rules that was established by mining the data before the feature set changed, preserving the completeness. We aim to reach the result more efficiently than running the mining algorithm again from scratch on the feature-extended object set. Experiments testing the method's performance on several case studies are also reported. The obtained results highlight the efficiency of the ARARM method and confirm the potential of our proposal.