Investigating, Modeling, and Ranking Interface Complexity of Web Services on the World Wide Web

Today, web service plays a huge part where multiple applications used by people in their daily lives such as weather information or healthcare for accessing data. Therefore, our study takes an important study on why the web service discovery algorithm is a better option over available web services on the internet. Web service and various web platforms in tracking and updating information; for instance, in recent research, a high-efficiency interface for web service was discovered to make use of semantics, abbreviation, and fragment combination of user input which is OPD (Operation Discovery Algorithm), rather than the traditional algorithm. However, a problem identification where the end-user still needed a refined solution of using high trusted value. On the other hand, a re-ranking approach among the output result in between the recommended web services discovery need to perform by the organization. Further, OPD can be enhanced using efficient web service discovery, along with the highest public recommendation.

SOA and Web Services allow to easily expose business functions to build larger distributed systems. However, legacy systems – mostly in COBOL – are left aside unless applying a migration approach. Main approaches are: direct and indirect migration. The former implies to wrap COBOL programs with a thin layer of a Web Service oriented language/platform. The latter needs reengineering COBOL functions to a modern language/platform. In a previous work, we presented an intermediate approach based on direct migration where developed Web Services are later refactored to improve their interfaces quality. Refactorings mainly capture good practices inherent to indirect migration. In this paper, we measure the complexity of Web Services’ interfaces generated by the three approaches. Both comprehension and interoperability can be affected according to the service interface complexity level. We apply a metric suite (by Baski & Misra) to measure complexity on services interfaces – i.e., WSDL documents. Migrations of two real COBOL systems upon the three approaches were compared on the complexity level of the generated WSDL documents.

The overwhelming need to improve the quality of complex data structures in healthcare is more important than ever. Although data quality has been the point of interest in many studies, none of them has focused on the development of quantitative and explainable methods for data imputation. In this work, we propose a "smart" imputation workflow to address missing data across complex data structures in the context of in silico clinical trials. AI algorithms were utilized to produce high-quality virtual patient profiles. A search algorithm was then developed to extract the best virtual patient profiles through the definition of a profile matching score (PMS). A case study was conducted, where the real dataset was randomly contaminated with multiple missing values (e.g., 10 to 50%). In total, 10000 virtual patient profiles with less than 0.02 Kullback-Leibler (KL) divergence were produced to estimate the PMS distribution. The best generator achieved the lowest average squared absolute difference (0.4) and average correlation difference (0.02) with the real dataset highlighting its increased effectiveness for data imputation across complex clinical data structures.

The Geospatial Information that service from public organizations and authorities are significantly increasing e.g., JPL OnEarth, GeoBrain, Google, and so on. Those geospatial information services rely on various existing Web technologies such as Web Service, OGC Web Services, REST, and GeoRSS. There are several formats of geospatial data which are published via the standard protocol HTTP such as GML, KML, Shapefile, and GeoTiff. Currently, a number of researches in geosciences community focus on geospatial services integration. The geospatial services integration is jointly defined and introduced by OGC and ISO TC 2111. The services integration is defined in term of service chaining: Transparent chaining, Translucent chaining, and Opaque chaining. This paper reports a research which focuses on Translucent chaining in which public user is allowed to predefine a service chain and execute it via Workflow enactment service. A process definition language is applied to coordinate across XML-based interfaces and support services chaining among Web Service, OGC Web Service, and REST. WPS-T (Transactional Web Processing Service as Workflow enactment service) is implemented and used to introduce a scalable framework. Complex geospatial operation can be managed by sequencing a number of simple operations from service itself or other services into a single operation. A geospatial service chain can then be executed as a single service operation, and it also can be invoked by other service chain. The implemented system is demonstrated to facilitate services chaining which is independent from any services interface.

This paper presents the analysis of element deletion in different data structures, like linked lists, binary search trees, stacks, and queues. For random data sequence, we build the linked list and binary search tree and we compare the element deletion procedure. We find the much more stable performance of the binary search tree than that of the linked list. Additionally, we analyze the stack as a complex data structure and its basic operations. We present the element deletion with the basic operations for array stack implementation and we note the limitations. Also, we present the element deletion problem for a queue as a complex data structure, implemented with an array. We present the element deletion with the basic queue operations and we point out the limitations.

