نتایج جستجو برای: classical quasi

تعداد نتایج: 267694  

1996
Susumu Okubo Noriaki Kamiya

Notions of quasi-classical Lie-super algebra as well as Lie-super triple systems have been given and studied with some examples. Its application to Yang-Baxter equation has also been given. 1991 Mathematics Subject Classification Primary 17A40, 17B60

2002
Antonio Di Lorenzo Luigi Amico Andreas Osterloh Gaetano Giaquinta

We study descendants of inhomogeneous vertex models with boundary reflections when the spin-spin scattering is assumed to be quasi–classical. This corresponds to consider certain power expansion of the boundary-Yang-Baxter equation (or reflection equation). As final product, integrable su(2)-spin chains interacting with a long range with XXZ anisotropy are obtained. The spin-spin couplings are ...

Journal: :CoRR 2012
Laszlo Gyongyosi Sándor Imre

One of the most surprising recent results in quantum Shannon theory is the superactivation of the quantum capacity of a quantum channel. This phenomenon has its roots in the extreme violation of additivity of the channel capacity and enables to reliably transmit quantum information over zerocapacity quantum channels. In this work we demonstrate a similar effect for the classical capacity of a q...

Journal: :The Journal of chemical physics 2014
Johannes Keller Caroline Lasser

Egorov's theorem on the classical propagation of quantum observables is related to prominent quasi-classical descriptions of quantum molecular dynamics as the linearized semiclassical initial value representation, the Wigner phase space method, or the statistical quasiclassical method. The error estimates show that different accuracies are achievable for the computation of expectation values an...

2000
Jan M Rost

A classical approximation to time dependent quantum mechanical scattering in the Møller formalism is presented. Numerically, our approach is similar to a standard Classical–Trajectory–Monte–Carlo calculation. Conceptually, however, our formulation allows one to release the restriction to stationary initial distributions. This is achieved by a classical forward–backward propagation technique. As...

Journal: :J. Log. Comput. 2000
Anthony Hunter

The proof theory of quasi-classical logic (QC logic) allows the derivation of non-trivializable classical inferences from inconsistent information. A non-trivializable, or paraconsistent, logic is, by necessity, a compromise, or weakening, of classical logic. The compromises on QC logic seem to be more appropriate than other paraconsistent logics for applications in computing. In particular, th...

2015
H. Speleers C. Manni

Quasi-interpolation is a well-known technique to construct accurate approximants to a given set of data or a given function by means of a local approach. A quasi-interpolant is usually obtained as a linear combination of a given system of blending functions that form a convex partition of unity and possess a small local support. These properties ensure both numerical stability and local control...

Journal: :Computing and Informatics 2017
Xiaowang Zhang Zhiyong Feng Wenrui Wu Mokarrom Hossain Wendy MacCaull

Though quasi-classical description logic (QCDL) can tolerate the inconsistency of description logic in reasoning, a knowledge base in QCDL possibly has no model. In this paper, we investigate the satisfiability of QCDL, namely, QC-coherency and QCconsistency and develop a tableau calculus, as a formal proof, to determine whether a knowledge base in QCDL is QC-consistent. To do so, we repair the...

2008
Terry Pilling

The semi-classical derivation of Hawking radiation for axially symmetric, stationary spacetimes with a Killing horizon is examined following the recent quasi-classical tunneling analysis [1] and a simple formula is found for the inverse Hawking temperature β = 1/TH . The formula is invariant under canonical transformations and is shown to be equivalent to the integral of a closed differential 1...

2001
Anthony Hunter

Quasi-classical logic (QC logic) allows the derivation of non-trivial classical inferences from inconsistent information. A paraconsis-tent, or non-trivializable, logic is, by necessity, a compromise, or weakening , of classical logic. The compromises on QC logic seem to be more appropriate than other paraconsistent logics for applications in computing. In particular, the connectives behave in ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید