简介：Efficientestimationofpopulationsizeisacommonrequirementformanywirelesssensornetworkapplications.Examplesincludecountingthenumberofnodesaliveinthenetworkandmeasuringthescaleandshapeofphysicallycorrelatedevents.Thesetasksmustbeaccomplishedatextremelylowoverheadduetothesevereresourcelimitationofsensornodes,whichposesachallengeforlarge-scalesensornetworks.Inthisarticlewedesignanovelmeasurementtechnique,FLAKEbasedonsparsesamplingthatisgeneric,inthatitisapplicabletoarbitrarywirelesssensornetworks(WSN).Itcanbeusedtoefficientlyevaluatesystemsize,scaleofevent,andotherglobalaggregatingorsummationinformationofindividualnodesoverthewholenetworkinlowcommunicationcost.Thisfunctionalityisusefulinmanyapplications,buthardtoachievewheneachnodehasonlyalimited,localknowledgeofthenetwork.Therefore,FLAKEiscomposedoftwomaincomponentstosolvethisproblem.OneistheInjectedRandomDataDissemination(Sampling)method,theotherissparsesamplingalgorithmbasedonInverseSampling,uponwhichitimprovesbyachievingatargetvariancewithsmallerrorandlowcommunicationcost.FLAKEusesapproximatelyuniformrandomdatadisseminationandsparsesamplinginsensornetworks,whichisanunstructuredandlocalizedmethod.Atlastweprovideexperimentalresultsdemonstratingtheeffectivenessofouralgorithmonbothsmall-scaleandlarge-scaleWSNs.Ourmeasurementtechniqueappearstobethepracticalandappropriatechoice.

简介：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.

简介：Indexingtechniqueshavebeendevelopedforwirelessdatabroadcastenvironments,inordertoconservethescarcepowerresourcesofthemobileclients.However,theuseofinterleavedindexsegmentsinabroadcastcycleincreasestheaverageaccesslatencyfortheclients.Inthispaper,thebroadcast-basedspatialqueryprocessingmethods(BBS)arepresentedforthelocation-basedservices.IntheBBS,broadcasteddataobjectsaresortedsequentiallybasedontheirlocations,andtheserverbroadcaststhelocationdependentdataalongwithanindexsegment.Then,asequentialprefetchingandcachingschemeisdesignedtoreducethequeryresponsetime.Theperformanceofthisschemeisinvestigatedinrelationtovariousenvironmentalvariables,suchasthedistributionsofthedataobjects,theaveragespeedoftheclientsandthesizeoftheservicearea.

简介：Whenqueryingonalarge-scaleknowledgebase,amajortechniqueofim-provingperformanceistopreloadknowledgetominimizethenumberofroundtripstotheknowledgebase.Inthispaper,anontology-basedsemanticcacheisproposedforanagentandontology-orientedknowledgebase(AOKB).InAOKB,anontologyisthecollectionofre-lationshipsbetweenagroupofknowledgeunits(agentsand/orothersub-ontologies).WhenloadingsomeagentA,itsrelationshipswithotherknowledgeunitsareexamined,andthosewhohaveatightsemantictiewithAwillbepreloadedatthesametime,includingagentsandsub-ontologiesinthesameontologywhereAis.Thepreloadedagentsandontologiesaresavedatasemanticcachelocatedinthememory.Testresultsshowthatupto50%reductioninrunningtimeisachieved.

简介：At-speedtestingusingexternaltesterrequiresanexpensiveequipment,thusbuilt-inself-test(BIST)isanalternativetechniqueduetoitsabilitytoperformon-chipat-speedself-testing.ThemainissueinBISTforat-speedtestingistoobtainhighdelayfaultcoveragewithalowhardwareoverhead.Thispaperpresentsanimprovedloop-basedBISTscheme,inwhichaconfigurableMISR(multiple-inputsignatureregister)isusedtogeneratetest-pairsequences.ThestructureandoperationmodesoftheBISTschemearedescribed.Thetopologicalpropertiesofthestate-transition-graphoftheproposedBISTschemeareanalyzed.Basedonit,anapproachtodesignandefficientlyimplementtheproposedBISTschemeisdeveloped.ExperimentalresultsonacademicbenchmarkcircuitsarepresentedtodemonstratetheeffectivenessoftheproposedBISTschemeaswellasthedesignapproach.

