An application of <Emphasis Type="Italic">H</Emphasis>-differentiability to nonnegative and unrestricted generalized complementarity problems

This paper deals with nonnegative nonsmooth generalized complementarity problem, denoted by GCP(f,g). Starting with H-differentiable functions f and g, we describe H-differentials of some GCP functions and their merit functions. We show how, under appropriate conditions on H-differentials of f and g, minimizing a merit function corresponding to f and g leads to a solution of the generalized complementarity problem. Moreover, we generalize the concepts of monotonicity, P ₀-property and their variants for functions and use them to establish some conditions to get a solution for generalized complementarity problem. Our results are generalizations of such results for nonlinear complementarity problem when the underlying functions are C ¹, semismooth, and locally Lipschitzian.     

On locally <Emphasis Type="Italic">A</Emphasis>-convex <Emphasis Type="Italic">H</Emphasis>*-algebras

We endow any proper A-convex H*-algebra (E, τ) with a locally pre-C*-topology. The latter is equivalent to that introduced by the pre C*-norm given by Ptàk function when (E, τ) is a Q-algebra. We also prove that the algebra of complex numbers is the unique proper locally A-convex H*-algebra which is barrelled and Q-algebra.      

<Emphasis Type="Italic">∂</Emphasis>-operations and <Emphasis Type="Italic">H</Emphasis><Subscript><Emphasis Type="Italic">V</Emphasis></Subscript>-fields

The hyperoperations, called theta-operations （δ）, are motivated from the usual property, which the derivative has on the derivation of a product of functions. Using any map on a set, one can define δ-operations. In this paper, we continue our study on the δ-operations on groupoids, rings, fields and vector spaces or on the corresponding hyperstructures. Using δ-operations one obtains, mainly, Hwstructures, which form the largest class of the hyperstructures. For representation theory of hyperstructures, by hypermatrices, one needs special Hv-rings or Hy-fields, so these hyperstructures can be used. Moreover, we study the relation of these δ-structures with other classes of hyperstructures, especially with the Hv-structures.     

On potentially <Emphasis Type="Italic">H</Emphasis>-graphic sequences

For given a graph H, a graphic sequence π = (d ₁, d ₂,..., d _n) is said to be potentially H-graphic if there is a realization of π containing H as a subgraph. In this paper, we characterize the potentially (K ₅ − e)-positive graphic sequences and give two simple necessary and sufficient conditions for a positive graphic sequence π to be potentially K ₅-graphic, where K _r is a complete graph on r vertices and K _r-e is a graph obtained from K _r by deleting one edge. Moreover, we also give a simple necessary and sufficient condition for a positive graphic sequence π to be potentially K ₆-graphic. Project supported by National Natural Science Foundation of China (No. 10401010).     

On linearly ordered <Emphasis Type="Italic">H</Emphasis>-closed topological semilattices

We give a criterion for a linearly ordered topological semilattice to be H-closed. We also prove that any linearly ordered H-closed topological semilattice is absolutely H-closed and we show that every linearly ordered semilattice is a dense subsemilattice of an H-closed topological semilattice.     

Approximations for the <Emphasis Type="Italic">M</Emphasis>/<Emphasis Type="Italic">GI</Emphasis>/<Emphasis Type="Italic">N</Emphasis>+<Emphasis Type="Italic">GI</Emphasis> type call center

In this paper, we propose approximations to compute the steady-state performance measures of the M/GI/N+GI queue receiving Poisson arrivals with N identical servers, and general service and abandonment-time distributions. The approximations are based on scaling a single server M/GI/1+GI queue. For problems involving deterministic and exponential abandon times distributions, we suggest a practical way to compute the waiting time distributions and their moments using the Laplace transform of the workload density function. Our first contribution is numerically computing the workload density function in the M/GI/1+GI queue when the abandon times follow general distributions different from the deterministic and exponential distributions. Then we compute the waiting time distributions and their moments. Next, we scale-up the M/GI/1+GI queue giving rise to our approximations to capture the behavior of the multi-server system. We conduct extensive numerical experiments to test the speed and performance of the approximations, which prove the accuracy of their predictions.      

On <Emphasis Type="Italic">k</Emphasis>-Spaces and <Emphasis Type="Italic">k</Emphasis><Subscript><Emphasis Type="Italic">R</Emphasis></Subscript>-Spaces

