Three methods for computing the upper bound when linear cuts are performed on the uncertainty set are described. One of them is based on the computation of spherical , one involves the construction of an implicit system to implement the linear constraints, and the other reformulates the problem into a higher dimensional one such that the standard upper bound computation can be used. The quality...

The robust stability analysis for discrete large-scale uncertain systems with multiple time delays is addressed in this paper. We establish a method for selecting properly a positive definite matrix Q to derive a very simple upper solution bound of the discrete algebraic Lyapunov equation (DALE). Then, using the Lyapunov equation approach method with this upper bound, several sufficient conditi...

One of the major disadvantages of using Branch and Bound algorithm to solve permutation bases problems by computer is the size of main memory required. The single Array Branch and Bound (SABB) method introduction here aims to overcome this deficiency, using only N memory locations as a vector of size N, and a single cell C with N bits.

In image steganography, a pixel can carry secret bits by choosing adding/subtracting one to/from the gray value. This kind of “ 1 steganography” can hide a longer message than simple LSB embedding. We propose a double-layered embedding method for implementing “ 1 steganography,” in which binary covering codes and wet paper codes are used to hide messages in the LSB plane and the second LSB plan...

This paper considers the problem of scheduling a single machine, in which the objective function is to minimize the weighted quadratic earliness and tardiness penalties and no machine idle time is allowed. We develop a branch and bound algorithm involving the implementation of lower and upper bounding procedures as well as some dominance rules. The lower bound is designed based on a lagrangian ...

We consider online scheduling of jobs with specic release time on m identical machines. Each job has a weight and a size; the goal is maximizing total weight of completed jobs. At release time of a job it must immediately be scheduled on a machine or it will be rejected. It is also allowed during execution of a job to preempt it; however, it will be lost and only weight of completed jobs contri...