一种基于灵活市场的区分服务网络定价策略

基于区分服务的网络模型,提出了一种新的灵活市场的定价策略。为了使定价策略能够更好地应用在区分服务网络中,在边界路由器中使用了探测和反馈机制,并且对灵活市场定价策略中的竞标值进行了归一化处理。通过仿真实验验证了基于区分服务模型的灵活市场定价策略的自适应性。     

基于网格的视音频信息服务平台研究*

视音频信息处理技术是信息技术的重要组成部分,它的特点是需要处理的信息量大,信息管理、存储复杂,共享和交互的要求高。利用网格技术共享性和分布式的优势,在网格资源管理模块（GRAM）和存储模块（GASS）上构建视音频信息资源管理系统,在网格元计算目录服务模块（MDS）和安全认证中心（CA）上构建视音频信息服务和信息安全保障系统,从而构建了新一代具有共享性和交互性的视音频信息服务平台。它使得影视、娱乐和资讯等媒体信息更加融合在一起,在信息时代将有广泛的应用前景。     

语义标注元数据及其抽取技术*

讨论了语义Web上用XML或RDF/XML标注元数据的方法以及元数据标注在语义Web上的两种存在形式：单一文件或XML包。在此基础上,介绍了从这些单独文件或XML包宿主文件中抽取元数据的方法,包括XML解析器SAX和DOM以及XML包扫描器的构造。     

主动网络中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.