Results 101 to 110 of about 2,725,619 (370)

Quantum Subroutine for Efficient Matrix Multiplication

IEEE Access
We propose an efficient quantum subroutine for matrix multiplication that computes a state vector encoding the entries of the product of two matrices in superposition.
Anna Bernasconi, Alessandro Berti, Gianna Maria del Corso, Alessandro Poggiali   +3 more
doaj   +1 more source

Commutative law for products of infinitely large isotropic random matrices

, 2013
Ensembles of isotropic random matrices are defined by the invariance of the probability measure under the left (and right) multiplication by an arbitrary unitary matrix.
Burda, Z., Livan, G., Swiech, A.
core   +1 more source

KLK7 overexpression promotes an aggressive phenotype and facilitates peritoneal dissemination in colorectal cancer cells

FEBS Open Bio, EarlyView.
KLK7, a tissue kallikrein‐related peptidase, is elevated in advanced colorectal cancer and associated with shorter survival. High KLK7 levels in ascites correlate with peritoneal metastasis. In mice, KLK7 overexpression increases metastasis. In vitro, KLK7 enhances cancer cell proliferation, migration, adhesion, and spheroid formation, driving ...
Yosr Z. Haffani, Tobias Dreyer, Meriem Naim, Rea Lo Dico, Natalia A. Ignatenko, Viktor Magdolen, Dalila Darmoul   +6 more
wiley   +1 more source

Sparse matrix-vector multiplication on network-on-chip [PDF]

Advances in Radio Science, 2010
In this paper, we present an idea for performing matrix-vector multiplication by using Network-on-Chip (NoC) architecture. In traditional IC design on-chip communications have been designed with dedicated point-to-point interconnections.
C.-C. Sun, J. Götze, H.-Y. Jheng, S.-J. Ruan   +3 more
doaj   +1 more source

If the Current Clique Algorithms are Optimal, so is Valiant's Parser

, 2015
The CFG recognition problem is: given a context-free grammar $\mathcal{G}$ and a string $w$ of length $n$, decide if $w$ can be obtained from $\mathcal{G}$. This is the most basic parsing question and is a core computer science problem.
Abboud, Amir, Backurs, Arturs, Williams, Virginia Vassilevska   +2 more
core   +1 more source

The Aging Blood: Cellular Origins, Circulating Drivers, and Therapeutic Potential

Aging and Cancer, EarlyView.
As a conduit linking all organs, the blood system both reflects and actively drives systemic aging. This review highlights how circulating pro‐aging and antiaging factors and age‐associated hematopoietic stem cell dysfunction contribute to immunosenescence and multi‐organ decline, positioning the hematopoietic system as a target for aging intervention.
Hanqing He, Jianwei Wang
wiley   +1 more source

Strong Scaling of Matrix Multiplication Algorithms and Memory-Independent Communication Lower Bounds [PDF]

, 2012
A parallel algorithm has perfect strong scaling if its running time on P processors is linear in 1/P, including all communication costs. Distributed-memory parallel algorithms for matrix multiplication with perfect strong scaling have only recently been ...
Ballard, Grey, Demmel, James, Holtz, Olga, Lipshitz, Benjamin, Schwartz, Oded   +4 more
core  

Rational conformal field theory with matrix level and strings on a torus

, 2014
Study of the matrix-level affine algebra $U_{m,K}$ is motivated by conformal field theory and the fractional quantum Hall effect. Gannon completed the classification of $U_{m,K}$ modular-invariant partition functions. Here we connect the algebra $U_{2,K}$
Nassar, Ali, Walton, Mark A.
core   +1 more source

Natural Products as Geroprotective Modulators in Diabetic Nephropathy: A Mechanistic Framework Integrating Aging Hallmarks and the AMPK–SIRT1–Nrf2 Axis

Aging and Cancer, EarlyView.
Natural products target the aging kidney in diabetic nephropathy by restoring the AMPK–SIRT1–Nrf2 axis, reducing oxidative stress, inflammation, fibrosis, and cellular senescence while enhancing mitochondrial biogenesis and antioxidant defenses.
Sherif Hamidu, Latif Adams, Eunice Ampem‐Danso, Justice Kumi, Abigail Aning, Fatima Hamidu, Mustapha Abdul Mumin Mohammed, Ayuba Nii Darku Ankrah, Seth Kwabena Amponsah   +8 more
wiley   +1 more source

Sampling Random Spanning Trees Faster than Matrix Multiplication

, 2017
We present an algorithm that, with high probability, generates a random spanning tree from an edge-weighted undirected graph in $\tilde{O}(n^{4/3}m^{1/2}+n^{2})$ time (The $\tilde{O}(\cdot)$ notation hides $\operatorname{polylog}(n)$ factors).
Durfee, David, Kyng, Rasmus, Peebles, John, Rao, Anup B., Sachdeva, Sushant   +4 more
core   +1 more source