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

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

Mutual information maximizing GAN inversion for real face with identity preservation

Recent generative adversarial networks (GANs) have yielded remarkable performance in face image synthesis. GAN inversion embeds an image into the latent space of a pretrained generator, enabling it to be used for real face manipulation. However, current inversion approaches for real faces suffer the dilemma of initialization collapse and identity loss. In this paper, we propose a hierarchical GAN inversion for real faces with identity preservation based on mutual information maximization. We first use a facial domain guaranteed initialization to avoid the initialization collapse. Furthermore, we prove that maximizing the mutual information between inverted faces and their identities is equivalent to minimizing the distance between identity features from inverted and original faces. Optimization for real face inversion with identity preservation is implemented on this mutual information-maximizing constraint. Extensive experimental results show that our approach outperforms state-of-the-art solutions for inverting and editing real faces, particularly in terms of face identity preservation.     

控制爆破法处理卡钻事故

介绍了在包头市某工程实施管道穿越黄河施工中,采用爆破法处理卡钻的经验。针对深水环境条件及钻杆内径小不宜采用集团装药的条件,确定采用"小直径爆破筒,钻杆内部装药"的爆破方案,阐述了爆破设计及施工注意事项。可供类似工程参考。     

IRS辅助的SWIPT系统中基于能效优先的波束成形设计与优化

以智能反射面(intelligent reflecting surface,IRS)辅助的无线携能通信(simultaneous wireless information and power transfer,SWIPT)系统为背景,研究了该系统中基于能效优先的多天线发送端有源波束成形与IRS无源波束成形联合设计与优化方法。以最大化接收端的最小能效为优化目标,构造在发送端功率、接收端能量阈值、IRS相移等多约束下的非线性优化问题,用交替方向乘子法(alternating direction method of multipliers,ADMM)求解。采用Dinkelbach算法转化目标函数,通过奇异值分解(singular value decomposition,SVD)和半定松弛(semi-definite relaxation,SDR)得到发送端有源波束成形向量。采用SDR得到IRS相移矩阵与反射波束成形向量。结果表明,该系统显著降低了系统能量收集(energy harvesting,EH)接收端的能量阈值。当系统总电路功耗为?15 dBm时,所提方案的用户能效为300 KB/J。当IRS反射阵源数与发送天线数均为最大值时,系统可达最大能效。     

Locating wind farm for power and hydrogen production based on Geographic information system and multi-criteria decision making method: An application

Hydrogen generation from renewable energy resources is considered as a suitable solution to solve the problems related to the energy sector and the reduction of greenhouse gases. The aim of this study is to provide an integrated framework for identifying suitable areas for the construction of wind farms to produce hydrogen. For this purpose, a combined method of Geographic Information System (GIS) and multi-criteria decision making (MCDM) has been used to locate the power plant in Yazd province. The GIS method in the present study consisted of two parts: constraints and criteria. The constraint section included areas that were unsuitable for the construction of wind farms to produce power and hydrogen. In the present study, various aspects such as physical, economic and environmental had been considered as constraints. In the criteria section, eight different criteria from technical aspects (including average wind speed, hydrogen production potential, land slope) and economic aspects (including distance to electricity grid, distance to urban areas, distance to road, distance to railway and distance to centers of High hydrogen consumption) had been investigated. The MCDM tool had been used to weigh the criteria and identify suitable areas. Analytic Hierarchy Process (AHP) technique was used for weighting the criteria. The results of AHP weighting method showed that economic criteria had the highest importance with a value of 0.681. The most significant sub-criterion was the distance to urban areas and the least significant sub-criterion was the distance to power transmission lines. The results of GIS-MCDM analysis had shown that the most proper areas were in the southern and central sectors of Yazd province. In addition, the feasibility of hydrogen production from wind energy had shown that this province had the capacity to generate hydrogen at the rate of 53.6–128.6 tons per year.     

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.     

A Tradeoff Between Accuracy and Speed for K-Means Seed Determination

With a sharp increase in the information volume, analyzing and retrieving this vast data volume is much more essential than ever. One of the main techniques that would be beneficial in this regard is called the Clustering method. Clustering aims to classify objects so that all objects within a cluster have similar features while other objects in different clusters are as distinct as possible. One of the most widely used clustering algorithms with the well and approved performance in different applications is the k-means algorithm. The main problem of the k-means algorithm is its performance which can be directly affected by the selection in the primary clusters. Lack of attention to this crucial issue has consequences such as creating empty clusters and decreasing the convergence time. Besides, the selection of appropriate initial seeds can reduce the cluster’s inconsistency. In this paper, we present a new method to determine the initial seeds of the k-mean algorithm to improve the accuracy and decrease the number of iterations of the algorithm. For this purpose, a new method is proposed considering the average distance between objects to determine the initial seeds. Our method attempts to provide a proper tradeoff between the accuracy and speed of the clustering algorithm. The experimental results showed that our proposed approach outperforms the Chithra with 1.7% and 2.1% in terms of clustering accuracy for Wine and Abalone detection data, respectively. Furthermore, achieved results indicate that comparing with the Reverse Nearest Neighbor (RNN) search approach, the proposed method has a higher convergence speed.     

基于条件信息卷积生成对抗网络的图像识别

传统的图像识别方法需要大量有标签样本进行训练，且模型训练难以达到稳定。针对这些问题，结合条件生成网络和信息最大化生成网络的结构优势建立了条件信息卷积生成网络（C-Info-DCGAN）。模型增加图像的类别信息和潜在信息作为输入数据，然后利用Q网络去更好地发挥类别信息和潜在信息对训练的引导作用，并且利用深度卷积网络来加强对图像特征的提取能力。实验结果表明，该方法能够加快模型训练收敛速度，并有效提高图像识别的准确率。     

结合边缘特征先验引导的深度卷积显著性检测

针对当前基于深度学习的显著性检测算法缺少利用先验特征和边缘信息，且在复杂场景中难以检测出鲁棒性强的显著性区域的问题，提出了一种结合边缘特征，利用先验信息引导的全卷积神经网络显著性检测算法。该算法利用三种被经常用到的先验知识结合边缘信息形成先验图，通过注意力机制将提取的先验特征与深度特征有效融合，最终通过提出的循环卷积反馈优化策略迭代地学习改进显著性区域，从而产生更可靠的最终显著图预测。经过实验定性定量分析，对比证明了算法的可靠性。     

基于CDIO工程教育的应用型人才培养 理论与实践研究 — —以红外多路遥控系统设计为例

The construction of specialty groups in higher vocational colleges is in full swing. However, due to the cognitive bias and the lack of construction paradigm for reference, the construction of specialty groups is still in the period of "crossing the river by feeling the stones" with different opinions. There are some problems in the construction of specialty groups, such as unclear under- standing of the concept of specialty groups, unreasonable logic of groups, unclear construction of groups, and nonstandard manage- ment of groups. This paper describes the specific content of the construction of modern information technology specialty group based on the Sydney Agreement, hoping to form a reference paradigm for the construction of specialty group of similar colleges and universities.