A PLA minimization system is presented, which is dedicated for PLA-realizations of small tables containing integer values. The initial speciication of these tables can be modiied sligthly. Starting with a concise initial speciication a widened speciication (e.g. alternative rounding of real values to the next higher or lower integer) can be derived. From this widened spec-iication a modiied spe...

One can define a random walk on a hypercubic lattice in a space of integer dimension D. For such a process formulas can be derived that express the probability of certain events, such as the chance of returning to the origin after a given number of time steps. These formulas are physically meaningful for integer values of D. However, these formulas are unacceptable as probabilities when continu...

An original algorithm is presented that generates both restricted integer compositions and restricted integer partitions that can be constrained simultaneously by a) upper and lower bounds on the number of summands (“parts”) allowed, and b) upper and lower bounds on the values of those parts. The algorithm can implement each constraint individually, or no constraints to generate unrestricted se...

De-noising algorithms based on wavelet thresholding replace small wavelet coeecients by zero and keep or shrink the coeecients with absolute value above the threshold. The optimal threshold minimizes the error of the result as compared to the unknown, exact data. To estimate this optimal threshold, we use Generalized Cross Validation. This procedure does not require an estimate for the noise en...

The interactive algorithm [2] are widely used for solving multicriteria linear integer programming problems. Some of the interactive algorithms work with the aspiration levels of the criteria, others use weights to denote the relative significance of the criteria. We propose a learning-oriented [4] interactive algorithm for solving multicriteria linear integer programming problems. The main fea...

We present an automata-based approach for symbolic verification of systems with unbounded string and integer variables. Particularly, we are interested in automatically discovering the relationships among the string and integer variables. The lengths of the strings in a regular language form a semilinear set. We present a novel construction for length automata that accept the unary or binary re...

in this paper, a mathematical method is proposed to formulate a generalized ordering problem. this model is formed as a linear optimization model in which some variables are binary. the constraints of the problem have been analyzed with the emphasis on the assessment of their importance in the formulation. on the one hand, these constraints enforce conditions on an arbitrary subgraph and then g...

This paper aims at reducing the embedding distortion by improving predictor’s performance for prediction-error expansion (PE) based reversible watermarking. In the existing PE embedding methods, the predicted values or their variety should be rounded to integer values. This will restrict predictor’s performance since the prediction context is only with past pixels (image) or samples (audio). In...

Bilevel programming problem is characterized as hierarchical structure, involving two optimization problems at deferent levels. When some variables are restricted into integer set, the problem is very challenging for most canonical optimization approaches. In the present paper, a class of nonlinear mixed-integer bilevel programs is taken into account in which the follower is an integer linear p...