Average consensus in networks of dynamic agents with switching topologies and multiple time-varying delays

In this paper, we discuss average consensus problem in undirected networks of dynamic agents with fixed and switching topologies as well as multiple time-varying communication delays. By employing a linear matrix inequality method, we prove that all the nodes in the network achieve average consensus asymptotically for appropriate communication delays if the network topology is connected. Particularly, several feasible linear matrix inequalities are established to determine the maximal allowable upper bound of time-varying communication delays. Numerical examples are given to demonstrate the effectiveness and the sharpness of the theoretical results.     

Tri-Gate Bulk MOSFET Design for CMOS Scaling to the End of the Roadmap

A tri-gate bulk MOSFET design utilizing a low-aspect-ratio channel is proposed to provide an evolutionary pathway for CMOS scaling to the end of the roadmap. 3-D device simulations indicate that this design offers the advantages of a multi-gate FET (reduced variability in performance and improved scalability) together with the advantages of a conventional planar MOSFET (low substrate cost and capability for dynamic threshold-voltage control).     

Optimal and self‐tuning fusion Kalman filters for discrete‐time stochastic singular systems

Based on the optimal fusion estimation algorithm weighted by scalars in the linear minimum variance sense, a distributed optimal fusion Kalman filter weighted by scalars is presented for discrete‐time stochastic singular systems with multiple sensors and correlated noises. A cross‐covariance matrix of filtering errors between any two sensors is derived. When the noise statistical information is unknown, a distributed identification approach is presented based on correlation functions and the weighted average method. Further, a distributed self‐tuning fusion filter is given, which includes two stage fusions where the first‐stage fusion is used to identify the noise covariance and the second‐stage fusion is used to obtain the fusion state filter. A simulation verifies the effectiveness of the proposed algorithm. Copyright © 2008 John Wiley & Sons, Ltd.     

一种采用单台微机控制的标签粘贴机

标签粘贴机是一种可自动进行标签打印和粘贴的设备装置,在工业自动化生产中有着广泛的应用.介绍了一种采用单台微机进行控制的全自动标签粘贴机的工作原理及各部分组成,以及使用过程中对其进行设置和调整的方法.该标签粘贴机已实际应用于华飞彩色显示系统有限公司29英寸彩色显像管生产线的屏网组装工序,取得了良好的效果.     

cdma1x无线子系统导频信道功率分配分析

分析了目前联通CDMA网络建设中的主要问题之一——导频功率分配问题。主要介绍了cdma 1x系统的信道类型，以及前向链路信道功率分配原则，并且对导频信道功率与无线网络覆盖和容量之间的关系进行了初步探讨。     

IPv6和基于IPv6的网络设计

对IPv6协议的主要内容进行了简要介绍,并针对IPv6的特点对基于IPv6的网络设计进行了探讨。     

透析3G在中国面临的重重困局(1)--牌照与标准选择

探讨了中国3G牌照何时发放、发放数量、牌照与标准是否捆绑、3G产业链如何搭建、频率如何分配、市场容量和终端等问题，并对此提出了建设性的意见。     

裂缝性油气藏采收率：100个裂缝性油气田实例的经验总结

通过对世界上100个裂缝性油气藏的综合评价，研究储集层及流体本身的性质(包括孔隙度、渗透率、黏度、可动油比例、含水饱和度、润湿性及裂缝分布特征等)和驱动机制及油藏管理战略(优化日产量和采用不同类型的提高采收率技术)对其最终采收率的影响。将裂缝性油气藏分为4类：I类的基质几乎没有孔隙度和渗透率，裂缝是储存空间和流体流动的通道；Ⅱ类的基质有较低的孔隙度和渗透率，基质提供储存空间，裂缝提供流动通道；Ⅲ类(微孔隙)的基质具有高孔隙度和低渗透率，基质提供储存空间，裂缝提供流动通道；Ⅳ类(大孔隙)的基质具有高的孔隙度和渗透率，基质提供储存空间和流动通道，裂缝仅增加渗透率。对26个Ⅱ类油气藏和20个Ⅲ类油气藏的开采历史的研究表明：Ⅱ类油气藏的采收率受水驱强度和最优日产量控制，日产量过高会很容易破坏Ⅱ类油气藏，一些Ⅱ类油气藏如果管理得当，采收率可以很高，不需要二次或三次采油；Ⅲ类油气藏的采收率主要受岩石和流体本身性质的影响，特别是基质渗透率、流体重度、润湿性以及裂缝强度等，不进行二次或三次采油不可能完全开采，往往需要采用一些提高采收率的专门技术。以往将Ⅱ类和Ⅲ类裂缝性油气藏归为一类，认识它们的区别将有助于选择更好的开发策略。     

Perturbation analysis and control of two-class stochastic fluid models for communication networks

This paper uses stochastic fluid models (SFMs) for the control and optimization (rather than performance analysis) of communication network nodes processing two classes of traffic: one is uncontrolled and the other is subject to threshold-based buffer control. We derive gradient estimators for packet loss and workload related performance metrics with respect to threshold parameters. These estimators are shown to be unbiased and directly observable from a sample path without any knowledge of underlying stochastic characteristics of the traffic processes. This renders them computable in online environments and easily implementable for network management and control. We further demonstrate their use in buffer control problems where our SFM-based estimators are evaluated based on data from an actual system.     

An Optimized Content-Aware Authentication Scheme for Streaming JPEG-2000 Images Over Lossy Networks

This paper proposes an optimized content-aware authentication scheme for JPEG-2000 streams over lossy networks, where a received packet is consumed only when it is both decodable and authenticated. In a JPEG-2000 codestream, some packets are more important than others in terms of coding dependency and image quality. This naturally motivates allocating more redundant authentication information for the more important packets in order to maximize their probability of authentication and thereby minimize the distortion at the receiver. Towards this goal, with the awareness of its corresponding image content, we formulate an optimization framework to compute an authentication graph to maximize the expected media quality at the receiver, given specific authentication overhead and knowledge of network loss rate. System analysis and experimental results demonstrate that the proposed scheme achieves our design goal in that the rate-distortion (R-D) curve of the authenticated image is very close to the R-D curve when no authentication is required