36054855
MQML-Message Queuing Markup Language
Message Queuing allows applications to use components that communicate with one another using queued messages. In this paper, we propose a Message Queuing Markup Language (MQML), which is an XML based markup language designed to describe e-business applications and enterprise integration. The MQML language is extensible. The detailed description of the MQML is presented in this paper. An research prototype is given to validate the effectiveness and value of our proposed MQML for enterprise integration.
5757371
A Semantic Framework for Distributed Applications
24114295
WS-EPM: Web services for enterprise project management
This work presents a new service-oriented architecture for enterprise project management that integrates business process, human resources and project management within an enterprise or across the value chain network. In the proposed WS-EPM framework, the project resources include business processes, skilled people, physical resources, control policies, and so forth. The project resources used in WS-EPM are described by WSResource properties language. In addition, the coordination of project resources is guided by a set of operations modeled by business process execution language for Web services (BPEL4WS). At the end of this paper, we present an industry application scenario that leverages the proposed WS-EPM for achieving maximum ROI with limited resources.
17426553
On-demand business collaboration enablement with web services
Businesses are increasingly outsourcing key operations and interacting with ever extending nets of partners. Running extended business-to-business (B2B) operations creates the need for more advanced human interaction while advancing the automation base of B2B functions. In this paper, we introduce a model for on-demand business process-based collaboration, namely, Extended Business Collaboration (eBC), and its major elements of modeling, and a configurable business protocol-enabling framework. We discuss some of the major research issues associated with facilitating extended business collaboration, and present our proposed Annotated Business HyperChain technology leveraging Web services and semantic annotation model. A research prototype is described, followed by some observations and discussion of open research issues requiring further exploration.
21758360
WS-trustworthy: a framework for Web services centered trustworthy computing
The emerging paradigm of Web services has been gaining significant momentum in the recent years since it offers a promising way to facilitate business-to-business (B2B) collaboration. However, it is not clear that this new model of Web services provides any measurable increase in computing trustworthiness. We propose a generic framework to control the trustworthiness of computing in the domain of Web services. A layered model is established to highlight four key elements: resources, policies, validation processes, and management. The robustness of this model exhibits its flexibility and extensibility. Examples utilizing our framework are reported.
6452442
A Method of Enabling Automated Invocation of Web Services
While Web services provide an essential building block for realizing dynamic e-business by facilitating standardsbased program-to-program interaction, they do not address many business aspects of communication such as security, access control, business partner selection, service level agreement monitoring, and logging. In this paper, we propose a service-oriented framework that provides these much needed infrastructure services. Using the framework, service providers can prepare their business applications for publishing as Web services, and specify access controls on their services in the registry while service requestors can find suitable service providers and invoke their services dynamically. The framework ensures that all transactions are secure, monitored for service level agreements and logged for audit purposes. By providing business utility services and automation technology founded on Web services, we believe that, our framework takes Web services to the next level in supporting dynamic e-business.
10515113
Validating SAT solvers using an independent resolution-based checker: practical implementations and other applications
As the use of SAT solvers as core engines in EDA applications grows, it becomes increasingly important to validate their correctness. In this paper, we describe the implementation of an independent resolution-based checking procedure that can check the validity of unsatisfiable claims produced by the SAT solver zchaff. We examine the practical implementation issues of such a checker and describe two implementations with different pros and cons. Experimental results show low overhead for the checking process. Our checker can work with many other modern SAT solvers with minor modifications, and it can provide information for debugging when checking fails. Finally we describe additional results that can be obtained by the validation process and briefly discuss their applications.
15556637
Proximity problems on moving points
A kinetic data structure for the maintenance of a multidimensional range search tree is introduced. This structure is used as a building block to obtain kinetic data structures for two classical geometric proximity problems in arbitrary dlmensions: the first structure maintains the closest pair of a set of continuously moving points, and is provably efficient. The second structure maintains a spanning tree of the moving points whose cost remains within some prescribed factor of the minimum spanning tree.
18786298
Robust Face Alignment Based on Hierarchical Classifier Network
Robust face alignment is crucial for many face processing applications. As face detection only gives a rough estimation of face region, one important problem is how to align facial shapes starting from this rough estimation, especially on face images with expression and pose changes. We propose a novel method of face alignment by building a hierarchical classifier network, connecting face detection and face alignment into a smooth coarse-to-fine procedure. Classifiers are trained to recognize feature textures in different scales from entire face to local patterns. A multi-layer structure is employed to organize the classifiers, which begins with one classifier at the first layer and gradually refines the localization of feature points by more classifiers in the following layers. A Bayesian framework is configured for the inference of the feature points between the layers. The boosted classifiers detects facial features discriminately from its local neighborhood, while the inference between the layers constrains the searching space. Extensive experiments are reported to show its accuracy and robustness.
52862068
Robust face alignment based on local texture classifiers
We propose a robust face alignment algorithm with a novel discriminative local texture model. Different from the conventional descriptive PCA local texture model in ASM, classifiers using LUT-type Haar-like features are trained from a large data set as local texture model. The strong discriminative power of the classifier greatly improves the accuracy and robustness of local searching on faces with expression variation and ambiguous contours. A Bayesian framework is configured for shape parameter optimization and the algorithm is implemented in a hierarchical structure for efficiency. Extensive experiments are reported to show its accuracy and robustness.
8920735
Partition-based decision heuristics for image computation using SAT and BDDs
Methods based on Boolean satisfiability (SAT) typically use a conjunctive normal form (CNF) representation of the Boolean formula, and exploit the structure of the given problem through use of various decision heuristics and implication methods. We propose a new decision heuristic based on separator-set induced partitioning of the underlying CNF graph. It targets those variables whose choice generates clause partitions with disjoint variable supports. This can potentially improve performance of SAT applications by decomposing the problem dynamically within the search. In the context of a recently proposed image computation method combining SAT and BDDs, this results in simpler BDD subproblems. We provide algorithms for CNF partitioning - one based on a clause-variable dependency matrix, and another based on standard hypergraph partitioning techniques, and also for the use of partitioning information in decision heuristics for SAT. The effectiveness of the proposed partition-based heuristic is shown with practical results for reachability analysis of benchmark sequential circuits.