. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . iv DEDICATION . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . v ACKNOWLEDGEMENT . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . vi 1.0 INTRODUCTION . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 2.0 ENDOGENOUS FORMATION OF A BIDDING RING . . . . . . . . . 3 ...

This paper describes a game-theoretic methodology to design and embed watermarks in images. The optimality criterion is probability of error of the decoder. Analytical solutions are presented for problems involving Gaussian host images and illustrated with examples. Significant improvements over previous designs are obtained.

We consider component allocation in Assemble-to-Order production–inventory systems. We prove that asymptotic optimality on the diffusion scale can be achieved under a continuous-review policy. We also show that in many systems, meeting this optimality criterion requires component reservation.

in this paper we study optimization problems with infinite many inequality constraints on a banach space where the objective function and the binding constraints are locally lipschitz‎. ‎necessary optimality conditions and regularity conditions are given‎. ‎our approach are based on the michel-penot subdifferential.

Let G be a reductive group acting on an affine variety X , and let x ∈ X be a point whose G-orbit is not closed. In this paper, we study G.R. Kempf’s optimal class of cocharacters of G attached to the point x; in particular, we consider how this optimality transfers to subgroups of G. Our main result says that if K is a G-completely reducible subgroup of G which fixes x, then the optimal class ...

A class of multiobjective fractional programmings (MFP) are first formulated, where the involved functions are local Lipschitz and Clarke subdifferentiable. In order to deduce our main results, we give the definitions of the generalized (F,ρ) convex class about the Clarke subgradient. Under the above generalized convexity assumption, the alternative theorem is obtained, and some sufficient and ...

this paper provides an analysis of persian verbs within the framework of optimality theory. to be more specific, it mainly cocentrates on past and present stems of persian verbs. since analyzing this subject within the derivational framework would result phonological rules which are not natural, it is analysed by optimality theory which is one of the constraint-based approach. based on this, we...

The kth power of a cycle is obtained by adding an edge between all pairs of vertices whose distance on the cycle is at most k. In 1962, Pósa conjectured that a graph G on n vertices contains a square of a Hamilton cycle if it has minimum degree δ(G) ≥ 3 n, and, 11 years later, Seymour claimed that δ(G) ≥ k k+1 n is sufficient for the appearance of a kth power of a Hamilton cycle for any k ≥ 2. ...