pinecone/core-2020-05-10-deduplication huggingface dataset:
Encoding and retrieval in a CA1 microcircuit model of the hippocampus

Recent years have witnessed a dramatic accumulation of\ud
knowledge about the morphological, physiological and molecular characteristics,\ud
as well as connectivity and synaptic properties of neurons in\ud
the mammalian hippocampus. Despite these advances, very little insight\ud
has been gained into the computational function of the different neuronal\ud
classes; in particular, the role of the various inhibitory interneurons in\ud
encoding and retrieval of information remains elusive. Mathematical and\ud
computational models of microcircuits play an instrumental role in exploring\ud
microcircuit functions and facilitate the dissection of operations\ud
performed by diverse inhibitory interneurons. A model of the CA1 microcircuitry\ud
is presented using biophysical representations of its major cell\ud
types: pyramidal, basket, axo-axonic, bistratified and oriens lacunosummoleculare\ud
cells. Computer simulations explore the biophysical mechanisms\ud
by which encoding and retrieval of spatio-temporal input patterns\ud
are achieved by the CA1 microcircuitry. The model proposes functional\ud
roles for the different classes of inhibitory interneurons in the encoding\ud
and retrieval cycles
Quantum electrodynamics

This textbook on Quantum Electrodynamics is a thorough introductory text providing all necessary mathematical tools together with many examples and worked problems. In their presentation of the subject the authors adopt a heuristic approach based on the propagator formalism. The latter is introduced in the first two chapters in both its nonrelativistic and relativistic versions. Subsequently, a large number of scattering and radiation processes involving electrons, positrons, and photons are introduced and their theoretical treatment is presented in great detail. Higher order processes and renormalization are also included. The book concludes with a discussion of two-particle states and the interaction of spinless bosons. This completely revised and corrected new edition provides several additions to enable deeper insight in formalism and application of quantum electrodynamics
Distributed preservation services: integrating planning and actions

Digital preservation has turned into an active field of research. The most prominent approaches today are migration and emulation; especially considering migration, a range of working tools is available, each with specific strengths and weaknesses. The decision process on which actions to take to preserve a given set of digital ob jects for future access, i.e., preservation planning, is usually an ad-hoc procedure with little tool support and even less support for automation. This paper presents the integration of tools and services for object migration and characterization through a service oriented architecture into a planning tool called Plato, thus creating a distributed and highly 
automated preservation planning environment.Fundação para a Ciência e a Tecnologia (FCT) - bolsa SFRH/BD/17334/2004.Digital Preservation Europ
FDIR architectures for autonomous spacecraft: specification and assessment with event-B

On-board Fault Detection, Isolation and Recovery (FDIR) systems are considered to ensure the safety and to increase the autonomy of spacecrafts. They shall be carefully designed and validated. Theirimplementation involves a relevant knowledge of items like functions and architectures of the system, and a fault model in relation with these items. Thus, the event-B method is well suited to correctly specify and validate on-board safety architectures. This paper focuses on the FDIR concept presentation and the use of event-B for formalising and for refining the FDIR concept
Measuring learning object reuse

This paper presents a quantitative analysis of the reuse of learning objects in real world settings. The data for this analysis was obtained from three sources: Connexions’ modules, University courses and Presentation components. They represent the reuse of learning objects at different granularity levels. Data from other types of reusable components, such as software libraries, Wikipedia images and Web APIs, were used for comparison purposes. Finally, the paper discusses the implications of the findings in the field of Learning Object research.status: publishe
Friends Forever: Social Relationships with a Fuzzy Agent-Based Model

<p>Sociological research shows that friendship and partner choice tend to  reveal a bias toward social similarity. These relations are ruled by the so called  “proximity principle” which states that the more similar two individuals are, the  more likely they will become friends. However, proximity, similarity or friend-  ship are concepts with blurred edges and grades of membership (acquaintances,  friends, couples). Therefore, in order to model the friendship dynamics we work  on an Agent-Based Model that already manages the social relationships, together  with demographics and evolutionary crossover. To introduce these theoretical  concepts we decided to fuzzify the system, explaining the process in detail. Thus,  we end up with fuzzy sets and operations, a fuzzy friendship relationship, and a  logistic function for its evolution.</p
A Platform for Object-Action Semantic Web Interaction

