简介：Inthisagecharacterizedbyrapidgrowthinthevolumeofdata,datadeidentificationtechnologieshavebecomecrucialinfacilitatingtheanalysisofsensitiveinformation.Forinstance,healthcareinformationmustbeprocessedthroughdeidentificationproceduresbeforebeingpassedtodataanalysisagenciesinordertopreventanyexposureofpersonaldetailsthatwouldviolateprivacy.Assuch,privacyprotectionissuesassociatedwiththereleaseofdataanddatamininghavebecomeapopularfieldofstudyinthedomainofbigdata.Asastrictandverifiabledefinitionofprivacy,differentialprivacyhasattractednoteworthyattentionandwidespreadresearchinrecentyears.Inthisstudy,weanalyzetheadvantagesofdifferentialprivacyprotectionmechanismsincomparisontotraditionaldeidentificationdataprotectionmethods.Furthermore,weexamineandanalyzethebasictheoriesofdifferentialprivacyandrelevantstudiesregardingdatareleaseanddatamining.

简介：Thisarticlepresentsadatamanagementsolutionbasedonthedatadistributionservice(DDS)communicationmodel.ThebasicDDScommunicationmodelconsistsofaunidirectionaldataexchangewhereapplicationsthatpublishdata'push'therelevantdata,whichisupdatedtothelocalcachesofco-locatedsubscriberstothedata[1].DDShasnospecifiedcenternodetoforwarddatapacketsandmaintainthecommunicationdata.Thistypeofpublish-subscribe(P/S)modelpresentsintegrityandconsistencychallengesindatamanagement.Unlikepeer-to-peer(P2P)distributedstorage,DDSapplicationshaveahardreal-timeenvironmentandfewerdatafeatures,andthecoreproblemisensuringtheintegrityandconsistencyofdataindistributedsystemsunderthishardreal-timeenvironment.ThisarticlebeginswithabriefintroductionofthecommunicationmodelusedbyDDS,thenanalyzespersistentdatamanagementproblemscausedbysuchmodel,andprovidesanappropriatesolutiontotheseproblems.Thissolutionhasbeenimplementedinaprototypesystemofthereal-timeservicebus(RTSB)ofTsinghuaUniversity.

简介：Theapplicationofdataenvelopmentanalysis(DEA)asamultiplecriteriadecisionmaking(MCDM)techniquehasbeengainingmoreandmoreattentioninrecentresearch.InthepracticeofapplyingDEAapproach,theappearanceofuncertaintiesoninputandoutputdataofdecisionmakingunit(DMU)mightmakethenominalsolutioninfeasibleandleadtotheefficiencyscoresmeaninglessfrompracticalview.ThispaperanalyzestheimpactofdatauncertaintyontheevaluationresultsofDEA,andproposesseveralrobustDEAmodelsbasedontheadaptationofrecentlydevelopedrobustoptimizationapproaches,whichwouldbeimmuneagainstinputandoutputdatauncertainties.TherobustDEAmodelsdevelopedarebasedoninput-orientedandoutputorientedCCRmodel,respectively,whentheuncertaintiesappearinoutputdataandinputdataseparately.Furthermore,therobustDEAmodelscoulddealwithrandomsymmetricuncertaintyandunknown-but-boundeduncertainty,inbothofwhichthedistributionsoftherandomdataentriesarepermittedtobeunknown.TherobustDEAmodelsareimplementedinanumericalexampleandtheefficiencyscoresandrankingsofthesemodelsarecompared.TheresultsindicatethattherobustDEAapproachcouldbeamorereliablemethodforefficiencyevaluationandrankinginMCDMproblems.

