14980784
Supporting Evolution in Workflow Definition Languages
Workflow definition languages are evolving rapidly. However, there is not any agreed-upon standard for such languages. In this paper we address the problem of how to develop a workflow system that is able to cope with the constant changes in these languages. We address the definition aspect of workflow systems by distinguishing between frontend and backend languages. This way, a workflow system can be developed based on the backend language whereas the frontend language can change.
35073381
Service Logic Deployment and Distribution Configuration
The success of service providers in the competitive communications market of the future will be determined by the efficiency with which services are developed, and the quality levels at which services are provided. A service creation environment (SCE) should provide the service developer with solutions to these problems. In this paper we present two essential facilities that should be provided by an advanced SCE: a tool for the optimisation of the service logic deployment scheme and a distribution configuration language supporting the deployment and configuration of component-based distributed applications.
16566221
Naming: design pattern and framework
Naming is an important, but frequently overlooked, aspect of software systems. Naming is usually combined with other issues, e.g. distributed communication technology. The paper treats naming in isolation. It presents a naming design pattern which abstracts several naming policies and an object-oriented framework that can be customized to support naming policies. An applications designer can choose the correct naming properties (relative, absolute, universal identifiers, etc.) to refer to specific objects.
203567
Separating replication from distributed communication: problems and solutions
Replication and distributed communication are usually tightly coupled. This code tangling forbids their independent reuse and adaptation. In this position paper, the problems resulting from coupling replication with distributed communication are discussed. In addition, a solution based on separation of concerns is proposed. The abstractions for each concern are presented, as well as their composition.
11562802
A Decision Support System for IST Academic Information
This article describes the Decision Support System (DSS) for Academic Information being developed at Instituto Superior Tecnico, the Engineering School of the Technical University of Lisbon. In Portuguese, this project has been given the acronym SADIA (Sistema de Apoio a Decisao da Informacao Academica). This paper focuses on the early phases of the DSS development process, i.e., the business requirements definition and the dimensional modelling. First, we show how the business requirements of the School drive the definition of the DSS dimensional model. Second, we detail the logical dimensional model for a selected business process, the IST Student Admission process. Third, the corresponding physical design decisions are reported. The results obtained from the three phases were successfully validated by business users.
38014527
A Quality Design Solution for Object Synchronization
This paper presents a quality design solution, the Customizable Object Synchronization pattern, for object synchronization which decouples object synchronization from object concurrency and object functionality (sequential part). The solution described by this pattern provides encapsulation, extensibility, modularity and reuse of synchronization policies.
1002750
Particle Swarm based Data Mining Algorithms for classification tasks
Particle Swarm Optimisers are inherently distributed algorithms where the solution for a problem emerges from the interactions between many simple individual agents called particles. This article proposes the use of the Particle Swarm Optimiser as a new tool for Data Mining. In the first phase of our research, three different Particle Swarm Data Mining Algorithms were implemented and tested against a Genetic Algorithm and a Tree Induction Algorithm (J48). From the obtained results, Particle Swarm Optimisers proved to be a suitable candidate for classification tasks. The second phase was dedicated to improving one of the Particle Swarm optimiser variants in terms of attribute type support and temporal complexity. The data sources here used for experimental testing are commonly used and considered as a de facto standard for rule discovery algorithms reliability ranking. The results obtained in these domains seem to indicate that Particle Swarm Data Mining Algorithms are competitive, not only with other evolutionary techniques, but also with industry standard algorithms such as the J48 algorithm, and can be successfully applied to more demanding problem domains.
15673525
Genetic Algorithms for Component Analysis
Adapted waveform analysis is used extensively in audio, speech, and video coding. In this context, the basic problem is to find out the best representation for a given signal. The strategy is to decompose the signal into time-frequency atoms. The main analysis tool is the expansion of the signal in or-thonormal bases whose elements have good time-frequency localizations. We show that genetic algorithms can be exploited to search libraries of bases for atomic pattern recognition in noisy signals. The proposed algorithm generates best basis decomposition trees through the evolution of well-adapted genetic sequences. Two new types of constraint operators are introduced to guarantee that valid genetic sequences are generated. The approach behaves as an atomic analyzer for signal processing. A test environment is proposed to assess recognition of time-frequency atoms in signal spaces.
7623756
Knowledge Management Systems Development: A Roadmap
This paper approaches the Knowledge Management Systems study, focusing not only in the establishment of essential development activities, but also in techniques, technologies, and tools for their support. Despite of the wide range of existing proposals for the development of this type of systems, none of them has achieved a level detailed enough to allow a direct application. This study is intended to be a palliative for the above-mentioned lack of detail by means of a development guide for Knowledge Management Systems. In this way, the proposed solution offers a clear definition concerning what has to be done and which type of mechanisms should be used for its development.
15079292
Measuring similarity between collection of values
In this paper, we propose a set of similarity metrics for manipulating collections of values occuring in XML documents.
 Following the data model presented in TAX algebra, we treat an XML element as a labeled ordered rooted tree. Consider that XML nodes can be either atomic, i.e, they may contain single values such as short character strings, date, etc, or complex, i.e., nested structures that contain other nodes, we propose two types of similarity metrics: MAVs, for atomic nodes and MCVs, for complex nodes. In the first case, we suggest the use of several application domain dependent metrics. In the second case, we define metrics for complex values that are structure dependent, and can be distinctly applied for it and collections of values. We also present experiments showing the effectiveness of our method.
12195414
Evolving Controllers for Autonomous Agents Using Genetically Programmed Networks
This article presents a new approach to the evolution of controllers for autonomous agents. We propose the evolution of a connectionist structure where each node has an associated program, evolved using genetic programming. We call this structure a Genetically Programmed Network and use it to successfully evolve control systems with very different architectures, by making small restrictions to the evolutionary process. Experimental results of applying this method to evolve neural networks, distributed programs and rule-based systems capable of solving a common benchmark problem, the Ant Problem, are presented. Comparison with other known genetic programming based approaches, shows that our method requires less effort to find a solution.