Study of the Improvement on Network Management Performance with Mobile Agent

1　IntroductionWiththerapiddevelopmentofInternet,thenetworkisbecominglargerandmorecomplex ,whichcallsformoresophisticatednetworkmanage mentstrategiestobeadoptedinordertoguaranteeadequatelevelsofperformance .Confrontedwiththepresentstatusofnetworkmanagement,manyschol arsmakegreateffortstoinventnewapproachesforthepurposeofimprovingtheperformanceofnet workmanagement.MobileAgenttechnologiesandtheirapplicationtonetworkmanagementaread vancedunderthisbackground .Althoughalotofworkhasstilltobedone ,t…     

校园网宿舍网络管理模式的探讨

讨论了高校学生宿舍区网络的特点，结合天津商学院校园网的实践，讨论了校园网宿舍网络管理的模式。     

网络管理中事件关联检测机制的研究

网络事件的关联检测是网络管理需要解决的一个关键问题,本文根据分布式网络管理的特点,首次明确定义了网络事件的基本关联关系,在此基础上提出了一种基于Petri Net的事件关联检测机制,实现了基于事件内容的细粒度关联检测,并且在事件检测中充分考虑了时间因素,有效地提高了事件关联检测的准确性。     

一类连续模糊动态系统控制方法在Furuta摆中的应用

为了研究Furuta摆在倒立点附近的稳定控制问题，采用基于T-S模糊模型的一类连续模糊动态系统控制方法，首次进行Furuta摆的模糊状态空间建模，并采用模糊切换的思想，设计了Furuta摆在倒立点附近的稳定控制器，进而分析了系统稳定性。与已有的方法相比，该方法的优点是稳定区域大、调节时间短。数字仿真结果验证了方法的有效性。     

Approximate inverse computation using Frobenius inner product

Parallel preconditioners are presented for the solution of general linear systems of equations. The computation of these preconditioners is achieved by orthogonal projections related to the Frobenius inner product. So, min_M∈??∥AM?I∥ _F and matrix M₀∈?? corresponding to this minimum (?? being any vectorial subspace of ??_n(?)) are explicitly computed using accumulative formulae in order to reduce computational cost when subspace ?? is extended to another one containing it. Every step, the computation is carried out taking advantage of the previous one, what considerably reduces the amount of work. These general results are illustrated with the subspace of matrices M such that AM is symmetric. The main application is developed for the subspace of matrices with a given sparsity pattern which may be constructed iteratively by augmenting the set of non‐zero entries in each column. Finally, the effectiveness of the sparse preconditioners is illustrated with some numerical experiments. Copyright © 2002 John Wiley & Sons, Ltd.     

一种实现非等带宽多载波调制的新方法

传统的多载波调制都是采用对传输信道进行等带宽划分的方式。为了更好地适应信道传输特性，一个很有应用前景的发展方向是采用非等带宽划分信道的多载波调制方式。本文提出了一种利用正交小波包变换实现的非等带宽划分信道的多载波调制方法。理论分析和实验结果表明，这种方法对于提高信道的传输性能有很大的潜力。     

Classification problems for shifts on modules over a principal ideal domain

In this paper we study symbolic dynamics over alphabets which are modules over a principal ideal domain, considering topological shifts which are also submodules. Our main result is the classification, up to algebraic and topological conjugacy, of the torsion-free, transitive, finite memory shifts.

     

EXISTENCE OF PERIODIC SOLUTIONS OF SYSTEM OF DIFFERENCE EQUATIONS

This paper studies the nonautonomous nonlinear system of difference equationsΔx(n)=A(n)x(n)+f(n,x(n)),n∈Z,(*) where x(n)∈R~N,A(n)=(a_(ij)(n))N×N is an N×N matrix,with a-(ij)∈C(R,R) for i,j= 1,2,3,...,N,and f=(f_1,f_2,...,f_N)~T∈C(R×R~N,R~N),satisfying A(t+ω)=A(t),f(t+ω,z)=f(t,z) for any t∈R,(t,z)∈R×R~N andωis a positive integer.Sufficient conditions for the existence ofω-periodic solutions to equations (*) are obtained.     

BoneRoute: An Adaptive Memory-Based Method for Effective Fleet Management

This paper presents an adaptive memory-based method for solving the Capacitated Vehicle Routing Problem (CVRP), called BoneRoute. The CVRP deals with the problem of finding the optimal sequence of deliveries conducted by a fleet of homogeneous vehicles, based at one depot, to serve a set of customers. The computational performance of the BoneRoute was found to be very efficient, producing high quality solutions over two sets of well known case studies examined.     

An Effective Software Pipelining Algorithm for Clustered Embedded VLIW Processors

This paper proposes a software pipelining framework, CALiBeR (ClusterAware Load Balancing Retiming Algorithm), suitable for compilers targetingclustered embedded VLIW processors. CALiBeR can be used by embedded systemdesigners to explore different code optimization alternatives, that is, high-qualitycustomized retiming solutions for desired throughput and program memory sizerequirements, while minimizing register pressure. An extensive set of experimentalresults is presented, demonstrating that our algorithm compares favorablywith one of the best state-of-the-art algorithms, achieving up to 50% improvementin performance and up to 47% improvement in register requirements. In orderto empirically assess the effectiveness of clustering for high ILP applications,additional experiments are presented contrasting the performance achievedby software pipelined kernels executing on clustered and on centralized machines.