On Convergence of the Simplicial Branch-and-Bound Algorithm Based on ω-Subdivisions

The problem of minimizing a concave function over a polytope is considered. The simplicial branch-and-bound approach is presented and theoretical studies about the convergence of these algorithms are carried on. In particular, the convergence of the algorithm based on so-called -subdivisions is proved, which had been an open question for a long time.     

M/G/∞ with alternating renewal breakdowns

We consider an M/G/ queue where the service station is subject to occasional interruptions which form an alternating renewal process ofup anddown periods. We show that under some natural conditions the random measure process associated with the residual service times of the customers is regenerative in the strict sense, and study its steady state characteristics. In particular we show that the steady state distribution of this random measure is a convolution of two distributions of (independent) random measures, one of which is associated with a standard M/G/ queue.     

Relative E ‐Theory

The Etheory of A. Connes and N. Higson provides a new realization of Khomology based on the notion of asymptotic morphisms. In this paper we define relative Etheory, associating to a C*algebra A and an ideal I the Abelian groups Enrel(A;I). These groups are related to the Etheory groups of A and I in the familiar way by a long exact sequence and excision isomorphisms. The definition of relative Etheory is motivated by the properties of first order, elliptic differential operators on complete Riemannian manifolds. Applications will be considered in a future publication.     

Parallel Algorithms for Solving the Convex Minimum Cost Flow Problem

In this paper we deal with the solution of the separable convex cost network flow problem. In particular, we propose a parallel asynchronous version of the -relaxation method and we prove theoretically its correctness.We present two implementations of the parallel method for a shared memory multiprocessor system, and we empirically analyze their numerical performance on different test problems. The preliminary numerical results show a good reduction of the execution time of the parallel algorithm with the respect to the sequential counterpart.     

(φ,ξ,η,λ)‐Structures of Parabolic Type

We consider (,,,)structures of parabolic type on hypersurfaces of dual spaces and study the rank of the affinor . We consider almost contact metric structures of parabolic type of the first kind on hypersurfaces of 4dimensional dual metric space. We study the properties of these structures and give examples of normal, integrable, and Sasakian parabolic structures.     

A Note on π-Engel Conditions

In this paper we show that the weakly -Engel conditions are closely related to the existance of normal -complements; while the -Engel conditions are closely related to the -nilpotent groups.AMS Subject Classification (2000): 20D20     

Generalizations of Perfect, Semiperfect, and Semiregular Rings

For a ring R and a right R-module M, a submodule N of M is said to be -small in M if, whenever N + X = M with M/X singular, we have X = M. If there exists an epimorphism p: P M such that P is projective and Ker(p) is -small in P, then we say that P is a projective -cover of M. A ring R is called -perfect (resp., -semiperfect, -semiregular) if every R-module (resp., simple R-module, cyclically presented R-module) has a projective -cover. The class of all -perfect (resp., -semiperfect, -semiregular) rings contains properly the class of all right perfect (resp., semiperfect, semiregular) rings. This paper is devoted to various properties and characterizations of -perfect, -semiperfect, and -semiregular rings. We define (R) by (R)/Soc(R_R) = Jac(R/Soc(R_R)) and show, among others, the following results:

Position and Height of the Global Maximum of a Twice Differentiable Stochastic Process

For a stochastic process with absolutely continuous sample path derivative, a formula for the joint density of (T, Z), the position and height of the global maximum of in a closed interval, is given. The formula is derived using the generalized Rices formula. The presented result can be applied both to stationary and non-stationary processes under mild assumptions on the process. The formula for the density is explicit but involves integrals that have to be computed using numerical integration. The computation of the density is discussed and some numerical examples are given.     

On the Operator Semirings of a Γ-Semiring

In this paper we introduce the notion of operator semirings of a -semiring to study -semirings. It is shown that the lattices of all left (right) ideals (two-sided ideals) of a -semiring and its right (respectively left) operator semiring are isomorphic. This has many applications to characterize various -semirings.AMS Subject Classification (2000): 16Y60, 16Y99     

