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.
19524119
Challenges and Opportunities for Web Services Research - Editorial Preface
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.
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.
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.
22235359
Towards an Optimization-Based Method for Consolidating Domain Variabilities in Domain-Specific Web Services Composition
In this paper, we put forward an automatic method of acquiring the specific system composition model from a domain composition model and requirements for the specific system in domain-specific Web services composition. This is referred to as the variability consolidation problem in this paper. To achieve this goal, we designed a language to describe domain properties for Web services composition. The basis of our approach is to transform the domain composition model and the requirements for the specific system into a mathematical optimization problem, which can be solved by existing algorithms. Thus, this method is fully automatic and not prone to human errors. Our preliminary experimental results show that our method is quite feasible for solving problems with real world sizes.
3761715
A multicommodity flow model for distributed stream processing
The rapid development of computer technology has enabled streaming applications to emerge from many areas of the IT industry. A fundamental problem in such stream processing systems is how to best utilize the available resources so that the overall system performance is optimized. In most real time systems, applications are often running in a decentralized, distributed environment. At any given time, no server has the global information about all the servers in the system. It is thus desirable to have distributed solutions capable of adapting to or absorbing local changes in production rates and in network conditions. This paper addresses the fundamental resource allocation question in the distributed stream processing setting. Specifically, we consider a generic model for stream processing systems. Each stream is required to complete a series of tasks to become finished product. Each server is responsible for a subset of the processing tasks for possibly a subset of the streams. All servers have finite computing resources and all communication links have finite available bandwidth. We consider the resource allocation problem so as to maximize the total throughput of the system. Our problem can be described as a generalization of the traditional multicommodity flow problem [1]. Traditional multicommodity flow problem looks for the best way to use of the link capacities to deliver the maximum throughput for the flows in the whole network. In our problem, in addition to the link bandwidth constraints, we also have processing power constraints for each server. Furthermore, we allow flow shrinkage or expansion so as to model operations such
17378411
A multi-property trust model for reconfiguring component software
While component software continues to grow in size and complexity, it becomes increasingly difficult to ensure qualities for component services, especially at run-time. This paper focuses on a framework on middleware for dynamic re-configuration of components of different qualities from the view of trust. Firstly, a trust management model is built, in which the management framework and measurement model are presented. Secondly, the reconfiguration algorithm is described based on the model. Thirdly, the trust management is implemented as a kind of public services and some tools on a J2EE-compliant middleware platform, i.e., PKUAS. Finally, the related work is discussed and compared with our research.
2226313
Fourier harmonic approach for visualizing temporal patterns of gene expression data
DNA microarray technology provides a broad snapshot of the state of the cell by measuring the expression levels of thousands of genes simultaneously. Visualization techniques can enable the exploration and detection of patterns and relationships in a complex dataset by presenting the data in a graphical format in which the key characteristics become more apparent. The purpose of this study is to present an interactive visualization technique conveying the temporal patterns of gene expression data in a form intuitive for nonspecialized end-users. The first Fourier harmonic projection (FFHP) was introduced to translate the multidimensional time series data into a two dimensional scatter plot. The spatial relationship of the points reflect the structure of the original dataset and relationships among clusters become two dimensional. The proposed method was tested using two published, array-derived gene expression datasets. Our results demonstrate the effectiveness of the approach.
11907465
Deformable Free-Space Tilings for Kinetic Collision Detection†
We present kinetic data structures for detecting collisions between a set of polygons that are moving continuously. Unlike classical collision detection methods that rely on bounding volume hierarchies, our method is based on deformable tilings of the free space surrounding the polygons. The basic shape of our tiles is that of a pseudo-triangle, a shape sufficiently flexible to allow extensive deformation, yet structured enough to make detection of self-collisions easy. We show different schemes for maintaining pseudo-triangulations as a kinetic data structure, and we analyze their performance. Specifically, we first describe an algorithm for maintaining a pseudo-triangulation of a point set, and show that the pseudo-triangulation changes only quadratically many times if points move along algebraic arcs of constant degree. In addition, by refining the pseudo-triangulation, we show triangulations of points that only change about O(n 7 / 3 ) times for linear motion. We then describe an algorithm for maintaining a pseudo-triangulation of a set of convex polygons. Finally, we extend our algorithm to the general case of maintaining a pseudo-triangulation of a set of moving or deforming simple polygons.