基于HLA/RTI的客户/服务员模型的实现

主要研究HLA/RTI体系结构,应用HLA的理论对经典的客户/服务员模型建立对应的联邦对象模型和仿真对象模型,并利用HLA/RTI结构实现了该模型,最后给出了实现代码和试验测试数据,对于不同的客户数目跟有关的平均服务时间参数之间的关系做了探讨,有利于更进一步对HLA体系进行研究.     

基于HLA/RTI的电子商务平台的构建

电子商务平台是一种分布式的软件体系，HLA／RTI是一种作为分布式仿真的软件体系，探讨了在HLA／RTI建立电子商务平台的可行性，分析了电子商务中的对象模型和网络模型，为减少网络冗余量而分析了区域分割的算法。     

基于MOM的HLA/RTI管理盟员的设计与实现

为了在仿真运行过程中对联盟、盟员以及RTI进行监控，HLA中引入了管理对象模型(MOM)，该模型是HLA／RTI架构中的重要组成部分。该文介绍了IEEEl516规范中定义的MOM，并在此基础上对其进行了扩展。结合我们StarLink RTI的开发实践，提出了通过代理盟员实现MOM的设计方案，在该RTI中实现了对MOM的支持。最后在此基础上，设计并实现了管理盟员StarFM。     

基于HLA结构的分布交互仿真的系统设计问题

对基于HLA/RTI结构的分布交互式多机仿真系统的体系结构、底层通信网络、运行支持系统、仿真应用对象模型和管理对象模型进行了论述,旨在为分布仿真应用系统的开发探索一条有效途径。     

HLA/RTI中的数据管理服务研究及实现

数据管理是RTI一项重要内容，从仿真支撑环境开发的角度讲，数据管理有更为广义的概念。该文分析了HLA／RTI数据管理的原理，结合AST-RTI的开发，给出了HLA／RTI数据管理的一个实现框架，针对其中的关键技术，如静态数据结构、基本数据结构和类的派生关系，给出了原理和实现方法，同时用实际的仿真结果验证了框架的优越性，最后指出了下一步的工作重点和方向。     

基于HLA的火车站行李监测系统仿真开发

HLA是分布交互仿真的高层体系结构,它为复杂系统建模与仿真提供了公共的技术支撑框架.针对火车站的行李监测系统,提出了基于HLA的仿真开发设计.研究了系统的体系结构和工作原理,在此基础上着重论述了联邦仿真平台的构成和基于联邦开发和执行过程模型(FEDEP)的开发过程,进行了对象类和交互类的开发,对系统中主要的成员对象进行了联邦对象模型(FOM)和仿真对象模型(SOM)设计,给出了基于运行支撑框架(RTI)的仿真程序.     

基于HLA/RTI实现的网络对弈

本文介绍了HLA／RTI的主要功能和作用以及基于HLA／RTI应用程序的结构。说明了基于HLA／RTI的网络围棋的使用方法，并结合基于RTI网络围棋的开发过程，讲解了其编程实现的部分关键技术。拳文对学习和理解HLA／RTI理论和相关技术，以厦开发基于RTI的分布交互式仿真软件有一定的启发作用。     

基于SVPN的HLA／RTI安全机制

针对传统高阶体系结构,运行支撑框架（HLA／RTI）分布仿真系统的链路安全问题,设计并实现基于仿真虚拟专用网（SVPN）的RTI安全扩展模块。阐述传统HLA／RTI体系的信息流程,得到联邦间主要信息链路,并对仿真系统的信息安全进行分析,给出RTI安全扩展的具体安全目标。对具体的实施方案进行论述,给出系统的软件功能模块之间的逻辑关系,分析SVPN环境FHLA仿真应用的运行过程。     

Simulink/Stateflow仿真程序的HLA兼容性改造设计

该文从数据结构入手，宏观分析了Simulink／Stateflow仿真模型在进行HLA(高层体系结构)兼容性改造过程中所涉及的主要问题及步骤。主要包括由RTW(实时工作室)所生成的Simulink／Stmeflow模型C代码的通用运行框架，模型程序的SOM(仿真对象模型)开发，模型程序的HLA软件接口设计等。特别是针对HLA软件接口的设计与实现过程中存在许多重复性的工作，提供了一个将Simulink／Stateflow模型程序自动转化为HLA联邦成员且能适用于不同联邦的工具软件框架结构，从而为基于HAL仿真系统的Simulink／Stateflow仿真模型开发提供一条优化途径。     

HLA/RTI的执行结构与实现研究

高层体系结构(HLA)是新一代计算机仿真的标准,运行支撑环境(RTI)是HLA仿真体系的核心组件,已成为仿真界研究的热点。为了揭示基于HLA/RTI的仿真应用的开发具体实现,了解RTI的本质和精髓,提出了RTI的执行结构框架,揭示了RTI开发的三个对象要素与RTI的六大服务间的关系,并总结出了RTI的三种实现方式,包括集中式、分布式和层次式,对它们各自的特点进行了阐述。     

M/G/c/K blocking probability models and system performance

An exact solution for the M/G/c/K model is only possible for special cases, such as exponential service, a single server, or no waiting room at all. Instead of basing the approximation on an infinite capacity queue as is often the case, an approximation based on a closed-form expression derivable from the finite capacity exponential queue is presented. Properties of the closed-form expression along with its use in approximating the blocking probability of M/G/c/K systems are discussed. Extensive experiments are provided to test and verify the efficacy of our approximate results.     

设计模式变体的描述与验证*

