Generalized vector variational inequalities with star-pseudomonotone and discontinuous operators

It is well known that a vector variational inequality can be a very efficient model for use in studying vector optimization problems. By using the Ky Fan fixed point theorem and the scalarization method we will prove some existence theorems for strong solutions for generalized vector variational inequalities where discontinuous and star-pseudomonotone operators are involved. Our results can be applied to the study of the existence of solutions of vector optimal problems. Some examples are given and analyzed.     

Constructing uniform designs: A heuristic integer programming method

In this paper, the wrap-around _L2$L_2$-discrepancy (WD) of asymmetrical design is represented as a quadratic form, thus the problem of constructing a uniform design becomes a quadratic integer programming problem. By the theory of optimization, some theoretic properties are obtained. Algorithms for constructing uniform designs are then studied. When the number of runs n$n$ is smaller than the number of all level-combinations m$m$, the construction problem can be transferred to a zero–one quadratic integer programming problem, and an efficient algorithm based on the simulated annealing is proposed. When n≥m$n\ge m$, another algorithm is proposed. Empirical study shows that when n$n$ is large, the proposed algorithms can generate designs with lower WD compared to many existing methods. Moreover, these algorithms are suitable for constructing both symmetrical and asymmetrical designs.     

On convergence rates in approximation theory for operator semigroups

We create a new, functional calculus, approach to approximation formulas for _C0$C_0$-semigroups on Banach spaces restricted to the domains of fractional powers of their generators. This approach allows us to equip the approximation formulas with rates which appear to be optimal in a natural sense. In the case of analytic semigroups, we improve our general results obtaining better convergence rates which are optimal in that case too. The setting of analytic semigroups includes also the case of convergence on the whole space. As an illustration of our approach, we deduce optimal convergence rates in classical approximation formulas for _C0$C_0$-semigroups restricted to the domains of fractional powers of their generators.     

Hypergroups and invariant complemented subspaces

Let K   be a hypergroup with a Haar measure. The purpose of the present paper is to initiate a systematic approach to the study of the class of invariant complemented subspaces of _L∞(K)$L_{\infty }(K)$ and _C0(K)$C_0(K)$, the class of left translation invariant w^?$w^{?}$-subalgebras of _L∞(K)$L_{\infty }(K)$ and finally the class of non-zero left translation invariant C^?$C^{?}$-subalgebras of _C0(K)$C_0(K)$ in the hypergroup context with the goal of finding some relations between these function spaces. Among other results, we construct two correspondences: one, between closed Weil subhypergroups and certain left translation invariant w^?$w^{?}$-subalgebras of _L∞(K)$L_{\infty }(K)$, and another, between compact subhypergroups and a specific subclass of the class of left translation invariant C^?$C^{?}$-subalgebras of _C0(K)$C_0(K)$. By the help of these two characterizations, we extract some results about invariant complemented subspaces of _L∞(K)$L_{\infty }(K)$ and _C0(K)$C_0(K)$.     

Necessary and sufficient condition for uniqueness of solution to the first boundary value problem for the diffusion equation in unbounded domains

This paper introduces a notion of regularity of t=-∞$t=-\infty$ for the diffusion (or heat) equation and establishes a necessary and sufficient condition for the existence of a unique bounded solution to the first boundary value problem for the diffusion equation in a general domain Ω⊂R^N+1$\Omega \subset {\mathbb{R}}^{N+1}$ which extends up to t=-∞$t=-\infty$.     

Stability analysis of a complex standby system with constant waiting and different repairman criteria incorporating environmental failure

In this paper we investigate the solution of a complex standby system with constant waiting and different repairman criteria incorporating environmental failure. By using the method of functional analysis, especially, the _C0$C_0$ semigroup theory of bounded linear operators on Banach space, we prove the well-posedness and the existence of positive solution of the system. Under some appropriate hypothesis, we prove that the dynamic solution of the system converges its steady state in a stronger sense.     

Existence and regularity of solutions for some partial functional integrodifferential equations in Banach spaces

In this work, we study the existence and regularity of solutions for some partial functional integrodifferential equations in Banach spaces. We suppose that the undelayed part admits a resolvent operator in the sense given by Grimmer in [R. Grimmer, Resolvent operators for integral equations in a Banach space, Transaction of American Mathematical Society 273 (1982) 333–349]. The delayed part is assumed to be locally Lipschitz. Firstly, we show the existence of the mild solutions. Secondly, we give sufficient conditions ensuring the existence of the strict solutions.     

A new method for computing Moore–Penrose inverse matrices

The Moore–Penrose inverse of an arbitrary matrix (including singular and rectangular) has many applications in statistics, prediction theory, control system analysis, curve fitting and numerical analysis. In this paper, an algorithm based on the conjugate Gram–Schmidt process and the Moore–Penrose inverse of partitioned matrices is proposed for computing the pseudoinverse of an m×n$m\times n$ real matrix A$A$ with m≥n$m\ge n$ and rank r≤n$r\le n$. Numerical experiments show that the resulting pseudoinverse matrix is reasonably accurate and its computation time is significantly less than that of pseudoinverses obtained by the other methods for large sparse matrices.     

