Web proxy cache replacement scheme based on back-propagation neural network

Web proxy caches are used to reduce the strain of contemporary web traffic on web servers and network bandwidth providers. In this research, a novel approach to web proxy cache replacement which utilizes neural networks for replacement decisions is developed and analyzed. Neural networks are trained to classify cacheable objects from real world data sets using information known to be important in web proxy caching, such as frequency and recency. Correct classification ratios between 0.85 and 0.88 are obtained both for data used for training and data not used for training. Our approach is compared with Least Recently Used (LRU), Least Frequently Used (LFU) and the optimal case which always rates an object with the number of future requests. Performance is evaluated in simulation for various neural network structures and cache conditions. The final neural networks achieve hit rates that are 86.60% of the optimal in the worst case and 100% of the optimal in the best case. Byte-hit rates are 93.36% of the optimal in the worst case and 99.92% of the optimal in the best case. We examine the input-to-output mappings of individual neural networks and analyze the resulting caching strategy with respect to specific cache conditions.     

Parallel Lagrange interpolation on <Emphasis Type="Italic">k</Emphasis>-ary <Emphasis Type="Italic">n</Emphasis>-cubes with maximum channel utilization

This paper proposes an efficient parallel algorithm for computing Lagrange interpolation on k-ary n-cube networks. This is done using the fact that a k-ary n-cube can be decomposed into n link-disjoint Hamiltonian cycles. Using these n link-disjoint cycles, we interpolate Lagrange polynomial using full bandwidth of the employed network. Communication in the main phase of the algorithm is based on an all-to-all broadcast algorithm on the n link-disjoint Hamiltonian cycles exploiting all network channels, and thus, resulting in high-efficiency in using network resources. A performance evaluation of the proposed algorithm reveals an optimum speedup for a typical range of system parameters used in current state-of-the-art implementations.

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

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

Stability analysis of neutral systems with distributed delays

The stability of neutral systems with distributed delays is investigated in this paper. A modified Lyapunov-Krasovskii functional is constructed to study this class of systems. The proposed stability criterion is discrete-, distributed- and neutral-delay-dependent. In addition, by this method one can study the case when the coefficient matrix of the neutral delay term is time-varying uncertain. The reduced conservatism is illustrated in a numerical example.     

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.     

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

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

Adaptive control for a class of nonlinear systems with time-varying delays in state and input

This paper is concerned with the adaptive stabilization problem of uncertain input delayed systems.A solution to this problem is given for a class of uncertain nonlinear systems with time-varying delays in both state and input.An adaptive asymptotically stabilizing controller,which can guarantee the stability of the closed-loop system and the convergence of the original system state,is designed by means of the Lyapunov-Krasovskii functional stability theory combined with linear matrix inequalities (LMIs) an...     

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.     

基于无线网络技术的燃气集抄系统设计

针对燃气行业人工抄表费时费力等问题,提出一种基于GPRS和无线多跳网络技术的燃气无线抄表系统,在分析传统抄表系统的结构以及传输方式优缺点的基础上介绍了系统的总体结构、工作原理以及各部分组成和功能。采用计算机网络和数据库等技术,使得该系统具有功能强大、使用方便、可扩展性好等特点,可实现对整个燃气输配系统的监控,有效提高燃气公司的管理水平和服务效率。