动态Web服务组合的选择策略

为了提高光网络资源的利用率,提出一种基于Petri网的Web服务组合最优化选择的方法.根据用户需求使用Petri网对服务组合之间的数据依赖关系建模,利用Petri网的T-不变量得到各种可能组合方案,并对于每种组合方案使用广义随机Petri网分析其性能.实验结果表明:该方法充分利用Petri网善于描述、分析、评价分布式系统的优点,得到性能最优的基于光网络资源的服务组合方案.     

基于有色Petri网的机械系统故障诊断研究

故障诊断对于机械系统的使用与维护起着重要的作用;为了提高机械系统故障诊断的效率以及直观性,提出了一种使用基于知识的故障诊断方法,即使用有色Petri网诊断方法建立一种通用机械系统故障诊断模型并进行分析。针对数控机床液压元件故障这一案例,首先获取其故障来源建立故障树;其次在故障树基础上运用有色Petri网建模工具CPNTools建立有色Petri网模型;最后对模型进行了仿真分析以模拟故障的传递,进行状态空间分析以判断模型安全性,结果表明所提出的建模方法能够使得故障传递更加直观化,快速了解故障的发展趋势,并表明此模型有着较强的易用性以及通用性。     

基于有色Petri网的工作流故障诊断方法

工作流系统的故障自动诊断和定位是云计算环境提供持续服务的基础。为了提高工作流系统的故障诊断准确性,本文提出了一种基于有色Petri网的故障诊断方法。首先,用开放世系模型对工作流进行建模。然后,提出了一种基于有色Petri网的故障模型。最后,将工作流的开放世系模型转化为有色Petri网故障模型,并提出了相应的多故障诊断方法。实验表明,本文提出的方法不仅故障定位的准确率和执行效率高于相关算法,还能有效的识别系统中的多个故障。     

光分组交换网络中多组光正交码组合光标签识别处理及实验

报道了光分组交换网络中基于多组光正交码组合光标签的识别与接收实验,光标签采用了码长为19,码重为3的2组光正交码组合光标签方案.给出了基于多组光正交码光标签的光分组交换网络(MOOC-OPS)基本原理,通过分析指出在MOOC-OPS网络中处理多组在时域上非连续、随机、突发光标签是现实MOOC-OPS关键技术之一.设计出了基于展宽网络和放大器级联方式接收多组低功率窄脉冲(MOOC-OPS网络的光标签)的实验方案,完成了实验电路板制作与实验验证.实验结果表明成功地实现了MOOC-OPS网络中周期为2ns基于多组光正交码光标签脉冲的识别接收,验证了该方案的可行性.     

基于排队PETRI网的云系统评估模型和方法

针对云系统规模庞大、构成复杂、动态性突出、层次关联性强而难于建模评估的问题,提出一种基于排队Petri网的云系统评估模型QPNC;QPNC结合了排队论和Petri网理论特点,模型具备较强的定量评价和行为描述能力,能够很好地对复杂云系统进行有效建模和模拟;基于上述模型,进一步提出并完善云系统的定量分析、评估体系,仿真并模拟了大规模并行环境下云系统的动态服务效果;实验结果表明,QPNC能够有效反映出各种云系统架构在性能和服务等方面特征,对云系统的各种动态服务行为具有很高的仿真度,为设计构建更加高效、更具针对性的云系统提供了定量分析支持和理论依据。     

基于AFPN的舰船电子综合化系统总线故障诊断研究

针对舰船电子综合化系统总线故障诊断模糊性、不确定性的日益增强,且难以实现快速故障诊断的难题,提出一种基于自适应模糊Petri网(Adaptive Fuzzy Petri Net,AFPN)的舰船电子综合化系统总线故障诊断方法;在加权模糊Petri网(Weighted Fuzzy Petri Net,WFPN)的基础上,引入神经网络技术,给出了AFPN的形式化定义及学习算法;实例分析验证了所提方法的有效性,研究表明:AFPN模型具有很强的自适应能力和推理能力,克服了传统单纯依靠人工经验故障诊断的不确定性和偶然性,可以实现舰船电子综合化系统总线快速精确的故障诊断。     

基于相干光码分多址技术的隐藏通信系统仿真

