Computing First-Order Logic Programs by Fibring Artificial Neural Networks

Size: px
Start display at page:

Download "Computing First-Order Logic Programs by Fibring Artificial Neural Networks"

Transcription

1 Computig First-Order Logic Programs by Fibrig Artificial Neural Netorks Sebastia Bader Departmet of Computer Sciece Techische Uiversität Dresde Germay Artur S. d Avila Garcez Departmet of Computig City Uiversity Lodo UK Pascal Hitzler stitute AFB Uiversity of Karlsruhe Germay Abstract The itegratio of symbolic ad eural-etork-based artificial itelligece paradigms costitutes a very challegig area of research. The overall aim is to merge these to very differet major approaches to itelliget systems egieerig hile retaiig their respective stregths. For symbolic paradigms that use the sytax of some first-order laguage this appears to be particularly difficult. this paper, e ill exted o a idea proposed by Garcez ad Gabbay (2004) ad sho ho first-order logic programs ca be represeted by fibred eural etorks. The idea is to use a eural etork to iterate a global couter. For each clause C i i the logic program, this couter is combied (fibred) ith aother eural etork, hich determies hether C i outputs a atom of level for a give iterpretatio. As a result, the fibred etork approximates the sigle-step operator T P of the logic program, thus capturig the sematics of the program. troductio telliget systems based o artificial eural etorks differ substatially from those based o symbolic koledge processig like logic programmig. Neural etorks are traiable from ra data ad are robust, but practically impossible to read declaratively. Logic programs ca be implemeted from problem specificatios ad ca be highly recursive, hile lackig good traiig methods ad robustess, particularly he data are oisy (Thru & others 99). t is obvious that a itegratio of both paradigms ito sigle systems ould be very beeficiary if the respective stregths could be retaied. There exists a otable body of ork ivestigatig the itegratio of eural etorks ith propositioal or similarly fiitistic logic. We refer to (Broe & Su 200; d Avila Garcez, Broda, & Gabbay 2002) for overvies. For Sebastia Bader is supported by the GK334 of the Germa Research Foudatio. Artur Garcez is partly supported by The Nuffield Foudatio. Pascal Hitzler is supported by the Germa Federal Miistry of Educatio ad Research uder the SmartWeb project ad by the Europea Uio uder the KoledgeWeb Netork of Excellece. Copyright c 2005, America Associatio for Artificial telligece (.aaai.org). All rights reserved. first-order logic, hoever, it is much less clear ho a reasoable itegratio ca be achieved, ad there are systematic difficulties hich slo do recet research efforts, as spelled out i (Bader, Hitzler, & Hölldobler 2004). Differet techiques for overcomig these obstacles are curretly uder ivestigatio, icludig the use of metric spaces ad topology, ad of iterated fuctio systems (Hitzler, Hölldobler, & Seda 2004; Bader & Hitzler 2004). At the heart of these itegratio efforts is the questio of ho first-order koledge ca be represeted by eural etork architectures. this paper, e preset a ovel approach usig fibrig eural etorks as proposed by (d Avila Garcez & Gabbay 2004). For each clause C i of a logic program, a eural etork that iterates a couter is combied (fibred) ith aother eural etork, hich determies hether C i outputs a atom of level for a give iterpretatio. Fibrig offers a modular ay of performig complex fuctios by usig relatively simple etorks (modules) i a esemble. The paper is orgaized as follos. the ext sectio e briefly revie fibrig eural etorks ad logic programs. We the preset the fudametal ideas uderlyig our represetatio results, before givig the details of our implemetatio ad a orked example. We coclude ith some discussios. Prelimiaries We itroduce stadard termiology for artificial eural etorks, fibrig eural etorks, ad logic programs. We refer the reader to (Bishop 995; d Avila Garcez & Gabbay 2004; Lloyd 988), respectively, for further backgroud. Artificial Neural Netorks Artificial eural etorks cosist of simple computatioal uits (euros), hich receive real umbers as iputs via eighted coectios ad perform simple operatios: the eighted iputs are added ad simple fuctios like threshold, sigmoidal, idetity or trucate are applied to the sum. The euros are usually orgaized i layers. Neuros hich do ot receive iput from other euros are called iput euros, ad those ithout outgoig coectios to other euros are output euros. So a etork computes a fuctio from R to R m, here ad m are the umber of iput, respectively, output uits. A key to the success of

