基于数据质量评价的目标估计

针对目标估计过程需要大量人工参与、自动化程度低的问题，提出了基于数据质量评价的目标估计方法。利用目标数据质量评价方法，对不同传感器得到的目标数据质量进行科学、有效的测度和评价，并根据质量得分动态调整各数据源在目标估计过程中所占的权重，从而减少人工干预，提高目标估计效能。仿真试验结果证明了该方法的有效性。     

基于单光子计数激光雷达的Bayesian检测研究

在单光子计数激光雷达检测领域,目前的检测方法在低信噪比情况下虚警概率会增加,同时也无法适应噪声变化的问题。针对这些问题,提出了一种基于Bayesian的检测方法,该方法首先通过雷达方程估计回波信号光子数的范围,将其作为先验信息,而后结合二项分布建立了累计概率模型,基于Bayesian判决准则计算得到检测阈值,此阈值能够在检测概率与虚警概率中间择其平衡。这种方法不仅克服了低信噪比检测困难的情况,还减少了先验信息的获取难度。实验结果表明,对比固定阈值其虚警概率降低了10倍。对比“恒虚警”其检测概率提高了约20。验证了方法具有良好的检测效果,具备一定的可操作性。     

Subdivision based isogeometric analysis for geometric flows

We present a new isogeometric analysis (IGA) approach based on extended Loop subdivision scheme for solving various geometric flows defined on subdivision surfaces. The studied flows include the second-order, fourth-order, and sixth-order geometric flows, such as averaged mean curvature flow, constant mean curvature flow, and minimal mean-curvature-variation flow, which are generally derived by minimizing the associate energy functionals with $L^2$-gradient flow respectively. The geometric flows are discretized by means of subdivision based IGA, where the finite element space is formulated by the limit form of the extended Loop subdivision for different initial control meshes. The basis functions, consisting of quartic box-splines corresponding to each subdivided control mesh, are utilized to represent the geometry exactly. For the cases of the evolution of open surfaces with any shape boundary, high-order continuous boundary conditions derived from the mixed variational forms of the geometric flows should be implemented to be consistent with the isogeometric concept. For time discretization, we adopt an adaptive semi-implicit Euler scheme. By several numerical experiments, we study the convergence behaviors of the proposed approach for solving the geometric flows with high-order boundary conditions. Moreover, the numerical results also show the accuracy and efficiency of the proposed method.     

Removing data and using metafounders alleviates biases for all traits in Lacaune dairy sheep predictions

Bias in dairy genetic evaluations, when it exists, has to be understood and properly addressed. The origin of biases is not always clear. We analyzed 40 yr of records from the Lacaune dairy sheep breeding program to evaluate the extent of bias, assess possible corrections, and emit hypotheses on its origin. The data set included 7 traits (milk yield, fat and protein contents, somatic cell score, teat angle, udder cleft, and udder depth) with records from 600,000 to 5 million depending on the trait, ～1,900,000 animals, and ～5,900 genotyped elite artificial insemination rams. For the ～8% animals with missing sire, we fit 25 unknown parent groups. We used the linear regression method to compare “partial” and “whole” predictions of young rams before and after progeny testing, with 7 cut-off points, and we obtained estimates of their bias, (over)dispersion, and accuracy in early proofs. We tried (1) several scenarios as follows: multiple or single trait, the “official” (routine) evaluation, which is a mixture of both single and multiple trait, and “deletion” of data before 1990; and (2) several models as follows: BLUP and single-step genomic (SSG)BLUP with fixed unknown parent groups or metafounders, where, for metafounders, their relationship matrix gamma was estimated using either a model for inbreeding trend, or base allele frequencies estimated by peeling. The estimate of gamma obtained by modeling the inbreeding trend resulted in an estimated increase of inbreeding, based on markers, faster than the pedigree-based one. The estimated genetic trends were similar for most models and scenarios across all traits, but were shrunken when gamma was estimated by peeling. This was due to shrinking of the estimates of metafounders in the latter case. Across scenarios, all traits showed bias, generally as an overestimate of genetic trend for milk yield and an underestimate for the other traits. As for the slope, it showed overdispersion of estimated breeding values for all traits. Using multiple-trait models slightly reduced the overestimate of genetic trend and the overdispersion, as did including genomic information (i.e., SSGBLUP) when the gamma matrix was estimated by the model for inbreeding trend. However, only deletion of historical data before 1990 resulted in elimination of both kind of biases. The SSGBLUP resulted in more accurate early proofs than BLUP for all traits. We considered that a snowball effect of small errors in each genetic evaluation, combined with selection, may have resulted in biased evaluations. Improving statistical methods reduced some bias but not all, and a simple solution for this data set was to remove historical records.     

Breeding schemes with optimum-contribution selection or truncation selection for beef cattle destined for use on dairy females