In this note we study the relation between k _R -spaces and k-spaces and prove that a k _R -space with a σ-hereditarily closure-preserving k-network consisting of compact subsets is a k-space, and that a k _R -space with a point-countable k-network consisting of compact subsets need not be a k-space. This work was supported by the NSF of China (10271056).     

The flatness properties of <Emphasis Type="Italic">S</Emphasis>-poset <Emphasis Type="Italic">A</Emphasis>(<Emphasis Type="Italic">I</Emphasis>) and Rees factor <Emphasis Type="Italic">S</Emphasis>-posets

Let S be a pomonoid and I a proper right ideal of S. In a previous paper, using the amalgamated coproduct A(I) of two copies of _S S over I, we were able to solve one of the problems posed in S. Bulman-Fleming et al. (Commun. Algebra 34:1291–1317, 2006). In the present paper, we investigate further flatness properties of A(I). We also solve another problem stated in the paper cited above. Namely, we determine the condition under which Rees factor S-posets have property (P _w ). Research supported by nwnu-kjcxgc-03-18.     

Consecutive customer losses in regular and oscillating <Emphasis Type="Italic">M</Emphasis><Superscript><Emphasis Type="Italic">X</Emphasis></Superscript>/<Emphasis Type="Italic">G</Emphasis>/1/<Emphasis Type="Italic">n</Emphasis> systems

We derive fast recursions to compute the probability that k or more consecutive customer losses take place during a busy period of a queue, the so called k-CCL probability, for regular and oscillating M ^X /G/1/n systems.     

On Two Applications of H-Differentiability to Optimization and Complementarity Problems

In a recent paper, Gowda and Ravindran (Algebraic univalence theorems for nonsmooth functions, Research Report, Department of Mathematics and Statistics, University of Maryland, Baltimore, MD 21250, March 15, 1998) introduced the concepts of H-differentiability and H-differential for a function f : R ⁿ R ⁿ and showed that the Fréchet derivative of a Fréchet differentiable function, the Clarke generalized Jacobian of a locally Lipschitzian function, the Bouligand subdifferential of a semismooth function, and the C-differential of a C-differentiable function are particular instances of H-differentials.In this paper, we consider two applications of H-differentiability. In the first application, we derive a necessary optimality condition for a local minimum of an H-differentiable function. In the second application, we consider a nonlinear complementarity problem corresponding to an H-differentiable function f and show how, under appropriate conditions on an H-differential of f, minimizing a merit function corresponding to f leads to a solution of the nonlinear complementarity problem. These two applications were motivated by numerous studies carried out for C ¹, convex, locally Lipschitzian, and semismooth function by various researchers.     

Multiple <Emphasis Type="Italic">q</Emphasis>-zeta functions and multiple <Emphasis Type="Italic">q</Emphasis>-polylogarithms

For every positive integer d we define the q-analog of multiple zeta function of depth d and study its properties, generalizing the work of Kaneko et al. who dealt with the case d=1. We first analytically continue it to a meromorphic function on ℂ ^d with explicit poles. In our Main Theorem we show that its limit when q ↑1 is the ordinary multiple zeta function. Then we consider some special values of these functions when d=2. At the end of the paper we also propose the q-analogs of multiple polylogarithms by using Jackson’s q-iterated integrals and then study some of their properties. Our definition is motivated by those of Koornwinder and Schlesinger although theirs are slightly different from ours. Partially supported by NSF grant DMS0139813 and DMS0348258.     

Localization of <Emphasis Type="Italic">LM</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis></Subscript>-algebras

The aim of this paper is to define the localization LM _n -algebra of an LM _n —algebra L with respect to a topology F on L; in Section 5 we prove that the maximal LM _n -algebra of fractions (defined in [3]) and the LM _n -algebra of fractions relative to an Λ—closed system (defined in Section 2) are LM _n -algebras of localization.     

<Emphasis Type="Italic">L</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis></Subscript>-mixed intersection bodies

In this paper the author first introduce a new concept of L _p -dual mixed volumes of star bodies which extends the classical dual mixed volumes. Moreover, we extend the notions of L _p intersection body to L _p -mixed intersection body. Inequalities for L _p -dual mixed volumes of L _p -mixed intersection bodies are established and the results established here provide new estimates for these type of inequalities. This work was supported by the Natural Science Foundation of Zhejiang Province of China (Grant No. Y605065) and the Foundation of the Education Department of Zhejiang Province of China (Grant No. 20050392)     

