BINDING NUMBER AND MINIMUM DEGREE FOR [a,b]-FACTORS

We give some sufficient conditions on the binding number and the minimumdegree for a graph to have an [a, b]-factor.     

REMARKS ON THE BINDING NUMBER FOR [a,b]-FACTORS

We give some answers to the following question:If the binding numberof a graph G is more than 1+(a-1)/b,does G have an [a,b] -factor?     

对多目标决策文献[1 ]和[2 ]的评注

首先,本文指出了文献［１］中“定义６”存在的问题,并给出了一个修正的定义。其次,本文指出文献［２］中定理的大部分条件是多余的,并对相关问题作了简要评述。     

SOME QUALITATIVE PROPERTIES OF SOLUTIONSTO A SECOND-ORDER NONLINEAR BOUNDARY VALUE PROBLEM ON[0, ∞)

1.IntroductionUtilizingthemethodofupperandlowersolutions,WangJunyu,GaoWenneandLinZhenghuahaveestablisedinarecelltpaper[1]thefollowingtheorem:Theorem1.1LetN>0and^2--1.Thenthesecond-oafednonlinearboundaryvalueproblemWesaythatafunctiony(x)isaCIsolutiontotheboundaryvalueproblem(1.1)--(1.3),ifi)bothy(x)andly'(2)I"--,y,(2)areinC'[0, co),n)theequation(1.1)issatisfiedin(0, co),andiii)y(0)=1and:hTOOxl~'] y(x)=0.Furthermore,ifthesolutiony(x)P,,,,,,WcontinuoussecondderiVativein(0, co),thenitiscal…     

A HEURISTIC PATH-PLANNING METHOD FOR ENHANCING MACHINE-TOOL CONTOUR-FOLLOWING

Nomenclature ki integral action coefficient[s-1]kp speed proportional gain[s-1]kv position proportional gain[s-1]kf feed forward factor of the speed loop[%]M axis mass[kg]V speed[m/s]F driving effort[N]Rc radius of curvature[m]d distance to the apex[m]o lateral offset[m]εcontouring error[m]ωm lowest mechanical resonant frequency[s-1]ζdamping coefficient[-]r inertia ratio[-]μmembership function[-]αcorner angle[rad]x,y horizontal and vertical coordinates[m]?angle to the normal line[rad]1.I…     

参考文献着录格式

请参照以下格式标注参考文献：1．专著[M]、论文集[C]、报告[R]、学位论文[D]主要责任人，文献题目名[文献类型标识]，出版地：出版者，出版年，起止页码（任选）。     

