pinecone/core-2020-05-10-deduplication huggingface dataset:
Electromagnetic Force and the Maxwell Stress Tensor in Condensed Systems

While the electromagnetic force is microscopically simply the Lorentz force,
its macroscopic form is more complicated, and given by expressions such as the
Maxwell stress tensor and the Kelvin force. Their derivation is fairly opaque,
at times even confusing, and their range of validity all but a well kept
secret. These circumstances unnecessarily reduce the usefulness and
trustworthiness of some key quantities in macroscopic electrodynamics.
  This article presents a thorough yet pedagogical derivation of the Maxwell
stress tensor and electromagnetic force in condensed media. It starts from
universally accepted inputs: conservation laws, thermodynamics and the Maxwell
equations. Simplifications are considered for various limits, especially the
equilibrium, with a range of validity assigned to each expression. Some
widespread misconceptions are scrutinized, and hidden ambiguities in popular
notations revealed.
  A number of phenomena typical of strongly polarizable systems, especially
ferrofluid, are then considered. In addition to enhancing the appreciation of
these systems, it helps to solidify the grasp of the introduced concepts and
derived formulas, and it demonstrates the ease with which the Maxwell stress
tensor can be handled, inviting theorists and experimentalists alike to embrace
this useful quantity.Comment: 27 pages, 7 fi
Similarity-based Exploded Views

Exploded views are often used in illustration to overcome the
problem of occlusion when depicting complex structures. In this paper,
we propose a volume visualization technique inspired by exploded views
that partitions the volume into a number of parallel slabs and shows
them apart from each other. The thickness of slabs is driven by the similarity
between partitions. We use an information-theoretic technique for
the generation of exploded views. First, the algorithm identifies the viewpoint
from which the structure is the highest. Then, the partition of the
volume into the most informative slabs for exploding is obtained using
two complementary similarity-based strategies. The number of slabs and
the similarity parameter are freely adjustable by the user
Contributions of Tidal Poisson Terms in the Theory of the Nutation of a Nonrigid Earth

The tidal potential generated by bodies in\ud
the solar system contains Poisson terms, i.e., periodic\ud
terms with linearly time-dependent amplitudes. The\ud
influence of these terms in the Earth’s rotation, although\ud
expected to be small, could be of interest in the\ud
present context of high accuracy modelling. We have\ud
studied their contribution in the rotation of a non rigid\ud
Earth with elastic mantle and liquid core. Starting from\ud
the Liouville equations, we computed analytically\ud
the contribution in the wobble and showed that the\ud
presently-used transfer function must be supplemented\ud
by additional terms to be used in convolution with\ud
the amplitude of the Poisson terms of the potential\ud
and inversely proportional to (σ − σn)2 where σ is\ud
the forcing frequency and σn are the eigenfrequencies\ud
associated with the retrograde free core nutation and\ud
the Chandler wobble. These results have been detailed\ud
in a paper that we published in Astron. Astrophys. in 2007. In the present paper, we further examine the contribution\ud
from the core on the wobble and the nutation.\ud
In particular, we examine the contribution on extreme\ud
cases such as for wobble frequencies near the\ud
Free Core Nutation Frequency (FCN) or for long period\ud
nutations. In addition to the analytical computation,\ud
we used a time-domain approach through a numerical\ud
model to examine the core and mantle motions\ud
and discuss the analytical results.Peer reviewe
Recent Progress in the VLBI2010 Development

chapter in book series "International Association of Geodesy Symposia" book "Observing our Changing Earth" ISBN 978-3-540-85425-8International audienceFrom October 2003 to September 2005, the International VLBI Service for Geodesy and Astrometry (IVS) examined current and future requirements for geodetic VLBI, including all components from antennas to analysis. IVS Working Group 3 ‘VLBI 2010', which was tasked with this effort, concluded with recommendations for a new generation of VLBI systems. These recommendations were based on the goals of achieving 1 mm measurement accuracy on global baselines, performing continuous measurements for time series of station positions and Earth orientation parameters, and reaching a turnaround time from measurement to initial geodetic results of less than 24 hours. To realize these recommendations and goals, along with the need for low cost of construction and operation, requires a complete examination of all aspects of geodetic VLBI including equipment, processes, and observational strategies. Hence, in October 2005, the IVS VLBI2010 Committee (V2C) commenced work on defining the VLBI2010 system specifications. In this paper we give a summary of the recent progress of the VLBI2010 project
How democracy resolves conflict in difficult games

