Radial DEA models without inputs or without outputs

In this paper we consider radial DEA models without inputs (or without outputs), and radial DEA models with a single constant input (or with a single constant output). We demonstrate that (i) a CCR model without inputs (or without outputs) is meaningless; (ii) a CCR model with a single constant input (or with a single constant output) coincides with the corresponding BCC model; (iii) a BCC model with a single constant input (or a single constant output) collapses to a BCC model without inputs (or without outputs); and (iv) all BCC models, including those without inputs (or without outputs), can be condensed to models having one less variable (the radial efficiency score) and one less constraint (the convexity constraint).     

The structure of graph maps without periodic points

In this paper we show that any graph map without periodic points has only one minimal set. We describe a class of graph maps without periodic points. Our main result is to give a structure theorem of graph maps without periodic points, which states that any graph map without periodic points must be topologically conjugate to one of the described class. In addition, we give some applications of the structure theorem.     

Limit distributions for generalized Jiřina processes with immigration

A relationship between continuous state population-size-dependent branching (CSDB) processes with or without immigration and discrete state population-size-dependent branching (DSDB) processes with or without immigration is established via the representation of the former. Based on this relationship, some limiting distributions of CSDB processes with or without immigration are obtained.     

A sufficient condition on 3-colorable plane graphs without 5- and 6-circuits

In 2003, Borodin and Raspaud proved that if G is a plane graph without 5-circuits and without triangles of distance less than four, then G is 3-colorable. In this paper, we prove that if G is a plane graph without 5- and 6-circuits and without triangles of distance less than 2, then G is 3-colorable.     

Acyclic 4-coloring of planar graphs without 4- and 5-cycles

Every planar graph is known to be acyclically 5-colorable (O.V.Borodin, 1976). Some sufficient conditions are also obtained for a planar graph to be acyclically 4- and 3-colorable. In particular, the acyclic 4-colorability was proved for the following planar graphs: without 3- and 4-cycles (O.V.Borodin, A.V. Kostochka, and D.R.Woodall, 1999), without 4-, 5-, and 6-cycles, or without 4-, 5-, and 7-cycles, or without 4-, 5-, and intersecting 3-cycles (M. Montassier, A.Raspaud andW.Wang, 2006), and without 4-, 5-, and 8-cycles (M. Chen and A.Raspaud, 2009). The purpose of this paper is to prove that each planar graph without 4- and 5-cycles is acyclically 4-colorable.     

On the composition factors of indecomposable modules in almost cyclic coherent Auslander-Reiten components

We prove that the indecomposable modules without selfextensions in generalized standard almost cyclic coherent Auslander-Reiten components without external short paths of artin algebra are uniquely determined by their composition factors. Moreover, we prove that there is a common bound on the numbers of indecomposable modules with the same composition factors lying in a generalized standard almost cyclic coherent Auslander-Reiten component without external short paths of artin algebra.     

On elementary calculus and the good formula

In the theory of combinatorial generating functions one can use the differential calculus without limits, and almost without limit.     

Squeezing the most out of eigenvalue solvers on high-performance computers

This paper describes modifications to many of the standard algorithms used in computing eigenvalues and eigenvectors of matrices. These modifications can dramatically increase the performance of the underlying software on high-performance computers without resorting to assembler language, without significantly influencing the floating-point operation count, and without affecting the roundoff-error properties of the algorithms. The techniques are applied to a wide variety of algorithms and are beneficial in various architectural settings.     

The Stabilizing Effect of Surface Tension on the Development of the Free Boundary in a Planar, One-dimensional, Cauchy-Stefan Problem

A generalized Stefan problem which includes surface tensionis presented as a mathematical model for the growth and meltingof a solid. It is shown that planar melting is linearly morphologicallystable with or without surface tension, while planar solidificationis unstable without surface tension and is stabilized with itsinclusion. The technique used is an adaptation to this situationof Rubinstein's recent work on the one-dimensional, two-phaseproblem without surface tension.     

A simple method to compute economic order quantities

In this note, a simple method by using the arithmetic–geometric-mean-inequality theorem is proposed to computer the global minimum economic order quantities without taking complex differential calculus or using tedious algebraic manipulations. In contrast to (Minner, S., 2007. A note on how to compute economic order quantity without derivatives by cost comparisons. International Journal of Production Economics 105, 293–296; Wee, H.M., Wang, W.T., Chung, C.J., 2009. A modified method to computer economic order quantities without derivatives by cost-difference comparisons. European Journal of Operational Research) based on a local cost minimum initially to derive the solution and then proven it’s the global minimum, the proposed method yields the global minimum cost immediately and explicitly without using the cost comparisons and letting the time horizon to infinity.     