A FEW RESULTS ON ARNOLDI''''S METHOD AND IOM FOR LARGE NON-HERMITIAN LINEAR SYSTEMS

1.IntroductionArnoldi'smethod[1'2]anditsincomplete0rth0g0nalizati0nversion(IOM)["']areextensivelyusedforsolvinglargenon-Hermitianlinearsystems.Itiswellknownthattheformerisanorthogonalprojectionmethod,whilethelatterisanobliqueprojecti0nmethod.Wereferto[2,4]and[3]forconvergenceanalyses0fthesetwomethods,respectively.RecelltlyBrown[5],Chronopoul0sI6landSaadl2,7]andmanyothershavederivedupdatingrecursionsoftheresidualnormsandaPprokimatesolutionsobtainedbyArnoldi'smethod.TheaPproachestheyuseeith…     

THE ASYMPTOTICALLY OPTIMAL EMPIRICALBAYES ESTIMATION IN ONE WAY ANOVA MODEL

1.IntroductionSincetheempiricalBayes(EB)approachtoastatisticaldecisionproblemwasfirstintroducedbyR.bbins[1'21?ithasreceivedmuchattentionintheliterature.Forlinearmodel,Singh[3]studiedtheEBestimationproblemofregressioncoefficientsinamultiplelinearregressionmodelunderknownerror-variance.Wei[4]consideredtheEBtestproblemforthesamemodel.ZhangandWeilsl,WeiandZhang[6]extendedSingh'sworktothecaseofunknownerror-variance,theydiscussedtheasymptoticoptimalityandconvergenceratesfortheestimationofregre…     

A New Approach to Optimal Filtering for SingularDiscrete-Time Stochastic Linear System

1IntroductionBecausetherealisticproblemwhichsingularsystemdescribesiswiderthanthenormalsystemsdo,theresearchofsingularsystemshasreceivedagreatdealofattention.Andmanyachievementshavebeenobtainedinthefieldsofstructuralcharacteranalysisanddesignmethodsofsingularsystems.Butforthestateestimationonlypreliminaryprobehasbeenmade.References[2]--[51proposedrespectivesolutionsbasedonleastsquaremethod.References[6]--[71transformsingularsystemsintonormalsystemsthroughmatrixresolutionandthenmakeuseofKalman…     

A Multipath Routing Assignment Model for Multi-Traffic Class Networks

1　IntroductionRoutingisakeytechnologyformoderndatanetworksandtherehavebeentremendousroutingalgorithms[1]～[5].MostoftheroutingalgorithmssuchasOSPFandRIP[5]arebasedontheshortestpathassignmentmodel,inwhicheveryrouterisonlyatransitionnode.Futurerouterisdestinationorientedandshouldhavetheabilitytosplittrafficloadovermulti-pathtoutilizethenetworkinfrastructureinanefficientway.Withthenetworktrafficincreasingmuchfaster,howtorealizeloadbalancinginthenetworkbecomesahotresearchtopic[2].UndertheOSP…     

ENDOMORPHISMS OF LIE ALGEBRA F[t]d／dt

Let F be a field of characteristic zero. W_n =is the Witt algebra over F, W_n~ =is Lie subalgebra of W_n. It is well known both W_n and W_n~ are simple infinite dimensional Lie algebra. In Zhao's paper, it was conjectured thatEnd(W_n~ ) - {0} = Aut(W_n~ ) and it was proved that the validity of this conjecture im-plies the validity of the well-known Jacobian conjecture. In this short note, we check theconjecture above for n = 1. We show End(W_1~ ) - {0} = Aut(W_1~ ).     

CONNECTED [1, k]-FACTORS OF BALANCE BIPARTITE GRAPHS

1.IntroductionAllgraphsconsideredaresimpleandfinite.Wereferthereaderto[1]forstandardgraphterminologiesnotdefinedinthispaper.LetGbeagraphwithvertexsetV(G)andedgesetE(G).ForanySCV(G),wedenotebyNG(S)theneighborsetofSinG,anddefineNG[S]=NG(S)US.LetdG(v)denotethedegreeofvinG.IfwewriteG=(VI,VZ),itmeansthatGisabipartitegraphwiththepartition(VI,V2)ofV(G).IfIVII=IVZI,wecallGabalancebipartitegraph.LetafbbetwopositiveintegerssuchthataSb.AspanningsubgraphFofGiscalledan[a,b]-factorofGi…     

The bulk input M[X] /M/1 queue with working vacations

In this paper, we analyze a bulk input M^[X] /M/1 queue with multiple working vacations. A quasi upper triangle transition probability matrix of two-dimensional Markov chain in this model is obtained, and with the matrix analysis method, highly complicated probability generating function(PGF) of the stationary queue length is firstly derived, from which we got the stochastic decomposition result for the stationary queue length which indicates the evident relationship with that of the classical M^[X] /M/1 queue without vacation. It is important that we find the upper and the lower bounds of the stationary waiting time in the Laplace transform order using the properties of the conditional Erlang distribution. Furthermore, we gain the mean queue length and the upper and the lower bounds of the mean waiting time.     

A DEGREE CONDITION FOR THE EXISTENCE OF CONNECTED [k, k 1]-FACTORS

ＡＤＥＧＲＥＥＣＯＮＤＩＴＩＯＮＦＯＲＴＨＥＥＸＩＳＴＥＮＣＥＯＦＣＯＮＮＥＣＴＥＤ［ｋ，ｋ＋１］－ＦＡＣＴＯＲＳＡＤＥＧＲＥＥＣＯＮＤＩＴＩＯＮＦＯＲＴＨＥＥＸＩＳＴＥＮＣＥＯＦＣＯＮＮＥＣＴＥＤ［ｋ，ｋ＋１］－ＦＡＣＴＯＲＳ￥ＣＡＩＭａｏｃｈｅｎ...     

Analysis of a continuous time SM[K]/PH[K]/1/FCFS queue: Age process, sojourn times, and queue lengths

This paper studies a continuous time queueing system with multiple types of customers and a first-come-first-served service discipline.Customers arrive according to a semi-Markov arrival process and the service times of individual types of customers have PH-distributions.A GI/M/1 type Markov process for a generalized age process of batches of customers is constructed.The stationary distribution of the GI/M/1 type Markov process is found explicitly and,consequently,the distributions of the age of the batch in service,the total workload in the system,waiting times,and sojourn times of different batches and different types of customers are obtained.The paper gives the matrix representations of the PH-distributions of waiting times and sojourn times.Some results are obtained for the distributions of queue lengths at departure epochs and at an arbitrary time.These results can be used to analyze not only the queue length,but also the composition of the queue.Computational methods are developed for calculating steady state distributions related to the queue lengths,sojourn times,and waiting times.     

对中小学课程难度灰色模型GM＿s（1，1）的探索

本文依据课程难度的标准是学生发展的动态水平的原理，首先验证了儿童青少年的心理发展与大脑发育之间存在异步正相关规律，而且相关程度极高，然后以儿童脑电频率数据作为心理发展的映射量建立起了由低值模型、均值模型和高值模型组成的中小学课程难度的灰色模型体系。     

对中小学课程难度灰色模型GMg(1, 1)的探索

本文依据课程难度的标准是学生发展的动态水平的原理, 首先验证了儿童青少年的心理发展与大脑发育之间存在异步正相关规律, 而且相关程度极高, 然后以儿童脑电频率数据作为心理发展的映射量建立起了由低值模型、均值模型和高值模型组成的中小学课程难度的灰色模型体系。     

适于大斜视角星载SAR系统的改进距离┐多普勒算法

分析了当天线斜视角增大时,导致传统距离－多普勒成像算法性能下降的主要误差来源。提出了一种适合大斜视角星载ＳＡＲ系统的改进距离－多普勒算法,并给出了处理仿真点目标数据得到图像质量的比较。结果表明,在大斜视角情况下,改进算法的性能远大于传统的距离－多普勒成像算法。