Hulls for Various Kinds of α-Completeness in Archimedean Lattice-Ordered Groups

Within Archimedean -groups, and with an infinite cardinal or , we consider X-hulls where X stands for any of the following classes of -groups: -projectable; laterally -complete; boundedly laterally -complete; conditionally -complete; combinations of the preceding, together with divisibility and/or relative uniform completeness. All these hulls exist, and may be obtained by iterated adjunction of the required extra elements, within the essential hull. When the -groups is relatively -complemented one step in the iteration suffices for several crucial properties. We derive from the above a considerable number of equations involving combinations of these hull operators.     

On the a.s. Cesàro-α convergence for stationary or orthogonal random variables

We give a new direct proof of the a.s. convergence of the Cesàro- means of a stationary process (X _n) when 0<<1 andE(X _n ^p )<+ with p>1 and we show that this result does not hold in general for p=1. We also consider similar questions for orthogonal random variables. Finally, we study the a.s. convergence of Riesz harmonic means.     

A Property of the Ansatz of Hirota's Method for Quasilinear Parabolic Equations

By using the recently discovered new invariant properties of the ansatz of R. Hirota's method, we prove that the classes of linear fractional solutions to some nonlinear equations are closed. This allows us to construct new solutions for a chosen class of dissipative equations. This algorithm is similar to the method of dressing the solutions of integrable equations. The equations thus obtained imply a compatibility condition and are known as a nonlinear Lax pair with variable coefficients. So we propose a method for constructing such pairs. To construct solutions of a more complicated form, we propose to use the property of zero denominators and factorized brackets, which has been discovered experimentally. The expressions thus constructed are said to be quasi-invariant. They allow us to find true relations between the functions contained in the ansatz, to correct the ansatz, and to construct a solution. We present some examples of new solutions constructed following this approach. Such solutions can be used for majorizing in comparison theorems and for modeling phase processes and process in neurocomputers. A program for computing solutions by methods of computer algebra is written. These techniques supplement the classical methods for constructing solutions by using their group properties.     

Controllability and extremality in nonconvex differential inclusions

LetF:[0, T]×R ⁿ 2 ^{R n} be a set-valued map with compact values; let :R ⁿ R ^m be a locally Lipschitzian map,z(t) a given trajectory, andR the reachable set atT of the differential inclusion . We prove sufficient conditions for (z(T))intR and establish necessary conditions in maximum principle form for (z(T))(R). As a consequence of these results, we show that every boundary trajectory is simultaneously a Pontryagin extremal, Lagrangian extremal, and relaxed Lagrangian extremal.The author is grateful to an anonymous referee for his valuable remarks and comments which have helped to improve the paper.The paper was written while the author was visiting the laboratory of Prof. S. Suzuki, Department of Mechanical Engineering, Sophia University, Tokyo, Japan.     

Study of Noetherian Γ-Semirings via Operator Semirings

In this paper we study Noetherian -semirings and obtain Cohens theorem for a special class of -semirings. Weak primary decomposition theorem for a particular type of -semirings is also obtained.Presently Lecturer in Mathematics, University of Burdwan, GOLAPBAG, W.B. INDIA.     

On the Completeness and Decidability of the Horn‐Like Fragment of the First‐Order Linear Temporal Logic

We prove the completeness and decidability of the Hornlike sequents, specifically, the socalled D₂sequents (of the firstorder linear temporal logic) considered in the author's paper [Lith. Math. J., 41(3), 266–281 (2001)]. In this paper, with the help of the infinitary calculus G_L, grounded by the author in his earlier papers, for D₂sequents we construct a D₂Sat calculus of the socalled saturated type consisting of decidable deductive procedures replacing the omegarule for the always operator. In the present paper, in order to prove the completeness and decidability of the calculus D₂Sat, we construct the socalled invariant decidable calculus D₂IN. We prove the equivalence of the calculi D₂IN, D₂Sat, and G _L ^** for the socalled saturated D₂sequents. From this equivalence, by reducing an arbitrary D₂sequent to a saturated D₂sequent, and also from the completeness of the G _L ^** calculus and decidability of the invariant calculus D₂IN, we deduce the completeness and decidability of the calculus D₂Sat in the class of D₂sequents.     

