16604369
Reusing legacy COBOL code with UML collaboration diagrams via a Wide Spectrum Language
Many legacy systems were developed in COBOL, which still play an important role in business. It is an unavoidable issue for organisations to maintain or replace these COBOL systems. In order to make a better use of these legacy COBOL systems, research on modelling and reusing COBOL code are significant. This paper presents an approach to modelling legacy COBOL code with UML collaboration diagrams via a Wide Spectrum Language (WSL). Firstly, legacy COBOL code is transferred into WSL, which is an intermediate language. Secondly, WSL representation is restructured to eliminate GOTO statements. Then an object concept model is created by operating WSL representation. Finally, the collaboration diagrams are constructed based on this object concept model. These collaboration diagrams express the dynamic behaviour of the system, using the structural class and relationship elements of the model, and facilitate engineers to understand and reuse legacy COBOL code.
14080651
GcpSensor: a CPU performance tool for grid environments
In grid computing environments, CPU performance discovery and allocation is a serious issue. Before they run their applications, grid users need to choose grid nodes based on available CPUs performance. Hence a tool is needed for measuring CPUs performance. To address this need, GcpSensor (grid CPU performance sensor) was developed. GcpSensor runs a typical benchmark program in every grid node to measure CPU performance and returns a metric named WMFLOPS which can be used to compare different CPUs performance directly. An algorithm, which can choose a moderate computation cost dynamically, is designed to ensure that every test is comprehensive and the added overhead is comparatively small. Our experiments have proved that GcpSensor can indicate the CPU performance sensitively and that users can use the GcpSensor data to compare different CPUs performance straightforward, thus the accuracy and efficiency for selecting computing resources are increased.
10032867
Incubating services in legacy systems for architectural migration
Legacy systems are valuable assets for organisations. They continuously evolve with new emerged technologies in rapidly changing business environment. Web services, together with service-oriented architectures, facilitate legacy system webification and evolution in service-oriented computing environment. Traditional approaches to integrate legacy systems with Web service technology are wrapping a legacy system as a black-box without adequate system understanding. In this paper, we proposed a reengineering approach which applies an improved agglomerative hierarchical clustering algorithm to restructure legacy code and to facilitate legacy code extraction for Web service construction. It supports service identification and service packaging and archives legacy system migration into service-oriented architectures by providing functional legacy code as Web services.
18861911
Service Identification and Packaging in Service Oriented Reengineering
With the adoption to Web service technologies, more and more existing non-service-oriented software systems turn to be legacy systems. They require a service-oriented reengineering process in order to survive in serviceoriented computing environment. In this paper, we present an architecture-based service-oriented approach to support service-oriented reengineering. It integrates and reuses software components as services over Internet by wrapping underlying computing models with XML. Service identification and service packaging processes are described in details, which are the keys to serviceoriented reengineering. Target services are defined according to service identification, which is based on a comparison of analyses in both problem domain and legacy systems. Clustering techniques are applied in service identification process to analyse recovered architectural information and to identify related modules. Service packaging is benefit from architecture-based development and reuse.
13014692
Extracting Reusable Object-Oriented Legacy Code Segments with Combined Formal Concept Analysis and Slicing Techniques for Service Integration
Web services, together with service-oriented architectures, are promising integration technology to facilitate legacy system Webification and evolution. However, a service-oriented re-engineering process is still essential for legacy systems to survive in the service-oriented computing environment. In this service-oriented re-engineering process, understanding and reusing object-oriented code turn to be important activities. In this paper, we proposed a comprehensive approach to support the extraction and integration of reusable object-oriented legacy code. In the extraction phase, formal concept analysis, which is a general and flexible technique for recovering structural design information, and inter-procedural program slicing are adopted as main reverse engineering techniques to recover reusable object-oriented code. In the integration phase, service packaging processes are presented in details. Our approach produces extracted components with core legacy object-oriented code function in Web services by wrapping underlying computing models with XML
6431749
Reasoning with Multimedia Information Using Symbolic Projection
In many multimedia application systems, it is not the final goal to retrieve the relevant multimedia information from different multimedia information sources. Rather, post-processing of the retrieved multimedia information is needed. For example, the retrieved information is used as "known facts". The systems will do some reasoning to obtain further conclusions based on these multimedia form "known facts". We call this reasoning with multimedia information. Most current research work in multimedia information processing is focused on multimedia information retrieval, but post-processing the retrieved information is more or less ignored. This paper explores the way to tackle this problem by using symbolic projection. A case study of reasoning with still image information is presented. Some extensions to symbolic projection-introducing auxiliary pictorial objects in symbolic pictures that need to be processed-are discussed. We expect this paper will stimulate further research on this important but ignored topic.
148323
Analysis of point-to-point packet delay in an operational network
In this paper we perform a detailed analysis of point-to-point packet delay in an operational tier-1 network. The point-to-point delay is the time between a packet entering a router in one PoP (an ingress point) and its leaving a router in another PoP (an egress point). It measures the one-way delay experienced by packets from an ingress point to an egress point across an ISP's network and provides the most basic information regarding the delay performance of the ISP's network. Using packet traces captured in the operational network, we obtain precise point-to-point packet delay measurements and analyze the various factors affecting them. Through a simple, step-by-step, systematic methodology and careful data analysis, we identify the major network factors that contribute to point-to-point packet delay and characterize their effect on the network delay performance. Our findings are: 1) delay distributions vary greatly in shape, depending on the path and link utilization; 2) after constant factors dependent only on the path and packet size are removed, the 99th percentile variable delay remains under 1 ms over several hops and under link utilization below 90% on a bottleneck; 3) a very small number of packets experience very large delay in short bursts
17015903
Optimal scheduling in buffered WDM interconnects with limited range wavelength conversion capability
All optical networking is a promising candidate for supporting high-speed communications because of the huge bandwidth of optics. In this paper, we study optimal scheduling in buffered WDM interconnects with limited range wavelength conversion capability. We formalize the problem of maximizing network throughput and minimizing total delay as a problem of finding an optimal matching in a weighted bipartite graph. We then give a simple algorithm, called the Scan and Swap Algorithm, that finds the optimal matching in O(kB) time, where k is the number of wavelengths per fiber and B is the buffer length, as compared to directly adopting other existing algorithms that need at least O(k/sup 2/N/sup 2/ + k/sup 2/BN) time, where N is the number of input fibers.
17900866
Robust extraction of specific signals with temporal structure
There is a trend to develop blind or semi-blind source extraction algorithms based on second-order statistics, due to its low computation load and fast processing speed. An important and primary work is done by Barros and Cichocki, who propose an extraction algorithm based on a time delay. The algorithm is simple and fast, but its performance is not satisfying. The paper extends their work and proposes a robust algorithm based on eigenvalue decomposition of several delayed covariance matrices. It is faster and has better performance, which is confirmed by theoretical analysis and computer simulations.
62753126
A Bayesian framework for automatic concept discovery in image collections
This paper develops a Bayesian framework for automatic hidden semantic concept discovery to address effective semantics-intensive content-based image retrieval. Each image in the database is segmented to regions associated with homogenous color, texture, and shape features. By employing self-organization map learning, a uniform and sparse region-based representation is obtained. With this representation a probabilistic model based on the statistical-hidden-class assumptions of the image database is developed, to which expectation-maximization technique is applied to analyze semantic concepts hidden in the database. An elaborated retrieval algorithm is designed to support the probabilistic model. The semantic similarity is measured through integrating the posterior probabilities of the transformed query image, as well as a constructed negative vector, to the discovered semantic concepts. The proposed approach has a solid statistical foundation and the experimental evaluations on a database of 10,000 general-purposed images demonstrate its promise of the retrieval effectiveness.