Results 31 to 40 of about 282,377 (316)

The minimum rank problem: A counterexample

open access: yesLinear Algebra and its Applications, 2008
We provide a counterexample to a recent conjecture that the minimum rank of every sign pattern matrix can be realized by a rational matrix. We use one of the equivalences of the conjecture and some results from projective geometry. As a consequence of the counterexample, we show that there is a graph for which the minimum rank over the reals is ...
Kopparty, Swastik, Bhaskara Rao, K.P.S.
openaire   +3 more sources

Reliability of autoregressive error models as post-processors for probabilistic streamflow forecasts [PDF]

open access: yesAdvances in Geosciences, 2011
In this study, the reliability of different versions of autoregressive error models as post-processors for probabilistic streamflow forecasts is evaluated. Rank histograms and reliability indices are used as performance measures.
M. Morawietz, C.-Y. Xu, L. Gottschalk
doaj   +1 more source

Projection onto the Set of Rank-Constrained Structured Matrices for Reduced-Order Controller Design

open access: yesAlgorithms, 2022
In this paper, we propose an efficient numerical computation method of reduced-order controller design for linear time-invariant systems. The design problem is described by linear matrix inequalities (LMIs) with a rank constraint on a structured matrix ...
Masaaki Nagahara, Yu Iwai, Noboru Sebe
doaj   +1 more source

Cell geometry and membrane protein crowding constrain Escherichia coli growth rate, overflow metabolism, respiration, and maintenance energy

open access: yesFEBS Letters, EarlyView.
The physical dimensions and shape of bacterial cells define the surface area available to acquire nutrients and the volume available for synthesizing proteins and DNA. Here, we use computational systems biology to decode the importance of cell geometry as a major determinant of prokaryotic phenotype, including growth rate and metabolic efficiency. This
Ross P. Carlson   +6 more
wiley   +1 more source

Algorithms and literate programs for weighted low-rank approximation with missing data

open access: yes, 2010
Linear models identification from data with missing values is posed as a weighted low-rank approximation problem with weights related to the missing values equal to zero.
Markovsky, Ivan, Ivan Markovsky
core   +1 more source

A Rank-Based Assignment Lottery for an Assignment Problem

open access: yesAppliedMath
For a traditional assignment problem with the same number of objects and agents, we introduce a new assignment lottery based on the notion of rank and analyze some of its properties.
Claudia Meo
doaj   +1 more source

Local low-rank approach to nonlinear matrix completion

open access: yesEURASIP Journal on Advances in Signal Processing, 2021
This paper deals with a problem of matrix completion in which each column vector of the matrix belongs to a low-dimensional differentiable manifold (LDDM), with the target matrix being high or full rank.
Ryohei Sasaki   +3 more
doaj   +1 more source

On the Orbit Problem of Free Lie Algebras

open access: yesJournal of New Theory, 2023
By operationalizing $F_{n}$ as a free Lie Algebra of finite rank $n$, this work considers the orbit problem for $F_{n}$. The orbit problem is the following: given an element $u\in F_{n}$ and a finitely generated subalgebra $H$ of $F_{n}$, does $H$ meet ...
Zeynep Yaptı Özkurt
doaj   +1 more source

Microbiome−host proteostasis crosstalk—An emerging perspective on mechanisms and interventions toward healthy longevity

open access: yesFEBS Letters, EarlyView.
Proteostasis and the gut microbiota play a key role in shaping host physiology. Microbiota‐derived metabolites, vitamins, and RNA modulate host proteostasis. Findings from model systems, including C. elegans, indicate microbes can either stabilize or disrupt host proteostasis.
Abhishek Anil Dubey, Maria Ermolaeva
wiley   +1 more source

The Rank-Ramsey problem and the Log-Rank conjecture

open access: yesCombinatorics, Probability and Computing
Abstract A graph is called Rank-Ramsey if (i) Its clique number is small, and (ii) The adjacency matrix of its complement has small rank. We initiate a systematic study of such graphs. Our main motivation is that their constructions, as well as proofs of their non-existence, are intimately related to the famous ...
Gal Beniamini   +2 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy