简介：ThispaperisconcernedwithapplicationsofintegratedsemigroupstothefollowingCauchyproblem:（ACPn）xn（t）=sumfromi=0ton-1Bixi（t）,xi（0）=xi,0（?）i（?）n-1whereBi（0（?）i（?）n-1）areclosedlinearoperatorsonaBanachspaceX.Auniquenesstheorem,aconditionofthesolvability,aconditionoftheexponentialwell-posedness,andsomeresultsforthespecialcasethatBn-1isboundedandD(Bn-2)（?）D（Bi）（0（?）i（?）n-3）areobtained.

简介：人的社会的动力学现在在由城市创造的人工的环境的上下文正在学习。在这个工作，作者描述一些在复杂性科学过去常学习城市的系统的形式化方法。作者讨论一些在现在的科学研究注意一些最深的争吵的城市的重要量的途径。当学习这类合作社会环境时，作者将强调一条transdisciplinary途径的重要性。

简介：Majorsocietalproblemsaffectthesocialstability.Itisnecessarytounderstandthepublicopiniontowardthoseissuestoavoidsocialconflicts.Nowadaysthesocialmediabecomethemajorplatformtotrackwhatthepublicisconcernedaboutandwhichmaybeofthesocietalrisk.However,itisverytoughtocapturethepublicattentioninshorttimeduetohugeflowofuser-generatedcontents.Inthispaper,weapproachthisproblembyexpandingthemethodofgeneratingstorylinewiththeresultdisplayedbyamulti-viewgraph.Onereal-worldexampleisillustratedandevaluationisgiventoshowtheeffectivenessoftheproposedmethod.

简介：

简介：在一个D输入Hammerstein系统的multivariate非线性的nonparametric鉴定的问题被检验。如果输入大小被组织，在意义，那在那里存在，这被表明在他们之间的某隐藏的关系，即如果他们在一些上是分布式的(未知)在R的d维的空格MD,dD，然后，系统非线性能与集中率O在M上在点被恢复(nd上的1/(2+d))依赖者。这率因此比通用的率O快(n<啜class=“a-plus-plus”>1/(2+D))由典型nonparametric算法完成了并且完全由输入D的数字控制了。

简介：这个工作被奉献给从被另一Markov链调制的随机的序列(称为的主要序列)的实验措施产生的随机的系统。Markov链被用来为没在主要序列被代表的随机的分离事件建模。一个新奇特征是代替在实验措施序列的平常的可伸缩，作者考虑在空间和时间可伸缩，它导致新限制结果。在宽广条件下面，实验措施的一个放大序列微弱地收敛到连续时间的Markov链调制的很多座Brownian桥，这被显示出。分枝和特殊情况也被考虑。

简介：ＳＯＭＥＮＥＷＣＯＮＳＴＲＵＣＴＩＯＮＳＯＦＣＡＲＴＥＳＩＡＮＡＵＴＨＥＮＴＩＣＡＴＩＯＮＣＯＤＥＳＦＲＯＭＳＹＭＰＬＥＣＴＩＣＧＥＯＭＥＴＲＹＹＯＵＨｏｎｇ；ＧＡＯＹｏｕ（ＮｏｒｔｈｅａｓｔＮｏｒｍａｌＵｎｉｖｅｒｓｉｔｙ，Ｃｈａｎｇｃｈｕｎ１３０...

简介：

简介：ＴＨＥＷＥＡＫＬＡＷＯＦＬＡＲＧＥＮＵＭＢＥＲＳＷＨＥＮＥＸＴＲＥＭＥＴＥＲＭＳＡＲＥＥＸＣＬＵＤＥＤＦＲＯＭＳＵＭＳ￥ＱＩＹｏｎｇｃｈｅｎｇ（ＤｅｐａｒｔｍｅｎｔｏｆＰｒｏｂａｂｉｌｉｔｙａｎｄＳｔａｔｉｓｔｉｃｓ，ＰｅｋｉｎｇＵｎｉｖｅｒｓｉｔｙ...

简介：这篇论文与每个工作需要二顺序的操作的n工作订单学习一个二阶段的生产系统。除了二台内部生产设备，制造商有采购一些阶段一个操作到一个遥远的外面的供应商的另一种选择。有他们采购的阶段一个操作的工作在他们的各自的阶段前从外面的供应商服从于批交通延期--二操作能内部地被开始。问题是设计考虑内部生产并且与最佳地平衡采购费用和makes平底锅的目的采购的一张综合时间表。这个问题是NP难的。我们开发了一个最佳的算法和一个启发式的算法解决这个问题，并且进行了计算实验验证我们的模型和算法。我们建模和算法框架能被扩大处理外面的供应商什么时候并且什么时候与不同处理效率有一台生产设备的另外的更一般的盒子在一个点市场上的供应商外面有许多。

