基于光谱尺度空间与管道滤波的红外目标检测

为了准确地从复杂干扰背景下检测出真实弱小目标，本文引入视觉显著性，设计了基于快速光谱尺度空间与动态管道滤波的红外目标检测算法。基于真实目标与背景内容之间的整体差异，引入快速光谱尺度空间与阈值分割技术，设计视觉显著性机制，对红外图像完成处理，输出全局显著性映射，以高效过滤干扰背景内容。考虑目标与背景的局部特征差异，构建自适应局部对比度增强机制，对粗检测结果实施处理，获取对应的局部显著性映射，改善视觉显著性区域内目标的对比度。引入高斯差分理论，通过估算每一帧红外图像中的目标像素直径，形成动态管道滤波，充分消除虚警，准确识别出弱小目标。多组实验数据显示：较已有的红外目标检测技术而言，在各种不同的复杂背景干扰下，所提算法呈现出更好的检测能力，拥有更理想的接收机工作特性ROC曲线。     

Grid Search for Predicting Coronary Heart Disease by Tuning Hyper-Parameters

Diagnosing the cardiovascular disease is one of the biggest medical difficulties in recent years. Coronary cardiovascular (CHD) is a kind of heart and blood vascular disease. Predicting this sort of cardiac illness leads to more precise decisions for cardiac disorders. Implementing Grid Search Optimization (GSO) machine training models is therefore a useful way to forecast the sickness as soon as possible. The state-of-the-art work is the tuning of the hyperparameter together with the selection of the feature by utilizing the model search to minimize the false-negative rate. Three models with a cross-validation approach do the required task. Feature Selection based on the use of statistical and correlation matrices for multivariate analysis. For Random Search and Grid Search models, extensive comparison findings are produced utilizing retrieval, F1 score, and precision measurements. The models are evaluated using the metrics and kappa statistics that illustrate the three models’ comparability. The study effort focuses on optimizing function selection, tweaking hyperparameters to improve model accuracy and the prediction of heart disease by examining Framingham datasets using random forestry classification. Tuning the hyperparameter in the model of grid search thus decreases the erroneous rate achieves global optimization.     

Comparative analysis of inbreeding parameters and runs of homozygosity islands in 2 Italian autochthonous cattle breeds mainly raised in the Parmigiano-Reggiano cheese production region

Reggiana and Modenese are autochthonous cattle breeds, reared in the North of Italy, that can be mainly distinguished for their standard coat color (Reggiana is red, whereas Modenese is white with some pale gray shades). Almost all milk produced by these breeds is transformed into 2 mono-breed branded Parmigiano-Reggiano cheeses, from which farmers receive the economic incomes needed for the sustainable conservation of these animal genetic resources. After the setting up of their herd books in 1960s, these breeds experienced a strong reduction in the population size that was subsequently reverted starting in the 1990s (Reggiana) or more recently (Modenese) reaching at present a total of about 2,800 and 500 registered cows, respectively. Due to the small population size of these breeds, inbreeding is a very important cause of concern for their conservation programs. Inbreeding is traditionally estimated using pedigree data, which are summarized in an inbreeding coefficient calculated at the individual level (F_PED). However, incompleteness of pedigree information and registration errors can affect the effectiveness of conservation strategies. High-throughput SNP genotyping platforms allow investigation of inbreeding using genome information that can overcome the limits of pedigree data. Several approaches have been proposed to estimate genomic inbreeding, with the use of runs of homozygosity (ROH) considered to be the more appropriate. In this study, several pedigree and genomic inbreeding parameters, calculated using the whole herd book populations or considering genotyping information (GeneSeek GGP Bovine 150K) from 1,684 Reggiana cattle and 323 Modenese cattle, were compared. Average inbreeding values per year were used to calculate effective population size. Reggiana breed had generally lower genomic inbreeding values than Modenese breed. The low correlation between pedigree-based and genomic-based parameters (ranging from 0.187 to 0.195 and 0.319 to 0.323 in the Reggiana and Modenese breeds, respectively) reflected the common problems of local populations in which pedigree records are not complete. The high proportion of short ROH over the total number of ROH indicates no major recent inbreeding events in both breeds. ROH islands spread over the genome of the 2 breeds (15 in Reggiana and 14 in Modenese) identified several signatures of selection. Some of these included genes affecting milk production traits, stature, body conformation traits (with a main ROH island in both breeds on BTA6 containing the ABCG2, NCAPG, and LCORL genes) and coat color (on BTA13 in Modenese containing the ASIP gene). In conclusion, this work provides an extensive comparative analysis of pedigree and genomic inbreeding parameters and relevant genomic information that will be useful in the conservation strategies of these 2 iconic local cattle breeds.     

基于深度EPG的智能导航平台建设

随着三网融合的大力推进以及双向互动业务的大力开展,运营商使用原有简单的EPG不足以支撑开展更多的增值业务,不能主动为用户推荐节目,不能为运营商带来新的收入机会。作为重要的创新能力支撑系统,介绍了江苏有线智能导航平台的设计与应用,为相关广电运营商提供一定的设计参考。     

基于Word2Vec模型特征扩展的Web搜索结果聚类性能的改进

