简介:Incontrasttothemainstreamofstudyingthechaoticbehaviorofagivenmap,constructingchaoticmaphasattractedmuchlessattention.Inthispaper,weproposesimpleanalyticalmethodforconstructingone-dimensionalcontinuousmapswithcertainspecificperiodicpoints.Further,weobtainresultsfortheexistenceofchaoticphenomenoninthesenseofLiandYorke.Someexamplesarealsoanalyzedusingtheproposedmethods.
简介:传记是然而,为普通的人知道众所周知的民族的表示的一个直接、广泛的方法,有差的知识让他们被认识到。在最近的年里,信息抽取(IE)技术被用来自动地与联机信息为任何人产生传记。关键挑战之一是能连接传记句子到相应实体的连接的实体(EL)。当前,使用的一般EL系统通常产生错误从实体名字变化和歧义发源。与一般文本相比,传记判决拥有唯一还很少学习了关系知识(RK)和时间的知识(TK),它能足够地区分实体。这篇文章建议一个新统计框架为自动化传记建设把知识称为提高的EL(龙骨)系统。提高实体连接利用象PK和TK一样的常识的知识。Wikipedia数据上的龙骨的表演被评估。与最先进的方法相比,龙骨显著地改进实体连接的精确和召回,这被显示出。
简介:TheEnglishconstruction'XandY'referstothecoordinationoftwowordswithandasconjunction,XandYbeingofthesamepartofspeechandparallelmeanings.ThispaperisacognitivestudyofthelinearorderoftheEnglishconstruction'XandY'fromtheperspectivesofcognitivesalience,cognitiveiconicity,andcognitionofformalrules.Thelinearcharacteristicsof'XandY'arerevealedasfollows:1)salience-downgradingorder;2)chronologicaliconicity;3)cognitionofalphabeticorderandprosodicorder.
简介:Compressivesensing(CS)hasemergedasanovelsamplingframeworkwhichenablessparsesignalacquisitionandreconstructionwithfewermeasurementsbelowtheNyquistrate.AnimportantissueforCSistheconstructionofmeasurementmatrixorsensingmatrix.Anewdeterministicsensingmatrix,namedasOOC-B,isproposedbyexploitingopticalorthogonalcodes(OOCs),BernoullimatrixandSingerstructure,whichhastheentriesof0,+1and-1beforenormalization.Wehaveproventhatthedesigneddeterministicmatrixisasymptoticallyoptimal.Inaddition,theproposeddeterministicsensingmatrixisappliedtodirectionofarrival(DOA)estimationofnarrowbandsignalsbyCSarrays(CSA)processingandCSrecovery.TheoreticalanalysisandsimulationresultsshowthattheproposedsensingmatrixhasgoodperformanceforDOAestimation.ItisveryeffectiveforsimplifyinghardwarestructureanddecreasingcomputationalcomplexityinDOAestimationbyCSAprocessing.Besides,lowerrootmeansquareerror(RMSE)andbiasareobtainedinDOAestimationbyCSrecovery.
简介:Thepaperproposesanovelalgorithmtogettheencryptionmatrix.Firstly,achaoticsequencegeneratedbyChebyshevchaoticneuralnetworksisconvertedintoaseriesoflow-orderintegermatricesfromwhichavailableencryptionmatricesareselected.Then,ahigherorderencryptionmatrixrelatingrealworldapplicationisconstructedbymeansoftensorproductionmethodbasedonselectedencryptionmatrices.Theresultsshowthattheproposedalgorithmcanproducea'one-timepadcipher'encryptionmatrixwithhighsecurity;andtheencryptionresultshavegoodchaosandauto-correlationwiththenaturalfrequencyoftheplaintextbeinghiddenandhomogenized.
简介:ThislettergivesarandomconstructionforLowDensityParityCheck(LDPC)codes,whichusesaniterativealgorithmtoavoidshortcyclesintheTannergraph.TheconstructionmethodhasgreatflexiblechoiceinLDPCcode'sparametersincludingcodelength,coderate,theleastgirthofthegraph,theweightofcolumnandrowintheparitycheckmatrix.ThemethodcanbeappliedtotheirregularLDPCcodesandstrictregularLDPCcodes.Systemiccodeshavemanyapplicationsindigitalcommunication,sothisletterproposesaconstructionofthegeneratormatrixofsystemicLDPCcodesfromtheparitycheckmatrix.Simulationsshowthatthemethodperformswellwithiterativedecoding.
简介:AlgebraicimmunityisanimportantcryptographicpropertyofBooleanfunctions.Inthispaper,odd-variablebalancedBooleanfunctionswithoptimalalgebraicimmunityareobtainedbym-sequenceandconsequently,wegetbaseswithspecialconstructionsofvectorspace.Furthermore,throughswappingsomevectorsofthesetwobases,weestablishallkindsofodd-variablebalancedBooleanfunctionswithoptimalalgebraicimmunity.
简介:Ageneralmethodofconstructingproxyblindsignatureisproposedbasedonmultilineartransform.Basedonthismethod,thefourproxyblindsignatureschemesarecorrespondentlygeneratedwithfourdifferentsignatureequations,andeachofthemhasfourformsofvariationsofsigns.Hencetherearesixteensignaturesinall,andallofthemareproxystronglyblindsignatureschemes.Furthermore,thetwodegeneratedsituationsofmulti-lineartransformarediscussed.Theircorrespondingproxyblindsignatureschemesareshown,too.Butsomeschemescomefromoneofthesedegeneratesituationsareproxyweakly-blindsignaturescheme.Thesecurityforproposedschemeisanalyzedindetails.Theresultsindicatethatthesesignatureschemeshavemanygoodpropertiessuchasunforgeability,distinguish-abilityofproxysignature,non-repudiationandextensivevalueofapplicationetc.
简介:Thispaperproposesasimplegeometricalraybasedapproachtosolvethestereocorrespondenceproblemforthesingle-lensbi-prismstereovisionsystem.Eachimagecapturedusingthissystemcanbedividedintotwosub-imagesontheleftandrightandthesesub-imagesaregeneratedbytwovirtualcameraswhichareproducedbythebi-prism.Thisstereovisionsystemisequivalenttotheconventionaltwocamerasystemandthetwosub-imagescapturedhavedisparitieswhichcanbeusedtoreconstructbackthe3-dimensional(3D)scene.ThestereocorrespondenceproblemofthissystemwillbesolvedgeometricallybyapplyingtheepipolargeometryconstraintonthegeneratedvirtualcamerasinsteadoftherealCCDcamera.Experimentsareconductedtovalidatetheproposedmethodandtheresultsarecomparedtothecalibrationbasedapproachtoconfirmitsaccuracyandeffectiveness.
简介:Inordertomeettheneedsofhigh-speeddevelopmentofopticalcommunicationsystem,aconstructionmethodofquasi-cycliclow-densityparity-check(QC-LDPC)codesbasedonmultiplicativegroupoffinitefieldisproposed.TheTannergraphofparitycheckmatrixofthecodeconstructedbythismethodhasnocycleoflength4,anditcanmakesurethattheobtainedcodecangetagooddistanceproperty.Simulationresultsshowthatwhenthebiterrorrate(BER)is10-6,inthesamesimulationenvironment,thenetcodinggain(NCG)oftheproposedQC-LDPC(3780,3540)codewiththecoderateof93.7%inthispaperisimprovedby2.18dBand1.6dBrespectivelycomparedwiththoseoftheRS(255,239)codeinITU-TG.975andtheLDPC(32640,30592)codeinITU-TG.975.1.Inaddition,theNCGoftheproposedQC-LDPC(3780,3540)codeisrespectively0.2dBand0.4dBhighercomparedwiththoseoftheSG-QC-LDPC(3780,3540)codebasedonthetwodifferentsubgroupsinfinitefieldandtheAS-QC-LDPC(3780,3540)codebasedonthetwoarbitrarysetsofafinitefield.Thus,theproposedQC-LDPC(3780,3540)codeinthispapercanbewellappliedinopticalcommunicationsystems.
简介:鉴于伪周期的低密度的同等值检查(QC-LDPC)的编码复杂性编码的问题,高,最小的距离不足够大它导致错误修正表演的降级,基于完成式,周期的差别设置的新不规则的type-IIQC-LDPC代码(CDS)被构造。这些type-IIQC-LDPC代码的同等值检查矩阵与0的重量由零个矩阵组成,有1的重量的circulant排列矩阵(CPM)和有2的重量(W2CMs)的circulant矩阵。在同等值检查矩阵的W2CMs的介绍使完成能改进错误的更大的最小的距离可能--代码的修正性能。这些代码的更黝黑的图没有girth-4,因此,他们有优秀译码集中特征。另外,因为同等值检查矩阵有伪双的斜结构,快编码算法能有效地减少编码复杂性。新type-IIQC-LDPC编码的模拟结果表演能完成更优秀的错误修正表演并且没在添加剂白人Gaussian噪音(AWGN)上有错误地板现象有和产品算法(矿泉)的隧道反复的译码。