简介：Anoutsourcedatabaseisadatabaseserviceprovidedbycloudcomputingcompanies.Usingtheoutsourcedatabasecanreducethehardwareandsoftware'scostandalsogetmoreefficientandreliabledataprocessingcapacity.However,theoutsourcedatabasestillhassomechallenges.Iftheserviceproviderdoesnothavesufficientconfidence,thereisthepossibilityofdataleakage.Thedatamayhasuser'sprivacy,sodataleakagemaycausedataprivacyleak.Basedonthisfactor,toprotecttheprivacyofdataintheoutsourcedatabasebecomesveryimportant.Inthepast,scholarshaveproposedk-anonymitytoprotectdataprivacyinthedatabase.Itletsdatabecomeanonymoustoavoiddataprivacyleak.Butk-anonymityhassomeproblems,itisirreversible,andeasiertobeattackedbyhomogeneityattackandbackgroundknowledgeattack.Lateron,scholarshaveproposedsomestudiestosolvehomogeneityattackandbackgroundknowledgeattack.Buttheirstudiesstillcannotrecoverbacktotheoriginaldata.Inthispaper,weproposeadataanonymitymethod.Itcanbereversibleandalsopreventthosetwoattacks.Ourstudyisbasedontheproposedr-transform.Itcanbeusedonthenumerictypeofattributesintheoutsourcedatabase.Intheexperiment,wediscussedthetimerequiredtoanonymizeandrecoverdata.Furthermore,weinvestigatedthedefenseagainsthomogeneousattackandbackgroundknowledgeattack.Attheend,wesummarizedtheproposedmethodandfutureresearches.

简介：

简介：GuestEditorsProf.TaoZhouUniv.ofElectronicScienceandTechnologyofChinazhutouster@gmail.comProf.ZenglinXuUniv.ofElectronicScienceandTechnologyofChinazenglin@gmail.comInthisdigitalera,enormousamountsofdataareubiquitousandpervasive,whichareknownasBigData.Thesedataareaboutdifferentdomains,fromdifferentsources,andindifferentformats.Inordertomanipulate,integrate,andutilizethe

简介：Acompressionalgorithmisproposedinthispaperforreducingthesizeofsensordata.Byusingadictionary-basedlosslesscompressionalgorithm,sensordatacanbecompressedefficientlyandinterpretedwithoutdecompressing.Thecorrelationbetweenredundancyofsensordataandcompressionratioisexplored.Further,aparallelcompressionalgorithmbasedonMapReduce[1]isproposed.Meanwhile,datapartitionerwhichplaysanimportantroleinperformanceofMapReduceapplicationisdiscussedalongwithperformanceevaluationcriteriaproposedinthispaper.Experimentsdemonstratethatrandomsamplerissuitableforhighlyredundantsensordataandtheproposedcompressionalgorithmscancompressthosehighlyredundantsensordataefficiently.

简介：Thedatausedintheprocessofknowledgediscoveryoftenincludesnoiseandincompleteinformation.Theboundariesofdifferentclassesofthesedataareblurandunobvious.Whenthesedataareclusteredorclassified,weoftengetthecoveringsinsteadofthepartitions,anditusuallymakesourinformationsysteminsecure.Inthispaper,optimalpartitioningofincompletedataisresearched.Firstly,therelationshipofsetcoverandsetpartitionisdiscussed,andthedistancebetweensetcoverandsetpartitionisdefined.Secondly,theoptimalpartitioningofgivencoverisresearchedbythecombingandpartingmethod,acquiringtheoptimalpartitionfromthreedifferentpartitionssetfamilyisdiscussed.Finally,thecorrespondingoptimalalgorithmisgiven.Therealwirelesssignalsofftencontainalotofnoise,andtherearemanyerrorsinboundarieswhenthesedataisclusteredbasedonthetradionalmethod.Inourexperimant,theproposedmethodimprovescorrectrategreatly,andtheexperimentalresultsdemonstratethemethod’svalidity.

简介：

简介：Thispaperpresentsafault-detectionmethodbasedonthephasespacereconstructionanddataminingapproachesforthecomplexelectronicsystem.TheapproachforthephasespacereconstructionofchaotictimeseriesisacombinationalgorithmofmultipleautocorrelationandΓ-test,bywhichthequasi-optimalembeddingdimensionandtimedelaycanbeobtained.Thedataminingalgorithm,whichcalculatestheradiusofgyrationofunit-masspointaroundthecentreofmassinthephasespace,candistinguishthefaultparameterfromthechaotictimeseriesoutputbythetestedsystem.Theexperimentalresultsdepictthatthisfaultdetectionmethodcancorrectlydetectthefaultphenomenaofelectronicsystem.

