When designing decentralised autonomic computing systems, a fundamental engineering issue is to assess system-wide behaviour Such decentralised systems are characterised by the lack of global control, typically consis...
详细信息
ISBN:
(纸本)0769522769
When designing decentralised autonomic computing systems, a fundamental engineering issue is to assess system-wide behaviour Such decentralised systems are characterised by the lack of global control, typically consist of autonomous cooperating entities, and often rely on self-organised emergent behaviour to achieve the requirements. A well-founded and practically feasible approach to study overall system behaviour is a prerequisite for successful deployment. On one hand, formal proofs of correct behaviour and even predictions of the exact system-wide behaviour are practically infeasible due to the complex, dynamic, and often non-deterministic nature of self-organising emergent systems. On the other hand, simple simulations give no convincing arguments for guaranteeing system-wide properties. We describe an alternative approach that allows to analyse and assess trends in system-wide behaviour, based on so-called "equation-free" macroscopic analysis. This technique yields more reliable results about the system-wide behaviour compared to mere observation of simulation results, at an affordable computational cost. Numerical algorithms act at the system-wide level and steer the simulations. This allows to limit the amount of simulations considerably. We illustrate the approach by studying a particular system-wide property of a decentralised control system for Automated Guided Vehicles and we outline a road map towards a general methodology for studying decentralised autonomic computing systems.
We present The Cruncher, a simple representation framework and algorithm based on minimum description length for automatically forming an ontology of concepts from attribute-value data sets. Although unsupervised, whe...
详细信息
ISBN:
(纸本)3540278729
We present The Cruncher, a simple representation framework and algorithm based on minimum description length for automatically forming an ontology of concepts from attribute-value data sets. Although unsupervised, when The Cruncher is applied to an animal data set, it produces a nearly zoologically accurate categorization. We demonstrate The Cruncher's utility for finding useful macro-actions in Reinforcement Learning, and for learning models from uninterpreted sensor data. We discuss advantages The Cruncher has over concept lattices and hierarchical clustering.
automatic Summarization is need of the era. Mathematics is an important tool of nonfigurative thinking. A mathematic model of automatic summarization is established and discussed in the paper. The model makes use of m...
详细信息
ISBN:
(纸本)3540283129
automatic Summarization is need of the era. Mathematics is an important tool of nonfigurative thinking. A mathematic model of automatic summarization is established and discussed in the paper. The model makes use of meta-knowledge to describe the composition of the summary and help to calculate the semantic distance between summary and source document. It is proposed that how to get meta-knowledge aggregate and their weight are the key problems in the model.
In this paper we describe a type system for a generative mechanism that generalizes the concept of generic types by combining it with a controlled form of reflection. This mechanism makes many code generation tasks po...
详细信息
ISBN:
(纸本)3540291385
In this paper we describe a type system for a generative mechanism that generalizes the concept of generic types by combining it with a controlled form of reflection. This mechanism makes many code generation tasks possible for which generic types alone would be insufficient. The power of code generation features are carefully balanced with their safety, so that we axe able to perform static type checks on generator code. This leads to a generalized notion of type safety for generators.
This article introduces an application of higher order functions as structure abstractions of recursive(1) functions as a method to reduce a search effort needed for the automatic programming (evolving) of common type...
详细信息
This article introduces an application of higher order functions as structure abstractions of recursive(1) functions as a method to reduce a search effort needed for the automatic programming (evolving) of common types of recursive functions. We will shortly describe a functional paradigm based language specially designed for automatic programming. Henceforward we introduce the structure abstraction functions (AR-functions) and the results of experiments.
Grammatical Evolution is an algorithm for evolving complete programs in an arbitrary language. By utilising a Backus Naur Form grammar the advantages of typing are achieved. A separation of genotype and phenotype allo...
详细信息
ISBN:
(纸本)0780393635
Grammatical Evolution is an algorithm for evolving complete programs in an arbitrary language. By utilising a Backus Naur Form grammar the advantages of typing are achieved. A separation of genotype and phenotype allows the implementation of operators that manipulate (for instance by crossover and mutation) the genotype (in Grammatical Evolution - a sequence of bits) irrespective of the genotype to phenotype mapping (in Grammatical Evolution - an arbitrary grammar). This paper introduces a new type of crossover operator for Grammatical Evolution. The crossover operator uses information automatically extracted from the grammar to minimise any destructive impact from the crossover. The information, which is extracted at the same time as the genome is initially decoded, allows the swapping between entities of complete expansions of non-terminals in the grammar without disrupting useful blocks of code on either side of the two point crossover. In the domains tested, results confirm that the crossover is (i) more productive than hill-climbing;(ii) enables populations to continue to evolve over considerable numbers of generations without intron bloat;and (iii) allows populations (in the domains tested) to reach higher fitness levels, quicker.
Huet and Lang (1978) presented a framework of automated program transformation based on lambda calculus in which programs are transformed according to a given program transformation template. They introduced a second-...
详细信息
ISBN:
(纸本)1595930906
Huet and Lang (1978) presented a framework of automated program transformation based on lambda calculus in which programs are transformed according to a given program transformation template. They introduced a second-order matching algorithm of simply-typed lambda calculus to verify whether the input program matches the template. They also showed how to validate the correctness of the program transformation using the denotational semantics. We propose in this paper a framework of program transformation by templates based on term rewriting. In our new framework, programs are given by term rewriting systems. To automate our program transformation, we introduce a term pattern matching problem and present a sound and complete algorithm that solves this problem. We also discuss how to validate the correctness of program transformation in our framework. We introduce a notion of developed templates and a simple method to construct such templates without explicit use of induction. We then show that in any program transformation by developed templates the correctness of the transformation can be verified automatically. In our framework the correctness of the program transformation is discussed based on the operational semantics. This is a sharp contrast to Huet and Lang's framework. Copyright 2005 ACM.
This paper describes the design for automation and development of manufacturing automation for a law enforcement product, the Narcotics Identification Kit, a high volume product widely used in the field of law enforce...
详细信息
We present a framework and a methodology to build and analyse automatic provers using the Descente Infinie' induction principle. A stronger connection between different proof techniques like those based on implici...
详细信息
ISBN:
(纸本)3540289313
We present a framework and a methodology to build and analyse automatic provers using the Descente Infinie' induction principle. A stronger connection between different proof techniques like those based on implicit induction and saturation is established by uniformly and explicitly representing them as applications of this principle. The framework offers a clear separation between logic and computation, by the means of i) an abstract inference system that defines the maximal sets of induction hypotheses available at every step of a proof, and ii) reasoning modules that perform the computation and allow for modular design of the concrete inference rules. The methodology is applied to define a concrete implicit induction prover and analyse an existing saturation-based inference system.
Minimal generators (mingens) of concept intents are valuable elements of the Formal Concept Analysis (FCA) landscape, which are widely used in the database field, for data mining but also for database design purposes....
详细信息
ISBN:
(纸本)3540277838
Minimal generators (mingens) of concept intents are valuable elements of the Formal Concept Analysis (FCA) landscape, which are widely used in the database field, for data mining but also for database design purposes. The volatility of many real-world datasets has motivated the study of the evolution in the concept set under various modifications of the initial context. We believe this should be extended to the evolution of mingens. In the present paper, we build up on previous work about the incremental maintenance of the mingen family of a context to investigate the case of lattice merge upon context subposition. We first recall the theory underlying the singleton increment and show how it generalizes to lattice merge. Then we present the design of an effective merge procedure for concepts and mingens together with some preliminary experimental results about its performance.
暂无评论