EXISTENCE AND MOMENT ESTIMATES FOR SOLUTIONS TO NEUTRAL STOCHASTIC FUNCTIONAL DIFFERENTIAL EQUATIONS

In this paper, we show the existence and uniqueness of solutions to a large class of SFDEs with the generalized local Lipschitzian coefficients. Some moment estima- tes of the solutions are given by establishing new Ito operator inequalities based on the Razumikhin technique. These estimates improve, extend and unify some related results including exponential stability of Mao （1997） [20], decay stability of Wu et al. （2010,2011） [32,33], Pavlovic et al. （2012） [24], asymptotic behavior of Luo et al. （2011） [18] and Song et al. （2013） [26]. Moreover, stochastic version of Wintner theorem in continuous space is established by the comparison principle, which improve and extend the main results of Xu et al. （2008 [39], 2013 [36]）. When the methods presented are applied to the SFDEs with impulses and SFDEs in Hilbert spaces, we extend the related results of Govindana et al. （2013） [7], Liu et al. （2007） [15], Vinod- kumar （2010） [29] and Xu et al. （2012） [35]. Two examples are provided to illustrate the effectiveness of our results.     

关于两两NQD随机变量部分和强大数律的注记

In this paper, the authors study the strong law of large numbers for partial sums of pairwise negatively quadrant dependent （NQD） random variables. The results obtained improve the corresponding theorems of Hu et al. （2013）, and Qiu and Yang （2006） under some weaker conditions.     

TESTING OF CORRELATION AND HETEROSCEDASTICITY IN NONLINEAR REGRESSION MODELS WITH DBL（p,q, 1） RANDOM ERRORS

Chaos theory has taught us that a system which has both nonlinearity and random input will most likely produce irregular data. If random errors are irregular data, then random error process will raise nonlinearity （Kantz and Schreiber （1997））. Tsai （1986） introduced a composite test for autocorrelation and heteroscedasticity in linear models with AR（1） errors. Liu （2003） introduced a composite test for correlation and heteroscedasticity in nonlinear models with DBL（p, 0, 1） errors. Therefore, the important problems in regression model axe detections of bilinearity, correlation and heteroscedasticity. In this article, the authors discuss more general case of nonlinear models with DBL（p, q, 1） random errors by score test. Several statistics for the test of bilinearity, correlation, and heteroscedasticity are obtained, and expressed in simple matrix formulas. The results of regression models with linear errors are extended to those with bilinear errors. The simulation study is carried out to investigate the powers of the test statistics. All results of this article extend and develop results of Tsai （1986）, Wei, et al （1995）, and Liu, et al （2003）.     

非线性刚性变延迟微分方程单支方法的D-收敛性

This paper is concerned with the error analysis of one-leg methods when applied to nonlinear stiff Delay Differential Equations(DDEs) with a variable delay. It is proved that a one-leg method with Lagrangian linear interpolation procedure is D-convergent of oder p if and only if it is A-stable and consistent of order p in the classical sense for ODEs. The results obtained can be regarded as extension of that for DDEs with constant delay presented by Huang Chenming et al. in 2001     

Complete Convergence for Randomly Weighted Sums of Random Variables Satisfying Some Moment Inequalities

For random variables and random weights satisfying Marcinkiewicz-Zygmund and Rosenthal type moment inequalities, we establish complete convergence results for randomly weighted sums of the random variables. Our results generalize those of(Thanh et al. SIAM J. Control Optim., 49,106–124(2011), Han and Xiang J. Ineq. Appl., 2016, 313(2016), Li et al. J. Ineq. Appl., 2017, 182(2017), and Wang et al. Statistics, 52, 503–518(2018).)     

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

GENERALIZED FRACTIONAL CALCULUS OF THE ALEPH-FUNCTION INVOLVING A GENERAL CLASS OF POLYNOMIALS

The object of this article is to study and develop the generalized fractional calculus operators given by Saigo and Maeda in 1996. We establish generalized fractional calculus formulas involving the product of ■-function, Appell functionF3 and a general class of polynomials. The results obtained provide unification and extension of the results given by Saxena et al. [13], Srivastava and Grag [17], Srivastava et al. [20], and etc. The results are obtained in compact form and are useful in preparing some tables of operators of fractional calculus.On account of the general nature of the Saigo-Maeda operators, ■-function, and a general class of polynomials a large number of new and known results involving Saigo fractional calculus operators and several special functions notablyH-function,I-function, Mittag-Leffler function, generalized Wright hypergeometric function, generalized Bessel-Maitland function follow as special cases of our main findings.     

Further Extension of a Theorem of Values Distribution of Meromorphic Function f^（k）f^n

In this paper we derive the fundamental inequality of the theorem of meromorphic functions. It extends some results of Yi Hong-xun et al. As one of its application, we then study the value distribution of f^（k）f^n-c（z）.     

