424,759 research outputs found
An Application Specific Informal Logic for Interest Prohibition Theory
Interest prohibition theory concerns theoretical aspects of interest
prohibition. We attempt to lay down some aspects of interest prohibition theory
wrapped in a larger framework of informal logic. The reason for this is that
interest prohibition theory has to deal with a variety of arguments which is so
wide that a limitation to so-called correct arguments in advance is
counterproductive. We suggest that an application specific informal logic must
be developed for dealing with the principles of interest prohibition theory.Comment: 8 page
Recommended from our members
Performance analysis of a message-oriented knowledge-base
First-order Horn logic is a useful formalism to design knowledge-based systems. When implemented on a sequential von Neumann computer, the main limitation of such systems is performance. We present a message-driven model for function-free Horn logic, where the knowledge base is represented as a network of logical processing elements communicating with one another exclusively through messages. The lack of centralized control and centralized memory makes this model suitable to implementation on a highly-parallel asynchronous computer architecture.The primary contribution of this paper is a performance analysis of this message-driven system and a comparison with a sequential resolution scheme using backtracking. For both approaches, closed form expressions for the performance results are derived and compared
Probabilistic modal {\mu}-calculus with independent product
The probabilistic modal {\mu}-calculus is a fixed-point logic designed for
expressing properties of probabilistic labeled transition systems (PLTS's). Two
equivalent semantics have been studied for this logic, both assigning to each
state a value in the interval [0,1] representing the probability that the
property expressed by the formula holds at the state. One semantics is
denotational and the other is a game semantics, specified in terms of
two-player stochastic parity games. A shortcoming of the probabilistic modal
{\mu}-calculus is the lack of expressiveness required to encode other important
temporal logics for PLTS's such as Probabilistic Computation Tree Logic (PCTL).
To address this limitation we extend the logic with a new pair of operators:
independent product and coproduct. The resulting logic, called probabilistic
modal {\mu}-calculus with independent product, can encode many properties of
interest and subsumes the qualitative fragment of PCTL. The main contribution
of this paper is the definition of an appropriate game semantics for this
extended probabilistic {\mu}-calculus. This relies on the definition of a new
class of games which generalize standard two-player stochastic (parity) games
by allowing a play to be split into concurrent subplays, each continuing their
evolution independently. Our main technical result is the equivalence of the
two semantics. The proof is carried out in ZFC set theory extended with
Martin's Axiom at an uncountable cardinal
Precision spectroscopy by photon-recoil signal amplification
Precision spectroscopy of atomic and molecular ions offers a window to new
physics, but is typically limited to species with a cycling transition for
laser cooling and detection. Quantum logic spectroscopy has overcome this
limitation for species with long-lived excited states. Here, we extend quantum
logic spectroscopy to fast, dipole-allowed transitions and apply it to perform
an absolute frequency measurement. We detect the absorption of photons by the
spectroscopically investigated ion through the photon recoil imparted on a
co-trapped ion of a different species, on which we can perform efficient
quantum logic detection techniques. This amplifies the recoil signal from a few
absorbed photons to thousands of fluorescence photons. We resolve the line
center of a dipole-allowed transition in 40Ca+ to 1/300 of its observed
linewidth, rendering this measurement one of the most accurate of a broad
transition. The simplicity and versatility of this approach enables
spectroscopy of many previously inaccessible species.Comment: 25 pages, 6 figures, 1 table, updated supplementary information,
fixed typo
Memcapacitive Devices in Logic and Crossbar Applications
Over the last decade, memristive devices have been widely adopted in
computing for various conventional and unconventional applications. While the
integration density, memory property, and nonlinear characteristics have many
benefits, reducing the energy consumption is limited by the resistive nature of
the devices. Memcapacitors would address that limitation while still having all
the benefits of memristors. Recent work has shown that with adjusted parameters
during the fabrication process, a metal-oxide device can indeed exhibit a
memcapacitive behavior. We introduce novel memcapacitive logic gates and
memcapacitive crossbar classifiers as a proof of concept that such applications
can outperform memristor-based architectures. The results illustrate that,
compared to memristive logic gates, our memcapacitive gates consume about 7x
less power. The memcapacitive crossbar classifier achieves similar
classification performance but reduces the power consumption by a factor of
about 1,500x for the MNIST dataset and a factor of about 1,000x for the
CIFAR-10 dataset compared to a memristive crossbar. Our simulation results
demonstrate that memcapacitive devices have great potential for both Boolean
logic and analog low-power applications
- …