简介:Givennpropositionalvariables,letKn(i,j),0≤i≤j≤n,betheset(ordisjunction)ofallconjunctionsofiliteralsofwhichexactlyjliteralsarenegative.DunhamandWangconjecturedthatitmayrequireexponentialtimetodecidethateverydisjunctionKn(i,j)isnotvalidbytheresolutionmetho.Thispapergivesaproofoftheconjectureandthenexhibitsanewcounterexampletothefeasibilityoftheresolutionorconsensusmethod.
简介:AnewmethodforrecognizingChinesecharactersisproposed.Itisbasedontheso-calledfeaturepointsofChinesecharacters.Thefeaturepointsweuseincludethoseonthestrokeofacharacter.i.e.,endpoints.turningpoints,forkpointsandcrosspoints.andthekeypointsonthebackgroundofcharacter.ThismethoddiffersfromthepreviousonesforitcombinesthefeaturepointsonstrokewiththoseonbackgroundanditusesfeaturepointstorecognizeChinesecharactersdirectly.AChinesecharacterrecognitionsystembasedtotop-downdynamicalmatchingoffeaturepointisdeveloped.Thesystemcanrecognizenotonly6763printedsampleSongfontChinesecharactersofsize5.6×5.6mm^2withhighrecognitionrate,butalsothegeneralprintedbooks,magazinesanddocumentswithasatisfactoryrecognitionrateandspeed.
简介:Thispaperpresentsafactoringalgorithmforcomputingsource-to-Kterminal(SKT)reliability,theprobabilitythatasourceacansendmessagetoaspcifiedsetofterminalsK,inacyclicdirectednetworks(AD-networks)inwhichbothnodesandedgescanfail,BasedonPivotaldecompositiontheorem,anewformulaisdevivedforcomputingtheSKTreliabilityofAD-networks.ByestablishingatopologicalpropertyofAD-networks,itisshownthattheSKTreliabilityofAD-networkscanbecomputedbyrecursivelyapplyingthisformula,TwonewReliabilityPreservingReductionsarealsointroduced.Therecursiontreegeneratedbythepresentedalgorithmhasatmost2^(|V|-|K|-|C|leafnodes,where|V|and|K|arenodessatisfyingsomespecifiedconditions.ThecomputationcomplexityofthenewalgorithmisO(|E|·|V|·2^(|V|-|K|-|C|)intheworstcasewhere|E|isthenumberofedges.Forsource-to-all-terminal(SAT)reliability,itscomputationcomplexityisO(|E|).ComparisonofthenewalgorithmwiththeexistingonesindicatesthatthenewalgorithmismoreefficientforcomputingtheSKTreliabilityofAD-networks.
简介:OneofthecentralquestionsinCAGE^[1]isblendingsurfaceswhichprovidesthetheoreticalbasisforthedesigntechnologyofspacesurfaces.Wewilldiscussthegeneraltheoriesandalgorithmsformultivariatehyperfiniteinterpolationandtheirapplicationtotheblendingofimplicitalgebraicsurfaces,andinvestigatetheexistenceconditionsofhyperfiniteinterpolation.BasedonWu'stheoryonblendingimplicitalgebraicsurfaces,theproblemofblendingtwoquadricsurfacesisstudied.TheconditionsforthecoefficientofgiunderwhichthereexiststhecubicblendingsurfaceS(f)(thelowestdegree)areobtainedandtheconcreteexpressionsoffarepresentedistheyexist.TheseresultscanbeapplieddirectlytoCAGD.
简介:Amethod,calledTwo-DimensionalExtendedAttributeGrammars(2-DEAGs)fortherecognitionofhand-printedChinesecharactersispresented.Thismethodusesdirectlytwodimensionalinformation,andprovidesaschemefordealingwithvariouskindsofspecificcasesinauniformway.Inthismethod,componentsaredrawninguidedandredundantwayandreductionsaremadelevelbylevejustinaccordancewiththecomponentcombinationrelationsofChinesecharacters.Themethodprovidsalsopolysemousgrammars,coexistinggrammarsandstructureinferringswhihconstrainredundantrecognitionbycomparisonamongsimilarcharactersofcomponentsandgreatlyincreasethetoleranceabilitytodistortion.
简介:Inthispaperanewtext-independentspeakerverificationmethodGSMSVisproposedbasedonlikelihoodscorenormalization.Inthisnovelmethodaglobalspeakermodelisestablishedtorepresenttheuniversalfeaturesofspeechandnormalizethelikelihoodscore.Statisticalanalysisdemonstratesthatthisnormalizationmethodcanremovecommonfactorsofspeechandbringthedifferencesbetweenspeakersintoprominence.Asaresulttheequalerrorrateisdecreasedsignificantly,verificationprocedureisacceleratedandsystemadaptabilitytospeakingspeedisimproved.
简介:Animportantconceptproposedintheearlystageofrobotpathplanningfieldistheshrinkingofarobottoapointandmeanwhiletheexpandingofobstaclesintheworkspaceasasetofnewobstacles.TheresultinggrownobstaclesarecalledtheConfigurationSpace(Cspace)obstacles.Thefind-pathproblemisthentransformedintothatoffindingacollision-freepathforapointrobotamongtheCspaceobstacles.However,theresearchexperienceshaveshownthattheCspacetransformationisveryhardwhenthefollowingsituationsoccur:1)boththerobotandobstaclesarenotpolygons,and2)therobotisallowedtorotate.Thissituationgetsevenworsewhentherobotandobstaclesarethreedimensional(3D)objectswithvariousshapes.Forthisreason,directpathplanningapproacheswithouttheCspacetransformationisquiteusefulandexpected.Motivatedbythepracticalrequirementsofrobotpathplanning,ageneralizedconstrainedoptimizationproblem(GCOP)withnotonlylogicANDbutalsologicORrelationshipswasproposedandamathematicalsolutiondevelopedpreviously.Thispaperinheritsthefundamentalideasofinequalityandoptimizationtechniquesfromthepreviouswork,convertstheobstacleavoidanceproblemintoasemi-infiniteconstrainedoptimizationproblemwiththehelpofthemathematicaltransformation,andproposesadirectpathplanningapproachwithoutCspacecalculation,whichisquitedifferentfromtraditionalmethods.Toshowitsmerits,simulationresultsin3Dspacehavebeenpresented.