36776709
XML-based Advanced UDDI Search Mechanism for B2B Integration
5757371
A Semantic Framework for Distributed Applications
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.
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.
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.
3127272
An Experimental Assessment of the 2D Visibility Complex
We make an experimental assessment of the size of the 2D visibility complex of disjoint unit discs randomly distributed in the plane with density $\mu$. We observe that the number of free bitangents is asymptotically linear in the number of discs and we study the dependence of the linear asymptote in terms of the density of the scene. Specifically, for a particular range of scene densities $\mu$, we exhibit an approximation of the number of free bitangents in terms of $\mu$ and the number $n$ of discs, for $n$ larger than some function of $\mu$. We also notice how our approximation gained for rather large densities can be used to guess the onset of the linear behavior for small densities.
205876162
Independence and connectivity in 3-domination-critical graphs
Let δ, γ, κ and α be, respectively, the minimum degree, the domination number, the con nectivity and the independence number of a graph G. The graph G is 3-domination-critical if γ = 3 and the addition of any edge decreases γ by 1. In this paper, we prove that if G is a 3-domination-critical graph, then α ≤ κ + 2; and moreover, if κ ≤ δ -1, then α ≤ κ + 1. We also give a short proof of Wojcicka's result, which says that every connected 3-domination-critical graph of order at least 7 contains a hamiltonian path (J. Graph Theory 14 (1990) 205).
16359335
Scalable relevance feedback using click-through data for web image retrieval
Relevance feedback (RF) has been extensively studied in the content-based image retrieval community. However, no commercial Web image search engines support RF because of scalability, efficiency and effectiveness issues. In this paper we proposed a scalable relevance feedback mechanism using click-through data for web image retrieval. The proposed mechanism regards users' click-through data as implicit feedback which could be collected at lower cost, in larger quantities and without extra burden on the user. During RF process, both textual feature and visual feature are used in a sequential way. To seamlessly combine textual feature-based RF and visual feature-based RF, a query concept-dependent fusion strategy is automatically learned. Experimental results on a database consisting of nearly three million Web images show that the proposed mechanism is wieldy, scalable and effective.
8611890
Relevancy based semantic interoperation of reuse repositories
Software reuse is a promising solution to the software crisis. Reuse repositories are the basic infrastructure for software reuse. During the past decade, various academic, commercial, governmental, and industrial organizations have developed many Internet-enabled reuse repositories to provide access to software components and related resources. It has necessitated semantic interoperation to allow distributed maintenance and management of these repositories while enabling users to efficiently and conveniently access resources from multiple reuse repositories via a single representation view. In this paper, we have proposed an approach to enhancing the semantic interoperability of reuse repositories, called the improved relevancy matching and ranking (IRMR) method, based on analyzing the correlation of terms in representation methods of the repositories. A prototype system, the Virtual Repository supporting Semantic Interoperation (VRSI), is presented to illustrate the application of this approach to support the semantic interoperation of reuse repositories. Experimental results on real world reuse repositories demonstrated significant improvement in terms of searching effectiveness.
469745
An opportunistic video scheduling algorithm over shared wireless downlink
This paper presents a novel video scheduling algorithm for streaming MPEG video over multi-user shared wireless link, in which video sessions are scheduled based on both location-dependent channel condition and instantaneous frame delay. This algorithm also employs a pro-active frame discard mechanism to discard potential problematic frames. The numerical results show that the proposed algorithm is able to significantly improve link throughput and guarantee long-term fairness.