Democracy resolves conflicts in difficult games like Prisoners’ Dilemma and Chicken by stabilizing their cooperative outcomes.  It does so by transforming these games into games in which voters are presented with a choice between a cooperative outcome and a Pareto-inferior noncooperative outcome.  In the transformed game, it is always rational for voters to vote for the cooperative outcome, because cooperation is a weakly dominant strategy independent of the decision rule and the number of voters who choose it.  Such games are illustrated by 2-person and n-person public-goods games, in which it is optimal to be a free rider, and a biblical story from the book of Exodus.
Improving Web Service Discovery by Using Semantic Models

With the advent of service oriented architecture, Web services have gained tremendous popularity. This warrants the need to establish an effective and reliable process of Web service discovery. This paper presents a novel approach to enhance the accuracy of Web service discovery by finding semantically similar Web services for a user query using the support-based latent semantic kernel. The empirical evaluation confirms that the accuracy of Web service discovery with the proposed method shows a significant improvement over traditional discovery methods
Towards a Narrative Mind: The Creation of Coherent Life Stories for Believable Virtual Agents

???The original publication is available at www.springerlink.com???. Copyright Springer. DOI: 10.1007/978-3-540-85483-8_6This paper describes an approach to create coherent life stories for Intelligent Virtual Agents (IVAs) in order to achieve long-term believability. We integrate a computational autobiographic memory, which allows agents to remember significant past experiences and reconstruct their life stories from these experiences, into an emotion-driven planning architecture. Starting from the literature review on episodic memory modelling and narrative agents, we discuss design considerations for believable agents which interact with users repeatedly and over a long period of time. In the main body of the paper we present the narrative structure of human life stories. Based on this, we incorporate three essential discourse units and other characteristics into the design of the autobiographic memory structure. We outline part of the implementation of this memory architecture and describe the plan for evaluating the architecture in long-term user studies
SORMA - business cases for an open grid market: concept and implementation

Economic mechanisms enhance technological solutions by setting the right incentives to reveal information about demand and supply accurately. Market or pricing mechanisms are ones that foster information exchange and can therefore attain efficient allocation. By assigning a value (also called utility) to their service requests, users can reveal their relative urgency or costs to the service. The implementation of theoretical sound models induce further complex challenges. The EU-funded project SORMA analyzes these challenges and provides a prototype as a proof-of-concept. In this paper the approach within the SORMA-project is described on both conceptual and technical level
Grid4All: open market places for democratic grids

The Grid4All project is focused on the provision of the benefits and opportunities of Grids for everyone, including small organizations such as schools, families, non-governmental organizations, or small businesses. This involves multiple relevant and related aspects despite the scale of the global system: (i) self-management of applications as they adapt to environmental changes, (ii) the complexity of developing and using applications in that situation by multiple users, (iii) and the need to organize, govern, and regulate the community. Grid4All1 promotes the concept of a democratic Grid, virtual organizations and self-management systems, based on decentralized overlays. Thereby, the providers offer resources and services either for a shared-interest within a virtual organization (pooling) or for an open market across virtual organizations. These two models of distributing resources that co-exist locally, contribute to achieve global regulation. We propose an architecture according to these ideas, which are inspired by real-world cases, which include a collection of data sharing and execution services, used by collaborative applications.Peer ReviewedPostprint (published version
Rational bidding using reinforcement learning: an application in automated resource allocation

The application of autonomous agents by the provisioning and usage of computational resources is an attractive research field. Various methods and technologies in the area of artificial intelligence, statistics and economics are playing together to achieve i) autonomic resource provisioning and usage of computational resources, to invent ii) competitive bidding strategies for widely used market mechanisms and to iii) incentivize consumers and providers to use such market-based systems.\ud
The contributions of the paper are threefold. First, we present a framework for supporting consumers and providers in technical and economic preference elicitation and the generation of bids. Secondly, we introduce a consumer-side reinforcement learning bidding strategy which enables rational behavior by the generation and selection of bids. Thirdly, we evaluate and compare this bidding strategy against a truth-telling bidding strategy for two kinds of market mechanisms – one centralized and one decentralized.\u
Worst Cases for the Exponential Function in the IEEE 754r decimal64 Format

This publication follows the "Reliable Implementation of Real Number Algorithms: Theory and Practice" international seminar, Dagstuhl, Germany, January 8-13, 2006.International audienceWe show how one can search for the worst cases for correct rounding of the exponential function in the IEEE 754r 64-bit decimal format, and give such bad cases that have been found so far. This work can be extended to other elementary functions in the decimal64 format, and allows the design of reasonably fast routines that will evaluate these functions with correct rounding, at least in some domains
Privacy risks in trajectory data publishing: reconstructing private trajectories from continuous properties