Analysis of GI<Superscript><Emphasis Type="Italic">X</Emphasis></Superscript>/<Emphasis Type="Italic">M</Emphasis>(<Emphasis Type="Italic">n</Emphasis>)//<Emphasis Type="Italic">N</Emphasis> systems with stochastic customer acceptance policy

We investigate GI ^X /M(n)//N systems with stochastic customer acceptance policy, function of the customer batch size and the number of customers in the system at its arrival. We address the time-dependent and long-run analysis of the number of customers in the system at prearrivals and postarrivals of batches and seen by customers at their arrival to the system, as well as customer blocking probabilities. These results are then used to derive the continuous-time long-run distribution of the number of customers in the system. Our analysis combines Markov chain embedding with uniformization and uses stochastic ordering as a way to bound the errors of the computed performance measures.      

Duality for <Emphasis Type="Italic">ε</Emphasis>-Variational Inequality

In this paper, following the method in the proof of the composition duality principle due to Robinson and using some basic properties of the ε-subdifferential and the conjugate function of a convex function, we establish duality results for an ε-variational inequality problem. Then, we give Fenchel duality results for the ε-optimal solution of an unconstrained convex optimization problem. Moreover, we present an example to illustrate our Fenchel duality results for the ε-optimal solutions. The authors thank the referees for valuable suggestions and comments. This work was supported by Grant No. R01-2003-000-10825-0 from the Basic Research Program of KOSEF.     

<Emphasis Type="Italic">K</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis></Subscript>-nearest neighbor estimators of entropy

For estimating the entropy of an absolutely continuous multivariate distribution, we propose nonparametric estimators based on the Euclidean distances between the n sample points and their k _n -nearest neighbors, where {k _n : n = 1, 2, …} is a sequence of positive integers varying with n. The proposed estimators are shown to be asymptotically unbiased and consistent.      

Asymptotic analysis for loss probability of queues with finite <Emphasis Type="Italic">GI</Emphasis>/<Emphasis Type="Italic">M</Emphasis>/1 type structure

This paper discusses the asymptotic behavior of the loss probability for general queues with finite GI/M/1 type structure such as GI/M/c/K, SM/M/1/K and GI/MSP/1/K queues. We find an explicit expression for the asymptotic behavior of the loss probability as K tends to infinity. With the result, it is shown that the loss probability tends to 0 at a geometric rate. This research was supported by the MIC (Ministry of Information and Communication), Korea, under the ITRC (Information Technology Research Center) support program supervised by the IITA (Institute of Information Technology Assessment).     

Generalized (<Emphasis Type="Italic">F</Emphasis>,<Emphasis Type="Italic">ρ</Emphasis>)-Convexity and Duality in Nonsmooth Problems of Multiobjective Optimization

A mixed-type dual for a nonsmooth multiobjective optimization problem with inequality and equality constraints is formulated. We obtain weak and strong duality theorems for a mixed-type dual without requiring the regularity assumptions and the nonnegativeness of the Lagrange multipliers associated to the equality constraints. We apply also a nonsmooth constraint qualification for multiobjective programming to establish strong duality results. In this case, our constraint qualification assures the existence of positive Lagrange multipliers associated with the vector-valued objective function. This work was supported by Center of Excellence for Mathematics, University of Isfahan, Isfahan, Iran.     

<Emphasis Type="Italic">p</Emphasis>-Ideals in <Emphasis Type="Italic">p</Emphasis>-Regular Semirings

In this paper, we introduce p-ideals in semirings. A new form of regularity, which is compatible with p-ideals, is defined. Our aim is to explore the possibilities of establishing an ideal theory in semirings, going alongside the existing literature of semiring theory.AMS Subject Classification (2000): Primary 16Y60     

Properties of Restricted NCP Functions for Nonlinear Complementarity Problems

In this paper, we study restricted NCP functions which may be used to reformulate the nonlinear complementarity problem as a constrained minimization problem. In particular, we consider three classes of restricted NCP functions, two of them introduced by Solodov and the other proposed in this paper. We give conditions under which a minimization problem based on a restricted NCP function enjoys favorable properties, such as equivalence between a stationary point of the minimization problem and the nonlinear complementarity problem, strict complementarity at a solution of the minimization problem, and boundedness of the level sets of the objective function. We examine these properties for three restricted NCP functions and show that the merit function based on the restricted NCP function proposed in this paper enjoys favorable properties compared with those based on the other restricted NCP functions.