Due to convenient operation and robust imaging, multi-wavelength phase retrieval has been widely applied in lensfree on-chip digital holographic microscope (LFOCDHM). Nevertheless, the insufficient diffraction variation small number of measurements on LFOCDHM make it difficult eliminate twin image by retrieval. We propose a for based energy constraint, global update strategy, vector extrapolati...

We present a formulation of non-penetration constraint between pairs of polytopes which accounts for all possible combinations of active contact between geometric features. This is the first formulation that exactly models the body geometries near points of potential contact, preventing interpenetration while not over-constraining body motions. Unlike many popular methods, ours does not wait fo...

During the past 15 years the topic of constraint databases (CDB) [2, 3] has evolved into a mature area of computer science with sound mathematical foundations and with a profound theoretical understanding of the expressive power of a variety of query languages. Constraint databases are especially suited for applications in which possibly infinite sets of continuous data, which have a geometric ...

Lifted probabilistic inference algorithms exploit regularities in the structure of graphical models to perform inference more efficiently. More specifically, they identify groups of interchangeable variables and perform inference once per group, as opposed to once per variable. The groups are defined by means of constraints, so the flexibility of the grouping is determined by the expressivity o...

potato virus y (pvy) and potato leafroll virus (plrv) are two major viruses which reduce 10-90 percent of yield and quality of potato tubers. in the present study, the efficiency of different methods, including meristem culture, thermotherapy followed by meristem culture and electerotherapy followed by meristem culture in two cultivars (agria and marfona) infected by plrv or pvy were evaluated....

Abstract. We present a new method for the generation of linear invariants which reduces the problem to a non-linear constraint solving problem. Our method, based on Farkas’ Lemma, synthesizes linear invariants by extracting non-linear constraints on the coefficients of a target invariant from a program. These constraints guarantee that the linear invariant is inductive. We then apply existing t...

this paper presents a new bi-objective mathematical model for a permutation flowshop scheduling problem with availability constraint in case of preventive maintenance operations on machines. in this paper, preventive maintenance is flexible and there is not a certain time for the maintenance operation; however, time between two consecutive maintenance operations for each machine should not be g...

Constraint databases that can be described by boolean combinations of polynomial inequalities over the reals have received ample research attention. In particular, the expressive power of first-order logic over the reals, as a constraint database query language, has been studied extensively. The difficulty of the effective evaluation of first-order queries, usually involving some form of quanti...

A strategy that calculates an explicit state feedback policy to regulate constrained uncertain discrete-time linear systems is presented. We consider processes, affected by box-bounded multiplicative uncertainty as well bounded additive with and inputs constraints. The proposed method includes (i) the calculation of a terminal set constraint (ii) robust reformulation constraints in prediction h...

Local consistency has proven to be an important concept in the theory and practice of constraint networks. In this paper, we present a new de nition of local consistency, called relational consistency. The new de nition is relation-based, in contrast with the previous de nition of local consistency, which we characterize as variable-based. We show the conceptual power of the new de nition by sh...