Occupancy of a single site by many random walkers

We consider an infinite number of noninteracting lattice random walkers with the goal of determining statistical properties of the time, out of a total time T, that a single site has been occupied by n random walkers. Initially the random walkers are assumed uniformly distributed on the lattice except for the target site at the origin, which is unoccupied. The random-walk model is taken to be a continuous-time random walk and the pausing-time density at the target site is allowed to differ from the pausing-time density at other sites. We calculate the dependence of the mean time of occupancy by n random walkers as a function of n and the observation time T. We also find the variance for the cumulative time during which the site is unoccupied. The large-T behavior of the variance differs according as the random walk is transient or recurrent. It is shown that the variance is proportional to T at large T in three or more dimensions, it is proportional to T3/2 in one dimension and to TlnT in two dimensions.

Single-valued solutions for the Böhm-Bawerk horse market game

Single-valued solutions for the case of two-sided market games without product differentiation, also known as Böhm-Bawerk horse market games, are analyzed. The nucleolus is proved to coincide with the tau-value, and is thus the midpoint of the core. Moreover a characterization of this setof games in terms of the assignment matrix is provided.

Aggregate monotonic stable single-valued solutions for cooperative games

[cat] En aquest treball caracteritzem les solucions puntuals de jocs cooperatius d'utilitat transferible que compleixen selecció del core i monotonia agregada. També mostrem que aquestes dues propietats són compatibles amb la individualitat racional, la propietat del jugador fals i la propietat de simetria. Finalment, caracteritzem les solucions puntuals que compleixen les cinc propietats a l'hora.

Infinitely many periodic orbits for the rhomboidal five-body problem

We prove the existence of infinitely many symmetric periodic orbits for a regularized rhomboidal five-body problem with four small masses placed at the vertices of a rhombus centered in the fifth mass. The main tool for proving the existence of such periodic orbits is the analytic continuation method of Poincaré together with the symmetries of the problem. © 2006 American Institute of Physics.

A Classification of Tools for Learning Logic

A table showing a comparison and classification of tools (intelligent tutoring systems) for e-learning of Logic at a college level.

Power supply noise and logic error probability

Voltage fluctuations caused by parasitic impedances in the power supply rails of modern ICs are a major concern in nowadays ICs. The voltage fluctuations are spread out to the diverse nodes of the internal sections causing two effects: a degradation of performances mainly impacting gate delays anda noisy contamination of the quiescent levels of the logic that drives the node. Both effects are presented together, in thispaper, showing than both are a cause of errors in modern and future digital circuits. The paper groups both error mechanismsand shows how the global error rate is related with the voltage deviation and the period of the clock of the digital system.

Secure many-to-one communications in wireless sensor networks

Wireless Sensor Networks (WSN) are formed by nodes with limited computational and power resources. WSNs are finding an increasing number of applications, both civilian and military, most of which require security for the sensed data being collected by the base station from remote sensor nodes. In addition, when many sensor nodes transmit to the base station, the implosion problem arises. Providing security measures and implosion-resistance in a resource-limited environment is a real challenge. This article reviews the aggregation strategies proposed in the literature to handle the bandwidth and security problems related to many-to-one transmission in WSNs. Recent contributions to secure lossless many-to-one communication developed by the authors in the context of several Spanish-funded projects are surveyed. Ongoing work on the secure lossy many-to-one communication is also sketched.

A web ontologies framework for digital rights management

In order to improve the management of copyright in the Internet, known as Digital Rights Management, there is the need for a shared language for copyright representation. Current approaches are based on purely syntactic solutions, i.e. a grammar that defines a rights expression language. These languages are difficult to put into practise due to the lack of explicit semantics that facilitate its implementation. Moreover, they are simple from the legal point of view because they are intended just to model the usage licenses granted by content providers to end-users. Thus, they ignore the copyright framework that lies behind and the whole value chain from creators to end-users. Our proposal is to use a semantic approach based on semantic web ontologies. We detail the development of a copyright ontology in order to put this approach into practice. It models the copyright core concepts for creation, rights and the basic kinds of actions that operate on content. Altogether, it allows building a copyright framework for the complete value chain. The set of actions operating on content are our smaller building blocks in order to cope with the complexity of copyright value chains and statements and, at the same time, guarantee a high level of interoperability and evolvability. The resulting copyright modelling framework is flexible and complete enough to model many copyright scenarios, not just those related to the economic exploitation of content. The ontology also includes moral rights, so it is possible to model this kind of situations as it is shown in the included example model for a withdrawal scenario. Finally, the ontology design and the selection of tools result in a straightforward implementation. Description Logic reasoners are used for license checking and retrieval. Rights are modelled as classes of actions, action patterns are modelled also as classes and the same is done for concrete actions. Then, to check if some right or license grants an action is reduced to check for class subsumption, which is a direct functionality of these reasoners.

Formalizing defeasible argumentation using a labeled deductive system

In the last years there has been an increasing demand of a variety of logical systems, prompted mostly by applications of logic in AI, logic programming and other related areas. Labeled Deductive Systems (LDS) were developed as a flexible methodology to formalize such a kind of complex logical systems. In the last decade, defeasible argumentation has proven to be a confluence point for many approaches to formalizing commonsense reasoning. Different formalisms have been developed, many of them sharing common features. This paper presents a formalization of an LDS for defensible argumentation, in which the main issues concerning defeasible argumentation are captured within a unified logical framework. The proposed framework is defined in two stages. First, defeasible inference will be formalized by characterizing an argumentative LDS. That system will be then extended in order to capture conflict among arguments using a dialectical approach. We also present some logical properties emerging from the proposed framework, discussing also its semantical characterization.

Los juegos y deportes tradicionales en Europa: entre la tradición y la modernidad

El juego es un elemento básico de socialización: es una creación cultural en el marco de una sociedad determinada. La visión contextualizada de todo juego tradicional debe considerar las propiedades que caracterizan su lógica interna, así como las condiciones socioculturales y los significados simbólicos que le atribuyen sus protagonistas (lógica externa). En esta investigación se realiza un inventario y análisis de la lógica interna y la lógica externa de los juegos tradicionales de adultos que se practican actualmente en 11 regiones europeas. Entre las conclusiones más relevantes destacar que existe un gran repertorio de juegos psicomotores y sociomotores. Se trata de juegos con un alto componente competitivo, en los que se distinguen vencedores y perdedores. Los grupos son básicamente masculinos y mixtos y sin la presencia de un líder o capitán, excepto en las regiones más deportivizadas en las que si aparece esta figura. Se observa que muchas de estas prácticas se están transformando en deportes (regionales), sobre todo aquellas que son protagonizadas por el género masculino. En definitiva, esta investigación aporta datos muy relevantes para comprender la naturaleza de la cultura lúdica tradicional europea.

Els jocs i esports tradicionals a Europa: entre la tradició i la modernitat

El joc és un element bàsic de socialització: és una creació cultural en el marc d’una societat determinada. La visió contextualitzada de qualsevol joc tradicional ha de considerar les propietats que caracteritzen la seva lògica interna, i també les condicions socioculturals i els significats simbòlics que -li atribueixen els seus protagonistes (lògica externa). En aquesta investigació es fa un inventari i una anàlisi de la lògica interna i la lògica externa dels jocs tradicionals d’adults que es practiquen actualment a 11 regions europees. Entre les conclusions més rellevants cal destacar que hi ha un gran repertori de jocs psicomotors i sociomotors. Es tracta de jocs amb un alt component competitiu, en els quals es distingeixen vencedors i perdedors. Els grups són bàsicament masculins i mixtos i sense la presència d’un líder o capità, excepte a les regions més esportivitzades, on sí que apareix aquesta figura. Observem que moltes d’aquestes pràctiques s’estan transformant en esports (regionals), sobretot les que són protagonitzades pel gènere masculí. En resum, aquesta investigació aporta dades molt rellevants per a comprendre la naturalesa de la cultura lúdica tradicional europea.

