Petri网在计算机网络实时性分析中的应用

计算机网络实时性分析问题一直是国内外各知名院校、研究机构的研究重点之一。Petri网是一种可以描述系统动态行为特性的图形化建模工具,直观形象,易于学习和理解,便于使用。为此,在给出Petri网基本介绍的基础上,探讨了Petri网在计算机网络实时性分析中的应用价值。     

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

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

BP神经网络在上海住宅市场需求预测中的应用

人工神经网络是近期发展最快的人工智能领域研究成果之一 ,本文在介绍 BP神经网络的有关原理的基础上 ,建立了一个上海住宅市场的 BP神经网络模型 ,并通过该模型对上海住宅市场的需求进行了预测和分析 .分析结果表明人工神经网络方法在住宅市场需求预测中的应用是可行的并且是有效的 .     

中压变频器在宣钢炼钢厂除尘风机中的应用

本文介绍了SIMOVERT MV中压变频器在宣钢炼钢厂一次除尘风机中的应用情况。变频器现场运行表明，采用中压变频器对转炉除尘风机进行调速节能获得了成功，节能效果明显。     

FMS scheduling based on timed Petri Net model and reactive graph search

This paper presents a new scheduling method for manufacturing system based on the Timed Petri Net model and a reactive fast graph search algorithm. The following two typical problems are addressed in this paper. (1) Minimization of the maximum completion time. (2) Minimization of the total tardiness. As for the problem (1), a new search algorithm which combines the RTA^∗ and a rule-based supervisor is proposed. As for problem (2), the original Petri Net model is converted to its reverse model and the algorithm developed for the problem (1) is applied, regarding the due date as the starting time in the reverse model. Some numerical experiments are carried out to demonstrate usefulness of our algorithm.     

局域网服务器缓冲区容量的Petri网设计方法

本文在分析局域网服务器信息缓冲区、数据包接受和发送缓冲区的相互关系基础上提出一种新的局域网服务器缓冲区设计方法─—广义随机Ｐｅｔｒｉ网方法，并给出了局域网服务器信息缓冲区的广义随机Ｐｅｔｒｉ网模型。该设计方法理论完备、严谨实用，且不再局限于追求某一边界值（上限或下限），并且避免了排队理论处理多级服务的繁琐公式。最后本文用一例题说明了这种方法的应用。     

CIMS软件开发工具：Petri网编辑器的语法分析及其实现

本文给出并发表达式语言的文法，并描述了Petri网编辑器的语法分析过程和中间代码的产生过程。解决了Petri网在计算机中的存贮结构问题，处理了可能会出现的重名变量，实现了从井发表达式语言到安全标号的Petri网的转换工作。     

Direct and simultaneous spectrofluorometric determination of naproxen and salicylate in human serum assisted by chemometric analysis

A direct method for the simultaneous determination of naproxen and salicylate in human serum is reported, based on a combination of spectrofluorometric measurements with two multivariate calibration techniques: partial least-squares (PLS-1) and the novel net analyte preprocessing (NAP). The method is rapid, selective and sensitive, and is based on the measurement of the fluorescence spectra of NH₃ alkalinized whole human sera at the excitation wavelength of 315 nm. It can be applied within the ranges of concentrations 50-200 ng ml⁻¹ for naproxen and 100-300 ng ml⁻¹ for salicylate. The employed chemometric techniques have been compared on the basis of the statistical indicators for calibration and validation. Reproducibility and interference studies in abnormal sera have also been carried out.     

Chip-Firing Games on Directed Graphs

We consider the following (solitary) game: each node of a directed graph contains a pile of chips. A move consists of selecting a node with at least as many chips as its outdegree, and sending one chip along each outgoing edge to its neighbors. We extend to directed graphs several results on the undirected version obtained earlier by the authors, P. Shor, and G. Tardos, and we discuss some new topics such as periodicity, reachability, and probabilistic aspects.Among the new results specifically concerning digraphs, we relate the length of the shortest period of an infinite game to the length of the longest terminating game, and also to the access time of random walks on the same graph. These questions involve a study of the Laplace operator for directed graphs. We show that for many graphs, in particular for undirected graphs, the problem whether a given position of the chips can be reached from the initial position is polynomial time solvable.Finally, we show how the basic properties of the probabilistic abacus can be derived from our results.     

拓扑系统的紧性和分离性

考察拓扑系统的两种紧性——空间式紧和locale式紧,给出紧性的若干刻画,讨论了两种紧性的相互关系,证明了拓扑系统的两种紧性都是拓扑空间紧性的良好推广,说明了紧拓扑系统的闭子拓扑系统、有限和系统以及积系统仍是紧拓扑系统。最后在拓扑系统中考察了紧性加强分离性的问题,得到了紧,(强)T2拓扑系统为(强)T3,(强)T4拓扑系统等结论,并用理想收敛刻画了拓扑系统的强T2分离性。