Results 41 to 50 of about 3,701,882 (277)
Triviality and the Higgs mass lower bound
, 2004 In the minimal Standard Model, it is commonly believed that the Higgs mass cannot be too small, otherwise Top quark dynamics makes the Higgs potential unstable.
Altarelli +34 more
core +1 more source
FEBS Letters, EarlyView.Enteropathogenic E. coli (EPEC) infects the human intestinal epithelium, resulting in severe illness and diarrhoea. In this study, we compared the infection of cancer‐derived cell lines with human organoid‐derived models of the small intestine. We observed a delayed in attachment, inflammation and cell death on primary cells, indicating that host ...
Mastura Neyazi +5 more
wiley +1 more source
A lower bound for linear approximate compaction [PDF]
, 1993 The {\em $\lambda$-approximate compaction} problem is: given an input array of $n$ values, each either 0 or 1, place each value in an output array so that all the 1's are in the first $(1+\lambda)k$ array locations, where $k$ is the number of 1's in the ...
Chaudhuri, S.
core
Crosstalk between the ribosome quality control‐associated E3 ubiquitin ligases LTN1 and RNF10
FEBS Letters, EarlyView.Loss of the E3 ligase LTN1, the ubiquitin‐like modifier UFM1, or the deubiquitinating enzyme UFSP2 disrupts endoplasmic reticulum–ribosome quality control (ER‐RQC), a pathway that removes stalled ribosomes and faulty proteins. This disruption may trigger a compensatory response to ER‐RQC defects, including increased expression of the E3 ligase RNF10 ...
Yuxi Huang +8 more
wiley +1 more source
Cramer-Rao Lower Bound and Information Geometry
, 2013 This article focuses on an important piece of work of the world renowned Indian statistician, Calyampudi Radhakrishna Rao. In 1945, C. R. Rao (25 years old then) published a pathbreaking paper, which had a profound impact on subsequent statistical ...
Nielsen, Frank
core +1 more source
Randomized complexity lower bounds [PDF]
Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98, 1998 The complexity lower bound (log N) is proved for randomized computation trees (over reals with branching signs f ; >g) for recognizing an arrangement or a polyhedron with N faces. A similar lower bound is proved for randomized computation trees over any zero-characteristic eld with branching signs f=; 6 =g for recognizing an arrangement.
openaire +2 more sources
Multiple ETS family transcription factors bind mutant p53 via distinct interaction regions
FEBS Letters, EarlyView.Mutant p53 gain‐of‐function is thought to be mediated by interaction with other transcription factors. We identify multiple ETS transcription factors that can bind mutant p53 and found that this interaction can be promoted by a PXXPP motif. ETS proteins that strongly bound mutant p53 were upregulated in ovarian cancer compared to ETS proteins that ...
Stephanie A. Metcalf +6 more
wiley +1 more source
Lower Bounds of Copson Type for Hausdorff Matrices on Weighted Sequence Spaces [PDF]
Journal of Sciences, Islamic Republic of Iran, 2011 Let = be a non-negative matrix. Denote by the supremum of those , satisfying the following inequality: where , , and also is increasing, non-negative sequence of real numbers.
R. Lashkaripour
doaj
Bayesian Cramér-Rao Lower Bound for Magnetic Field-Based Localization
IEEE Access, 2022 In this paper, we show how to analyze the achievable position accuracy of magnetic localization based on Bayesian Cramér-Rao lower bounds and how to account for deterministic inputs in the bound.
Benjamin Siebler +2 more
doaj +1 more source