通用鱼雷模拟器适应性软件开发

提出一种具有动态重配置功能的分布式仿真系统成员适应性软件构架,开发通用鱼雷模拟器的适应性软件,它由接口通信层、需求管理层、适应性重配层以及功能实现层构成,给出软件开发所需的关键技术,包括动态重配引擎、可配置化构件模型与功能构件库。利用该通用鱼雷模拟器适应性软件进行实例测试,结果验证了其可行性与有效性。     

动态节点质心定位改进算法

为降低无线传感器网络的定位误差,提高动态节点的定位精度和定位覆盖度,使节点定位能够应用于动态环境下,基于传统的定位算法,提出了一种新的动态节点定位改进算法。该算法通过未知节点接收、保存的分组信息来循环组成虚拟三角形,同时依靠内点测试方法来判断未知节点自身位置,最后根据质心算法来进行最终定位。将仿真结果与传统算法进行比较,结果表明,改进算法可以大大提高无线传感器网络的定位精度和覆盖度。     

随机非线性动态系统数值模拟与性态分析

针对具有随机参数非线性系统和随机非线性系统的数值模拟与性态分析问题,提出将蒙特卡罗模拟办法与数值积分法相结合,建立了迭代积分算法求取随机非线性系统在不副随机序列作用下的数值解集,分析了计算误差．其次,利用数值解集的样本值进行解过程性态分析,建立了系统状态的概率分布、均方和矩函数的数值汁箅公式,实现了该类系统数值模拟分析的完整算法和程序流程设计．最后,通过两类典型示例系统的数值仿真结粜验证本文算法与流程的正确性和有效性．     

网络演算的矩阵解释

网络演算是离散事件动态系统理论在计算机网络中的应用,网络演算通过到达曲线和服务曲线计算网络的性能参数,这两个概念封装了复杂的理论背景,从而易于在实际中应用,但对到达曲线和服务曲线概念的理论研究比较缺乏.文中采用幂等矩阵的角度描述到达曲线和服务曲线,演算的过程成为矩阵运算,通过结合矩阵双子理论和余理论的研究结果,得出了由矩阵表演算的基本定理.研究表明,幂等矩阵理论为网络演算提供了很好的理论解释.文中还提出一种基于变换矩阵的方法求某些网络元素的服务曲线.     

信任感知的组合服务动态选择方法

把信任概念和信任度引入到服务组合中来,讨论了信任感知的服务组合选择问题,分别基于两种观点建立了其数学模型.并基于观点1,深入地研究了服务组合的动态选择问题,分别采用蚁群系统作为优化工具设计了两种动态选择方法:方法1针对服务在上限阈值的范围内提供优质服务,服务质量保持不变,超过阈值则拒绝服务的情况;方法2针对服务无限制地接受请求,但随着请求数量的增多,其服务质量下降的情况.通过对方法1和方法2的仿真实验结果分析表明,两种方法具有很好的效果.     

Concurrency control in mobile distributed real-time database systems

This paper presents DMVOCC-2PLV (Distributed Multiversion Optimistic Concurrency Control with Two-Phase Local Validation) protocol for processing mobile distributed real-time transactions in mobile broadcast environments. In DMVOCC-2PLV protocol, transaction validation is performed at two levels: local validation and global validation. Local validation of transactions is performed in two phases: local pre-validation and local final validation. At the MHs (Mobile Hosts), all mobile transactions perform local pre-validation of transactions by using a backward validation mechanism. The local pre-validation process is carried out against committed transactions at the server in the last broadcast cycle. Such an early data conflict detection feature can save processing and communication resources. Transactions that survive in local pre-validation must be submitted to the server for local final validation. In global validation distributed update transactions have to check to ensure distributed serializability in all participants. The protocol can eliminate conflicts between mobile read-only and mobile update transactions, and resolve data conflicts flexibly using multiversion dynamic adjustment of serialization order to avoid unnecessary restarts of transactions. Mobile read-only transactions can be committed with no-blocking, and respond time of mobile read-only transactions is greatly reduced. The tolerance of mobile transactions of disconnections from the broadcast channel is increased. The results of simulation experiment show that the new protocol proposed offers better performance in terms of miss rate, restart rate, commit rate and throughput.     

DMM:A dynamic memory mapping model for virtual machines

Memory virtualization is an important part in the design of virtual machine monitors(VMM).In this paper,we proposed dynamic memory mapping(DMM) model,a mechanism that allows the VMM to change the mapping between a virtual machine's physical memory and the underlying hardware resource while the virtual machine is running.By utilizing DMM,the VMM can implement many novel memory management policies,such as Demand Paging,Swapping,Ballooning,Memory Sharing and Copy-On-Write,while preserving compatibility with va...     

Iterative Learning Control for uncertain systems: Robust monotonic convergence analysis

In this paper, we present a novel Robust Monotonic Convergence (RMC) analysis approach for finite time interval Iterative Learning Control (ILC) for uncertain systems. For that purpose, a finite time interval model for uncertain systems is introduced. This model is subsequently used in an RMC analysis based on μ analysis. As a result, we can handle additive and multiplicative uncertainty models in the RMC problem formulation, analyze RMC of linear time invariant MIMO systems controlled by any linear trial invariant ILC controller, and formulate additional straightforward RMC conditions for ILC controlled systems. To illustrate the derived results, we analyze the RMC properties of linear quadratic (LQ) norm optimal ILC.     

Platform‐independent profiling in a virtual execution environment

Virtual execution environments, such as the Java virtual machine, promote platform‐independent software development. However, when it comes to analyzing algorithm complexity and performance bottlenecks, available tools focus on platform‐specific metrics, such as the CPU time consumption on a particular system. Other drawbacks of many prevailing profiling tools are high overhead, significant measurement perturbation, as well as reduced portability of profiling tools, which are often implemented in platform‐dependent native code. This article presents a novel profiling approach, which is entirely based on program transformation techniques, in order to build a profiling data structure that provides calling‐context‐sensitive program execution statistics. We explore the use of platform‐independent profiling metrics in order to make the instrumentation entirely portable and to generate reproducible profiles. We implemented these ideas within a Java‐based profiling tool called JP. A significant novelty is that this tool achieves complete bytecode coverage by statically instrumenting the core runtime libraries and dynamically instrumenting the rest of the code. JP provides a small and flexible API to write customized profiling agents in pure Java, which are periodically activated to process the collected profiling information. Performance measurements point out that, despite the presence of dynamic instrumentation, JP causes significantly less overhead than a prevailing tool for the profiling of Java code. Copyright © 2008 John Wiley & Sons, Ltd.