We consider the question of how large a subspace of a given bipartite quantum system can be when the subspace contains only highly entangled states. This is motivated in part by results of Hayden et al., which show that in large d × d–dimensional systems there exist random subspaces of dimension almost d, all of whose states have entropy of entanglement at least log d − O(1). It is also a gener...

In bearing fault diagnosis, machine learning methods have been proven effective on the basis of heterogeneous features extracted from multiple domains, including deep representation features. However, comparatively little research has performed fusing these multi-domain while dealing with interrelation and redundant problems to precisely discover faults. Thus, in current study, a novel diagnost...

The method of change (or anomaly) detection in high-dimensional discrete-time processes using a multivariate Hotelling chart is presented. We use normal random projections as a method of dimensionality reduction. We indicate diagnostic properties of the Hotelling control chart applied to data projected onto a random subspace of R. We examine the random projection method using artificial noisy i...

Subspace codes were introduced by Kötter and Kschischang for error control in random linear network coding. In this paper, a layered type of subspace codes is considered, which can be viewed as a superposition of multiple component subspace codes. Exploiting the layered structure, we develop two decoding algorithms for these codes. The first algorithm operates by separately decoding each compon...

An (r,M, 2δ; k)q constant–dimension subspace code, δ > 1, is a collection C of (k−1)–dimensional projective subspaces of PG(r−1, q) such that every (k−δ)–dimensional projective subspace of PG(r−1, q) is contained in at most a member of C. Constant–dimension subspace codes gained recently lot of interest due to the work by Koetter and Kschischang [18], where they presented an application of such...

Subspace codes and particularly constant dimension codes have attracted much attention in recent years due to their applications in random network coding. As a particular subclass of subspace codes, cyclic subspace codes have additional properties that can be applied efficiently in encoding and decoding algorithms. It is desirable to find cyclic constant dimension codes such that both the code ...

Recently, the estimation of facial age has attracted much attention. This letter extends and improves a recently developed method (Guehairia et al., 2020) for fusing multiple deep features estimation. was based on random forests. We propose new pipeline that integrates tensor-based subspace learning before applying DRFs. Deep face training set are represented as 3D tensor. Multi-linear Whitened...

A black-box optimization algorithm such as Bayesian finds the extremum of an unknown function by alternating inference underlying and acquisition function. In a high-dimensional space, algorithms perform poorly due to difficulty optimization. Herein, we apply Ising machines overcome in continuous As machine specializes binary problems, vector has be encoded binary, solution translated back. Our...