10782860
OrgSwarm - A Particle Swarm Model of Organizational Adaptation
This study extends the particle swarm metaphor to include the domain of organizational adaptation. A simulation model, OrgSwarm, is constructed in order to examine the impact of strategic inertia on the adaptive potential of a population of organizations. The key finding is that a degree of strategic inertia, in the presence of an election mechanism, can assist rather than hamper adaption of the population.
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.
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.
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.
1719989
Empirical Evaluation of SysML through the Modeling of an Industrial Automation Unit
Industrial automation systems may include people, hardware, software and other elements necessary to produce the desirable results. The SysML modeling language is being proposed, by OMG and INCOSE, as a language that allows the system description correctly and consistently among various participants of the same project (software, mechanical, electrical and others engineers). The objective of this work is to evaluate the SysML proposal as a description language for industrial systems through the modeling of an industrial automation unit. A brief system description of the case study is included, the SysML diagrams will be presented during the system modeling and finally comments and considerations about the models and the modeling task are presented.
18125589
Zerg: A Very Fast BLAST Parser Library
SUMMARY
Zerg is a library of sub-routines that parses the output from all NCBI BLAST programs (Blastn, Blastp, Blastx, Tblastn and Tblastx) and returns the attributes of a BLAST report to the user. It is optimized for speed, being especially useful for large-scale genomic analysis. Benchmark tests show that Zerg is over two orders of magnitude faster than some widely used BLAST parsers.


AVAILABILITY
http://bioinfo.iq.usp.br/zerg
30725726
An integrated MOLP method base package - A guided tour of tommix
Abstract An implementation of a MOLP interactive method base is presented in the form of a guided tour to a computer package. The MOLP method base (associated to a procedure toolbox) is a component of a decision support system framework which also integrates a dialogue base and a data management module. Besides providing the standard working of each method the interactive MOLP method base offers the possibility of method switching at any interaction with the decision maker (DM), in order to make the most of the potentialities of each method and support a “learning” process. Some key issues in the development of interactive MOLP approaches and computational tools are also discussed. Special attention is paid to the development of an user-friendly environment for interacting with the DM.
12874902
Behavioural Differential Equations and Coinduction for Binary Trees
We study the set TA of infinite binary trees with nodes labelled in a semiring A from a coalgebraic perspective. We present coinductive definition and proof principles based on the fact that TA carries a final coalgebra structure. By viewing trees as formal power series, we develop a calculus where definitions are presented as behavioural differential equations. We present a general format for these equations that guarantees the existence and uniqueness of solutions. Although technically not very difficult, the resulting framework has surprisingly nice applications, which is illustrated by various concrete examples.
11594682
Framework, Design Patterns and Pattern Language for Object Concurrency
The development of concurrent applications is hard due to the diverse concerns involved and the non-determinism inherent to the implementation environment. In order to control such complexity developers can benefit from objectoriented frameworks providing application-independent solutions which can be specialized for the application-specific needs. A primary contribution of this paper is to describe a family of design patterns for object concurrency which are composed in a three-layered framework. In addition, a pattern language describing an incremental development process which is based on the framework and design patterns is also presented.