ADP influx and ADP phosphorylation may alter mitochondrial free [Ca2+] ([Ca2+](m)) and consequently mitochondrial bioenergetics by several postulated mechanisms. We tested how [Ca2+](m) is affected by H2PO4(-) (P(i)), Mg2+, calcium uniporter activity, matrix volume changes, and the bioenergetic state. We measured [Ca2+](m), membrane potential, redox state, matrix volume, pH(m), and O2 consumpti...

The present paper connects sharpenings of Sauer’s bound on forbidden configurations with color critical hypergraphs. We define a matrix to be simple if it is a (0,1)-matrix with no repeated columns. Let F be a k × l (0,1)-matrix (the forbidden configuration). Assume A is an m × n simple matrix which has no submatrix which is a row and column permutation of F . We define forb(m, F ) as the best ...

This paper is devoted to the study of the traditional estimator of the fourth-order cumulants matrix of a high-dimensional multivariate Gaussian white noise. If M represents the dimension of the noise and N the number of available observations, it is first established that this M × M matrix converges towards 0 in the spectral norm sens provided M 2 logN N → 0. The behaviour of the estimated fou...

The material of this section is based on Chapter 1 of Richard Stanley’s notes “Topics in Algebraic Combinatorics”, which can be found at http://math.mit.edu/∼rstan/algcomb.pdf. Recall that an m-by-n matrix is an array of numbers (m rows and n columns), and we can multiply an mby-n matrix and an n-by-p matrix together to get an m-by-p matrix. The resulting matrix has entries obtained by taking e...

In this paper, a meta-heuristic method, the Bat Algorithm, based on the echolocation behavior of bats is used to determine the optimum service rate of a queue problem. A finite buffer M/M/1 queue with N policy, multiple working vacations and Bernoulli schedule vacation interruption is considered. Under the two customers' impatient situations, balking and reneging, the...

An II x m matrix A is called bottleneck Monge matrix if max{ajj, a,,} < max{a,, ali} for all l<i<r<n, 1 < j < s < m. The matrix A is termed permuted bottleneck Monge matrix, if there exist row and column permutations such that the permuted matrix becomes a bottleneck Monge matrix. We first deal with the special case of Cl bottleneck Monge matrices. Next, we derive several fundamental properties...

A typical first step of a direct solver for linear system Mx = b is reordering of symmetric matrix M to improve execution time and space requirements of the solution process. In this work, we propose a novel nesteddissection-based ordering approach that utilizes hypergraph partitioning. Our approach is based on formulation of graph partitioning by vertex separator (GPVS) problem as a hypergraph...

In this paper, we study the following extremal problem and its relevance to the sum of the so-called superoptimal singular values of a matrix function: Given an m × n matrix function Φ, when is there a matrix function Ψ * in the set A n,m k such that Z T trace(Φ(ζ)Ψ * (ζ))dm(ζ) = sup Ψ∈A n,m k ˛ ˛ ˛ ˛ Z T trace(Φ(ζ)Ψ(ζ))dm(ζ) ˛ ˛ ˛ ˛ ? The set A n,m k is defined by A n,m k def = n Ψ ∈ H 1 0 (Mn...