Results 51 to 60 of about 446,887 (277)

Zero forcing with random sets

open access: yesDiscrete Mathematics
22 pages, 5 ...
Curtis, Bryan   +4 more
openaire   +3 more sources

Calpain small subunit homodimerization is robust and calcium‐independent

open access: yesFEBS Letters, EarlyView.
Calpains dimerize via penta‐EF‐hand (PEF) domains. Using single‐molecule force spectroscopy, we measured the strength and kinetics of PEF–PEF homodimer binding. The interaction is robust, shows a transient conformational step before dissociation, and remains largely insensitive to Ca2+.
Nesha May O. Andoy   +4 more
wiley   +1 more source

Failed Skew Zero Forcing Numbers of Path Powers and Circulant Graphs

open access: yesAppliedMath
For a graph G, the zero forcing number of G, Z(G), is defined to be the minimum cardinality of a set S of vertices for which repeated applications of the forcing rule results in all vertices being in S. The forcing rule is as follows: if a vertex v is in
Aidan Johnson   +3 more
doaj   +1 more source

On the Maximal Diversity Order of Spatial Multiplexing with Transmit Antenna Selection

open access: yes, 2007
Zhang et. al. recently derived upper and lower bounds on the achievable diversity of an N_R x N_T i.i.d. Rayleigh fading multiple antenna system using transmit antenna selection, spatial multiplexing and a linear receiver structure. For the case of L = 2
Jalden, J., Ottersten, B.
core   +3 more sources

Phenotypic and genotypic characterization of single circulating tumor cells in the follow‐up of high‐grade serous ovarian cancer

open access: yesMolecular Oncology, EarlyView.
Single circulating tumor cells (sCTCs) from high‐grade serous ovarian cancer patients were enriched, imaged, and genomically profiled using WGA and NGS at different time points during treatment. sCTCs revealed enrichment of alterations in Chromosomes 2, 7, and 12 as well as persistent or emerging oncogenic CNAs, supporting sCTC identity.
Carolin Salmon   +9 more
wiley   +1 more source

Downlink Assisted Uplink Zero Forcing for TDD Multiuser MIMO Systems

open access: yesEURASIP Journal on Wireless Communications and Networking, 2009
This paper proposes practical coordinated linear transmit-receive processing schemes for the uplink (UL) of multiuser multiple-input multiple-output (MIMO) systems in the time division duplex (TDD) mode.
Komulainen Petri   +3 more
doaj   +2 more sources

Joint pre‐ and post‐equalization using optical multi‐level signaling

open access: yesThe Journal of Engineering, 2022
A joint pre‐ and post‐equalization scheme is proposed for an optical intensity modulation and direct detection (IM/DD) system. At the transmitter, a linear feed‐forward pre‐equalizer with just two, three, or four filter taps is suggested to limit the ...
Jasmeet Singh   +3 more
doaj   +1 more source

Zero forcing number, constrained matchings and strong structural controllability

open access: yes, 2015
The zero forcing number is a graph invariant introduced to study the minimum rank of the graph. In 2008, Aazami proved the NP-hardness of computing the zero forcing number of a simple undirected graph.
Delvenne, Jean-Charles, Trefois, Maguy
core   +1 more source

TRAIL‐PEG‐Apt‐PLGA nanosystem as an aptamer‐targeted drug delivery system potential for triple‐negative breast cancer therapy using in vivo mouse model

open access: yesMolecular Oncology, EarlyView.
Aptamers are used both therapeutically and as targeting agents in cancer treatment. We developed an aptamer‐targeted PLGA–TRAIL nanosystem that exhibited superior therapeutic efficacy in NOD/SCID breast cancer models. This nanosystem represents a novel biotechnological drug candidate for suppressing resistance development in breast cancer.
Gulen Melike Demirbolat   +8 more
wiley   +1 more source

A Short Proof for a Lower Bound on the Zero Forcing Number

open access: yesDiscussiones Mathematicae Graph Theory, 2020
We provide a short proof of a conjecture of Davila and Kenter concerning a lower bound on the zero forcing number Z(G) of a graph G. More specifically, we show that Z(G) ≥ (g − 2)(δ − 2) + 2 for every graph G of girth g at least 3 and minimum degree δ at
Fürst Maximilian, Rautenbach Dieter
doaj   +1 more source

Home - About - Disclaimer - Privacy