In this paper, we propose an alternative approach for verifying a conformance between choreography and the black box implementation of stateful Web service whose only external behaviors can be observed. Our framework uses an adapted version of Angluin's algorithm to infer a Mealy machine model that represents the observable behaviors of the implemented Web service. By transforming the Mealy machine to the modeling formalism LTS, the model checker LTSA can be used for checking a trace equivalence relation which is the conformance criterion in this work.

A link farm is a set of web pages constructed to mislead the importance of target pages in search engine results by boosting their link-based ranking scores. In this paper, we introduce a new graph grammar model for expressing the structure of a link farm. Supervised graph grammar induction created by an expert is modified to fit the training data to explain the behavior and the properties of link farms. In the experiments, graph grammar can effectively recognize link farms from Yahoo's web spam dataset. The comparison among the number of applying production rules of spam and normal hosts indicates that graph grammar seem to be a good mechanism for detecting link spam.

Association rule mining is one of the most important techniques in data mining. It extracts significant patterns from transaction databases and generates rules used in many decision support applications. Many organizations such as industrial, commercial, or even scientific sites may produce large amount of transactions and attributes. Mining effective rules from such large volumes of data requires much time and computing resources. In this paper, we propose a parallel FI-growth association rule mining algorithm for rapid extraction of frequent itemsets from large dense databases. We also show that this algorithm can efficiently be parallelized in a cluster computing environment. The preliminary experiments provide quite promising results, with nearly ideal scaling on small clusters and about half of ideal (15 fold speedup) on a thirty-two processor cluster.

Acquired software products from suppliers are being increasing tremendously because of insufficiency of resources and capable employees. To manage and monitor the product acquisition process effectively according to a signed contract with a supplier, an organization has to define the standard of workflow, deliverable products in each step and staff roles and responsibilities, etc. Thus, there is a need to incorporate these diversified processes into a single process model that could helps to reach the software product acquisition goal. CMMI defines supplier agreement management process area (SAM) that relates to product acquisition but it does not describe how the organization should do to achieve its expectation. This research presents a business workflow process model for SAM process area of CMMI: capability level 2. It consists of three layers: contextual layer, elaboration layer, and definition layer. A software tool called supplier agreement management tool (SAMT) is also developed to help integrate the details of our approach and can be used for the proposed process model.

Multiplication of two numbers represented in base /spl beta/ is shown to be computable by an online algorithm when /spl beta/ is a negative integer, a positive noninteger real number, or a complex number of the form i/spl radic/r, where r is a positive integer.