User utility discovery for priority-based network resource pricing

While equilibrium analysis has been commonly used for network pricing under the assumption that user utility functions are precisely known, many researchers have criticized the validity of the assumption. In this paper, we propose a solution for bridging the gap between the existing theoretical work on optimal pricing and the unavailability of precise user utility information in real networks. In the proposed method, the service provider obtains increasingly more accurate estimates of user utility functions by iteratively changing the prices of service levels and observing the users’ service-level choices under various prices. Our study’s contribution is twofold. First, we have developed a general principle for estimating user utility functions. Especially, we present the utility estimation for dynamic user population. Second, we have developed a method for setting prices that can optimize the extraction of information about user utility functions. The extensive simulation results demonstrate the effectiveness of our method.     

Agent-based negotiation and decision making for dynamic supply chain formation

Modern businesses are facing the challenge of effectively coordinating their supply chains from upstream to downstream services. It is a complex problem to search, schedule, and coordinate a set of services from a large number of service resources under various constraints and uncertainties. Existing approaches to this problem have relied on complete information regarding service requirements and resources, without adequately addressing the dynamics and uncertainties of the environments. The real-world situations are complicated as a result of ambiguity in the requirements of the services, the uncertainty of solutions from service providers, and the interdependencies among the services to be composed. This paper investigates the complexity of supply chain formation and proposes an agent-mediated coordination approach. Each agent works as a broker for each service type, dedicated to selecting solutions for each service as well as interacting with other agents in refining the decision making to achieve compatibility among the solutions. The coordination among agents concerns decision making at strategic, tactical, and operational level. At the strategic level, agents communicate and negotiate for supply chain formation; at the tactical level, argumentation is used by agents to communicate and understand the preferences and constraints of each other; at the operational level, different strategies are used for selecting the preferences. Based on this approach, a prototype has been implemented with simulated experiments highlighting the effectiveness of the approach.     

基于分布式服务模型的遥感影像数据挖掘系统

依据遥感影像的特点及WCS标准,研究面向服务的遥感数据挖掘模式及其基于工作流的分布式系统架构。在此基础上,采用．Net体系及WSBPEL流程建模语言,设计一个遥感影像纹理关联规则的挖掘系统,并研究对大数据集的访问、网络资源占用、程序的可伸缩性等方面的实现技术,为Internet环境下遥感影像的处理提供了依据。     

电子信息系统中信息传输控制技术

信息传输控制技术是决定信息正确传输的关键,该文针对目前电子信息系统中信息传输的现状和特点,提出构件化网络传输控制服务软件的设计方法,采用相关信息传输控制技术,建立信息传输组件架构和传输控制机制应用于工程实践。结果证明,该技术设计解决了目前困扰信息传输的相关实际问题,在提高信息传输的灵活性、实时高效性和可靠性等方面取得了明显的效果。     

P2P环境下基于双层代理的服务发现模型

以集中式注册中心为核心的面向服务体系结构和以服务提供商为中心的服务组织模式容易导致用户发现和订阅服务的难度随着服务的增加而增加。针对上述问题,该文提出一种P2P环境下基于双层代理的语义Web服务发现模型。该模型通过双层代理机制实现基于语义的Web服务的发现和匹配,并提供服务质量协商机制。实验表明该模型具有较高的查全率和查准率。     

分布资源管理信息服务的研究与实现

针对分布资源管理中的信息服务问题,通过建立统一的资源信息模型,设计并实现能够集中、统一提供信息服务的资源信息服务器,测试和分析该资源信息服务器对整个系统性能的影响。结果证明能够提高整个分布式系统的性能。     

一种支持QoS约束的语义Web服务发现框架

针对当前语义Web服务发现缺乏QoS约束的问题,构建一个支持QoS约束的语义Web服务发现框架。使用QoS认证中心确保QoS信息的动态更新。基于该框架提出一种支持QoS约束的语义Web服务匹配算法,通过实验证明该框架的有效性和可用性。     

面向本体的服务组合差分进化策略

针对目前Web服务描述服务功能的语义不够深入而使服务识别组合能力欠佳的问题,提出一种面向本体的语义服务功能描述方法,建立本体间的映射关系模型和服务质量关系模型,通过改进差分进化算法求解,得到一种较好的服务组合识别方法。在九寨沟旅游管理信息系统中的应用表明,该方法比传统的方法优越。     

基于P2P的语义Web服务发现机制

分析集中式语义Web服务发现机制存在的问题,利用P2P和本体技术,提出一种基于P2P的语义Web服务发现机制。将服务的部署与发布无缝地绑定在一起,按应用领域和服务目标将整个P2P网络组织成3层结构,基于该结构建立3阶段服务发现算法,达到优化网络结构、提高服务发现效率的目的。     

ATM网络流量控制中的活动VC计算方法

ATM网络ABR业务流量控制是一种基于速率的流量控制机制。在ERICA算法的基础上,提出有效活动虚连接的计算方法,根据它们的活动度计算活动连接的有效数值,从而准确计算出处于活动状态的源端数,将未用带宽在ATM网络ABR连接之间公平且准确地进行分配,体现了Max-Min公平分配准则,能保证算法的高效性和带宽分配的公平性。