The widespread use and expansion of the World Wide Web has revolutionized the discovery, access, and retrieval of information. The Internet has become the doorway to a vast information base and has leveraged the access to information through standard protocols and technologies like HyperText Markup Language (HTML), active server pages (ASP), Java server pages (JSP), Web databases, and Web services. Web services are software applications that are accessible over the World Wide Web through standard communication protocols. A Web service typically has a Webaccessible interface for its clients at the front end, and is connected to a database system and other related application suites at the back end. Thus, Web services can render efficient Web access to an information base in a secured and selective manner. The true success of this technology, however, largely depends on the efficient management of the various components forming the backbone of a Web service system. This chapter presents an overview and the state of the art of various management approaches, models, and architectures for Web services systems toward achieving quality of service (QoS) in Web data access. Finally, it discusses the importance of autonomic or self-managing systems and provides an outline of our current research on autonomic Web services.

The human brain can solve highly abstract reasoning problems using a neural network that is entirely physical. The underlying mechanisms are only partially understood, but an artificial network provides valuable insight. See Article p.471 Conventional computer algorithms can process extremely large and complex data structures such as the worldwide web or social networks, but they must be programmed manually by humans. Neural networks can learn from examples to recognize complex patterns, but they cannot easily parse and organize complex data structures. Now Alex Graves, Greg Wayne and colleagues have developed a hybrid learning machine, called a differentiable neural computer (DNC), that is composed of a neural network that can read from and write to an external memory structure analogous to the random-access memory in a conventional computer. The DNC can thus learn to plan routes on the London Underground, and to achieve goals in a block puzzle, merely by trial and error—without prior knowledge or ad hoc programming for such tasks.

Web services are the key technology for implementing distributed enterprise level applications such as B2B and grid computing. An important goal is to provide dependable quality guarantees for client-server interactions. Therefore, service level management (SLM) is gaining more and more significance for clients and providers of Web services. The first step to control service level agreements is a proper instrumentation of the application code in order to monitor the service performance. However, manual instrumentation of Web services is very costly and error-prone and thus not very efficient. Our goal was to develop a systematic and automated, tool-supported approach for Web services instrumentation. We present a dual approach for efficiently instrumenting Web services. It consists of instrumenting the frontend Web services platform as well as the backend services. Although the instrumentation of the Web services platform necessarily is platform-specific, we have found a general, reusable approach. On the backend-side aspect-oriented programming techniques are successfully applied to instrument backend services. We present experimental studies of performance instrumentation using the application response measurement (ARM) API and evaluate the efficiency of the monitoring enhancements. Our results point the way to systematically gain better insights into the behaviour of Web services and thus how to build more dependable Web-based applications.

We look at a number of policies for managing a file system cache in a Web server. Traces from NCSA World Wide Web (WWW) server are used in this study. We study several caching policies for improving the overall performance of such a server and show that request response time can be improved by some of the replacement policies that take size of the request into account. It is shown that least frequently used (LFU) performs well when cache sizes are small (<16 MB) and SpacexAge replacement policy performs consistently better than LRU. We show that previously proposed cache sharing policies improve performance significantly in clustered Web servers.

