Off‐grid DoA estimation method of wideband signals

In this paper, an off‐grid direction of arrival (DoA) estimation method is proposed for wideband signals. This method is based on the sparse representation (SR) of the array covariance matrix. Similar to the time domain DoA estimation methods, the correlation function of the sources was assumed to be the same and known. A new measurement vector is obtained using the lower‐left triangular elements of the covariance matrix. The DoAs are estimated by quantizing the entire range of continuous angle space into discrete grid points. However, the exact DoAs may be located between two grid points; therefore, this estimation has errors. The accuracy of DoA estimation is improved by the minimization of the difference between the new measurement vector and its estimated values. Simulation results revealed that the proposed method can enhance the DoA estimation accuracy of wideband signals.     

Knowledge-Based Virtual Modeling and Simulation of Manufacturing Processes for Industry 4.0

Abstract

Industry 4.0 aims at providing a digital representation of a production landscape, but the challenges in building, maintaining, optimizing, and evolving digital models in inter-organizational production chains have not been identified yet in a systematic manner. In this paper, various Industry 4.0 research and technical challenges are addressed, and their present scenario is discussed. Moreover, in this article, the novel concept of developing experience-based virtual models of engineering entities, process, and the factory is presented. These models of production units, processes, and procedures are accomplished by virtual engineering object (VEO), virtual engineering process (VEP), and virtual engineering factory (VEF), using the knowledge representation technique of Decisional DNA. This blend of the virtual and physical domains permits monitoring of systems and analysis of data to foresee problems before they occur, develop new opportunities, prevent downtime, and even plan for the future by using simulations. Furthermore, the proposed virtual model concept not only has the capability of Query Processing and Data Integration for Industrial Data but also real-time visualization of data stream processing.     

A conceptualization of intended learning outcomes supporting self‐regulated learners in indicating learning paths

Intended learning outcomes (ILOs) indicate what learners will be able to achieve after they are taught. Traditionally, ILOs are expressed as plain text or unstructured documents. What if all ILOs of a specific course of study can be conceptualized through a structured diagrammatic technique? It was hypothesized that learners can benefit from this conceptualization in learning, especially in self‐regulated learning. The aim of this study was to investigate whether the ILOs represented in unstructured or structured formats can facilitate learners to identify learning paths. The results revealed that the mean ratings of all learning paths were statistically significantly higher with structured ILOs.     

基于查询的新闻多文档自动摘要技术研究

针对新闻文本领域,该文提出一种基于查询的自动文本摘要技术,更加有针对性地满足用户信息需求。根据句子的TF-IDF、与查询句的相似度等要素,计算句子权重,并根据句子指示的时间给定不同的时序权重系数,使得最近发生的新闻内容具有更高的权重,最后使用最大边界相关的方法选择摘要句。通过与基于TF-IDF、Text-Rank、LDA等六种方法的对比,该摘要方法ROUGE评测指标上优于其他方法。从结合评测结果及摘要示例可以看出,该文提出的方法可以有效地从新闻文档集中摘取核心信息,满足用户查询内容的信息需求。     

LPNN-based approach for LASSO problem via a sequence of regularized minimizations

In compressive sampling theory, the least absolute shrinkage and selection operator (LASSO) is a representative problem. Nevertheless, the non-differentiable constraint impedes the use of Lagrange programming neural networks (LPNNs). We present in this article the -LPNN model, a novel algorithm that tackles the LASSO minimization together with the underlying theory support. First, we design a sequence of smooth constrained optimization problems, by introducing a convenient differentiable approximation to the non-differentiable -norm constraint. Next, we prove that the optimal solutions of the regularized intermediate problems converge to the optimal sparse signal for the LASSO. Then, for every regularized problem from the sequence, the -LPNN dynamic model is derived, and the asymptotic stability of its equilibrium state is established as well. Finally, numerical simulations are carried out to compare the performance of the proposed -LPNN algorithm with both the LASSO-LPNN model and a standard digital method.     

实体造型中的几何约束

实体造型是一个基于约束的过程，完成从功能约束到几何约束、再到代数约束的转化而得到实体模型。本文讨论了几何约束的层次性及其表示，并且对几何约束同设计意图的关系进行了研究，提出了基于ＣＳＧ／ＧＣＧ／Ｂ－ｒｅｐ的模型表示。     

Nonreactive atom/molecule-surface scattering within the finite basis wave packet method

A quantum wave packet code for studying nonreactive scattering of closed-shell atoms or diatomic molecules from a rigid surface is described. The time evolution relies on the Chebychev propagator. Up to 5 collider degrees of freedom, 3 in translation and 2 in rotation, are treated in a pseudospectral way with the momentum or finite basis representation as the primary space. Potential matrix elements are efficiently evaluated by means of sequential 1D transformations between momentum and coordinate spaces. Fast Fourier transforms are performed for the translational and azimuthal coordinates whereas a Gauss-Legendre transform is used for the polar coordinate. This pseudospectral strategy minimizes memory requirements because no off-diagonal Hamiltonian matrix elements need to be stored. In addition, a wide variety of physical systems can be studied since no particular functional form is imposed for the interaction potential.     

A stochastic realization algorithm via block LQ decomposition in Hilbert space

A stochastic realization problem of a stationary stochastic process is re-visited, and a new stochastically balanced realization algorithm is derived in a Hilbert space generated by second-order stationary processes. The present algorithm computes a stochastically balanced realization by means of the singular value decomposition of a weighted block Hankel matrix derived by a “block LQ decomposition”. Extension to a stochastic subspace identification method explains how the proposed abstract algorithm is implemented in system identification.