浅谈实验室信息系统(LIS)的设计和实施

随着医院信息化、数字化建设,实验室信息系统(laboratory information system,LIS)成为医院信息系统不可缺少的部分。该文简述了医院信息系统(HIS)中LIS系统的设计和实施过程。     

计算机硬盘保护系统密码丢失问题及对策研究

硬盘保护系统作为当前保护计算机硬盘的最佳解决办法,能安全有效的保护数据。但是要实现保护硬盘数据的功能,必须通过保护系统密码,进入管理平台操作,使得密码丢失存在较大的可能性。本文分析了硬盘保护系统密码丢失的原因和后果,在技术上提出了重置保护系统密码的解决方案,具有实际意义。     

Exponential stability and exponential stabilization of singularly perturbed stochastic systems with time‐varying delay

In this paper, the problems of exponential stability and exponential stabilization for linear singularly perturbed stochastic systems with time‐varying delay are investigated. First, an appropriate Lyapunov functional is introduced to establish an improved delay‐dependent stability criterion. By applying free‐weighting matrix technique and by equivalently eliminating time‐varying delay through the idea of convex combination, a less conservative sufficient condition for exponential stability in mean square is obtained in terms of ε‐dependent linear matrix inequalities (LMIs). It is shown that if this set of LMIs for ε=0 are feasible then the system is exponentially stable in mean square for sufficiently small ε?0. Furthermore, it is shown that if a certain matrix variable in this set of LMIs is chosen to be a special form and the resulting LMIs are feasible for ε=0, then the system is ε‐uniformly exponentially stable for all sufficiently small ε?0. Based on the stability criteria, an ε‐independent state‐feedback controller that stabilizes the system for sufficiently small ε?0 is derived. Finally, numerical examples are presented, which show our results are effective and useful. Copyright © 2010 John Wiley & Sons, Ltd.     

Elastic Routing Table with Provable Performance for Congestion Control in DHT Networks

Consistent hashing-based DHT networks have an inherent load balancing problem. The problem becomes more severe in heterogeneous networks with nonuniform and time-varying popular files. Existing DHT load balancing algorithms are mainly focused on the issues caused by node heterogeneity. To deal with skewed lookups, this paper presents an elastic routing table (ERT) mechanism for query load balancing, based on the observation that high-degree nodes tend to receive more traffic load. The mechanism allows each node to have a routing table of variable size corresponding to node capacities. The indegree and outdegree of the routing table can also be adjusted dynamically in response to the change of file popularity and network churn. Theoretical analysis proves that the routing table degree is bounded. The ERT mechanism facilitates locality-aware randomized query forwarding to further improve lookup efficiency. By relating query forwarding to a supermarket customer service model, we prove that a two-way randomized query forwarding policy should lead to an exponential improvement in query processing time over random walking. Simulation results demonstrate the effectiveness of the ERT mechanism and its related query forwarding policy for congestion and query load balancing. In comparison with existing "virtual-server”-based load balancing algorithms and other routing table control approaches, the ERT-based congestion control protocol yields significant improvement in query lookup efficiency.     

Bounds estimation and practical stability of AIMD/RED systems with time delays

The Additive Increase and Multiplicative Decrease (AIMD) congestion control algorithm of TCP deployed in the end systems and the Random Early Detection (RED) queue management scheme deployed in the intermediate systems contribute to Internet stability and integrity. Previous research based on the fluid-flow model analysis indicated that, with feedback delays, the TCP/RED system may not be asymptotically stable when the time delays or the bottleneck link capacity becomes large [3]. However, as long as the system operates near its desired equilibrium, small oscillations around the equilibrium are acceptable, and the network performance (in terms of efficiency, loss rate, and delay) is still satisfactory. In this paper, we study the practical stability of AIMD/RED system with feedback delays and with both homogeneous and heterogeneous flows. We obtain theoretical bounds of the flow window size and the RED queue length, as functions of the number of flows, link capacity, RED queue parameters, and AIMD parameters. Numerical results with Matlab and simulation results with NS-2 are given to validate the correctness and demonstrate the tightness of the derived bounds. The analytical and simulation results provide important insights on which system parameters contribute to higher system oscillations and how to set parameters (such as buffer size and queue management parameters) to ensure system efficiency with bounded delay and loss. Our results can also help to predict and control the system performance for Internet with higher data rate links multiplexed with heterogeneous flows with different parameters.     

