Reduced Minimum Modulus Preserving in Banach Space

Let be the algebra of all bounded linear operators on a complex Banach space X and γ(T) be the reduced minimum modulus of operator . In this work, we prove that if , is a surjective linear map such that is an invertible operator, then , for every , if and only if, either there exist two bijective isometries and such that for every , or there exist two bijective isometries and such that for every . This generalizes for a Banach space the Mbekhta’s theorem [12].      

二层线性规划的自适应遗传算法

提出了一种自适应遗传算法来求解二层线性规划问题.该方法克服了难以确定合适的交叉概率和变异概率的困难.另外,在该方法中还采用了其它一些技巧不仅解决了在采用遗传算法经常出现的有些个体不可行的问题,而且还改进了算法的效率.     

关于“GM(1,1)模型的适用范围”一文的一个注记

本文扩展了刘思峰和邓聚龙的一个命题的适用范围 ,最后给出了一个相应新命题     

The numerical range of a nonnegative matrix

We offer an almost self-contained development of Perron–Frobenius type results for the numerical range of an (irreducible) nonnegative matrix, rederiving and completing the previous work of Issos, Nylen and Tam, and Tam and Yang on this topic. We solve the open problem of characterizing nonnegative matrices whose numerical ranges are regular convex polygons with center at the origin. Some related results are obtained and some open problems are also posed.     

Reachable and controllable sets for two-dimensional,linear, discrete-time systems

We consider two-dimensional discrete-time linear systems with constrained controls. We propose a simple polynomial time procedure to give an exact external representation of theN-step reachable set and controllable set. The bounding hyperplanes are explicitly derived in terms of the data of the problem. By using a result in computational geometry, all the calculations are made in polynomial time in contrast to classical methods. The limit case asN is also investigated.     

Optimal convergence properties of kernel density estimators without differentiability conditions

Let X ₁, X ₂, ..., X _n be independent observations from an (unknown) absolutely continuous univariate distribution with density f and let % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXafv3ySLgzGmvETj2BSbqefm0B1jxALjhiov2D% aebbfv3ySLgzGueE0jxyaibaiiYdd9qrFfea0dXdf9vqai-hEir8Ve% ea0de9qq-hbrpepeea0db9q8as0-LqLs-Jirpepeea0-as0Fb9pgea% 0lrP0xe9Fve9Fve9qapdbaqaaeGacaGaaiaabeqaamaabaabcaGcba% GabmOzayaajaGaaiikaiaadIhacaGGPaGaeyypa0Jaaiikaiaad6ga% caWGObGaaiykamaaCaaaleqabaGaeyOeI0IaaGymaaaakmaaqadaba% Gaam4saiaacUfadaWcgaqaaiaacIcacaWG4bGaeyOeI0Iaamiwamaa% BaaaleaacaWGPbaabeaakiaacMcaaeaacaWGObGaaiyxaaaaaSqaai% aadMgacqGH9aqpcaaIXaaabaGaamOBaaqdcqGHris5aaaa!5356!\[\hat f(x) = (nh)^{ - 1} \sum\nolimits_{i = 1}^n {K[{{(x - X_i )} \mathord{\left/ {\vphantom {{(x - X_i )} {h]}}} \right. \kern-\nulldelimiterspace} {h]}}} \] be a kernel estimator of f(x) at the point x, \s-<x<, with h=h _n (h _n O and nh _n , as n) the bandwidth and K a kernel function of order r. Optimal rates of convergence to zero for the bias and mean square error of such estimators have been studied and established by several authors under varying conditions on K and f. These conditions, however, have invariably included the assumption of existence of the r-th order derivative for f at the point x. It is shown in this paper that these rates of convergence remain valid without any differentiability assumptions on f at x. Instead some simple regularity conditions are imposed on the density f at the point of interest. Our methods are based on certain results in the theory of semi-groups of linear operators and the notions and relations of calculus of finite differences.This research was supported in part by grants from the Natural Sciences and Engineering Research Council of Canada and the University of Alberta Central Research Fund.     

A Variational ODE and its Application to an Elliptic Problem

In this paper,we consider the following ODE problem(P)where f ∈ C((0, ∞)×R,R),f(r,s)goes to p(r)and q(r)uniformly in r>0 as s→0 and s→ ∞,respectively,0≤p(r)≤q(r)∈ L~∞(0,∞).Moreover,for r>0,f(r,s)is nondecreasing in s≥0.Some existenceand non-existence of positive solutions to problem(P)are proved without assuming that p(r)≡0 and q(r)hasa limit at infinity.Based on these results,we get the existence of positive solutions for an elliptic problem.     

Production scheduling with alternative process plans

This paper deals with a scheduling problem with alternative process plans that was motivated by a production of wire harnesses where certain parts can be processed manually or automatically by different types of machines. Only a subset of all the given activities will form the solution, so the decision whether the activity will appear in the final schedule has to be made during the scheduling process. The problem considered is an extension of the resource constrained project scheduling problem (RCPSP) with unary resources, positive and negative time-lags and sequence dependent setup times. We extend classic RCPSP problem by a definition of alternative branchings, represented by the Petri nets formalism allowing one to define alternatives and parallelism within one data structure. For this representation of the problem, an integer linear programming model is formulated and the reduction of the problem, using time symmetry mapping, is shown. Finally, a heuristic algorithm based on priority schedule construction with an unscheduling step is proposed for the nested version of the problem and it is used to solve the case study of the wire harnesses production.     

线性规划联合算法的理论与应用

本在[1]的基础上．较系统的叙述了线性规划联合算法的步骤、相关理论及其应用，指出该算法具有避免人工变量、减少迭代次数、使用灵活、应用方便等特点。     

关于可拓集合的运算

根据蔡文提出的可拓集合的新定义,给出了可拓集合的包含、并、交、非运算的新定义,并讨论了有关运算性质,进而获得可拓域与稳定域的几个交并运算结果.