简介：

简介：

简介：

简介：

简介：

简介：Thecombinationofvisualandtextualinformationinimageretrievalremarkablyalleviatesthesemanticgapoftraditionalimageretrievalmethods,andthusithasattractedmuchattentionrecently.Imageretrievalbasedonsuchacombinationisusuallycalledthecontent-and-textbasedimageretrieval(CTBIR).Nevertheless,existingstudiesinCTBIRmainlymakeeffortsonimprovingtheretrievalquality.Tothebestofourknowledge,littleattentionhasbeenfocusedonhowtoenhancetheretrievalefficiency.Nowadays,imagedataiswidespreadandexpandingrapidlyinourdailylife.Obviously,itisimportantandinterestingtoinvestigatetheretrievalefficiency.Tothisend,thispaperpresentsanefficientimageretrievalmethodnamedCATIRI(content-and-textbasedimageretrievalusingindexing).CATIRIfollowsathree-phasesolutionframeworkthatdevelopsanewindexingstructurecalledMHIM-tree.TheMHIM-treeseamlesslyintegratesseveralelementsincludingManhattanHashing,Invertedindex,andM-tree.TouseourMHIM-treewiselyinthequery,wepresentasetofimportantmetricsandrevealtheirinherentproperties.Basedonthem,wedevelopatop-kqueryalgorithmforCTBIR.ExperimentalresultsbasedonbenchmarkimagedatasetsdemonstratethatCATIRIoutperformsthecompetitorsbyanorderofmagnitude.

简介：聪明的边网络内容条款热点的出现，与巨大的存储空间被装备，，几GB)，开创机会学习在边网络交付录像的可能性。与两个不同常规内容条款交货网络(CDN)并且对等(P2P)策划，这个新交货范例，也就是边录像CDN，要求在设法并列地要服务的用户家/办公室定位的多达百万个边热点活动录像内容条款。明确地，二挑战涉及造边录像CDN，包括边内容条款热点怎么应该被组织为用户服务，并且内容项目怎么应该在为用户服务的不同地点被复制到他们。探讨这些挑战，我们如下建议我们的数据驱动的设计。首先，我们提出一个边区域分区问题联合最大化用户经验丰富的质量并且最小化复制费用，它在自然是NP难的，并且我们设计一个象Voronoi一样分区算法产生最佳的服务房间。第二，满足条款热点复制内容项目到边网络，我们建议边请求预言基于复制策略，它在卸载举止的一座服务者山峰执行复制。我们实现我们的设计并且使用踪迹驱动的实验验证它的有效性。与常规集中的CDN和基于流行的复制相比，我们的设计能显著地改进经验的用户质量，以用户察觉了带宽和潜伏，直到40%。

简介：

简介：

简介：Content-basedrouting(CBR)publish/subscribe(P/S)systemisanimportantclassofdistributedsystems.Thissystemdiffersfromclassicalparadigmsasmessagesareroutedbasedontheircontentratherthantheirdestinationaddress,soastoprovideafine-granularityeventdissemination,andsupportmoreflexibilitydecouplingapplications.Covering-basedroutingisatypicaloptimizationmethodofCBRandhasbeenwidelyusedasabuildingblockinmanydistributedP/Ssystems,foritmaintainsacompactroutingtableandreducesthecostsofcommunicationsandmatchingcomputations.Sofarasweknow,thisoptimizationmethodcanonlybeimplementedonacyclicoverlaynetwork,butcannotbedirectlyutilizedoncyclicnetworks.AstheCBRincyclicsystemsbecomesanewfocusofresearch,developingcovering-basedprotocolsandalgorithmsforcyclicP/Ssystemisbecomingsignificantlyimportant.Thispapercontributesthecycliccovering-basedroutingprotocolwithcorrespondingalgorithmstosupportcovering-basedprotocolincyclicP/Ssystem,andimplementsitinPADRES,adistributedeventmanagementinfrastructurebasedonthepublish/subscribemodel.