‎in this paper, using the idea of convexificators, we study boundedness and nonemptiness of lagrange multipliers satisfying the first order necessary conditions. we consider a class of nons- mooth fractional programming problems with equality, inequality constraints and an arbitrary set constraint. within this context, define generalized mangasarian-fromovitz constraint qualification and show t...

In a networked control system, quantization is inevitable to transmit control and measurement signals. While uniform quantizers are often used in practical systems, the overloading, which is due to the limitation on the number of bits in the quantizer, may significantly degrade the control performance. In this paper, we design an overloading-free feedback quantizer based on a ∆Σ modulator, comp...

Customizable type error diagnosis has been proposed as a solution to achieve domain-specific type error diagnosis for embedded domain specific languages. A proven approach is to phrase type inferencing as a constraint-solving problem, so that we can manipulate the order in which constraints are solved, and associate domain-specific type error messages with specific constraints to be communicate...

Human motor behavior is constantly adapted through the process of error-based learning. When the motor system encounters an error, its estimate about the body and environment will change, and the next movement will be immediately modified to counteract the underlying perturbation. Here, we show that a second mechanism, use-dependent learning, simultaneously changes movements to become more simi...

In this paper, a new first-order, sphere-constraint-preserving numerical scheme is constructed for the Ericksen-Leslie equations with variable density. Firstly, by denoting orientation field vector $ \pmb{d} in polar coordinate, we rewrite system into an equivalent such that sphere constraint \lvert \pmb{d}\rvert = 1 can be still preserved at discrete level. Secondly, propose first-order discre...

This paper is about a novel technique called spatial coupling and its application in the analysis of random constraint satisfaction problems (CSP). Spatial Coupling was recently invented in the area of error correcting codes where it has resulted in efficient capacity-achieving codes for a wide range of channels. However, this technique is not limited to problems in communications. It can be ap...

In classical constraint satisfaction, combining mutually redundant models using channeling constraints is effective in increasing constraint propagation and reducing search space for many problems. In this paper, we investigate how to benefit the same for weighted constraint satisfaction problems (WCSPs), a common soft constraint framework for modeling optimization and over-constrained problems...

Robustness and offset-free tracking remains a challenge in the field of nonlinear model predictive control (NMPC) in the presence of plant-model mismatch. This paper focuses on offset-free tracking with robust constraint satisfaction using NMPC. In the proposed approach, the discrepancy between the plant and a fundamental model is captured using a model-error model. The fundamental model is aug...

In this paper a new sliding mode control algorithm for the third order uncertain, nonlinear and time-varying dynamic system subject to unknown disturbance and input constraint is proposed. The algorithm employs a time-varying switching plane. At the initial time t = t0, the plane passes through the point determined by the system initial conditions in the error state space. Afterwards, the plane...

A new algorithm for nding lines in images under a bounded error noise model is described. The algorithm is based on a hierarchical and adaptive subdivision of the space of line parameters, but, unlike previous adaptive or hierarchical line nders based on the Hough transform, measures errors in image space and thereby guarantees that no solution satisfying the given error bounds will be lost. In...