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 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.     

<Emphasis Type="Italic">I</Emphasis> and <Emphasis Type="Italic">I</Emphasis>*-convergence of double sequences

The idea of I-convergence was introduced by Kostyrko et al (2001) and also independently by Nuray and Ruckle (2000) (who called it generalized statistical convergence) as a generalization of statistical convergence (Fast (1951), Schoenberg(1959)). For the last few years, study of these convergences of sequences has become one of the most active areas of research in classical Analysis. In 2003 Muresaleen and Edely introduced the concept of statistical convergence of double sequences. In this paper we consider the notions of I and I*-convergence of double sequences in real line as well as in general metric spaces. We primarily study the inter-relationship between these two types of convergence and then investigate the category and porosity position of bounded I and I*-convergent double sequences. This work is funded by Council of Scientific and Industrial Research, HRDG, India.     

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.     

<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)     

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">f</Emphasis>-Colorings of some graphs of <Emphasis Type="Italic">f</Emphasis>-class 1

An f-coloring of a graph G is an edge-coloring of G such that each color appears at each vertex v V（G） at most f（v） times. The minimum number of colors needed to f-color G is called the f-chromatic index of G and is denoted by X′f（G）. Any simple graph G has the f-chromatic index equal to △f（G） or △f（G） ＋ 1, where △f（G） =max v V（G）{[d（v）/f（v）]}. If X′f（G） = △f（G）, then G is of f-class 1; otherwise G is of f-class 2. In this paper, a class of graphs of f-class 1 are obtained by a constructive proof. As a result, f-colorings of these graphs with △f（G） colors are given.     

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.      

On potentially K 5-H-graphic sequences

Let K _m -H be the graph obtained from K _m by removing the edges set E(H) of H where H is a subgraph of K _m . In this paper, we characterize the potentially K ₅-P ₄ and K ₅-Y ₄-graphic sequences where Y ₄ is a tree on 5 vertices and 3 leaves. Research was supported by NNSF of China (10271105) and by NSF of Fujian (Z0511034), Fujian Provincial Training Foundation for “Bai-Quan-Wan Talents Engineering”, Project of Fujian Education Department, Project of Zhangzhou Teachers College and by NSERC.     

On <Emphasis Type="Italic">k</Emphasis>-pairable graphs from trees

The concept of the k-pairable graphs was introduced by Zhibo Chen (On k-pairable graphs, Discrete Mathematics 287 (2004), 11–15) as an extension of hypercubes and graphs with an antipodal isomorphism. In the same paper, Chen also introduced a new graph parameter p(G), called the pair length of a graph G, as the maximum k such that G is k-pairable and p(G) = 0 if G is not k-pairable for any positive integer k. In this paper, we answer the two open questions raised by Chen in the case that the graphs involved are restricted to be trees. That is, we characterize the trees G with p(G) = 1 and prove that p(G □ H) = p(G) + p(H) when both G and H are trees.     

<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.      

<Emphasis Type="Italic">k</Emphasis>-factors in regular graphs

Plesnik in 1972 proved that an （m - 1）-edge connected m-regular graph of even order has a 1-factor containing any given edge and has another 1-factor excluding any given m - 1 edges. Alder et al. in 1999 showed that if G is a regular （2n ＋ 1）-edge-connected bipartite graph, then G has a 1-factor containing any given edge and excluding any given matching of size n. In this paper we obtain some sufficient conditions related to the edge-connectivity for an n-regular graph to have a k-factor containing a set of edges and （or） excluding a set of edges, where 1 ≤ k ≤n/2. In particular, we generalize Plesnik＇s result and the results obtained by Liu et al. in 1998, and improve Katerinis＇ result obtained 1993. Furthermore, we show that the results in this paper are the best possible.     

<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     

An <Emphasis Type="Italic">ω</Emphasis>-category with all Duals is an <Emphasis Type="Italic">ω</Emphasis>-groupoid

We make a definition of ω-precategory which should underlie any definition of weak ω-category. We make a precise definition of pseudo-invertible cells in this setting. We show that in an ω-precategory with all weak duals, every cell is pseudo-invertible. We deduce that in any “sensible” theory of ω-categories, an ω-category with all weak duals is an ω-groupoid. We discuss various examples and open questions involving higher-dimensional tangles and cobordisms.      

On the stability of <Emphasis Type="Italic">θ</Emphasis>-derivations on <Emphasis Type="Italic">JB</Emphasis>*-triples

We introduce the concept of θ-derivations on JB*-triples and prove the Hyers–Ulam-Rassias stability of θ-derivations on JB*-triples. We deal with the Hyers-Ulam-Rassias stability that was first introduced by Th. M. Rassias in the paper “On the stability of the linear mapping in Banach spaces, Proc. Amer. Math. Soc. 72 (1978), 297–300”. The first author was supported by Korea Research Foundation Grant KRF-2005-070-C00009.     

Monadic <Emphasis Type="Italic">GMV</Emphasis>-algebras

Monadic MV-algebras are an algebraic model of the predicate calculus of the Łukasiewicz infinite valued logic in which only a single individual variable occurs. GMV-algebras are a non-commutative generalization of MV-algebras and are an algebraic counterpart of the non-commutative Łukasiewicz infinite valued logic. We introduce monadic GMV-algebras and describe their connections to certain couples of GMV-algebras and to left adjoint mappings of canonical embeddings of GMV-algebras. Furthermore, functional MGMV-algebras are studied and polyadic GMV-algebras are introduced and discussed. The first author was supported by the Council of Czech Government, MSM 6198959214.