Collaborative Distribution Alignment for 2D image-based 3D shape retrieval

Retrieving 3D shapes with 2D images has become a popular research area nowadays, and a great deal of work has been devoted to reducing the discrepancy between 3D shapes and 2D images to improve retrieval performance. However, most approaches ignore the semantic information and decision boundaries of the two domains, and cannot achieve both domain alignment and category alignment in one module. In this paper, a novel Collaborative Distribution Alignment (CDA) model is developed to address the above existing challenges. Specifically, we first adopt a dual-stream CNN, following a similarity guided constraint module, to generate discriminative embeddings for input 2D images and 3D shapes (described as multiple views). Subsequently, we explicitly introduce a joint domain-class alignment module to dynamically learn a class-discriminative and domain-agnostic feature space, which can narrow the distance between 2D image and 3D shape instances of the same underlying category, while pushing apart the instances from different categories. Furthermore, we apply a decision boundary refinement module to avoid generating class-ambiguity embeddings by dynamically adjusting inconsistencies between two discriminators. Extensive experiments and evaluations on two challenging benchmarks, MI3DOR and MI3DOR-2, demonstrate the superiority of the proposed CDA method for 2D image-based 3D shape retrieval task.     

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.     

Relevance- and interface-driven clustering for visual information retrieval

Search results of spatio-temporal data are often displayed on a map, but when the number of matching search results is large, it can be time-consuming to individually examine all results, even when using methods such as filtered search to narrow the content focus. This suggests the need to aggregate results via a clustering method. However, standard unsupervised clustering algorithms like $K$-means (i) ignore relevance scores that can help with the extraction of highly relevant clusters, and (ii) do not necessarily optimize search results for purposes of visual presentation. In this article, we address both deficiencies by framing the clustering problem for search-driven user interfaces in a novel optimization framework that (i) aims to maximize the relevance of aggregated content according to cluster-based extensions of standard information retrieval metrics and (ii) defines clusters via constraints that naturally reflect interface-driven desiderata of spatial, temporal, and keyword coherence that do not require complex ad-hoc distance metric specifications as in $K$-means. After comparatively benchmarking algorithmic variants of our proposed approach – RadiCAL – in offline experiments, we undertake a user study with 24 subjects to evaluate whether RadiCAL improves human performance on visual search tasks in comparison to $K$-means clustering and a filtered search baseline. Our results show that (a) our binary partitioning search (BPS) variant of RadiCAL is fast, near-optimal, and extracts higher-relevance clusters than $K$-means, and (b) clusters optimized via RadiCAL result in faster search task completion with higher accuracy while requiring a minimum workload leading to high effectiveness, efficiency, and user satisfaction among alternatives.     

基于并行多通道卷积长短时记忆网络的轴承寿命预测方法

在预测轴承剩余使用寿命时，数据间的时序特性是一个可以利用的重要隐藏信息。为了更好地提取具有时序信息的特征用于预测，提出了一种基于并行多通道卷积长短时记忆网络（PMCCNN-LSTM）的剩余使用寿命预测模型。该模型主要由两部分组成：前端为并行多通道卷积网络（PMCCNN），提取信号特征，挖掘数据的时序特性，并采用逐层训练和微调的方式提升参数的收敛性；后端为长短时记忆（LSTM）网络，基于特征进行剩余使用寿命预测，并采用加权平均的方法对预测结果进行平滑处理。在一个轴承加速寿命实验的公开数据集上使用留一法验证了该模型的准确性，实验结果表明：所提模型的平均误差与最大误差分别比传统的卷积神经网络（CNN）低23.38%和15.84%，比传统的LSTM低24.14%和19.01%，比卷积长短时记忆网络（CNN-LSTM）低30.32%和23.09%。     

地面微地震有源噪声自动识别与匹配压制方法

微地震监测技术通过对非常规储层压裂改造引发的震源点进行成像，实时提供压裂施工过程中产生的裂隙高度、长度、宽度和方位角等信息，为致密储层压裂提供指导，以提高油气采收率。在地面布设站点进行监测时，因微地震信号传播距离较远、近地表吸收衰减严重、地面有源噪声较多，微地震数据具有信号能量弱、噪声干扰强和信噪比低等特点，严重制约微地震事件的定位精度。噪声源多分布于地表，根据有源噪声与由储层向上传播的微地震事件在能量、频率、传播速度和源位置等方面的差异，本文提出微地震有源噪声自动识别与匹配方法。综合长短时窗能量比与微地震量板方法，自动识别有源噪声干扰，并进行噪声源位置和传播速度的三维最优并行搜索；利用同时确定的最优噪声源位置和传播速度对微地震数据进行动校正处理，得到噪声标准道，通过能量自适应匹配处理压制有源噪声。正演模拟数据和实际微地震数据去噪效果证明，本文方法能有效压制有源噪声，显著提高微地震数据品质，为后续微地震事件精确定位奠定了基础。     

Parallel Multipopulation Differential Evolutionary Particle Swarm Optimization for Voltage and Reactive Power Control

This paper presents parallel multipopulation differential evolutionary particle swarm optimization (DEEPSO) for voltage and reactive power control (VQC). The problem can be formulated as a mixed integer nonlinear optimization problem and various evolutionary computation techniques have been applied to the problem including PSO, differential evolution (DE), and DEEPSO. Since VQC is one of the online controls, speed‐up of computation is required. Moreover, there is still room for improvement in solution quality. This paper applies parallel multipopulation DEEPSO in order to speed up the calculation and improve solution quality. The proposed method is applied to IEEE 30, 57, and 118 bus systems. The results indicate that the proposed method can realize fast computation and minimize more active power losses than the conventional evolutionary computation techniques.     

鑫达黄金矿业急倾斜薄矿体中深孔采矿方法的研究与优化

近年来，随着开采技术的发展，急倾斜薄矿脉采用中深孔采矿越来越多。为了降低生产成本，提高经济效益和安全系数。通过在矿房对扇形中深孔和平行中深孔进行现场试验，得到扇形中深孔比平行中深孔工程量少、千吨采切比小的结论。将扇形中深孔采矿方法在急倾斜薄矿脉中进行推广应用，取得了一定经济效益。     

A finite line source simulation model for geothermal systems with series- and parallel-connected boreholes and independent fluid loops

A model for the simulation of geothermal systems with parallel- and series-connected boreholes is presented. Mass and heat balance problems are formulated for each component in the system and are assembled into system-level problems. A third problem is formulated to account for heat transfer in the bore field, using the finite line source solution. This third problem is coupled to the system-level heat balance problem by an analytical solution of the heat transfer inside boreholes with multiple U-tubes. The simulation model allows for any number of independent fluid loops within the bore field or within individual boreholes and allows for combinations of specified inlet fluid temperatures and heat extraction rates in independent fluid loops. The model accounts for the axial variation of the fluid and borehole wall temperatures and heat extraction rates. The capabilities of the model are demonstrated through three example simulations.     

基于局部特征的模具数控加工推荐系统

为了实现对已有数控工艺设计成果的有效重用，提出了一种基于局部特征匹配的数控工艺推荐系统模型，该模型利用局部特征级的三维极半径矩结合几何尺寸等其他几何语义信息建立加工几何特征，并对典型局部特征对应的数控工艺信息进行有效组织与表达，构建数控工艺案例库。设计了一种基于综合加权的加工几何特征的相似性度量方法，以此实现局部特征的检索与加工特征的准确匹配，并根据匹配程度定义数控工艺实例复用方法，结合用户加工需求，最终产生合适的数控工艺推荐方案。