An institution theory of formal meta-modelling in graphically extended BNF

Meta-modelling plays an important role in model driven software development.In this paper,a graphic extension of BNF (GEBNF) is proposed to define the abstract syntax of graphic modelling languages.Fro...     

基于改进遗传算法的QoS感知Web服务组合

传统遗传算法在种群初始化的时候,普遍采用均匀取种法或随机取种法,这些方法生成的种群的平均适应度比较低,难以保证算法的搜索效率。文中提出一种改进的遗传算法用于QoS敏感的Web服务组合,采用两种不同的算法进行服务选择,避免了随机生成初始种群给算法带来的负面影响。并且,该算法将路径模板化以减少服务组合的工作量,用染色体可变长的编码方式来解决组合服务的多路径选择问题。通过仿真实验,与传统的算法相比,所提出的算法在实现服务组合时收敛更快,最优解的适应度更高。     

基于本体的主动元数据挖掘系统研究

传统网上信息检索是用户被动地依靠浏览超级链接网页而获取的。文中提出基于本体的主动元数据挖掘系统以及在果品领域的应用,在主动搜索、元数据生成、借助本体作用于数据的语义描述等方面,其效果是客观的。使得对信息数据的搜索从被动地获取到主动依靠计算机自动搜索;从依靠关键字作为查询依据到借助本体的作用获取语义描述的信息数据,进而提高了信息查询效率及查询的准确率,这也是当前信息检索研究的热门课题。实验证明,通过主动元数据挖掘实例可以实现语义的扩充,如同义、近义及上下位关系。同时也验证了本体对实施语义智能检索所带来的客观效果。     

DiffServ和MPLS相结合的流量工程机制

MPLSTE对传统的流量工程进行扩展,实现端到端的QoS保证,但是以流量中继为服务粒度。对流量缺乏区分服务的能力。DifIServ模型提供了区分服务,但是缺乏端到端的QoS有效路由策略。通过将MPLSTE的有效路由策略和DiffServ的区分服务相结合,引入区分服务感知的流量工程．运用带宽约束模型,在网络中实现端到端区分服务的QoS保证。     

园区网中QoS解决方案的研究

随着网络技术的发展,网络用户的增多以及各种大型实时的多媒体应用在园区网上实施,园区网在大学、公司和医院等企事业单位的生产和发展过程中发挥着越来越重要的作用,同时网络应用对网络服务的QoS提出更高的要求。本文介绍在园区网实施QoS方案的主要策略;分析DiffServ模型,DiffServ通过对园区网中的通信数据包进行分类和策略控制来达到调节网络资源的目的;探讨区分服务模型的实现,从而实现园区网的QoS保证。     

多机器人网络中资源公平分配的研究

就如何实现多机器人网络中各独立任务资源的公平分配及其服务质量最优化提出了一种新方法。该方法通过对增益控制参数的模糊控制,增强了系统的鲁棒性,并尽可能快速平稳地实现各项独立任务所需资源的公平分配。     

IPv6在QoS上的三项重要改进

本文主要分析了IPv6相对于IPv4在QoS上所做的基本报头、ICMP控制机制及基本报头中的QoS元素三项改进,从而为有效支持QoS提供理论支持。     

Routing with multiple quality-of-services constraints: An approximation perspective

Finding a path that satisfies multiple Quality-of-Service (QoS) constraints is vital to the deployment of current emerged services. However, existing algorithms are not very efficient and effective at finding such a path. Moreover, few works focus on three or more QoS constraints. In this paper, we present an enhanced version of fully polynomial time approximation scheme (EFPTAS) for multiconstrainted path optimal (MCOP) problem. Specifically, we make four major contributions. We first allow the proposed algorithm to construct an auxiliary graph, through which the QoS parameters on each of the finding path can be guaranteed not to exceed the given constraints. Then we adopt a concept, called nonlinear definition of path constraints in EFPTAS for reducing both time and space complexity. Also, we enable EFPTAS to run iteratively to facilitate a progressive refinement of the finding result. In addition to these, we identify some “deployment” issues for proposed algorithm, the essential steps that how and when the EFPTAS takes place are presented. By analyzing the proposed algorithm theoretically, we find that the presented EFPTAS can find a (1+ε)-approximation path in the network with time complexity O(|E||V|/ε) (where |E| is the number of edges and |V| is the number of nodes), which outperforms the previous best-known algorithm for MCOP. We conduct an extensive comparison between the algorithm presented in this paper and previous best-known study experimentally, our results indicate that EFPTAS can find a path with low complexity and preferable quality.     

Semantic analysis in XTRA,an English — Chinese machine translation system

This paper concerns the resolution of lexical ambiguity in a machine translation environment. We describe the integration of principles of selection restrictions. Preference Semantics, and intelligent relaxation of constraints in handling lexical ambiguity. The approach differs from many previous MT systems in that it is more powerful than brute force systems, while more realistic than systems that assume a large degree of coded encyclopedia information for full understanding.     

基于内容的静态语义概念视频检索方法研究

本文针对互联网视频检索技术的发展,阐述了目前主流视频搜索引擎的技术现状,分析了互联网视频检索的关键技术,特别是对于视频特征的提取技术。本文的创新点是提出了一种通用的基于内容的静态语义视频检索方法,该方法可以弥补基于文本视频检索的有关不足,并且在TRECVID的视频概念检索数据的静态语义概念中得到验证,运行稳定。