نتایج جستجو برای: pseudo multiplication

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

Journal: :npj Quantum Information 2022

Abstract We address the question of efficient implementation quantum protocols, with small communication and entanglement, short depth circuit for encoding or decoding. introduce two methods this; first constructs a resource-efficient convex-split lemma second adapts technique classical correlated sampling in computer science literature. These lead to following consequences one-shot information...

Journal: :The Kurume Medical Journal 1975

Journal: :EMBO reports 2012
Florian Schmitzberger Stephen C Harrison

The proteins Ctf19, Okp1, Mcm21 and Ame1 are the components of COMA, a subassembly of budding-yeast kinetochores. We have determined the crystal structure of a conserved COMA subcomplex--the Ctf19-Mcm21 heterodimer--from Kluyveromyces lactis. Both proteins contain 'double-RWD' domains, which together form a Y-shaped framework with flexible N-terminal extensions. The kinetochore proteins Csm1, S...

2009
Ana Ros Camacho Richard J. Szabo Richard Szabo

But what is it exactly? Let us motivate the problem in a mathematical way: consider the Gel’fand-Naimark duality theorem, a mathematical theorem which establishes a one-to-one correspondence between topological (Hausdorff) spaces X and commutative C∗-algebras A=C(X), where A is the algebra of continuous complex-valued functions f : X → C with the pointwise multiplication (f.g)(x) = f(x).g(x). G...

Journal: :Applied Mathematics and Computation 2018
Erivelton G. Nepomuceno Samir A. M. Martins Bruno C. Silva Gleison F. V. Amaral Matjaz Perc

This paper presents a procedure to detect unreliable computer simulations of recursive functions. The proposed method calculates a lower bound error which is derived from two different pseudo-orbits based on interval extensions. The interval extensions are generated by taking into account the associative property of multiplication, which keeps the same error bound. We have tested our approach o...

2005
He Jianhui Xi Tu Cheng

Carrier Interferometry (CI) approaches, including Carrier-Interferometry Orthogonal Frequency Division Multiplexing (CI/OFDM) and Pseudo-Orthogonal Carrier-Interferometry OFDM (PO-CI/OFDM), have been proposed to enhance OFDM’s performance and reduce OFDM’s peak-to-average power ratio (PAPR). However, the existing high-throughput, high-performance PO-CI/OFDM system is limited for real signaling....

Journal: :Neurocomputing 2009
Hyekyoung Lee Andrzej Cichocki Seungjin Choi

Nonnegative matrix factorization (NMF) seeks a decomposition of a nonnegative matrix XX0 into a product of two nonnegative factor matrices UX0 and VX0, such that a discrepancy between X and UV> is minimized. Assuming U 1⁄4 XW in the decomposition (for WX0), kernel NMF (KNMF) is easily derived in the framework of least squares optimization. In this paper we make use of KNMF to extract data, whic...

Journal: :CoRR 2017
Stylianos Ioannis Mimilakis Gerald Schuller

Estimating audio and musical signals from single channel mixtures often, if not always, involves a transformation of the mixture signal to the time-frequency (T-F) domain in which a masking operation takes place. Masking is realized as an element-wise multiplication of the mixture signal’s T-F representation with a ratio of computed sources’ spectrogram. Studies have shown that the performance ...

We state several conditions under which comultiplication and weak comultiplication modulesare cyclic and study strong comultiplication modules and comultiplication rings. In particular,we will show that every faithful weak comultiplication module having a maximal submoduleover a reduced ring with a finite indecomposable decomposition is cyclic. Also we show that if M is an strong comultiplicati...

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

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