the proceedings contain 64 papers. the topics discussed include: forcing monotonicity in parameterized verification: from multisets to words;essential performance drivers in native XML DBMSs;continuous processing of p...
ISBN:
(纸本)3642050050
the proceedings contain 64 papers. the topics discussed include: forcing monotonicity in parameterized verification: from multisets to words;essential performance drivers in native XML DBMSs;continuous processing of preference queries in data streams;clock synchronization: open problems in theory and practice;lessons in software evolution learned by listening to smalltalk;model-driven software product line testing: an integrated approach;a rule format for unit elements;approximability of edge matching puzzles;a linear time algorithm for finding three edge-disjoint paths in Eulerian networks;R-programs: a framework for distributing XML structural joins across function calls;fast arc-annotated subsequence matching in linear space;a kernel for convex recoloring of weighted forests;symbolic OBDD-based reachability analysis needs exponential space;and a social vision of knowledge representation and reasoning.
We show that the graph property of having a (very) large k-th Betti number βk (over Z2) for constant k is testable with a constant number of queries in the dense graph model. More specifically, we consider a clique c...
详细信息
Web science studies the interpay between web technology and the human behaviour it induces at the micro, meso and macro level. In this extended abstract we examine Web science research issues by taking a closer look a...
详细信息
ISBN:
(纸本)9783642112652
Web science studies the interpay between web technology and the human behaviour it induces at the micro, meso and macro level. In this extended abstract we examine Web science research issues by taking a closer look at the area of digital heritage. We discuss engineering, communication and socio-economic aspects.
Clock synchronization is one of the most basic building blocks for many applications in computerscience and engineering. the purpose of clock synchronization is to provide the constituent parts of a distributed syste...
详细信息
ISBN:
(纸本)9783642112652
Clock synchronization is one of the most basic building blocks for many applications in computerscience and engineering. the purpose of clock synchronization is to provide the constituent parts of a distributed system with a common notion of time. While the problem of synchronizing clocks in distributed systems has already received considerable attention from researchers and practitioners alike, we believe that there are many fascinating problems that remain unsolved. In this paper, we give a brief overview of previous work in this area;followed by a discussion of open clock synchronization problems in theory and practice.
Quality of collective inference relational graph classifier depends on a. degree of homophily in a classified graph. If we increase homophily in the graph, the classifier would assign class-membership to the instances...
详细信息
ISBN:
(纸本)9783642112652
Quality of collective inference relational graph classifier depends on a. degree of homophily in a classified graph. If we increase homophily in the graph, the classifier would assign class-membership to the instances with reduced error rate. We propose to substitute traditionally used graph neighborhood method (based on direct neighborhood of vertex) with local graph ranking algorithm (activation spreading), which provides wider set of neighboring vertices and their weights. We demonstrate that our approach increases homophily in the graph by inferring optimal homophily distribution of a binary Simple Relational Classifier in an unweighted graph. We validate this ability also experimentally using the Social Network of the Slovak Companies dataset.
the biggest challenge facing software developers today is how to gracefully evolve complex software systems in the face of changing requirements. We clearly need software systems to be more dynamic, compositional and ...
详细信息
ISBN:
(纸本)9783642112652
the biggest challenge facing software developers today is how to gracefully evolve complex software systems in the face of changing requirements. We clearly need software systems to be more dynamic, compositional and model-centric, but instead we continue to build systems that are static, baroque and inflexible. How can we better build change-enabled systems in the future? To answer this question, we propose to look back to one of the most successful systems to support change, namely Smalltalk. We briefly introduce Smalltalk with a few simple examples, and draw some lessons for software evolution. Smalltalk's simplicity, its reflective design, and its highly dynamic nature all go a long way towards enabling change in Smalltalk applications. We then illustrate how these lessons work in practice by reviewing a number of research projects that support software evolution by exploiting Smalltalk's design. We conclude by summarizing open issues and challenges for change-enabled systems of the future.
We study properties characterized by applying successively a "destructive" rule expressed in first-order logic. the rule says that Points, a(1),...,a(k) of a structure can be removed if they satisfy a certai...
详细信息
ISBN:
(纸本)9783642112652
We study properties characterized by applying successively a "destructive" rule expressed in first-order logic. the rule says that Points, a(1),...,a(k) of a structure can be removed if they satisfy a certain first-order formula. phi(a(1),...,a(k)). the property defined this way by the formula is the set of finite structures such that we are able to obtain the empty structure when applying the rule repeatedly. Many classical properties can be formulated by means of a. "destructive" rule. We do a systematic study of the computational complexity of these properties according to the fragment of first-order logic in which the rule is expressed. We give the list of minimal fragments able to define NP-complete properties and maximal fragments that define only PTIME properties (unless PTIME = NP), depending on the number k of free variables and the quantifier symbols used in the formula. We also study more specifically the case where the formula has one free variable and is universal.
Programmers rely on programming idioms, design patterns, and workaround techniques to make up for missing programming language support. Evolving languages often address frequently encountered problems by adding langua...
详细信息
ISBN:
(纸本)9783642112652
Programmers rely on programming idioms, design patterns, and workaround techniques to make up for missing programming language support. Evolving languages often address frequently encountered problems by adding language and library support to subsequent releases. By using new features, programmers can express their intent more directly. As new concerns, such as parallelism or security, arise, early idioms and language facilities can become serious liabilities. Modern code sometimes benefits from optimization techniques not feasible for code that uses less expressive constructs. Manual source code migration is expensive, time-consuming, and prone to errors. In this paper, we present the notion of source code rejuvenation, the automated migration of legacy code and very briefly mention the tools we use to achieve that. While refactoring improves structurally inadequate source code, source code rejuvenation leverages enhanced program language and library facilities by finding and replacing coding patterns that can be expressed through higher-level software abstractions. Raising the level of abstraction benefits software maintainability, security, and performance.
We present a characterization of the class of context-free trace languages in terms of cooperating distributed systems (CD-systems) of stateless deterministic restarting automata with window size 1 that are governed b...
详细信息
ISBN:
(纸本)9783642183805
We present a characterization of the class of context-free trace languages in terms of cooperating distributed systems (CD-systems) of stateless deterministic restarting automata with window size 1 that are governed by an external pushdown store.
Inductive logic programming (ILP) [12] is concerned withthe induction of theories from specific examples and background knowledge, using first-order logic representations for all the three ingredients. In its early d...
详细信息
暂无评论