简介：Networktrafficclassificationaimsatidentifyingtheapplicationtypesofnetworkpackets.ItisimportantforInternetserviceproviders(ISPs)tomanagebandwidthresourcesandensurethequalityofservicefordifferentnetworkapplications.However,mostclassificationtechniquesusingmachinelearningonlyfocusonhighflowaccuracyandignorebyteaccuracy.TheclassifierwouldobtainlowclassificationperformanceforelephantflowsastheimbalancebetweenelephantflowsandmiceflowsonInternet.Theelephantflows,however,consumemuchmorebandwidththanmiceflows.Whentheclassifierisdeployedfortrafficpolicing,thenetworkmanagementsystemcannotpenalizeelephantflowsandavoidnetworkcongestioneffectively.Thisarticleexploresthefactorsrelatedtolowbyteaccuracy,andsecondly,itpresentsanewtrafficclassificationmethodtoimprovebyteaccuracyattheaidofdatacleaning.Experimentsarecarriedoutonthreegroupsofreal-worldtrafficdatasets,andthemethodiscomparedwithexistingworkontheperformanceofimprovingbyteaccuracy.Experimentshowsthatbyteaccuracyincreasedbyabout22.31%onaverage.Themethodoutperformstheexistingoneinmostcases.

简介：在无损失的压缩的地里，当他们面对集体数据时，传统的软件的大多数类型有一些缺乏。他们的压缩能力被数据窗口尺寸和压缩格式设计限制。这份报纸论述格式说出支持数据窗户尺寸直到4GB并且在集体数据压缩有一些优点的CZ格式的压缩的一个新图案。用这种格式，一个压缩共享软件说出ComZip被设计。实验结果支持那ComZip在大多数情况中比WinZip，Bzip2和WinRAR有更好的压缩比率，特别当集体数据的GB或TB被压缩时。并且ComZip有潜力当数据窗户尺寸超过128MB，在未来打败7压缩。

简介：Timelyandcost-efficientmulti-hopdatadeliveryamongvehiclesisessentialforvehicularad-hocnetworks(VANETs),andvariousroutingprotocolsareenvisionedforinfrastructure-lessvehicle-to-vehicle(V2V)communications.Generally,whenapacket(oraduplicate)isdeliveredoutoftheroutingpath,itwillbedropped.However,weobservethatthesepackets(orduplicates)mayalsobedeliveredmuchfasterthanthepacketsdeliveredalongtheoriginalroutingpath.Inthispaper,weproposeanoveltreebasedroutingscheme(TBRS)forultilizingthedroppedpacketsinVANETs.InTBRS,thepacketisdeliveredalongaroutingtreewiththedestinationasitsroot.Andwhenthepacketisdeliveredoutitsroutingtree,itwon'tbedroptimmediatelyandwillbedeliveredforawhileifitcanarriveatanotherbranchofthetree.WeconducttheextensivesimulationstoevaluatetheperformanceofTBRSbasedontheroadmapofarealcitycollectedfromGoogleEarth.ThesimulationresultsshowthatTBRScanoutperformtheexistingprotocols,especiallywhenthenetworkresourcesarelimited.

简介：AnorthogonallymultiplexedQAM(OQAM)systemallowstransmissionspeedtobeveryclosetotheNyquistratewithlittlesensitivitytodelayandsignaldistortionsoftransmissionmediumwhenalargenumberofchannelsareused.Itscircuitcomplexitycanbelargelyovercomebyintroducingdigitalsignalprocessing(DSP)technology,Inthispaper,theimplementationofgroupbanddatamodemusingOQAMtechniqueispresented,whereOQAMsystemisrealizedbymeansofcascadingadiscretecosinetransformer(DCT)andaweightingnetwork.TheproperalgorithmofevaluatingFIRfilterandDCTprovidesfurtherreductionofthecomputationcomplexitywhichdropsto35.6%ofthatofHirosaki'sscheme[5].