对于用户泛化和模糊的查询，将Web搜索引擎返回的列表内容聚类处理，便于用户有效查找感兴趣的内容。由于返回的列表由称为片段（snippet）的短文本组成，而传统的单词频率-逆文档频率（TF-IDF）特征选择模型不能适用于稀疏的短文本，使得聚类性能下降。一个有效的方法就是通过一个外部的知识库对短文本进行扩展。受到基于神经网络词表示方法的启发，提出了通过词嵌入技术的Word2Vec模型对短文本扩展，即采用Word2Vec模型的TopN个最相似的单词用于对片段（snippet）的扩展，扩展文档使得TF-IDF模型特征选择得到聚类性能的提高。同时考虑到通用性单词造成的噪声引入，对扩展文档的TF-IDF矩阵进行了词频权重修正。实验在两个公开数据集ODP239和SearchSnippets上完成，将所提方法和纯snippet无扩展的方法、基于Wordnet的特征扩展方法和基于Wikipedia的特征扩展方法进行了对比。实验结果表明，所提方法在聚类性能方面优于对比方法。     

基于k-shell的复杂网络最短路径近似算法

复杂网络最短路径经典算法的处理效率较低，不适用于大规模复杂网络，而现有近似算法通用性有限，且计算准确率不理想，不能满足规模日益扩大的复杂网络中的最短路径计算需求。针对于此，提出基于[k]-shell的复杂网络最短路径近似算法。算法利用节点的[k]-shell值进行网络划分并引导搜索路径，利用超点聚合处理[k]-shell子网来降低路径搜索中节点和连边的规模，通过在路径搜索过程使用双向搜索树方法提高算法的计算效率和准确率。实验结果表明，算法通用性较好，在现实与仿真大规模复杂网络中均具有较高的计算效率和准确率。     

基于种群划分与变异策略的粒子群优化算法

粒子群算法因其形式比较简洁，参数设置灵活，操作简便易行，并且能够快速收敛，从而引起广泛关注。但是传统的粒子群算法也有缺陷：收敛速度慢以及容易陷入局部最优等。针对这些问题，本文借鉴小生境的方法，在进化初始阶段，对种群进行划分，将初始种群分为子种群，对不同的子种群进行不同的变异策略；在进化过程中，针对不同的子种群，设置不同的惯性权重因子ω，用来增强全局搜索能力与局部搜索能力。实验结果表明，本文提出的算法较传统的粒子群算法具有较快的收敛性以及找寻的全局最优解更接近真实解集，收敛精度比较高。     

Evolution of Local Structural Ordering and Chemical Distribution upon Delithiation of a Rock Salt–Structured Li1.3Ta0.3Mn0.4O2 Cathode

Lithium‐rich disordered rock‐salt oxides have attracted great interest owing to their promising performance as Li‐ion battery cathodes. While experimental and theoretical efforts are critical in advancing this class of materials, a fundamental understanding of key property changes upon Li extraction is largely missing. In the present study, single‐crystal synthesis of a new disordered rock‐salt cathode material, Li_1.3Ta_0.3Mn_0.4O₂ (LTMO), and its use as a model compound to investigate Li concentration–driven evolution of local cationic ordering, charge compensation, and chemical distribution are reported. Through the combined use of 2D and 3D X‐ray nanotomography, it is shown that Li removal accompanied by oxygen oxidation is correlated with the development of morphological defects such as particle cracking. Chemical heterogeneity, quantified by subparticle level distribution of Mn valence state, is minimal during Mn redox, which drastically increases upon the formation of cracks during oxygen redox. Density functional theory and bond valence sum mismatch calculations reveal the presence of local short‐range ordering in the pristine oxide, which gradually disappears along with the extraction of Li. The study suggests that with cycling the transformation into true cation–disordered state can be expected, which likely impacts the voltage profile and obtainable energy density of the oxide cathodes.     

An improved cuckoo search algorithm for the problem of electric distribution network reconfiguration

Power loss reduction has an important role in operating electric distribution network system. There are a lot of methods for reduction power loss such as capacitor placement, distributed generation placement and electric distribution network reconfiguration (EDNR). Among these methods, the EDNR is an efficient technique to reduce power loss due to without taking any costs. However, the EDNR problem is a nonlinear, discrete problem and lots of extreme points. Therefore, it is necessary to have efficient methods for solving the EDNR problem. In this paper, an improved cuckoo search algorithm (ICSA) is proposed for solving the EDNR problem. In which, based on disadvantages of exploration and exploitation process of cuckoo search algorithm (CSA) for solving the EDNR problem, a local search mechanism is added to exploit candidate solutions existing around the current best solution. The calculated results on the simple distribution networks to complex distribution networks show that ICSA has ability for finding the global optimal solution with much smaller iterations and better quality of obtained solution compared with CSA and some other improved versions of CSA. The performance comparisons with other existing methods available in previous studies and the software of Power System Simulator/Advanced Distribution Engineering Productivity Tool (PSS/ADEPT) also lead to the better electric distribution network configuration with smaller total power losses. As a result, ICSA is a potential and reliable method for solving the EDNR problems.     

基于平面不封闭图形切割的路径规划

在平面切割环节中，如何确定更短切割路径以减少加工成本、降低设备损耗和提升切割质量是工业应用和学术研究的重点。目前国内外对平面切割路径的研究主要集中于封闭图形，为此，针对在激光刀模行业中不封闭图形的问题，提出一种基于禁忌搜索的贪婪算法和贪婪准则的局部优化。首先使用构建型的贪婪算法和改进型的禁忌搜索算法相结合的方式对加工过程中的图元路径进行优化排序，随后提出贪婪准则的局部优化系数，削弱贪婪算法的“贪心”思想，解决加工路径的规划和优化问题。实验数据表明，禁忌搜索的贪婪算法和局部优化在对切割路径的规划和空行程优化上有显著效果，空行程减少50%以上，并且其优化性能和图元数量成正比，能有效地解决刀模行业以及其他激光雕刻行业中图形不封闭的切割难题。