简介：ETL(Extract-Transform-Load)通常包括三个阶段：抽取，转变，并且装载。在造数据仓库里，它起数据注射的作用并且是最费时间的活动。因此改进ETL的表演是必要的。在这份报纸，一条新ETL途径，电话(Transform-Extract-Load)被建议。电话途径使用虚拟表格在抽取舞台和装载舞台前认识到转变阶段，在存储从每迥异的来源数据系统提取的未加工的数据的数据阶段区域或阶段数据库外面。电话途径减少数据传播负担，并且从存取层改进询问的性能。试验性的结果基于我们的建议基准证明电话途径可行、实际。

简介：Thepronunciationvariabilityisanimportantissuethatmustbefacedwithwhendevelopingpracticalautomaticspontaneousspeechrecognitionsystems.Inthispaper,thefactorsthatmayaffecttherecognitionperformanceareanalyzed,inculdingthosespecifictotheChineselanguage.BystudyintheINITIAL/FINAL（IF）characteristicsofChineselanguageanddevelopingtheBayesianequation,theconceptsofgeneralizedINITIAL/FINAL（GIF）andgeneralizedsyllable(GS),theGIFmodelingandtheIF-GIFmodeling,aswellasthecontext-dependentpronunciationweighting,areproposedbasedonawellphoneticallytranscribedseeddatabase.Byusingthesemethods,theChinesesylableerrorrate(SER)isreducedby6.3%and4.2%comparedwiththeGIFmodelingandIFmodelingrespectivelywhenthelanguagemodel,suchassyllableorwordN-gram,isnotused.Theeffectivenessofthesemethodsisalsoprovedwhenmoredatawithoutthephonetictranscriptionareusedtorefinetheacousticmodelusingtheproposediterativeforced-alignmentbasedtranscribing(IFABT)method,achievinga5.7%SERreduction.

简介：Thispaperpresentsanautomaticimage-basedapproachforconvertinggreyscaleimagestopencilsketches,inwhichstrokesfollowtheimagefeatures.ThealgorithmfirstextractsadensedirectionfieldautomaticallyusingLogical/Linearoperatorswhichembodythedrawingmechanism.Next,areconstructionapproachbasedonasampling-and-interpolationschemeisintroducedtogeneratestrokepathsfromthedirectionfield.Finally,pencilstrokesarerenderedalongthespecifiedpathswithconsiderationofimagetoneandartificialillumination.Asanimportantapplication,thetechniqueisappliedtorenderportraitsfromimageswithlittleuserinteraction.Theexperimentalresultsdemonstratethattheapproachcanautomaticallyachievecompellingpencilsketchesfromreferenceimages.

简介：AnewmethodforconstructinginterpolatingLoopsubdivisionsurfacesispresented.ThenewmethodisanextensionoftheprogressiveinterpolationtechniqueforB-splines.GivenatriangularmeshM,theideaistoiterativelyupgradetheverticesofMtogenerateanewcontrolmeshMsuchthatlimitsurfaceofMwouldinterpolateM.ItcanbeshownthattheiterativeprocessisconvergentforLoopsubdivisionsurfaces.Hence,themethodiswell-defined.Thenewmethodhastheadvantagesofbothalocalmethodandaglobalmethod,i.e.,itcanhandlemeshesofanysizeandanytopologywhilegeneratingsmoothinterpolatingsubdivisionsurfacesthatfaithfullyresembletheshapeofthegivenmeshes.Themeshesconsideredherecanbeopenorclosed.

简介：ThispaperdescribesanewframeworkforsynthesizingChineselandscapepaintingusinganimage-basedapproach.Theframeworkinvolvestwostages:apreprocessingphase,inwhichafewbrushstroketextureprimitivities(BSTP)arecollectedfromsamplesofhand-madeChinesepaintings,andthecontrolpictureisconstructedtoprovidecolorIDsofmountains,andtheon-linephases,inwhichthefogimageissynthesizedandmountainsare"drawn"bymappingmultiplelayersofBSTPguidedbythecontrolpicture.Whenmorecomplexshadingisneeded,theshadingpictureisconstructedandusedduringtheBSTPmappingphase.Finally,thesynthesizedChineselandscapepaintingsofavarietyofstylesaregivenandtheylookmoreclosetothehandmadeworkthanthoseproducedwithpreviousmodelingmethods.