Comparison of two novel MRAS based strategies for identifying parameters in permanent magnet synchronous motors

Two model reference adaptive system (MRAS) estimators are developed for identifying the parameters of permanent magnet synchronous motors (PMSM) based on the Lyapunov stability theorem and the Popov stability criterion, respectively. The proposed estimators only need online measurement of currents, voltages, and rotor speed to effectively estimate stator resistance, inductance, and rotor flux-linkage simultaneously. The performance of the estimators is compared and verified through simulations and experiments, which show that the two estimators are simple, have good robustness against parameter variation, and are accurate in parameter tracking. However, the estimator based on the Popov stability criterion, which can overcome parameter variation in a practical system, is superior in terms of response speed and convergence speed since there are both proportional and integral units in the estimator, in contrast to only one integral unit in the estimator based on the Lyapunov stability theorem. In addition, the estimator based on the Popov stability criterion does not need the expertise that is required in designing a Lyapunov function.     

Multi-agent and driving behavior based rear-end collision alarm modeling and simulating

Distance-between-vehicle-measurement is the only factor in traditional car rear-end alarm system. To address the above problem, this paper proposes an alarming model based on multi-agent systems (MAS) and driving behavior. It consists of four different types of agents that can either work alone or collaborate through a communications protocol on the basis of the extended KQML. The rear-end alarming algorithm applies the Bayes decision theory to calculate the probability of collision and prevent its occurrence real-time. The learning algorithm of driving behavior based on ensemble artificial neural network (ANN) and the decision procedure based on Bayes’ theory are also described in this paper. Both autonomy and reliability are enhanced in the proposed system. The effectiveness and robustness of the model have been confirmed by the simulated experiments.     

Sliding mode control of uncertain switched delay systems via hysteresis switching strategy

This paper investigates the robust sliding mode control (SMC) problem for a class of uncertain switched systems with time-varying delay. The sliding surface is constructed such that the sliding motion is completely invariant to all admissible uncertainties. For the case of the known delay-derivative upper bound, by using the multiple Lyapunov functions method, the Hysteresis switching law dependent on the state and the previous value of switching signal are designed to stabilize the sliding motion and avoid the chattering. Variable structure controllers are developed to drive the state of switched systems to reach the sliding surface in finite time and remain on it thereafter. For the case of the unknown delay-derivative upper bound, based on the single Lyapunov function method, the conditions of stabilization are obtained. Finally, a numerical example is given to illustrate the effectiveness of the proposed methods.     

认知无线电技术在煤矿井下的应用研究

针对现有煤矿井下无线通信系统载频和调制方式等参数固定、无法适应巷道信道模型变化而导致通信可靠性低的问题,提出了在煤矿井下无线通信系统中应用认知无线电技术的方案,即利用认知无线电技术感知通信系统所处巷道的频谱和信道模型,实时、自适应地调整载频、调制方式等传输参数的特点,从而优化煤矿井下无线通信网络的传输性能;综合分析了认知无线电在煤矿井下应用的可行性;最后给出了认知无线电在煤矿井下应用的实现模式。     

物联网与感知矿山专题讲座之三——感知矿山物联网的特征与关键技术

指出了感知矿山物联网是在煤矿综合自动化基础上的延伸和扩展应用,因而,感知矿山物联网在很大程度上有别于综合自动化系统;由于煤矿应用的特点,感知矿山物联网与目前地面物联网应用也有一些不同之处;介绍了感知矿山物联网的特征,它主要表现在多系统综合应用、感知层开放、应用平台开放和适合构建逻辑子系统等几个方面;分析了感知层、网络层、应用层的关键技术和跨层的公共技术;给出了感知矿山物联网的开放性要求和标准建设。该文对更好地理解感知矿山物联网的建设具有一定的参考价值。