SRS: Spatial-tagged radio-mapping system combining LiDAR and mobile-phone data for indoor location-based services

One of the most challenging issues in radio received signal strength (RSS)-based localization systems is the generation and distribution of a radio map with a coordinate system linked with spatial information in a large indoor space. This study proposes a novel spatial-tagged radio-mapping system (SRS) that effectively combines the heterogeneous properties of LiDAR and mobile phones to simultaneously perform both spatial and radio mappings. The SRS consists of synchronization, localization, and map building processes, and enables real-time spatial and radio mapping. In the synchronization process, the distance range, motion data, and radio signals obtained through the LiDAR and mobile phone are collected in nodal units according to the sensing time. In the localization process, a feature variance filter is used to control the number of features generated from LiDAR and estimate the positions at which the nodes are generated in real time according to the motion data and radio signals. In map building, the estimated positions of the nodes are used to extract spatial and radio maps by using a unified location coordinate system. To ensure mobility, the SRS is manufactured in the form of a backpack supporting LiDAR and a mobile phone; the usefulness of the system is experimentally verified. The experiments are performed in a large indoor shopping mall with a complex structure. The experimental results demonstrated that a common coordinate system could be used to build spatial and radio maps with high accuracy and efficiency in real time. In addition, the field applicability of the SRS to location-based services is experimentally verified by applying the constructed radio map to well-known fingerprinting algorithms using the heterogeneous mobile phones.     

Distributed ledger technology in supply chains: a transaction cost perspective

With the emergence of distributed ledger technology (DLT), numerous practitioners and researchers have proclaimed its beneficial impact on supply chain transactions in the future. However, the vast majority of DLT initiatives are discontinued after a short period. With the full potential of DLT laying far down the road, especially managers in supply chain management (SCM) seek for short-term cost-saving effects of DLT in order to achieve long-term benefits of DLT in the future. However, the extant research has bypassed grounding long-term as well as short-term effects of DLT on supply chain transaction with empirical data. We address this shortcoming, following an abductive research approach and combining empirical data from a multiple case study design with the corresponding literature. Our study reveals that the effects of DLT on supply chain transactions are two-sided. We found six effects of DLT solutions that have a cost-reducing or cost avoidance impact on supply chain transactions. In addition, we found two effects that change the power distribution between buyers and suppliers in transactions and a single effect that reduces the dependency of supply chain transactions on third parties. While cost-reducing and avoidance as well as dependency-reducing effects are positive effects, the change in power distribution might come with disadvantages. With these findings, the paper provides the first empirical evidence of the impact of DLT on supply chain transactions, which will enable managers to improve their assessment of DLT usage in supply chains.     

Control theory for stochastic distributed parameter systems,an engineering perspective

The main purpose of this paper is to survey some recent progresses on control theory for stochastic distributed parameter systems, i.e., systems governed by stochastic differential equations in infinite dimensions, typically by stochastic partial differential equations. We will explain the new phenomenon and difficulties in the study of controllability and optimal control problems for one dimensional stochastic parabolic equations and stochastic hyperbolic equations. In particular, we shall see that both the formulation of corresponding stochastic control problems and the tools to solve them may differ considerably from their deterministic/finite-dimensional counterparts. More importantly, one has to develop new tools, say, the stochastic transposition method introduced in our previous works, to solve some problems in this field.     

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

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

Weak Delocalization in Graphene on a Ferromagnetic Insulating Film

Graphene has been predicted to develop a magnetic moment by proximity effect when placed on a ferromagnetic film, a promise that could open exciting possibilities in the fields of spintronics and magnetic data recording. In this work, the interplay between the magnetoresistance of graphene and the magnetization of an underlying ferromagnetic insulating film is studied in detail. A clear correlation between both magnitudes is observed but through a careful modeling of the magnetization and the weak localization measurements, that such correspondence can be explained by the effects of the magnetic stray fields arising from the ferromagnetic insulator is found. The results emphasize the complexity arising at the interface between magnetic and 2D materials.     

Delay compensated control of the Stefan problem and robustness to delay mismatch

This paper presents a control design for the one‐phase Stefan problem under actuator delay via a backstepping method. The Stefan problem represents a liquid‐solid phase change phenomenon which describes the time evolution of a material's temperature profile and the interface position. The actuator delay is modeled by a first‐order hyperbolic partial differential equation (PDE), resulting in a cascaded transport‐diffusion PDE system defined on a time‐varying spatial domain described by an ordinary differential equation (ODE). Two nonlinear backstepping transformations are utilized for the control design. The setpoint restriction is given to guarantee a physical constraint on the proposed controller for the melting process. This constraint ensures the exponential convergence of the moving interface to a setpoint and the exponential stability of the temperature equilibrium profile and the delayed controller in the norm. Furthermore, robustness analysis with respect to the delay mismatch between the plant and the controller is studied, which provides analogous results to the exact compensation by restricting the control gain.     

