We introduce a constrained empirical loss minimization framework for estimating highdimensional sparse precision matrices and propose a new loss function, called the D-trace loss, for that purpose. A novel sparse precision matrix estimator is defined as the minimizer of the lasso penalized D-trace loss under a positive-definiteness constraint. Under a new irrepresentability condition, the lasso...

A bstract In this paper, we study a class of symmetry reduced models $$ \mathcal{N} N = 1 super- gravity using self-dual variables. It is based on particular Ansatz for the gravitino field as proposed by D’Eath et al. We show that essential part constraint algebra in classical theory closes. particular, (grad...

With the introduction of multicore hardware to embedded systems their vulnerability to race conditions has been drastically increased. Therefore, sufficient methods and techniques have to be developed in order to identify this kind of runtime errors. In this paper, we demonstrate an approach employing a formal technique in the verification process. We use MEMICS, which is a specialized constrai...

Query processing for data streams should be continuous and rapid, which requires strict time constraint. In most previous researches, in order to guarantee this constraint, the evaluation order of join predicates in a continuous query is optimized by a greedy. However, the greedy strategy traces only the first promising plan, so that it often finds a sub-optimal plan. This paper proposes an imp...

A random matrix model with a σ-model like constraint, the restricted trace ensemble (RTE), is solved in the large-n limit. In the macroscopic limit the smooth connected two-point resolvent G(z,w) is found to be nonuniversal, extending previous results from monomial to arbitrary polynomial potentials. Using loop equation techniques we give a closed though nonuniversal expression for G(z,w), whic...

We show here that the problem of maximizing a family of quantitative functions, encompassing both the modularity (Q-measure) and modularity density (D-measure), for community detection can be uniformly understood as a combinatoric optimization involving the trace of a matrix called modularity Laplacian. Instead of using traditional spectral relaxation, we apply additional nonnegative constraint...

Two types of errors can occur when discriminating pairs quantum states. Asymmetric state discrimination involves minimizing the probability one type error, subject to a constraint on other. We give explicit expressions bounding set achievable errors, using trace norm, fidelity, and Chernoff bound. The upper bound is asymptotically tight lower exact for pure Unlike asymptotic bounds, our bounds ...

We develop the embedded gradient vector field method, introduced in [8] and [9], for case of special unitary group $\mathcal{SU}(N)$ regarded as a constraint submanifold $\mathcal{U}(N)$. The optimization problem associated to trace fidelity cost function defined on that appears context quantum control landscapes is completely solved using method. prove $N\geq 5$, landscape not $\mathcal{SU}(N)...

This paper introduces an alternative operational model for constraint logic programs. First, a transition system is introduced, which is used to deene a trace semantics T. Next, an equivalent xpoint semantics F is deened: a dataaow graph is assigned to a program, and a consequence operator on tuples of sets of constraints is given whose least xpoint determines one set of constraints for each no...