简介：Intheintroductionapreliminaryconsiderationofthesenseofconcepts“set”,“structure”,“system”,and“model”,aswellasoftheconnectionbetweenthemisproposedandonthebasisofitsresultsthetaskofinvestigationofabstractbasesofsystem(inparticularreconsiderationofconcept“abstractset”),ofabstractstructure,abstractsystemandofS-Modelisformulated.Thefirstsectionisdevotedtoformulationofanapproachtoconstructionofaggregatetheoryregardedasananalogofmoderateconstructivesettheory:therelations“inclusion”and“equivalence”betweenaggregatesandtheoperationsonaggregates“union”,“intersection,“difference”and“compliment”areintroduced.Definitionoftheconcept“a-system”aswellasofitsa-structureonthespaceofaggregatesisdefined.AspecialattentionisshowntosimilarityandessentialdifferencebetweenaggregatetheoryandsettheoryaswellastothefactthatthefamousparadoxesofCantorandRussellintheCantor’ssettheorytakenoplaceintheaggregatetheory.FurtheravariantofCantor’ssettheorycalledrestricteddiscretesettheoryisconsidered.Thesecondsectionisdevotedtoformulationofanapproachtoconstructionofalgebraofa-systems.Attheendtheconceptofsystemofsuccessivesystems(SSS),isintroduced.

简介：在这份报纸，我们将第一说明我们为什么应该介绍一它吗？打珍视集合的随机的微分方程并且我们为什么应该注意几乎到处问题。第二，我们将给不可分的Aumann类型Lebesgue的一个清楚的定义并且关于时间t珍视集合的随机的过程证明Lebesgue的measurability不可分。然后，我们将介绍一些新性质，特别证明珍视集合的Lebesgue积分的重要不平等。最后，我们将证明存在和的一个强壮的答案的唯一它吗？打珍视集合的随机的微分方程。关键词珍视集合的随机的过程-珍视集合的Lebesgue积分-珍视集合的随机的微分方程-强壮的解决方案先生(2000)题目分类60D05-60H10由中国(资助号码10771010)的国家自然科学基础支持了，PHR(IHLB)，北京教育委员会，的研究资金中国；并且为科学研究19540140的Grant-in-Aid，日本

简介：采样的观察经常易于舍入，但是被建模好像他们是unrounded。这份报纸检验与多层的评价集合采样在参数评价上绕行错误的影响。它证明舍入的错误严重弄歪协变性矩阵的行为估计，并且导致不一致的评价。考虑这，我们在场为这个模型实现评价，并且进一步建立建议评估者的强壮的一致性和asymptotic规度的一条新途径。模拟实验证明我们的估计基于圆简单随机的采样总是基于圆多层的评价集合采样是比那些更有效的。

简介：LetGbeanonabelianfinitegroup.ThenIrr(G/G′)isanabeliangroupunderthemultiplicationofcharactersandactsonthesetofnon-linearirreduciblecharactersofGviathemultiplicationofcharacters.Thepurposeofthispaperistoestablishsomefactsabouttheactionoflinearcharactergrouponnon-linearirreduciblecharactersanddeterminethestructuresofgroupsGforwhicheitheralltheorbitkernelsaretrivialorthenumberoforbitsisatmosttwo.Usingtheestablishedresultsonthisaction,itisveryeasytoclassifygroupsGhavingatmostthreenomlinearirreduciblecharacters.

简介：周和冯摆姿势一在2004的自我类似的集合上的conjecture。在这篇论文，一个自我类似的集合被构造它有最好盖住但是它的自然盖住不是最好的。因此，我们确实把一个否定答案给conjecture。

简介：ThepaperisacontributiontotheproblemofapproximatingrandomsetwithvaluesinaseparableBanachspace.Thisclassofset-valuedfunctioniswidelyusedinmanyareas.Weinvestigatethepropertiesofp-boundedintegrablerandomset.Basedonthisweendowitwith△pmetricwhichcanbeviewedasaintegraltypehausdorffmetricandpresentsomeapproximationtheoremofaclassofconvolutionoperatorswithrespectto△pmetric.Moreoverwealsocanestablishanalogoustheoremforotherintegraltypeoperatorin△pspace.

简介：Somepropertiesofconvexconesareobtainedandareusedtoderiveseveralequivalentconditionsaswellasanotherimportantpropertyfornearlycone-subconvexlikeset-valuedfunctions.Undertheassumptionsofnearlycone-subconvexlikeness,aLagrangianmultipliertheoremonBensonproperefficiencyispresented.Relatedresultsaregeneralized.

简介：InthispaperweconsidertheapproximationforfunctionsinsomesubspacesofL~2bysphericalmeansoftheirFourierintegralsandFourierseriesonsetoffullmeasure.Twomaintheoremsareobtained.

