主动网络中CPU和带宽资源分配的公平性

传统的包调度方案能实现单一资源分配的公平性,但不能直接应用于主动网络中的主动节点上,因为主动节点包含多种相互关联的资源。提出一种能实现在主动节点中公平分配资源的包调度算法。仿真实验结果显示,该算法能在主动流之间实现CPU和带宽资源的有效公平分配。     

基于XML远程教学资源管理系统的研究与应用*

为解决学习内容的合理组织所提出的知识体系结构的构建,以及知识体系结构与元数据的关系,研究了媒体素材库的学习对象元数据。根据学习内容的组织,结合有关标准规范,介绍了一个具体的远程教育资源管理系统的功能模块和结构,并讨论了用于系统开发的XML及其他相关技术。     

XML在分布式交互仿真系统数据管理中的应用研究

HLA的提出为解决分布式交互仿真系统中资源的重用和互操作性提供技术支持,而仿真资源逻辑层面上的重用和互操作性问题的解决有赖于规范的数据管理的实现。数据管理的主要工作体现在标准化描述仿真资源、定义通用标准的数据互换格式以及创建建模与仿真资源库系统三个方面,在讨论数据管理工作现状的基础上,提出了基于XML技术的解决方案,对XML技术在数据管理中的应用作了可行性分析,为实际工作的开展提供指导性的观点。     

CDMA网络中的综合业务接入策略*

为了解决CDMA网络中综合业务的协调传输问题,提出了资源竞争的策略。通过非实时类业务和实时类业务的分析,在考虑业务群体的Logistic变化规律的基础上,以总体QoS效果为追求目标,推导出竞争平衡方程。实验表明了该模型能够提高系统的整体容量。     

The contingent role of dependency in predicting the intention to adopt B2B e-commerce

ABSTRACT

A review of existing Electronic Commerce adoption literature reveals that the prevailing theoretical frameworks implicitly assume that organizations are independent and have complete control over their decisions to adopt innovations. Given the fact that organizations are often constrained by and depend on their environment and exchange partners to survive, this paper proposes that Resource Dependency can either be a facilitator or inhibitor of the role of Technological, Organizational, and Environmental (TOE) motivating factors. Using 239 valid responses from supply chain managers in Jordan, the study found partial support for the role of Resource Dependency as a moderator. The findings provide insights on how Resource Dependency between partners drives different patterns of innovation acceptance among potential adopters, regardless of several technological and organizational motivations to innovate. The results suggest that predicting how innovation is diffused within a market needs a detailed understanding of the inter-dependence structure among the supply chain members.     

Enhanced energetic reasoning-based lower bounds for the resource constrained project scheduling problem

We present new and effective lower bounds for the resource constrained project scheduling problem. This problem is widely known to be notoriously difficult to solve due to the lack of lower bounds that are both tight and fast. In this paper, we propose several new lower bounds that are based on the concept of energetic reasoning. A major contribution of this work is to investigate several enhanced new feasibility tests that prove useful for deriving new lower bounds that consistently outperform the classical energetic reasoning-based lower bound. In particular, we present the results of a comprehensive computational study, carried out on 1560 benchmark instances, that provides strong evidence that a deceptively simple dual feasible function-based lower bound is highly competitive with a state-of-the-art lower bound while being extremely fast. Furthermore, we found that an effective shaving procedure enables to derive an excellent lower bound that often outperforms the best bound from the literature while being significantly simpler.     

Probabilistic resource allocation in heterogeneous distributed systems with random failures

The problem of finding efficient workload distribution techniques is becoming increasingly important today for heterogeneous distributed systems where the availability of compute nodes may change spontaneously over time. Resource-allocation policies designed for such systems should maximize the performance and, at the same time, be robust against failure and recovery of compute nodes. Such a policy, based on the concepts of the Derman–Lieberman–Ross theorem, is proposed in this work, and is applied to a simulated model of a dedicated system composed of a set of heterogeneous image processing servers. Assuming that each image results in a “reward” if its processing is completed before a certain deadline, the goal for the resource allocation policy is to maximize the expected cumulative reward. An extensive analysis was done to study the performance of the proposed policy and compare it with the performance of some existing policies adapted to this environment. Our experiments conducted for various types of task-machine heterogeneity illustrate the potential of our method for solving resource allocation problems in a broad spectrum of distributed systems that experience high failure rates.     

Automatic parallelisation for LTI MIMO state space systems using FPGAs. An optimisation for cost & performance

The parallelism attained by the use of Field Programmable Gate Arrays (FPGAs) has shown remarkable potential for accelerating control systems applications. This comes at a time when well established methods based on inherited serial Central Processor Units (CPUs) cannot guarantee solutions for the increasing execution speed demands. However, the transition from serial to parallel architectures represents a tremendous challenge due to overwhelming numbers of unexplored options and conflicting factors. The work presented achieves a parallelisation characterisation for generic MIMO systems using stand-alone FPGA implementations. The main contribution is that a very fine subset of possible serial/parallel implementations is obtained. This is used to achieve a flexible trade-off between cost and performance. Automatic optimisation of latency, occupied FPGA area and execution speed is attained and justified in respect to most of the feasible scenarios.     

隐蔽流树方法的分析与改进

利用隐蔽流树方法搜索隐蔽通道时,获得的操作序列中只有极少部分真正构成隐蔽通道,增加了后续手工分析的工作量。为此,提出一种改进的隐蔽流树方法。根据信息流图进行建树,设计信息流规则,并给出隐蔽流树的自动分析算法。以一个文件系统为例进行分析,结果验证了改进方法的正确性。     

城市高清网络视频监控系统建设

随着国内外政治、治安局势的不断变化,城市高清网络视频监控系统已经成为公安机关依法履行职能打击违法犯罪的一个重要手段。本文介绍了一种城市高清网络视频监控系统建设方案及技术要求,并以此为框架进行概括总结,系统基本分为前端监控资源采集、监控资源接入、联网集中管理平台、图像资源存储以及图像资源共享平台建设等部分。