Weak convergence theorem for Lipschizian pseudocontraction semigroups in Banach spaces

The purpose of this paper is to study the weak convergence problems of the irnplicity iteration process for Lipschitzian pseudocontraction semigroups in general Banach spaces. The results presented in this paper extend and improve the corresponding results of Zhou [Nonlinear Anal., 68, 2977-2983 （2008）], Chen, et ah [J. Math. Anal. Appl., 314, 701 709 （2006）], Xu and Ori [Numer. Funct. Anal. Optim, 22, 767-773 （2001）] and Osilike [J. Math. Anal. Appl., 294, 73-81 （2004）]. Keywords     

Generalized Derivations with Skew Nilpotent Values on Lie Ideals

This article gives characterizations of generalized derivations with skew nilpotent values on noncommutative Lie ideals of a prime ring. The results simultaneously generalize the ones of Herstein, Lee and Carini et al.     

行m-NSD随机变量阵列的完全收敛性

本文研究了行m-NSD随机变量阵列的完全收敛性问题.主要利用m-NSD随机变量的Kolmogorov型指数不等式,获得了行m-NSD随机变量阵列的完全收敛性定理,将Hu等（1998）andSung等（2005）的结果从独立情形推广到了m-NSD随机变量阵列.本文的结论同样推广了Chen等（2008）,Hu等（2009）,Qiu等（2011）和Wang等（2014）的结果.     

关于向量优化问题的Δ函数标量化刻画的某些注记

近期,夏远梅等(重庆师范大学（自然科学版）,2015,32(1):12-15)利用Δ函数通过非线性标量化方法研究了向量优化问题的?-真有效解并举例说明了主要结果.笔者指出:其定理1是Gao等(Journal of Industrial and Management Optimization,2011,7（2）: 483-496)建立的定理4.6(i)的特例;其定理2的证明存在不足.通过研究一般的(C,ε)-真有效解的Δ函数非线性标量化,给出了定理2的严谨证明.最后,在?-真有效解存在的情况下举例说明了主要结果.     

A note on “Seller’s optimal credit period and cycle time in a supply chain for deteriorating items with maximum lifetime”

In 2014, Wang et al. (2014) extended the model of Lou and Wang (2012) to incorporate the credit period dependent demand and default risk for deteriorating items with maximum lifetime. However, the rates of demand, default risk and deterioration in the model of Wang et al. (2014) are assumed to be specific functions of credit period which limits the contributions. In this note, we first generalize the theoretical results of Wang et al. (2014) under some certain conditions. Furthermore, we also present some structural results instead of a numerical analysis on variation of optimal replenishment and trade credit strategies with respect to key parameters.     

Topology of character varieties and representations of quivers

In Hausel et al. (2008) [10] we presented a conjecture generalizing the Cauchy formula for Macdonald polynomial. This conjecture encodes the mixed Hodge polynomials of the character varieties of representations of the fundamental group of a punctured Riemann surface of genus g. We proved several results which support this conjecture. Here we announce new results which are consequences of those in Hausel et al. (2008) [10].     

不可微多目标规划的高阶对称对偶性

本文研究锥约束不可微多目标规划的Mond-Weir 型高阶对称对偶问题. 本文指出Agarwal 等人(2010) 和Gupta 等人(2010) 工作的不足, 给出规划问题的强对偶和逆对偶定理.     

Evaluation of leading heuristics for the single machine tardiness problem

A recent paper on the single machine tardiness problem by Panwalker, Smith and Koulamas [8] disputes experimental results of Holsenback and Russell [5] that indicated the Net Benefit of Relocation (NBR) heuristic provides significant improvement over the adjacent pairwise interchange (API) routine of Fry et al. [4], which in turn, was reported to show better solution quality than the Wilkerson-Irwin (W-I) heuristic ([13]). Panwalker et al. [8] claim that the P-S-K heuristic yields better results than the other methods over a wide range of problems and suggest that the NBR heuristic is not only inferior to the P-S-K heuristic, but also inferior to the API and W-I routines. This paper will shed new light on the quality of the experimentation of Panwalker et al. [8] and show that in general, the P-S-K heuristic is inferior to the NBR heuristic.     

Actions modérées de schémas en groupes affines et champs modérés

We compare two notions of tameness: one introduced in Chinburg et al. (1996) [4] for actions of affine group schemes and one introduced in Abramovich et al. (2008) [1] for stacks. From this comparison, we deduce results on the structure of inertia groups in these tame situations.     

Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable

Wang and Lih (2002) conjectured that every planar graph without adjacent triangles is 4-choosable. In this paper, we prove that every planar graph without any 4-cycle adjacent to two triangles is DP-4-colorable, which improves the results of Lam et al. (1999), Cheng et al. (2016) and Kim and Yu [ arXiv:1709.09809v1].