Semantic Web applications tests show that their usability is seriously
compromised. This motivates the exploration of alternative interaction paradigms,
different from the "traditional" Web or desktop applications ones. The
Rhizomer platform is based on the object-action interaction paradigm, which is
better suited for heterogeneous resource spaces such as those common in the
Semantic Web. Resources, described by means of RDF metadata, correspond to
the objects from the interaction point of view and Rhizomer provides browsing
mechanisms for them. Semantic web services, dynamically associated to these
objects, correspond to the actions. Rhizomer has been applied in the context of
a media house to build an audiovisual content management system. End-users
of this system, journalists and archivists, are able to navigate the content repository
through semantic metadata describing content pieces and the domain
knowledge these pieces are referring to. Those resources constitute the objects
to which, when the user selects one of them, semantic web services dynamically
associate specialized visualization and interaction views, the actions.The work described in this paper has been partially supported by Spanish Ministry of Science and Education through the Scalable Semantic personalised Search of Spoken and written contents on the Semantic Web (S5T) research project (TIN2005-06885)
Automating the processes of selecting an appropriate scheduling algorithm and configuring the scheduler implementation for time-triggered embedded systems

This is the author’s final draft of the conference paper given at Proceedings of the 27th international conference on Computer Safety, Reliability, and Security 2008, published as Lecture Notes In Computer Science, 2008, 5219, pp. 440 - 453.  The final published version is available at http://www.springerlink.com/home, Doi: 10.1007/978-3-540-87698-4_36.Predictable system behaviour is a necessary (but not sufficient) condition when creating safety-critical and safety-related embedded systems. At the heart of such systems there is usually a form of scheduler: the use of time-triggered schedulers is of particular concern in this paper. It has been demonstrated in previous studies that the problem of determining the task parameters for such a scheduler is NP-hard. We have previously described an algorithm (“TTSA1”) which is intended to address this problem. This paper describes an extended version of this algorithm (“TTSA2”) which employs task segmentation to increase schedulability. We show that the TTSA2 algorithm is highly efficient when compared with alternative “branch and bound” search schemes
A memetic algorithm for the delineation of local labour markets

Given a territory composed of basic geographical units, the delineation of local labour market areas (LLMAs) can be seen as a problem in which those units are grouped subject to multiple constraints. In previous research, standard genetic algorithms were not able to find valid solutions, and a specific evolutionary algorithm was developed. The inclusion of multiple ad hoc operators allowed the algorithm to find better solutions than those of a widely-used greedy method. However, the percentage of invalid solutions was still very high. In this paper we improve that evolutionary algorithm through the inclusion of (i) a reparation process, that allows every invalid individual to fulfil the constraints and contribute to the evolution, and (ii) a hillclimbing optimisation procedure for each generated individual by means of an appropriate reassignment of some of its constituent units. We compare the results of both techniques against the previous results and a greedy method.José M. Casado-Díaz has received financial support from the Spanish Ministry of Transports (Ministerio de Fomento) for the project ”New methods for the analysis of the determinants and effects of commuting flows (MOVICO)” under Grant T 75/2006 (Spanish National Plan of A+D+i). Lucas Martíınez-Bernabeu acknowledges financial support from the Spanish Ministry of Education and Science, the European Social Fund (ESF) and the University of Alicante. Raúl Gómez-Hernández acknowledges financial support from the University of Alicante
Driving Cars by Means of Genetic Algorithms

Proceedings of: 10th International Conference on
Parallel Problem Solving From Nature, PPSN 2008. Dortmund, Germany, September 13-17, 2008The techniques and the technologies supporting Automatic Vehicle Guidance are an important issue. Automobile manufacturers view automatic driving as a very interesting product with motivating key features which allow improvement of the safety of the car, reducing emission or fuel consumption or optimizing driver comfort during long journeys. Car racing is an active research field where new advances in aerodynamics, consumption and engine power are critical each season. Our proposal is to research how evolutionary computation techniques can help in this field. As a first goal we want to automatically learn to drive, by means of genetic algorithms, optimizing lap times while driving through three different circuits.Publicad
Particle filter with swarm move for optimization

Copyright @ Springer-Verlag Berlin Heidelberg 2008.We propose a novel generalized algorithmic framework to utilize particle filter for optimization incorporated with the swarm move method in particle swarm optimization (PSO). In this way, the PSO update equation is treated as the system dynamic in the state space model, while the objective function in optimization problem is designed as the observation/measurement in the state space model. Particle filter method is then applied to track the dynamic movement of the particle swarm and therefore results in a novel stochastic optimization tool, where the ability of PSO in searching the optimal position can be embedded into the particle filter optimization method. Finally, simulation results show that the proposed novel approach has significant improvement in both convergence speed and final fitness in comparison with the PSO algorithm over a set of standard benchmark problems.The work was supported by the Engineering and Physical Sciences Research Council(EPSRC) of UK under Grant EP/E060722/1
Nature-inspired synthesis of rational protocols

