10815817
Distributed Communication
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.
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.
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.
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.
191535
Polymorphy and Hybridization in Genetically Programmed Networks
In this paper we discuss the polymorphic abilities of a new distributed representation for genetic programming, called Genetically Programmed Networks. These are inspired in a common structure in natural complex adaptive systems, where system functionality frequently emerges from the combined functionality of simple computational entities, densely interconnected for information exchange. A Genetically Programmed Network can be evolved into a distributed program, a rule based system or a neural network with simple adjustments to the evolutionary algorithm. The space of possible network topologies can also be easily controlled. This allows the fast exploration of various search spaces thus increasing the possibility of finding a (or a better) solution. Experimental results are presented to support our claims.
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.
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.
18811835
An Empirical Comparison of Particle Swarm and Predator Prey Optimisation
In this paper we present and discuss the results of experimentally comparing the performance of several variants of the standard swarm particle optimiser and a new approach to swarm based optimisation. The new algorithm, which we call predator prey optimiser, combines the ideas of particle swarm optimisation with a predator prey inspired strategy, which is used to maintain diversity in the swarm and preventing premature convergence to local suboptima. This algorithm and the most common variants of the particle swarm optimisers are tested in a set of multimodal functions commonly used as benchmark optimisation problems in evolutionary computation.