Temporal correlation between neuronal tail ganglion activity and locomotion in the leech, Hirudo medicinalis

Intracellular and extracellular recordings were performed in the posterior ventral nerve cord of restrained crawling preparations of the medicinal leech,Hirudo medicinalis. Short-latency neuronal activities in the tail ganglion nerves correlated with different phases of crawling behavior. Eight neurons with characteristic activation patterns during crawling were identified morphologically and physiologically in the tail ganglia of 23 preparations. The axons of four of these neurons projected through posterior tail brain nerves; four ascending interneurons had projections in the connectives or in Faivre's nerve. These interneurons are suitable candidates for carrying information between the front end and the tail end of the animal to coordinate the behavioral components during a crawling ste

Existence of Monetary Steady States in a Matching Model: Indivisible Money

Existence of a monetary steady state is established for a random matching model with divisible goods, indivisible money, and take-it-or-leave-it offers by consumers. There is no restriction on individual money holdings. The background environment is that in papers by Shi and by Trejos and Wright. The monetary steady state shown to exist has nice properties: the value function, defined on money holdings, is increasing and strictly concave, and the measure over money holdings has full support.

Web ontology representation and reasoning via fragments of set theory

In this paper we use results from Computable Set Theory as a means to represent and reason about description logics and rule languages for the semantic web. Specifically, we introduce the description logic \mathcal{DL}\langle 4LQS^R\rangle(\D)--admitting features such as min/max cardinality constructs on the left-hand/right-hand side of inclusion axioms, role chain axioms, and datatypes--which turns out to be quite expressive if compared with \mathcal{SROIQ}(\D), the description logic underpinning the Web Ontology Language OWL. Then we show that the consistency problem for \mathcal{DL}\langle 4LQS^R\rangle(\D)-knowledge bases is decidable by reducing it, through a suitable translation process, to the satisfiability problem of the stratified fragment $4LQS^R$ of set theory, involving variables of four sorts and a restricted form of quantification. We prove also that, under suitable not very restrictive constraints, the consistency problem for \mathcal{DL}\langle 4LQS^R\rangle(\D)-knowledge bases is \textbf{NP}-complete. Finally, we provide a $4LQS^R$-translation of rules belonging to the Semantic Web Rule Language (SWRL)

Surface properties changing of biodegradable polymers by the radio frequency magnetron sputtering modification

this paper. On the one hand, dening a semantics for the combined system may depend on methods and results from formal logic and universal algebra. On the other hand, an ecient combination of the actual constraint solvers often requires the possibility of communication and cooperation between the solvers

Effect of the Output of the System in Signal Detection

We analyze the consequences that the choice of the output of the system has in the efficiency of signal detection. It is shown that the signal and the signal-to-noise ratio (SNR), used to characterize the phenomenon of stochastic resonance, strongly depend on the form of the output. In particular, the SNR may be enhanced for an adequate output.Comment: 4 pages, RevTex, 6 PostScript figure

Computing FO-Rewritings in EL in Practice: from Atomic to Conjunctive Queries

A prominent approach to implementing ontology-mediated queries (OMQs) is to rewrite into a first-order query, which is then executed using a conventional SQL database system. We consider the case where the ontology is formulated in the description logic EL and the actual query is a conjunctive query and show that rewritings of such OMQs can be efficiently computed in practice, in a sound and complete way. Our approach combines a reduction with a decomposed backwards chaining algorithm for OMQs that are based on the simpler atomic queries, also illuminating the relationship between first-order rewritings of OMQs based on conjunctive and on atomic queries. Experiments with real-world ontologies show promising results

The interaction of representation and reasoning

Automated reasoning is an enabling technology for many applications of informatics. These applications include verifying that a computer program meets its specification; enabling a robot to form a plan to achieve a task and answering questions by combining information from diverse sources, e.g. on the Internet, etc. How is automated reasoning possible? Firstly, knowledge of a domain must be stored in a computer, usually in the form of logical formulae. This knowledge might, for instance, have been entered manually, retrieved from the Internet or perceived in the environment via sensors, such as cameras. Secondly, rules of inference are applied to old knowledge to derive new knowledge. Automated reasoning techniques have been adapted from logic, a branch of mathematics that was originally designed to formalize the reasoning of humans, especially mathematicians. My special interest is in the way that representation and reasoning interact. Successful reasoning is dependent on appropriate representation of both knowledge and successful methods of reasoning. Failures of reasoning can suggest changes of representation. This process of representational change can also be automated. We will illustrate the automation of representational change by drawing on recent work in my research group

Stream Productivity by Outermost Termination

Streams are infinite sequences over a given data type. A stream specification is a set of equations intended to define a stream. A core property is productivity: unfolding the equations produces the intended stream in the limit. In this paper we show that productivity is equivalent to termination with respect to the balanced outermost strategy of a TRS obtained by adding an additional rule. For specifications not involving branching symbols balancedness is obtained for free, by which tools for proving outermost termination can be used to prove productivity fully automatically