2 x[t] x2[t] x3[t] x[t] 2 3 θ Figure : A artificial euro (left) ad a simple fibrig etork (right) eural etork architectures rests o the fact that they ca be traied effectively usig traiig samples i the form of iput-output pairs. For coveiece, e make the folloig assumptios for the etorks depicted i this paper: The layers are updated sequetially from left to right ad ithi a layer the euros are updated from top to bottom. Recetly, (d Avila Garcez & Gabbay 2004) itroduced a e model of eural etorks, amely fibrig eural etorks. Briefly, the activatio of a certai uit may ifluece the behaviour of other uits by chagig their eights. Our particular architecture is a slight variat of the origial proposal, hich appears to be more atural for our purposes. Defiitio A fibrig fuctio i associated ith euro i maps some eights of the etork to e values, depedig o ad the iput x of euro i. Fibrig fuctios ca be uderstood as modelig presyaptic eights, hich play a importat role i biological eural etorks. Certaily, a ecessary requiremet for biological plausibility is that fibrig fuctios compute either simple fuctios or tasks hich ca i tur be performed by eural etorks. We ill retur to this poit later. Throughout this paper e ill use dashed lies, as i Figure, to idicate the eights hich may be chaged by some fibrig fuctio. As described above, e ill use a update dyamics from left to right, ad top to bottom. Ad, as soo as the activatio of a fibrig euro is (re)calculated, the correspodig fibrig fuctio is applied ad the respective eights are modified. Example 2 A simple fibrig etork for squarig umbers. Each ode computes the eighted sum of its iputs ad performs the operatio idetity o it. The fibrig fuctio takes iput x ad multiplies it by W. f W, the output ill be y x 2 : x y x[t+] : (, x) x Example 3 A simple fibrig etork implemetig a gatelike behaviour. Nodes behave as i Example 2: x z y : (, x) { if x > 0 0 otherise The questio of plausible types of fibrig fuctios, as ell as the computatioal poer of those etorks, ill be studied separately ad are touched here oly slightly. We ill start ith very geeral fibrig fuctios, but later e restrict ourselves to simple oes oly, e.g. the fibred eight is simply multiplied by the activatio. Sometimes e ill use the output of a euro istead of the activatio, or apply liear trasformatios to it, ad it is clear that such modificatios could also be achieved by addig aother euro to the etork ad use this for the fibrig. Therefore these modificatios ca be uderstood as abbreviatios to keep the etorks simple. Logic Programs A logic program is a fiite set of clauses H L L, here N may differ for each clause, H is a atom i a first order laguage L ad L,..., L are literals, that is, atoms or egated atoms, i L. The clauses of a program are uderstood as beig uiversally quatified. H is called the head of the clause, each L i is called a body literal ad their cojuctio L L is called the body of the clause. We allo 0, by a abuse of otatio, hich idicates that the body is empty; i this case the clause is called a uit clause or a fact. A atom, literal or clause is said to be groud if it does ot cotai variables, ad groud(p) deotes the groud istatiatio of the program P. The Herbrad base uderlyig a give program P is defied as the set of all groud istaces of atoms, deoted B P. Example 4 shos a logic program ad its correspodig Herbrad base. Subsets of the Herbrad base are called (Herbrad) iterpretatios of P, ad e ca thik of such a set as cotaiig those atoms hich are true uder the iterpretatio. The set P of all iterpretatios of a program P ca thus be idetified ith the poer set of B P. Example 4 The atural umbers program P, the uderlyig laguage L ad the correspodig Herbrad base B P. The iteded meaig of s is the successor fuctio: P : at(0). at(s(x)) at(x). L : costats: C {0} fuctios: F {s/} relatios: R {at/} B P : at(0), at(s(0)), at(s(s(0))),... Logic programs are accepted as a coveiet tool for koledge represetatio i logical form. Furthermore, the koledge represeted by a logic program P ca essetially be captured by the immediate cosequece or siglestep operator T P, hich is defied as a mappig o P here for ay P e have that T P () is the set of all H B P for hich there exists a groud istace H A A m B B of a clause i P such that for all i e have A i ad for all j e have

3 B j. Fixed poits of T P are called supported models of P, hich ca be uderstood to represet the declarative sematics of P. the sequel of this paper e ill ofte eed to eumerate the Herbrad base, hich is doe via level mappigs: Defiitio 5 Give a logic program P, a level mappig is a fuctio : B P N +, here N + deotes the set of positive itegers excludig zero. Level mappigs i slightly more geeral form are commoly used for cotrollig recursive depedecies betee atoms, ad the most promiet otio is probably the folloig. Defiitio 6 Let P be a logic program ad be a level mappig. f for all clauses A L L 2... L groud(p) ad all i e have that A > L i, the P is called acyclic ith respect to. A program is called acyclic, if there exists such a level mappig. Acyclic programs are ko to have uique supported models (Cavedo 99). The programs from Examples 4 ad 7 belo are acyclic. Example 7 The eve ad odd umbers program ad a level mappig: P : : eve(0). eve(s(x)) eve(x). odd(s(x)) eve(x). A { 2 + if A eve(s (0)) if A odd(s (0)) Throughout this paper e ill assume that level mappigs are bijective, i.e. for each N + there is exactly oe A B P, such that A. Thus, for the purposes of our paper, a level mappig is simply a eumeratio of the Herbrad base. Sice level mappigs iduce a order o the atoms, e ca use them to defie a prefix-fuctio o iterpretatios, returig oly the first atoms: Defiitio 8 The prefix of legth of a give iterpretatio is defied as pref : P N + P (, ) {A A ad A }. We ill rite pref () for pref(, ). For acyclic programs, it follos that i order to decide hether the atom ith level + must be icluded i T P (), it is sufficiet to cosider pref () oly. From Logic Programs to Fibrig Netorks We ill sho ho to represet acyclic logic programs by meas of fibrig eural etorks. We follo up o the basic idea from (Hölldobler & Kalike 994; Hölldobler, Kalike, & Störr 999), ad further developed i (Hitzler, Hölldobler, & Seda 2004; Bader & Hitzler 2004), to represet the siglestep operator T P by a etork, istead of the program P itself. This is a reasoable thig to do sice the sigle-step operator essetially captures the sematics of the program it is associated ith, as metioed before. order to represet T P by the iput-output mappig of a etork, e also eed a ecodig of P as a suitable subset of the real umbers. We also use a idea from (Hölldobler, Kalike, & Störr 999) for this purpose. Let B > 2 be some iteger, ad let be a bijective level mappig. Defie R : P R : A B A. We exclude B 2, because i this case R ould ot be ijective. t ill be coveiet to assume B 3 throughout the paper, but our results do ot deped o this. We deote the rage of R by rage(r). There are systematic reasos hy this ay of embeddig P ito the reals is reasoable, ad they ca be foud i (Hitzler, Hölldobler, & Seda 2004; Bader & Hitzler 2004), but ill ot cocer us here. Usig R, the prefix operatio ca be expressed aturally o the reals. Propositio 9 For P ad x rage(r) e have ( truc(r() B pref(, ) R ) ) B ad R(pref(R (x), )) truc(x B ) B. For coveiece, e overload pref ad set pref(x, ) R(pref(R (x), )) ad pref (x) pref(x, ). We ill o tur to the costructio of fibrig etorks hich approximate give programs. We ill first describe our approach i geeral terms, ad spell it out i a more formal ad detailed ay later o. The goal is to costruct a eural etork, hich ill compute R(T P )(x) R(T P (R (x))) for a give x rage(r). The etork is desiged i such a ay that it successively approximates R (T P ) (x) hile ruig. There ill be a mai loop iteratig a global couter. This couter fibres the kerel, hich ill evaluate hether the atom of level is cotaied i T P () or ot, i.e. the kerel ill output B if the atom is cotaied, ad 0 otherise. Furthermore, there ill be a iput subetork providig R() all the time, ad the output subetork hich ill accumulate the outputs of the kerel, ad hece coverge to R(T P ()). Figure 2 shos the geeral architecture. For each clause C i there is a subetork, hich determies hether C i outputs the atom of level for the give iterpretatio, or ot. This is doe by fibrig the subetork such that it computes the correspodig groud istace C () i, ith head of level, if existet. f there is o

4 such groud istace, this subetork ill output 0, otherise it ill determie hether the body is true uder the iterpretatio. A detailed descriptio of these clause etorks ill be give i the ext sectio. Note that this costructio is oly possible for programs hich are covered. This meas that they do ot have ay local variables, i.e. every variable occurig i some body also occurs i the correspodig head. Obviously, programs hich are acyclic ith respect to a bijective level mappig are alays covered. + Clause Clause2 TP() + Clausex Clause Figure 3: Recurret architecture for acyclic programs Clause2 TP() Gate Clausex Filter for L Filter for L2 Figure 2: Geeral architecture Filter for Lk f P is acyclic e ca compute the uique supported model of the program directly, by coectig the output ad the iput regio of the etork as sho i Figure 3. This is simply due to the above metioed fact: f e at to decide hether the atom of level should be icluded i T P (), it is sufficiet to look at the atoms A ith level <. We also have the folloig result. Propositio 0 Let P be a program hich is acyclic ith respect to a bijective level mappig, let A B P ith A. The for each P e have that A TP () iff A is true ith respect to the uique supported model of P. Proof This is a immediate result from the applicatio of the Baach cotractio mappig priciple to the sematic aalysis of acyclic programs, see (Hitzler & Seda 2003). So, for acyclic programs, e ca start ith the empty (or ay other) iterpretatio ad let the (recurret) etork ru. mplemetig Clauses order to complete the costructio from the previous sectio, e give a implemetatio of the clauses. For a clause C of the form H L L 2... L k, let C () deote the groud istace of C for hich the head has level, assumig it exists. The idea of the folloig costructio is to create a etork hich implemets C, ad ill be fibred by the couter such that it implemets C (). case that there is o groud istace of C ith head of level, the etork ill output 0, otherise it ill output if the body is true ith respect to the iterpretatio, ad 0 if it is ot. Figure 4: mplemetig clauses The idea, as sho i Figure 4, is that each subetork implemetig a clause C : H L... L k ith k body literals, cosists of k + parts oe gate ad k filters. The gate ill output, if the clause C has a groud istace C () here the level of the head is. Furthermore there is a filter for each body literal L i, hich outputs, if the correspodig groud literal L i is true uder. f all coditios are satisfied the fial cojuctio-euro ill become active, i.e. the subetork outputs. Note that this costructio agai is sufficiet oly for programs hich are covered. f e alloed local variables, the more tha oe (i fact ifiitely may) groud istaces of C ith a head of level could exist. Let us have a closer look at the type of fibrig fuctio eeded for our costructio. For the gate, it implicitly performs a very simple patter matchig operatio, checkig hether the atom ith level uifies ith the head of the clause. For the filters, it checks hether correspodig istaces of body literals are true i the give iterpretatio, i.e. it implicitly performs a variable bidig ad a elemetary check of set-iclusio. We argue that the operatios performed by the fibrig fuctio are ideed biologically feasible. The perspective hich e take i this paper is that they should be uderstood as fuctios performed by a separate etork, hich e do ot give explicitly, although e ill substatiate this poit to a certai extet i the ext sectio. Ad patter matchig is ideed a task that coectioist etorks perform ell.

5 The variable bidig task ill also be addressed i the ext sectio he e give examples for implemetig the filters. Neural Gates As specified above, the gate for a clause C : H L... L k fires if there is a groud istace C () of C ith head is of level, as depicted i Figure 5. The decisio based o - 0 l iit (, x) m Figure 7: A simple gate for poers o if groud istace ith (, ) head of level exists 0 otherise Figure 5: A eural gate simple patter matchig is embedded ito the fibrig fuctio. hat follos, e ill discuss a umber of differet cases of ho to ufold this fibrig fuctio ito a etork, i order to give plausible etork topologies ad yet simpler fibrig fuctios. Other implemetatios are possible, ad the cases preseted here shall serve as examples oly. Groud-headed clauses. Let us first cosider a clause for hich the head does ot cotai variables, i.e. a groud clause, like for example the first clause give i Example 7 above. Sice the level of the head i this case is fixed to some value, say m, the correspodig gate subetork should fire if ad oly if the geeral couter is equal to m. This ca be doe usig the etork sho i Figure 6 (left): The euro! ill alays output ad the euro 0 ill output if ad oly if the eighted iputs sum up to 0. This ca easily be implemeted usig e.g. threshold uits.! -m 0 Figure 6: Simple gates for groud-headed clauses (left) ad remaider classes (right) Remaider classes. f the levels l i of groud istatiated heads for a certai clause ca be expressed as multiples of a certai fixed umber m, i.e. l i i m for all i (like clauses umber 2 ad 3 of Example 7), e ca costruct a simple subetork, as depicted i Figure 6 (right). The euros symbolize the equivalece classes for the remaiders of the devisio by 3. The etork ill be iitialized by activatig. Every time it is reevaluated the activatio simply proceeds to the ext ro. Poers. f the level l i of groud istatiated heads for a certai clause ca be expressed as poers of a certai fixed umber m, i.e. l i m i for all i, e ca costruct a simple subetork as sho i Figure Filterig terpretatios For a etork to implemet the groud istace C () : H L ()... L () k of a clause C ith head of level, e eed to ko the distace betee the head ad the body literals i terms of levels as a fuctio i, i.e. e eed a set of fuctios {b i : N N i,..., k} oe for each body literal here b i computes the level of the literal L i, takig as iput the level of the head, as illustrated i Example. Example For the eve ad odd umbers program from Example 7, e ca use the folloig b i -fuctios: eve(0). {} eve(s(x)) eve(x). {b : 2} odd(s(x)) eve(x). {b : } For each body literal e ill o costruct a filter subetork, that fires if the correspodig groud body literal L () i of C () is icluded i. Give a iterpretatio, e eed to decide hether a certai atom A is icluded or ot. The uderlyig idea is the folloig. order to decide hether the atom A of level is icluded i the iterpretatio, e costruct a iterpretatio J cotaiig all atoms of ith level smaller tha, ad the atom A, i.e. J pref () {A}, or, expressed o the reals, R(J) pref (R())+B. f e evaluate R() R(J) the result ill be o-egative if ad oly if A is icluded i. This ca be doe usig the etork sho i Figure 8. truc 2 3 O (, ) B ( 2, ) B ( 3, ) B Figure 8: Schematic plot ad fibrig fuctio of a filter for the atom of level t is clear that e ca costruct etorks to filter a atom of level b i (), if the fuctio b i ca itself be implemeted i a eural etork. Sice fibrig etorks ca implemet ay polyomial fuctio, as sho i (d Avila Garcez & Gabbay 2004) ad idicated i Example 2, our approach is flexible ad very geeral.

6 A Worked Example Let us o give a complete example by extedig o the logic program ad the level mappig from Example 7 above. For the first clause e eed a groud-headed gate oly. To implemet the secod clause a remaider-class gate for the devisio by 2 is eeded, hich returs for all odd umbers. Furthermore, e eed a filter hich returs if the atom of level 2 is ot icluded i. For the last clause of the example, e eed a gate returig for all eve umbers ad a similar filter as for clause umber 2. Combiig all three parts ad takig ito accout that P is acyclic, e get the etork sho i Figure 9. f ru o ay iitial value, its +! 0 0 truc 0 truc Figure 9: Neural implemetatio of the hole example outputs coverge to the uique supported model of P, i.e. the sequece of outputs of the right-most euro is a sequece of real umbers hich coverges to R(M), here M is the uique supported model of P. Coclusios This paper cotributes to advace the state of the art o eural-symbolic itegratio by shoig ho first-order logic programs ca be implemeted i fibrig eural etorks. Geeric ays for represetig the eeded fibrig fuctios i a biologically plausible fashio remai to be ivestigated i detail, as ell as the task of extedig our proposal toards a fully fuctioal eural-symbolic learig ad reasoig system, icludig learig capabilities. Fibrig offers a modular ay of performig complex fuctios, such as logical reasoig, by combiig relatively simple modules (etorks) i a esemble. f each module is kept simple eough, e should be able to apply stadard eural learig algorithms to them. Ultimately, this may provide a itegrated system ith robust learig ad expressive reasoig capability. Refereces Bader, S., ad Hitzler, P Logic programs, iterated fuctio systems, ad recurret radial basis fuctio etorks. Joural of Applied Logic 2(3): Bader, S.; Hitzler, P.; ad Hölldobler, S The itegratio of coectioism ad first-order koledge represetatio ad reasoig as a challege for artificial itelligece. Proceedigs of the Third teratioal Coferece o formatio, Tokyo, Japa. To appear. Bishop, C. M Neural Netorks for Patter Recogitio. Oxford Uiversity Press. Broe, A., ad Su, R Coectioist iferece models. Neural Netorks 4(0): Cavedo, L. 99. Acyclic programs ad the completeess of SLDNF-resolutio. Theoretical Computer Sciece 86:8 92. d Avila Garcez, A. S., ad Gabbay, D. M Fibrig eural etorks. McGuiess, D. L., ad Ferguso, G., eds., Proceedigs of the Nieteeth Natioal Coferece o Artificial telligece, Sixteeth Coferece o ovative Applicatios of Artificial telligece, July 25-29, 2004, Sa Jose, Califoria, USA, AAA Press / The MT Press. d Avila Garcez, A. S.; Broda, K. B.; ad Gabbay, D. M Neural-Symbolic Learig Systems Foudatios ad Applicatios. Perspectives i Neural Computig. Spriger, Berli. Hitzler, P., ad Seda, A. K Geeralized metrics ad uiquely determied logic programs. Theoretical Computer Sciece 305( 3): Hitzler, P.; Hölldobler, S.; ad Seda, A. K Logic programs ad coectioist etorks. Joural of Applied Logic 2(3): Hölldobler, S., ad Kalike, Y Toards a massively parallel computatioal model for logic programmig. Proceedigs ECA94 Workshop o Combiig Symbolic ad Coectioist Processig, ECCA. Hölldobler, S.; Kalike, Y.; ad Störr, H.-P Approximatig the sematics of logic programs by recurret eural etorks. Applied telligece : Lloyd, J. W Foudatios of Logic Programmig. Spriger, Berli. Thru, S. B., et al. 99. The MONK s problems: A performace compariso of differet learig algorithms. Techical Report CMU-CS-9-97, Caregie Mello Uiversity.

In nite Sequences. Dr. Philippe B. Laval Kennesaw State University. October 9, 2008

In nite Sequences. Dr. Philippe B. Laval Kennesaw State University. October 9, 2008 I ite Sequeces Dr. Philippe B. Laval Keesaw State Uiversity October 9, 2008 Abstract This had out is a itroductio to i ite sequeces. mai de itios ad presets some elemetary results. It gives the I ite Sequeces

More information

Modified Line Search Method for Global Optimization

Modified Line Search Method for Global Optimization Modified Lie Search Method for Global Optimizatio Cria Grosa ad Ajith Abraham Ceter of Excellece for Quatifiable Quality of Service Norwegia Uiversity of Sciece ad Techology Trodheim, Norway {cria, ajith}@q2s.tu.o

More information

Department of Computer Science, University of Otago

Department of Computer Science, University of Otago Departmet of Computer Sciece, Uiversity of Otago Techical Report OUCS-2006-09 Permutatios Cotaiig May Patters Authors: M.H. Albert Departmet of Computer Sciece, Uiversity of Otago Micah Colema, Rya Fly

More information

Vladimir N. Burkov, Dmitri A. Novikov MODELS AND METHODS OF MULTIPROJECTS MANAGEMENT

Vladimir N. Burkov, Dmitri A. Novikov MODELS AND METHODS OF MULTIPROJECTS MANAGEMENT Keywords: project maagemet, resource allocatio, etwork plaig Vladimir N Burkov, Dmitri A Novikov MODELS AND METHODS OF MULTIPROJECTS MANAGEMENT The paper deals with the problems of resource allocatio betwee

More information

Soving Recurrence Relations

Soving Recurrence Relations Sovig Recurrece Relatios Part 1. Homogeeous liear 2d degree relatios with costat coefficiets. Cosider the recurrece relatio ( ) T () + at ( 1) + bt ( 2) = 0 This is called a homogeeous liear 2d degree

More information

A probabilistic proof of a binomial identity

A probabilistic proof of a binomial identity A probabilistic proof of a biomial idetity Joatho Peterso Abstract We give a elemetary probabilistic proof of a biomial idetity. The proof is obtaied by computig the probability of a certai evet i two

More information

Theorems About Power Series

Theorems About Power Series Physics 6A Witer 20 Theorems About Power Series Cosider a power series, f(x) = a x, () where the a are real coefficiets ad x is a real variable. There exists a real o-egative umber R, called the radius

More information

Asymptotic Growth of Functions

Asymptotic Growth of Functions CMPS Itroductio to Aalysis of Algorithms Fall 3 Asymptotic Growth of Fuctios We itroduce several types of asymptotic otatio which are used to compare the performace ad efficiecy of algorithms As we ll

More information

Section 11.3: The Integral Test

Section 11.3: The Integral Test Sectio.3: The Itegral Test Most of the series we have looked at have either diverged or have coverged ad we have bee able to fid what they coverge to. I geeral however, the problem is much more difficult

More information

5 Boolean Decision Trees (February 11)

5 Boolean Decision Trees (February 11) 5 Boolea Decisio Trees (February 11) 5.1 Graph Coectivity Suppose we are give a udirected graph G, represeted as a boolea adjacecy matrix = (a ij ), where a ij = 1 if ad oly if vertices i ad j are coected

More information

Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 13

Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 13 EECS 70 Discrete Mathematics ad Probability Theory Sprig 2014 Aat Sahai Note 13 Itroductio At this poit, we have see eough examples that it is worth just takig stock of our model of probability ad may

More information

Running Time ( 3.1) Analysis of Algorithms. Experimental Studies ( 3.1.1) Limitations of Experiments. Pseudocode ( 3.1.2) Theoretical Analysis

Running Time ( 3.1) Analysis of Algorithms. Experimental Studies ( 3.1.1) Limitations of Experiments. Pseudocode ( 3.1.2) Theoretical Analysis Ruig Time ( 3.) Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects.

More information

Sequences and Series

Sequences and Series CHAPTER 9 Sequeces ad Series 9.. Covergece: Defiitio ad Examples Sequeces The purpose of this chapter is to itroduce a particular way of geeratig algorithms for fidig the values of fuctios defied by their

More information

Lecture 4: Cauchy sequences, Bolzano-Weierstrass, and the Squeeze theorem

Lecture 4: Cauchy sequences, Bolzano-Weierstrass, and the Squeeze theorem Lecture 4: Cauchy sequeces, Bolzao-Weierstrass, ad the Squeeze theorem The purpose of this lecture is more modest tha the previous oes. It is to state certai coditios uder which we are guarateed that limits

More information

Chapter 6: Variance, the law of large numbers and the Monte-Carlo method

Chapter 6: Variance, the law of large numbers and the Monte-Carlo method Chapter 6: Variace, the law of large umbers ad the Mote-Carlo method Expected value, variace, ad Chebyshev iequality. If X is a radom variable recall that the expected value of X, E[X] is the average value

More information

I. Chi-squared Distributions

I. Chi-squared Distributions 1 M 358K Supplemet to Chapter 23: CHI-SQUARED DISTRIBUTIONS, T-DISTRIBUTIONS, AND DEGREES OF FREEDOM To uderstad t-distributios, we first eed to look at aother family of distributios, the chi-squared distributios.

More information

Chapter 5 O A Cojecture Of Erdíos Proceedigs NCUR VIII è1994è, Vol II, pp 794í798 Jeærey F Gold Departmet of Mathematics, Departmet of Physics Uiversity of Utah Do H Tucker Departmet of Mathematics Uiversity

More information

Your organization has a Class B IP address of 166.144.0.0 Before you implement subnetting, the Network ID and Host ID are divided as follows:

Your organization has a Class B IP address of 166.144.0.0 Before you implement subnetting, the Network ID and Host ID are divided as follows: Subettig Subettig is used to subdivide a sigle class of etwork i to multiple smaller etworks. Example: Your orgaizatio has a Class B IP address of 166.144.0.0 Before you implemet subettig, the Network

More information

Research Article Sign Data Derivative Recovery

Research Article Sign Data Derivative Recovery Iteratioal Scholarly Research Network ISRN Applied Mathematics Volume 0, Article ID 63070, 7 pages doi:0.540/0/63070 Research Article Sig Data Derivative Recovery L. M. Housto, G. A. Glass, ad A. D. Dymikov

More information

Lecture 13. Lecturer: Jonathan Kelner Scribe: Jonathan Pines (2009)

Lecture 13. Lecturer: Jonathan Kelner Scribe: Jonathan Pines (2009) 18.409 A Algorithmist s Toolkit October 27, 2009 Lecture 13 Lecturer: Joatha Keler Scribe: Joatha Pies (2009) 1 Outlie Last time, we proved the Bru-Mikowski iequality for boxes. Today we ll go over the

More information

A Faster Clause-Shortening Algorithm for SAT with No Restriction on Clause Length

A Faster Clause-Shortening Algorithm for SAT with No Restriction on Clause Length Joural o Satisfiability, Boolea Modelig ad Computatio 1 2005) 49-60 A Faster Clause-Shorteig Algorithm for SAT with No Restrictio o Clause Legth Evgey Datsi Alexader Wolpert Departmet of Computer Sciece

More information

Example 2 Find the square root of 0. The only square root of 0 is 0 (since 0 is not positive or negative, so those choices don t exist here).

Example 2 Find the square root of 0. The only square root of 0 is 0 (since 0 is not positive or negative, so those choices don t exist here). BEGINNING ALGEBRA Roots ad Radicals (revised summer, 00 Olso) Packet to Supplemet the Curret Textbook - Part Review of Square Roots & Irratioals (This portio ca be ay time before Part ad should mostly

More information

Irreducible polynomials with consecutive zero coefficients

Irreducible polynomials with consecutive zero coefficients Irreducible polyomials with cosecutive zero coefficiets Theodoulos Garefalakis Departmet of Mathematics, Uiversity of Crete, 71409 Heraklio, Greece Abstract Let q be a prime power. We cosider the problem

More information

Infinite Sequences and Series

Infinite Sequences and Series CHAPTER 4 Ifiite Sequeces ad Series 4.1. Sequeces A sequece is a ifiite ordered list of umbers, for example the sequece of odd positive itegers: 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29...

More information

Incremental calculation of weighted mean and variance

Incremental calculation of weighted mean and variance Icremetal calculatio of weighted mea ad variace Toy Fich faf@cam.ac.uk dot@dotat.at Uiversity of Cambridge Computig Service February 009 Abstract I these otes I eplai how to derive formulae for umerically

More information

Properties of MLE: consistency, asymptotic normality. Fisher information.

Properties of MLE: consistency, asymptotic normality. Fisher information. Lecture 3 Properties of MLE: cosistecy, asymptotic ormality. Fisher iformatio. I this sectio we will try to uderstad why MLEs are good. Let us recall two facts from probability that we be used ofte throughout

More information

Class Meeting # 16: The Fourier Transform on R n

Class Meeting # 16: The Fourier Transform on R n MATH 18.152 COUSE NOTES - CLASS MEETING # 16 18.152 Itroductio to PDEs, Fall 2011 Professor: Jared Speck Class Meetig # 16: The Fourier Trasform o 1. Itroductio to the Fourier Trasform Earlier i the course,

More information

MARTINGALES AND A BASIC APPLICATION

MARTINGALES AND A BASIC APPLICATION MARTINGALES AND A BASIC APPLICATION TURNER SMITH Abstract. This paper will develop the measure-theoretic approach to probability i order to preset the defiitio of martigales. From there we will apply this

More information

Project Deliverables. CS 361, Lecture 28. Outline. Project Deliverables. Administrative. Project Comments

Project Deliverables. CS 361, Lecture 28. Outline. Project Deliverables. Administrative. Project Comments Project Deliverables CS 361, Lecture 28 Jared Saia Uiversity of New Mexico Each Group should tur i oe group project cosistig of: About 6-12 pages of text (ca be loger with appedix) 6-12 figures (please

More information

Here are a couple of warnings to my students who may be here to get a copy of what happened on a day that you missed.

Here are a couple of warnings to my students who may be here to get a copy of what happened on a day that you missed. This documet was writte ad copyrighted by Paul Dawkis. Use of this documet ad its olie versio is govered by the Terms ad Coditios of Use located at http://tutorial.math.lamar.edu/terms.asp. The olie versio

More information

Factors of sums of powers of binomial coefficients

Factors of sums of powers of binomial coefficients ACTA ARITHMETICA LXXXVI.1 (1998) Factors of sums of powers of biomial coefficiets by Neil J. Cali (Clemso, S.C.) Dedicated to the memory of Paul Erdős 1. Itroductio. It is well ow that if ( ) a f,a = the

More information

How to read A Mutual Fund shareholder report

How to read A Mutual Fund shareholder report Ivestor BulletI How to read A Mutual Fud shareholder report The SEC s Office of Ivestor Educatio ad Advocacy is issuig this Ivestor Bulleti to educate idividual ivestors about mutual fud shareholder reports.

More information

*The most important feature of MRP as compared with ordinary inventory control analysis is its time phasing feature.

*The most important feature of MRP as compared with ordinary inventory control analysis is its time phasing feature. Itegrated Productio ad Ivetory Cotrol System MRP ad MRP II Framework of Maufacturig System Ivetory cotrol, productio schedulig, capacity plaig ad fiacial ad busiess decisios i a productio system are iterrelated.

More information

Overview of some probability distributions.

Overview of some probability distributions. Lecture Overview of some probability distributios. I this lecture we will review several commo distributios that will be used ofte throughtout the class. Each distributio is usually described by its probability

More information

CS103A Handout 23 Winter 2002 February 22, 2002 Solving Recurrence Relations

CS103A Handout 23 Winter 2002 February 22, 2002 Solving Recurrence Relations CS3A Hadout 3 Witer 00 February, 00 Solvig Recurrece Relatios Itroductio A wide variety of recurrece problems occur i models. Some of these recurrece relatios ca be solved usig iteratio or some other ad

More information

Annuities Under Random Rates of Interest II By Abraham Zaks. Technion I.I.T. Haifa ISRAEL and Haifa University Haifa ISRAEL.

Annuities Under Random Rates of Interest II By Abraham Zaks. Technion I.I.T. Haifa ISRAEL and Haifa University Haifa ISRAEL. Auities Uder Radom Rates of Iterest II By Abraham Zas Techio I.I.T. Haifa ISRAEL ad Haifa Uiversity Haifa ISRAEL Departmet of Mathematics, Techio - Israel Istitute of Techology, 3000, Haifa, Israel I memory

More information

SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES

SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES Read Sectio 1.5 (pages 5 9) Overview I Sectio 1.5 we lear to work with summatio otatio ad formulas. We will also itroduce a brief overview of sequeces,

More information

Convexity, Inequalities, and Norms

Convexity, Inequalities, and Norms Covexity, Iequalities, ad Norms Covex Fuctios You are probably familiar with the otio of cocavity of fuctios. Give a twicedifferetiable fuctio ϕ: R R, We say that ϕ is covex (or cocave up) if ϕ (x) 0 for

More information

Domain 1: Designing a SQL Server Instance and a Database Solution

Domain 1: Designing a SQL Server Instance and a Database Solution Maual SQL Server 2008 Desig, Optimize ad Maitai (70-450) 1-800-418-6789 Domai 1: Desigig a SQL Server Istace ad a Database Solutio Desigig for CPU, Memory ad Storage Capacity Requiremets Whe desigig a

More information

Trigonometric Form of a Complex Number. The Complex Plane. axis. ( 2, 1) or 2 i FIGURE 6.44. The absolute value of the complex number z a bi is

Trigonometric Form of a Complex Number. The Complex Plane. axis. ( 2, 1) or 2 i FIGURE 6.44. The absolute value of the complex number z a bi is 0_0605.qxd /5/05 0:45 AM Page 470 470 Chapter 6 Additioal Topics i Trigoometry 6.5 Trigoometric Form of a Complex Number What you should lear Plot complex umbers i the complex plae ad fid absolute values

More information

Review: Classification Outline

Review: Classification Outline Data Miig CS 341, Sprig 2007 Decisio Trees Neural etworks Review: Lecture 6: Classificatio issues, regressio, bayesia classificatio Pretice Hall 2 Data Miig Core Techiques Classificatio Clusterig Associatio

More information

7.1 Finding Rational Solutions of Polynomial Equations

7.1 Finding Rational Solutions of Polynomial Equations 4 Locker LESSON 7. Fidig Ratioal Solutios of Polyomial Equatios Name Class Date 7. Fidig Ratioal Solutios of Polyomial Equatios Essetial Questio: How do you fid the ratioal roots of a polyomial equatio?

More information

.04. This means $1000 is multiplied by 1.02 five times, once for each of the remaining sixmonth

.04. This means $1000 is multiplied by 1.02 five times, once for each of the remaining sixmonth Questio 1: What is a ordiary auity? Let s look at a ordiary auity that is certai ad simple. By this, we mea a auity over a fixed term whose paymet period matches the iterest coversio period. Additioally,

More information

FIBONACCI NUMBERS: AN APPLICATION OF LINEAR ALGEBRA. 1. Powers of a matrix

FIBONACCI NUMBERS: AN APPLICATION OF LINEAR ALGEBRA. 1. Powers of a matrix FIBONACCI NUMBERS: AN APPLICATION OF LINEAR ALGEBRA. Powers of a matrix We begi with a propositio which illustrates the usefuless of the diagoalizatio. Recall that a square matrix A is diogaalizable if

More information

Floating Codes for Joint Information Storage in Write Asymmetric Memories

Floating Codes for Joint Information Storage in Write Asymmetric Memories Floatig Codes for Joit Iformatio Storage i Write Asymmetric Memories Axiao (Adrew Jiag Computer Sciece Departmet Texas A&M Uiversity College Statio, TX 77843-311 ajiag@cs.tamu.edu Vaske Bohossia Electrical

More information

Integer Factorization Algorithms

Integer Factorization Algorithms Iteger Factorizatio Algorithms Coelly Bares Departmet of Physics, Orego State Uiversity December 7, 004 This documet has bee placed i the public domai. Cotets I. Itroductio 3 1. Termiology 3. Fudametal

More information

Cooley-Tukey. Tukey FFT Algorithms. FFT Algorithms. Cooley

Cooley-Tukey. Tukey FFT Algorithms. FFT Algorithms. Cooley Cooley Cooley-Tuey Tuey FFT Algorithms FFT Algorithms Cosider a legth- sequece x[ with a -poit DFT X[ where Represet the idices ad as +, +, Cooley Cooley-Tuey Tuey FFT Algorithms FFT Algorithms Usig these

More information

Matrix Model of Trust Management in P2P Networks

Matrix Model of Trust Management in P2P Networks Matrix Model of Trust Maagemet i P2P Networks Miroslav Novotý, Filip Zavoral Faculty of Mathematics ad Physics Charles Uiversity Prague, Czech Republic miroslav.ovoty@mff.cui.cz Abstract The trust maagemet

More information

Multiplexers and Demultiplexers

Multiplexers and Demultiplexers I this lesso, you will lear about: Multiplexers ad Demultiplexers 1. Multiplexers 2. Combiatioal circuit implemetatio with multiplexers 3. Demultiplexers 4. Some examples Multiplexer A Multiplexer (see

More information

1 Computing the Standard Deviation of Sample Means

1 Computing the Standard Deviation of Sample Means Computig the Stadard Deviatio of Sample Meas Quality cotrol charts are based o sample meas ot o idividual values withi a sample. A sample is a group of items, which are cosidered all together for our aalysis.

More information

0.7 0.6 0.2 0 0 96 96.5 97 97.5 98 98.5 99 99.5 100 100.5 96.5 97 97.5 98 98.5 99 99.5 100 100.5

0.7 0.6 0.2 0 0 96 96.5 97 97.5 98 98.5 99 99.5 100 100.5 96.5 97 97.5 98 98.5 99 99.5 100 100.5 Sectio 13 Kolmogorov-Smirov test. Suppose that we have a i.i.d. sample X 1,..., X with some ukow distributio P ad we would like to test the hypothesis that P is equal to a particular distributio P 0, i.e.

More information

Exploratory Data Analysis

Exploratory Data Analysis 1 Exploratory Data Aalysis Exploratory data aalysis is ofte the rst step i a statistical aalysis, for it helps uderstadig the mai features of the particular sample that a aalyst is usig. Itelliget descriptios

More information

Trackless online algorithms for the server problem

Trackless online algorithms for the server problem Iformatio Processig Letters 74 (2000) 73 79 Trackless olie algorithms for the server problem Wolfgag W. Bei,LawreceL.Larmore 1 Departmet of Computer Sciece, Uiversity of Nevada, Las Vegas, NV 89154, USA

More information

Our aim is to show that under reasonable assumptions a given 2π-periodic function f can be represented as convergent series

Our aim is to show that under reasonable assumptions a given 2π-periodic function f can be represented as convergent series 8 Fourier Series Our aim is to show that uder reasoable assumptios a give -periodic fuctio f ca be represeted as coverget series f(x) = a + (a cos x + b si x). (8.) By defiitio, the covergece of the series

More information

Enhancing Oracle Business Intelligence with cubus EV How users of Oracle BI on Essbase cubes can benefit from cubus outperform EV Analytics (cubus EV)

Enhancing Oracle Business Intelligence with cubus EV How users of Oracle BI on Essbase cubes can benefit from cubus outperform EV Analytics (cubus EV) Ehacig Oracle Busiess Itelligece with cubus EV How users of Oracle BI o Essbase cubes ca beefit from cubus outperform EV Aalytics (cubus EV) CONTENT 01 cubus EV as a ehacemet to Oracle BI o Essbase 02

More information

Chapter 5: Inner Product Spaces

Chapter 5: Inner Product Spaces Chapter 5: Ier Product Spaces Chapter 5: Ier Product Spaces SECION A Itroductio to Ier Product Spaces By the ed of this sectio you will be able to uderstad what is meat by a ier product space give examples

More information

ODBC. Getting Started With Sage Timberline Office ODBC

ODBC. Getting Started With Sage Timberline Office ODBC ODBC Gettig Started With Sage Timberlie Office ODBC NOTICE This documet ad the Sage Timberlie Office software may be used oly i accordace with the accompayig Sage Timberlie Office Ed User Licese Agreemet.

More information

Real-Time Computing Without Stable States: A New Framework for Neural Computation Based on Perturbations

Real-Time Computing Without Stable States: A New Framework for Neural Computation Based on Perturbations Real-Time Computig Without Stable States: A New Framework for Neural Computatio Based o Perturbatios Wolfgag aass+, Thomas Natschläger+ & Hery arkram* + Istitute for Theoretical Computer Sciece, Techische

More information

Week 3 Conditional probabilities, Bayes formula, WEEK 3 page 1 Expected value of a random variable

Week 3 Conditional probabilities, Bayes formula, WEEK 3 page 1 Expected value of a random variable Week 3 Coditioal probabilities, Bayes formula, WEEK 3 page 1 Expected value of a radom variable We recall our discussio of 5 card poker hads. Example 13 : a) What is the probability of evet A that a 5

More information

Multiple Representations for Pattern Exploration with the Graphing Calculator and Manipulatives

Multiple Representations for Pattern Exploration with the Graphing Calculator and Manipulatives Douglas A. Lapp Multiple Represetatios for Patter Exploratio with the Graphig Calculator ad Maipulatives To teach mathematics as a coected system of cocepts, we must have a shift i emphasis from a curriculum

More information

hp calculators HP 12C Statistics - average and standard deviation Average and standard deviation concepts HP12C average and standard deviation

hp calculators HP 12C Statistics - average and standard deviation Average and standard deviation concepts HP12C average and standard deviation HP 1C Statistics - average ad stadard deviatio Average ad stadard deviatio cocepts HP1C average ad stadard deviatio Practice calculatig averages ad stadard deviatios with oe or two variables HP 1C Statistics

More information

INFINITE SERIES KEITH CONRAD

INFINITE SERIES KEITH CONRAD INFINITE SERIES KEITH CONRAD. Itroductio The two basic cocepts of calculus, differetiatio ad itegratio, are defied i terms of limits (Newto quotiets ad Riema sums). I additio to these is a third fudametal

More information

Center, Spread, and Shape in Inference: Claims, Caveats, and Insights

Center, Spread, and Shape in Inference: Claims, Caveats, and Insights Ceter, Spread, ad Shape i Iferece: Claims, Caveats, ad Isights Dr. Nacy Pfeig (Uiversity of Pittsburgh) AMATYC November 2008 Prelimiary Activities 1. I would like to produce a iterval estimate for the

More information

Mathematical goals. Starting points. Materials required. Time needed

Mathematical goals. Starting points. Materials required. Time needed Level A1 of challege: C A1 Mathematical goals Startig poits Materials required Time eeded Iterpretig algebraic expressios To help learers to: traslate betwee words, symbols, tables, ad area represetatios

More information

1. Introduction. Scheduling Theory

1. Introduction. Scheduling Theory . Itroductio. Itroductio As a idepedet brach of Operatioal Research, Schedulig Theory appeared i the begiig of the 50s. I additio to computer systems ad maufacturig, schedulig theory ca be applied to may

More information

AP Calculus AB 2006 Scoring Guidelines Form B

AP Calculus AB 2006 Scoring Guidelines Form B AP Calculus AB 6 Scorig Guidelies Form B The College Board: Coectig Studets to College Success The College Board is a ot-for-profit membership associatio whose missio is to coect studets to college success

More information

Notes on exponential generating functions and structures.

Notes on exponential generating functions and structures. Notes o expoetial geeratig fuctios ad structures. 1. The cocept of a structure. Cosider the followig coutig problems: (1) to fid for each the umber of partitios of a -elemet set, (2) to fid for each the

More information

THIN SEQUENCES AND THE GRAM MATRIX PAMELA GORKIN, JOHN E. MCCARTHY, SANDRA POTT, AND BRETT D. WICK

THIN SEQUENCES AND THE GRAM MATRIX PAMELA GORKIN, JOHN E. MCCARTHY, SANDRA POTT, AND BRETT D. WICK THIN SEQUENCES AND THE GRAM MATRIX PAMELA GORKIN, JOHN E MCCARTHY, SANDRA POTT, AND BRETT D WICK Abstract We provide a ew proof of Volberg s Theorem characterizig thi iterpolatig sequeces as those for

More information

Tradigms of Astundithi and Toyota

Tradigms of Astundithi and Toyota Tradig the radomess - Desigig a optimal tradig strategy uder a drifted radom walk price model Yuao Wu Math 20 Project Paper Professor Zachary Hamaker Abstract: I this paper the author iteds to explore

More information

Escola Federal de Engenharia de Itajubá

Escola Federal de Engenharia de Itajubá Escola Federal de Egeharia de Itajubá Departameto de Egeharia Mecâica Pós-Graduação em Egeharia Mecâica MPF04 ANÁLISE DE SINAIS E AQUISÇÃO DE DADOS SINAIS E SISTEMAS Trabalho 02 (MATLAB) Prof. Dr. José

More information

The Power of Free Branching in a General Model of Backtracking and Dynamic Programming Algorithms

The Power of Free Branching in a General Model of Backtracking and Dynamic Programming Algorithms The Power of Free Brachig i a Geeral Model of Backtrackig ad Dyamic Programmig Algorithms SASHKA DAVIS IDA/Ceter for Computig Scieces Bowie, MD sashka.davis@gmail.com RUSSELL IMPAGLIAZZO Dept. of Computer

More information

Entropy of bi-capacities

Entropy of bi-capacities Etropy of bi-capacities Iva Kojadiovic LINA CNRS FRE 2729 Site école polytechique de l uiv. de Nates Rue Christia Pauc 44306 Nates, Frace iva.kojadiovic@uiv-ates.fr Jea-Luc Marichal Applied Mathematics

More information

INVESTMENT PERFORMANCE COUNCIL (IPC)

INVESTMENT PERFORMANCE COUNCIL (IPC) INVESTMENT PEFOMANCE COUNCIL (IPC) INVITATION TO COMMENT: Global Ivestmet Performace Stadards (GIPS ) Guidace Statemet o Calculatio Methodology The Associatio for Ivestmet Maagemet ad esearch (AIM) seeks

More information

THE REGRESSION MODEL IN MATRIX FORM. For simple linear regression, meaning one predictor, the model is. for i = 1, 2, 3,, n

THE REGRESSION MODEL IN MATRIX FORM. For simple linear regression, meaning one predictor, the model is. for i = 1, 2, 3,, n We will cosider the liear regressio model i matrix form. For simple liear regressio, meaig oe predictor, the model is i = + x i + ε i for i =,,,, This model icludes the assumptio that the ε i s are a sample

More information

CHAPTER 3 DIGITAL CODING OF SIGNALS

CHAPTER 3 DIGITAL CODING OF SIGNALS CHAPTER 3 DIGITAL CODING OF SIGNALS Computers are ofte used to automate the recordig of measuremets. The trasducers ad sigal coditioig circuits produce a voltage sigal that is proportioal to a quatity

More information

Approximating Area under a curve with rectangles. To find the area under a curve we approximate the area using rectangles and then use limits to find

Approximating Area under a curve with rectangles. To find the area under a curve we approximate the area using rectangles and then use limits to find 1.8 Approximatig Area uder a curve with rectagles 1.6 To fid the area uder a curve we approximate the area usig rectagles ad the use limits to fid 1.4 the area. Example 1 Suppose we wat to estimate 1.

More information

Now here is the important step

Now here is the important step LINEST i Excel The Excel spreadsheet fuctio "liest" is a complete liear least squares curve fittig routie that produces ucertaity estimates for the fit values. There are two ways to access the "liest"

More information

LECTURE 13: Cross-validation

LECTURE 13: Cross-validation LECTURE 3: Cross-validatio Resampli methods Cross Validatio Bootstrap Bias ad variace estimatio with the Bootstrap Three-way data partitioi Itroductio to Patter Aalysis Ricardo Gutierrez-Osua Texas A&M

More information

Taking DCOP to the Real World: Efficient Complete Solutions for Distributed Multi-Event Scheduling

Taking DCOP to the Real World: Efficient Complete Solutions for Distributed Multi-Event Scheduling Taig DCOP to the Real World: Efficiet Complete Solutios for Distributed Multi-Evet Schedulig Rajiv T. Maheswara, Milid Tambe, Emma Bowrig, Joatha P. Pearce, ad Pradeep araatham Uiversity of Souther Califoria

More information

3 Basic Definitions of Probability Theory

3 Basic Definitions of Probability Theory 3 Basic Defiitios of Probability Theory 3defprob.tex: Feb 10, 2003 Classical probability Frequecy probability axiomatic probability Historical developemet: Classical Frequecy Axiomatic The Axiomatic defiitio

More information

Statistical inference: example 1. Inferential Statistics

Statistical inference: example 1. Inferential Statistics Statistical iferece: example 1 Iferetial Statistics POPULATION SAMPLE A clothig store chai regularly buys from a supplier large quatities of a certai piece of clothig. Each item ca be classified either

More information

SAMPLE QUESTIONS FOR FINAL EXAM. (1) (2) (3) (4) Find the following using the definition of the Riemann integral: (2x + 1)dx

SAMPLE QUESTIONS FOR FINAL EXAM. (1) (2) (3) (4) Find the following using the definition of the Riemann integral: (2x + 1)dx SAMPLE QUESTIONS FOR FINAL EXAM REAL ANALYSIS I FALL 006 3 4 Fid the followig usig the defiitio of the Riema itegral: a 0 x + dx 3 Cosider the partitio P x 0 3, x 3 +, x 3 +,......, x 3 3 + 3 of the iterval

More information

AP Calculus BC 2003 Scoring Guidelines Form B

AP Calculus BC 2003 Scoring Guidelines Form B AP Calculus BC Scorig Guidelies Form B The materials icluded i these files are iteded for use by AP teachers for course ad exam preparatio; permissio for ay other use must be sought from the Advaced Placemet

More information

Ekkehart Schlicht: Economic Surplus and Derived Demand

Ekkehart Schlicht: Economic Surplus and Derived Demand Ekkehart Schlicht: Ecoomic Surplus ad Derived Demad Muich Discussio Paper No. 2006-17 Departmet of Ecoomics Uiversity of Muich Volkswirtschaftliche Fakultät Ludwig-Maximilias-Uiversität Müche Olie at http://epub.ub.ui-mueche.de/940/

More information

THE ABRACADABRA PROBLEM

THE ABRACADABRA PROBLEM THE ABRACADABRA PROBLEM FRANCESCO CARAVENNA Abstract. We preset a detailed solutio of Exercise E0.6 i [Wil9]: i a radom sequece of letters, draw idepedetly ad uiformly from the Eglish alphabet, the expected

More information

5: Introduction to Estimation

5: Introduction to Estimation 5: Itroductio to Estimatio Cotets Acroyms ad symbols... 1 Statistical iferece... Estimatig µ with cofidece... 3 Samplig distributio of the mea... 3 Cofidece Iterval for μ whe σ is kow before had... 4 Sample

More information

Confidence Intervals for One Mean

Confidence Intervals for One Mean Chapter 420 Cofidece Itervals for Oe Mea Itroductio This routie calculates the sample size ecessary to achieve a specified distace from the mea to the cofidece limit(s) at a stated cofidece level for a

More information

A Fuzzy Model of Software Project Effort Estimation

A Fuzzy Model of Software Project Effort Estimation TJFS: Turkish Joural of Fuzzy Systems (eissn: 309 90) A Official Joural of Turkish Fuzzy Systems Associatio Vol.4, No.2, pp. 68-76, 203 A Fuzzy Model of Software Project Effort Estimatio Oumout Chouseioglou

More information

JJMIE Jordan Journal of Mechanical and Industrial Engineering

JJMIE Jordan Journal of Mechanical and Industrial Engineering JJMIE Jorda Joural of Mechaical ad Idustrial Egieerig Volume 5, Number 5, Oct. 2011 ISSN 1995-6665 Pages 439-446 Modelig Stock Market Exchage Prices Usig Artificial Neural Network: A Study of Amma Stock

More information

Capacity of Wireless Networks with Heterogeneous Traffic

Capacity of Wireless Networks with Heterogeneous Traffic Capacity of Wireless Networks with Heterogeeous Traffic Migyue Ji, Zheg Wag, Hamid R. Sadjadpour, J.J. Garcia-Lua-Aceves Departmet of Electrical Egieerig ad Computer Egieerig Uiversity of Califoria, Sata

More information

Perfect Packing Theorems and the Average-Case Behavior of Optimal and Online Bin Packing

Perfect Packing Theorems and the Average-Case Behavior of Optimal and Online Bin Packing SIAM REVIEW Vol. 44, No. 1, pp. 95 108 c 2002 Society for Idustrial ad Applied Mathematics Perfect Packig Theorems ad the Average-Case Behavior of Optimal ad Olie Bi Packig E. G. Coffma, Jr. C. Courcoubetis

More information

The Stable Marriage Problem

The Stable Marriage Problem The Stable Marriage Problem William Hut Lae Departmet of Computer Sciece ad Electrical Egieerig, West Virgiia Uiversity, Morgatow, WV William.Hut@mail.wvu.edu 1 Itroductio Imagie you are a matchmaker,

More information

NEW HIGH PERFORMANCE COMPUTATIONAL METHODS FOR MORTGAGES AND ANNUITIES. Yuri Shestopaloff,

NEW HIGH PERFORMANCE COMPUTATIONAL METHODS FOR MORTGAGES AND ANNUITIES. Yuri Shestopaloff, NEW HIGH PERFORMNCE COMPUTTIONL METHODS FOR MORTGGES ND NNUITIES Yuri Shestopaloff, Geerally, mortgage ad auity equatios do ot have aalytical solutios for ukow iterest rate, which has to be foud usig umerical

More information

Permutations, the Parity Theorem, and Determinants

Permutations, the Parity Theorem, and Determinants 1 Permutatios, the Parity Theorem, ad Determiats Joh A. Guber Departmet of Electrical ad Computer Egieerig Uiversity of Wiscosi Madiso Cotets 1 What is a Permutatio 1 2 Cycles 2 2.1 Traspositios 4 3 Orbits

More information

Chatpun Khamyat Department of Industrial Engineering, Kasetsart University, Bangkok, Thailand ocpky@hotmail.com

Chatpun Khamyat Department of Industrial Engineering, Kasetsart University, Bangkok, Thailand ocpky@hotmail.com SOLVING THE OIL DELIVERY TRUCKS ROUTING PROBLEM WITH MODIFY MULTI-TRAVELING SALESMAN PROBLEM APPROACH CASE STUDY: THE SME'S OIL LOGISTIC COMPANY IN BANGKOK THAILAND Chatpu Khamyat Departmet of Idustrial

More information

Building Blocks Problem Related to Harmonic Series

Building Blocks Problem Related to Harmonic Series TMME, vol3, o, p.76 Buildig Blocks Problem Related to Harmoic Series Yutaka Nishiyama Osaka Uiversity of Ecoomics, Japa Abstract: I this discussio I give a eplaatio of the divergece ad covergece of ifiite

More information

Chapter 7 Methods of Finding Estimators

Chapter 7 Methods of Finding Estimators Chapter 7 for BST 695: Special Topics i Statistical Theory. Kui Zhag, 011 Chapter 7 Methods of Fidig Estimators Sectio 7.1 Itroductio Defiitio 7.1.1 A poit estimator is ay fuctio W( X) W( X1, X,, X ) of

More information

Systems Design Project: Indoor Location of Wireless Devices

Systems Design Project: Indoor Location of Wireless Devices Systems Desig Project: Idoor Locatio of Wireless Devices Prepared By: Bria Murphy Seior Systems Sciece ad Egieerig Washigto Uiversity i St. Louis Phoe: (805) 698-5295 Email: bcm1@cec.wustl.edu Supervised

More information

Data Analysis and Statistical Behaviors of Stock Market Fluctuations

Data Analysis and Statistical Behaviors of Stock Market Fluctuations 44 JOURNAL OF COMPUTERS, VOL. 3, NO. 0, OCTOBER 2008 Data Aalysis ad Statistical Behaviors of Stock Market Fluctuatios Ju Wag Departmet of Mathematics, Beijig Jiaotog Uiversity, Beijig 00044, Chia Email:

More information

76 SYSTEMICS, CYBERNETICS AND INFORMATICS VOLUME 9 - NUMBER 1 - YEAR 2011 ISSN: 1690-4524

76 SYSTEMICS, CYBERNETICS AND INFORMATICS VOLUME 9 - NUMBER 1 - YEAR 2011 ISSN: 1690-4524 The Fuzzy ad Compartmet System Cocept for the Commuicatio System takig accout of the Hadicapped situatio M asahiroaruga DepartmetofHuma ad Iformatio Sciece,School ofiformatio Sciecead Techology,TokaiUiversity

More information