We report on the performance of a new class of constrained codes, called weakly constrained codes. Weakly constrained codes do not strictly guarantee the imposed channel constraints but rather generate codewords that violate with given (small) probability the prescribed constraint. Weakly constrained codes are speci cally of interest when it is desirable that the code rate R = p=q is very high ...

To limit the probability of unacceptable worst-case linearization errors that might yield risks for power system operations, this letter proposes a robust data-driven linear flow (RD-LPF) model. It applies to both transmission and distribution systems can achieve better robustness than recent models. The key idea is probabilistically constrain through distributionally chance-constrained program...

In this paper, we present constrained simulated annealing (CSA), a global minimization algorithm that converges to constrained global minima with probability one, for solving nonlinear discrete non-convex constrained minimization problems. The algorithm is based on the necessary and suucient condition for constrained local minima in the theory of discrete Lagrange multipliers we developed earli...

Piecewise affine models provide a qualitative description of the dynamics of a system, and are often used to study genetic regulatory networks. The state space of a piecewise affine system is partitioned into hyperrectangles, which can be represented as nodes in a directed graph, so that the system's trajectories follow a path in a transition graph. This paper proposes and compares two definiti...

In this paper, we present constrained simulated annealing (CSA), a global minimization algorithm that converges to constrained global minima with probability one, for solving nonlinear discrete nonconvex constrained minimization problems. The algorithm is based on the necessary and sufficient condition for constrained local minima in the theory of discrete Lagrange multipliers we developed earl...

The present investigation deals with performance analysis of single server preemptive priority retrial queue with immediate Bernoulli feedback. There are two types of customers are considered, which are priority customers and ordinary customers. The priority customers do not form any queue and have an exclusive preemptive priority to receive their services over ordinary customers. After complet...