Proceedings of: 10th International Conference on Parallel Problem Solving from Nature (PPSN 2008), Dortmund, Germany, September 13-17, 2008.Rational cryptography is an emerging field which combines aspects traditionally related to security with concepts described in economic theoretical frameworks. For example, it applies game theory concepts to address security problems arising when executing cryptographic protocols. The aim is to replace the assumption of a worst-case attacker by the notion of rational agents that try to maximize their payoffs. In this work, we define a formal framework and a meta--heuristic technique for the automated synthesis of multi-party rational exchange security (M-RES) protocols. We provide experimental results for a simple scenario where a 3-party rational exchange protocol is automatically designed.Publicad
Visual programming with Interaction Nets

Programming directly with diagrams offers potential advantages such as visual intuitions, identification of errors (debugging), and insight into the dynamics of the algorithm. The purpose of this paper is to put forward one particular graphical formalism, interaction nets, as a candidate for visual programming which has not only all the desired properties that one would expect, but also has other benefits as a language, for instance sharing computation.Fundação para a Ciência e a Tecnologia (FCT
Edit distances and factorisations of even permutations

A number of fields, including genome rearrangements and interconnection network design, are concerned with sorting permutations in “as few moves as possible”, using a given set of allowed operations. These often act on just one or two segments of the permutation, e.g. by reversing one segment or exchanging two segments. The cycle graph of the permutation to sort is a fundamental tool in the theory of genome rearrangements. In this paper, we present an algebraic reinterpretation of the cycle graph as an even permutation, and show how to reformulate our sorting problems in terms of particular factorisations of the latter permutation. Using our framework, we recover known results in a simple and unified way, and obtain a new lower bound on the prefix transposition distance (where a prefix transposition displaces the initial segment of a permutation), which is shown to outperform previous results. Moreover, we use our approach to improve the best known lower bound on the prefix transposition diameter from 2n/3 to (3n+1)/(4).status: publishe
Callimachus DL: using semantics to enhance search and etrieval in a digital library.

Proceedings of: First World Summit on the Knowledge Society, (WSKS 2008), Athens, Greece, September 24-26, 2008Among the challenges of classifying, locating and accessing knowledge in Digital Libraries tackling with the huge amount of resources the Web provides, improving Digital Libraries by means of different strategies, particularly, using semantics remains a promising and interesting approach. In this paper, we present CallimachusDL, a semantics-based Digital Library which provides faceted search, enhanced access possibilities and a proof-of-concept implementation.Publicad
Emergent Innovation and Sustainable Knowledge Co-creation. A Socio-Epistemological Approach to “Innovation from within”

Innovation has become one of the most important issues in modern knowledge society. As opposed to radical innovation this paper introduces the concept of Emergent Innovation: this approach tries to balance and integrate the demand both for radically new knowledge and at the same time for an organic development from within the organization. From a more general perspective one can boil down this problem to the question of how to cope with the new and with profound change (in knowledge). This question will be dealt with in the first part of the paper. As an implication the alternative approach of Emergent Innovation will be presented in the second part: this approach looks at innovation as a socio-epistemological process of “learning from the future” in order to create (radically) new knowledge in a sustainable and “organic” manner. Implications for knowledge society will be discussed.
Software engineering 2.0: a social global repository based on semantic annotation and social web for knowledge management

Proceedings of: First World Summit on the Knowledge Society, (WSKS 2008), September 24-26, 2008, Athens (Greece)The effective management of the software development process has become an essential for business survival in an ever more competitive industry. In order to gain business strengths from the development process, organizations need to carry out software development in the most efficient manner possible, avoiding redundancy and time losses. This paper presents an architecture which combines the strengths of two technologies, Web 2.0 and the Semantic Web, as a solution to reuse and extrapolate knowledge and software products across projects and organizations.Publicad
The effect of organizational learning tools in business results

The importance of the tools that facilitate organizational learning has traditionally
been outlined in the literature. Information Technologies (ITs) are considered
as common facilitating tools for all learning agents by researches and practitioners.
Our study focuses on the question what ITs are essential for
organizational learning and how they actively contribute to the business results
(operative and financial). The results exhibit that the use of databases generates
larger sales volumes and better operative results. Companies with low profits
tend to use Internet more often and this use improves operative results. Also the
use of the electronic mail increases the sales volume
Propositional Clausal Defeasible Logic

Abstract. Defeasible logics are non-monotonic reasoning systems that   have efficient implementations and practical applications. We list several   desirable properties and note that each defeasible logic fails to have some   of these properties. We de?ne and explain a new defeasible logic, called   clausal defeasible logic (CDL), which has all these properties. CDL is easy   to implement, consistent, detects loops, terminates, and has a range of   deduction algorithms to cater for a range of intuitions.Griffith Sciences, School of Information and Communication TechnologyFull Tex
Providing integrated development environments for multiagent systems

The computing industry has yet to take up agent technology as a new approach to software development. While other paradigms are supported by various tools, including generic IDEs, these are not well developed for agentware. Many agent platforms provide some form of IDE but these are platformspecific and are typically so tightly coupled to their agent platforms that they offer little re-use. There has been too little discussion about which tools an IDE should contain and few attempts to produce a generic IDE. In this paper, we\ud
identify two levels of abstraction requiring IDE tool support and draw on current\ud
research to categorise a set of generic tools for each level. We describe the\ud
reasons why existing MAS IDEs are coupled to their platforms and present an extendible software architecture which avoids this coupling. We build an IDE using this architecture and demonstrate its decoupling and extensibility by experimentation
An invariant-based method for the analysis of declarative model-to-model transformations

The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-540-87875-9_3Proceedings of 11th International Conference, MoDELS 2008, Toulouse, France, September 28 - October 3, 2008In this paper we propose a method to derive OCL invariants from declarative specifications of model-to-model transformations. In particular we consider two of the most prominent approaches for specifying such transformations: Triple Graph Grammars and QVT. Once the specification is expressed in the form of invariants, the transformation developer can use such description to verify properties of the original transformation (e.g. whether it defines a total, surjective or injective function), and to validate the transformation by the automatic generation of valid pairs of source and target models.Work supported by the Spanish Ministry of Education and Science, projects MOSAIC (TSI2005-08225-C07-06), MODUWEB (TIN2006-09678) and TIN2005-06053, and an UOC-IN3 research gran
A Model-driven Measurement Approach

update for BASE on Sep 08 2018 22:43:36International audienceCompanies using domain specific languages in a model-driven development process need to measure their models. However, developing and maintaining a measurement software for each domain specific mod- eling language is costly. Our contribution is a model-driven measurement approach. This measurement approach is model-driven from two view- points: 1) it measures models of a model-driven development process; 2) it uses models as unique and consistent metric specifications, w.r.t a metric specification metamodel. This declarative specification of metrics is then used to generate a fully fledged implementation. The benefit from applying the approach is evaluated by two applications. They indicate that this approach reduces the domain-specific measurement software development cost
Autonomic Management Policy Speciﬁcation: from UML to DSML