We tested the hypothesis that the size of a beef cattle population destined for use on dairy females is smaller under optimum-contribution selection (OCS) than under truncation selection (TRS) at the same genetic gain (ΔG) and the same rate of inbreeding (ΔF). We used stochastic simulation to estimate true ΔG realized at a 0.005 ΔF in breeding schemes with OCS or TRS. The schemes for the beef cattle population also differed in the number of purebred offspring per dam and the total number of purebred offspring per generation. Dams of the next generation were exclusively selected among the one-year-old heifers. All dams were donors for embryo transfer and produced a maximum of 5 or 10 offspring. The total number of purebred offspring per generation was: 400, 800, 1,600 or 4,000 calves, and it was used as a measure of population size. Rate of inbreeding was predicted and controlled using pedigree relationships. Each OCS (TRS) scheme was simulated for 10 discrete generations and replicated 100 (200) times. The OCS scheme and the TRS scheme with a maximum of 10 offspring per dam required approximately 783 and 1,257 purebred offspring per generation to realize a true ΔG of €14 and a ΔF of 0.005 per generation. Schemes with a maximum of 5 offspring per dam required more purebred offspring per generation to realize a similar true ΔG and a similar ΔF. Our results show that OCS and multiple ovulation and embryo transfer act on selection intensity through different mechanisms to achieve fewer selection candidates and fewer selected sires and dams than under TRS at the same ΔG and a fixed ΔF. Therefore, we advocate the use of a breeding scheme with OCS and multiple ovulation and embryo transfer for beef cattle destined for use on dairy females because it is favorable both from an economic perspective and a carbon footprint perspective.     

Vertex-Edge Degree Based Indices of Honey Comb Derived Network

Chemical graph theory is a branch of mathematics which combines graph theory and chemistry. Chemical reaction network theory is a territory of applied mathematics that endeavors to display the conduct of genuine compound frameworks. It pulled the research community due to its applications in theoretical and organic chemistry since 1960. Additionally, it also increases the interest the mathematicians due to the interesting mathematical structures and problems are involved. The structure of an interconnection network can be represented by a graph. In the network, vertices represent the processor nodes and edges represent the links between the processor nodes. Graph invariants play a vital feature in graph theory and distinguish the structural properties of graphs and networks. In this paper, we determined the newly introduced topological indices namely, first -degree Zagreb index, first -degree Zagreb index, second -degree Zagreb index, -degree Randic index, -degree atom-bond connectivity index, -degree geometric-arithmetic index, -degree harmonic index and -degree sum-connectivity index for honey comb derived network. In the analysis of the quantitative structure property relationships (QSPRs) and the quantitative structureactivity relationships (QSARs), graph invariants are important tools to approximate and predicate the properties of the biological and chemical compounds. Also, we give the numerical and graphical representation of our outcomes.     

Convolutional Neural Network Auto Encoder Channel Estimation Algorithm in MIMO-OFDM System

Higher transmission rate is one of the technological features of prominently used wireless communication namely Multiple Input Multiple Output-Orthogonal Frequency Division Multiplexing (MIMO–OFDM). One among an effective solution for channel estimation in wireless communication system, specifically in different environments is Deep Learning (DL) method. This research greatly utilizes channel estimator on the basis of Convolutional Neural Network Auto Encoder (CNNAE) classifier for MIMO-OFDM systems. A CNNAE classifier is one among Deep Learning (DL) algorithm, in which video signal is fed as input by allotting significant learnable weights and biases in various aspects/objects for video signal and capable of differentiating from one another. Improved performances are achieved by using CNNAE based channel estimation, in which extension is done for channel selection as well as achieve enhanced performances numerically, when compared with conventional estimators in quite a lot of scenarios. Considering reduction in number of parameters involved and re-usability of weights, CNNAE based channel estimation is quite suitable and properly fits to the video signal. CNNAE classifier weights updation are done with minimized Signal to Noise Ratio (SNR), Bit Error Rate (BER) and Mean Square Error (MSE).     

Residual attention-based tracking-by-detection network with attention-driven data augmentation

Tracking-by-detection (TBD) is a significant framework for visual object tracking. However, current trackers are usually updated online based on random sampling with a probability distribution. The performance of the learning-based TBD trackers is limited by the lack of discriminative features, especially when the background is full of semantic distractors. We propose an attention-driven data augmentation method, in which a residual attention mechanism is integrated into the TBD tracking network as supplementary references to identify discriminative image features. A mask generating network is used to simulate changes in target appearances to obtain positive samples, where attention information and image features are combined to identify discriminative features. In addition, we propose a method for mining hard negative samples, which searches for semantic distractors with the response of the attention module. The experiments on the OTB2015, UAV123, and LaSOT benchmarks show that this method achieves competitive performance in terms of accuracy and robustness.     

车辆高速避让路径跟踪控制策略

建立车辆动力学模型,研究车辆在高速避让工况下的路径跟踪控制策略。基于自抗扰控制设计车辆横摆角速度以及道路曲率2种不同的路径跟踪控制器;设计基于车辆偏航位移和偏航角度加权的线性二次最优控制器;对3种控制器控制效果进行仿真验证,分析路径跟踪侧向位移误差、侧向加速度、前轮转向角以及偏航角度变化。越野车实车测试结果表明,路径跟踪控制策略正确。     

基于全相位预处理的时域多重信号分类波达方向估计方法

低信噪比下,针对宽带短脉冲情况下频域多重信号分类(MUSIC)中噪声子空间估计不稳定问题,提出一种基于全相位预处理的时域多重信号分类波达方向(DOA)估计方法。①对线列阵接收数据进行分组处理;②按搜索角度对各组数据进行相移预处理,并对各组数据预处理结果进行相加,得到一组新数据;③对线列阵接收数据在时域构建相移后的协方差矩阵,在更短数据长度下,稳定实现噪声子空间估计,并依据估计出的噪声子空间含有的正交特性,通过单位矩阵加法器得到相应空间谱估计值,实现波达方向估计。数值仿真和实测数据处理结果表明,相比频域MUSIC方法,该方法有效提高了线列阵接收数据协方差矩阵中信号含有量和信噪比,能够在更短数据长度情况下实现对噪声子空间的稳定估计,具有较好的稳定性和检测性能,提高了MUSIC方法在实际波达方向估计中的鲁棒性。