In 1998, Ian Foster and Carl Kesselman, together with thirty distinguished experts in high-performance computing and networking, laid the foundations of a new computing model called GRID. Their vision was introduced in the book, The GRID: Blueprint for a New Computing Infrastructure (see review, SCPE Vol. 3, No. 3 ). The editors wrote: … A computational grid is a hardware and software infrastructure that provides dependable, consistent, pervasive, and inexpensive access to high-end computational capabilities… allowing new classes of applications to emerge… as yet, we have only a preliminary understanding of what these new applications will look like. Over the next five years, Grid computing became the hottest R&D field. Academia and national labs built experimental infrastructures, new startups were established to develop Grid technologies, and the HPC giant vendors joined the party. Each one pushed in a different direction based on what and how he believed Grid computing should look. It was only a matter of time until people started to ask what the Grid is all about. A survey of ten Grid experts produced ten different answers. The question remains without a clear answer, leaving many people confused. Ian Foster picked up the gloves. In his article, What is the GRID? A three point checklist (GRIDtoday, July 22, 2002: Vol. 1, No. 6), he redefines the Grid model to reflect the trades and changes in the field during the past five years. According to Foster, a Grid is a system that: Coordinates resources that are not subject to centralized control. Uses standard, open, general-purpose protocols and interfaces. Delivers a nontrivial quality of service. But Foster's new definition could not encompass all of the Grid's approaches. Moreover, Foster explained by example what the Grid is not: A cluster management system such as Sun's Sun Grid Engine, Platform's Load Sharing Facility, or Viridian's Portable Batch System can, when installed on a parallel computer or local area network, deliver quality of service guarantees and thus constitutes a powerful Grid resource. However, such a system is not a Grid itself, due to its centralized control of the hosts that it manages Within a week the responses started to come in. The first one was from Wolfgang Gentzsch, Director of Grid computing at Sun Microsystems (GRIDtoday, August 5, 2002: Vol. 1, No. 8). Gentzsch wrote: I very much like Ian's two earlier definitions. Combined, they may provide a very generic Grid definition. The new checklist, however, reduces the potential of a wide and rich variety of Grids, with different architectures, operational models, and applications, and may miss the chance to becoming widely accepted as a standard definition of the Grid. Why do we need a definition for the Grid? Can the Grid be defined? Is a definition is necessary to the Grid's development? The Grid is an open vision and thus cannot be defined. An attempt to define the Grid can only reach the foreseen technology horizon, and this horizon is only one to two years ahead. Grid computing is a paradigm in shift. New architectures and standards are changing the shape and direction of the Grid's development. In the past year one such prominent architecture was Open Grid Services Architecture (OGSA). The OGSA is the first attempt to bridge the gap between two cyberspace worlds: the Internet and the Grid. The Internet and the Grid are two different computing models. There are people who believe that the Grid is the next generation of the Internet and the World Wide Web, saying that the Great Global Grid is still many years away. Others state that the Grid will complement, not replace, the Internet as we know it. In 1998, when the Grid blueprint was published, a new Internet language appeared called eXtensible Markup Language (XML). XML is a development tool for a new Internet computing model known as Web Services. At that time, nobody understood that there is a relationship between Web Services and the Grid. Three years past before Steve Tuecke from Argonne National Laboratory started to write a spec for Grid Services. Later, people from IBM joined the mission and together they created OGSA. The OGSA specification outlines interfaces to grid computing software that comply with Web Services standards. If adopted, Grid services such as job scheduling, authentication, failure-detection, staging of applications and data, and migration of applications and data, will all be accessed through standard Web Services architecture. OGSA is basically where Grid meets Web Services and maybe the first step towards full integration of the Internet and the Grid. The Internet appeared a decade ago. In the beginning, the Net offered primitive applications: a mailing system, ftp services, and a web of home pages. Nobody asked, What is the Internet? The years passed and new emerging Internet technologies were developed. Today we can talk on the phone over the Net, chat with friends, and video conference with colleagues on the other side of the world. New computing and business models were developed: e-commerce, e-learning, e-science, and e-you-name-it. And nobody asks what the Internet is. The Grid is a super-model, a bag of networking models associated with many types of architectures, software packages, applications, and standards. Today, when people talk about the Grid they mention Data Grids, Science Grids, and Campus Grids. And at the same time they mention Farm computing, Peer-to-peer computing, and Utility computing, among others. Ten years from now many of today's technologies will disappear and new ones will be developed. I don't know how Grid computing will look a decade from now, but I know that we will have g-commerce, g-learning, g-science, and g-chat. Nobody will ask what the Grid is. It will be obvious, just as the Internet is today. Ami Marowka The Computer Aided Design Laboratory School of Engineering and Computer Science Hebrew University of Jerusalem

