入侵检测技术及其在高校网络中的重要性

我国加入WTO后，计算机网络工程建设飞速发展。高校间的国际交流日益增多，因此网络安全的重要性不言而喻，入侵检测作为维护网络安全的生力军，不仅能在网络安全方面发挥作用。对于振兴我国的民族信息产业也是一个契机。     

银行系统网络运行现存的若干问题和解决建议

通过对银行系统网络现状的分析，从广域网和局域网两个不同的角度指出了银行现有的网络结构、体系存在的问题及其原因，并提出了较为可行的解决方法，对现在的大型网络系统有普遍的意义。     

校园网设计规划研究

以西南交大郫县新校区的校园网规划为例,简述了整个校园网设计规划方案.     

基于防火墙的网络安全技术

分析了当前网络安全所面临的严峻问题,分析了网络攻击的主要手段,并就此提出了采用防火墙来实现网络安全的方法,叙述了防火墙的原理及体系结构,以及构建防火墙的几种方案.     

一种安全的IP网络模型的构建

本文介绍了网络安全的现状以及网络安全威胁的概念，从而提出了一种安全的IP网络模型。其主要由四大技术组件组成，既安全身份识别、安全传送、安全防御和安全监控，并对每个组件进行详细的分析，最后肯定了这种IP网络模型是安全的。     

智能化校园的实现技术

从智能化建筑的概念出发,引出智能化校园的含义,探讨智能化校园的功能及实现技术.     

Circuit-switching networks with FIFO plus justifying blockout service on infinite graphs

A class of circuit-switching open queueing networks is discussed. The main result of the paper is that if extra message flows are not too intensive and the path distribution is mainly concentrated on the paths of (graph) distance 1 (nearest neighbour connections), then the network has a unique stationary working regime, no matter how large the configuration graph of the network is. Standard properties of this regime are established such as decay of correlation and continuity.     

Markovian network processes: Congestion-dependent routing and processing

A Markovian network process describes the movement of discrete units among a set of nodes that process the units. There is considerable knowledge of such networks, often called queueing networks, in which the nodes operate independently and the routes of the units are independent. The focus of this study, in contrast, is on networks with dependent nodes and routings. Examples of dependencies are parallel processing across several nodes, blocking of transitions because of capacity constraints on nodes, alternate routing of units to avoid congestion, and accelerating or decelerating the processing rate at a node depending on downstream congestion. We introduce a general network process representing the numbers of units at the nodes and derive its equilibrium distribution. This distribution takes the form of a product of functions of vectors in which the arguments of the functions satisfy an interchangeability property. This new type of distribution may apply to other multi-variate processes as well. A basic idea in our approach is a linking of certain micro-level balance properties of the network routing to the processing rates at the nodes. The link is via routing-balance partitions of nodes that are inherent in any network. A byproduct of this approach is a general characterization of blocking of transitions without the restriction that the process is reversible, which had been a standard assumption. We also give necessary and sufficient conditions under which a unit moving in the network sees a time average for the unmoved units (called the MUSTA property). Finally, we discuss when certain flows between nodes in an open network are Poisson processes.This research was sponsored in part by Air Force Office of Scientific Research contract 84-0367.     

模糊集合论在矿山控制网布设和图纸质量评定中的应用

应用模糊数学方法研究和处理矿山测量中存在的具有“模糊性”的问题。例如控制网布设方案及矿山测量图纸质量的综合评判。它能更准确地描述用精确数学模型难以描述的问题。     

Minimum concave cost production system: A further generalization of multi-echelon model

We will consider a concave minimization problem associated with a series production system in which raw material is processed inm consecutive facilities. The products at some facility are either sent to the next facility or stocked in the warehouse. The amount of demand for the final products during periodi, i = 1,,n, are known in advance. Our problem is to minimize the sum of processing, holding and backlogging cost, all of which are assumed to be concave.The origin of this model is the classical economic lot size problem of Wagner and Whitin and was extensively studied by Zangwill. This model is very important from the theoretical as well as practical point of view and this is one of the very rare instances in which polynomial time algorithm has been constructed for concave minimization problems.The purpose of this paper is to extend the model further to the situation in which time lag is associated with processing at each facility. We will propose an efficient O(n ⁴ m) algorithm for this class of problems.