pinecone/core-2020-05-10-deduplication huggingface dataset:
Approximating the expressive power of logics in finite models

This is a copy of the author 's final draft version of an article published in the journal Lecture notes in computer science.\ud
The final publication is available at Springer via\ud
http://dx.doi.org/10.1007/b95852We present a probability logic (essentially a first order language extended with quantifiers that count the fraction of elements in a model that satisfy a first order formula) which, on the one hand, captures uniform circuit classes such as AC0 and TC0 over arithmetic models, namely, finite structures with linear order and arithmetic relations, and, on the other hand, their semantics, with respect to our arithmetic models, can be closely approximated by giving interpretations of their formulas on finite structures where all relations (including the order) are restricted to be “modular” (i.e. to act subject to an integer modulo). In order to give a precise measure of the proximity between satisfaction of a formula in an arithmetic model and satisfaction of the same formula in the “approximate” model, we define the approximate formulas and work on a notion of approximate truth. We also indicate how to enhance the expressive power of our probability logic in order to capture polynomial time decidable queries.\ud
\ud
There are various motivations for this work. As of today, there is not known logical description of any computational complexity class below NP which does not requires a built–in linear order. Also, it is widely recognized that many model theoretic techniques for showing definability in logics on finite structures become almost useless when order is present. Hence, if we want to obtain significant lower bound results in computational complexity via the logical description we ought to find ways of by-passing the ordering restriction. With this work we take steps towards understanding how well can we approximate, without a true order, the expressive power of logics that capture complexity classes on ordered structures.Peer ReviewedPostprint (author's final draft
Dynamic deployment and configuration of differentiated services using active networks

This paper presents the detailed components of the Future Active IP Networks (FAIN) [1] [2] [3] active node framework based on the novel Virtual Environment (VE) concept. It also presents the dynamic and autonomic deployment of differentiated services and the configuration capabilities thereof enabled. The FAIN node supports the dynamic deployment and instantiation of multiple active VEs, each one of them capable of hosting multiple Execution Environments (EE) and supporting communication among different EEs in the same node. The EEs may, in turn, be deployed and instantiated on demand thereby introducing new features and functionality in the node according to new requirements and arising needs. We tested the FAIN active network by developing and dynamically deploying a control EE, which was designed and tested for the QoS configuration of the Diffserv-enabled pan-European FAIN testbed [4]. The work presented in this paper was performed in the European Union research and development project under the Information Society Technologies programme
A policy-based management architecture for flexible service deployment in active networks

This paper describes a dynamic, scalable and extensible policy-based network management (PBNM) system that is fully integrated with a service provisioning architectures for active networks. The key result is network customisation according to the needs of the different service providers and its end users. Our component-based service provisioning architecture enables us to render service- and user-specific requirements, across single/multiple administrative domains, at deployment time and to dynamically map service components onto the network using the corresponding management policies. The architecture presented in this paper describes the approach undertaken by the IST-FAIN research project as well as the main issues that we encounter in developing and integrating the PBNM with the service provisioning mechanism
Risky Business: Motivations for Markets in Programmable Networks

We believe that the problems of safety, security and resource usage combine to make it unlikely that programmable networks will ever be viable without mechanisms to transfer risk from the platform provider to the user and the programmer. However, we have well established mechanisms for managing risk - markets. In this paper we argue for the establishment of markets to manage the risk in running a piece of software and to ensure that the risk is reflected on all the stakeholders. We describe a strawman architecture for third party computation in the programmable network. Within this architecture, we identify two major novel features:- Dynamic price setting, and a reputation service. We investigate the feasibility of these features and provide evidence that a practical system can indeed be built. Our contributions are in the argument for markets providing a risk management mechanism for programmable networks, the development of an economic model showing incentives for developing better software, and in the first analysis of a real transaction graph for reputation systems from an Internet commerce site
Content-Aware DataGuides for Indexing Large Collections of XML Documents

XML is well-suited for modelling structured data with
textual content. However, most indexing approaches perform
structure and content matching independently, combining
the retrieved path and keyword occurrences in a third
step. This paper shows that retrieval in XML documents can
be accelerated significantly by processing text and structure
simultaneously during all retrieval phases. To this end,
the Content-Aware DataGuide (CADG) enhances the wellknown
DataGuide with (1) simultaneous keyword and path
matching and (2) a precomputed content/structure join. Extensive
experiments prove the CADG to be 50-90% faster
than the DataGuide for various sorts of query and document,
including difficult cases such as poorly structured
queries and recursive document paths. A new query classification
scheme identifies precise query characteristics with
a predominant influence on the performance of the individual
indices. The experiments show that the CADG is applicable
to many real-world applications, in particular large
collections of heterogeneously structured XML documents.
Viewpoint-based testing of concurrent components

The use of multiple partial viewpoints is recommended for specification. We believe they also can be useful for devising strategies for testing. In this paper, we use Object-Z to formally specify concurrent Java components from viewpoints based on the separation of application and synchronisation concerns inherent in Java monitors. We then use the Test-Template Framework on the Object-Z viewpoints to devise a strategy for testing the components. When combining the test templates for the different viewpoints we focus on the observable behaviour of the application to systematically derive a practical testing strategy. The Producer-Consumer and Readers-Writers problems are considered as case studies
Verifying Controlled Components.

Recent work on combining CSP and B has provided ways of describing systems comprised of components described in both B (to express requirements on state) and CSP (to express interactive and controller behaviour). This approach is driven by the desire to exploit existing tool support for both CSP and B, and by the need for compositional proof techniques. This paper is concerned with the theory underpinning the approach, and proves a number of results for the development and verification of systems described using a combination of CSP and B. In particular, new results are obtained for the use of the hiding operator, which is essential for abstraction. The paper provides theorems which enable results obtained (possibly with tools) on the CSP part of the description to be lifted to the combination. Also, a better understanding of the interaction between CSP controllers and B machines in terms of non-discriminating and open behaviour on channels is introduced, and applied to the deadlock-freedom theorem. The results are illustrated with a toy lift controller running example
Formalising behaviour trees with CSP

Behaviour Trees is a novel approach for requirements engineering. It advocates a graphical tree notation that is easy to use and to understand. Individual requirements axe modelled as single trees which later on are integrated into a model of the system as a whole. We develop a formal semantics for a subset of Behaviour Trees using CSP. This work, on one hand, provides tool support for Behaviour Trees. On the other hand, it builds a front-end to a subset of the CSP notation and gives CSP users a new modelling strategy which is well suited to the challenges of requirements engineering
Improving the compilation of prolog to C using moded types and determinism information

We describe the current status of and provide performance\ud
results for a prototype compiler of Prolog to C, ciaocc. ciaocc is novel in that it is designed to accept different kinds of high-level information, typically obtained via an automatic analysis of the initial Prolog program and expressed in a standardized language of assertions. This information is used to optimize the resulting C code, which is then processed by an off-the-shelf C compiler. The basic translation process essentially mimics the unfolding of a bytecode emulator with respect to the particular bytecode corresponding to the Prolog program. This is facilitated by a flexible design of the instructions and their lower-level components. This approach allows reusing a sizable amount of the machinery of the bytecode emulator: predicates already written in C, data definitions, memory management routines and áreas, etc., as well as mixing emulated bytecode with native code in a relatively straightforward way. We report on the performance of programs compiled by the current versión of the system, both with and without analysis information
A low-memory parallel version of Matsuo, Chao and Tsujii's algorithm

International audienceWe present an algorithm based on the birthday paradox, which is a low-memory parallel counterpart to the algorithm of Matsuo, Chao and Tsujii. This algorithm computes the group order of the Jacobian of a genus 2 curve over a finite field for which the characteristic polynomial of the Frobenius endomorphism is known modulo some integer. The main tool is a 2-dimensional pseudo-random walk that allows to heuristically choose random elements in a 2-dimensional space. We analyze the expected running time based on heuristics that we validate by computer experiments. Compared with the original algorithm by Matsuo, Chao and Tsujii, we lose a factor of about 3 in running time, but the memory requirement drops from several GB to almost nothing. Our method is general and can be applied in other contexts to transform a baby-step giant-step approach into a low memory algorithm
A flexible and secure deployment framework for distributed applications

This paper describes an implemented system which is designed to support the deployment of applications offering distributed services, comprising a number of distributed components. This is achieved by creating high level placement and topology descriptions which drive tools that deploy applications consisting of components running on multiple hosts. The system addresses issues of heterogeneity by providing abstractions over host-specific attributes yielding a homogeneous run-time environment into which components may be deployed. The run-time environments provide secure binding mechanisms that permit deployed components to bind to stored data and services on the hosts on which they are running.Postprin
What can spider diagrams say?

Spider diagrams are a visual notation for expressing logical statements. In this paper we identify a well known fragment of first order predicate logic, that we call ESD, equivalent in expressive power to the spider diagram language. The language ESD is monadic and includes equality but has no constants or function symbols. To show this equivalence, in one direction, for each diagram we construct a sentence in ESD that expresses the same information. For the more challenging converse we show there exists a finite set of models for a sentence S that can be used to classify all the models for S. Using these classifying models we show that there is a diagram expressing the same information as S
Generating readable proofs: a heuristic approach to theorum proving with spider diagrams

An important aim of diagrammatic reasoning is to make it easier for people to create and understand logical arguments. We have worked on spider diagrams, which visually express logical statements. Ideally, automatically generated proofs should be short and easy to understand. An existing proof generator for spider diagrams successfully writes proofs, but they can be long and unwieldy. In this paper, we present a new approach to proof writing in diagrammatic systems, which is guaranteed to find shortest proofs and can be extended to incorporate other readability criteria. We apply the A* algorithm and develop an admissible heuristic function to guide automatic proof construction. We demonstrate the effectiveness of the heuristic used. The work has been implemented as part of a spider diagram reasoning tool
A Cognitive Processing Perspective on Student Programmers' 'Graphicacy'

The 'graphicacy' of student programmers was investigated using several cognitive tasks designed to assess ER knowledge representation at the perceptual, semantic and output levels of the cognitive system. A large corpus of external representations (ERs) was used as stimuli. The question lsquoHow domain-specific is the ER knowledge of programmers?rsquo was addressed. Results showed that performance for programming-specific ER forms was equal to or slightly better than performance for non-specific ERs on the decision, naming and functional knowledge tasks, but not the categorisation task. Surprisingly, tree and network diagrams were particularly poorly named and categorised. Across the ER tasks, performance was found to be highest for textual ERs, lists, maps and notations (more ubiquitous, lsquoeverydayrsquo ER forms). Decision task performance was generally good across ER types indicating that participants were able to recognise the visual form of a wide range of ERs at a perceptual level. In general, the patterns of performance seem to be consistent with those described for the cognitive processing of visual objects
Supporting Tropos Concepts in Agent Open

The growth of interest in agent-orientation as a new paradigm has introduced the need for developing concepts, tools and techniques for modeling and engineering agent-based software systems. Object technology has been supporting the development of information systems for many years but is now slowly evolving to encompass more recent ideas relating to the concept of ldquoagentrdquo. Integrating agent concepts into existing OO methodologies has resulted in several agent-oriented methodologies, one of which is Agent OPEN. In this paper, we evaluate the existing Agent OPEN description against ideas formulated within Tropos, an agent-oriented software development methodology
Semantic web technologies for economic and financial information management

The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-540-25956-5_33Proceedings of First European Semantic Web Symposium, ESWS 2004 Heraklion, Crete, Greece, May 10-12, 2004.The field of economy and finance is a conceptually rich domain where information is complex, huge in volume and a highly valuable business product by itself. Novel management techniques are required for economic and financial information in order to enable an efficient generation, management and consumption of complex and big information resources. Following this direction, we have developed and ontology-based platform that provides a) the integration of contents and semantics in a knowledge base that provides a conceptual view on low-level contents, b) an adaptive hypermedia-based knowledge visualization and navigation system and c) semantic search facilities. We have developed, as the basis of this platform, an ontology for the domain of economic and financial information.This work is funded by the Spanish Ministry of Science and Technology, grants FIT-150500-2003-309, TIC2002-1948
Knowledge discovery in an agents environment

