A Framework for Designing Distributed Management Applications

This paper presents a methodology for thespecification and design of multi-domain managementsystems that control, monitor and administer users andservices in a distributed telecommunication environment. It presents a framework, which serves as ablueprint for the design and implementation ofdistributed management applications. It defines a set ofconcepts and methods for guiding the analysis, design, and implementation phases of managementapplications, which are distributed over heterogeneoussystems. The framework is based on concepts ofTelecommunications Management Networks and OpenDistributed Processing, and is partially developed withinthe Pan-European Reference Configuration for IBC(Integrated Broadband Communication) Services Management(PRISM) project.     

一种非线性数字滤波器的统一设计框架及其性能分析

文章旨在研究非线性数字滤波器的统一设计框架问题.基于稳健统计理论和双边滤波思想,首先建立了一种鲁棒的图像复原统一能量泛函.该能量泛函充分融合了双边滤波的双重异性加权机制和稳健ρ-函数对边缘奇异点的鲁棒性处理机制,因而具有更强的边缘保持能力.随后,基于图像复原统一能量泛函的欧拉-拉格朗日方程,导出一种非线性数字滤波器的统一设计框架.特别地,在此统一框架下,双边滤波、数字TV滤波以及自适应平滑均可进行相应的扩展.同时,文中系统比较了各种稳健ρ-函数在边缘保持方面的鲁棒性,并提出一种新型边缘保持性稳健ρ-函数,即ρ(x)=-σ2(1 |x|/σ)exp(-|x|/σ) σ2.不论是视觉效果方面还是峰值信噪比方面,大量实验结果验证了文中统一设计框架的合理性和新型稳健p-函数的边缘保持性.     

Alternative Distributed Algorithms for Network Utility Maximization: Framework and Applications

Network utility maximization (NUM) problem formulations provide an important approach to conduct network resource allocation and to view layering as optimization decomposition. In the existing literature, distributed implementations are typically achieved by means of the so-called dual decomposition technique. However, the span of decomposition possibilities includes many other elements that, thus far, have not been fully exploited, such as the use of the primal decomposition technique, the versatile introduction of auxiliary variables, and the potential of multilevel decompositions. This paper presents a systematic framework to exploit alternative decomposition structures as a way to obtain different distributed algorithms, each with a different tradeoff among convergence speed, message passing amount and asymmetry, and distributed computation architecture. Several specific applications are considered to illustrate the proposed framework, including resource-constrained and direct-control rate allocation, and rate allocation among QoS classes with multipath routing. For each of these applications, the associated generalized NUM formulation is first presented, followed by the development of novel alternative decompositions and numerical experiments on the resulting new distributed algorithms. A systematic enumeration and comparison of alternative vertical decompositions in the future will help complete a mathematical theory of network architectures.     

一个统一的异构对象持久化框架

以大型对象系统PG—RELIEF为对象,考察一般大型对象系统在持久化管理上的需求,然后提出基于面向对象范型的统一对象持久化框架并对之进行分析。     

Framework for Task Scheduling in Heterogeneous Distributed Computing Using Genetic Algorithms

An algorithm has been developed to dynamically schedule heterogeneous tasks on heterogeneous processors in a distributed system. The scheduler operates in an environment with dynamically changing resources and adapts to variable system resources. It operates in a batch fashion and utilises a genetic algorithm to minimise the total execution time. We have compared our scheduler to six other schedulers, three batch-mode and three immediate-mode schedulers. Experiments show that the algorithm outperforms each of the others and can achieve near optimal efficiency, with up to 100,000 tasks being scheduled     

统一的数字几何处理框架

随着三维几何模型在工业界的广泛应用，处理几信号的算法变得越来越重要。尽管近几年数字几何处理研究有了很大的进展，仍然缺乏一个类似于数字图像处理的统一解决方案。该文提出了任意网格的数字信号处理框架，很好地满足了这一需求。该框架的核心思想是通过为任意网格模型构造一个全局球面（或平面）参数化，把模型的所有属性转化为定义在球面（或平面）上的信号，然后采用球面（或平面）正交分析工具对这些信号做分析处理。在这两个框架下，所有的数字图像处理技术都可以被扩展到网格模型。该文还给出了包括滤波、多分辨率编辑和压缩在内的几种典型应用的实现方法和试验结果。     

面向跨领域情感分类的统一框架

文本的情感分类问题,即判断文本中的论断是持支持态度还是反对态度.已有的研究表明,监督分类方法对情感分类很有效.但是多数情况下,已有的标注数据与待判断情感类别的数据不属于同一个领域,此时监督分类算法的性能明显下降,由此产生的即为跨领域情感分类问题.为解决此问题,提出一个统一框架,分多阶段进行跨领域情感分类:首先利用训练域文本的准确标签来得到测试域文本的初始标签;然后将测试域建成一个加权网络,将一些较准确的测试文本作为"源点"和"汇点",进一步利用热传导思想迭代进行跨领域情感分类.实验结果表明,此方法能大幅度提高跨领域情感分类的精度.     

