نتایج جستجو برای: input indistinguishable

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

Journal: :IEEE Access 2023

In this paper, we propose a channel estimation method for massive multi-input multi-output (MIMO) with orthogonal time frequency space (OTFS) modulation. Our aims to reduce inter-symbol interference (ISI) when the subtraction of two delay paths is smaller than resolution system. We 3D inner product proportion difference structured matching pursuit (3D-IPRDSOMP) algorithm that combines character...

2008
L. Burakovsky

A manifestly covariant relativistic statistical mechanics of the system of N indistinguishable events with motion in space-time parametrized by an invariant “historical time” τ is considered. The relativistic mass distribution for such a system is obtained from the equilibrium solution of the generalized relativistic Boltzmann equation by integration over angular and hyperbolic angular variable...

2013
Mark Braverman Gal Oshri

We investigate the problem of determining a set S of k indistinguishable integers in the range [1, n]. The algorithm is allowed to query an integer q ∈ [1, n], and receive a response comparing this integer to an integer randomly chosen from S. The algorithm has no control over which element of S the query q is compared to. We show tight bounds for this problem. In particular, we show that in th...

2015
Elena Botoeva Roman Kontchakov Vladislav Ryzhikov Frank Wolter Michael Zakharyaschev

Deciding inseparability of description logic knowledge bases (KBs) with respect to conjunctive queries is fundamental for many KB engineering and maintenance tasks including versioning, module extraction, knowledge exchange and forgetting. We study the combined and data complexity of this inseparability problem for fragments of Horn-ALCHI, including the description logics underpinning OWL 2 QL ...

2005
XiaoGuang Wang Barry C Sanders

We determine the degree of entanglement for two indistinguishable particles based on the tensor product structure, which is a framework for emphasizing entanglement founded on observational quantities. Our theory connects the canonical entanglement and entanglement based on occupation number for two fermions and for two bosons and shows that the entanglement measure, based on linear entropy, is...

Journal: :Physical review letters 2005
A Kiraz M Ehrl Th Hellerer O E Müstecaplioğlu C Bräuchle A Zumbusch

We report the results of coincidence counting experiments at the output, of a Michelson interferometer using the zero-phonon-line emission of a single molecule at 1.4 K. Under continuous wave excitation, we observe the absence of coincidence counts as an indication of two-photon interference. This corresponds to the observation of Hong-Ou-Mandel correlations and proves the suitability of the ze...

2009
John D. Norton

Results on the observational indistinguishability of spacetimes demonstrate the impossibility of determining by deductive inference which is our spacetime, no matter how extensive a portion of the spacetime is observed. These results do not illustrate an underdetermination of theory by evidence, since they make no decision between competing theories and they make little contact with the inducti...

2016
Xiaoqian Zhang Xiaoqing Tan Jian Weng Yongjun Li

We construct two families of orthogonal product quantum states that cannot be exactly distinguished by local operation and classical communication (LOCC) in the quantum system of (2k+i) ⊗ (2l+j) (i, j ∈ {0, 1} and i ≥ j ) and (3k+i) ⊗ (3l+j) (i, j ∈ {0, 1, 2}). And we also give the tiling structure of these two families of quantum product states where the quantum states are unextendible in the ...

Journal: :IACR Cryptology ePrint Archive 2015
Foteini Baldimtsi Aggelos Kiayias Thomas Zacharias Bingsheng Zhang

Foteini Baldimtsi is an Assistant Professor in the Computer Science Department at George Mason University. She received her Ph.D. from Brown University in May 2014 and worked as a postdoctoral researcher in Boston University and University of Athens. Her research interests are in the areas of cryptography, security and data privacy with a special focus in electronic payments, Bitcoin and blockc...

2003

Occlusions are one of the biggest obstacles to reliable tracking. While many existing algorithms perform well while the objects of interest are separated, they often swap object identities when multiple objects occlude one another. We focus on the problem of tracking multiple, nonrigid targets through severe occlusions. Our occlusion reasoning algorithm takes advantage of reliable separated obj...

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

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