We describe work undertaken to investigate automated querying of simple forms of ontology by software agents to acquire the semantics of metadata terms. Individual terms as well as whole vocabularies can be investigated by agents through a software interface and by humans through an interactive web-based interface. The server supports discovery, sharing and re-use of vocabularies and specific terms, facilitating machine interpretation of semantics and convergence of ontologies in specific domains. Exposure, and hence alignment through ontological engineering should lead to an improvement in interoperability of systems in particular sectors such as education, cultural heritage and publishing
CERVANTES - A certificate validation test-bed

Certificate validation is one of the toughest scalability problems of the PKI. The goal of this paper is to introduce a Java platform for certificate revocation called CERVANTES. CERVANTES pretends to be an easy to extend tool that allows researchers to develop and test their own “real” revocation systems. As CERVANTES is an open source project it can also be included as part of any open PKI project. The platform is very flexible and due to its modular design it allows for example, to fit a new kind of status checking protocol without having to recompile the source code. CERVANTES includes our implementations of the main standards (CRLs and OCSP) as well as an implementation of a system based on the Merkle Hash Tree (one of the most popular systems among the non-standard ones). Finally, we use CERVANTES to obtain performance results about each developped system. These results guarantee that CERVANTES runs as expected.Peer ReviewedPostprint (published version
Interaction and Expressivity in Video Games: Harnessing the Rhetoric of Film

The film-maker uses the camera and editing creatively, not simply to present the action of the film but also to set up a particular relation between the action and the viewer. In 3D video games with action controlled by the player, the pseudo camera is usually less creatively controlled and has less effect on the player’s appreciation of and engagement with the game. This paper discusses methods of controlling games by easy and intuitive interfaces and use of an automated virtual camera to increase the appeal of games for users
Convergence of discrete MDL for sequential prediction

We study the properties of the Minimum Description Length principle for sequence prediction, considering a two-part MDL estimator which is chosen from a countable class of models. This applies in particular to the important case of universal sequence prediction, where the model class corresponds to all algorithms for some fixed universal Turing machine (this correspondence is by enumerable semimeasures, hence the resulting models are stochastic). We prove convergence theorems similar to Solomonoff’s theorem of universal induction, which also holds for general Bayes mixtures. The bound characterizing the convergence speed for MDL predictions is exponentially larger as compared to Bayes mixtures. We observe that there are at least three different ways of using MDL for prediction. One of these has worse prediction properties, for which predictions only converge if the MDL estimator stabilizes. We establish sufficient conditions for this to occur. Finally, some immediate consequences for complexity relations and randomness criteria are proven.This work was supported by SNF grant 2100-67712.02
A transsignaling strategy for QoS support in heterogeneous networks

The increasing usage of multiple signalling mechanisms, with associated QoS extensions, creates several problems to commercial data networks. New and scalable approaches are required for the network operator to support this diversity. This paper discusses a highly flexible, scalable architecture for processing QoS Admission Control in public networks. The architecture relies on the cooperation of two different entities, an agent and a manager, with fully distributed implementation, and able to perform the required signalling, authorization, and admission control decisions. If required, the agent is capable of interfacing with different signalling mechanisms. Early implementation conclusions are also presented. This architecture is capable of operating with multiple QoS frameworks, with minimal added overhead
Personalizing digital libraries at design time: the Miguel de Cervantes Digital Library case study

In this article we describe our experience in the development of a personalizable dissemination model for the Miguel de Cervantes Digital Library’s Web-based newsletter-service, which combines adaptive with adaptable personalization techniques, being capable or ranking news according to navigation-inferred preferences and then filter them according to a user-given profile. We explain how Web engineering design techniques have been applied to make that service evolve into a more adaptive personalization approach obtaining more effective results. The work is presented in the context of the OO-H [5] web design method.This paper has been partially supported by the Spanish Ministry of Science and Technology (Ministerio de Ciencia y Tecnología de España), project TIC2001-3530-C02-02
Using adaptive techniques to validate and correct an audience driven design of web sites

An audience driven philosophy for web site design takes the different target audiences as an explicit starting point, and organizes the basic navigation structure accordingly. However, for the designer it is not always easy, or sometimes even impossible, to assess the different requirements of the different target audiences correctly. In this paper, we show how to correct for such possible flaws using adaptive behavior. A mechanism for detecting both missing and superfluous information in a certain user’s navigation path, by observing user’s browsing behavior, is provided. The designer specifies possible adaptive changes based upon this detection at design time, using a language (Adaptation Specification Language) designed specifically to express changes in the navigation structure of a website
Authoring and dynamic generation of adaptive e-courses

The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-540-27834-4_93Proceedings of the 4th International Conference, ICWE 2004, Munich, Germany, July 26-30, 2004.Adaptive hypermedia constitutes a pretty rich resource for developing web-based courses. With the aim of dynamically generating adaptive e-courses, we have developed the TANGOW system which, starting from the course components and their adaptation capabilities (specified independently and out of the adaptation engine), generates different courses for students with different profiles, supporting several adaptation strategies. An integral part of any adaptive hypermedia system is the set of authoring tools to specify the course components and their adaptation capabilities. Without adequate tool support, authors may feel that it is “not worth the effort” to add adaptation to their courses. However, the development of this type of tools is not an easy task. The main goal of our authoring and visualization tools is to provide a simple interface to create such courses. This demo would demonstrate i) the dynamic generation of tailored e-courses that include individual and collaborative activities and ii) the use of authoring tools for the creation of such courses