957 research outputs found
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 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 -translation of rules
belonging to the Semantic Web Rule Language (SWRL)
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
Average four-genus of two-bridge knots
We prove that the expected value of the ratio between the smooth four-genus and the Seifert genus of two-bridge knots tends to zero as the crossing number tends to infinity
Surface properties changing of biodegradable polymers by the radio frequency magnetron sputtering modification
Working notes of the KI\u2795 Workshop : KRDB-95 - Reasoning about structured objects : knowledge representation meets databases ; Bielefeld, Germany, Sept. 11-12, 1995
Working notes of the KI\u2794 Workshop: KRDB\u2794 - Reasoning about structured objects : knowledge representation meets databases ; Saarbrücken, September 20-22, 1994
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
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
- …