Adaptive fuzzy dynamic surface control for a class of perturbed nonlinear time-varying delay systems with unknown dead-zone

In this paper,adaptive dynamic surface control(DSC) is developed for a class of nonlinear systems with unknown discrete and distributed time-varying delays and unknown dead-zone.Fuzzy logic systems are used to approximate the unknown nonlinear functions.Then,by combining the backstepping technique and the appropriate Lyapunov-Krasovskii functionals with the dynamic surface control approach,the adaptive fuzzy tracking controller is designed.Our development is able to eliminate the problem of "explosion of complexity" inherent in the existing backstepping-based methods.The main advantages of our approach include:1) for the n-th-order nonlinear systems,only one parameter needs to be adjusted online in the controller design procedure,which reduces the computation burden greatly.Moreover,the input of the dead-zone with only one adjusted parameter is much simpler than the ones in the existing results;2) the proposed control scheme does not need to know the time delays and their upper bounds.It is proven that the proposed design method is able to guarantee that all the signals in the closed-loop system are bounded and the tracking error is smaller than a prescribed error bound,Finally,simulation results demonstrate the effectiveness of the proposed approach.     

基于MAK仿真平台的要地防空作战仿真研究

结合要地防空作战样式特性,构建了基于MAK仿真平台的分布交互式作战仿真系统,研究了要地防空CGF框架和仿真实体的探测器、控制器和执行器组件,采用Stealth开发了地空导弹武器系统和飞机视景仿真系统,模拟了地面和空中战场环境,并最终形成了初步仿真案例。研究成果对采用MAK平台开发作战仿真系统有一定借鉴和参考价值。     

Nondestructive characterization of the mechanical strength of diffusion bonds. II. Application of a quasi-static spring model

It has been shown that the acoustic response of imperfect interfaces may be described by a quasi-static spring model. In the present paper, experimental data on the geometry of the contacts between two diffusion-bonded blocks have been used to determine the spring stiffness of such interfaces which have been correlated with experimentally determined ultrasonic reflection coefficients. The correlation between the theoretical reflection coefficient and the spring stiffness was found to be in excellent agreement with experimentally-observed values, if the disbonds are of infinitesimally small thickness. For disbonds of finite thickness, the agreement is less satisfactory. Reasons for the discrepancy in the latter case are unknown at the present time.     

基于被动测量的高速网络管理系统

文章介绍了,面向大规模宽带IP网络的运维和管理需求,以大规模网络流量测量和知识挖掘为基础,研究基于分布式流量测量的新一代宽带网络管理架构,采用网络被动模式测量和主动采集技术手段,实现对高速网络的性能、状态和行为的管理,并对网络测量技术的发展及现状、系统的架构、关键技术和应用情况作了详细阐述,明确下一步研究工作的目标。     

一种DVE中通用的因果消息序时间管理分布式中间件

对于遵循高层体系结构(HLA)标准构建的分布式虚拟环境(DVE),时间管理服务的性能将直接影响分布式仿真的效率和正确性。目前的时间管理服务实现了两种消息排序机制:接收序和时戳序。接收序对消息按其接收顺序进行处理,实时性高,但无法正确处理接收顺序与产生顺序相违背的消息;时戳序通常指保守时戳序机制,能对消息按其产生的时间顺序进行处理,但时间开销较大,难以到达DVE的实时性要求。因此,本文以分布式中间件的方式为DVE设计实现了一种因果消息序时间管理服务,提供符合HLA标准的程序接口,使分布式仿真应用在不改变原有调用接口的情况下,能够通过中间件对消息实现因果序时间管理。实验表明,使用该中间件可以有效维护消息的处理顺序,同时时间开销小,能够较好地满足DVE的实时性要求。     

分布式计算环境中的协同分配任务调度仿真系统

协同分配是在分布式计算环境中进行资源分配的一种重要技术,用于把一个应用程序分解为多个子作业,然后将其分配到多个资源上同时处理来满足特定的性能要求。本文提出了一个离散事件驱动的网格资源协同分配仿真系统,实现了对用户、调度器、协同分配器、协同预留器等协同分配相关实体的仿真,实现了FCFS、FPFS、Backfill等主要的协同分配调度算法和策略,可用于资源协同分配相关的分布式计算环境的资源管理和调度算法的仿真和研究。     

无相位反馈的分布式发射波束成形技术研究

分布式发射波束成形技术是实现协作通信的一种有效方式,而分布式发射波束成形面临的主要技术挑战有发射信息共享、载波同步、发射时间同步等。本文针对这些技术挑战利用时分双工系统前后向信道的一致性,提出了一种不需要在节点之间反馈相位控制信息的分布式发射波束成形技术。在此基础上,发射节点和目标节点之间数据传输采用OFDM技术,提出了对每个子载波信号分别进行发射波束成形的实现方法。     

基于FPGA的高速二维DCT变换的研究与实现

空间科学实验中图像的分辨率不断提高、数据量越来越大,因此需要对图像数据进行星上压缩处理后再进行传输。FPGA具有低功耗、高性能的特点,已普遍应用在卫星的各种有效载荷上,因此可采用FPGA实现图像压缩。基于FPGA的图像压缩算法的核心是DCT变换,而DCT变换中需消耗大量的乘法资源。为了提高图像压缩的效率,同时减少对专用乘法器的依赖,本文就充分利用FPGA中的BRAM与LUT资源,使用改进型的分布式算法、流水结构和乒乓操作,在避免使用乘法器的同时,实现JPEG压缩算法中的DCT变换,具有良好的可移植性。经验证,该方法用于基于FPGA的JPEG图像压缩系统中,相比传统DCT快速算法运算速度显著提高。     

车载自组网中一种支持群签名认证的分布式密钥管理方案

群签名具备良好的匿名认证特性,满足车载自组网信息安全和隐私保护需求。但是,其作废开销较大,不适于在大规模网络环境中应用。为此,本文提出了一种支持群签名认证的分布式密钥管理方案DKM,将车载自组网的覆盖区域划分为若干子区域,车辆周期性地从所在子区域的群管理机构更新群密钥。这样,作废某个成员只需要在其拥有合法密钥的子区域内通告,而不是整个网络,有利于降低作废开销。同时,DKM中的密钥更新机制能够保证车辆的群密钥的私密性,从而避免了车辆与区域群管理机构的授权争议,保持了数字签名的不可否认性。性能分析表明DKM能够显著缩短作废列表长度,同时没有增加认证开销。     

On mapping processes to processors in distributed systems

This paper is concerned with the implementation of parallel programs on networks of processors. In particular, we study the use of the network augmenting approach as an implementation tool. According to this approach, the capabilities of a given network of processors can be increased by adding some auxiliary links among the processors. We prove that the minimum set of edges needed to augment a line-like network so that it can accommodate a parallel program is determined by an optimal path cover of the graph representation of the program. Anoptimal path cover of a simple graphG is a set of vertex-disjoint paths that cover all the vertices ofG and has the maximum possible number of edges. We present a linear time optimal path covering algorithm for a class of sparse graphs. This algorithm is of special interest since the optimal path covering problem is NP-complete for general graphs. Our results suggest that a cover and augment scheme can be used for optimal implementation of parallel programs in line-like networks.A preliminary version of this paper was presented at the 6th IEEE Conference on Computer Communications (INFOCOM '87).This reseach is supported in part by National Semiconductor (Israel), Ltd.