32965761
The Next Big Thing: Web Services Collaboration
In this paper, we introduce the lifecycle of a Web services solution that consists of Web services modeling, development, deployment, publishing, as well as discovery, composition and collaboration, plus monitoring and analytical control. Then some research and development challenges of building a Web services solution in the context of Web services solution lifecycle are described. Especially, we present an emerging Web services research direction, namely, Web services collaboration, followed by a few major research issues associated with facilitating extended business collaboration using Web services and semantic annotation.
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.
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.
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.
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.
17122130
A dynamic services discovery framework for traversing Web Services representation chain
In this paper, we propose a dynamic service discovery framework from Web services representation chain. The major components include Web service chains precategorizing module, service exploration engine, services container, chain change detection module with associated control parameters. From the working research prototype, our proposed mechanism enables businesses to easily retrieve up-to-date Web services linked and nested multi-level deep in the service description documents. In addition, a federated Web services discovery portal is illustrated to show how the research results are aggregated from hyperlinked WSIL documents as well as UDDl registries for achieving more accurate services exploration result.
9760560
An edge-guided image interpolation algorithm via directional filtering and data fusion
Preserving edge structures is a challenge to image interpolation algorithms that reconstruct a high-resolution image from a low-resolution counterpart. We propose a new edge-guided nonlinear interpolation technique through directional filtering and data fusion. For a pixel to be interpolated, two observation sets are defined in two orthogonal directions, and each set produces an estimate of the pixel value. These directional estimates, modeled as different noisy measurements of the missing pixel are fused by the linear minimum mean square-error estimation (LMMSE) technique into a more robust estimate, using the statistics of the two observation sets. We also present a simplified version of the LMMSE-based interpolation algorithm to reduce computational cost without sacrificing much the interpolation performance. Experiments show that the new interpolation techniques can preserve edge sharpness and reduce ringing artifacts
1882847
User Feedback-Based Refinement for Web Services Retrieval using Multiple Instance Learning
A critical step in the process of reusing existing WSDL-specified components is the discovery of potentially relevant Web services. Traditional category based Web service retrieval usually can achieve good recall but worse precision because some semantically relevant Web services are not actually relevant as they cannot provide suitable interfaces. In this paper, we present an interactive Web services retrieval mechanism to refine the coarse retrieval results set in category based retrieval. In the refinement, the signature matching of Web services that concerning the structure of operation specifications is investigated from a multi-instances view. In detail, each Web service is represented as a bag in multiple instance learning, while each operation in this Web service is regarded as an instance. This representation lies in that a user regards a service as useful if at least one operation provided by this Web service is useful. Experimental results show that our approach can improve the retrieval performance significantly: It can gain 83% precision in average after two rounds of user relevance feedback
41094552
The Statistical Inference Method in Heuristic Search Techniques
In this paper we present a new heuristic searching algorithm by introducing statistical inference method on the basic of algorithm A*. It's called algorithm SA*. The following results have been proved. (1) Algorithm SA* in superior to algorithm A*. (2) The mean complexity of SA* is CN2, but in some case A* exhibits exponential complexity (eN). (3) In a (N,d,F)- game tree, the mean complexity of SA* is CN2, but the complexity of other known game-searching algoritham (α-β , SSS* etc.) is at least dN. (4) The maximal storage-space required by SA* is C,N. 
 
This shows that under a given significance level SA* is superior to other known algorithm (e.g. A*, B*, α-β, SSS* etc.).
6035916
Ranking web objects from multiple communities
Vertical search is a promising direction as it leverages domain-specific knowledge and can provide more precise information for users. In this paper, we study the Web object-ranking problem, one of the key issues in building a vertical search engine. More specifically, we focus on this problem in cases when objects lack relationships between different Web communities, and take high-quality photo search as the test bed for this investigation. We proposed two score fusion methods that can automatically integrate as many Web communities (Web forums) with rating information as possible. The proposed fusion methods leverage the hidden links discovered by a duplicate photo detection algorithm, and aims at minimizing score differences of duplicate photos in different forums. Both intermediate results and user studies show the proposed fusion methods are practical and efficient solutions to Web object ranking in cases we have described. Though the experiments were conducted on high-quality photo ranking, the proposed algorithms are also applicable to other ranking problems, such as movie ranking and music ranking.
887255
An automated design tool for analog layouts
In this paper, a layout synthesis tool for the design of analog integrated circuits (ICs) is presented. This tool offers great flexibility that allows analog circuit designers to bring their special design knowledge and experiences into the synthesis process to create high-quality analog circuit layouts. Different from conventional layout systems that are limited to the optimization of single devices, our layout generation tool attempts to optimize more complex modules. This tool includes a complete tool suite that covers the following three major analog physical designs stages. 1) Module Generation: designers can develop and maintain their own technology- and application-independent module generators for subcircuits using an in-house developed description language. 2) Placement: a two-stage placement technique, tailored for the analog placement design, is proposed. In particular, this placement algorithm features a novel genetic placement stage followed by a fast simulated reannealing scheme. 3) Routing: the minimum-Steiner-tree-based global routing is developed, and it is actually integrated into the placement procedure to improve reliability and routability of the placement solutions. Following the global routing, a compaction-based constructive detailed routing finally completes the interconnection of the entire layout. Several testing circuits have been applied to demonstrate the design efficiency and the effectiveness of this tool. Experimental results show that this new layout tool is capable of producing high quality layouts comparable to those manually done by layout experts but with much less design time