Results 141 to 150 of about 36,403 (314)
BL‐FlowSOM: Consistent and Highly Accelerated FlowSOM Based on Parallelized Batch Learning
ABSTRACT The recent increase in the dimensionality of cytometry data has led to the development of various computational analysis methods. FlowSOM is one of the best‐performing clustering methods but has room for improvement in terms of the consistency and speed of the clustering process. Here, we introduce Batch Learning FlowSOM (BL‐FlowSOM), which is
Fumitaka Otsuka+7 more
wiley +1 more source
Benefits of Open Quantum Systems for Quantum Machine Learning
Quantum machine learning (QML), poised to transform data processing, faces challenges from environmental noise and dissipation. While traditional efforts seek to combat these hindrances, this perspective proposes harnessing them for potential advantages. Surprisingly, under certain conditions, noise and dissipation can benefit QML.
María Laura Olivera‐Atencio+2 more
wiley +1 more source
A Method of Computing Eigenvectors and Eigenvalues on an Analog Computer [PDF]
Lucien W. Neustadt
openalex +1 more source
Lewis acids of the type B(SiR3)3 form short and strong bonds with N2 and CO. The strong bonding is the result of synergistic σ‐donation and π‐backdonation (from B−Si σ−bonds) that reduce the charge separation in comparison with complexes of regular boron Lewis acids, as indicated by the differential electrostatic potential (ΔV(r)). Abstract Lewis acids
Tore Brinck+2 more
wiley +1 more source
Organization of a ``Fixed-Plus-Variable'' Structure Computer for Computation of Eigenvalues and Eigenvectors of Real Symmetric Matrices [PDF]
Gerald Estrin, C.R. Viswanathan
openalex +1 more source
The unexpected reactivity and stability limits of phosphorus ylide‐based aluminum‐ and gallium‐carbon ambiphiles are described. While the previously published t‐butyl‐substituted compound (2‐{AltBu2}‐C6H4)Ph2PCMe2 (1tBu) reactsreversibly with NH3 at room temperature with cleavage of a N–H bond, the reaction with MeNH2 is much less favourable and ...
Felix Krämer+3 more
wiley +1 more source
The subgraph eigenvector centrality of graphs [PDF]
Let $G$ be a connected graph and let $F$ be a connected subgraph of $G$ with a given structure. We consider that the centrality of a vertex $i$ of $G$ is determined by the centrality of other vertices in all subgraphs contain $i$ and isomorphic to $F$.
arxiv
On the Eigenvector belonging to the Maximal Root of a Non-negative Matrix [PDF]
Alexander Ostrowski
openalex +1 more source
Characteristic Polynomial and Eigenproblem of Triangular Matrix over Interval Min-Plus Algebra
A min-plus algebra is a linear algebra over the semiring R_ε', equipped with the operations “"⊕'=min" ” and “⊗=+”. In min-plus algebra, there is the concept of characteristic polynomial obtained from permanent of matrix.
Anita Dwi Rahmawati+2 more
doaj +1 more source