视频镜头边界检测的统一策略

随着计算机和影视技术的发展，用来有效地组织、索引和检索海量视频数据的基于内容的视频检索系统吸引了众多学者的兴趣，而自动镜头边界检测是实现基于内容的视频检索的一个重要步骤。因此，为了有效地进行视频镜头边界检测，在介绍现有的镜头边界检测基本方法的基础上，提出了一种镜头边界检测的统一策略。由于它是在综合考虑视频的颜色特征和时间特征的基础上来建立基于幅值映射的1维视频特征曲线，并利用小波分析对信号奇异点的检测能力和对噪声具有较强的鲁棒性，首先实现了镜头边界的预检测；同时利用1维特征曲线在镜头边界区间中表现出的良好统计特性实现了对渐变镜头的进一步分类，进而实现了在统一检测框架下的镜头边界检测。实验结果表明，该算法能够有效地检测出视频镜头边界。     

A Tutorial for Designing Flexible Geometric Algorithms

The implementation of an algorithm is faced with the issues of efficiency, flexibility, and ease-of-use. In this paper we suggest a design concept that greatly increases the flexibility of an implementation without sacrificing ease-of-use and efficiency. We demonstrate the advantages of our concept through a C++ implementation of a simple rectangle-intersection algorithm, which follows the well-known sweep-line paradigm. We lead the reader, who should be familiar with C++ and its template mechanism, from a naive interface in a step-by-step guide to an interface offering full flexibility. The gain in flexibility can reduce the overall implementation effort by facilitating code reuse. Reusability in turn helps to achieve correctness simply because more users mean more testing. Though most of the ingredients of our concept have already been suggested elsewhere, to our knowledge this is the first time that they are applied vigorously in a geometric setting. We include a thorough experimental analysis on random and real-world data. Received October 30, 1998; revised June 11, 2001.     

A Mathematical Framework for Designing a Low-Loss, Low-Delay Internet

We survey some recent results on modeling, analysis and design of congestion control schemes for the Internet. Using tools from convex optimization and control theory, we show that congestion controllers can be viewed as distributed algorithms for achieving fair resource allocation among competing sources. We illustrate the use of simple mathematical models to analyze the behavior of currently deployed Internet congestion control protocols as well as to design new protocols for networks with large capacities, delays and general topology. These new protocols are designed to nearly eliminate loss and queueing delay in the Internet, yet achieving high utilization and any desired fairness.     

A Unified Framework for Gesture Recognition and Spatiotemporal Gesture Segmentation

Within the context of hand gesture recognition, spatiotemporal gesture segmentation is the task of determining, in a video sequence, where the gesturing hand is located and when the gesture starts and ends. Existing gesture recognition methods typically assume either known spatial segmentation or known temporal segmentation, or both. This paper introduces a unified framework for simultaneously performing spatial segmentation, temporal segmentation, and recognition. In the proposed framework, information flows both bottom-up and top-down. A gesture can be recognized even when the hand location is highly ambiguous and when information about when the gesture begins and ends is unavailable. Thus, the method can be applied to continuous image streams where gestures are performed in front of moving, cluttered backgrounds. The proposed method consists of three novel contributions: a spatiotemporal matching algorithm that can accommodate multiple candidate hand detections in every frame, a classifier-based pruning framework that enables accurate and early rejection of poor matches to gesture models, and a subgesture reasoning algorithm that learns which gesture models can falsely match parts of other longer gestures. The performance of the approach is evaluated on two challenging applications: recognition of hand-signed digits gestured by users wearing short-sleeved shirts, in front of a cluttered background, and retrieval of occurrences of signs of interest in a video database containing continuous, unsegmented signing in American Sign Language (ASL).     

归约算法统一描述

归约算法在并行计算中应用广泛,目前有很多归约算法应用于不同的情形。这些归约算法各不相同, 逻辑拓扑是 造成区别的关键 。为了统一描述归约算法,揭示它们的共性,给出了一个逻辑拓扑的定义及其性质。在此基础上,给出了归约算法的统一描述,以利于对归约算法的理解,从而设计适应不同应用和环境的归约算法。该描述也可视为可集成不同语义的归约算法框架,从而有助于设计具有新语义的归约算法。本质上,该统一描述是一个归约算法形式定义,有助于验证归约算法的正确性。     

A Unified Framework for Cohesion Measurement in Object-Oriented Systems

