MAPPING BPEL PROCESSES TO DIAGNOSTIC MODELS

Web services are loosely-coupled, self-contained, and self-describing software modules that perform a predetermined task. These services can be linked together to develop an appli­ cation that spans multiple organizations. This linking is referred to as a composition of web services. These compositions potentially can help businesses respond more quickly and more cost-effectively to changing market conditions. Compositions can be specified using a high- level workflow process language. A fault or problem is a defect in a software or software component. A system is said to have a failure if the service it delivers to the user deviates from compliance with the system specification for a specified period of time. A problem causes a failure. Failures are often referred to as symptoms of a problem. A problem can occur on one component but a failure is detected on another component. This suggests a need to be able to determine a problem based on failures. This is referred to as fault diagnosis. This thesis focuses on the design, implementation and evaluation of a diagnostic module that performs automated mapping of a high-level specification of a web services composition to a diagnostics model. A diagnosis model expresses the relationship between problems and potential symptoms. This mapping can be done by a third party service that is not part of the application resulting from the composition of the web services. Automation will allow a third party to do diagnosis for a large number of compositions and should be less error-prone

An FPGA-Based System for Tracking Digital Information Transmitted Via Peer-to-Peer Protocols

This paper presents a Field Programmable Gate Array (FPGA)-based tool designed to process file transfers using the BitTorrent Peer-to-Peer (P2P) protocol and VoIP phone calls made using the Session Initiation Protocol (SIP). The tool searches selected control messages in real time and compares the unique identifier of the shared file or phone number against a list of known contraband files or phone numbers. Results show the FPGA tool processes P2P packets of interest 92% faster than a software-only configuration and is 97.6% accurate at capturing and processing messages at a traffic load of 89.6 Mbps

Working Notes from the 1992 AAAI Spring Symposium on Practical Approaches to Scheduling and Planning

The symposium presented issues involved in the development of scheduling systems that can deal with resource and time limitations. To qualify, a system must be implemented and tested to some degree on non-trivial problems (ideally, on real-world problems). However, a system need not be fully deployed to qualify. Systems that schedule actions in terms of metric time constraints typically represent and reason about an external numeric clock or calendar and can be contrasted with those systems that represent time purely symbolically. The following topics are discussed: integrating planning and scheduling; integrating symbolic goals and numerical utilities; managing uncertainty; incremental rescheduling; managing limited computation time; anytime scheduling and planning algorithms, systems; dependency analysis and schedule reuse; management of schedule and plan execution; and incorporation of discrete event techniques

Exact Tests via Complete Enumeration: A Distributed Computing Approach

The analysis of categorical data often leads to the analysis of a contingency table. For large samples, asymptotic approximations are sufficient when calculating p-values, but for small samples the tests can be unreliable. In these situations an exact test should be considered. This bases the test on the exact distribution of the test statistic. Sampling techniques can be used to estimate the distribution. Alternatively, the distribution can be found by complete enumeration. A new algorithm is developed that enables a model to be defined by a model matrix, and all tables that satisfy the model are found. This provides a more efficient enumeration mechanism for complex models and extends the range of models that can be tested. The technique can lead to large calculations and a distributed version of the algorithm is developed that enables a number of machines to work efficiently on the same problem

An overview of decision table literature 1982-1995.

This report gives an overview of the literature on decision tables over the past 15 years. As much as possible, for each reference, an author supplied abstract, a number of keywords and a classification are provided. In some cases own comments are added. The purpose of these comments is to show where, how and why decision tables are used. The literature is classified according to application area, theoretical versus practical character, year of publication, country or origin (not necessarily country of publication) and the language of the document. After a description of the scope of the interview, classification results and the classification by topic are presented. The main body of the paper is the ordered list of publications with abstract, classification and comments.