Distributed learning consensus control based on neural networks for heterogeneous nonlinear multiagent systems

This paper considers a novel distributed iterative learning consensus control algorithm based on neural networks for the control of heterogeneous nonlinear multiagent systems. The system's unknown nonlinear function is approximated by suitable neural networks; the approximation error is countered by a robust term in the control. Two types of control algorithms, both of which utilize distributed learning laws, are provided to achieve consensus. In the provided control algorithms, the desired reference is considered to be an unknown factor and then estimated using the associated learning laws. The consensus convergence is proven by the composite energy function method. A numerical simulation is ultimately presented to demonstrate the efficacy of the proposed control schemes.     

基于mobile agent的分布式网络自管理模型

为了解决大规模、异构网络环境下基于“管理员密集”的传统网络管理模式带来的低效率和高出错率问题，提出了一种网络自管理模型，从网络管理的自动初始化和动态自管理两个方面实现对网络自动、自主、自适应的管理；提出了管理定位服务这一关键技术，在多个管理站协同工作的分布式网络环境中为设备自动定位出合适的管理站及初始的管理任务；采用可伸缩的分布式体系结构，适应了大规模网络的规模可变性等特点；基于mobile agent的管理框架进一步提高了管理的自适应性和灵活性。     

Range Assignment for Biconnectivity and k-Edge Connectivity in Wireless Ad Hoc Networks

Depending on whether bidirectional links or unidirectional links are used for communications, the network topology under a given range assignment is either an undirected graph referred to as the bidirectional topology, or a directed graph referred to as the unidirectional topology. The Min-Power Bidirectional (resp., Unidirectional) k-Node Connectivity problem seeks a range assignment of minimum total power subject to the constraint that the produced bidirectional (resp. unidirectional) topology is k-vertex connected. Similarly, the Min-Power Bidirectional (resp., Unidirectional) k-Edge Connectivity problem seeks a range assignment of minimum total power subject to the constraint the produced bidirectional (resp., unidirectional) topology is k-edge connected. The Min-Power Bidirectional Biconnectivity problem and the Min-Power Bidirectional Edge-Biconnectivity problem have been studied by Lloyd et al. [23]. They show that range assignment based the approximation algorithm of Khuller and Raghavachari [18], which we refer to as Algorithm KR, has an approximation ratio of at most 2(2 – 2/n)(2 + 1/n) for Min-Power Bidirectional Biconnectivity, and range assignment based on the approximation algorithm of Khuller and Vishkin [19], which we refer to as Algorithm KV, has an approximation ratio of at most 8(1 – 1/n) for Min-Power Bidirectional Edge-Biconnectivity. In this paper, we first establish the NP-hardness of Min-Power Bidirectional (Edge-) Biconnectivity. Then we show that Algorithm KR has an approximation ratio of at most 4 for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity, and Algorithm KV has an approximation ratio of at most 2k for both Min-Power Bidirectional k-Edge Connectivity and Min-Power Unidirectional k-Edge Connectivity. We also propose a new simple constant-approximation algorithm for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity. This new algorithm applies only to Euclidean instances, but is best suited for distributed implementation. A preliminary version of this work appeared in the proceedings of the 2nd International Conference on AD-HOC Network and Wireless (Adhoc-Now 2003). Research performed in part while visiting the Max-Plank-Institut fur Informatik. Gruia Calinescu is an Assistant Professor of Computer Science at the Illinois Institute of Technology since 2000. He held postdoc or visiting researcher positions at DIMACS, University of Waterloo, and Max-Plank Institut fur Informatik. Gruia has a Diploma from University of Bucharest and a Ph.D. from Georgia Insitute of Technology. His research interests are in the area of algorithms. Peng-Jun Wan has joined the Computer Science Department at Illinois Institute of Technology in 1997 and has been an Associate Professor since 2004. He received his Ph.D. in Computer Science from University of Minnesota in 1997, M.S. in Operations Research and Control Theory from Chinese Academy of Science in 1993, and B.S. in Applied Mathematics from Tsinghua University in 1990. His research interests include optical networks and wireless networks.     

火力发电厂集散控制系统的设计原则

简要论述了集散控制系统的发展 ,根据火力发电厂的现场环境及实际情况 ,提出了火力发电厂集散控制系统的设计原则 ,并展望了集散控制系统的发展