International audienceAutonomic computing is recognized as one of the most promizing solutions to address the increasingly complex task of distributed environments' administration. In this context, many projects relied on software components and architectures to provide autonomic management frameworks. We designed such a component-based autonomic management framework, but observed that the interfaces of a component model are too low-level and difficult to use. Therefore, we introduced UML diagrams for the modeling of deployment and management policies. However, we had to adapt/twist the UML semantics in order to meet our requirements, which led us to define DSMLs. In this paper, we present our experience in designing the Tune system and its support for management policy specification, relying on UML diagrams and on DSMLs. We analyse these two approaches, pinpointing the benefits of DSMLs over UML
Beyond Control-Flow: Extending Business Process Configuration to Roles and Objects

A configurable process model is an integrated representation of multiple variants of a business process. It is designed to be individualized to meet a particular set of requirements. As such, configurable process models promote systematic reuse of proven or common practices. Existing notations for configurable process modeling focus on capturing tasks and control-flow dependencies, neglecting equally important aspects of business processes such as data flow, material flow and resource management. This paper fills this gap by proposing an integrated meta-model for configurable processes with advanced features for capturing resources involved in the performance of tasks (through task-role associations) as well as flow of data and physical artifacts (through task-object associations). Although embodied as an extension of a popular process modeling notation, namely EPC, the meta-model is defined in an abstract and formal manner to make it applicable to other notations
Dynamic Parallel Adaption for Three Dimensional Unstructured Meshes: Application to Interface Tracking

International audienceThe anisotropic mesh adaption techniques in the last decade have dramatically improved the numerical simulations accuracy of complex problems. An optimal anisotropic mesh adaption consists in refining and coarsening the mesh, by using a metric to specify stretching directions, in order to accurately capture physical anisotropy such as shock waves, contact discontinuities, vortexes, boundary layers and free surfaces. Thus, we propose in this paper, an anisotropic a posteriori error estimator that controls the error due to mesh discretization in all space directions. From the a posteriori error analysis, we obtain an optimal metric (optimal mesh) as a minimum of an error indicator function and for a given number of elements. The optimal metric obtained is used to build an optimal mesh for the given number of elements. Furthermore, solutions for the physical problems illustrated here are often more accurate on adapted meshes than those obtained on globally-refined meshes and at a much lower cost