含离散和分布时变时延神经网络系统的指数稳定性

针对一类含有离散和分布时延神经网络,在神经激活函数较弱的约束条件下,通过定义一个更具一般性的Lyapunov泛函,使用凸组合技术,得到了新的基于线性矩阵不等式表示的指数稳定性判据.与现有结果相比,这些判据具有较小的保守性.仿真算例表明,得到的结果是有效的且保守性小.     

基于混沌时间序列的变电站设备温度预测

变电站输变线路和设备的温度变化能够反映其老化、负载过高等引起的安全隐患.通过对变电站设备温度数据的非线性分析和预测,实现对设备的有效预警,将避免事故引起的巨大损失.对变电站已测温度数据建立时间序列,利用小数据量法验证变电站设备温度时间序列的混沌特性.研究基于RBF神经网络的混沌时间序列预测并与神经网络预测进行对比,单步预测与多步预测结果均优于神经网络预测.仿真结论证明了基于神经网络的混沌时间序列预测方法的有效性.     

研究生计算机网络课程体系研究与实践

本文研究面向研究生的计算机网络课程体系,包括教学内容和教学方法等。在计算机网络课程的教学实践中,以专题研究组织教学内容,将教学活动分解为相辅相成的三个环节:授课和阅读,课程设计,以及研讨环节。同时,将理论性教学和实践性教学有机结合。教学实践表明,将科研素养的培养融合在课程教学过程中,有助于培养学生在计算机网络领域的研究和创新能力。     

移动IPv6协议的切换时延性能比较分析

移动IPv6中的切换时延对于特定网络情景中的性能起着很大的作用,它会导致数据包的丢失和严重的端对端性能下降,文章对移动IPv6中的各种协议的切换时延作了性能分析比较,介绍了移动IPv6的基本知识及快速切换的重要性,阐述了层次化移动IPv6和快速移动IPv6的工作原理,采用网络仿真工具NS-2对三种移动IPv6协议的切换性能进行了比较和仿真,实验结果表明快速移动MIPv6具有良好的性能。     

利用希尔伯特变换实现的IT多包接收算法研究

IT（Implicit Training）算法能够实现二维信号的多包接收。利用希尔伯特变换的性质,提出了一种新的用于Ad Hoc网络中二维解析信号多包接收的IT算法。仿真结果表明,与原算法相比,希尔伯特IT算法不仅提高了对用户数据包的分辨能力,而且更加稳定。     

Improvisation of Node Mobility Using Cluster Routing-based Group Adaptive in MANET

In today's Internet routing infrastructure, designers have addressed scaling concerns in routing constrained multiobjective optimization problems examining latency and mobility concerns as a secondary constrain. In tactical Mobile Ad-hoc Network (MANET), hubs can function based on the work plan in various social affairs and the internally connected hubs are almost having the related moving standards where the topology between one and the other are tightly coupled in steady support by considering the touchstone of hubs such as a self-sorted out, self-mending and self-administration. Clustering in the routing process is one of the key aspects to increase MANET performance by coordinating the pathways using multiple criteria and analytics. We present a Group Adaptive Hybrid Routing Algorithm (GAHRA) for gathering portability, which pursues table-driven directing methodology in stable accumulations and on-request steering strategy for versatile situations. Based on this aspect, the research demonstrates an adjustable framework for commuting between the table-driven approach and the on-request approach, with the objectives of enhancing the output of MANET routing computation in each hub. Simulation analysis and replication results reveal that the proposed method is promising than a single well-known existing routing approach and is well-suited for sensitive MANET applications.     

Volt-VAR control for distribution networks with high penetration of DGs: An overview

Continuously improving the ability to accept distributed renewable energies is the trend of future grid development, and a large number of papers have been published in recent years to study the problem of Volt-VAR control (VVC) for distribution networks with high penetration of distributed generations. This paper summarizes the relevant modeling and solution methods for VVC problems, mainly including VVC based on multiple time scales, hierarchical partitioning, multi-stage and network reconstruction, in conjunction with the operational characteristics of distribution networks containing distributed renewable energies; meanwhile, it analyzes the advantages and disadvantages of traditional optimization methods, heuristic intelligent algorithms and random variable processing methods used to solve VVC problems, and then introduces the application of model-free deep reinforcement learning as a latest decision method in VVC of distribution networks. Most of the models and methods compiled in this article are from the research results of the last three years and have some reference value.     

Analogue VLSI primitives for perceptual tasks in machine vision

A variety of computational tasks in early vision can be formulated through lattice networks. The cooperative action of these networks depends upon the topology of interconnections, both feedforward and recurrent ones. The Gabor-like impulse response of a 2nd-order lattice network (i.e. with nearest and next-to-nearest interconnections) is analysed in detail, pointing out how a near-optimal filtering behaviour in space and frequency domains can be achieved through excitatory/inhibitory interactions without impairing the stability of the system. These architectures can be mapped, very efficiently at transistor level, on VLSI structures operating as analogue perceptual engines. The hardware implementation of early vision tasks can, indeed, be tackled by combining these perceptual agents through suitable weighted sums. Various implementation strategies have been pursued with reference to: (i) the algorithm-circuit mapping (current-mode and transconductor approaches); (ii) the degree of programmability (fixed, selectable and tunable); and (iii) the implementation technology (2 and 0.8 gate lengths). Applications of the perceptual engine to machine vision algorithms are discussed.     

车辆四轮转向系统的控制方法

系统地评述了车辆四轮转向系统的原理及其控制方法的发展,在此基础上指出四轮转向系统的研究必须以闭环综合评价为出发点,并与其它主动安全技术相结合才能真正达到实用阶段。     

Cycles passing through a prescribed path in a hypercube with faulty edges

Let Qn denote an n-dimensional hypercube with n?2, P be a path of length h in Qn and F⊂E(Qn)\E(P). Recently, Tsai proved that if 1?h?n−1 and |F|?n−1−h, then in the graph Qn−F the path P lies on a cycle of every even length from 2h+2 to n², and P also lies on a cycle of length 2h if |F|?h−2. In this paper, we show that if 1?h?2n−3 and |F|?n−2−⌊h/2⌋, then in Qn−F the path P lies on a cycle of every even length from 2h+2 to n², and P also lies on a cycle of length 2h if P contains two edges of the same dimension or P is a shortest path and |F∩E(Qh)|?h−2, where Qh is the h-dimensional subcube containing the path P. Moreover, the upper bound 2n−3 of h is sharp and the upper bound n−2−⌊h/2⌋ of |F| is sharp for any given h with 1?h?2n−3.