使能未来工厂的5G能力综述

5G系统将移动通信服务从移动电话、移动宽带和大规模机器通信扩展到新的应用领域，即所谓对通信服务有特殊要求的垂直领域。对使能未来工厂的5G能力进行了全面的分析总结，包括弹性网络架构、灵活频谱、超可靠低时延通信、时间敏感网络、安全和定位，而弹性网络架构又包括对网络切片、非公共网络、5G局域网和边缘计算的支持。希望从广度到深度，对相关的理论及技术应用做透彻、全面的梳理，对其挑战做清晰的总结，从而为相关研究和工程技术人员提供借鉴。     

Analysis and proposition of limiting current density measurement protocol

Limiting current density at different temperatures, backpressures, and balance gases can be used to separate molecular diffusion resistance, Knudsen diffusion resistance and local transport resistance of membrane electrode assembly (MEA). However, the measurement of limiting current density has no unified protocol. The diverse choices in the literature, either in the control of current or voltage or in the atmosphere like relative humidity and O₂ concentrations, make it difficult to compare the results and identify the true bottleneck hindering the mass transport. In this work, the current-voltage curves obtained by current scanning/stepping and voltage scanning/stepping methods under dilute O₂ of different concentrations and a wide range of relative humidity were measured and analyzed systematically. It is found that the voltage stepping method is superior to the other three ways of control for the reliable determination of the limiting current density. Aided with simultaneous electrochemical impedance spectroscopy measurement, the limiting current density can be determined with pinpoint accuracy. When the limiting current density is just used to qualitatively evaluate different MEA, the voltage scanning method can be used instead for its high time efficiency. The selection of the atmosphere also plays an important role in suppressing the distortion from excessive water and reducing the spurious contribution from proton conduction resistance. It is found that O₂ concentrations at 0.5 vol% and relative humidity at 90% can give the best estimation of O₂ transport resistance in membrane electrode assembly.     

基于概率法的电力系统安全分析

为应对电力系统安全分析中的停机问题，基于概率法的方式，将常用的确定停机计算与加入了概率法的概率停机进行比较，研究了二者的区别与其在长期投资方向的不同。在进行电力系统停机分析时，通常会分别从确定停机与概率停机的角度出发，对其应急状态下的潮流进行计算。但前者的方法可能导致极低概率的停机事件被忽略，进而影响长期的资金投资。通过加入概率法的计算，使得对单个停机事件的判定由其具体的频率来确定，增加了系统运行的稳定性。     

Understanding the asymmetric perceptions of smartphone security from security feature perspective: A comparative study

Smartphones are being used and relied on by people more than ever before. The open connectivity brings with it great convenience and leads to a variety of risks that cannot be overlooked. Smartphone vendors, security policy designers, and security application providers have put a variety of practical efforts to secure smartphones, and researchers have conducted extensive research on threat sources, security techniques, and user security behaviors. Regrettably, smartphone users do not pay enough attention to mobile security, making many efforts futile. This study identifies this gap between technology affordance and user requirements, and attempts to investigate the asymmetric perceptions toward security features between developers and users, between users and users, as well as between different security features. These asymmetric perceptions include perceptions of quality, perceptions of importance, and perceptions of satisfaction. After scoping the range of smartphone security features, this study conducts an improved Kano-based method and exhaustively analyzes the 245 collected samples using correspondence analysis and importance satisfaction analysis. The 14 security features of the smartphone are divided into four Kano quality types and the perceived quality differences between developers and users are compared. Correspondence analysis is utilized to capture the relationship between the perceived importance of security features across different groups of respondents, and results of importance-satisfaction analysis provide the basis for the developmental path and resource reallocation strategy of security features. This article offers new insights for researchers as well as practitioners of smartphone security.     

基于三维胞元空间的MA双向并行路由算法

针对传统移动代理(MA)在监测无线传感器网络(WSNs)的感兴趣信息时产生的延迟较大和能耗较多问题,提出了基于三维胞元空间的MA双向并行(3D-BPMA)路由算法.3D-BPMA将MA与传统的客户/服务器(c/S)模式相结合,在胞元内利用C/S模式搜集信息,在单层胞元系统和路由器与路由器之间采用MA双向并行的策略进行传输.仿真结果表明:3D-BPMA与LCF,DSG-MIP算法相比减少了平均响应时间和网络平均能耗,提高了MA发送率.     