简介：Inthispaper,acomputationallyeffectivealgorithmbasedontabusearchforsolvingthesatisfiabilityproblem(TSSAT)isproposed.Somenovelandefficientheuristicstrategiesforgeneratingcandidateneighborhoodofthecurredassignmentandselectingvaribablestobeflippedarepresented.Especially,theaspirationcriterionandtabulisttructureofTSSATaredifferentfromthoseoftraditionaltabusearch.Computationalexperimentsonaclassofprobleminsteancesshowthat,TSSAT,inareasonableamountofcomputertime,yieldsbetterresultsthanNoveltywhichiscurrentlyamongthefastestknown.ThereforeTSSATisfeasibleandeffective.

简介：Onthebasisofanalyzingsomeneuralnetworkstoragecapacityproblemsanetworkmodelcomprisinganewencodingandrecallingschemeispresented.Byusingsomelogicaloperationswhichoperateonthebinarypatternstringsduringinformationprocessingprocedurethemodelcanreachahighstoragecapacityforacertainsizeofnetworkframework.

简介：Forworkflow-basedservicecompositionapproach,therelationsbetweentheWebserviceQoSandenvironmentsareusuallynotconsidered,sothattheinformationaboutQoSforcompositeserviceselectionisinaccurate.Itmakestheselectedcompositeserviceinefficient,orevenunexecutable.Toaddressthisproblem,anovelservicecompositionapproachbasedonproductionQoSrulesisproposedinthispaper.Generally,itisverydifficulttodirectlyanalyzehowdifferentkindsofenvironmentfactorsinfluencetheWebserviceQoS.Weadopt'black-box'analysismethodofoptimizingcompositeservices,discoveringtheknowledgesuchas'theQoSofoneWebservicewillbehigherinspecificenvironments'.Inourapproach,theexecutioninformationofthecompositeserviceisrecordedintoalogfirst,whichwillbetakenasthebasisofthesubsequentstatisticalanalysisanddatamining.Then,thetimelyQoSvaluesoftheWebservicesareestimatedandtheproductionQoSrulesbeingusedtoqualitativelyexpressthedifferentperformancesoftheWebserviceQoSindifferentenvironmentsaremined.Atlast,weemploytheminedQoSknowledgeoftheWebservicestooptimizethecompositeserviceselection.Extensiveexperimentalresultsshowthatourapproachcanimprovetheperformanceofselectedcompositeservicesonthepremiseofassuringtheselectingcomputationcost.

简介：Thestarnetworks,whichwereoriginallyproposedbyAkersandHarel,havesufferedfromarigorousrestrictiononthenumberofnodes.Thegeneralincompletestarnetworks(GISN)areproposedinthispapertorelievethisrestriction.AnefficientlabelingschemeforGISNisgiven,androutingandbroadcastingalgorithmsarealsopresentedforGIS.ThecommunicationdiameterofGISNisshowntobeboundedby4n-7.TheproposedsinglenodebroadcastingalgorithmisoptimalwithrespecttotimecomplexityO(nlog2n).

简介：Signlanguageisavisual-gesturallanguagemainlyusedbyhearingimpairedpeopletocommunicatewitheachother.Gestureandfacialexpressionareimportantgrammarpartsofsignlanguage.Inthispaper,atext-basedtransformationmethodofChinese-Chinesesignlanguagemachinetranslationisproposed.Gestureandfacialexpressionmodelsarecreatewd.Andapracticalsystemisimplemented.TheinputofthesystemisChinesetext.Theoutputofthesystemis'graphicsperson'whocangesticulateChinesesignalgnuageaccompainedbyfacialexpressionthatcorrespondstotheChinesetextenteredsoastorealizeautomatictranslationfromChinesetexttoChinesesignlanguage.