Almost π-Lattices

In this paper we establish some conditions for an almost -domain to be a -domain. Next -lattices satisfying the union condition on primes are characterized. Using these results, some new characterizations are given for -rings.     

The Newton modified barrier method for QP problems

The Modified Barrier Functions (MBF) have elements of both Classical Lagrangians (CL) and Classical Barrier Functions (CBF). The MBF methods find an unconstrained minimizer of some smooth barrier function in primal space and then update the Lagrange multipliers, while the barrier parameter either remains fixed or can be updated at each step. The numerical realization of the MBF method leads to the Newton MBF method, where the primal minimizer is found by using Newton's method. This minimizer is then used to update the Lagrange multipliers. In this paper, we examine the Newton MBF method for the Quadratic Programming (QP) problem. It will be shown that under standard second-order optimality conditions, there is a ball around the primal solution and a cut cone in the dual space such that for a set of Lagrange multipliers in this cut cone, the method converges quadratically to the primal minimizer from any point in the aforementioned ball, and continues, to do so after each Lagrange multiplier update. The Lagrange multipliers remain within the cut cone and converge linearly to their optimal values. Any point in this ball will be called a hot start. Starting at such a hot start, at mostO(In In ^-1) Newton steps are sufficient to perform the primal minimization which is necessary for the Lagrange multiplier update. Here, >0 is the desired accuracy. Because of the linear convergence of the Lagrange multipliers, this means that onlyO(In ^-1)O(In In ^-1) Newton steps are required to reach an -approximation to the solution from any hot start. In order to reach the hot start, one has to perform Newton steps, wherem characterizes the size of the problem andC>0 is the condition number of the QP problem. This condition number will be characterized explicitly in terms of key parameters of the QP problem, which in turn depend on the input data and the size of the problem.Partially supported by NASA Grant NAG3-1397 and National Science Foundation Grant DMS-9403218.     

A value iteration method for undiscounted multichain Markov decision processes

This paper proposes a value iteration method which finds an-optimal policy of an undiscounted multichain Markov decision process in a finite number of iterations. The undiscounted multichain Markov decision process is reduced to an aggregated Markov decision process, which utilizes maximal gains of undiscounted Markov decision sub-processes and is formulated as an optimal stopping problem. As a preliminary, sufficient conditions are presented under which a policy is-optimal.

---

Zusammenfassung In dieser Arbeit wird eine Wertiterationsmethode vorgeschlagen, die eine-optimale Politik für einen undiskontierten nicht-irreduziblen Markovschen Entscheidungsprozeß (MEP) in endlichen vielen Schritten liefert. Der undiskontierte nicht-irreduzible MEP wird auf einen aggregierten MEP reduziert, der maximale Gewinn eines undiskontierten Sub-MEP verwendet und als optimales Stopp-Problem formuliert wird. Zu Beginn werden hinreichende Bedingungen für die-Optimalität einer Politik angegeben.

     

On Generalizations of Ostrowski Inequality and Some Related Results

Some generalizations of the Ostrowski inequality, the Milovanovi-Peari-Fink inequality, the Dragomir-Agarwal inequality and the Hadamard inequality are given.     

Topological existence and stability for stackelberg problems

The aim of this paper is to study, in a topological framework, existence and stability for the solutions to a parametrized Stackelberg problem. To this end, approximate solutions are used, more precisely, -solutions and strict -solutions. The results given are of minimal character and the standard types of constraints are considered, that is, constant constraints, constraints defined by a finite number of inequalities, and more generally constraints defined by an arbitrary multifunction.