为解决标准设计模式演化后难以检测的问题,引入设计模式变体思想,以Bridge模式为例,给出了八种常用的变体实现,并以人工形式挖掘了四种开源系统中Bridge模式变体的基准数,接着在Apache Ant1.6.2与JHotDraw5.1开源系统中通过六种主流设计模式检测工具进行了变体检测实验。试验结果表明,FCA-CBR方法简单有效,对2种开源系统中Bridge模式变体检测的精确率达到60%与48.1%,与先前方法相比有了较大的提高。     

(r∞, n12, s12) measurements on the 2-CPU CRAY X-MP

We report performance measurements made on the 2-CPU CRAY X-MP at ECMWF, Reading. Vector (SIMD) performance on one CPU is interpreted by the two parameters ($\text{r}{}_{\mathrm{\infty }}\text{, n}{}_{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}$), and we find for dyadic operations using FORTRAN $\text{r}{}_{\mathrm{\infty }}\text{= 70}\text{Mflop/s}\text{, n}{}_{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}\text{= 53}\text{flop}$. All vector triadic operations produce $\text{r}{}_{\mathrm{\infty }}\text{= 107}\text{Mflop/s}\text{, n}{}_{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}\text{= 45}\text{flop}$; and a triadic operation with two vectors and one scalar gives r_∞ = 148 Mflop/s and $\text{n}{}_{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}\text{= 60}\text{flop}$. MIMD performance using both CPUs on one job is interpreted with the two parameters ($\text{r}{}_{\mathrm{\infty }}\text{, s}{}_{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}$), where $\text{s}{}_{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}$ is the amount of arithmetic that could have been done during the time taken to synchronize the two CPUs. We find, for dyadic operations using the TSKSTART and TSKWAIT synchronization primitives, that r_∞ = 130 Mflop/s and $\text{s}{}_{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}\text{= 5700}\text{flop}$. This means that a job must contain more than ～ 6000 floating-point operations if it is to run at more than 50% of the maximum performance when split between both CPUs by this method. Less expensive synchronization methods using LOCKS and EVENTS reduces $\text{s}{}_{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}$ to 4000 flop and 2000 flop respectively. A simplified form of LOCK synchronization written in CAL code further reduces $\text{s}{}_{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}$ to 220 flop. This is probably the minimum possible value for synchronization overhead on the CRAY X-MP.     

Complex random sample scheduling and its application to an N/M/F/Fmax problem

“Complex Random Sample Scheduling(CRSS)” was proposed in this paper as an efficient heuristic method for solving any permutation scheduling problems. To show the effectiveness of the proposed CRSS, it was applied to an N-job, M-machine, permutation flowshop scheduling problem to minimize makespan, N/M/F/F_max. Numerical experiments made it clear that the proposed CRSS provides a schedule very close to the near-optimal schedule obtained by the existing promising heuristic methods such as taboo search and simulated annealing, within less computation time than these heuristic methods.     

On the M/Ck/1 queue

We obtain the exact analytic expression of the probability distribution of the number of units in a single server queue with Poisson arrivals and Coxian service time distribution (notated as M/C_k/1). A recursive procedure for calculating this probability distribution is given. The well-known queues M/E_k/1 and M/D/1 are re-derived as special cases of the M/C_k/1 queue. Finally, the cases of M/C₂/1 and M/C₃/1 are fully worked out.     

Geom/G/1/n system with LIFO discipline without interrupts and constrained total amount of customers

Consideration was given to the discrete-time queuing system with inversive servicing without interrupts, second-order geometrical arrivals, arbitrary (discrete) distribution of the customer length, and finite buffer. Each arriving customer has length and random volume. The total volume of the customers sojourning in the system is bounded by some value. Formulas of the stationary state probabilities and stationary distribution of the time of customer sojourn in the system were established.     

Efficient implementation of Johnson''s rule for the n/2/F/Fmax scheduling problem

Several efficient algorithms of O(n log n) computational complexity, for the Johnson's rule to schedule a set of simultaneously available jobs on two machines in a flowship to minimize the maximum job flowtime have appeared in the literature. A modified version of one of these algorithms is presented which not only simplifies the programming effort for implementation but is also able to generate all possible optimal sequences obtainable from Johnson's rule.     

Intuitionistic fuzzy Hv-submodules

After the introduction of fuzzy sets by Zadeh, there have been a number of generalizations of this fundamental concept. The notion of intuitionistic fuzzy sets introduced by Atanassov is one among them. In this paper, we apply the concept of an intuitionistic fuzzy set to H_v-modules. The notion of an intuitionistic fuzzy H_v-submodule of an H_v-module is introduced, and some related properties are investigated. Characterizations of intuitionistic fuzzy H_v-submodules are given.     

Properties and performance modelling of finite buffer M/G/1/K networks

Finite buffer, single-server queueing systems and networks are difficult to analyze since the length of time a customer spends in the system does not follow the Markovian property. A two-moment approximation schema is developed for the probability distribution of M/G/1/K systems and extended to the analysis of M/G/1/K   queueing networks. The general purpose of this paper is to develop a flexible and practical transform-free approach for computing the probability distribution and performance measures of the system as well as identify the underlying properties of these systems. It is shown that for most performance measures, a sigmoid or S-shaped curve with an inflection point at ρ=1$\rho =1$ appears as K→∞$K\to \infty$. This has direct implications for the analysis and optimization of such systems. The performance modelling of the M/G/1/K queueing networks of general topologies along with extensive numerical results accompany the paper along with the linear concave performance measures for these systems.