The increasing importance being placed on software measurement has led to an increased amount of research developing new software measures. Given the importance of object-oriented development techniques, one specific area where this has occurred is cohesion measurement in object-oriented systems. However, despite a very interesting body of work, there is little understanding of the motivation and empirical hypotheses behind many of these new measures. It is often difficult to determine how such measures relate to one another and for which application they can be used. As a consequence, it is very difficult for practitioners and researchers to obtain a clear picture of the state-of-the-art in order to select or define cohesion measures for object-oriented systems. This situation is addressed and clarified through several different activities. First, a standardized terminology and formalism for expressing measures is provided which ensures that all measures using it are expressed in a fully consistent and operational manner. Second, to provide a structured synthesis, a review of the existing approaches to measure cohesion in object-oriented systems takes place. Third, a unified framework, based on the issues discovered in the review, is provided and all existing measures are then classified according to this framework. Finally, a review of the empirical validation work concerning existing cohesion measures is provided. This paper contributes to an increased understanding of the state-of-the-art: a mechanism is provided for comparing measures and their potential use, integrating existing measures which examine the same concepts in different ways, and facilitating more rigorous decision making regarding the definition of new measures and the selection of existing measures for a specific goal of measurement. In addition, our review of the state-of-the-art highlights several important issues: (i) many measures are not defined in a fully operational form, (ii) relatively few of them are based on explicit empirical models as recommended by measurement theory, and (iii) an even smaller number of measures have been empirically validated; thus, the usefulness of many measures has yet to be demonstrated.     

A Unified Active Learning Framework for Biomedical Relation Extraction

Supervised machine learning methods have been employed with great success in the task of biomedical relation extraction.However,existing methods are not practical enough,since manual construction of large training data is very expensive.Therefore,active learning is urgently needed for designing practical relation extraction methods with little human effort.In this paper,we describe a unified active learning framework.Particularly,our framework systematically addresses some practical issues during active learning process,including a strategy for selecting informative data,a data diversity selection algorithm,an active feature acquisition method,and an informative feature selection algorithm,in order to meet the challenges due to the immense amount of complex and diverse biomedical text.The framework is evaluated on proteinprotein interaction(PPI) extraction and is shown to achieve promising results with a significant reduction in editorial effort and labeling time.     

A Generic Framework for Distributed Multirobot Cooperation

DEMiR-CF is a generic framework designed for a multirobot team to efficiently allocate tasks among themselves and achieve an overall mission. In the design of DEMiR-CF, the following issues were particularly investigated as the design criteria: efficient and realistic representation of missions, efficient allocation of tasks to cooperatively achieve a global goal, maintenance of the system coherence and consistency by the team members, detection of the contingencies and recover from various failures that may arise during runtime, efficient reallocation of tasks (if necessary) and reorganization of team members (if necessary). DEMiR-CF is designed to address different types of missions from the simplest to more complex ones, including missions with interrelated tasks and multi-resource (robot) requirements. Efficiency of the framework is validated through experiments in three different types of domains.     

一个面向分布式程序的测试系统框架

提出了一个面向分布式程序的测试系统框架TFDS(test system framework for distributed software system),并介绍了它在异构网络中的一个实现原型PSET*(distributed progra m structure and event trace, revised version).框架的主要功能是对分布式程序进行单 元测试和集成测试.包括面向规约设计和源码分析的静态部分和面向程序执行和事件序列分 析的动态部分.在构件的基础上,PSET*的功能可以较容易     

A Library Hierarchy for Implementing Scalable Parallel Search Algorithms

This paper describes the design of the Abstract Library for Parallel Search (ALPS), a framework for implementing scalable, parallel algorithms based on tree search. ALPS is specifically designed to support data-intensive algorithms, in which large amounts of data are required to describe each node in the search tree. Implementing such algorithms in a scalable manner is challenging both because of data storage requirements and communication overhead. ALPS incorporates a number of new ideas to address this challenge. The paper also describes the design of two other libraries forming a hierarchy built on top of ALPS. The first is the Branch, Constrain, and Price Software (BiCePS) library, a framework that supports the implementation of parallel branch and bound algorithms in which the bounds are obtained by solving some sort of relaxation, usually Lagrangian. In this layer, the notion of global data objects associated with the variables and constraints is introduced. These global objects provide a connection between the various subproblems in the search tree, but they pose further difficulties for designing scalable algorithms. The other library is the BiCePS linear integer solver (BLIS), a concretization of BiCePS, in which linear programming is used to obtain bounds in each search tree node.     

Algorithms for Distributed Constraint Satisfaction: A Review

When multiple agents are in a shared environment, there usually exist constraints among the possible actions of these agents. A distributed constraint satisfaction problem (distributed CSP) is a problem to find a consistent combination of actions that satisfies these inter-agent constraints. Various application problems in multi-agent systems can be formalized as distributed CSPs. This paper gives an overview of the existing research on distributed CSPs. First, we briefly describe the problem formalization and algorithms of normal, centralized CSPs. Then, we show the problem formalization and several MAS application problems of distributed CSPs. Furthermore, we describe a series of algorithms for solving distributed CSPs, i.e., the asynchronous backtracking, the asynchronous weak-commitment search, the distributed breakout, and distributed consistency algorithms. Finally, we show two extensions of the basic problem formalization of distributed CSPs, i.e., handling multiple local variables, and dealing with over-constrained problems.