简介：Toimprovedatacacheperformance,optimizingprogramdatalayoutbydatareorganizationhasbecomeanimportantmethodofdecreasingtheimpactofincreasinggapofspeedbetweenprocessorandmemory.Inthisarticle,astructuresplittingframeworkwithananalysismodelnamedstructurefieldrelationgraph(SFRG)ispresentedtooptimizeprogramdatalayout.TheSFRGcanbeusedtoquantifyrelationshipbetweenfields.Ithelpstofindanoptimallayoutforstructureaswellastheoptimalprogramdatalayout.AndthedatacacheperformanceisimprovedthroughSFRG-basedstructuresplitting.Experimentsshowthatthisframeworkiseffectiveinoptimizingprogramdatalayoutandimprovingtheperformanceofdatacacheandwholeprogram.

简介：ForthereliabilityandpowerconsumptionissuesofEthernetdatatransmissionbasedonthefieldprogrammablegatearray(FPGA),alow-powerconsumptiondesignmethodisproposed,whichissuitableforFPGAimplementation.Toreducethedynamicpowerconsumptionofintegratedcircuit(IC)design,theproposedmethodadoptsthedynamiccontroloftheclockfrequency.Formostofthetime,whentheportisintheidlestateorlower-ratestate,userscanreduceoreventurnoffthereadingclockfrequencyandreducetheclockflipfrequencyinordertoreducethedynamicpowerconsumption.Whenthereceivingrateishigh,thereadingclockfrequencywillbeimprovedtimelytoensurethatnodatawilllost.SimulatedandverifiedbyModelsim,theproposedmethodcandynamicallycontroltheclockfrequency,includingthedynamicswitchingofhigh-speedandlow-speedclockfliprates,orstopoftheclockflip.

简介：

简介：Hidingdatainthedeoxyribosenucleicacid(DNA)canfacilitatetheauthenticationandannotationofimportantplantvarietyrights.Agrantofplantvarietyrightsforanewplantvarietygivesyoutheexclusiverighttoproduceforsaleandsellpropagatingmaterialofthevariety.Digitalwatermarkingtechniqueshavebeenproposedforawiderangeofapplications,includingownershipprotection,copycontrol,annotation,andauthentication.However,existingdatahidingmethodsforDNAchangethefunctionalitiesofDNAsequences,whichinducemorphologicalchangesinbiologicalpatterns.ThispaperproposesahighcapacitydatahidingschemeforDNAwithoutchangingthefunctionalitiesofDNAsequences.Thisschemeadaptivelyvariestheembeddingprocessaccordingtotheamountofhiddendata.Experimentalresultsshowthattheproposedschemegivesasignificantlyimprovedhidingperformancethanpreviousschemes.Andtherobustnessandsecurityissuesarealsoanalyzed.

简介：Theperformanceofadaptivebeamformingtechniquesislimitedbythenonhomogeneouscluttersce-nario.AnaugmentedKrylovsubspacemethodisproposed,whichutilizesonlyasinglesnapshotofthedataforadaptiveprocessing.ThenovelalgorithmputstogetheradatapreprocessorandadaptiveKrylovsubspacealgo-rithm,wherethedatapreprocessorsuppressesdiscreteinterferenceandtheadaptiveKrylovsubspacealgorithmsuppresseshomogeneousclutter.Thenovelmethodusesasinglesnapshotofthedatareceivedbythearrayantennatogenerateacancellationmatrixthatdoesnotcontainthesignalofinterest(SOI)component,thus,itmitigatestheproblemofhighlynonstationaryclutterenvironmentandithelpstooperateinreal-time.Thebenefitofnotrequiringthetrainingdatacomesatthecostofareduceddegreeoffreedom(DOF)ofthesystem.Simulationillus-tratestheeffectivenessincluttersuppressionandadaptivebeamforming.Thenumericresultsshowgoodagreementwiththeproposedtheorem.

简介：因为在哪个录像运动需要被追踪，环境广泛地基于申请被改变并且在追踪的系统的设计和表演上提出几限制，录像追踪是一个复杂问题。没有彻底地分析环境强加的这些不同限制的效果，被用来评估并且比较录像运动追踪算法的当前的数据集使用一项累积性能措施。但是它需要作为参数分析这些限制。这份报纸的目的是识别这些参数并且定义量的措施让这些参数为运动追踪比较录像数据集。