Generic programming is accepted by the functionalprogramming community as a valuable tool for program development. Several functional languages have adopted the generic scheme of type-indexed values. this scheme work...
详细信息
ISBN:
(纸本)3540243623
Generic programming is accepted by the functionalprogramming community as a valuable tool for program development. Several functional languages have adopted the generic scheme of type-indexed values. this scheme works by specialization of a generic function to a concrete type. However, the generated code is extremely inefficient compared to its hand-written counterpart. the performance penalty is so big that the practical usefulness of generic programming is compromised. In this paper we present an optimization algorithm that is able to completely eliminate the overhead introduced by the specialization scheme for a large class of generic functions. the presented technique is based on consumer-producer elimination as exploited by fusion, a standard general purpose optimization method. We show that our algorithm is able to optimize many practical examples of generic functions.
the multidimensional data association methods were developed to establish the relation between measurements and tracks especially in dense target situations. However, even these advanced multidimensional data associat...
详细信息
ISBN:
(纸本)0780392868
the multidimensional data association methods were developed to establish the relation between measurements and tracks especially in dense target situations. However, even these advanced multidimensional data association methods lack in situations of unresolved measurement. Specifically, in real dense target situations being of most interest the phenomena of unresolved measurements happens quite often due to the limited sensor resolution. the new algorithm presented in this paper incorporates the unresolved measurement hypothesis into the multidimensional data association approach. An additional feature of this approach is, that also group tracking aspects are considered, which is an essential difference to proposals of other authors. therefore, this new approach significantly increases the data association result as well as track accuracy, continuity and ensures early track initialisation capabilities.
this paper combines work done in the areas of Artificial Intelligence, Multimedia Systems and Coordination programming to derive a framework for Distributed Multimedia Systems based on asynchronous timed computations ...
详细信息
this paper combines work done in the areas of Artificial Intelligence, Multimedia Systems and Coordination programming to derive a framework for Distributed Multimedia Systems based on asynchronous timed computations expressed in a certain coordination formalism. More to the point, we propose the development of multimedia programming frameworks based on the declarative logic programming setting and in particular the framework of object-oriented timed concurrent constraint programming (OO-TCCP). the real-time extensions that have been proposed for the concurrent constraint programming framework are coupled withthe object-oriented and inheritance mechanisms that have been developed for logic programs yielding an integrated declarative environment for multimedia objects modelling, composition and synchronisation. Furthermore, we show how the framework can be implemented in the general-purpose coordination language MANIFOLD without the need for using special architectures or real-time languages. (c) 2004 Elsevier B.V. All rights reserved.
Monads are commonplace programming devices that are used to uniformly structure computations with effects such as state, exceptions, and I/O. this paper further develops the monadic programming paradigm by investigati...
详细信息
Monads are commonplace programming devices that are used to uniformly structure computations with effects such as state, exceptions, and I/O. this paper further develops the monadic programming paradigm by investigating the extent to which monadic computations can be optimised by using generalisations of short cut fusion to eliminate monadic structures whose sole purpose is to "glue together" monadic program components. We make several contributions. First, we show that every inductive type has an associated build combinator and an associated short cut fusion rule. Second, we introduce the notion of an inductive monad to describe those monads that give rise to inductive types, and we give examples of such monads which are widely used in functionalprogramming. third, we generalise the standard augment combinators and cata/augment fusion rules for algebraic data types to types induced by inductive monads. this allows us to give the first cata/augment rules for some common data types, such as rose trees. Fourth, we demonstrate the practical applicability of our generalisations by providing Haskell implementations for all concepts and examples in the paper. Finally, we offer deep theoretical insights by showing that the augment combinators are monadic in nature, and thus that our cata/build and cata/augment rules are arguably the best generally applicable fusion rules obtainable.
the proceedings contain 20 papers from the Formal Methods for Open Object-Based Distributed Systems: 7th IFIP WG 6.1 internationalconference, FMOODS 2005. the topics discussed include: pattern matching over a dynamic...
详细信息
the proceedings contain 20 papers from the Formal Methods for Open Object-Based Distributed Systems: 7th IFIP WG 6.1 internationalconference, FMOODS 2005. the topics discussed include: pattern matching over a dynamic network of tuple spaces;a dynamic class construct for asynchronous concurrent objects;checking the validity of scenarios in UML models;a semantics for UML-RT active classes via mapping into circus;tracing integration analysis in component-based formal specifications;guaranteeing resource bounds for component software;detecting errors in multithreaded programs by generalized predictive analysis of executions;and a distributed implementation of mobile nets as mobile agents.
Higher-order encodings use functions provided by one language to represent variable binders of another. they lead to concise and elegant representations, which historically have been difficult to analyze and manipulat...
详细信息
Defeasible reasoning is a rule-based approach for efficient reasoning with incomplete and inconsistent information. Such reasoning is, among others, useful for ontology integration, where conflicting information arise...
详细信息
Defeasible reasoning is a rule-based approach for efficient reasoning with incomplete and inconsistent information. Such reasoning is, among others, useful for ontology integration, where conflicting information arises naturally;and for the modeling of business rules and policies, where rules with exceptions are often used. this paper describes these scenarios in more detail, and reports on the implementation of a system for defeasible reasoning on the Web. the system (a) is syntactically compatible with RuleML;(b) features strict and defeasible rules, priorities and two kinds of negation;(c) is based on a translation to logic programming with declarative semantics;(d) is flexible and adaptable to different intuitions within defeasible reasoning;and (e) can reason with rules, RDF, RDF Schema and (parts of) OWL ontologies.
Knowledge modeling with Web Ontology Language (OWL) is very complicated because OWL is not for human, but for machine. To effectively describe an ontology represented in OWL, we present a novel visualizing and authori...
详细信息
ISBN:
(纸本)8955191235
Knowledge modeling with Web Ontology Language (OWL) is very complicated because OWL is not for human, but for machine. To effectively describe an ontology represented in OWL, we present a novel visualizing and authoring interface in ezOWL. ezOWL is a visual OWL editor that can intuitively construct an ontology. In this paper, we shows how to visualize and author an ontology intuitively with diagram-based visualizing and authoring techniques.
the proceedings contain 213 papers. the topics discussed include: towards digital optical networks;new glasses and their characterization for Raman gain;nonlinear penalty suppression through the use of optical and dro...
详细信息
ISBN:
(纸本)0780392361
the proceedings contain 213 papers. the topics discussed include: towards digital optical networks;new glasses and their characterization for Raman gain;nonlinear penalty suppression through the use of optical and drop multiplexers;node redundancy in optical burst and packet switched networks;optimization of all-optical gain-clamped lumped Raman fiber amplifier for dynamic performance;future trends in the design of survivable optical networks;mathematical programming evaluation of intrinsic survivability in packet-path networks;comparison of transparent versus opaque interconnecting nodes of OADM rings with respect to failure location;and quality of service differentiation in optical packet/burst switching: a performance and reliability perspective.
the proceedings contain 213 papers. the topics discussed include: towards digital optical networks;new glasses and their characterization for Raman gain;nonlinear penalty suppression through the use of optical and dro...
详细信息
ISBN:
(纸本)0780392361
the proceedings contain 213 papers. the topics discussed include: towards digital optical networks;new glasses and their characterization for Raman gain;nonlinear penalty suppression through the use of optical and drop multiplexers;node redundancy in optical burst and packet switched networks;optimization of all-optical gain-clamped lumped Raman fiber amplifier for dynamic performance;future trends in the design of survivable optical networks;mathematical programming evaluation of intrinsic survivability in packet-path networks;comparison of transparent versus opaque interconnecting nodes of OADM rings with respect to failure location;and quality of service differentiation in optical packet/burst switching: a performance and reliability perspective.
暂无评论