Adding similarity-based reasoning capabilities to a Horn fragment of possibilistic logic with fuzzy constants

PLFC is a first-order possibilistic logic dealing with fuzzy constants and fuzzily restricted quantifiers. The refutation proof method in PLFC is mainly based on a generalized resolution rule which allows an implicit graded unification among fuzzy constants. However, unification for precise object constants is classical. In order to use PLFC for similarity-based reasoning, in this paper we extend a Horn-rule sublogic of PLFC with similarity-based unification of object constants. The Horn-rule sublogic of PLFC we consider deals only with disjunctive fuzzy constants and it is equipped with a simple and efficient version of PLFC proof method. At the semantic level, it is extended by equipping each sort with a fuzzy similarity relation, and at the syntactic level, by fuzzily “enlarging” each non-fuzzy object constant in the antecedent of a Horn-rule by means of a fuzzy similarity relation.

Formalizing argumentative reasoning in a possibilistic logic programming setting with fuzzy unification

Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating the treatment of possibilistic uncertainty at the object-language level. In spite of its expressive power, an important limitation in P-DeLP is that imprecise, fuzzy information cannot be expressed in the object language. One interesting alternative for solving this limitation is the use of PGL+, a possibilistic logic over Gödel logic extended with fuzzy constants. Fuzzy constants in PGL+ allow expressing disjunctive information about the unknown value of a variable, in the sense of a magnitude, modelled as a (unary) predicate. The aim of this article is twofold: firstly, we formalize DePGL+, a possibilistic defeasible logic programming language that extends P-DeLP through the use of PGL+ in order to incorporate fuzzy constants and a fuzzy unification mechanism for them. Secondly, we propose a way to handle conflicting arguments in the context of the extended framework.

A logic programming framework for possibilistic argumentation: formalization and logical properties

In the last decade defeasible argumentation frameworks have evolved to become a sound setting to formalize commonsense, qualitative reasoning. The logic programming paradigm has shown to be particularly useful for developing different argument-based frameworks on the basis of different variants of logic programming which incorporate defeasible rules. Most of such frameworks, however, are unable to deal with explicit uncertainty, nor with vague knowledge, as defeasibility is directly encoded in the object language. This paper presents Possibilistic Logic Programming (P-DeLP), a new logic programming language which combines features from argumentation theory and logic programming, incorporating as well the treatment of possibilistic uncertainty. Such features are formalized on the basis of PGL, a possibilistic logic based on G¨odel fuzzy logic. One of the applications of P-DeLP is providing an intelligent agent with non-monotonic, argumentative inference capabilities. In this paper we also provide a better understanding of such capabilities by defining two non-monotonic operators which model the expansion of a given program P by adding new weighed facts associated with argument conclusions and warranted literals, respectively. Different logical properties for the proposed operators are studied

Successful therapies for Alzheimer's disease: why so many in animal models and none in humans?

Peering into the field of Alzheimer's disease (AD), the outsider realizes that many of the therapeutic strategies tested (in animal models) have been successful. One also may notice that there is a deficit in translational research, i.e., to take a successful drug in mice and translate it to the patient. Efforts are still focused on novel projects to expand the therapeutic arsenal to 'cure mice.' Scientific reasons behind so many successful strategies are not obvious. This article aims to review the current approaches to combat AD and to open a debate on common mechanisms of cognitive enhancement and neuroprotection. In short, either the rodent models are not good and should be discontinued, or we should extract the most useful information from those models. An example of a question that may be debated for the advancement in AD therapy is: In addition to reducing amyloid and tau pathologies, would it be necessary to boost synaptic strength and cognition? The debate could provide clues to turn around the current negative output in generating effective drugs for patients. Furthermore, discovery of biomarkers in human body fluids, and a clear distinction between cognitive enhancers and disease modifying strategies, should be instrumental for advancing in anti-AD drug discovery.