简介:Letφbeanormalfunctionon[0,1]andA~1(φ)theBergmanspacewithweightφ(|z|)/(1-|z|~2).AnatomicdecompositiontheoremforA~1(φ)isobtained,andanecessaryandnearly-sufficientconditionisgiventomakeasequenceofpointsinterpolateforA~1(φ).
简介:Inthispaper,westudytheexistenceof0-1universalminimaltotaldominatingfunctionsinagraph.Weestablishaformulationoflinearinequalitiestocharacterizeuniversalminimaltotaldominatingfunctionsandshowthatforakindofgraphswhoseadjacentmatricesarebalanced,theexistenceofuniversalminimaltotaldominatingfunctionscoincideswiththatof0-1ones.Itisalsoprovedthatforgeneralgraphs,theproblemoftestingtheexistenceof0-1universalminimaltotaldominatingfunctionsisNP-hard.
简介:IntheexistingliteratureofRepairableQueueingSystems(RQS),i.e.,queueingsystemswithserverbreakdowns,itisalmostallassumedthatinterarrivaltimesofsuccessivecustomersareindependent,identicallyexponentiallydistributed.Inthispaper,wedealwithmoregenericsystemGI/PH/1withserver'sexponentialuptimeandphase-typerepairtime.Withmatrixanalysistheory,weestablishtheequilibriumconditionandthecharacteristicsofthesystem,derivethetransientandstationaryavailabilitybehaviorofthesystem.
简介:
简介:Inthispaper,wegiveanorder-preserving,isometricandisomorphicembeddingoperatorfromthefuzzynumberspaceE~1toaclassicalBanachspaceandshowsomenecessaryandsufficientintegrabilityconditionsoffuzzyintegralswhichweredefinedbyM.MatlokaandO.Kalevabymeansofsuchanoperator.
简介:我们与州依赖者的到达和一般服务分发学习一个单个服务者的排队系统,或简单地M(n)/G/1/K,在服务器跟随一条N政策并且当系统是空的时,度多重假期的地方。我们用增补可变技术提供一个递归的算法数字地计算系统的静止队列长度分发。唯一的输入要求是服务时间分发的Laplace-Stieltjes变换,假期时间分发,和州依赖者的到达评价。算法的Thecomputational复杂性是O(K~3)。