This paper presents a semantics for non-deterministic concurrent constraint programming languages. The semantics address the issues of giving an adequate treatment of non-terminating computations, in particular with fairness and liveness, and giving a compositional semantics, where the meaning of a recursively deened program is obtained as a xpoint. We present a simple concurrent constraint pro...

Abstract We derive the math (objective and gradients) for three closely-related Gaussian-based data models. All three are based on Factor Analysis (FA). The first is a simplification of FA; the second is FA itself; the third is our extension of FA to use a smooth trace norm prior on the factor loading matrix (in place of the hard rank constraint used by FA). See [3] for some background on Facto...

We give thread-modular non-relational value analyses as abstractions of a local trace semantics. The semantics well the are formulated by means global invariants and side-effecting constraint systems. show that generalization analysis provided static analyzer Goblint natural improvement Antoine Miné’s approach can be obtained instances this general scheme. these two incomparable w.r.t. precisio...

the objective of this study is to examine the effect of mispricing on firm’s investment behavior and capital structure. it also tests the role of the level of financial constraints in the relationship between mispricing , investment and capital structure. using data of 110 firms of tehran stock exchang from 1384-1389, results indicated that mispricing has negative impact to firms investment. ho...

According to the World Health Organization (WHO), breast cancer (BC) is one of the most deadly cancers diagnosed among middle-aged women. Precise diagnosis and prognosis are crucial to reduce the high death rate. In this paper we present a framework for automatic malignancy grading of fine needle aspiration biopsy tissue. The malignancy grade is one of the most important factors taken into cons...

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...

As high performance computing (HPC) continues to grow in scale and complexity, energy becomes a critical constraint in the race to exascale computing. The days of “performance at all cost” are coming to an end. While performance is still a major objective, future HPC will have to deliver desired performance under the energy constraint. Among various power management methods, power capping is a ...

the trajectory planning, which is known as a movement from starting to end point by satisfying the constraints along the path is an essential part of robot motion planning. a common way to create trajectories is to deal with polynomials which have independent coefficients. this paper presents a trajectory formulation as well as a procedure to arrange the suitable trajectories for applications. ...