Location and time information about individuals can be captured through GPS devices, GSM phones, RFID tag readers, and by other similar means. Such data can be pre-processed to obtain trajectories which are sequences of spatio-temporal data points belonging to a moving object. Recently, advanced data mining techniques have been developed for extracting patterns from moving object trajectories to enable applications such as city traffic planning, identification of evacuation routes, trend detection, and many more. However, when special care is not taken, trajectories of individuals may also pose serious privacy risks even after they are de-identified or mapped into other forms. In this paper, we show that an unknown private trajectory can be reconstructed from knowledge of its properties released for data mining, which at first glance may not seem to pose any privacy threats. In particular, we propose a technique to demonstrate how private trajectories can be re-constructed from knowledge of their distances to a bounded set of known trajectories. Experiments performed on real data sets show that the number of known samples is surprisingly smaller than the actual theoretical bounds
Concepts and fields of relational justice

This paper intends to clarify the broad conceptual background of relational justice. Relational Justice (RJ) is defined as the justice produced through cooperative behavior, agreement, negotiation, or dialogue among actors in a post-conflict situation. We found concepts stemming from at least thirty different fields, going from behavioral sciences (neurology, brain sciences, primatology, social psychology, etc.) to criminology, jurisprudence, and philosophy. One of these contributing fields is Artificial Intelligence (AI), which uses several techniques to grasp the practical knowledge of negotiators and mediators and builds tools to support both negotiation and mediation processes. However, contrary to the legal ontologies field, there are no ontologies of Relational Justice yet representing the conceptual richness of the domain
Design, implementation and deployment of state machines using a generative approach

We describe an approach to designing and implementing a distributed system as a family of related finite state machines, generated from a single abstract model. Various artefacts are generated from each state machine, including diagrams, source-level protocol implementations and documentation. The state machine family formalises the interactions between the components of the distributed system, allowing increased confidence in correctness. Our methodology facilitates the application of state machines to problems for which they would not otherwise be suitable. We illustrate the technique with the example of a Byzantine-fault-tolerant commit protocol used in a distributed storage system, showing how an abstract model can be defined in terms of an abstract state space and various categories of state transitions. We describe how such an abstract model can be deployed in a concrete system, and propose a general methodology for developing systems in this style.Postprin
Collective phenomena in complex social networks

11 pages, 8 figures.-- Published Online 11 Feb. 2009.The problem of social consensus is approached from the perspective of nonlinear dynamics of interacting agents in a complex network. Some basic concepts, such as dynamical metastability, are discussed in the framework of the prototype voter model. In the context of Axelrod’s model for the dissemination of culture we describe a co-evolutionary dynamics formulation with recent results on group formation and nonequilibrium network fragmentation and recombination transitions.We acknowledge financial support from MEC (Spain) through projects\ud
CONOCE2 (FIS2004-00953) and FISICOS (FIS2007-60327).Peer reviewe
On the geometry of predictive control with nonlinear constraints

Selected Papers from the International Conference on Informatics in Control, Automation and Robotics 2007This paper proposes a geometrical analysis of the polyhedral feasible domains for the predictive control laws under constraints. The state vector is interpreted as a vector of parameters for the optimization problem to be solved at each sampling instant and its influence can be fully described by the use of parameterized polyhedra and their dual constraints/generators representation. The construction of the associated explicit control laws at least for linear or quadratic cost functions can thus receive fully geometrical solutions. Convex nonlinear constraints can be approximated using a description based on the parameterized vertices. In the case of nonconvex regions the explicit solutions can be obtained using Voronoi partitions based on a collection of points distributed over the borders of the feasible domain
Detecting Current Outliers: Continuous Outlier Detection over Time-Series Data Streams

The development of sensor devices and ubiquitous computing have increased time-series data streams. With data streams, current data arrives continuously and must be monitored. This paper presents outlier detection over data streams by continuous monitoring. Outlier detection is an important data mining issue and discovers outliers, which have features that differ profoundly from other objects or values. Most existing outlier detection techniques, however, deal with static data, which is computationally expensive. Specifically, for outlier detection over data streams, real-time response is very important. Existing techniques for static data, however, are fraught with many meaningless processes over data streams, and the calculation cost is too high. This paper introduces a technique that provides effective outlier detection over data streams using differential processing, and confirms effectiveness.Database and Expert Systems Applications19th International Conference, DEXA 2008, Turin, Italy, September 1-5, 2008
XPath Rewriting Using Multiple Views

