نتایج جستجو برای: inseparability

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

2011
Boris Konev Roman Kontchakov Michel Ludwig Thomas Schneider Frank Wolter Michael Zakharyaschev

We show that deciding conjunctive query inseparability for OWL2QL ontologies is PSpace-hard and in ExpTime. We give polynomial-time (incomplete) algorithms and demonstrate by experiments that they can be used for practical module extraction.

1998
Anna Sanpera Rolf Tarrach Guifré Vidal

We show how to decompose any density matrix of the simplest binary composite systems, whether separable or not, in terms of only product vectors. We determine for all cases the minimal number of product vectors needed for such a decomposition. Separable states correspond to mixing from one to four pure product states. Inseparable states can be described as pseudomixtures of four or five pure pr...

2013
Christoph Hellings Wolfgang Utschick

From an information theoretic point of view, multiple-input multiple-output (MIMO) broadcast channels are separable, i.e., the optimal (capacity achieving) strategy performs encoding and decoding separately on each of the parallel channels (e.g., carriers in multicarrier system). In recent publications, it was shown that this separability can be lost if a restriction to a certain class of trans...

Journal: :Service Business 2021

The inherent feature of inseparability causes significant sufferings for the service sector. In case diabetes disease in healthcare, this problem is reduced by asking patients to self-monitor blood glucose at home (SMBG). Despite task’s importance, many do not fully accomplish. This study investigates what factors affect their adherence SMBG and how physician consultation fosters adherence. Emp...

2016
Cameron S. Cowan Jasdeep Sabharwal Samuel M. Wu

Reverse correlation methods such as spike-triggered averaging consistently identify the spatial center in the linear receptive fields (RFs) of retinal ganglion cells (GCs). However, the spatial antagonistic surround observed in classical experiments has proven more elusive. Tests for the antagonistic surround have heretofore relied on models that make questionable simplifying assumptions such a...

Journal: :Ann. Pure Appl. Logic 1990
Kevin J. Compton C. Ward Henson

A new method for obtaining lower bounds on the computational complexity of logical theories is presented. It extends widely used techniques for proving the undecidability of theories by interpreting models of a theory already known to be undecidable. New inseparability results related to the well known inseparability result of Trakhtenbrot and Vaught are the foundation of the method. Their use ...

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

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