提出了光域隐藏通信的概念以及评价其性能的指标:隐藏性、可用性和稳健性,给出了基于现有光纤通信体制的三种光域隐藏通信方案及其对系统配置的要求.使用光纤通信系统仿真软件对所提出的方案进行了仿真研究,针对现有的光纤宿主信道的特点,提出了采用码移键控(CSK)平衡调制方式和基于等效相移超结构光纤光栅(EPS-SSFBG)双边带编/解码器的系统配置方案以提高系统的性能.结果表明,该方法各项性能指标良好.在信噪比为-13 dB,信号完全隐藏在信道噪声中的情况下,仍然能够以1.25 Gb/s的速率保持通信,能够抑制隐藏系统与宿主系统间的相互影响,是一种具有较高应用价值的光域隐藏通信方法.     

基于层次Petri网的复杂装备保障流程分析方法

针对复杂装备保障流程约束条件多、动态性强、耦合严重、层次结构复杂的特点,提出了一种基于层次Petri网的流程分析方法;首先,分析了保障流程的层次化结构,采用着色时间约束Petri网,建立了包含保障人员、保障设备、保障空间等保障资源库所的层次化Petri网流程模型;然后,采用流程基本模型起始时间——流程子网起始时间——流程总时间的层次方法,设计了流程时间参数统计算法;最后,以某复杂装备系统保障流程为例,进行了实例分析,并通过与ExSpect软件Monte Carlo仿真对比验证了算法的有效性。     

一种多波长OCDMA解码器方案及其性能分析

提出了一种多波长OCDMA（MW OCDMA）系统的光解码器方案,通过多个光硬限幅器来抑制多用户干扰.分析了使用该解码器的MW OCDMA误码率性能、频谱效率和归一化吞吐量性能.分析结果表明,该方案能有效改善MW OCDMA系统的误码率性能,在要求的误码率条件下增加同时用户数,从而能有效改善MW OCDMA系统的频谱效率.同时,采用光硬限幅器的MW OCDMA 系统的归一化吞吐量性能明显提高,特别是归一化吞吐量峰值提高了约一倍.     

光交叉连接节点的功能结构

光交叉连接(OXC)是未来波分复用光传送网实现交换与选路功能的核心部件.目前,OXC节点的物理结构得到深入研究,已经提出了一些采用不同光子器件的OXC实现方案.本文从描述光交叉连接功能的角度出发,给出一种分析OXC节点功能结构的模型,并比较各种OXC方案在功能结构上的差异。     

Open critical area model and extraction algorithm based on the net flow-axis

In the integrated circuit manufacturing process, the critical area extraction is a bottleneck to the layout optimization and the integrated circuit yield estimation. In this paper, we study the problem that the missing material defects may result in the open circuit fault. Combining the mathematical morphology theory, we present a new computation model and a novel extraction algorithm for the open critical area based on the net flow-axis. Firstly, we find the net flow-axis for different nets. Then, the net flow-edges based on the net flow-axis are obtained. Finally, we can extract the open critical area by the mathematical morphology. Compared with the existing methods, the nets need not to divide into the horizontal nets and the vertical nets, and the experimental results show that our model and algorithm can accurately extract the size of the open critical area and obtain the location information of the open circuit critical area.     

基于时间Petri网的综合航电系统时序验证分析

综合航电系统是一种对可靠性、实时性要求非常高的嵌入式应用系统。为了解决针对复杂应用场景下综合航电系统的处理时间和工作时序预估较困难、且计算自动化程度不高等测试验证问题,提出了一种基于时间约束Petri网的综合航电系统时序验证和分析方法。给出了时间约束Petri网的形式化定义,分析了综合航电系统工作流程中各节点的时间属性,通过引入时序约束路径的概念,并提出了时序推理算法。通过在仿真算例中进行计算并对比实际运行数据,结果表明该方法在针对综合航电系统运行时序的验证分析方面具有有效性。     

Hybrid neural nets with poisson and gaussian connectivities

The dynamic behavior of neural nets with different patterns of interneuronal synaptic connectivity is investigated. Our method is based on probabilistic neural nets for the net structure and dynamics. Each net is divided into several different subsystems, which are characterized by different distribution laws for the number of connections that the neurons make. We start from the binomial distribution, which, under appropriate conditions, reduces to the Poisson and Gaussian distributions. The overall net now acquires a hybrid character. The expression for the neural activity is generalized to include this effect, and new expressions are derived, based on the isolated single-net equations. The dynamics of nets with sustained external inputs is also studied. The results obtained by this approach also show multiple stability and multiple hysteresis effects, as in the case of single nets. The differences between pure Poisson, Gaussian, and hybrid nets are explained in terms of the structural properties of the model. As expected, the hybrid case falls in between the two other distributions. Finally, we performed Monte Carlo computer calculations for the hybrid nets. For the range of parameters examined we find very good agreement with the developed formalism     

Models in Boundary Quantum Field Theory Associated with Lattices and Loop Group Models

In this article we give new examples of models in boundary quantum field theory, i.e. local time-translation covariant nets of von Neumann algebras, using a recent construction of Longo and Witten, which uses a local conformal net on the real line together with an element of a unitary semigroup associated with . Namely, we compute elements of this semigroup coming from H?lder continuous symmetric inner functions for a family of (completely rational) conformal nets which can be obtained by starting with nets of real subspaces, passing to its second quantization nets and taking local extensions of the former. This family is precisely the family of conformal nets associated with lattices, which as we show contains as a special case the level 1 loop group nets of simply connected, simply laced groups. Further examples come from the loop group net of at level 2 using the orbifold construction.     

民航大涵道比涡扇发动机总体性能参数敏感性分析

由于人为误操作和数据库系统异步因素,电力系统监控数据存在错误风险,需要对监控数据进行多点校核来保障其一致性和正确性,可靠的监控数据保证电力系统的安全运转。然而多点校核业务流复杂且对数据精度要求高,目前的人工校核方法不仅成本高,且精度和效率低,不能保证整个监控数据的实时校核工作。为自动化监控数据多点校核过程,需要对整个业务流建模,针对该问题,提出一种基于Petri网的监控数据多点校核动态建模方法。首先将监控系统的校核业务背景形式化Petri网中的具有不同约束的节点;然后使用工作流Petri方法对校核的业务流程进行形式化定义、并将该业务流程用Petri网建模成为网状模型;最后,针对该模型提出一种化简技术对其进行化简,并证实该化简方法的有效性和该模型能拟合监控数据多点校核的整个流程。     

Particle Shape Analysis as an example of knowledge extraction by neural nets

An investigation is presented concerning the ability of neural nets to classify particles using contour data. Different nets were trained to classify limestone, quartz and coffee particles by their outer boundaries. The contour lines of the analysed particles were similar and differed only in a complex way. A new method of interpreting the Fourier coefficients is shown, which might lead to a possibility of defining particle shape classes by examples. Information is given concerning the selection and design of the appropriate neural net, e.g. back-propagation, and self-organizing maps. In addition, a possibility of interpreting the trained neural nets is demonstrated.     

A New Light on Nets of C*-Algebras and Their Representations

The present paper deals with the question of representability of nets of C*-algebras whose underlying poset, indexing the net, is not upward directed. A particular class of nets, called C*-net bundles, is classified in terms of C*-dynamical systems having as group the fundamental group of the poset. Any net of C*-algebras has a canonical morphism into a C*-net bundle, the enveloping net bundle, which generalizes the notion of universal C*-algebra given by Fredenhagen to nonsimply connected posets. This allows a classification of nets; in particular, we call injective those nets such that the canonical morphism is faithful. Injectivity turns out to be equivalent to the existence of faithful representations. We further relate injectivity to a generalized Čech cocycle of the net, and this allows us to give examples of nets exhausting the above classification.     

A novel sensitivity model for short nets

For modern processes at deep sub-micron technology nodes, yield design, especially the design at the layout stage is an important way to deal with the problem of manufacturability and yield. In order to reduce the yield loss caused by redundancy material defects, the choice of nets to be optimized at first is an important step in the process of layout optimization. This paper provides a new sensitivity model for a short net, which is net-based and reflects the size of the critical area between a single net and the nets around it. Since this model is based on a single net and includes the information of the surrounding nets, the critical area between the single net and surrounding nets can be reduced at the same time. In this way, the efficiency of layout optimization becomes higher. According to experimental observations, this sensitivity model can be used to choose the position for optimization. Compared with the chip-area-based and basic- layout-based sensitivity models, our sensitivity model not only has higher efficiency, but also confirms that choosing the net to be optimized at first improves the design.     

Superselection Theory for Subsystems

An inclusion of observable nets satisfying duality induces an inclusion of canonical field nets. Any Bose net intermediate between the observable net and the field net and satisfying duality is the fixed-point net of the field net under a compact group. This compact group is its canonical gauge group if the occurrence of sectors with infinite statistics can be ruled out for the observable net and its vacuum Hilbert space is separable. Received: 23 December 1999 / Accepted: 25 November 2000