A variant smoothing Newton method for P0-NCP based on a new smoothing function

In this paper, we present a new one-step smoothing Newton method proposed for solving the non-linear complementarity problem with _P0$P_0$-function based on a new smoothing NCP$NCP$-function. We adopt a variant merit function. Our algorithm needs only to solve one linear system of equations and perform one line search per iteration. It shows that any accumulation point of the iteration sequence generated by our algorithm is a solution of _P0-NCP$P_0\text{-}NCP$. Furthermore, under the assumption that the solution set is non-empty and bounded, we can guarantee at least one accumulation point of the generated sequence. Numerical experiments show the feasibility and efficiency of the algorithm.     

Stable categories of higher preprojective algebras

We introduce (n+1)$(n+1)$-preprojective algebras of algebras of global dimension n$n$. We show that if an algebra is n$n$-representation-finite then its (n+1)$(n+1)$-preprojective algebra is self-injective. In this situation, we show that the stable module category of the (n+1)$(n+1)$-preprojective algebra is (n+1)$(n+1)$-Calabi–Yau, and, more precisely, it is the (n+1)$(n+1)$-Amiot cluster category of the stable n$n$-Auslander algebra of the original algebra. In particular this stable category contains an (n+1)$(n+1)$-cluster tilting object. We show that even if the (n+1)$(n+1)$-preprojective algebra is not self-injective, under certain assumptions (which are always satisfied for n∈{1,2}$n\in \{1,2\}$) the results above still hold for the stable category of Cohen–Macaulay modules.     

Rao’s statistic for constant and proportional hazard models

In this paper we introduce a new family of measures of divergence for the analysis of the degree of departure from a model with a constant hazard function and also for comparing if two models have proportional hazard rates. Our family of measures is based on the family of divergences introduced by Burbea and Rao (see [J. Burbea, C.R. Rao, On the convexity of higher order Jensen differences based on entropy functions, IEEE Transactions on Information Theory 28 (1982) 961–963]). Some well-known sets of data are reanalyzed using the new families of test statistics and confidence intervals introduced in this paper.     

Capability adjustment for gamma processes with mean shift consideration in implementing Six Sigma program

In the 1980s, Motorola, Inc. introduced its Six Sigma quality program to the world. Some quality practitioners questioned why the Six Sigma advocates claim it is necessary to add a 1.5σ shift to the process mean when estimating process capability. Bothe [Bothe, D.R., 2002. Statistical reason for the 1.5σ shift. Quality Engineering 14 (3), 479–487] provided a statistical reason for considering such a shift in the process mean for normal processes. In this paper, we consider gamma processes which cover a wide class of applications. For fixed sample size n, the detection power of the control chart can be computed. For small process mean shifts, it is beyond the control chart detection power, which results in overestimating process capability. To resolve the problem, we first examine Bothe’s approach and find the detection power is less than 0.5 when data comes from gamma distribution, showing that Bothe’s adjustments are inadequate when we have gamma processes. We then calculate adjustments under various sample sizes n and gamma parameter N, with power fixed to 0.5. At the end, we adjust the formula of process capability to accommodate those shifts which can not be detected. Consequently, our adjustments provide much more accurate capability calculation for gamma processes. For illustration purpose, an application example is presented.     

Second-order multiobjective symmetric duality with cone constraints

In this paper, we formulate Wolfe and Mond–Weir type second-order multiobjective symmetric dual problems over arbitrary cones. Weak, strong and converse duality theorems are established under η$\eta$-bonvexity/η$\eta$-pseudobonvexity assumptions. This work also removes several omissions in definitions, models and proofs for Wolfe type problems studied in Mishra [9]. Moreover, self-duality theorems for these pairs are obtained assuming the function involved to be skew symmetric.     

Labeling constructions using digraph products

In this paper we study the edge-magicness of graphs with equal size and order, and we use such graphs and digraph products in order to construct labelings of different classes and of different graphs. We also study super edge-magic labelings of 2$2$-regular graphs with exactly two components and their implications to other labelings.     

Remarks on a posteriori error estimation for finite element solutions

We utilize the classical hypercircle method and the lowest-order Raviart–Thomas H(div)$H(\mathrm{div})$ element to obtain a posteriori error estimates of the _P1$P_1$ finite element solutions for 2D Poisson's equation. A few other estimation methods are also discussed for comparison. We give some theoretical and numerical results to see the effectiveness of the methods.     

Infinite loop spaces,and coherence for symmetric monoidal bicategories

This paper proves three different coherence theorems for symmetric monoidal bicategories. First, we show that in a free symmetric monoidal bicategory every diagram of 2-cells commutes. Second, we show that this implies that the free symmetric monoidal bicategory on one object is equivalent, as a symmetric monoidal bicategory, to the discrete symmetric monoidal bicategory given by the disjoint union of the symmetric groups. Third, we show that every symmetric monoidal bicategory is equivalent to a strict one.