We show that the algorithm to extract diverse M -solutions from a Conditional Random Field (called divMbest [1]) takes exactly the form of a Herding procedure [2], i.e. a deterministic dynamical system that produces a sequence of hypotheses that respect a set of observed moment constraints. This generalization enables us to invoke properties of Herding that show that divMbest enforces implausib...

Shortage and salinity of irrigation water are two major constraints that influence rapeseed production in arid and semi-arid regions of central and southern Iran. In this study, effects of deficit irrigation with different salinity levels and planting methods (in-furrow and on-ridge) as strategies for coping with water and salinity stresses on yield and yield quality of rapeseed were invest...

As the CMOS technology scales down to nanometer regime the process variations have profound effect on circuit attributes. Meeting timing and power constraints under such process variations in nano−CMOS circuit design is becoming increasingly difficult. A shifting from worstcase based analysis and optimization to statistical or probability based analysis and optimization at every level of circui...

We study approximations of optimization problems with probabilistic constraints in which the original distribution of the underlying random vector is replaced with an empirical distribution obtained from a random sample. We show that such a sample approximation problem with risk level larger than the required risk level will yield a lower bound to the true optimal value with probability approac...

Deterministic worst-case timing analysis has been demonstrated to provide an unnecessarily large timing margin for process variations. We show that this overconservatism penalizes designs implemented with levelsensitive state elements more than equivalent designs using edge-triggered elements. Under this model, when retiming and/or clock skew scheduling are applied, the optimal period in both l...

tions yield two quartic polynomial constraints, gi(v) = 52() = 0, on the translational velocity, v, of the rigid body. We show that gi(v) and ?2(v) have, in general, exactly 16 distinct common zeros, and we show that, in general, ten of these common zeros yield values of v compatible with the 2D motion field. An alternative proof that there are ten values of v, based on the theory of ambiguous ...

The linehaul-feeder vehicle routing problem with virtual depots and time windows (LFVRPTW) is a new version of city logistics. Four important issues are explored and fifteen sample examples used for demonstration. First, the LFVRPTW always yields better results than the vehicle routing problem with time windows (VRPTW). Second, LFVRPTW is advantageous compared with VRPTW. Third, more virtual de...

The authors address the problem of computing a navigation function that serves as a feedback motion strategy for problems that involve generic differential constraints, nonconvex collision constraints, and the optimization of a specified criterion. The determination of analytical solutions to such problems is well beyond the state of the art; therefore, the authors focus on obtaining numerical ...