Stability and chaos control of regularized Prabhakar fractional dynamical systems without and with delay

In this paper, we studied the stabilization of nonlinear regularized Prabhakar fractional dynamical systems without and with time delay. We establish a Lyapunov stabiliy theorem for these systems and study the asymptotic stability of these systems without design a positive definite function V (without considering the fractional derivative of function V is negative). We design a linear feedback controller to control and stabilize the nonautonomous and autonomous chaotic regularized Prabhakar fractional dynamical systems without and with time delay. By means of the Lyapunov stability, we obtain the control parameters for these type of systems. We further present a numerical method to solve and analyze regularized Prabhakar fractional systems. Furthermore, by employing numerical simulation, we reveal chaotic attractors and asymptotic stability behaviors for four systems to illustrate the presented theorem.     

仅有局部单位元环上的范畴对偶

［１］讨论了在无单位元环上的范畴等价，本文讨论无单位无环上的范畴对偶。     

Nonanticipativity in stochastic programming

The paper gives strong duality results in multistage stochastic programming without assuming compactness and without applying induction arguments.     

平面图3色可染的一个充分条件

Steinberg猜想既没有4-圈又没有5-圈的平面图是3色可染的. Xu, Borodin等人各自独立地证明了既没有相邻三角形又没有5-和7-圈的平面图是3 色可染的. 作为这一结果的推论, 没有4-, 5-和7-圈的平面图是3色可染的. 本文证明一个比此推论更接近Steinberg猜想的结果, 设G是一个既没有4-圈又没有5-圈的平面图, 若对每一个k∈{3, 6, 7}, G都不含(k, 7)-弦, 则G是3色可染的, 这里的(k, 7)-弦是指长度为7+k-2的圈的一条弦, 它的两个端点将圈分成两条路, 一条路的长度为6, 另一条路的长度为k-1.     

On 4-connected 4-regular graphs without even cycle decompositions

An even cycle decomposition of a graph is a partition of its edges into even cycles. Markström constructed infinitely many 2-connected 4-regular graphs without even cycle decompositions. Má?ajová and Mazák then constructed an infinite family of 3-connected 4-regular graphs without even cycle decompositions. In this note, we further show that there exists an infinite family of 4-connected 4-regular graphs without even cycle decompositions.     

Moral responsibility—What is all the fuss about?

Examination of several accounts regarding the nature of moral responsibility allows the extraction of a conceptual core common to all of them. Relying on that core conception of moral responsibility, the paper explores what human life without moral responsibility would be like. That exploration establishes that many robust forms of human relationship and nonmoral normativity could continue, absent moral responsibility, even if moral responsibility were abandoned on incompatibilist grounds. Much more importantly, it also establishes, contra Waller and Pereboom, that only some forms of morality—so-called “behavioral” forms—remain possible without moral responsibility. The paper argues that normative moral approaches that take into account agent intentions in order to assess the moral status of action cannot be applied without moral responsibility of agents. Thus, morality without responsibility needs to be behavioral, not consequentialist, as has often been thought.     

不具有与具有卖空限制的证券选择理论(英文)

本文讨论不具有与具有卖空限制的证券选择理论．不具有卖空限制的证券选择问题作为规划问题用Lagrange数法求解．这个问题可以推广到具有卖空限制情形．用Kuhn－Tucker条件求解．     

完备Riemann流形之共轭点

本文证明了具非负曲率完备Ｒｉｅｍａｎｎ测地线为无共轭点测地线的充要条件；并由此证明了若该流形上的截面含有一无共轭点测地线的切向量，则其对应的截曲率为零．     

Identities and inequalities for the $$M_2$$ M 2 -rank of partitions without repeated odd parts modulo 8

The Ramanujan Journal - In 2002, Berkovich and Garvan introduced the $$M_2$$ -rank of partitions without repeated odd parts. Let $$N_2(a, M, n)$$ denote the number of partitions of n without...     

Attractors for differential equations with unbounded delays

We prove the existence of attractors for some types of differential problems containing infinite delays. Applications and examples are provided to illustrate the theory, which is valid for both cases with and without explicit dependence of time, and with or without uniqueness of solutions, as well.