17378411
A multi-property trust model for reconfiguring component software
While component software continues to grow in size and complexity, it becomes increasingly difficult to ensure qualities for component services, especially at run-time. This paper focuses on a framework on middleware for dynamic re-configuration of components of different qualities from the view of trust. Firstly, a trust management model is built, in which the management framework and measurement model are presented. Secondly, the reconfiguration algorithm is described based on the model. Thirdly, the trust management is implemented as a kind of public services and some tools on a J2EE-compliant middleware platform, i.e., PKUAS. Finally, the related work is discussed and compared with our research.
13211852
Requirements guided dynamic software clustering
In this paper, we propose a requirements guided dynamic approach to address software clustering -which aims at providing the logically meaningful and high-level decompositions of large and complex systems. In our approach, the hierarchical structure of functional requirements are constructed by a text document clustering technique named hierarchical agglomerative clustering (HAC) as a high-level skeleton to facilitate the further decomposition of source code through dynamic analysis. We also perform an experimental study based on a GNU system and present the quantitative and qualitative analysis of the experimental results.
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.
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.
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.
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.
5219400
Timer Interaction in Route Flap Damping
Route Flap Damping is a mechanism generally used in network routing protocols. Its goal is to limit the global impact of unstable routes by temporarily suppressing routes with rapid changes over short time periods. Although route damping is a clearly defined and simple procedure at each router, its effect in a large network setting is not well understood. We show that the current damping design leads to the intended behavior only under persistent route flapping. When the number of flaps is small, the global routing dynamics deviates significantly from the expected behavior with a longer convergence delay. Previous work observed that a single route flap can falsely trigger route suppression due to path exploration. However our simulations show that this false suppression only accounts for 30% of the convergence delay after a single route flap. Our study reveals previously unknown interactions between reuse timers at different routers. Route suppression and reuse at different routers are triggered at different times and thus affect the number of updates received by other routers. In turn, this impacts other routers' damping behavior. We propose to use Root Cause Notification to eliminate both false suppression and undesirable timer interaction
8187115
Modeling location management in wireless networks with generally distributed parameters
In the wireless mobile networks, location update (LU) and paging are two basic operations in the framework of mobility management. The trade-off analysis between LU and paging is traditionally performed under the assumption that the key variables follow exponential distribution. However, recent work showed that such assumptions may be incorrect. In this paper, by introducing the concept of LU inter-arrival time and additionally relaxing the assumptions for the inter-service time, cell residence time and LU inter-arrival time, we present an analytical technique to develop the closed-form formula for the signaling cost applicable to different location management schemes. Specifically, the result is applied to the static scheme and the dynamic movement-based scheme to demonstrate the general applicability. Illustrative numerical examples are given to compare the location management scheme performance based on the cell characteristics.
52862068
Robust face alignment based on local texture classifiers
We propose a robust face alignment algorithm with a novel discriminative local texture model. Different from the conventional descriptive PCA local texture model in ASM, classifiers using LUT-type Haar-like features are trained from a large data set as local texture model. The strong discriminative power of the classifier greatly improves the accuracy and robustness of local searching on faces with expression variation and ambiguous contours. A Bayesian framework is configured for shape parameter optimization and the algorithm is implemented in a hierarchical structure for efficiency. Extensive experiments are reported to show its accuracy and robustness.
16359335
Scalable relevance feedback using click-through data for web image retrieval
Relevance feedback (RF) has been extensively studied in the content-based image retrieval community. However, no commercial Web image search engines support RF because of scalability, efficiency and effectiveness issues. In this paper we proposed a scalable relevance feedback mechanism using click-through data for web image retrieval. The proposed mechanism regards users' click-through data as implicit feedback which could be collected at lower cost, in larger quantities and without extra burden on the user. During RF process, both textual feature and visual feature are used in a sequential way. To seamlessly combine textual feature-based RF and visual feature-based RF, a query concept-dependent fusion strategy is automatically learned. Experimental results on a database consisting of nearly three million Web images show that the proposed mechanism is wieldy, scalable and effective.
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.