Learn decision trees with deep visual primitives

In this paper, we strive to propose a self-interpretable framework, termed PrimitiveTree, that incorporates deep visual primitives condensed from deep features with a conventional decision tree, bridging the gap between deep features extracted from deep neural networks (DNNs) and trees’ transparent decision-making processes. Specifically, we utilize a codebook, which embeds the continuous deep features into a finite discrete space (deep visual primitives) to distill the most common semantic information. The decision tree adopts the spatial location information and the mapped primitives to present the decision-making process of the deep features in a tree hierarchy. Moreover, the trained interpretable PrimitiveTree can inversely explain the constituents of the deep features, highlighting the most critical and semantic-rich image patches attributing to the final predictions of the given DNN. Extensive experiments and visualization results validate the effectiveness and interpretability of our method.     

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.     

The Photomontage Activity of Postmodernism

For decades now, Douglas Crimp’s landmark 1980 essay ‘The Photographic Activity of Postmodernism’ has shaped our understanding of modernism’s aftermath, at least as it unfolded in North America and Western Europe. Less remembered, however, is the degree to which the procedures of disjunction, copying, appropriation, and outright theft that he highlighted were epitomised not just by contemporary photography, but by photomontage in particular. This article recovers the debates that led critics such as Crimp, Abigail Solomon-Godeau, Christopher Phillips, Benjamin Buchloh and others to turn to photomontage as one of their principal objects of concern in what became known as the postmodern critique of photography. Why was montage tasked to perform this critical function, particularly by people around the journal October who had not otherwise devoted the balance of their writing to photography’s history? The article suggests that these men and women, along with the contemporary artists they foregrounded, manifested what Mary Anne Doane has called a ‘desire for signification’, a reaction in the late 1970s against the mute theatricality of minimalist and conceptual art. Photomontage reintroduced representation to contemporary art and to the canon of art history. But unlike the reemerging illusionism in painting that also manifested this desire, montage guarded against an uncomplicated realism by highlighting and critiquing operations of representation in a manner that painting no longer could.     

基于分段加权的反向稀疏跟踪算法研究

为提高稀疏表示跟踪模型性能，提出一种分段加权的反向稀疏跟踪算法，将跟踪问题转化为在贝叶斯框架下寻找概率最高的候选对象问题，构造不同的分段权重函数来分别度量候选目标与正负模板的判别特征系数。通过池化来降低跟踪结果的不确定性干扰，选择正负模板加权系数差值最大的候选表示作为跟踪结果。实验表明，在光照变化、遮挡、快速运动、运动模糊情况下，所提出的算法可以确保跟踪结果的准确性和鲁棒性。     

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

针对新闻文本领域,该文提出一种基于查询的自动文本摘要技术,更加有针对性地满足用户信息需求。根据句子的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.