简介：Roadmapping,originatedfromindustryasastrategicplanningtool,isattractingincreasingapplicationsinacademy.Basedontherecognitionthatroadmappingisaknowledgecreationprocess,thispaperanalyzeswhatkindofsupportisneededorhelpfulforestablishingacreativeenvironmentforroadmappinginacademyandreviewsvarioustypesofsuchsupportfromtheperspectiveofi-systemmethodology.Ascasestudiesofsuchsupport,thispaperfurtherintroducesroadmappingpraticesinJanpanAdvancedInstituteofScienceandTechnology.

简介：

简介：这份报纸从测量边界排水量与Neumann边界控制为一个颤动的字符串的空间可变系数考虑鉴定。重建算法由二步组成：第一步是恢复光谱从由证明系统是光谱的测量边界排水量的数据可控制；第二步是重建系数从恢复光谱用边界控制方法，要求的准确可控制性为是的数据也验证了。

简介：Thispaperstudiesthenonlinearvariationalinequalitywithintegro-differentialtermarisingfromvaluationofAmericanstyledoublebarrieroption.First,theauthorsusethepenaltymethodtotransformthevariationalinequalityintoanonlinearparabolicinitialboundaryproblem(i.e.,penaltyproblem).Second,theexistenceanduniquenessofsolutiontothepenaltyproblemareprovedbyusingtheScheaferfixedpointtheory.Third,theauthorsprovetheexistenceofvariationalinequality'solutionbyshowingthefactthatthepenalizedPDEconvergestothevariationalinequality.Theuniquenessofsolutiontothevariationalinequalityisalsoprovedbycontradiction.

简介：Inthispaper,weinvestigatethedisparitiesofChina’sinsurancemarketfromtheviewpointofgeographyandenterprisebyusingthemonthlydatafromJanuary2006toDecember2015.Wedividethewholeinsurancemarketintotwoparts,namelypropertyinsuranceandpersonalinsurance.Byconstructingandanalyzingminimumspanningtreesofinsurancemarket,weobtaintheresultsasfollows:(i)Theconnectionsbetweenprovincesaremuchcloserthanthoseoffirms,andthereareregionallinksbetweenneighboringprovincesintheminimumspanningtree(MST);and(ii)thedomesticfundedfirmsandforeignfundedfirmsformtwoexplicitclustersintheMSTsofpropertyandpersonalinsurancemarket.

简介：Fromtheviewpointofservicelevelagreements,thetransmissionaccuracyrateisoneofcriticalperformanceindicatorstoassessinternetqualityforsystemmanagersandcustomers.Undertheassumptionthateacharc'scapacityisdeterministic,thequickestpathproblemistofindapathsendingaspecificofdatasuchthatthetransmissiontimeisminimized.However,inmanyreal-lifenetworkssuchascomputernetworks,eacharchasstochasticcapacity,leadtimeandaccuracyrate.Suchanetworkisnamedamulti-statecomputernetwork.Underbothassuredaccuracyrateandtimeconstraints,weextendthequickestpathproblemtocomputetheprobabilitythatdunitsofdatacanbesentthroughmultipleminimalpathssimultaneously.Suchaprobabilitynamedsystemreliabilityisaperformanceindicatortoprovidetomanagersforunderstandingtheabilityofsystemandimprovement.Anefficientalgorithmisproposedtoevaluatethesystemreliabilityintermsoftheapproachofminimalpaths.

简介：Thispaperisdevotedtodeterminingthestructuresandpropertiesofone-Leeweightcodesandtwo-LeeweightprojectivecodesCk1,k2,k3overpIF+vIFpwithtypep2k1pk2pk3.Theauthorsintroduceadistance-preservingGraymapfrom(IFp+vIFp)nto2np.BytheGraymap,theauthorsconstructafamilyofoptimalone-Hammingweightp-arylinearcodesfromone-LeeweightcodesoverIFp+vIFp,whichattainthePlotkinboundandtheGriesmerbound.Theauthorsalsoobtainaclassofoptimalp-arylinearcodesfromtwo-LeeweightprojectivecodesoverIFp+vIFp,whichmeettheGriesmerbound.