Secure lightweight password authenticated key exchange for heterogeneous wireless sensor networks

Several three-party password authenticated key exchange (3-PAKE) protocols have recently been proposed for heterogeneous wireless sensor networks (HWSN). These are efficient and designed to address security concerns in ad-hoc sensor network applications for a global Internet of Things framework, where a user may request access to sensitive information collected by resource-constrained sensors in clusters managed by gateway nodes. In this paper we first analyze three recently proposed 3-PAKE protocols and discuss their vulnerabilities. Then, based on Radio Frequency Identification technologies we propose a novel 3-PAKE protocol for HWSN applications, with two extensions for additional security features, that is provably secure, efficient and flexible.     

Leader-following consensus of fractional-order multi-agent systems via adaptive control

This article focuses on the consensus problem of leader-following fractional-order multi-agent systems (MASs) with general linear and Lipschitz nonlinear dynamics. First, the distributed adaptive protocols for linear and nonlinear fractional-order MASs are constructed, respectively. We allow the control coupling gains to be time varying for each agent. Moreover, the adaptive modification schemes for the control gain are designed, which renders smaller control gains and thus requires smaller amplitude on the control input without sacrificing consensus convergence. Second, based on fractional-order Lyapunov stability theorem and Barbalat's lemma, two novel sufficient conditions in terms of linear matrix inequalities are provided to ensure that the leader-following consensus can be obtained in the case for any undirected connected communication graph. Furthermore, we show that the proposed algorithm also works for consensus of agents with intrinsic Lipschitz nonlinear dynamics. As a result, the proposed framework requires no global information and thus can be implemented in a fully distributed manner. Finally, the numerical simulations are given to demonstrate the effectiveness of obtained the theoretical results.     

Commitment-based device-pairing protocol with synchronized drawings and comparison metrics

This article presents a new method for pairing devices securely. The commitment-based authentication uses a fuzzy secret that the devices only know approximately. Its novel feature is time-based opening of commitments in a single round. We also introduce a new source for the fuzzy secret: synchronized drawing with two fingers of the same hand on two touch screens or surfaces. The drawings are encoded as strings and compared with an edit-distance metric. A prototype implementation of this surprisingly simple and natural pairing mechanism shows that it accurately differentiates between true positives and man-in-the-middle attackers.     

Low complexity quantum private queries protocol

Private information retrieval(PIR) is an important privacy protection issue of secure multi-party computation, but the PIR protocols based on classical cryptography are vulnerable because of new technologies,such as quantum computing and cloud computing. The quantum private queries(QPQ) protocols available, however, has a high complexity and is inefficient in the face of large database. This paper, based on the QKD technology which is mature now, proposes a novel QPQ protocol utilizing the key dilution and auxiliary parameter. Only N quits are required to be sent in the quantum channel to generate the raw key, then the straight k bits in the raw key are added bitwise to dilute the raw key, and a final key is consequently obtained to encrypt the database. By flexible adjusting of auxiliary parameters θ and k, privacy is secured and the query success ratio is improved. Feasibility and performance analyses indicate that the protocol has a high success ratio in first-trial query and is easy to implement, and that the communication complexity of O(N) is achieved.     

An adaptive local search algorithm for vehicle routing problem with simultaneous and mixed pickups and deliveries

The Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD) is an extension to the classical Vehicle Routing Problem (VRP), where customers may both receive and send goods simultaneously. The Vehicle Routing Problem with Mixed Pickup and Delivery (VRPMPD) differs from the VRPSPD in that the customers may have either pickup or delivery demand. However, the solution approaches proposed for the VRPSPD can be directly applied to the VRPMPD. In this study, an adaptive local search solution approach is developed for both the VRPSPD and the VRPMPD, which hybridizes a Simulated Annealing inspired algorithm with Variable Neighborhood Descent. The algorithm uses an adaptive threshold function that makes the algorithm self-tuning. The proposed approach is tested on well-known VRPSPD and VRPMPD benchmark instances derived from the literature. The computational results indicate that the proposed algorithm is effective in solving the problems in reasonable computation time.