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.     

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

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

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.     

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.     

嵌入式RTOS中任务优先级反转问题研究

针对嵌入式实时系统任务调度策略的特点，任务在运行的时候可能被更高优先级的任务中断。分析了嵌入式RTOS中的最高就绪任务的查找算法，指出该调度算法存在的不同优先级的反转问题，并且针对这一问题进行研究，给出了相应的优先级继承方案。较好地解决了RTOS中任务调度中的优先级的反转问题。     

高效的模式匹配算法研究

对入侵检测中模式匹配的方法进行了研究,分析了当前常用的模式匹配方法的弱点与不足,提出了一种基于三叉树结构的自动机方法,较好的避免了传统树型结构中由于节点数目变化而导致的不便。此外,利用匹配失败的信息,实现了跳跃匹配,提高了模式匹配的速度。*     

HART通信协议在汽油机速度测量和监控方面的应用

首先介绍了HART通信协议及他的优点，然后介绍了HART通信协议在汽油机测速方面的软件实现。该软件主要采用目前流行的VB编程语言。可设计出界面友好、功能强大的测量和监控软件。     

无线网状网及相关标准

简要描述了无线网状网(Wireless Mesh Networks)拓朴、网络架构和协议,分析了其优点,对相关标准作了介绍和比较.