A novel function-structure concept network construction and analysis method for a smart product design system

The rapid growth of data and the requirement of designers to track massive data to obtain design stimuli have posed challenges to conceptual design, thereby promoting the development of data-driven design. Concept networks precisely capture design information from a large volume of unstructured and heterogeneous textual data and saliently decrease time and labor cost for designers to read texts, which creates new opportunities for developing a smart product design system. To advance data-driven design, this study proposes the novel function-structure concept network (FSCN) construction method, which combines sentence parsing and word/phrase extraction to integrate functional and structural information. Furthermore, a network analysis method is proposed to explore design information associations that contain both explicit and implicit associations together and thereby recommend them simultaneously to designers as inspirational stimuli to support design ideation. This approach can enhance designers' capabilities to build associations between design information, conceive new design ideas during conceptual design, and increase creativity for solving design problems. The proposed FSCN construction and analysis method can be used as an auxiliary tool to visualize associations among design information so as to inspire idea generation in the early stage of conceptual design. An illustrative example was used to validate the practicability of the proposed methodology. The code of the proposed method is available at https://github.com/KWflyer/FSCN.     

DEM: Deep Entity Matching Across Heterogeneous Information Networks

Heterogeneous information networks, which consist of multi-typed vertices representing objects and multi-typed edges representing relations between objects, are ubiquitous in the real world. In this paper, we study the problem of entity matching for heterogeneous information networks based on distributed network embedding and multi-layer perceptron with a highway network, and we propose a new method named DEM short for Deep Entity Matching. In contrast to the traditional entity matching methods, DEM utilizes the multi-layer perceptron with a highway network to explore the hidden relations to improve the performance of matching. Importantly, we incorporate DEM with the network embedding methodology, enabling highly efficient computing in a vectorized manner. DEM’s generic modeling of both the network structure and the entity attributes enables it to model various heterogeneous information networks flexibly. To illustrate its functionality, we apply the DEM algorithm to two real-world entity matching applications: user linkage under the social network analysis scenario that predicts the same or matched users in different social platforms and record linkage that predicts the same or matched records in different citation networks. Extensive experiments on real-world datasets demonstrate DEM’s effectiveness and rationality.

     

Embedding new observations via sparse-coding for non-linear manifold learning

Non-linear dimensionality reduction techniques are affected by two critical aspects: (i) the design of the adjacency graphs, and (ii) the embedding of new test data—the out-of-sample problem. For the first aspect, the proposed solutions, in general, were heuristically driven. For the second aspect, the difficulty resides in finding an accurate mapping that transfers unseen data samples into an existing manifold. Past works addressing these two aspects were heavily parametric in the sense that the optimal performance is only achieved for a suitable parameter choice that should be known in advance.     

An Information Hiding Algorithm Based on Bitmap Resource of Portable Executable File

An information hiding algorithm is proposed, which hides information by embedding secret data into the palette of bitmap resources of portable executable （PE） files. This algorithm has higher security than some traditional ones because of integrating secret data and bitmap resources together. Through analyzing the principle of bitmap resources parsing in an operating system and the layer of resource data in PE files, a safe and useful solution is presented to solve two problems that bitmap resources are incorrectly analyzed and other resources data are confused in the process of data embedding. The feasibility and effectiveness of the proposed algorithm are confirmed through computer experiments.     

基于链路优先的快速协同虚拟网络映射算法

在网络虚拟化环境中,为了减少链路映射成本和提高收益,提出了一种链路优先的协同映射算法。该算法交替映射链路和节点,并使用贪心思想优先将带宽资源需求较大的虚拟链路映射到跳数较少的物理路径上,最终达到降低虚拟网络平均消耗和提高虚拟网络接受率的目的。仿真结果表明,与已有算法相比,所提算法节约了链路映射的成本,提高了虚拟网络接受率和物理网络收益,算法运行时间也有效缩短。     

电缆隧道施工地压问题

在某电缆隧道施工过程中，当竖井通过软弱夹层时，竖井井筒受到地压作用而发生破坏，影响施工进度。为解决这一问题，对此竖井地压问题进行力学分析，通过隧道地压与竖井地压的力学分析计算，得出了软弱夹层的极限埋藏条件与井筒的侧向压力。     

基于LLE和BP神经网络的人脸识别

利用LLE非线性降维方法提取人脸特征,然后将提取出来的特征输入到BP神经网络进行训练得到人脸类间的判别信息,进行人脸识别。利用LLE降维方法既能够降低数据维数,减少运算量,又很好的保留了各类人脸样本的拓扑结构,避免人脸图像光照、姿态等因素对人脸识别的影响。在ORL人脸库上的实验结果表明了,这种方法是有效的。     

Filling the gap between Continuous and Discrete Time Dynamics of Autoregressive Processes

Discretization of continuous time autoregressive (AR) processes driven by a Brownian motion and embedding of discrete time AR sequences driven by a Gaussian white noise are classical issues. The article aims at establishing and using such discretization and embedding formulae between extended AR continuous time processes and discrete time sequences. The continuous-time processes are driven by either Brownian or jump processes, and may have random coefficients depending on time; Lévy-driven processes are also considered. The innovation of the discrete time processes may be of many types – including Gaussian. In one way, observing the continuous time AR process at discrete times leads the AR dynamics of the discretized process to be characterized. The other way round, AR sequences can be embedded, in the almost sure sense, into continuous time AR processes with the same dynamics. Illustration is provided through many examples and simulation.     

基于BERT的短文本相似度判别模型

短文本的表示方法和特征提取方法是自然语言处理基础研究的一个重要方向,具有广泛的应用价值.本文提出了BERT_BLSTM_TCNN模型,该神经网络模型利用BERT的迁移学习,并在词向量编码阶段引入对抗训练方法,训练出包括句的语义和结构特征的且泛化性能更优的句特征,并将这些特征输入BLSTM_TCNN层中进行特征抽取以完成...     

面向人工智能深度学习的知识图谱补全技术与应用综述

知识图谱旨在为各种领域提供更加全面可靠的服务,在实际应用中的价值不可估量,为了使其不断更新和趋于完整,知识图谱补全技术开始被提出;近几年,随着人工智能和深度学习的兴起,许多国内外学者对知识图谱补全方向进行深入研究,出现了很多面向人工智能深度学习的知识图谱补全模型,但相关的文献综述却并不多;为了提供一个全面了解该领域的框架,有助于读者能够掌握当前的研究进展和应用情况,并为未来的研究和应用提供一些参考;通过介绍其概念和典型的知识图谱,从深度学习的知识补全技术的三个角度展开,分析和归纳了目前基于深度学习的知识图谱补全模型,探讨了不同模型的优缺点及改进模型;同时,讨论了现阶段知识图谱补全任务所存在的问题和挑战,并探索了该领域的应用方向和发展前景;综上所述,深度学习在知识图谱补全中具有巨大的发掘价值,亟待学者们进行更深入的研究和进一步地创新。