We study the problem of tree pattern query rewriting using multiple views for the class of tree patterns in P{//,[]}. Previous work has considered the rewriting problem using a single view. We consider two different ways of combining multiple views, define rewritings of a tree pattern using these combinations, and study the relationship between them. We show that when rewritings using single views do not exist, we may use such combinations of multiple views to rewrite a query, and even if rewritings using single views do exist, the rewritings using combinations of multiple views may provide more answers than those provided by the union of the rewritings using the individual views. We also study properties of intersections of tree patterns, and present algorithms for finding rewritings using intersections of views.Griffith Sciences, School of Information and Communication TechnologyFull Tex
Fast Matching of Twig Patterns

Twig pattern matching plays a crucial role in data processing. Existing twig pattern matching algorithms can be classified into two-phase algorithms and one-phase algorithms. While the two-phase algorithms (e.g., ) suffer from expensive merging cost, the one-phase algorithms (e.g., , , ) either lack efficient filtering of useless elements, or use over-complicated data structures. In this paper, we present two novel one-phase holistic twig matching algorithms, TwigMix and , which combine the efficient selection of useful elements (introduced in ) with the simple lists for storing final solutions (introduced in ). simply introduces the element selection function of into to avoid manipulation of useless elements in the stack and lists. further improves this by introducing some pointers in the lists to completely avoid the use of stacks. Our experiments show significantly and consistently outperforms and (up to several times faster), and is up to two times faster than .Griffith Sciences, School of Information and Communication TechnologyFull Tex
Attempto controlled English for knowledge representation

Attempto Controlled English (ACE) is a controlled natural language, i.e. a precisely defined  subset of English that can automatically and unambiguously be translated into  first-order logic. ACE may seem to be completely natural, but is actually a formal language, concretely it is a first-order logic language with an English syntax. Thus ACE is human and machine understandable. ACE was originally intended to specify software, but has since been used as a general knowledge representation language in several application domains, most recently for the semantic web. ACE is supported by a number of tools, predominantly by the Attempto Parsing Engine (APE) that translates ACE texts into Discourse Representation Structures (DRS), a variant of  first-order logic. Other tools include the Attempto Reasoner RACE, the AceRules system, the ACE View plug-in for the Protégé ontology editor, AceWiki, and the OWL verbaliser
Solving NP-complete problems with delayed signals: an overview of
  current research directions

In this paper we summarize the existing principles for building
unconventional computing devices that involve delayed signals for encoding
solutions to NP-complete problems. We are interested in the following aspects:
the properties of the signal, the operations performed within the devices, some
components required for the physical implementation, precision required for
correctly reading the solution and the decrease in the signal's strength. Six
problems have been solved so far by using the above enumerated principles:
Hamiltonian path, travelling salesman, bounded and unbounded subset sum,
Diophantine equations and exact cover. For the hardware implementation several
types of signals can be used: light, electric power, sound, electro-magnetic
etc.Comment: in Proceedings of 1st international workshop on Optical
  SuperComputing, LNCS 5172, pp. 115-128, Springer-Verlag, 2008, more info at:
  http://www.cs.ubbcluj.ro/~moltean/optica
Workflow Simulation for Operational Decision Support Using Design, Historic and State Information

Simulation is widely used as a tool for analyzing business processes but is mostly focused on examining rather abstract steady-state situations. Such analyses are helpful for the initial design of a business process but are less suitable for operational decision making and continuous improvement. Here we describe a simulation system for operational decision support in the context of workflow management. To do this we\ud
exploit not only the workflow's design, but also logged data describing the system's observed historic behavior, and information extracted about the current state of the workflow. Making use of actual data capturing the current state and historic information allows our simulations to accurately predict potential near-future behaviors for different scenarios.\ud
The approach is supported by a practical toolset which combines and extends the work\ud
ow management system YAWL and the process mining framework ProM
Combining Wikipedia and Newswire Texts for Question Answering in Spanish

4 pages, 1 figure.-- Contributed to: Advances in Multilingual and Multimodal Information Retrieval: 8th Workshop of the Cross-Language Evaluation Forum (CLEF 2007, Budapest, Hungary, Sep 19-21, 2007).This paper describes the adaptations of the MIRACLE group QA system in order to participate in the Spanish monolingual question answering task at QA@CLEF 2007. A system, initially developed for the EFE collection, was reused for Wikipedia. Answers from both collections were combined using temporal information extracted from questions and collections. Reusing the EFE subsystem has proven not feasible, and questions with answers only in Wikipedia have obtained low accuracy. Besides, a co-reference module based on heuristics was introduced for processing topic-related questions. This module achieves good coverage in different situations but it is hindered by the moderate accuracy of the base system and the chaining of incorrect answers.This work has been partially supported by the Regional Government of Madrid under the Research Network MAVIR (S-0505/TIC-0267) and projects by the Spanish Ministry of Education and Science (TIN2004/07083,TIN2004-07588-C03-02,TIN2007-67407-C03-01).Publicad