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

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

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.     

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.     

基于卷积神经网络的单目深度估计

针对利用深度学习方法对街道图像进行深度估计，提出采用语义分割的方法解决深度图出现边界模糊等问题；估计深度通过左右视角图生成视差图进行无监督的训练。在网络模型中添加语义分割层，采取多个空洞卷积并行的结构增加感受野，同时减少了图像下采样的次数，降低了由于下采样带来的信息损失，使得的结果更加准确。这也是在深度估计中首次与空洞卷积相结合增加准确率。通过对KITTI街道数据集进行训练，与现有结果相比，除了增加检测准确性，降低错误率之外，使得效果图中的物体更加清晰，并且在效果图中还保留了一些原模型中被忽视掉的细节信息，将原始图像更加完整的表现出来。     

面向连续查询的敏感语义位置隐私保护方案

针对连续查询位置服务中构造匿名区域未考虑语义位置信息导致敏感隐私泄露问题，通过设计[(K,θ)]-隐私模型，提出一种路网环境下面向连续查询的敏感语义位置隐私保护方案。该方案利用Voronoi图将城市路网预先划分为独立的Voronoi单元，依据用户的移动路径和移动速度，选择具有相似特性的其他[K-1]个用户，构建匿名用户集；利用匿名用户集用户设定的敏感语义位置类型和语义安全阈值，以及用户所处语义位置的Voronoi单元，构建满足[(K,θ)]-隐私模型的语义安全匿名区域，可以同时防止连续查询追踪攻击和语义推断攻击。实验结果表明，与SCPA算法相比，该方案在隐私保护程度上提升约15%，系统开销上降低约20%。     

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

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

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

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