简介：为自我类似的集合的Hausdorff措施的计算的一个理论框架令人满意的振荡被建立了。

简介：Inthispaper,westudyHenigefficiencyinvectoroptimizationwithnearlycone-subconvexlikeset-valuedfunction.TheexistenceofHenigefficientpointisprovedandcharacterizationofHenigefficiencyisestablishedusingthemethodofLagrangianmultiplier.Asaninterestingapplicationoftheresultsinthispaper,weestablishaLagrangemultipliertheoremforsuperefficiencyinvectoroptimizationwithnearlycone-subconvexlikeset-valuedfunction.

简介：Thesolvabilityofaclassofforward-backwardstochasticdifferentialequations(SDEsforshort)overanarbitrarilyprescribedtimedurationisstudied.Theauthorsdesignastochasticrelaxedcontrolproblem,withbothdriftanddifftusionallbeingcontrolled,sothatthesolvabilityproblemisconvertedtoaproblemoffindingthenodalsetoftheviscositysolutiontoacertainHamilton-Jacobi-Bellmanequation.ThismethodovercomesthefataldifficultyencounteredinthetraditionalcontractionmappingapproachtotheexistencetheoremofsuchSDEs.

简介：Segmentationofthree-dimensional(3D)complicatedstructuresisofgreatimportanceformanyrealapplications.Inthisworkwecombinegraphcutminimizationmethodwithavariantofthelevelsetideafor3DsegmentationbasedontheMumford-Shahmodel.ComparedwiththetraditionalapproachforsolvingtheEuler-Lagrangeequationwedonotneedtosolveanypartialdifferentialequations.Instead,theminimumcutonaspecialdesignedgraphneedtobecomputed.Themethodistestedondatawithcomplicatedstructures.Itisratherstablewithrespecttoinitialvalueandthealgorithmisnearlyparameterfree.Experimentsshowthatitcansolvelargeproblemsmuchfasterthantraditionalapproaches.

简介：Inthispaper,wepresentamoresimpleandmuchshorterproofforthemainresultinthepaper'Annegativeanswertoaconjectureontheself-similarsetssatisfyingtheopensetcondition',whichwaspublishedinthejournalAnalysisinTheoryandApplicationsin2009.

简介：Afeedbackvertexsetisasubsetofverticesinagraph,whosedeletionfromthegraphmakestheresultinggraphacyclic.Inthispaper,westudytheminimum-weightfeedbackvertexsetprobleminseriesparallelgraphsandpresentalinear-timeexactalgorithmtosolveit.

简介：Klapper(1994)showedthatthereexistsaclassofgeometricsequenceswiththemaximalpossiblelinearcomplexitywhenconsideredassequencesoverGF(2),butthesesequenceshaveverylowlinearcomplexitieswhenconsideredassequencesoverGF(p)(pisanoddprime).ThislinearcomplexityofabinarysequencewhenconsideredasasequenceoverGF(p)iscalledGF(p)complexity.ThisindicatesthatthebinarysequenceswithhighGF(2)linearcomplexitiesareinadequateforsecurityinthepracticalapplication,while,theirGF(p)linearcomplexitiesarealsoequallyimportant,evenwhentheonlyconcerniswithattacksusingtheBerlekamp-Masseyalgorithm[Massey,J.L.,Shift-registersynthesisandbchdecoding,IEEETransactionsonInformationTheory,15(1),1969,122–127].Fromthisperspective,inthispapertheauthorsstudytheGF(p)linearcomplexityofHall’ssexticresiduesequencesandsomeknowncyclotomic-set-basedsequences.

简介：Thispaperdealswiththeconnectednessofthecone-efficientsolutionsetforvectoroptimizationinlocallyconvexHausdorfftopologicalvectorspaces.Theconnectednessofthecone-efficientsolutionsetisprovedformultiobjectiveprogrammingdefinedbyacontinuouscone-quasiconvexmappingonacompactconvexsetofalternatives.Thegeneralizedsaddletheoremplaysakeyroleintheproof.

简介：这份报纸的主要目的是为所谓的1集合为非线性的操作符方程F(x)=x(1)证明许多新固定的点定理和存在定理弱有收缩力的在Banach空格的无界的域上的操作符。我们也在起源介绍弱关上半的操作员的概念并且为操作员的如此的班为非线性的操作员方程F(x)=x(1)获得一系列新固定的点定理和存在定理。作为后果，主要结果概括并且改进相关结果，它被ORegan和A·本·阿马和M获得。在1998和2009的Mnif分别地。另外，我们得到Leray-Schauder，Altman，Petryshyn和Rothe的定理在情况中打的著名的固定的点弱顺序连续，1集合弱有收缩力(????湡捡???????????猠'T灳捡??ü