6285526
A configuration management system supporting component-based software development
Component-based software development has been viewed as an emerging paradigm of software development. This paper analyzes the requirements of configuration management in component-based development process. Based on the analysis, a prototype configuration management system is proposed to meet the requirements. An example of using the system is also given.
6538157
Threshold Tuning for Improved Classification Association Rule Mining
One application of Association Rule Mining (ARM) is to identify Classification Association Rules (CARs) that can be used to classify future instances from the same population as the data being mined. Most CARM methods first mine the data for candidate rules, then prune these using coverage analysis of the training data. In this paper we describe a CARM algorithm that avoids the need for coverage analysis, and a technique for tuning its threshold parameters to obtain more accurate classification. We present results to show this approach can achieve better accuracy than comparable alternatives at lower cost.
15561253
An experimental comparison of four test suite reduction techniques
As a test suite usually contains redundancy, a subset of the test suite (representative set) may still satisfy all the test objectives. As the redundancy increases the cost of executing the test suite, many test suite reduction techniques have been brought out in spite of the NP-completeness of the general problem of finding the optimal representative set of the test suite. In the literature, some experimental studies of test suite reduction techniques have already been reported, but there are still shortcomings of the studies of these techniques. This paper presents an experimental comparison of the four typical test suite reduction techniques: heuristic H, heuristic GRE, genetic algorithm-based approach and ILP-based approach. The aim of the study is to provide a guideline for choosing the appropriate test suite reduction techniques.
17777200
A similarity-aware approach to testing based fault localization
Debugging is a time-consuming task in software development and maintenance. To accelerate this task, several approaches have been proposed to automate fault localization. In particular, testing based fault localization (TBFL), which utilizes the testing information to localize the faults, seem to be very promising. However, the similarity between test cases in the test suite has been ignored in the research on TBFL. In this paper, we investigate this similarity issue and propose a novel approach named similarity-aware fault localization (SAFL), which can calculate the suspicion probability of each statement with little impact by the similarity issue. To address and deal with the similarity between test cases, SAFL applies the theory of fuzzy sets to remove the uneven distribution of the test cases. We also performed an experimental study for two real-world programs at different size levels to evaluate SAFL together with another two approaches to TBFL. Experimental results show that SAFL is more effective than the other two approaches when the test suites contain injected redundancy, and SAFL can achieve a competitive result with normal test suites. SAFL can also be more effective than applying test suite reduction to current approaches to TBFL.
22235359
Towards an Optimization-Based Method for Consolidating Domain Variabilities in Domain-Specific Web Services Composition
In this paper, we put forward an automatic method of acquiring the specific system composition model from a domain composition model and requirements for the specific system in domain-specific Web services composition. This is referred to as the variability consolidation problem in this paper. To achieve this goal, we designed a language to describe domain properties for Web services composition. The basis of our approach is to transform the domain composition model and the requirements for the specific system into a mathematical optimization problem, which can be solved by existing algorithms. Thus, this method is fully automatic and not prone to human errors. Our preliminary experimental results show that our method is quite feasible for solving problems with real world sizes.
19304521
Applying OO Metrics to Assess UML Meta-models
UML has been coming of age through more than seven years development, in which there are not only minor revision like from UML 1.1 to UML 1.2, but also significant improvement like final adoption of UML 2.0 submissions. However there is so far lack of an objective assessment to UML meta-models, which can be used to control and predict the evolution of the UML. In this paper we regard UML meta-models as the equivalent of Object-Oriented (OO) design models. Therefore, we can adapt OO design metrics and criteria as a method to assess UML meta-models. Our method conducts the assessment of stability and design quality to UML meta-models in versions of 1.1, 1.3, 1.4 (with Action Semantics), 1.5, and 2.0. Based on the results we analyze the evolution of the UML versions and provide the applicability suggestions to the method.
4535096
Coupled kernel-based subspace learning
It was prescriptive that an image matrix was transformed into a vector before the kernel-based subspace learning. In this paper, we take the kernel discriminant analysis (KDA) algorithm as an example to perform kernel analysis on 2D image matrices directly. First, each image matrix is decomposed as the product of two orthogonal matrices and a diagonal one by using singular value decomposition; then an image matrix is expanded to be of higher or even infinite dimensions by applying the kernel trick on the column vectors of the two orthogonal matrices; finally, two coupled discriminative kernel subspaces are iteratively learned for dimensionality reduction by optimizing the Fisher criterion measured by Frobenius norm. The derived algorithm, called coupled kernel discriminant analysis (CKDA), effectively utilizes the underlying spatial structure of objects and the discriminating information is encoded in two coupled kernel subspaces respectively. The experiments on real face databases compared with KDA and Fisherface validate the effectiveness of CKDA.
207066659
Adaptive integration activity management for on demand business process collaboration
Abstract.Today businesses are interacting and collaborating more often in the context of a business value chain involving a variety of partners to deliver products and services. Business to business (B2B) connectivity, Enterprise Application Integration (EAI) and general business collaboration processes are becoming more critical in operating and managing efficient enterprises. The required level of inter and intra enterprise integration is generally a large undertaking and involves substantial development and customization efforts. In this paper, we propose an adaptive integration activity management approach based on web services technologies to reduce code changes associated with business process integration in a distributed collaboration environment. Specifically, we present a concept of activity chain to capture non-deterministic process flows as well as deterministic process flows in a uniform manner. Then an Activity Ontology is introduced to capture the integration requirements that include adaptation behaviors, action properties, business rules, and access control policy references. The unique ontology representation and management of the integration activities provides a uniform way to integrate additional internal and external business applications to reduce the need for pre-defined and hard-wired integration methods and to minimize code changes to existing components in an existing business collaboration and integration (B2B/EAI) infrastructure. In addition, a Petri-Net modeling exercise of the proposed integration activity management is performed to help better understand the actual system and improve the system design beforehand.
5444394
A First Look at Peer-to-Peer Worms: Threats and Defenses
Peer-to-peer (P2P) worms exploit common vulnerabilities in member hosts of a P2P network and spread topologically in the P2P network, a potentially more effective strategy than random scanning for locating victims. This paper describes the danger posed by P2P worms and initiates the study of possible mitigation mechanisms. In particular, the paper explores the feasibility of a self-defense infrastructure inside a P2P network, outlines the challenges, evaluates how well this defense mechanism contains P2P worms, and reveals correlations between containment and the overlay topology of a P2P network. Our experiments suggest a number of design directions to improve the resilience of P2P networks to worm attacks.
32889588
Enhanced visualization of time series through higher fourier harmonics
Visualization techniques can enable the exploration and detection of patterns and relationships in a complex data set by presenting the data in a graphical format in which the key characteristics become more apparent. A new visualization technique, the first Fourier harmonic projection (FFHP) was introduced to translate the multi-dimensional data into a two dimensional scatter plot where the spatial relationship of the points reflects the structure of the original data set. FFHP has been shown capable of visualizing various gene expression data sets. However, dimension arrangement is crucial for the effectiveness of FFHP and certain data, such as time series, prevents dimensions (time points) from being freely rearranged. In this paper, we present an alternative approach through higher Fourier harmonic projections to enhance the visualization. Our algorithm takes advantage of the theoretical meaning of the Fourier harmonics and "reshuffles" the dimensions of the data set without physically rearranging them. The experimental results demonstrated significant improvement of the visualizations.
46728562
Membership Portal and Service Provisioning System for an Infrastructure of Hubs: Managed E-Hub
The goal of Managed e-Hub research prototype is to build a common infrastructure of hubs so that businesses can develop B2B exchanges meeting their business needs based on it. In this paper, an open and extensible framework for Managed e-Hub is presented and the hub fundamental services are discussed in detail as well. The service provisioning system of Managed e-Hub not only provides a way of integrating other services into the hub by means of service on-boarding and subscription, but also provisions these services with their required provisioning information.