Efficient Parsing with the Product-Free Lambek Calculus
|
|
- Patricia Wilson
- 6 years ago
- Views:
Transcription
1 Efficient Parsing wit te Prouct-Free Lambek Calculus Timoty A. D. Fowler Department of Computer Science University of Toronto 10 King s College Roa, Toronto, ON, M5S 3G4, Canaa tfowler@cs.toronto.eu Abstract Tis paper provies a parsing algoritm for te Lambek calculus wic is polynomial time for a more general fragment of te Lambek calculus tan any previously known algoritm. Te algoritm runs in worst-case time O(n 5 ) wen restricte to a certain fragment of te Lambek calculus wic is motivate by empirical analysis. In aition, a set of parameterize inputs are given, sowing wy te algoritm as exponential worst-case running time for te Lambek calculus in general. 1 Introuction A wie variety of grammar formalisms ave been explore in te past for parsing natural language sentences. Te most prominent of tese formalisms as been context free grammars (CFGs) but a collection of formalisms known as categorial grammar (CG) (Ajukiewicz, 1935; Dowty et al., 1981; Steeman, 2000) as receive interest because of some significant avantages over CFGs. First, CG is inerently lexicalize ue to te fact tat all of te variation between grammars is capture by te lexicon. Tis is a result of te ric categories wic CG uses in its lexicon to specify te functor-argument relationsips between lexical items. A istinct avantage of tis lexicalization is tat te processing of sentences epens upon only tose categories containe in te string an not some global set of rules. Secon, CG as te avantage tat it centrally aopts te principle of compositionality, as outline in Montague c License uner te Creative Commons Attribution-Noncommercial-Sare Alike 3.0 Unporte license (ttp://creativecommons.org/licenses/by-nc-sa/3.0/). Some rigts reserve. grammar (Montague, 1974), allowing te semantic erivation to exactly parallel te syntactic erivation. Tis leas to a semantical form wic is easily extractable from te syntactic parse. A large number of CG formalisms ave been introuce incluing, among oters, te Lambek calculus (Lambek, 1958) an Combinatory Categorial Grammar (CCG) (Steeman, 2000). Of tese, CCG as receive te most zealous computational attention. Impressive results ave been acieve culminating in te state-of-te-art parser of Clark an Curran (2004) wic as been use as te parser for te PASCAL Recognizing Textual Entailment Callenge entry of Bos an Markert (2005). Te appeal of CCG can be attribute to te existence of efficient parsing algoritms for it an te fact tat it recognizes a milly contextsensitive language class (Josi et al., 1989), a language class more powerful tan te context free languages (CFLs) tat as been argue to be necessary for natural language syntax. Te Lambek calculus provies an ieal contrast between CCG an CFGs by being a CG formalism like CCG but by recognizing te CFLs like CFGs (Pentus, 1997). Te primary goal of tis paper is to provie an algoritm for parsing wit te Lambek calculus an to sketc its correctness. Furtermore, a time boun of O(n 5 ) will be sown for tis algoritm wen restricte to prouct-free categories of boune orer (see section 2 for a efinition). Te restriction to boune orer is not a significant restriction, ue to te fact tat categories in CCGbank 1 (Hockenmaier, 2003), a CCG corpus, ave a maximum orer of 5 an an average orer of 0.78 by token. In aition to te presentation of te algoritm, we will provie a parameterize set of in- 1 Altoug CCGbank was built for CCG, we believe tat transforming it into a Lambek calculus bank is feasible.
2 puts (of unboune orer) on wic te algoritm as exponential running time. Te variant of te Lambek calculus consiere ere is te prouct-free Lambek calculus cosen for tree reasons. First, it is te founation of all oter non-associative variants of te Lambek calculus incluing te original Lambek calculus (Lambek, 1958) an te multi-moal Lambek calculus (Moortgat, 1996). Secon, te calculus wit prouct is NP-complete (Pentus, 2006), wile te sequent erivability in te prouct-free fragment is still unknown. Finally, te only connectives inclue are / an \, wic are te same connectives as in CCG, proviing a corpus for future work suc as builing a probabilistic Lambek calculus parser. 2 Problem specification Parsing wit te Lambek calculus is treate as a logical erivation problem. First, te wors of a sentence are assigne categories wic are built from basic categories (e.g. NP an S) an te connectives \ an /. For example, te category for transitive verbs is (NP\S)/NP an te category for averbs is (S/NP)\(S/NP) 2. Intuitively, te \ an / operators specify te arguments of a wor an te irection in wic tose arguments nee to be foun. Next, te sequent is built by combining te sequence of te categories for te wors wit te symbol an te sentence category (e.g. S). Strictly speaking, tis paper only consiers te parsing of categories witout consiering multiple lexical entries per wor. However, using tecniques suc as supertagging, te results presente ere yiel an efficient meto for te broaer problem of parsing sentences. Terefore, we can take te size of te input n to be te number of basic categories in te sequent. A parse tree for te sentence correspons to a proof of its sequent an is restricte to rules following te templates in figure 1. In figure 1, lowercase Greek letters represent categories an uppercase Greek letters represent sequences of categories. A proof for te sentence Wo loves im? is given in figure 2. Te version of te Lambek calculus presente above is known as te prouct-free Lambek calculus allowing empty premises an will be enote by L. In aition, we will consier te fragment L k, obtaine by restricting L to categories of orer boune by k. Te orer of a category, wic can 2 We use Ajukiewicz notation, not Steeman notation. α α Γ α βθ γ Γα\βΘ γ Γ α βθ γ β/αγθ γ αγ β Γ α\β Γα β Γ β/α Figure 1: Te sequent presentation of L. NP NP S S NP NP S S NP NP \S S NP \S NP \S S/(NP \S) NP \S S S/(NP \S) (NP \S)/NP NP S Wo loves im Figure 2: A erivation for Wo loves im?. be viewe as te ept of te nesting of argument implications, is efine as: o(α) = 0 for α a basic category o(α/β) = o(β\α) = max(o(α),o(β) + 1) For example, o((np\s)/np) = 1 an o((s/ NP)\(S/NP)) = 2. 3 Relate work Two oter papers ave provie algoritms similar to te one presente ere. Carpenter an Morrill (2005) provie a grap representation an a ynamic programming algoritm for parsing in te Lambek calculus wit prouct. However, ue to tere use of te Lambek calculus wit prouct an to teir coice of correctness conitions, tey i not obtain a polynomial time algoritm for any significant fragment of te calculus. Aarts (1994) provie an algoritm for L 2 wic is not correct for L. Ours is polynomial time for L k, for any constant k, an is correct for L, albeit in exponential running time. A number of autors ave provie polynomial time algoritms for parsing wit CCG wic gives some insigt into ow goo our boun of O(n 5 ) is. In particular, Vijay-Sanker an Weir (1994) provie a cart parsing algoritm for CCG wit a time boun of O(n 6 ). 4 An algoritm for parsing wit L Tis section presents a cart parsing algoritm similar to CYK were entries in te cart are arcs annotate wit graps. Te graps will be referre
3 to as abstract term graps (ATGs) since tey are grap representations of abstractions over semantic terms. ATGs will be presente in tis section by construction. See section 5 for teir connection to te proof structures of Roora (1991). Te algoritm consists of two steps. First, te base case is compute by builing te base ATG B an etermining te set of surface variables by using te proof frames of Roora (1991). Secon, te cart is fille in iteratively accoring to te algoritms specifie in te appenix. Te etails for tese two steps can be foun in sections 4.1 an 4.2, respectively. Section 4.3 introuces a proceure for culling extraneous ATGs wic is necessary for te polynomial time proof an section 4.4 iscusses recovery of proofs from te packe cart. An example of te algoritm is given in figure 3. For parsing wit L, te input is a sequent an for parsing wit L k, te input is a sequent wit categories wose orer is boune by k. Upon completion, te algoritm outputs YES if tere is an arc from 0 to n 1 an NO oterwise. 4.1 Computing te base case Computing te base case consists of builing te proof frame an ten translating it into a grap, te base ATG B Builing te proof frame Proof frames are te part of te teory of proof nets wic we nee to buil te base ATG. Te proof frame for a sequent is a structure built on top of te categories of te sentence. To buil te proof frame, all categories in te sequent are assigne a polarity an labelle by a fres variable. Categories to te left of are assigne negative polarity an te category to te rigt of is assigne positive polarity. Ten, te four ecomposition rules sown in table 1 are use to buil a tree-like structure (see figure 3). Te ecomposition rules are rea from bottom to top an sow ow to ecompose a category base on its main connective an polarity. In table 1, is te label of te category being ecompose, f, g an are fres variables an orer of premises is important. Te bottom of te proof frame consists of te original sequent s categories wit labels an polarities. Tese are calle terminal formulae. Te top of te proof frame consists of basic categories wit labels an polarities. Tese are calle te axiomatic formulae. In aition, we will istinguis α + : f β : f α\β : α : f β + : f α/β : β + : α : g α\β + : β : g α + : α/β + : Table 1: Te proof frame ecomposition rules. te leftmost variable in te label of eac axiomatic formula as its surface variable. See figure 3 for an example Builing te Base ATG Te base ATG B is built from te proof frame in te following way. Te vertices of te base ATG are te surface variables plus a new special vertex τ. Te eges of ATGs come in two forms: Labelle an unlabele, specifie as s,, l an s,, respectively, were s is te source, is te estination an l, were present, is te label. To efine te ege set of B, we nee te following: Definition. For a variable u tat labels a positive category in a proof frame, te axiomatic reflection, ρ(u), is te unique surface variable v suc tat on te upwar pat from u an v in te proof frame, tere is no formula of negative polarity. For example, in figure 3, ρ(b) = c. Te egeset E of te base ATG is as follows: 1. m,ρ(p i ) E for 1 i k were mp 1...p k appears as te label of some negative axiomatic formula 2. τ,ρ(t) E were t is te label of te positive terminal formula 3. For eac rule wit a positive conclusion, negative premise labelle by g an positive premise labelle by, ρ(), g, g E A labele ege in an ATG specifies tat its source must eventually connect to its estination to complete a pat corresponing to its label. For example, G 1 contains te ege c,e, wic inicates tat to complete te pat from c to, we must connect c to e. In contrast, an unlabele ege in an ATG specifies tat its source is alreay connecte to its estination. For example, in figure 3, G 3 contains te ege a,f wic inicates tat tere is some pat, over previously elete noes, wic connects a to f.
4 B = a c e f g G 6 = G 5 = τ a G 3 = a f G 4 = τ g a c G 1 = a c e f G 2 = a c e g B B B B B B B Cart 0 a 1 c 2 3 g 4 e 5 f 6 7 i S : ab S + : c NP : NP + : g S : efg NP + : f NP : S + : i NP \S + : b NP \S : ef S/(NP \S) : a (NP \S)/NP : e Wo loves im? Figure 3: Te algoritm s final state on te sequent S/(NP \S) (NP \S)/NP NP S. Surface Variables Proof Frame Sentence Note tat all noes in an ATG ave unlabele in-egree of eiter 0 or 1 an tat te vertices of an ATG are te surface variables foun outsie its arc. 4.2 Filling in te cart Once te base ATG an te sequence of surface variables is etermine, we can begin filling in te cart. Te term entry refers to te collection of arcs beginning an ening at te same noes of te cart. An arc s lengt is te ifference between its beginning an en points, wic is always o. Note tat eac entry in te example in figure 3 contains only one arc. We will iterate across te entries of te cart an at eac entry, we will attempt a Bracketing an a number of Ajoinings. If an attempt results in a violation, no new ATG is inserte into te cart. Oterwise, a new ATG is compute an inserte at an appropriate entry. Bracketing is an operation on a single ATG were we attempt to exten its arc by connecting two noes wit te same basic category an opposite polarity. For example, G 3 is te result of bracketing G 1. Ajoining, on te oter an, is an operation on two ajacent ATGs were we attempt to unify teir ATGs into one larger ATG. For example, G 5 is te result of ajoining G 3 an G 2. Te cart filling process is escribe by algoritm 1 in te appenix. Te cart in figure 3 is fille by te graps G 1,...,G 6, in tat orer. A walk troug of te example is given in te remainer of tis section. Arcs of lengt 1 are treate specially, since tey are erive irectly from te base ATG. To sow tis, te base ATG is sown at pseuo-noes, labele by Bs Inserting arcs of lengt 1 Tis section correspons to lines 1-2 of algoritm 1 in te appenix. For eac arc from i to i+1, we will attempt to bracket te base ATG from axiomatic formula i to axiomatic formula i + 1. To follow our example, te first step is to consier inserting an arc from 0 to 1 by bracketing B. Bracketing causes a positive surface variable to be connecte to a negative surface variable an in tis case, a cycle from a to c an back to a is forme resulting in te violation on line 12 of algoritm 2. Terefore, no arc is inserte. Ten, te secon step consiers inserting an arc from 1 to 2. However, axiomatic formula 1 as category S an axiomatic formula 2 as category NP wic results in te violation on line 3 of algoritm 2 since tey are not te same. Next, we attempt to insert an arc from 2 to 3. In tis case, no violations occur meaning tat we can insert te arc. Te intuition is tat te ATG for tis arc is obtaine by connecting g to in te base ATG. Since c must eventually connect to (c ), an now g connects to, te inegree constraint on ATG noes requires tat te pat connecting c to pass troug g. Furter-
5 a c e f a c e f a f Figure 4: Te intuition for bracketing from c to e. more, te only way to connect c to g is troug e. So c e. Ten, we elete an g. Tis proceure continues until we ave consiere all possible arcs of lengt Inserting arcs of lengt 3 an greater Next, we iterate across graps in te cart an for eac, consier weter its ATG can be brackete wit te axiomatic formulae on eiter sie of it an weter it can be ajoine wit any of te oter graps in te cart. Tis process closely resembles CYK parsing as escribe on lines 3-10 of algoritm 1. Te coice of sortest to longest is important because part of te invariant of our ynamic program is tat all erivable ATGs on sorter arcs ave alreay been ae. Following our example, te first grap to be consiere is G 1. First, we attempt to bracket it from axiomatic formulae 1 to 4. As before, tis intuitively involves connecting c to e in te ATG for tis arc. Tis is allowe because no cycles are forme an no labelle eges are proibite from eventually being connecte. Ten, as before, we elete te vertices c an e an as a result connect a to f, resulting in G 3. Te bracketing process is illustrate in figure 4. Next, we consier all graps to wic G 1 coul ajoin an tere are none, since suc graps woul nee to annotate arcs wic eiter en at 1 or begin at 4. After processing G 1, we process G 2, wic as a successful bracketing resulting in G 4 an no successful ajoinings. Next, we process G 3. Bracketing it is proibite, as it woul result in a cycle from a to f an back to a. However, it is possible to ajoin G 3 wit G 2, since tey are ajacent. Te ajoining of two graps can be viewe as a kin of intersection of te two ATGs, in te sense tat we are combining te information in bot graps to yiel a single more concise grap. Attempting an ajoining involves traversing te two graps being ajoine an te base ATG in bot a forwar an a backwar irection as specifie in algoritms 4 an 5 in te appenix. Te intuition bein tese traversals is to generate a picture of wat te combination of te two a f a c e g a c e f g a Figure 5: Te intuition for ajoining two ATGs. graps must look like as illustrate in figure 5. In general, we can only reconstruct tose parts of te grap wic are necessary for etermining te resultant ATG an no more. Te otte eges inicate uncertainty about te eges present at tis stage of te algoritm. Ajoining G 2 an G 3 oes not fail an te resultant grap is G 5. Note tat tis example oes not contain any instances of two ientical ATGs being inserte multiple times into te cart wic occurs often in large examples yieling significant savings of computation. 4.3 Culling of extraneous ATGs It often appens tat an entry in te cart contains two ATGs suc tat if one of tem is extenable to a complete proof ten te oter necessarily is as well. In tis case, te former can be iscare. We will outline suc a meto ere tat is important for te polynomial time proof. Definition. ATGs G 1 an G 2 are equivalent if some surjection of ege labels to ege labels applie to te tose of G 1 yiels tose of G 2. Ten, if two ATGs in a cart are equivalent, one can be iscare. 4.4 Recovering proofs from a packe cart Te algoritm as escribe above is a meto for answering te ecision problem for sequent erivability in te Lambek calculus. However, we can annotate te ATGs wit te ATGs tey are erive from so tat a complete set of Roora-style proof nets, an tus te proofs temselves, can be recovere. 5 Correctness Correctness of te algoritm is obtaine by using structural inuction to prove te equivalence of te constructive efinition of ATGs outline in section 4 an a efinition base on semantic terms given in tis section:
6 S + : c NP : S : ab NP \S + : b S/(NP \S) : a NP + : g S : efg NP \S : ef NP + : f (NP \S)/NP : e NP : S + : i Figure 6: A proof structure for Wo loves im?. Definition. A partial proof structure is a proof frame togeter wit a matcing of te axiomatic formulae. A proof structure is a partial proof structure wose matcing is complete. An example is given in figure 6. Proof structures correspon to proofs uner certain conitions an our conitions will be base on te semantic term of te proof given to us by te Curry-Howar isomorpism for te Lambek calculus (Roora, 1991). To o tis, we interpret left rules as functional application an rigt rules as functional abstraction of lamba terms. Uner tis interpretation, te semantic term obtaine from te proof structure in figure 6 is aλ.e. As in Roora (1991), proof structures correspon to a proof if te semantic term assigne to te sentence category is a well forme lamba term wic inclues all te terms assigne to te wors of te sentence. Ten, ATGs are grap representations of abstractions of te unetermine portion of semantic terms of partial proof structures. Unlabele eges correspon to functional applications wose arguments must still be etermine an labelle eges correspon to functional abstractions wose boy oes not yet contain an instance of te abstracte variable. Te violations wic occur uring te execution of te algoritm correspon to te various ways in wic a lamba term can be ill forme. 6 Asymptotic Running Time Complexity In tis section we provie proof sketces for te runtime of te algoritm. Let f(n) be a boun on te number of arcs occurring in an entry in te cart were n is te number of axiomatic formulae. Ten, observe tat te number of eges witin an ATG is O(n 2 ) an te number of eges ajacent to a vertex is O(n), ue to basic properties of ATGs. Ten, it is not ar to prove tat te worst case running time of Bracketing is O(n 2 ), wic is ominate by te for loops of lines of algoritm 2. Next, wit some effort, we can see tat te worst case running time of Ajoining is ominate by te execution of te proceures Fore an Back. But, since tere are at most a linear number of labels l an for eac label l we nee to visit eac vertex in G 1 an G 2 at most a constant number of times, te worst case running time is O(n 2 ). Ten, for eac ATG, we attempt at most one bracketing an ajoinings wit at most 2n+1 oter entries for wic tere can be (2n+1)f(n) ATGs. Terefore, eac entry can be processe in worst case time O(n 3 f(n) 2 ). Finally, tere are O(n 2 ) entries in te cart, wic means tat te entire algoritm takes time O(n 5 f(n) 2 ) in te worst case. Sections 6.1 an 6.2 iscuss te function f(n). 6.1 Runtime for L k By structural inuction on te proof frame ecomposition rules an te base ATG builing algoritm, it can be proven tat in L k te lengt of te longest pat in te base ATG is boune by k. Next, consier a partition of te surface variables into a pair of sets suc tat te axiomatic formulae corresponing to te surface variables witin eac set are contiguous. For te example in figure 3, one suc pair of sets is S 1 = {a,c,,g} an S 2 = {e,f,,i}. Ten, given suc a partition, it can be proven tat tere is at least one maximal pat P in te base ATG suc tat all vertices in one set tat are ajacent to a vertex in te oter set are eiter in P or ajacent to some vertex in P. For example, a maximal pat for S 1 an S 2 is P = e g. An entry in te cart inuces two suc partitions, one at te left ege of te entry an one at te rigt ege. Terefore, we obtain two suc maximal pats an for any ATG G in tis entry an any vertex v not in or ajacent to one of tese pats, eiter v is not in G or v as te same neigbouroo in G as it as in te base ATG. Ten, te number of vertices ajacent to vertices in tese pats can be as many as n. However, if we put tese vertices into sets suc tat vertices in a set ave ientical
7 neigbouroos, te number of sets is epenant only on k. In te worst case, te out-neigbouroo of one of tese sets can be any set of tese sets. So, we get a boun for f(n) to be O(k 2 4 k ). Terefore, because k is constant in L k, f(n) is constant an te running time of te algoritm for L k is O(n 5 ) in te worst case. 6.2 Runtime for L Despite te results of section 6.1, tis algoritm as an exponential running time for L. We emonstrate tis wit te following set of parameterize sequents: F(1) = ((A/A)\A)\A F(i) = ((A/(A/F i 1 ))\A)\A for i > 1 U(n) = F n F n A\A Teorem. Tere are (2n 1)! n!(n 1)! Θ(4 n ) istinct arcs in te entry from n to 3n 1 in te cart for U(n). Proof. By inuction an a mapping from te possible matcings to te possible permutations of a sequence of lengt 2n 1 suc tat two subsequences of lengt n an n 1 are in orer. 7 Conclusions an Future Work We ave presente a novel algoritm for parsing in te Lambek calculus, sketce its correctness an sown tat it is polynomial time in te bouneorer case. Furtermore, we presente a set of parameterize sequents proving tat te algoritm is exponential time in te general case, wic ais future researc in fining eiter a polynomial time algoritm or an NP-completeness proof for L. In aition, tis algoritm provies anoter step towar evaluating te Lambek calculus against bot CFGs (to evaluate te importance of Categorial Grammar) an CCG (to evaluate te importance of te milly context-sensitive languages). In te future, we plan on etermining te running time of tis algoritm on an actual corpus, suc as a moifie version of CCGbank, an ten to empirically evaluate te Lambek calculus for natural language processing. In aition, we woul like to investigate extening tis algoritm to more complex variants of te Lambek calculus suc as te multi-moal calculus using te proof nets of Moot an Puite (2002). Acknowlegments Many tanks to Geral Penn, for is insigtful comments an for guiing tis researc. References Aarts, Erik Proving Teorems of te Secon Orer Lambek Calculus in Polynomial Time. Stuia Logica, 53: Ajukiewicz, Kazimierz Die syntaktisce Konnexitat. Stuia Pilosopica, 1(1-27). Bos, Joan an Katja Markert Recognising textual entailment wit logical inference. Proceeings of HLT an EMNLP, pages Carpenter, Bob an Glyn Morrill Switc Graps for Parsing Type Logical Grammars. Proceeings of IWPT 05, Vancouver. Clark, Steven an James R. Curran Parsing te WSJ using CCG an log-linear moels. Proceeings of ACL 04, pages Dowty, Davi R., Robert E. Wall, an Stanley Peters Introuction to Montague Semantics. Reiel. Hockenmaier, Julia Data an Moels for Statistical Parsing wit Combinatory Categorial Grammar. P.D. tesis, University of Einburg. Josi, Aravin K., K. Vijay-Sanker, an Davi J. Weir Te Convergence of Milly Context-sensitive Grammar Formalisms. University of Pennsylvania. Lambek, Joacim Te matematics of sentence structure. American Matematical Montly, 65: Montague, Ricar Formal pilosopy: selecte papers of Ricar Montague. Yale University Press New Haven. Moortgat, Micael Multimoal linguistic inference. Journal of Logic, Language an Information, 5(3): Moot, Ricar an Quintijn Puite Proof Nets for te Multimoal Lambek Calculus. Stuia Logica, 71(3): Pentus, Mati Prouct-Free Lambek Calculus an Context-Free Grammars. Te Journal of Symbolic Logic, 62(2): Pentus, Mati Lambek calculus is NP-complete. Teoretical Computer Science, 357(1-3): Roora, Dirk Resource Logics: Proofteoretical Investigations. P.D. tesis, Universiteit van Amsteram. Steeman, Mark Te Syntactic Process. Brafor Books.
8 Vijay-Sanker, K. an Davi J. Weir Parsing Some Constraine Grammar Formalisms. Computational Linguistics, 19(4): Appenix. Algoritm Pseuocoe Te term source set refers to te outneigbouroo of τ. Te term minus variable refers to surface variables obtaine from negative axiomatic formulae plus τ. X i refers to te i t axiomatic formula. Algoritm 1 Cart Iteration 1: for i = 0 to n 1 o 2: Bracketing(B, X i, X i+1) 3: for l = 1, 3,5,... to n 1 o 4: for e = 0 to n l 1 o 5: for eac arc from e to e + l wit ATG G o 6: Bracketing(G, X e 1 to X e+l+1 ) 7: Ajoin G to ATGs from e l 1 to e 1 8: for al = 1, 3,..., l 2 o 9: Ajoin G to ATGs from e al 1 to e 1 10: Ajoin G to ATGs from e+l+1 to e+l+al+1 Algoritm 2 Bracketing(G, X i, X j ) p i p j 1: C i : l i = X i an C j : l j = X j 2: if C i C j ten 3: V iolation : Mismatce Basic Categories 4: if p i = p j ten 5: V iolation : Mismatce Polarities 6: Let m,p {i, j} suc tat p m is negative an p p is positive 7: if G is not from 1 to n 1 an te source set of G is te singleton l p an l m as out-egree 0 in G ten 8: V iolation : Empty Source Set 9: if te ege l m, l p G ten 10: V iolation : Cycle Exists 11: if l p is in te source set of G an tere exists an in-ege of m wit label l suc tat no ege from p to m as label l an no ege from a vertex oter tan p to a vertex oter tan m as label l ten 12: V iolation : Pat Completion Impossible 13: if m as out-egree 0 an an tere exists an out-ege of p wit label l suc tat no ege from p to m as label l an no ege from a vertex oter tan p to a vertex oter tan m as label l ten 14: V iolation : Pat Completion Impossible 15: Copy G to yiel H 16: for eac ege l p, l m, l G o 17: Delete all eges from H wit label l 18: Delete l m, l p an all teir incient eges from H 19: Let in p be te in-neigbour of l p in G 20: for eac q in te out-neigbouroo of l m in G o 21: Insert in p, q into H 22: for eac ege p,, l in G o 23: Insert q,, l into H 24: for eac ege q, m, l in G o 25: Insert q, in p, l into H 26: if H contains a cycle ten 27: V iolation : Future Cycle Require 28: return H Algoritm 3 Ajoining(G 1, G 2 ) 1: Let V H be te intersection of te vertices in G 1 an G 2 2: if V H τ an Fore(τ, G 1, G 2) V H = ten 3: V iolation : Empty Source Set 4: for eac l suc tat l labels an ege in G 1 an G 2 o 5: Let p, m, l be te unique ege labelle l in B 6: if Fore(p,G 1, G 2, l) Back(m,G 1, G 2) = ten 7: if Fore(p) V H = ten 8: V iolation : Pat Completion Impossible 9: if Back(m) V H = τ ten 10: V iolation : Pat Completion Impossible 11: Let H be te grap wit vertex set V H an no eges 12: for eac minus variable m V H o 13: for eac p Fore(m,G 1, G 2, ) o 14: Insert m,p into H 15: for eac l suc tat l labels an ege in G 1 an G 2 o 16: Let p, m, l be te unique ege labelle l in B 17: if Fore(p,G 1, G 2, l) Back(m,G 1, G 2) = ten 18: for eac q Fore(p,G 1, G 2, l) V H o 19: Insert q, Back(m, G 1, G 2) V H, l into H 20: return H Algoritm 4 Fore(v, G 1, G 2, l) 1: if v G 1 an v G 2 ten 2: return {v} 3: else 4: if v is a minus vertex ten 5: S = i {1,2} Out-neigbouroo Gi v 6: else if v is a plus vertex ten 7: Let j be suc tat v G j 8: S = e Eges labelle byl Source of e F = S 9: wile S is not empty o 10: Remove any element u from S 11: Let m be te in-neigbour of u in B 12: if u oes not appear in one of G 1, G 2 an m oes not appear in te oter ten 13: Let i be suc tat m G i 14: Let O be te out-neigbouroo of m in G i 15: S = S O 16: F = F O 17: F = F {m} 18: return F Algoritm 5 Back(m, G 1, G 2 ) 1: if m G 1 an m G 2 ten 2: return {m} 3: else 4: Let i, j {1, 2} be suc tat m G i an m / G j 5: Let m be te estination of te eges labelle by m in G j 6: M = {m, m } 7: wile m / G 1 an m / G 2 o 8: Let i, j {1, 2} be suc tat m G i an m / G j 9: Let p G j be an out-neigbour of m in B 10: Let m be te in-neigbour of p in G j 11: m = m 12: M = M {m } 13: return M
Chapter Primer on Differentiation
Capter 0.01 Primer on Differentiation After reaing tis capter, you soul be able to: 1. unerstan te basics of ifferentiation,. relate te slopes of te secant line an tangent line to te erivative of a function,.
More informationLC Graphs for the Lambek calculus with product
LC Graphs for the Lambek calculus with product Timothy A D Fowler July 18, 2007 1 Introduction The Lambek calculus, introduced in Lambek (1958), is a categorial grammar having two variants which will be
More information0.1 Differentiation Rules
0.1 Differentiation Rules From our previous work we ve seen tat it can be quite a task to calculate te erivative of an arbitrary function. Just working wit a secon-orer polynomial tings get pretty complicate
More informationf(x + h) f(x) f (x) = lim
Introuction 4.3 Some Very Basic Differentiation Formulas If a ifferentiable function f is quite simple, ten it is possible to fin f by using te efinition of erivative irectly: f () 0 f( + ) f() However,
More informationA Polynomial Time Algorithm for Parsing with the Bounded Order Lambek Calculus
A Polynomial Time Algorithm for Parsing with the Bounded Order Lambek Calculus Timothy A. D. Fowler Department of Computer Science University of Toronto 10 King s College Rd., Toronto, ON, M5S 3G4, Canada
More information1 Lecture 13: The derivative as a function.
1 Lecture 13: Te erivative as a function. 1.1 Outline Definition of te erivative as a function. efinitions of ifferentiability. Power rule, erivative te exponential function Derivative of a sum an a multiple
More information160 Chapter 3: Differentiation
3. Differentiation Rules 159 3. Differentiation Rules Tis section introuces a few rules tat allow us to ifferentiate a great variety of functions. By proving tese rules ere, we can ifferentiate functions
More informationRules of Differentiation
LECTURE 2 Rules of Differentiation At te en of Capter 2, we finally arrive at te following efinition of te erivative of a function f f x + f x x := x 0 oing so only after an extene iscussion as wat te
More informationDerivatives of trigonometric functions
Derivatives of trigonometric functions 2 October 207 Introuction Toay we will ten iscuss te erivates of te si stanar trigonometric functions. Of tese, te most important are sine an cosine; te erivatives
More informationSECTION 2.1 BASIC CALCULUS REVIEW
Tis capter covers just te very basics of wat you will nee moving forwar onto te subsequent capters. Tis is a summary capter, an will not cover te concepts in-ept. If you ve never seen calculus before,
More information1 ode.mcd. Find solution to ODE dy/dx=f(x,y). Instructor: Nam Sun Wang
Fin solution to ODE /=f(). Instructor: Nam Sun Wang oe.mc Backgroun. Wen a sstem canges wit time or wit location, a set of ifferential equations tat contains erivative terms "/" escribe suc a namic sstem.
More informationDifferentiation Rules c 2002 Donald Kreider and Dwight Lahr
Dierentiation Rules c 00 Donal Kreier an Dwigt Lar Te Power Rule is an example o a ierentiation rule. For unctions o te orm x r, were r is a constant real number, we can simply write own te erivative rater
More informationMath 242: Principles of Analysis Fall 2016 Homework 7 Part B Solutions
Mat 22: Principles of Analysis Fall 206 Homework 7 Part B Solutions. Sow tat f(x) = x 2 is not uniformly continuous on R. Solution. Te equation is equivalent to f(x) = 0 were f(x) = x 2 sin(x) 3. Since
More informationExam 1 Review Solutions
Exam Review Solutions Please also review te old quizzes, and be sure tat you understand te omework problems. General notes: () Always give an algebraic reason for your answer (graps are not sufficient),
More information1 The concept of limits (p.217 p.229, p.242 p.249, p.255 p.256) 1.1 Limits Consider the function determined by the formula 3. x since at this point
MA00 Capter 6 Calculus and Basic Linear Algebra I Limits, Continuity and Differentiability Te concept of its (p.7 p.9, p.4 p.49, p.55 p.56). Limits Consider te function determined by te formula f Note
More informationDifferential Calculus Definitions, Rules and Theorems
Precalculus Review Differential Calculus Definitions, Rules an Teorems Sara Brewer, Alabama Scool of Mat an Science Functions, Domain an Range f: X Y a function f from X to Y assigns to eac x X a unique
More informationEfficient algorithms for for clone items detection
Efficient algoritms for for clone items detection Raoul Medina, Caroline Noyer, and Olivier Raynaud Raoul Medina, Caroline Noyer and Olivier Raynaud LIMOS - Université Blaise Pascal, Campus universitaire
More informationdoes NOT exist. WHAT IF THE NUMBER X APPROACHES CANNOT BE PLUGGED INTO F(X)??????
MATH 000 Miterm Review.3 Te it of a function f ( ) L Tis means tat in a given function, f(), as APPROACHES c, a constant, it will equal te value L. Tis is c only true if f( ) f( ) L. Tat means if te verticle
More informationIn Leibniz notation, we write this rule as follows. DERIVATIVE OF A CONSTANT FUNCTION. For n 4 we find the derivative of f x x 4 as follows: lim
.1 DERIVATIVES OF POLYNOIALS AND EXPONENTIAL FUNCTIONS c =c slope=0 0 FIGURE 1 Te grap of ƒ=c is te line =c, so fª()=0. In tis section we learn ow to ifferentiate constant functions, power functions, polnomials,
More information5.1 We will begin this section with the definition of a rational expression. We
Basic Properties and Reducing to Lowest Terms 5.1 We will begin tis section wit te definition of a rational epression. We will ten state te two basic properties associated wit rational epressions and go
More informationHy Ex Ez. Ez i+1/2,j+1. Ex i,j+1/2. γ z. Hy i+1/2,j+1/2. Ex i+1,j+1/2. Ez i+1/2,j
IEEE TRANSACTIONS ON, VOL. XX, NO. Y, MONTH 000 100 Moeling Dielectric Interfaces in te FDTD-Meto: A Comparative Stuy C. H. Teng, A. Ditkowski, J. S. Hestaven Abstract In tis paper, we present special
More informationLecture Notes Di erentiating Trigonometric Functions page 1
Lecture Notes Di erentiating Trigonometric Functions age (sin ) 7 sin () sin 8 cos 3 (tan ) sec tan + 9 tan + 4 (cot ) csc cot 0 cot + 5 sin (sec ) cos sec tan sec jj 6 (csc ) sin csc cot csc jj c Hiegkuti,
More informationDifferential Calculus: Differentiation (First Principles, Rules) and Sketching Graphs (Grade 12) *
OpenStax-CNX moule: m39313 1 Differential Calculus: Differentiation (First Principles, Rules) an Sketcing Graps (Grae 12) * Free Hig Scool Science Texts Project Tis work is prouce by OpenStax-CNX an license
More informationContinuity and Differentiability Worksheet
Continuity and Differentiability Workseet (Be sure tat you can also do te grapical eercises from te tet- Tese were not included below! Typical problems are like problems -3, p. 6; -3, p. 7; 33-34, p. 7;
More informationDerivatives. if such a limit exists. In this case when such a limit exists, we say that the function f is differentiable.
Derivatives 3. Derivatives Definition 3. Let f be a function an a < b be numbers. Te average rate of cange of f from a to b is f(b) f(a). b a Remark 3. Te average rate of cange of a function f from a to
More informationSymmetry Labeling of Molecular Energies
Capter 7. Symmetry Labeling of Molecular Energies Notes: Most of te material presented in tis capter is taken from Bunker and Jensen 1998, Cap. 6, and Bunker and Jensen 2005, Cap. 7. 7.1 Hamiltonian Symmetry
More information4. The slope of the line 2x 7y = 8 is (a) 2/7 (b) 7/2 (c) 2 (d) 2/7 (e) None of these.
Mat 11. Test Form N Fall 016 Name. Instructions. Te first eleven problems are wort points eac. Te last six problems are wort 5 points eac. For te last six problems, you must use relevant metods of algebra
More informationMVT and Rolle s Theorem
AP Calculus CHAPTER 4 WORKSHEET APPLICATIONS OF DIFFERENTIATION MVT and Rolle s Teorem Name Seat # Date UNLESS INDICATED, DO NOT USE YOUR CALCULATOR FOR ANY OF THESE QUESTIONS In problems 1 and, state
More informationThe derivative function
Roberto s Notes on Differential Calculus Capter : Definition of derivative Section Te derivative function Wat you need to know already: f is at a point on its grap and ow to compute it. Wat te derivative
More informationUniversity Mathematics 2
University Matematics 2 1 Differentiability In tis section, we discuss te differentiability of functions. Definition 1.1 Differentiable function). Let f) be a function. We say tat f is differentiable at
More information30 is close to t 5 = 15.
Limits Definition 1 (Limit). If te values f(x) of a function f : A B get very close to a specific, unique number L wen x is very close to, but not necessarily equal to, a limit point c, we say te limit
More informationImproved Algorithms for Largest Cardinality 2-Interval Pattern Problem
Journal of Combinatorial Optimization manuscript No. (will be inserted by te editor) Improved Algoritms for Largest Cardinality 2-Interval Pattern Problem Erdong Cen, Linji Yang, Hao Yuan Department of
More informationarxiv: v1 [math.na] 18 Nov 2011
MIMETIC FRAMEWORK ON CURVILINEAR QUADRILATERALS OF ARBITRARY ORDER JASPER KREEFT, ARTUR PALHA, AND MARC GERRITSMA arxiv:1111.4304v1 [mat.na] 18 Nov 2011 Abstract. In tis paper iger orer mimetic iscretizations
More informationDIGRAPHS FROM POWERS MODULO p
DIGRAPHS FROM POWERS MODULO p Caroline Luceta Box 111 GCC, 100 Campus Drive, Grove City PA 1617 USA Eli Miller PO Box 410, Sumneytown, PA 18084 USA Clifford Reiter Department of Matematics, Lafayette College,
More information(a 1 m. a n m = < a 1/N n
Notes on a an log a Mat 9 Fall 2004 Here is an approac to te eponential an logaritmic functions wic avois any use of integral calculus We use witout proof te eistence of certain limits an assume tat certain
More informationHow to Find the Derivative of a Function: Calculus 1
Introduction How to Find te Derivative of a Function: Calculus 1 Calculus is not an easy matematics course Te fact tat you ave enrolled in suc a difficult subject indicates tat you are interested in te
More informationNumerical Differentiation
Numerical Differentiation Finite Difference Formulas for te first derivative (Using Taylor Expansion tecnique) (section 8.3.) Suppose tat f() = g() is a function of te variable, and tat as 0 te function
More informationFunctional Analysis Techniques as a Mathematical tools in Wavelets Analysis
Saer El-Sater, et. al., JOURNAL OF PHYSICS VOL. NO. Feb. (0) PP. 0-7 Functional Analysis Tecniques as a Matematical tools in Wavelets Analysis Saer El-sater, Ramaan Sale Tantawi an A. Abel-afiez Abstract
More informationAuctions, Matching and the Law of Aggregate Demand
Auctions, Matcing an te Law of Aggregate eman Jon William atfiel an Paul Milgrom 1 February 12, 2004 Abstract. We evelop a moel of matcing wit contracts wic incorporates, as special cases, te college amissions
More informationPacking Graphs: The packing problem solved
Packing Graps: Te packing problem solve Yair Caro an Rapael Yuster Department of Matematics University of Haifa-ORANIM, Tivon 36006, Israel. AMS Subject Classification: 05B05,05B40 (primary), 05B30,51E05,94C30,6K05,6K10
More informationPreface. 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.
Preface Here are my online notes for my course tat I teac ere at Lamar University. Despite te fact tat tese are my class notes, tey sould be accessible to anyone wanting to learn or needing a refreser
More informationMathematics 5 Worksheet 11 Geometry, Tangency, and the Derivative
Matematics 5 Workseet 11 Geometry, Tangency, and te Derivative Problem 1. Find te equation of a line wit slope m tat intersects te point (3, 9). Solution. Te equation for a line passing troug a point (x
More informationCharacterization of reducible hexagons and fast decomposition of elementary benzenoid graphs
Discrete Applied Matematics 156 (2008) 1711 1724 www.elsevier.com/locate/dam Caracterization of reducible exagons and fast decomposition of elementary benzenoid graps Andrej Taranenko, Aleksander Vesel
More informationThis file is /conf/snippets/setheader.pg you can use it as a model for creating files which introduce each problem set.
Yanimov Almog WeBWorK assignment number Sections 3. 3.2 is ue : 08/3/207 at 03:2pm CDT. Te (* replace wit url for te course ome page *) for te course contains te syllabus, graing policy an oter information.
More information. If lim. x 2 x 1. f(x+h) f(x)
Review of Differential Calculus Wen te value of one variable y is uniquely determined by te value of anoter variable x, ten te relationsip between x and y is described by a function f tat assigns a value
More informationLATTICE EXIT MODELS S. GILL WILLIAMSON
LATTICE EXIT MODELS S. GILL WILLIAMSON ABSTRACT. We discuss a class of problems wic we call lattice exit models. At one level, tese problems provide undergraduate level exercises in labeling te vertices
More informationWYSE Academic Challenge 2004 Sectional Mathematics Solution Set
WYSE Academic Callenge 00 Sectional Matematics Solution Set. Answer: B. Since te equation can be written in te form x + y, we ave a major 5 semi-axis of lengt 5 and minor semi-axis of lengt. Tis means
More information2.11 That s So Derivative
2.11 Tat s So Derivative Introduction to Differential Calculus Just as one defines instantaneous velocity in terms of average velocity, we now define te instantaneous rate of cange of a function at a point
More informationf a h f a h h lim lim
Te Derivative Te derivative of a function f at a (denoted f a) is f a if tis it exists. An alternative way of defining f a is f a x a fa fa fx fa x a Note tat te tangent line to te grap of f at te point
More informationTeaching Differentiation: A Rare Case for the Problem of the Slope of the Tangent Line
Teacing Differentiation: A Rare Case for te Problem of te Slope of te Tangent Line arxiv:1805.00343v1 [mat.ho] 29 Apr 2018 Roman Kvasov Department of Matematics University of Puerto Rico at Aguadilla Aguadilla,
More informationA = h w (1) Error Analysis Physics 141
Introduction In all brances of pysical science and engineering one deals constantly wit numbers wic results more or less directly from experimental observations. Experimental observations always ave inaccuracies.
More informationMaterial for Difference Quotient
Material for Difference Quotient Prepared by Stepanie Quintal, graduate student and Marvin Stick, professor Dept. of Matematical Sciences, UMass Lowell Summer 05 Preface Te following difference quotient
More information1. Which one of the following expressions is not equal to all the others? 1 C. 1 D. 25x. 2. Simplify this expression as much as possible.
004 Algebra Pretest answers and scoring Part A. Multiple coice questions. Directions: Circle te letter ( A, B, C, D, or E ) net to te correct answer. points eac, no partial credit. Wic one of te following
More informationBob Brown Math 251 Calculus 1 Chapter 3, Section 1 Completed 1 CCBC Dundalk
Bob Brown Mat 251 Calculus 1 Capter 3, Section 1 Completed 1 Te Tangent Line Problem Te idea of a tangent line first arises in geometry in te context of a circle. But before we jump into a discussion of
More informationDomination Problems in Nowhere-Dense Classes of Graphs
LIPIcs Leibniz International Proceedings in Informatics Domination Problems in Nowere-Dense Classes of Graps Anuj Dawar 1, Stepan Kreutzer 2 1 University of Cambridge Computer Lab, U.K. anuj.dawar@cl.cam.ac.uk
More informationGeneric maximum nullity of a graph
Generic maximum nullity of a grap Leslie Hogben Bryan Sader Marc 5, 2008 Abstract For a grap G of order n, te maximum nullity of G is defined to be te largest possible nullity over all real symmetric n
More informationFunction Composition and Chain Rules
Function Composition an Cain Rules James K. Peterson Department of Biological Sciences an Department of Matematical Sciences Clemson University November 2, 2018 Outline Function Composition an Continuity
More informationCopyright c 2008 Kevin Long
Lecture 4 Numerical solution of initial value problems Te metods you ve learned so far ave obtained closed-form solutions to initial value problems. A closedform solution is an explicit algebriac formula
More informationTermination Problems in Chemical Kinetics
Termination Problems in Cemical Kinetics Gianluigi Zavattaro and Luca Cardelli 2 Dip. Scienze dell Informazione, Università di Bologna, Italy 2 Microsoft Researc, Cambridge, UK Abstract. We consider nondeterministic
More informationTHE IDEA OF DIFFERENTIABILITY FOR FUNCTIONS OF SEVERAL VARIABLES Math 225
THE IDEA OF DIFFERENTIABILITY FOR FUNCTIONS OF SEVERAL VARIABLES Mat 225 As we ave seen, te definition of derivative for a Mat 111 function g : R R and for acurveγ : R E n are te same, except for interpretation:
More informationDifferential Calculus (The basics) Prepared by Mr. C. Hull
Differential Calculus Te basics) A : Limits In tis work on limits, we will deal only wit functions i.e. tose relationsips in wic an input variable ) defines a unique output variable y). Wen we work wit
More informationSFU UBC UNBC Uvic Calculus Challenge Examination June 5, 2008, 12:00 15:00
SFU UBC UNBC Uvic Calculus Callenge Eamination June 5, 008, :00 5:00 Host: SIMON FRASER UNIVERSITY First Name: Last Name: Scool: Student signature INSTRUCTIONS Sow all your work Full marks are given only
More informationIdentification with Conditioning Instruments in Causal Systems
Ientification wit onitioning Instruments in ausal ystems Karim alak Department of Economics Boston ollege Halbert Wite Department of Economics University of alifornia an Diego May 7 007 bstract: We stuy
More information2.8 The Derivative as a Function
.8 Te Derivative as a Function Typically, we can find te derivative of a function f at many points of its domain: Definition. Suppose tat f is a function wic is differentiable at every point of an open
More information2011 Fermat Contest (Grade 11)
Te CENTRE for EDUCATION in MATHEMATICS and COMPUTING 011 Fermat Contest (Grade 11) Tursday, February 4, 011 Solutions 010 Centre for Education in Matematics and Computing 011 Fermat Contest Solutions Page
More information3.4 Worksheet: Proof of the Chain Rule NAME
Mat 1170 3.4 Workseet: Proof of te Cain Rule NAME Te Cain Rule So far we are able to differentiate all types of functions. For example: polynomials, rational, root, and trigonometric functions. We are
More informationNonholonomic Integrators
Nonolonomic Integrators J. Cortés an S. Martínez Laboratory of Dynamical Systems, Mecanics an Control, Instituto e Matemáticas y Física Funamental, CSIC, Serrano 13, 8006 Mari, SPAIN E-mail: j.cortes@imaff.cfmac.csic.es,
More informationSECTION 1.10: DIFFERENCE QUOTIENTS LEARNING OBJECTIVES
(Section.0: Difference Quotients).0. SECTION.0: DIFFERENCE QUOTIENTS LEARNING OBJECTIVES Define average rate of cange (and average velocity) algebraically and grapically. Be able to identify, construct,
More informationPre-Calculus Review Preemptive Strike
Pre-Calculus Review Preemptive Strike Attaced are some notes and one assignment wit tree parts. Tese are due on te day tat we start te pre-calculus review. I strongly suggest reading troug te notes torougly
More informationTime (hours) Morphine sulfate (mg)
Mat Xa Fall 2002 Review Notes Limits and Definition of Derivative Important Information: 1 According to te most recent information from te Registrar, te Xa final exam will be eld from 9:15 am to 12:15
More informationContinuous measurements: partial selection
0 May 00 Pysics Letters A 97 00 300 306 wwwelseviercom/locate/pla Continuous measurements: partial selection YuA Rembovsky Department of Pysics, MV Lomonosov State University, Moscow 119899, Russia Receive
More informationSome Review Problems for First Midterm Mathematics 1300, Calculus 1
Some Review Problems for First Midterm Matematics 00, Calculus. Consider te trigonometric function f(t) wose grap is sown below. Write down a possible formula for f(t). Tis function appears to be an odd,
More informationINTRODUCTION AND MATHEMATICAL CONCEPTS
INTODUCTION ND MTHEMTICL CONCEPTS PEVIEW Tis capter introduces you to te basic matematical tools for doing pysics. You will study units and converting between units, te trigonometric relationsips of sine,
More informationShift Theorem Involving the Exponential of a Sum of Non-Commuting Operators in Path Integrals. Abstract
YITP-SB-6-4 Sift Teorem Involving te Exponential of a Sum of Non-Commuting Operators in Pat Integrals Fre Cooper 1, an Gouranga C. Nayak 2, 1 Pysics Division, National Science Founation, Arlington VA 2223
More informationMAT 145. Type of Calculator Used TI-89 Titanium 100 points Score 100 possible points
MAT 15 Test #2 Name Solution Guide Type of Calculator Used TI-89 Titanium 100 points Score 100 possible points Use te grap of a function sown ere as you respond to questions 1 to 8. 1. lim f (x) 0 2. lim
More informationLab 6 Derivatives and Mutant Bacteria
Lab 6 Derivatives and Mutant Bacteria Date: September 27, 20 Assignment Due Date: October 4, 20 Goal: In tis lab you will furter explore te concept of a derivative using R. You will use your knowledge
More informationLines, Conics, Tangents, Limits and the Derivative
Lines, Conics, Tangents, Limits and te Derivative Te Straigt Line An two points on te (,) plane wen joined form a line segment. If te line segment is etended beond te two points ten it is called a straigt
More information1 Calculus. 1.1 Gradients and the Derivative. Q f(x+h) f(x)
Calculus. Gradients and te Derivative Q f(x+) δy P T δx R f(x) 0 x x+ Let P (x, f(x)) and Q(x+, f(x+)) denote two points on te curve of te function y = f(x) and let R denote te point of intersection of
More informationThe Krewe of Caesar Problem. David Gurney. Southeastern Louisiana University. SLU 10541, 500 Western Avenue. Hammond, LA
Te Krewe of Caesar Problem David Gurney Souteastern Louisiana University SLU 10541, 500 Western Avenue Hammond, LA 7040 June 19, 00 Krewe of Caesar 1 ABSTRACT Tis paper provides an alternative to te usual
More informationName: Answer Key No calculators. Show your work! 1. (21 points) All answers should either be,, a (finite) real number, or DNE ( does not exist ).
Mat - Final Exam August 3 rd, Name: Answer Key No calculators. Sow your work!. points) All answers sould eiter be,, a finite) real number, or DNE does not exist ). a) Use te grap of te function to evaluate
More information232 Calculus and Structures
3 Calculus and Structures CHAPTER 17 JUSTIFICATION OF THE AREA AND SLOPE METHODS FOR EVALUATING BEAMS Calculus and Structures 33 Copyrigt Capter 17 JUSTIFICATION OF THE AREA AND SLOPE METHODS 17.1 THE
More informationStability of equilibrium under constraints: Role of. second-order constrained derivatives
arxiv:78.694 Stability of equilibrium uner constraints: Role of secon-orer constraine erivatives amás Gál Department of eoretical Pysics University of Debrecen 4 Debrecen Hungary Email aress: galt@pys.unieb.u
More informationEssays on Intra-Industry Trade
University of Tennessee, Knoxville Trace: Tennessee Researc an Creative Excange Doctoral Dissertations Grauate Scool 5-2005 Essays on Intra-Inustry Trae Yanong Zang University of Tennessee - Knoxville
More informationMA455 Manifolds Solutions 1 May 2008
MA455 Manifolds Solutions 1 May 2008 1. (i) Given real numbers a < b, find a diffeomorpism (a, b) R. Solution: For example first map (a, b) to (0, π/2) and ten map (0, π/2) diffeomorpically to R using
More informationLIMITS AND DERIVATIVES CONDITIONS FOR THE EXISTENCE OF A LIMIT
LIMITS AND DERIVATIVES Te limit of a function is defined as te value of y tat te curve approaces, as x approaces a particular value. Te limit of f (x) as x approaces a is written as f (x) approaces, as
More informationSPEECH ENHANCEMENT BASED ON A HYBRID A PRIORI SIGNAL-TO-NOISE RATIO (SNR) ESTIMATOR AND A SELF-ADAPTIVE LAGRANGE MULTIPLIER
16t European Signal Processing Conference (EUSIPCO 8), Lausanne, Switzerlan, August -9, 8, copyrigt by EURASIP SPEECH ENHANCEMENT BASED ON A HYBRID A PRIORI SIGNAL-TO-NOISE RATIO () ESTIMATOR AND A SELF-ADAPTIVE
More information1. State whether the function is an exponential growth or exponential decay, and describe its end behaviour using limits.
Questions 1. State weter te function is an exponential growt or exponential decay, and describe its end beaviour using its. (a) f(x) = 3 2x (b) f(x) = 0.5 x (c) f(x) = e (d) f(x) = ( ) x 1 4 2. Matc te
More informationINTRODUCTION AND MATHEMATICAL CONCEPTS
Capter 1 INTRODUCTION ND MTHEMTICL CONCEPTS PREVIEW Tis capter introduces you to te basic matematical tools for doing pysics. You will study units and converting between units, te trigonometric relationsips
More information= 0 and states ''hence there is a stationary point'' All aspects of the proof dx must be correct (c)
Paper 1: Pure Matematics 1 Mark Sceme 1(a) (i) (ii) d d y 3 1x 4x x M1 A1 d y dx 1.1b 1.1b 36x 48x A1ft 1.1b Substitutes x = into teir dx (3) 3 1 4 Sows d y 0 and states ''ence tere is a stationary point''
More informationMA119-A Applied Calculus for Business Fall Homework 4 Solutions Due 9/29/ :30AM
MA9-A Applied Calculus for Business 006 Fall Homework Solutions Due 9/9/006 0:0AM. #0 Find te it 5 0 + +.. #8 Find te it. #6 Find te it 5 0 + + = (0) 5 0 (0) + (0) + =.!! r + +. r s r + + = () + 0 () +
More informationFunction Composition and Chain Rules
Function Composition and s James K. Peterson Department of Biological Sciences and Department of Matematical Sciences Clemson University Marc 8, 2017 Outline 1 Function Composition and Continuity 2 Function
More informationCalculus in the AP Physics C Course The Derivative
Limits an Derivatives Calculus in the AP Physics C Course The Derivative In physics, the ieas of the rate change of a quantity (along with the slope of a tangent line) an the area uner a curve are essential.
More informationContinuity. Example 1
Continuity MATH 1003 Calculus and Linear Algebra (Lecture 13.5) Maoseng Xiong Department of Matematics, HKUST A function f : (a, b) R is continuous at a point c (a, b) if 1. x c f (x) exists, 2. f (c)
More informationch (for some fixed positive number c) reaching c
GSTF Journal of Matematics Statistics and Operations Researc (JMSOR) Vol. No. September 05 DOI 0.60/s4086-05-000-z Nonlinear Piecewise-defined Difference Equations wit Reciprocal and Cubic Terms Ramadan
More information2.4 Exponential Functions and Derivatives (Sct of text)
2.4 Exponential Functions an Derivatives (Sct. 2.4 2.6 of text) 2.4. Exponential Functions Definition 2.4.. Let a>0 be a real number ifferent tan. Anexponential function as te form f(x) =a x. Teorem 2.4.2
More information3.1 Extreme Values of a Function
.1 Etreme Values of a Function Section.1 Notes Page 1 One application of te derivative is finding minimum and maimum values off a grap. In precalculus we were only able to do tis wit quadratics by find
More informationSchrödinger s equation.
Physics 342 Lecture 5 Schröinger s Equation Lecture 5 Physics 342 Quantum Mechanics I Wenesay, February 3r, 2010 Toay we iscuss Schröinger s equation an show that it supports the basic interpretation of
More informationCombining functions: algebraic methods
Combining functions: algebraic metods Functions can be added, subtracted, multiplied, divided, and raised to a power, just like numbers or algebra expressions. If f(x) = x 2 and g(x) = x + 2, clearly f(x)
More informationDerivatives. By: OpenStaxCollege
By: OpenStaxCollege Te average teen in te United States opens a refrigerator door an estimated 25 times per day. Supposedly, tis average is up from 10 years ago wen te average teenager opened a refrigerator
More informationPrecalculus Test 2 Practice Questions Page 1. Note: You can expect other types of questions on the test than the ones presented here!
Precalculus Test 2 Practice Questions Page Note: You can expect oter types of questions on te test tan te ones presented ere! Questions Example. Find te vertex of te quadratic f(x) = 4x 2 x. Example 2.
More information