简介：主成分分析(PCA)和线性判别分析(LDA)是统计模式识别地里的二种流行特征抽取技术。不能直接由于小样品尺寸问题LDA被用于基于外观的面貌识别任务。作为后果，很多基于LDA的面部特征抽取技术被建议相继地处理这个问题。Nullspace方法是在他们之中的最有效的方法之一。Nullspace方法试着发现在在内班scatter矩阵的零空间最大化在班之间scatter的一套判别式向量。它的判别式向量的计算将涉及在一个高度维的矩阵上执行奇异值分解。它通常消费记忆、费时间。在统计分析在Nullspace方法和变化的系数的概念借关键想法我们在场新奇面部特征抽取法，即，判别式基于在这篇论文的变化(DCV)的系数。在FERET和AR脸图象数据库上执行的试验性的结果证明DCV是与Eigenfaces，Nullspace方法，和另外的最先进的美容比较的一种有希望的技术特征抽取法。电子增补材料这篇文章(doi:10.1007/s11390-007-9070-2)的联机版本contatins增补材料，它对授权用户可得到。

简介：recommender系统的众多的应用程序能提供我们理解用户的一个工具。组recommender反映多重用户行为的分析，并且试图向这个组的每个用户提供他们根据用户偏爱包含的事情。当前，大多数存在的组recommenders在用户之中忽略相互作用。在组活动期间，然而，交互偏爱将戏剧性地影响recommenders的成功。当用户的一些未知偏爱被另外的用户部分在这个组影响时，这个问题变得甚至更挑战性。能使用组活动历史信息和recommender的命名掌握(基于交互偏爱的组Recommender)被介绍的一个基于相互作用的方法产生交互偏爱参数的等级以后的反馈机制。评估建议方法的表演，它与在MovieLens数据集上的传统的合作过滤相比。结果关于有效性和精确性为多用户显示GRIPrecommender的优势。

简介：AnewmethodforthemechanicalelementarygeometrytheoremprovingispresentedbyusingGroebnerbasesofpolynomialideals.Ithastwomainadvantagesovertheapproachproposedinliterature:(i)Itiscompleteandnotarefutationalprocdure;(ii)Thesubcasesofthegeometrystatementswhicharenotgenerallytruecanbedifferentiatedclearly.

简介：基准的标记基于的扩充现实有许多应用。到目前为止，基准的标记的内部模式总是被用来编码标记。因此，基准的标记图象的大部分被用于编码而不是为姿势精确性提供相应特征点。这篇论文论述直接利用的一个新奇方法射影不变在相应特征点的位置的关系包含了编码标记。建议方法不为再编码要求模式图象的区域并且能提供更多的相应特征点以便更高的姿势精确性能容易被完成。象累积分布函数，设计确认和柔韧的过程那样的许多相关途径被建议克服敏感的问题射影不变。建议基准的标记系统可靠、柔韧的试验性的结果表演，和罐头比由存在基准的标记系统完成了提供更高的姿势精确性。电子增补材料这篇文章(doi:10.1007/s11390-007-9100-0)的联机版本包含增补材料，它对授权用户可得到。

简介：ThispaperexploitsBooleansatisfiabilityprobleminequivalencecheckingandmodelcheckingrespectively.Acombinationalequivalencecheckingmethodbasedonincrementalsatisfiabilityispresented.Thismethodchoosesthecandidateequivalentpairswithsomenewtechniques,andusesincrementalsatisfiabilityalgorithmtoimproveitsperformance.Bysubstitutingtheinternalequivalentpairsandconvertingtheequivalencerelationsintoconjunctivenormalform(CNF)formulas,thisapproachcanavoidthefalsenegatives,andreducethesearchspaceofSATprocedure.ExperimentalresultsonISCAS'85benchmarkcircuitsshowthat,thepresentedapproachisfasterandmorerobustthanthoseexistedinliterature.Thispaperalsopresentsanalgorithmforextractingofunsatisfiablecore,whichhasanimportantapplicationinabstractionandrefinementformodelcheckingtoalleviatethestatespaceexplosionbottleneck.Theerrorofapproximateextractionisanalyzedbymeansofsimulation.Ananalysisrevealsthataninterestingphenomenonoccurs,withtheincreasingdensityoftheformula,theaverageerroroftheextractionisdecreasing.AnexactextractionapproachforMUsubformula,referredtoaspre-assignmentalgorithm,isproposed.Boththeoreticalanalysisandexperimentalresultsshowthatitismoreefficient.