We point out that a simple test of the mechanism of CP violation can be performed by a measurement of the CP asymmetries in exclusive and inclusive radiative rare decays. We show that the rate asymmetries ∆Γ = Γ(B → fγ)− Γ(B+ → f̄γ) for certain final states f can be predicted in a theoretically clean way. Some implications for b → sl+l− decays are discussed.

A large class of separable quadratic programming problems is presented The problems in the class can be solved in linear time The class in cludes the separable convex quadratic transportation problem with a xed number of sources and separable convex quadratic programming with nonnegativity con straints and a xed number of linear equality constraints

Granger causality (GC) is one of the most popular measures to reveal causality influence of time series based on the estimated linear regression model and has been widely applied in economics and neuroscience due to its simplicity, understandability and easy implementation. Especially, its counterpart in frequency domain, spectral GC, has recently received growing attention to study causal inte...

We propose a new interior point based method to minimize a linear function of a matrix variable subject to linear equality and inequality constraints over the set of positive semidefinite matrices. We show that the approach is very efficient for graph bisection problems, such as max-cut. Other applications include max-min eigenvalue problems and relaxations for the stable set problem.

Let ρ ≥ 1 and w ρ (A) be the operator radius of a linear operator A. Suppose m is a positive integer. It is shown that for a given invertible linear operator A acting on a Hilbert space, one has w ρ (A −m) ≥ w ρ (A) −m. The equality holds if and only if A is a multiple of a unitary operator.

We propose a new interior point based method to minimize a linear function of a matrix variable subject to linear equality and inequality constraints over the set of positive semideenite matrices. We present a theoretical convergence analysis, and show that the approach is very eecient for graph bisection problems, such as max-cut. The approach can also be applied to max-min eigenvalue problems.

We propose a new interior point based method to minimize a linear function of a matrix variable subject to linear equality and inequality constraints over the set of positive semideenite matrices. We show that the approach is very eecient for graph bisection problems, such as max-cut. Other applications include max-min eigenvalue problems and relaxations for the stable set problem.

Equality and proportionality of the ordinary least-squares estimator (OLSE), the weighted least-squares estimator (WLSE), and the best linear unbiased estimator (BLUE) for Xb in the general linear (Gauss–Markov) model M 1⁄4 fy;Xb; sRg are investigated through the matrix rank method. r 2006 Elsevier B.V. All rights reserved. MSC: Primary 62J05; 62H12; 15A24