8001978
MAPBOT: a Web based map information retrieval system
Abstract Many types of information are geographically referenced and interactive maps provide a natural user interface to such data. However, map presentation in geographical information systems and on the Web is closed related to traditional cartography and provides a very limited interactive experience. In this paper, we present MAPBOT, an interactive Web based map information retrieval system in which Web users can easily and efficiently search geographical information with the assistance of a user interface agent (UIA). Each kind of map feature such as a building or a motorway works as an agent called a Maplet. Each Maplet has a user interface level to assist the user to find information of interest and a graphic display level that controls the presence and the appearance of the feature on the map. The semantic relationships of Maplets are defined in an Ontology Repository provided by the system which is used by the UIA to assist a user to semantically and efficiently search map information interested. An Ontology Editor with a graphic user interface has been implemented to update the Ontology Repository. Visualization on the client is based on Scalable Vector Graphics which provides a high quality Web map.
14345064
A Wrapper Generator for Wrapping High Performance Legacy Codes as Java/CORBA Components
This paper describes a Wrapper Generator for wrapping high performance legacy codes as Java/CORBA components for use in a distributed component-based problem- solving environment. Using the Wrapper Generator we ave automatically wrapped an MPI-based legacycode as a single CORBA object, and implemented a problem- solving environment for molecular dynamic simulations. Performance comparisons between runs of the CORBA object and the original legacy code on a cluster of workstations and on a parallel computer are also presented.
5393650
PaDDMAS: parallel and distributed data mining application suite
Discovering complex associations, anomalies and patterns in distributed data sets is gaining popularity in a range of scientific, medical and business applications. Various algorithms are employed to perform data analysis within a domain, and range from statistical to machine learning and AI based techniques. Several issues need to be addressed however to scale such approaches to large data sets, particularly when these are applied to data distributed at various sites. As new analysis techniques are identified, the core tool set must enable easy integration of such analytical components. Similarly, results from an analysis engines must be sharable, to enable storage, visualisation or further analysis of results. We describe the architecture of PaDDMAS, a component based system for developing distributed data mining applications. PaDDMAS provides a tool set for combining pre-developed or custom components using a dataflow approach, with components performing analysis, data extraction or data management and translation. Each component is wrapped as a Java/CORBA object, and has an interface defined in XML. Components can be serial or parallel objects, and may be binary or contain a more complex internal structure. We demonstrate a prototype using a neural network analysis algorithm.
45224109
Service Matchmaking and Discovery with Rough Sets
The past few years have seen the Grid is evolving as a service-oriented computing infrastructure. It is foreseen that various resources in a Grid environment will be exposed as services for use by a wider user community. Service discovery becomes an issue of vital importance for utilising Grid facilities. This paper presents Rosse, a Rough Sets based Search Engine for service discovery that can deal with uncertainty of service properties when matching service advertisements with service requests. The evaluation results show that Rosse is more effective in service discovery compared with other mechanisms such as UDDI keyword matching and OWL-S matchmaking.
1974621
Engineering high-performance legacy codes as CORBA components for problem-solving environments
This paper describes techniques used to leverage high-performance legacy codes as CORBA components to a distributed problem-solving environment. It first briefly introduces the software architecture adopted by the environment. Then it presents a CORBA oriented wrapper generator (COWG) which can be used to automatically wrap high-performance legacy codes as CORBA components. Two legacy codes have been wrapped with COWG. One is an MPI-based molecular dynamic simulation (MDS) code, the other is a finite element-based computational fluid dynamics (CFD) code for simulating incompressible Navier-Stokes flows. Performance comparisons between runs of the MDS CORBA component and the original MDS legacy code on a cluster of workstations and on a parallel computer are also presented. Wrapped as CORBA components, these legacy codes can be reused in a distributed computing environment. The first case shows that high-performance can be maintained with the wrapped MDS component. The second case shows that a Web user can submit a task to the wrapped CFD component through a Web page without knowing the exact implementation of the component. In this way, a user's desktop computing environment can be extended to a high-performance computing environment using a cluster of workstations or a parallel computer.
7274224
Wrapping MPI-based legacy codes as Java/CORBA components
Abstract Techniques for wrapping an MPI-based molecular dynamics (MD) simulation code as Java/CORBA components, for use within a distributed component based problem solving environment (CB-PSE), is presented. A legacy code for simulating a Lennard–Jones fluid is first wrapped as a single CORBA object, followed by division of the code into computational sub-units, where each sub-unit is wrapped as a CORBA object containing MPI calls, and run on a cluster of workstations — enabling different MPI implementations to inter-operate. Using a Java implementation, users can submit simulation tasks through a Web based interface, without needing to know implementation details of the legacy code, or the exact interaction between sub-units within the code. We provide performance comparisons of wrapping the entire MD code as a single object versus wrapping sub-units within it, and offer a simple performance model to explain our findings.
15861046
A Survey on Topology issues in Wireless Sensor Network
Topology issues have received more and more attentions in Wireless Sensor Networks (WSN). While WSN applications are normally optimized by the given underlying network topology, another trend is to optimize WSN by means of topology control. A number of approaches have been invested in this area, such as topology directed routing, cooperating schemes, sensor coverage based topology control and network connectivity based topology control. Most of the schemes have proven to be able to provide a better network monitoring and communication performance with prolonged system lifetime. In this survey paper, we provide a full view of the studies in this area. By summarizing previous achievements and analyzing existed problems, we also point out possible research directions for future work .
12322208
Gemini: Probabilistic Routing Algorithm in Structured P2P Overlay
In this paper, we propose a new structured overlay protocol, which is more efficient and scalable than previous ones. We call it Gemini, because its routing table consists of two parts, one containing nodes with common prefix and the other containing nodes with common suffix. Gemini routes messages to their destinations in just 2 hops, with a very high probability of 0.99. When running in a p2p network of 5,000,000 peers, each Gemini node consumes only 6 messages per second for maintenance. This cost, as well as routing table size, varies as a \(O {\sqrt{N}}\) function to the overlay scale, so Gemini can also run well in an even larger environment.
8200318
A Web Service for Exchanging Procedural CAD Models Between Heterogeneous CAD Systems
It is a challenging issue to exchange procedural CAD models between heterogeneous CAD systems. In this paper, we extend the synchronized collaborative design environment among heterogeneous CAD systems, which we developed previously, to a Web services based platform for exchange of procedural CAD models between heterogeneous CAD systems. First, the real-time exchange of one single operation is extended to the exchange of a complete procedural CAD model between heterogeneous CAD systems. Second, Web services technology is adopted to encapsulate the procedural CAD model exchange functions to a standard interface, which is then released on the Internet and can be easily used by remote developers in their windows applications, Web applications, and so on. Finally, a Web service for exchange of procedural CAD models between SolidWorks and Autodesk Mechanical Desktop is realized.
15025287
An Ontology Based Approach to Construct Behaviors in Web Information Systems
System behaviors specify the major functions of domain specific Web Information Systems (WIS). Traditional techniques can not satisfy various requirements or manage innumerous data while developing WIS behaviors. People appeal to a smart tool for implementing the WIS behaviors. This article makes the following contributions: (1) Proposes the concept of domain ontology and behavior ontology to describe the contents and operations of WIS; (2) Extends traditional ECA model to characterize the triggers, parameters, actions as well as validations of WIS behaviors; (3) Analyses the relationships between domain ontology and behavior ontology with rule sets; (4) Implements a tool named WISE Builder with four algorithms to help users building behavior ontology with domain ontology; (5)Shows the feasibility of this technique in a real application case.
5971084
Minimum description length induction, Bayesianism, and Kolmogorov complexity
The relationship between the Bayesian approach and the minimum description length approach is established. We sharpen and clarify the general modeling principles minimum description length (MDL) and minimum message length (MML), abstracted as the ideal MDL principle and defined from Bayes's rule by means of Kolmogorov complexity. The basic condition under which the ideal principle should be applied is encapsulated as the fundamental inequality, which in broad terms states that the principle is valid when the data are random, relative to every contemplated hypothesis and also these hypotheses are random relative to the (universal) prior. The ideal principle states that the prior probability associated with the hypothesis should be given by the algorithmic universal probability, and the sum of the log universal probability of the model plus the log of the probability of the data given the model should be minimized. If we restrict the model class to finite sets then application of the ideal principle turns into Kolmogorov's minimal sufficient statistic. In general, we show that data compression is almost always the best strategy, both in model selection and prediction.