A criterion for easiness of certain SAT-problems
|
|
- Cuthbert McDonald
- 6 years ago
- Views:
Transcription
1 A criterio for eaie of certai SAT-problem Berd R. Schuh Dr. Berd Schuh, D Köl, Germay; keyword: compleity, atifiability, propoitioal logic, P, NP, -i-3sat, eay/hard itace Abtract. A geeralized -i-3sat problem i defied ad foud to be i compleity cla P whe retricted to a certai ubet of CN epreio. I particular, -i-ksat with o retrictio o the umber of literal per claue ca be decided i polyomial time whe retricted to eact READ-3 formula with equal umber of claue (m) ad variable (), ad o pure literal. Alo idividual itace ca be checked for eaie with repect to a give SAT problem. By idetifyig whole clae of formula a beig olvable efficietly the approach might be of iteret alo i the complemetary earch for hard itace. Itroductio. May problem i propoitioal logic are varietie of the deciio problem SAT? ad are i compleity cla NP. Eample are -i-3sat which i the problem of decidig whether for a give 3- CN formula there eit a aigmet which evaluate eactly oe literal per claue to true, or NOT-ALL-EQUAL-3SAT which ak for a aigmet with at leat oe true ad oe fale literal per claue. Other, like e.g. HORN-SAT or 2-SAT, are kow to be decidable i liear time ad thu belog to compleity cla P. or thee ad other eample ee e.g. []. A eteio of ome of thee NP problem to a more geeral requiremet o the umber of true literal ad to itace where the umber of literal i each claue i ot retricted to eactly 3 will
2 2 i geeral ehace the compleity of the problem. Oe ca idetify retricted CN epreio, however, for which the problem lie i compleity cla P. The baic idea i a follow. Give a SAT problem which typically ak the quetio Doe a truth aigmet eit with property X?. If you maage to fid i time polyomial a limited et of aigmet which are the oly oe to fulfill a eceary coditio of property X the they form the oly certificate which eed to be teted o property X, ad the whole proce i doe efficietly. I the followig I will formulate coditio which allow to determie uch a limited et for certai SAT problem. The criterio ca be evaluated i time polyomial ad be ued to determie a give itace a eay with repect to the problem coidered. Notatio. A Boolea formula i Couctive ormal form CN by defiitio i a couctio of claue, where each claue i a diuctio of literal. A literal i a occurrece of a Boolea variable (atom, baic variable) or it ivere/egative/egated. The Table lit ome parameter by which a geeral CN formula may be characterized, though ot completely. m umber of claue umber of variable k umber of literal i claue C p p p occurrece of atom a (alo called degree, frequecy or appearace ) = um of egative (egated) ad poitive (uegated) literal of variety m umber of claue C, for which k = umber of atom a, for which p = N N + N - total umber of literal umber of poitive literal umber of egative literal The followig relatio hold for CN epreio i term of the above quatitie. m m ; N N N p k m m
3 3 I the followig we ue the term { k, p} m SAT itace or { k, p} m CN for a Boolea CN epreio with m claue, variable ad o more tha k literal per claue ad o more tha p occurrece per variable. By droppig the prefi we idicate that the epreio ha eactly k literal /p occurrece per claue/variable. Itace without pure literal, i.e. p p 0 for all N will be called completely mied. Note that eact epreio, i.e. { r, r} or { r, r} ( m, m ) ( m, m) - CN automatically are. { rr, } mm - CN, due to m= ad the relatio m The followig commoly ued term are pecial cae: A 3SAT itace i a Boolea epreio i CN with k =3 for all claue,,2,..., m, i.e. a {3, } m p SAT itace. A READ-3 SAT itace i a Boolea CN epreio i which all variable have degree 3 or le, i.e. a {, 3} m k SAT itace. Ay { k, p} m ( ', ') SAT itace ca be traformed to a {3, p} m SAT itace without lo of atifiability ad i polyomial time. Likewie it i poible to traform ay { k, p} m SAT itace to a eact READ-3 CN, i.e. a {,3} m ( ', ') k SAT itace. Combiig both reductio lead to a ( ", ") { 3,3} m ( ", ") SAT or a {3, 4} m SAT itace i the bet cae. No way from a arbitrary CN formula lead to a CN with eactly 3 literal per claue ad o more tha 3 occurrece of each variable. Tovey oticed that i thi ee the {3, 4} m SAT problem i the mallet NP- complete atifiability problem. I fact, ay {r, r} m SAT itace i atifiable ad thu trivial i a way [2]. The proof ue Hall theorem [3]. The PART-SAT problem. We ow defie a cla of atifiability problem by Defiitio PART-SAT: Let k p {, } m - CN, ad let i {0,.,..,m} i {0,,..., k} be a partitio of m, i.e. m 0... k. Doe a truth aigmet eit uch that may claue cotai eactly true literal each? To relate the problem to the pecific partitio we will alo ue the otatio { } SAT. A a eample et 0 for all ecept, i.e. m, {0,m,0,0} SAT coicide with -i-3sat. ad retrict to {3, p} m - CN. The
4 4 A a further eample let agai be {3, p} m ad et 0 for all ecept ad 2. The decidig {0,, 2,0} SAT for all pair 2 m i equivalet to decidig NOT-ALL-EQUAL-3SAT. Oe ca alo ue PART-SAT to ivetigate the quetio whether certai CN epreio have aigmet which leave a give umber of claue uatified, 0 0. The criterio. The cetral criterio for idetifyig p. t. SAT problem i the followig Theorem If { } SAT i retricted to oe of two ubet of CN epreio, either k ( m, ) { k, p} mi( p, p ) or k ( m, ) { k, p} ma( p, p ), it i decidable i time polyomial time 2, where i the umber of variable with p p. A a corollary to the theorem we ca tate, that - SAT i decidable i time polyomial, if itace are retricted to formula for which equal either the miimum or the maimum umber of literal which ca be aiged true, ad for which o variable occur i equal umber of poitive ad egative literal. Sum atifiability ad proof of theorem. or ay CN itace with m claue, atom ad literal l, ad ay truth aigmet T :{atom,atom,...,atom } {0,}, umbered by {, } a defied i [4], we defie the um 2 atifiability a the total of true literal uder aigmet T : m ( ) T ( l ). A a double um it ca be evaluated either by ummig over claue or over variable firt: ( ) ( ) ( ) var iable claue i a obviou otatio. A a ide remark we tate, that for a eact READ-3 CN, { k,3} m, i a particularly imple quatity, becaue i thi cae the characteritic fuctio implifie to () p p ( ) : 2 e 2 (e e ) { }
5 5 where ( ) e {(e ) / 2} (2coh ) p p i the umber of pure variable. Thu for completely mied eact READ-3 formula ( p 0 ) follow a biomial ditributio, ad coequetly the umber of aigmet T uder which () evaluate to k i. k We ow retur to the geeral cae. To prove the theorem coider the circumtace of { }-SAT. If there i a aigmet 0 with the deired property the it mut belog to a et of aigmet which fulfill ( ) accordig to the defiitio of the um atifiability. Quite geerally ha a miimum ad maimum value with repect to all aigmet: : mi ( ) mi( p, p ) mi : ma ( ) ma( p, p ) ma The miimum ad maimum tate are degeerate if there are variable with p p, the degeeracy beig 2, if deote the umber of variable with p p. If p p for all variable the there i eactly oe aigmet mi/ma for which ( mi/ma ) mi/ma hold, amely mi/ma, ( / )g( p p), repectively. If there were more tha oe uch aigmet it ecearily would lead to a reductio of (i cae of maimum) or a ehacemet (i cae of miimum). Therefore, if i retricted to the ubet mi( p, p ), the there i ut oe mi aigmet with thi property, ecept for the p p degeeracy which lead to a factor 2 for the allowed aigmet. Determiig mi/ma i a imple coutig procedure, workig through the variable. Thu the problem ca be decided i the tated umber of tep., of The ame lie of argumet work for { k, p} m retricted to ma( p, p ) coure. Illutrative eample. The -i-3sat problem wa proved to be NP-complete by Schaefer a a pecial cae of Schaefer' dichotomy theorem [5]. Similarly we ca argue that the -i-ksat problem, i.e. the ame problem without retrictio o the umber of literal per claue, i NP-hard, a well. With the help of the theorem it i poible to idetify a ubcla of CN itace for which the problem ca be decided i
6 6 polyomial time. or -i-3sat, or more geerally -i-ksat m mut be fulfilled, becaue eactly oe true literal per claue i required. Thu, accordig to the theorem, for { k, p} m with either m mi( p, p) or m ma( p, p) ad p p compleity cla P. for all -i-ksat i i Take a a illutratio the formula ( a, c)( a, b, c,e)( a, b, e)( b, d,e)( b,d, e )(b,d). Determiig the miimum of the um atifiability i a imple coutig proce. To make thi proce more clearly arraged we ue a otatio i term of the adacecy matri cheme, ee [4] for detail. I thi otatio row repreet claue ad colum variable. A cro (ot to be cofued with the aigmet ide!) at poitio (,) tad for a poitive literal of variety i claue, for a egative. 0 at poitio (,) i the matri cheme idicate that variable doe ot appear i claue. The aforemetioed eample the read I thi repreetatio it i immediately clear that variable c ha oe poitive ad oe egative literal. Thu there are two aigmet which miimize, amely (-,,,-,-) ad (-,,-,-,-). Each mut be checked agait each claue to determie whether it lead to eactly true literal. Oly the firt aigmet pae thi tet, the ecod coflict already with the firt claue. Oe may retrict the allowed epreio further to completely mied eact READ-3 formula. Thi way oe get rid of degeerate variable with p p. The mi ad the oly o-trivial cadidate for -i-ksat epreio which are i P are itace with m 3. We call uch epreio quare for obviou reao. The followig itace are illutratio of uch quare CN =
7 7 All three itace are atifiable. But ot all are -i-3sat epreio. The oly aigmet which miimize i =(-,,,-,-). But it doe ot atify claue 2. Thu there i o aigmet that give oe true literal per claue. Sice 0 2m alo {0,0,m,0} - SAT ca be checked with ma ut oe aigmet, amely (,-,-,,). It fail to achieve 2 true literal i the firt claue. or 2, mi (,,,,,, ) which violate claue 2. Wherea the ame mi obviouly lead to eactly oe true aigmet i each claue for itace 3. Alo the awer to the {0,0,m,0} - SAT problem i poitive ow. Agai, m ad ma (,,...,) i the oly aigmet to 2 3 ma be checked. A look at the matri cheme reveal that ettig all aigmet to true ideed lead to the deired reult. A a further illutratio coider the PART-SAT problem {0, m,0,...,0} SAT ad {0,0, m,...,0} SAT retricted to {3, p} m, ad write mi/ma a follow ( N p p ) mi 2 ( N p p ). ma 2 or eact 3-CN N 3m hold ad both PART-SAT problem are efficietly olvable for all which fulfill m p p ad have o degeerate variable. Obviouly all quare completely mied {3,3} mm a dicued before belog to thi cla (ee formula 2 ad 3 ). A le ymmetric eample would be The aigmet to be checked are (-,,-,) for the -i-3sat problem, ad (,-,,-) for the 2-i 3-SAT problem. Both fail to meet the requiremet. A eample where the criterio doe ot idetify ay eay itace at all i the 2/2/4-SAT problem decribed i []. Oe earche for aigmet which have eactly two true literal i each claue of a quare {4, 4} mm - CN, where variable with occurrece 4 have two poitive ad two egative literal. Accordig to [] the problem i NP-complete. The followig two itace erve a a illutratio for m=5 ad m=6:
8 Thi i a cae where miimum ad maimum value of the um atifiability coicide: 2 2m. O the other had we are dealig with the PART-SAT problem mi ma {0,0,2,0,0} SAT ad two true literal per claue mea 2m. Thu the aumptio of the theorem are fulfilled. But the degeeracy i maimal ow, m. So all 2 aigmet are cadidate to be teted i priciple. I fact, for the m=5 itace there are two aigmet with the required property, amely (-,,,,)=(fale, true, true, true, true) ad it egatio. Alo NOT-ALL-Equal-SAT (NAE-SAT) ca ot be implified with the help of the theorem. NAE-SAT ak for aigmet which lead to at leat oe true ad oe fale literal i each claue. If the et of allowed itace i retricted to {3,3} m - CN, the earched for aigmet mut deliver either oe or two true literal per claue, ad thu NAE-SAT i equivalet to decidig {0,, m,0 } SAT for all 0,,...,m. Thi i priciple i a O( 2 m ) tak. Thi problem ca alo be put the followig way. Sice for eact 3-CN the umber of true literal i claue ca oly take value or 2 for NAE-aigmet, which i equivalet to (3 ) 2, the equatio 2 3 ( ) ( ) 2 m i a eceary coditio for aigmet which olve the NAE-3SAT problem. I term of adacecy matri elemet the coditio may be writte: m 0 with f f, ' ' ' ' ' Ay NAE aigmet i to be foud amog the olutio of thi equatio. Although the ' are eaily calculated i p.t. for ay give 3-CN, there i i geeral o efficiet way to determie the allowed. Note that the imilar equatio which determie the atifyig aigmet of the regular 3SAT problem cotai additioal term, liear ad triliear i, [4]. Though 3SAT ad NAE-SAT belog to the ame compleity cla NP, oe i tempted to ay that NAE-3SAT - although it impoe troger coditio tha 3SAT - i omewhat eaier tha 3SAT, ice it lack the triliear term.
9 9 Cocluio. I have derived criteria for Boolea CN formula to be eay itace for a cla of SAT-problem, termed PART-SAT. PART-SAT ak for aigmet which geerate eactly true literal i claue, ad m, the total umber of claue. The criterio tate that a itace i decidable i time polyomial (time a degeeracy factor, if there are variable with p p ) i.e. eay with repect to the problem poed provided maimum value of the total of true literal, mi/ma equal either the miimum or. Thi latter quatity ca be determied i liear time due to the additivity of i both claue ad variable. I geeral, it i difficult to ue thi electio criterio to igle out a imply defiable cla of epreio a PART-SAT- eay, i.e. a a cadidate for P-compleity. I cae of -i-3sat or more geerally l-i-ksat with l k which are pecial cae of PART-SAT, uch a imple cla could be idetified, amely the cla of quare, completely mied READ-3 formula. Neverthele, oe ca alway check idividual itace o eaie with repect to a give PART-SAT problem. The hope i to eae the earch for hard itace via thi complemetary tool, too. Referece. [] ee e.g. Ha Kleie Büig, Theodor Lettma: Propoitioal Logic: Deductio ad Algorithm. [2] Craig A. Tovey: A Simplified NP-Complete Satifiability Problem; Dicrete Applied Mathematic 8 (984) [3] P. Hall: O repreetatio of ubet, J. Lodo Math. Sot. 0 (935) [4] Schuh, Berd R.: SAT for pedetria, arxiv: [c.cc]. [5] Schaefer, Thoma J. (978): The compleity of atifiability problem (PD). Proceedig of the 0th Aual ACM Sympoium o Theory of Computig. Sa Diego, Califoria. pp
Sub-exponential Upper Bound for #XSAT of some CNF Classes
Su-expoetial Upper Boud for #XSAT of ome CN Clae Berd R. Schuh Dr. Berd Schuh, D-5968 Köl, Germay; erd.chuh@etcologe.de eyword: complexity, atifiaility, SAT, XSAT, #XSAT, propoitioal logic Atract. We derive
More informationLECTURE 13 SIMULTANEOUS EQUATIONS
NOVEMBER 5, 26 Demad-upply ytem LETURE 3 SIMULTNEOUS EQUTIONS I thi lecture, we dicu edogeeity problem that arie due to imultaeity, i.e. the left-had ide variable ad ome of the right-had ide variable are
More informationState space systems analysis
State pace ytem aalyi Repreetatio of a ytem i tate-pace (tate-pace model of a ytem To itroduce the tate pace formalim let u tart with a eample i which the ytem i dicuio i a imple electrical circuit with
More informationComments on Discussion Sheet 18 and Worksheet 18 ( ) An Introduction to Hypothesis Testing
Commet o Dicuio Sheet 18 ad Workheet 18 ( 9.5-9.7) A Itroductio to Hypothei Tetig Dicuio Sheet 18 A Itroductio to Hypothei Tetig We have tudied cofidece iterval for a while ow. Thee are method that allow
More informationSOLUTION: The 95% confidence interval for the population mean µ is x ± t 0.025; 49
C22.0103 Sprig 2011 Homework 7 olutio 1. Baed o a ample of 50 x-value havig mea 35.36 ad tadard deviatio 4.26, fid a 95% cofidece iterval for the populatio mea. SOLUTION: The 95% cofidece iterval for the
More informationChapter 9. Key Ideas Hypothesis Test (Two Populations)
Chapter 9 Key Idea Hypothei Tet (Two Populatio) Sectio 9-: Overview I Chapter 8, dicuio cetered aroud hypothei tet for the proportio, mea, ad tadard deviatio/variace of a igle populatio. However, ofte
More informationSTA 4032 Final Exam Formula Sheet
Chapter 2. Probability STA 4032 Fial Eam Formula Sheet Some Baic Probability Formula: (1) P (A B) = P (A) + P (B) P (A B). (2) P (A ) = 1 P (A) ( A i the complemet of A). (3) If S i a fiite ample pace
More informationWe will look for series solutions to (1) around (at most) regular singular points, which without
ENM 511 J. L. Baai April, 1 Frobeiu Solutio to a d order ODE ear a regular igular poit Coider the ODE y 16 + P16 y 16 + Q1616 y (1) We will look for erie olutio to (1) aroud (at mot) regular igular poit,
More informationx z Increasing the size of the sample increases the power (reduces the probability of a Type II error) when the significance level remains fixed.
] z-tet for the mea, μ If the P-value i a mall or maller tha a pecified value, the data are tatitically igificat at igificace level. Sigificace tet for the hypothei H 0: = 0 cocerig the ukow mea of a populatio
More informationu t u 0 ( 7) Intuitively, the maximum principles can be explained by the following observation. Recall
Oct. Heat Equatio M aximum priciple I thi lecture we will dicu the maximum priciple ad uiquee of olutio for the heat equatio.. Maximum priciple. The heat equatio alo ejoy maximum priciple a the Laplace
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 16 11/04/2013. Ito integral. Properties
MASSACHUSES INSIUE OF ECHNOLOGY 6.65/15.7J Fall 13 Lecture 16 11/4/13 Ito itegral. Propertie Cotet. 1. Defiitio of Ito itegral. Propertie of Ito itegral 1 Ito itegral. Exitece We cotiue with the cotructio
More informationGeneralized Likelihood Functions and Random Measures
Pure Mathematical Sciece, Vol. 3, 2014, o. 2, 87-95 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/pm.2014.437 Geeralized Likelihood Fuctio ad Radom Meaure Chrito E. Koutzaki Departmet of Mathematic
More informationOn the Positive Definite Solutions of the Matrix Equation X S + A * X S A = Q
The Ope Applied Mathematic Joural 011 5 19-5 19 Ope Acce O the Poitive Defiite Solutio of the Matrix Equatio X S + A * X S A = Q Maria Adam * Departmet of Computer Sciece ad Biomedical Iformatic Uiverity
More information10-716: Advanced Machine Learning Spring Lecture 13: March 5
10-716: Advaced Machie Learig Sprig 019 Lecture 13: March 5 Lecturer: Pradeep Ravikumar Scribe: Charvi Ratogi, Hele Zhou, Nicholay opi Note: Lae template courtey of UC Berkeley EECS dept. Diclaimer: hee
More informationStatistical Inference Procedures
Statitical Iferece Procedure Cofidece Iterval Hypothei Tet Statitical iferece produce awer to pecific quetio about the populatio of iteret baed o the iformatio i a ample. Iferece procedure mut iclude a
More informationREVIEW OF SIMPLE LINEAR REGRESSION SIMPLE LINEAR REGRESSION
REVIEW OF SIMPLE LINEAR REGRESSION SIMPLE LINEAR REGRESSION I liear regreio, we coider the frequecy ditributio of oe variable (Y) at each of everal level of a ecod variable (X). Y i kow a the depedet variable.
More informationFig. 1: Streamline coordinates
1 Equatio of Motio i Streamlie Coordiate Ai A. Soi, MIT 2.25 Advaced Fluid Mechaic Euler equatio expree the relatiohip betwee the velocity ad the preure field i ivicid flow. Writte i term of treamlie coordiate,
More informationM227 Chapter 9 Section 1 Testing Two Parameters: Means, Variances, Proportions
M7 Chapter 9 Sectio 1 OBJECTIVES Tet two mea with idepedet ample whe populatio variace are kow. Tet two variace with idepedet ample. Tet two mea with idepedet ample whe populatio variace are equal Tet
More informationApplied Mathematical Sciences, Vol. 9, 2015, no. 3, HIKARI Ltd,
Applied Mathematical Sciece Vol 9 5 o 3 7 - HIKARI Ltd wwwm-hiaricom http://dxdoiorg/988/am54884 O Poitive Defiite Solutio of the Noliear Matrix Equatio * A A I Saa'a A Zarea* Mathematical Sciece Departmet
More informationGeneralized Fibonacci Like Sequence Associated with Fibonacci and Lucas Sequences
Turkih Joural of Aalyi ad Number Theory, 4, Vol., No. 6, 33-38 Available olie at http://pub.ciepub.com/tjat//6/9 Sciece ad Educatio Publihig DOI:.69/tjat--6-9 Geeralized Fiboacci Like Sequece Aociated
More informationOn the Signed Domination Number of the Cartesian Product of Two Directed Cycles
Ope Joural of Dicrete Mathematic, 205, 5, 54-64 Publihed Olie July 205 i SciRe http://wwwcirporg/oural/odm http://dxdoiorg/0426/odm2055005 O the Siged Domiatio Number of the Carteia Product of Two Directed
More informationON THE SCALE PARAMETER OF EXPONENTIAL DISTRIBUTION
Review of the Air Force Academy No. (34)/7 ON THE SCALE PARAMETER OF EXPONENTIAL DISTRIBUTION Aca Ileaa LUPAŞ Military Techical Academy, Bucharet, Romaia (lua_a@yahoo.com) DOI:.96/84-938.7.5..6 Abtract:
More informationOn the 2-Domination Number of Complete Grid Graphs
Ope Joural of Dicrete Mathematic, 0,, -0 http://wwwcirporg/oural/odm ISSN Olie: - ISSN Prit: - O the -Domiatio Number of Complete Grid Graph Ramy Shahee, Suhail Mahfud, Khame Almaea Departmet of Mathematic,
More informationHeat Equation: Maximum Principles
Heat Equatio: Maximum Priciple Nov. 9, 0 I thi lecture we will dicu the maximum priciple ad uiquee of olutio for the heat equatio.. Maximum priciple. The heat equatio alo ejoy maximum priciple a the Laplace
More informationErick L. Oberstar Fall 2001 Project: Sidelobe Canceller & GSC 1. Advanced Digital Signal Processing Sidelobe Canceller (Beam Former)
Erick L. Obertar Fall 001 Project: Sidelobe Caceller & GSC 1 Advaced Digital Sigal Proceig Sidelobe Caceller (Beam Former) Erick L. Obertar 001 Erick L. Obertar Fall 001 Project: Sidelobe Caceller & GSC
More informationExplicit scheme. Fully implicit scheme Notes. Fully implicit scheme Notes. Fully implicit scheme Notes. Notes
Explicit cheme So far coidered a fully explicit cheme to umerically olve the diffuio equatio: T + = ( )T + (T+ + T ) () with = κ ( x) Oly table for < / Thi cheme i ometime referred to a FTCS (forward time
More informationELEC 372 LECTURE NOTES, WEEK 4 Dr. Amir G. Aghdam Concordia University
ELEC 37 LECTURE NOTES, WEE 4 Dr Amir G Aghdam Cocordia Uiverity Part of thee ote are adapted from the material i the followig referece: Moder Cotrol Sytem by Richard C Dorf ad Robert H Bihop, Pretice Hall
More informationSociété de Calcul Mathématique, S. A. Algorithmes et Optimisation
Société de Calcul Mathématique S A Algorithme et Optimiatio Radom amplig of proportio Berard Beauzamy Jue 2008 From time to time we fid a problem i which we do ot deal with value but with proportio For
More informationTESTS OF SIGNIFICANCE
TESTS OF SIGNIFICANCE Seema Jaggi I.A.S.R.I., Library Aveue, New Delhi eema@iari.re.i I applied ivetigatio, oe i ofte itereted i comparig ome characteritic (uch a the mea, the variace or a meaure of aociatio
More informationSTRONG DEVIATION THEOREMS FOR THE SEQUENCE OF CONTINUOUS RANDOM VARIABLES AND THE APPROACH OF LAPLACE TRANSFORM
Joural of Statitic: Advace i Theory ad Applicatio Volume, Number, 9, Page 35-47 STRONG DEVIATION THEORES FOR THE SEQUENCE OF CONTINUOUS RANDO VARIABLES AND THE APPROACH OF LAPLACE TRANSFOR School of athematic
More informationZeta-reciprocal Extended reciprocal zeta function and an alternate formulation of the Riemann hypothesis By M. Aslam Chaudhry
Zeta-reciprocal Eteded reciprocal zeta fuctio ad a alterate formulatio of the Riema hypothei By. Alam Chaudhry Departmet of athematical Sciece, Kig Fahd Uiverity of Petroleum ad ieral Dhahra 36, Saudi
More informationVIII. Interval Estimation A. A Few Important Definitions (Including Some Reminders)
VIII. Iterval Etimatio A. A Few Importat Defiitio (Icludig Some Remider) 1. Poit Etimate - a igle umerical value ued a a etimate of a parameter.. Poit Etimator - the ample tatitic that provide the poit
More informationA Tail Bound For Sums Of Independent Random Variables And Application To The Pareto Distribution
Applied Mathematic E-Note, 9009, 300-306 c ISSN 1607-510 Available free at mirror ite of http://wwwmaththuedutw/ ame/ A Tail Boud For Sum Of Idepedet Radom Variable Ad Applicatio To The Pareto Ditributio
More informationFurther Investigation of alternative Formulation of RP Model with Response Error. Ed Stanek
Further vetigatio of alterative Formulatio of RP odel with Repoe Error Ed Staek TRODCTO We explore the predictor that will reult i a imple radom ample with repoe error whe a differet model i potulated
More informationLast time: Completed solution to the optimum linear filter in real-time operation
6.3 tochatic Etimatio ad Cotrol, Fall 4 ecture at time: Completed olutio to the oimum liear filter i real-time operatio emi-free cofiguratio: t D( p) F( p) i( p) dte dp e π F( ) F( ) ( ) F( p) ( p) 4444443
More informationEECE 301 Signals & Systems Prof. Mark Fowler
EECE 30 Sigal & Sytem Prof. Mark Fowler Note Set #8 C-T Sytem: Laplace Traform Solvig Differetial Equatio Readig Aigmet: Sectio 6.4 of Kame ad Heck / Coure Flow Diagram The arrow here how coceptual flow
More informationRecurrence Relations
Recurrece Relatios Aalysis of recursive algorithms, such as: it factorial (it ) { if (==0) retur ; else retur ( * factorial(-)); } Let t be the umber of multiplicatios eeded to calculate factorial(). The
More informationIsolated Word Recogniser
Lecture 5 Iolated Word Recogitio Hidde Markov Model of peech State traitio ad aligmet probabilitie Searchig all poible aligmet Dyamic Programmig Viterbi Aligmet Iolated Word Recogitio 8. Iolated Word Recogier
More informationCOMPARISONS INVOLVING TWO SAMPLE MEANS. Two-tail tests have these types of hypotheses: H A : 1 2
Tetig Hypothee COMPARISONS INVOLVING TWO SAMPLE MEANS Two type of hypothee:. H o : Null Hypothei - hypothei of o differece. or 0. H A : Alterate Hypothei hypothei of differece. or 0 Two-tail v. Oe-tail
More informationBrief Review of Linear System Theory
Brief Review of Liear Sytem heory he followig iformatio i typically covered i a coure o liear ytem theory. At ISU, EE 577 i oe uch coure ad i highly recommeded for power ytem egieerig tudet. We have developed
More informationProduction Scheduling with Genetic Algorithm
Productio Schedulig with Geetic Algorithm Áko Gubá 1, Mikló Gubá 2 1 college profeor, head of departmet, Departmet of Iformatio Sciece ad Techology, Budapet Buie School 2 college profeor, head of ititute,
More informationLecture 2 Clustering Part II
COMS 4995: Usupervised Learig (Summer 8) May 24, 208 Lecture 2 Clusterig Part II Istructor: Nakul Verma Scribes: Jie Li, Yadi Rozov Today, we will be talkig about the hardess results for k-meas. More specifically,
More informationa 1 = 1 a a a a n n s f() s = Σ log a 1 + a a n log n sup log a n+1 + a n+2 + a n+3 log n sup () s = an /n s s = + t i
0 Dirichlet Serie & Logarithmic Power Serie. Defiitio & Theorem Defiitio.. (Ordiary Dirichlet Serie) Whe,a,,3, are complex umber, we call the followig Ordiary Dirichlet Serie. f() a a a a 3 3 a 4 4 Note
More informationQuestions about the Assignment. Describing Data: Distributions and Relationships. Measures of Spread Standard Deviation. One Quantitative Variable
Quetio about the Aigmet Read the quetio ad awer the quetio that are aked Experimet elimiate cofoudig variable Decribig Data: Ditributio ad Relatiohip GSS people attitude veru their characteritic ad poue
More informationDISCRETE MELLIN CONVOLUTION AND ITS EXTENSIONS, PERRON FORMULA AND EXPLICIT FORMULAE
DISCRETE MELLIN CONVOLUTION AND ITS EXTENSIONS, PERRON FORMULA AND EXPLICIT FORMULAE Joe Javier Garcia Moreta Graduate tudet of Phyic at the UPV/EHU (Uiverity of Baque coutry) I Solid State Phyic Addre:
More information13.4 Scalar Kalman Filter
13.4 Scalar Kalma Filter Data Model o derive the Kalma filter we eed the data model: a 1 + u < State quatio > + w < Obervatio quatio > Aumptio 1. u i zero mea Gauia, White, u } σ. w i zero mea Gauia, White,
More informationCHAPTER 6. Confidence Intervals. 6.1 (a) y = 1269; s = 145; n = 8. The standard error of the mean is = s n = = 51.3 ng/gm.
} CHAPTER 6 Cofidece Iterval 6.1 (a) y = 1269; = 145; = 8. The tadard error of the mea i SE ȳ = = 145 8 = 51.3 g/gm. (b) y = 1269; = 145; = 30. The tadard error of the mea i ȳ = 145 = 26.5 g/gm. 30 6.2
More informationUNIVERSITY OF CALICUT
Samplig Ditributio 1 UNIVERSITY OF CALICUT SCHOOL OF DISTANCE EDUCATION BSc. MATHEMATICS COMPLEMENTARY COURSE CUCBCSS 2014 Admiio oward III Semeter STATISTICAL INFERENCE Quetio Bak 1. The umber of poible
More informationFractional parts and their relations to the values of the Riemann zeta function
Arab. J. Math. (08) 7: 8 http://doi.org/0.007/40065-07-084- Arabia Joural of Mathematic Ibrahim M. Alabdulmohi Fractioal part ad their relatio to the value of the Riema zeta fuctio Received: 4 Jauary 07
More informationNew integral representations. . The polylogarithm function
New itegral repreetatio of the polylogarithm fuctio Djurdje Cvijović Atomic Phyic Laboratory Viča Ititute of Nuclear Sciece P.O. Box 5 Belgrade Serbia. Abtract. Maximo ha recetly give a excellet ummary
More informationTI-83/84 Calculator Instructions for Math Elementary Statistics
TI-83/84 Calculator Itructio for Math 34- Elemetary Statitic. Eterig Data: Data oit are tored i Lit o the TI-83/84. If you have't ued the calculator before, you may wat to erae everythig that wa there.
More informationAssignment 1 - Solutions. ECSE 420 Parallel Computing Fall November 2, 2014
Aigmet - Solutio ECSE 420 Parallel Computig Fall 204 ovember 2, 204. (%) Decribe briefly the followig term, expoe their caue, ad work-aroud the idutry ha udertake to overcome their coequece: (i) Memory
More informationSTUDENT S t-distribution AND CONFIDENCE INTERVALS OF THE MEAN ( )
STUDENT S t-distribution AND CONFIDENCE INTERVALS OF THE MEAN Suppoe that we have a ample of meaured value x1, x, x3,, x of a igle uow quatity. Aumig that the meauremet are draw from a ormal ditributio
More informationOn The Computation Of Weighted Shapley Values For Cooperative TU Games
O he Computatio Of Weighted hapley Value For Cooperative U Game Iriel Draga echical Report 009-0 http://www.uta.edu/math/preprit/ Computatio of Weighted hapley Value O HE COMPUAIO OF WEIGHED HAPLEY VALUE
More informationStatistics and Chemical Measurements: Quantifying Uncertainty. Normal or Gaussian Distribution The Bell Curve
Statitic ad Chemical Meauremet: Quatifyig Ucertaity The bottom lie: Do we trut our reult? Should we (or ayoe ele)? Why? What i Quality Aurace? What i Quality Cotrol? Normal or Gauia Ditributio The Bell
More informationA tail bound for sums of independent random variables : application to the symmetric Pareto distribution
A tail boud for um of idepedet radom variable : applicatio to the ymmetric Pareto ditributio Chritophe Cheeau To cite thi verio: Chritophe Cheeau. A tail boud for um of idepedet radom variable : applicatio
More informationMath 155 (Lecture 3)
Math 55 (Lecture 3) September 8, I this lecture, we ll cosider the aswer to oe of the most basic coutig problems i combiatorics Questio How may ways are there to choose a -elemet subset of the set {,,,
More informationPRIMARY DECOMPOSITION, ASSOCIATED PRIME IDEALS AND GABRIEL TOPOLOGY
Orietal J. ath., Volue 1, Nuber, 009, Page 101-108 009 Orietal Acadeic Publiher PRIARY DECOPOSITION, ASSOCIATED PRIE IDEALS AND GABRIEL TOPOLOGY. EL HAJOUI, A. IRI ad A. ZOGLAT Uiverité ohaed V aculté
More informationChapter 1 Econometrics
Chapter Ecoometric There are o exercie or applicatio i Chapter. 0 Pearo Educatio, Ic. Publihig a Pretice Hall Chapter The Liear Regreio Model There are o exercie or applicatio i Chapter. 0 Pearo Educatio,
More information8.6 Order-Recursive LS s[n]
8.6 Order-Recurive LS [] Motivate ti idea wit Curve Fittig Give data: 0,,,..., - [0], [],..., [-] Wat to fit a polyomial to data.., but wic oe i te rigt model?! Cotat! Quadratic! Liear! Cubic, Etc. ry
More informationCALCULATION OF FIBONACCI VECTORS
CALCULATION OF FIBONACCI VECTORS Stuart D. Aderso Departmet of Physics, Ithaca College 953 Daby Road, Ithaca NY 14850, USA email: saderso@ithaca.edu ad Dai Novak Departmet of Mathematics, Ithaca College
More informationAxioms of Measure Theory
MATH 532 Axioms of Measure Theory Dr. Neal, WKU I. The Space Throughout the course, we shall let X deote a geeric o-empty set. I geeral, we shall ot assume that ay algebraic structure exists o X so that
More informationChapter IV Integration Theory
Chapter IV Itegratio Theory Lectures 32-33 1. Costructio of the itegral I this sectio we costruct the abstract itegral. As a matter of termiology, we defie a measure space as beig a triple (, A, µ), where
More information20. CONFIDENCE INTERVALS FOR THE MEAN, UNKNOWN VARIANCE
20. CONFIDENCE INTERVALS FOR THE MEAN, UNKNOWN VARIANCE If the populatio tadard deviatio σ i ukow, a it uually will be i practice, we will have to etimate it by the ample tadard deviatio. Sice σ i ukow,
More informationMath 475, Problem Set #12: Answers
Math 475, Problem Set #12: Aswers A. Chapter 8, problem 12, parts (b) ad (d). (b) S # (, 2) = 2 2, sice, from amog the 2 ways of puttig elemets ito 2 distiguishable boxes, exactly 2 of them result i oe
More informationObject Matching with a Locally Affine Invariant. Hongsheng Li Dept. of CSE, Lehigh University Feb. 17th, 2011
Object Matchig with a Locall Affie Ivariat Hogheg Li Dept. of SE, Lehigh Uiverit Feb. 7th, 2 Outlie Backgroud Notatio ad Problem Formulatio A Locall Affie Ivariat Numerical Scheme Eperimet Dicuio ad ocluio
More informationWeak formulation and Lagrange equations of motion
Chapter 4 Weak formulatio ad Lagrage equatio of motio A mot commo approach to tudy tructural dyamic i the ue of the Lagrage equatio of motio. Thee are obtaied i thi chapter tartig from the Cauchy equatio
More information18.05 Problem Set 9, Spring 2014 Solutions
18.05 Problem Set 9, Sprig 2014 Solutio Problem 1. (10 pt.) (a) We have x biomial(, θ), o E(X) =θ ad Var(X) = θ(1 θ). The rule-of-thumb variace i jut 4. So the ditributio beig plotted are biomial(250,
More informationProblem Set 8 Solutions
Deign and Analyi of Algorithm April 29, 2015 Maachuett Intitute of Technology 6.046J/18.410J Prof. Erik Demaine, Srini Devada, and Nancy Lynch Problem Set 8 Solution Problem Set 8 Solution Thi problem
More informationw (1) ˆx w (1) x (1) /ρ and w (2) ˆx w (2) x (2) /ρ.
2 5. Weighted umber of late jobs 5.1. Release dates ad due dates: maximimizig the weight of o-time jobs Oce we add release dates, miimizig the umber of late jobs becomes a sigificatly harder problem. For
More informationIntroEcono. Discrete RV. Continuous RV s
ItroEcoo Aoc. Prof. Poga Porchaiwiekul, Ph.D... ก ก e-mail: Poga.P@chula.ac.th Homepage: http://pioeer.chula.ac.th/~ppoga (c) Poga Porchaiwiekul, Chulalogkor Uiverity Quatitative, e.g., icome, raifall
More informationTables and Formulas for Sullivan, Fundamentals of Statistics, 2e Pearson Education, Inc.
Table ad Formula for Sulliva, Fudametal of Statitic, e. 008 Pearo Educatio, Ic. CHAPTER Orgaizig ad Summarizig Data Relative frequecy frequecy um of all frequecie Cla midpoit: The um of coecutive lower
More informationMost text will write ordinary derivatives using either Leibniz notation 2 3. y + 5y= e and y y. xx tt t
Itroductio to Differetial Equatios Defiitios ad Termiolog Differetial Equatio: A equatio cotaiig the derivatives of oe or more depedet variables, with respect to oe or more idepedet variables, is said
More informationOn Certain Sums Extended over Prime Factors
Iteratioal Mathematical Forum, Vol. 9, 014, o. 17, 797-801 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.1988/imf.014.4478 O Certai Sum Exteded over Prime Factor Rafael Jakimczuk Diviió Matemática,
More informationThe Method of Least Squares. To understand least squares fitting of data.
The Method of Least Squares KEY WORDS Curve fittig, least square GOAL To uderstad least squares fittig of data To uderstad the least squares solutio of icosistet systems of liear equatios 1 Motivatio Curve
More informationSquare-Congruence Modulo n
Square-Cogruece Modulo Abstract This paper is a ivestigatio of a equivalece relatio o the itegers that was itroduced as a exercise i our Discrete Math class. Part I - Itro Defiitio Two itegers are Square-Cogruet
More informationResolution Proofs of Generalized Pigeonhole Principles
Resolutio Proofs of Geeralized Pigeohole Priciples Samuel R. Buss Departmet of Mathematics Uiversity of Califoria, Berkeley Győrgy Turá Departmet of Mathematics, Statistics, ad Computer Sciece Uiversity
More information3.1 Counting Principles
3.1 Coutig Priciples Goal: Cout the umber of objects i a set. Notatio: Whe S is a set, S deotes the umber of objects i the set. This is also called S s cardiality. Additio Priciple: Whe you wat to cout
More informationSection 7 Fundamentals of Sequences and Series
ectio Fudametals of equeces ad eries. Defiitio ad examples of sequeces A sequece ca be thought of as a ifiite list of umbers. 0, -, -0, -, -0...,,,,,,. (iii),,,,... Defiitio: A sequece is a fuctio which
More informationCHAPTER I: Vector Spaces
CHAPTER I: Vector Spaces Sectio 1: Itroductio ad Examples This first chapter is largely a review of topics you probably saw i your liear algebra course. So why cover it? (1) Not everyoe remembers everythig
More informationChapter 1 ASPECTS OF MUTIVARIATE ANALYSIS
Chapter ASPECTS OF MUTIVARIATE ANALYSIS. Itroductio Defiitio Wiipedia: Multivariate aalyi MVA i baed o the tatitical priciple of multivariate tatitic which ivolve obervatio ad aalyi of more tha oe tatitical
More informationSection 4.3. Boolean functions
Sectio 4.3. Boolea fuctios Let us take aother look at the simplest o-trivial Boolea algebra, ({0}), the power-set algebra based o a oe-elemet set, chose here as {0}. This has two elemets, the empty set,
More informationTHE CONCEPT OF THE ROOT LOCUS. H(s) THE CONCEPT OF THE ROOT LOCUS
So far i the tudie of cotrol yte the role of the characteritic equatio polyoial i deteriig the behavior of the yte ha bee highlighted. The root of that polyoial are the pole of the cotrol yte, ad their
More informationMTH 212 Formulas page 1 out of 7. Sample variance: s = Sample standard deviation: s = s
MTH Formula age out of 7 DESCRIPTIVE TOOLS Poulatio ize = N Samle ize = x x+ x +... + x x Poulatio mea: µ = Samle mea: x = = N ( µ ) ( x x) Poulatio variace: = Samle variace: = N Poulatio tadard deviatio:
More informationME 410 MECHANICAL ENGINEERING SYSTEMS LABORATORY REGRESSION ANALYSIS
ME 40 MECHANICAL ENGINEERING REGRESSION ANALYSIS Regreio problem deal with the relatiohip betwee the frequec ditributio of oe (depedet) variable ad aother (idepedet) variable() which i (are) held fied
More information(b) What is the probability that a particle reaches the upper boundary n before the lower boundary m?
MATH 529 The Boudary Problem The drukard s walk (or boudary problem) is oe of the most famous problems i the theory of radom walks. Oe versio of the problem is described as follows: Suppose a particle
More information100(1 α)% confidence interval: ( x z ( sample size needed to construct a 100(1 α)% confidence interval with a margin of error of w:
Stat 400, ectio 7. Large Sample Cofidece Iterval ote by Tim Pilachowki a Large-Sample Two-ided Cofidece Iterval for a Populatio Mea ectio 7.1 redux The poit etimate for a populatio mea µ will be a ample
More informationBINOMIAL PREDICTORS. + 2 j 1. Then n + 1 = The row of the binomial coefficients { ( n
BINOMIAL PREDICTORS VLADIMIR SHEVELEV arxiv:0907.3302v2 [math.nt] 22 Jul 2009 Abstract. For oegative itegers, k, cosider the set A,k = { [0, 1,..., ] : 2 k ( ). Let the biary epasio of + 1 be: + 1 = 2
More informationWeighted BMO Estimates for Commutators of Riesz Transforms Associated with Schrödinger Operator Wenhua GAO
Alied Mechaic ad Material Olie: -- ISSN: 66-748, Vol -6, 6-67 doi:48/wwwcietificet/amm-66 Tra Tech Publicatio, Switzerlad Weighted MO Etimate for ommutator of Riez Traform Aociated with Schrödiger Oerator
More informationM A T H F A L L CORRECTION. Algebra I 1 4 / 1 0 / U N I V E R S I T Y O F T O R O N T O
M A T H 2 4 0 F A L L 2 0 1 4 HOMEWORK ASSIGNMENT #4 CORRECTION Algebra I 1 4 / 1 0 / 2 0 1 4 U N I V E R S I T Y O F T O R O N T O P r o f e s s o r : D r o r B a r - N a t a Correctio Homework Assigmet
More informationContinuous Functions
Cotiuous Fuctios Q What does it mea for a fuctio to be cotiuous at a poit? Aswer- I mathematics, we have a defiitio that cosists of three cocepts that are liked i a special way Cosider the followig defiitio
More information6. Sufficient, Complete, and Ancillary Statistics
Sufficiet, Complete ad Acillary Statistics http://www.math.uah.edu/stat/poit/sufficiet.xhtml 1 of 7 7/16/2009 6:13 AM Virtual Laboratories > 7. Poit Estimatio > 1 2 3 4 5 6 6. Sufficiet, Complete, ad Acillary
More informationReliable Decentralized PID Stabilization of MIMO Systems
Proceedig of the 6 America Cotrol Coferece Mieapoli, Mieota, USA, Jue 4-6, 6 FrB.5 Reliable Decetralized PID Stabilizatio of MIMO Sytem A. N. Mete, A. N. Güdeş, ad A. N. Palazoğlu Abtract Sytematic method
More informationEULER-MACLAURIN SUM FORMULA AND ITS GENERALIZATIONS AND APPLICATIONS
EULER-MACLAURI SUM FORMULA AD ITS GEERALIZATIOS AD APPLICATIOS Joe Javier Garcia Moreta Graduate tudet of Phyic at the UPV/EHU (Uiverity of Baque coutry) I Solid State Phyic Addre: Practicate Ada y Grijalba
More informationPhysics 741 Graduate Quantum Mechanics 1 Solutions to Final Exam, Fall 2014
Phyic 7 Graduate Quantum Mechanic Solution to inal Eam all 0 Each quetion i worth 5 point with point for each part marked eparately Some poibly ueful formula appear at the end of the tet In four dimenion
More informationConfidence Intervals: Three Views Class 23, Jeremy Orloff and Jonathan Bloom
Cofidece Iterval: Three View Cla 23, 18.05 Jeremy Orloff ad Joatha Bloom 1 Learig Goal 1. Be able to produce z, t ad χ 2 cofidece iterval baed o the correpodig tadardized tatitic. 2. Be able to ue a hypothei
More informationTEACHER CERTIFICATION STUDY GUIDE
COMPETENCY 1. ALGEBRA SKILL 1.1 1.1a. ALGEBRAIC STRUCTURES Kow why the real ad complex umbers are each a field, ad that particular rigs are ot fields (e.g., itegers, polyomial rigs, matrix rigs) Algebra
More informationBINOMIAL COEFFICIENT AND THE GAUSSIAN
BINOMIAL COEFFICIENT AND THE GAUSSIAN The biomial coefficiet is defied as-! k!(! ad ca be writte out i the form of a Pascal Triagle startig at the zeroth row with elemet 0,0) ad followed by the two umbers,
More informationThe multiplicative structure of finite field and a construction of LRC
IERG6120 Codig for Distributed Storage Systems Lecture 8-06/10/2016 The multiplicative structure of fiite field ad a costructio of LRC Lecturer: Keeth Shum Scribe: Zhouyi Hu Notatios: We use the otatio
More informationThe picture in figure 1.1 helps us to see that the area represents the distance traveled. Figure 1: Area represents distance travelled
1 Lecture : Area Area ad distace traveled Approximatig area by rectagles Summatio The area uder a parabola 1.1 Area ad distace Suppose we have the followig iformatio about the velocity of a particle, how
More information