Several approaches have been proposed to tackle the selection of distributed processes described as semantic Web services. However, their practical applicability in real composition scenarios is still an open question. Addressing this problem requires on the one hand to deal with services described as stateful business processes and, on the other hand, to consider complex selection requirements concerning both the service interface and its behavior. In fact, in most existing approaches the selection is performed on the basis of the ldquofunctionalrdquo description of a service, i.e. in terms of its inputs, outputs, preconditions and effects. In this paper, we present our approach for the process-level service selection and evaluate it on a real world scenario that entails a high level of complexity: the eBay Web Services,the Amazon E-Commerce Services and the e-payment service offered by PayPal. The approach is based on a representation of services at the process level that is based on BPEL and WSDL specifications and that extends these standard specifications with minimal semantic annotations that permit to perform an efficient and yet useful, semantic reasoning for the process-level selection of Web services.

Proliferation of web services opens an unleashed opportunity to the service providers compete themselves to satisfy a request. Since numerous functionally similar web services are readily available, identifying pertinent web service to the client's requirement is a challenge. Furthermore, recommending the pertinent web service and not missing the relevant web service are the two complex issues to be addressed in service discovery process. Since the keyword search doesn't bear the underlying semantics and unable to articulate the search query accurately, operation based search has been introduced. The discovery process is matured, if the search must be incorporated with client's QoS requirements. To alleviate the aforementioned difficulties, QoS driven web service discovery approach has been introduced. The gist of the approach is to assist the user to search the pertinent web service based on functional and non functional evaluation. The web services metadata are extracted from the WSDL file and it will be stored in a service pool. The functional and nonfunctional evaluation can be performed by the proposed algorithm, and the aggregated value will be stored in a service pool. The services which are matched with the user query will be provided to the client.

The proposed system investigates SOAP based web services. This search system dynamically discovers the web services and integrates the required web services to satisfy the user requests. Using search engine, WSDL files are retrieved and these files are processed to select the required web services. In this system, user requested functional words are searched using search engine. Horizontal, vertical, inter-cluster and intra-cluster searches are performed on these search results. All elements of WSDL files are compared with user given functional word using weight matrix and selected web services are executed to satisfy the user request. Performance of different search systems are analyzed. Due to dynamic nature of web services, stored data set is not used for implementation. Instead WSDL links are retrieved during run time which is novelty of the proposed system.

Web services are changing the way in which the World Wide Web is currently being used. The Web was created originally to support human-to-computer interactions with textual and graphical data. Today, people use the Web to read the latest news, buy consumer goods, search for information, and obtain stock quotes. However, the Web does not yet support effective computer-to-computer interactions between software applications of different enterprises. Web services can enable Internet-based software applications of different enterprises to interact with each other directly by providing application programs with the ability to invoke operations that otherwise would be invoked manually by a human through a browser. Web services can run not only on mainframe computers and server computers, but also on desktop computers and client handsets. Web services allow individuals and organizations to publish links to their software applications, just as they publish links to their Web pages. Web services solve the enterprise application integration (EAI) problem by enabling interaction among different applications within the same organization. They can also enable computer-to-computer applications of different organizations to interact without human intervention. For example, Web services can be used for reservation systems, order-tracking systems, and business supply chains. In the example shown in Figure 1, Company A (a customer) orders goods from Company B (a distributor). Company B checks the availability of the goods from Company C (a supplier), and then arranges for payment and shipping of the goods to Company A without human intervention. Performance, security, and reliability are factors that will limit the use of Web services unless those issues can be properly addressed. Nonetheless, the potential widespread use and benefits of Web services are very compelling. Web services allow disparate computing systems and applications to be coupled together, and they enable enterprises to streamline and automate their business processes.

With the increasing presence and adoption of web services on the World Wide Web, the demand of efficient web service quality evaluation approaches is becoming unprecedentedly strong. To avoid the expensive and time-consuming web service invocations, this paper proposes a collaborative quality-of-service (QoS) prediction approach for web services by taking advantages of the past web service usage experiences of service users. We first apply the concept of user-collaboration for the web service QoS information sharing. Then, based on the collected QoS data, a neighborhood-integrated approach is designed for personalized web service QoS value prediction. To validate our approach, large-scale real-world experiments are conducted, which include 1,974,675 web service invocations from 339 service users on 5,825 real-world web services. The comprehensive experimental studies show that our proposed approach achieves higher prediction accuracy than other approaches. The public release of our web service QoS data set provides valuable real-world data for future research.