An Improved Selection of GEP Based on CPCSC-DSC Approach
|
|
- Marybeth Maxwell
- 5 years ago
- Views:
Transcription
1 An Improved Selection of GEP Bsed on CPCSC-DSC Approch Li Wu 1,, Yonghong Yu 2, nd Zhou Zhou 2, c 1 School of Finnce nd Pulic Mngement, Anhui University of Finnce & Economics, Bengu , Chin; 2 School of Mngement Science nd Engineering, Anhui University of Finnce & Economics, Bengu , Chin. Astrct wuli@163.com, c120107@163.com, c @qq.com This pper minly discusses the effects of duplicted chromosomes on genetic diversity, popultion fitness level, evolutionry efficiency, nd evolutionry serch retention during the selection opertion of gene expression progrmming(gep). It introduced the concepts of strict nd non-strict implicit duplicted chromosome nd proposed novel method nmed creting popultion copy for the second choice-deleting sme chromosome(cpcsc_dsc) to remove the duplicted or implicit duplicted chromosomes ccording to the popultion fitness, which cn ensure popultion diversity, evolutionry efficiency nd cn void premture convergence. The experiment result shows tht the CPCSC_DSC ccelertes evolution, increses the fitness of optiml chromosome compred to the result not using CPCSC_DSC. Keywords Gene expression progrmming, Selection opertion, Creting popultion copy for the second choice, Deleting sme chromosome. 1. Introduction After GEP[1,2,3,4] completes certin genertion of evolutionry opertion, new individuls re dded to the popultion, nd the numer of individuls is expnded. These individuls hve different fitness, nd only prt of them re dded to the next genertion. GEP otins fitness of individul through the estlished fitness function, nd tkes the fitness s the criteri of selection, the higher the fitness of individuls is, the greter the proility of eing choosed to dd to the next genertion is. Ech individul in popultion hs selection proility, which is generlly llocted ccording to fitness or rnk ccording to fitness. The proposl ccording to the rtio of fitness is nmed Monte Crlo method, nd the proility of eing selected depends on the proportion of individul fitness proility. The proposl ccording to fitness rnking sorts the trget vlues of the popultion, nd the fitness vlues re determined ccording to the ordinl position. The commonly used selection methods re roulette selection, rndom trversl smpling, elitist selection nd tournment selection. The introduction of elitism strtegy in roulette cn gurntee the glol convergence of the lgorithm, ut hs slow evoultion speed. The tournment strtegy nd elite selection strtegy re esy to fll into locl optimum though they hve fst convergence speed. The popultion initiliztion process of the sic GEP[2,4] lgorithm is completely rndomized, nd the selection scle of the roulette is constnt, nd the diversity of the GEP popultion is reltively simple nd unevenly distriuted. Reference [5] suggests tht elite individuls produce strtegy EPS nd genetic sptil distriution of GSBS initil popultion strtegy, y producing individuls with higher fitness nd improving the genetic diversity of initil popultion, the evolutionry efficiency is improved, nd convergence is voided s locl optiml. Reference[6] proposed OBS lgorithm which mkes use of evolutionry process to eliminte close reltives nd propgte distnt species to enhnce popultion diversity. Reference [7] proposed DAIP lgorithm which uses the weighted diversity mesure to quntify the popultion diversity nd to mximize the popultion diversity. Reference [8] proposed GDM-GEP lgorithm to mesure the diversity of the popultion y the 234
2 individul fitness vrince, y designing n dptive muttion opertor, the lgorithm chnges the muttion rte with the popultion diversity, nd mintins the stility of the popultion nd the preservtion of the excellent individuls. The evolutionl chromosomes sme s the prent chromosome will e dded to the popultion, nd will prticipte in the selection opertor fter fitness evlution. If the duplicted chromosome individul hs higher fitness, the proility of eing selected s the prent chromosome of next genertion will e incresed ccording to the roulette selection method nd the rndom trversl smpling method. In tournment selection nd elitist strtegy, s long s their fitness vlues rech the top of the rnking, they will e selected for the next genertion. Duplicted chromosomes s prent chromosomes re dded to the next popultion my result in three prolems, such s: (1) The diversity of excellent chromosomes in descendnt popultions ws reduced. (2) The popultion fitness level nd evolution efficiency of next genertion efore genetic opertion were reduced. (3) Duplicted chromosomes ssimilte other individuls mlignntly, nd cuse evolutionry serch retention. To sum up, repeted chromosomes hve certin stility. Once certin numer of chromosomes re formed in the popultion, they re difficult to e destroyed y the genetic fctor nd they expnd rpidly. In order to ensure popultion diversity, evolutionry efficiency nd voiding premture convergence, it is necessry to eliminte duplicted chromosomes in the genetic process. This pper introduces the concepts of strict implicit duplicted chromosome nd non-strict implicit duplicted chromosome, nd proposes novel pproch to delete duplicted chromosomes y creting popultion copy for the second choice-deleting sme chromosome(cpcsc-dsc). It dopts the fitness vlue s the judgment rule to determinte whether n individul is duplicted chromosome or strict implicit duplicted chromosome, nd uses the CPCSC-DSC method to supplement the numer of individuls to improve the GEP selection process. 2. Preliminry Terminls nd functions constitute the primitive elements of GEP. The terminls represent to the constnt, input or no prmeter functions in the mthemticl expression, nd correspond to the lef nodes of the expression tree. The functions represent opertors of espicl ppliction, components of progrmm nd middle symols of system, they correspond to the non lef node of expression tree. The expression tree(et) is used s the phenotype of GEP individuls to represent n expression visully. In order to fcilitte computer genetic mnipultion, the nonliner structure of the expression tree is trnslted into liner structure which Ferreir clled K-expression s chromosome of GEP, corresponding to the genotype of GEP individuls. GEP genes re composed of hed nd til[2,4]. The hed contins symols tht represent oth functions nd terminls, wheres the til contins only terminls. Therefore two different lphets occur t different regions within gene. For ech prolem, the length of the hed h is chosen, wheres the length of the til t is function of h nd the numer of rguments of the function with the most rguments n, nd is evluted y the eqution: t = h* (n-1) + 1 (1) Consider gene composed of {+,*,ln,sin,, }. In this cse n = 2. For instnce, for h = 7 nd t = 8, the length of the gene is 7+8=15. One such gene is shown elow: * sin ln nd it codes for the following ET: (2) 235
3 + * sin ln + The corresponding mening of ech chromosome memer in the initil popultion creted y the GEP lgorithm is different. The genetic opertor cts on the genetic mnipultion of the popultion, nd the higher the degree of fitness of the resulting offspring individuls, the greter the proility of eing selected. GEP dopts liner equl-length coding, so long s the length of the gene is constnt nd the til consists only of terminls, legitimte offspring chromosome cn e otined. Therefore, the GEP genetic opertor cn e designed more simply nd flexily. The sic genetic opertors of GEP minly include selection, muttion, trnsposition of insertion sequence elements, root trnsposition, gene trnsposition, one-point recomintion, two-point recomintion, nd gene recomintion. Fitness is n indictor of iologicl ility to mesure the ility of species to dpt to the environment, it cn lso pply to the GEP lgorithm. The fitness function is used to clculte the individul fitness to evlute the pros nd cons. By evluting the chromosomes, expression trees cn e otined, then the ojective function vlues re clculted from the phenotypes, nd finlly, ccording to the conversion rules, the phenotypic (individul) fitness vlues cn e otined using the ojective function vlues. Ferreir proposed two fitness evlution models: one is tht the fitness f j of n individul chromosome j is clculted sed on the solute error, nd the other is clculted sed on the reltive error. Let T e dtset contining n smples, T i is the i-th input dtset, v i is the oserved vlue of T i, nd is the estimted vlue. the fitness equtions re: v ˆi f n j i i i 1 f ( K v vˆ ) (3) j n v ˆ i vi ( K ) (4) v i 1 Through the constrint of the fitness function, the popultion retins the high-dpttion chromosomes during the evolution process. When the individul chromosomes do not hve reltive or solute errors in the smple estimtes, the ccurcy is mximized nd the fitness is mximized. 3. Creting Popultion Copy for the Second Choice-Deleting Sme Chromosome Approch Chromosoml muttion nd recomintion positions re rndom in evolution, nd the lengths involved in muttion nd recomintion re rndom, the chromosomes my not chnge during genetic mnipultion, tht is to sy, duplicted chromosomes re produced, it occurs t the following cses: (1) The elements re identicl fter muttion. (2) The sustring elements involved in the inverted string re symmetric out the middle elements. (3) Sustrings hve the sme type nd order of the elements of string eing inserted during the insertion string opertion, nd the type nd order of the elements of string eing inserted re the sme with the originl elements of position of susequent shift. (4) The type nd order of the two string elements involved in recomintion re the sme. When the length of rndomly generted sustrings is reltively short, the proility of these situtions will increse gretly. The concept of implicit duplicted chromosomes is tht the genotypes of two or more chromosomes in the popultion re different, ut their corresponding phenotype is the sme, nd cn eventully e converted into the sme expression tree. i 236
4 Definition 1. Strict Implicit Duplicted Chromosome: Two or more gene expressions hve the sme ORF nd different noncoding regions, nd cn trverse to the sme expression tree directly. Eqution 5 shows tht two gene expressions re strict implicit duplicted chromosomes, their ORF is the sme (the underlined prt), nd the corresponding expression tree is: exp (5) * Strict implicit duplicted chromosomes entering the prent chromosome constitute descendnt popultion my cuse the following three prolems:reduce genetic diversity of efficient coding segments,reduce the popultion fitness level nd evolution efficiency of next genertion efore genetic opertion, generte more new nd strict implicit repet chromosomes nd even generte duplicted chromosomes. The strict implicit duplicted chromosomes lso hve certin stility, once there is certin numer of them in the popultion, they re difficult to e destroyed y the genetic fctor, nd they expnds nd even produces repeted individuls under the ction of the recomintion opertor. In order to ensure gene frgment diversity, evolutionry efficiency nd prevent the genertion of duplicted chromosomes in the effective coding segment, strict implicit repet chromosomes need to e eliminted in the genetic process. Definition 2. Non-Strict Implicit Duplicted Chromosome: Two or more gene expressions hve different ORF nd noncoding regions, nd the expression trees otined y trversing directly re lso different, ut oth the expression tree cn e simplified to the sme tree structure. Eqution 6 shows tht two gene expressions re not strict implicit duplicte chromosomes, their ORF different (underlined prts), nd their corresponding expressions trees re different s follows, ut cn e simplified s the tree structure shown in mentioned ove. (6) exp exp * - * The coding regions nd non-coding regions of non-strict duplicted chromosomes re different. Therefore, s prent chromosome, it will not destroy the diversity of popultion gene frgments. The non-strict duplicted chromosomes hve different direct phenotypes nd sme indirect phenotypes, nd the numer of existence of non-strict duplicted chromosomes is very smll compred to duplicted chromosomes nd strict implicit duplicted chromosomes in the popultion. In the process of evolution, the non-strict implicit duplicted chromosomes re esily destroyed y the genetic opertor, nd the proility of producing duplicted chromosomes is very low, nd they often convert into totl different chromosomes. Therefore, the indirect phenotype of the non-strict implicit duplicted chromosomes is unstle. To sum up, the non-strict implicit duplicted 237
5 chromosomes cn e selected s the prent chromosomes of the next genertion. Due to the smll numer, even the excellent non-strict implicit chromosomes re not selected to e the prent chromosomes, the cost is very smll. Duplicted chromosomes nd strict implicit duplicted chromosomes re highly stle in the evolution process. To prevent the cretion of lrge numer of cloned individuls from dmging the ecology of the popultion, it is necessry to remove the duplicted chromosomes nd strict implicit duplicted chromosomes when the selection opertor cts on the popultion. If the remove process occurs efore the opertion of the selection opertor, the numer of duplicted chromosomes nd strict implicit duplicted chromosomes is reduced to 1 in the cndidte popultion, the possiility of the genotype eing selected decreses gretly. In the ctul process of popultion genetics, individuls eing generted repetedly lso reflect tht the genotype hs strong survivility nd convergence trend, so it is still necessry to mintin the proility of the g genotype eing selected. The remove process only prevents the mlignnt genertion of implicit duplicted individuls in next genertion, ut does not decrese the proility of the genotype eing selected in current genertion. Therefore, the remove process should occur fter the selection opertor opertion, the ojects eing removed should e the prent chromosome group eing selected in current genertion insted of the previous genertion popultion efore the selection opertor opertion. During the remove process, the sis for judging duplicted chromosomes nd strict implicit duplicted chromosomes is s follows: (1) duplicted chromosomes: The gene expression is the sme s the gene expression of nother individul in the popultion. (2) strict implicit duplicted chromosomes: The ORF segment is the sme s the ORF segment of nother individul in the popultion. Since the ORF segment is prt of the gene expression, we cn remove duplicted chromosome individuls ccording the second rule. Tht is, when individuls with the sme ORF segments re removed, ll duplicted chromosomes nd strict implicit duplicted chromosomes will lso e removed. To determine whether the ORF segments re the sme, it is necessry to scn the gene expression to determine the length of the ORF first, then to scn the specific elements of the ORF segment from hed to til, nd compre them with other existing ORF segment elements. If the elements re sme, it mens tht the individul is duplicted chromosome or strict implicit duplicted chromosome. The judgment lgorithm y compring ORFS mentioned ove is less efficient. This pper dopts the fitness vlue s the judgment rule to determinte whether n individul is duplicted chromosome or strict implicit duplicted chromosome: (1) Fitness s criterion for evluting the qulity of n individul hs een clculted with the irth of chromosome individul in genetic opertor, no dditionl clcultion is needed. (2) The fitness vlue is generlly expressed s doule dt type, it hs high precision nd cn e used s the judgment rule to determinte whether n individul is duplicted chromosome or strict implicit duplicted chromosome. (3) The numer of non strict implicit duplicted chromosomes in the popultion is extremely low. It is smll proility event tht the prent chromosomes which re not selected s descendnt re deleted, nd the cost is cost-effective in terms of lgorithmic efficiency. The steps of lgorithm of DSC y compring fitness vlues re follows: Algorithm1. Deleting sme chromosomes y compring fitness vlues Input : List of chromosome popultions(chromosomeslist) Output: List of chromosome popultions(chromosomeslist) 1. chromosomefitness=1.0000; //define nd initilize the fitness of chromosome 2. chromosomeslist.sort(); 3. for (t=0;t<length(chromosomeslist);t++) 4. if(chromosomeslist[t]==chromsomefitness) then 5. romove chromosomeslist[t] from chromosomeslist; 6. t ; 7. else 238
6 8. chromosomefitness=chromosomeslist[t]; 9. end if 10. end for 11. return chromosomeslist; After deleting duplicted individuls, the individul numer of prent chromosomes, which re selected s the next genertion, my e reduced, nd need to e supplemented to the numer of individuls efore deletion. We propose novel method CPCSC to improve the GEP selection process. The improved selection process is shown in Fig. 1 : Begin Genetic opertion of this genertion Crete copy of the popultion Empty the popultion copy of the popultion Choose the selectmount of prent chromosomes of next gerention Add to popultion Delete k duplicted or hidden duplicted individuls popultion K>0 yes copy of the popultion Delete duplicted or hidden duplicted individuls Delete selected individuls Sort the remining individuls in the popultion copy no Select the top k individuls nd dd to the popultion Generte individuls rndomly to supplement the popultion to ensure the initil size of next gerention Genetic opertion of next genertion end Fig.1 Selection flow of introducing CPCSC_DSC The specific steps re: first, crete the copy of popultion. Second, empty the popultion. Third, the selection opertor chooses the prent chromosomes of next genertion from the copy popultion nd dd them to the popultion, fourth, delete hidden duplicted individuls. Fifth, if the mount of popultion decrese fter deleting, the duplicted individul nd selected individuls re removed from the copy popultion, nd the remining dominnt individuls re dded to the popultion, nd the numer of the dominnt individuls dded to the popultion is the sme s the numer of duplicted individuls deleted. Finlly, generte chromosomes rndomly, nd expnd the prentl chromosoml popultion to the required size. 239
7 4. Experiment nd Anlysis A prt of the Iris dt test of UCI dt set is used to prove the vlidity of the improved GEP lgorithm compred to the stndrd GEP. The dt contin three flower smples, setos, versicolor nd virginic. Ech smple contins 4 ttriutes, including sepl length, sepl width, petl length nd petl width. The clyx length of the setos smple ws selected s the dependent vrile y, nd the other ttriutes were used s independent vriles, which were expressed s, nd c respectively. Setos smple dt, s shown in Tle 1: Tle 1. Iris-Setos Smple Dtset. Num S ep l le ng t h y Sepl width P e t l l e ng t h Petl width c In order to prove the effect of CPCSC_DSC lgorithm on evolution, the experiment ws divided into two groups, the experimentl group nd the control group, oth groups use the sme dt set in Tle 1, nd they re executed sed on reverse polish expression_sck decoding method to evlute gene expression nd sed on rough multiple liner regression initiliztion_dptive correction constnt to initilize constnt, in ddition, the experimentl group dopts CPCSC_DSC lgorithm to delete the duplicted or hidden duplicted inidividls during generic evolution process. Set the size of popultion to 60, the hed length of gene expression to 15, the proility of selection to 0.3, the proility of recomintion to 0.75, nd the muttion proility to 0.1. Compring the optiml fitness of the two individuls otined y the CPCSC_DSC nd no CPCSC_DSC lgorithm fter the 2000 genertion,the individul with higher fitness wins. Fig.2 shows the results:.7 Fitness vlue The numer of experiments CPCSC_DSC NOCPCSC_DSC Fig.2 Fitness vlue of CPCSC_DSC nd non CPCSC_DSC Fig.2 shows tht in the comprison of the 100 experimentl results, the optiml fitness of the chromosomes otined y the lgorithm CPCSC_DSC is 88 times greter thn tht of the GEP without CPCSC_DSC (oth group using reverse polish expression sck_ decoding method to 240
8 evlute gene expression, nd using rough multiple liner regression initiliztion dptive correction constnt to initilize constnt) fter the 2000 genertion. The result shows tht the CPCSC_DSC lgorithm cn ccelerte the evolution speed. One group uses CPCSC_DSC lgorithm nd the other group does not use CPCSC_DSC, ech group is executed 100 times respectively, nd fter 2000 genertions of evolution, the verge fitness of optiml chromosome is , compred to of not using CPCSC_DSC, incresed y %. 5. Conclusion The deletion of duplicted chromosomes in the process of selection opertion of GEP plys n importnt role during the genetic process. An improved selection lgorithm sed on CPCSC_DSC deling with the deletion of duplicted chromosomes in the process of selection is presented. The CPCSC_DSC introduced the conception of strict implicit nd non-strict implicit duplicted chromosome, which cn ensure the numer of vrile of individuls nd cn ensure popultion diversity, evolutionry efficiency nd voiding premture convergence. The experiment results show tht the CPCSC_DSC ccelertes evolution, increses the fitness of optiml chromosome compred to the result not using CPCSC_DSC. References [1] Informtion on [2] Ferreir Cndid. Gene Expression Progrmming: A New Adptive Algorithm for Solving Prolems. Complex Systems, vol. 13(2001), p [3] Ferreir Cndid. Genetic Representtion nd Genetic Neutrlity in Gene Expression Progrmming. Advnces in Complex Systems, vol. 4(2002), p [4] Ferreir Cndid. Gene Expression Progrmming: Mthemticl Modeling y n Artificil Intelligence (Springer- Verlrg, Germny 2006). [5] Jinjun Hu: The Reserches of Key-techniques in Knowledge discovery System for TCM Phrmcology (Ph.D., Sichun University, Chin 2006). [6] Yue Jing, Chngjie Tng nd Mingxiu Zheng. Outreeding Strtegy with Dynmic Fitness in Gene Expression Progrmming. Journl of Sichun University, vol. 139(2007), p (In Chinese) [7] Tiyong Li, Chngjie Tng nd Lei Dun. Adptive Popultion Diversity Tuning Algorithm for Gene Expression Progrmming. Journl of University of Electronic Science nd Technology of Chin, vol. 39(2010), p (In Chinese) [8] Bing Shn, Shihong Ni nd Xing Ch. GEP sed on Popultion Diversity Mesure y Vrince of Individul s Fitness. Computer Engineering nd Design, vol. 34(2013), p (In Chinese) 241
Genetic Programming. Outline. Evolutionary Strategies. Evolutionary strategies Genetic programming Summary
Outline Genetic Progrmming Evolutionry strtegies Genetic progrmming Summry Bsed on the mteril provided y Professor Michel Negnevitsky Evolutionry Strtegies An pproch simulting nturl evolution ws proposed
More informationThe Minimum Label Spanning Tree Problem: Illustrating the Utility of Genetic Algorithms
The Minimum Lel Spnning Tree Prolem: Illustrting the Utility of Genetic Algorithms Yupei Xiong, Univ. of Mrylnd Bruce Golden, Univ. of Mrylnd Edwrd Wsil, Americn Univ. Presented t BAE Systems Distinguished
More informationEvolutionary Computation
Topic 9 Evolutionry Computtion Introduction, or cn evolution e intelligent? Simultion of nturl evolution Genetic lgorithms Evolution strtegies Genetic progrmming Summry Cn evolution e intelligent? Intelligence
More informationBayesian Networks: Approximate Inference
pproches to inference yesin Networks: pproximte Inference xct inference Vrillimintion Join tree lgorithm pproximte inference Simplify the structure of the network to mkxct inferencfficient (vritionl methods,
More informationUniversity of Birmingham. 3 March 2010
1 University of Birminghm 3 Mrch 2010 2 Introduction to evolutionry computtion Evolutionry lgorithms solution representtion fitness function initil popultion genertion genetic nd selection opertors Types
More informationDriving Cycle Construction of City Road for Hybrid Bus Based on Markov Process Deng Pan1, a, Fengchun Sun1,b*, Hongwen He1, c, Jiankun Peng1, d
Interntionl Industril Informtics nd Computer Engineering Conference (IIICEC 15) Driving Cycle Construction of City Rod for Hybrid Bus Bsed on Mrkov Process Deng Pn1,, Fengchun Sun1,b*, Hongwen He1, c,
More informationContinuous Random Variable X:
Continuous Rndom Vrile : The continuous rndom vrile hs its vlues in n intervl, nd it hs proility distriution unction or proility density unction p.d. stisies:, 0 & d Which does men tht the totl re under
More informationReinforcement learning II
CS 1675 Introduction to Mchine Lerning Lecture 26 Reinforcement lerning II Milos Huskrecht milos@cs.pitt.edu 5329 Sennott Squre Reinforcement lerning Bsics: Input x Lerner Output Reinforcement r Critic
More informationParse trees, ambiguity, and Chomsky normal form
Prse trees, miguity, nd Chomsky norml form In this lecture we will discuss few importnt notions connected with contextfree grmmrs, including prse trees, miguity, nd specil form for context-free grmmrs
More informationSUMMER KNOWHOW STUDY AND LEARNING CENTRE
SUMMER KNOWHOW STUDY AND LEARNING CENTRE Indices & Logrithms 2 Contents Indices.2 Frctionl Indices.4 Logrithms 6 Exponentil equtions. Simplifying Surds 13 Opertions on Surds..16 Scientific Nottion..18
More informationSection 4: Integration ECO4112F 2011
Reding: Ching Chpter Section : Integrtion ECOF Note: These notes do not fully cover the mteril in Ching, ut re ment to supplement your reding in Ching. Thus fr the optimistion you hve covered hs een sttic
More informationDiscrete Mathematics and Probability Theory Spring 2013 Anant Sahai Lecture 17
EECS 70 Discrete Mthemtics nd Proility Theory Spring 2013 Annt Shi Lecture 17 I.I.D. Rndom Vriles Estimting the is of coin Question: We wnt to estimte the proportion p of Democrts in the US popultion,
More informationNUMERICAL INTEGRATION. The inverse process to differentiation in calculus is integration. Mathematically, integration is represented by.
NUMERICAL INTEGRATION 1 Introduction The inverse process to differentition in clculus is integrtion. Mthemticlly, integrtion is represented by f(x) dx which stnds for the integrl of the function f(x) with
More informationSection 6.1 INTRO to LAPLACE TRANSFORMS
Section 6. INTRO to LAPLACE TRANSFORMS Key terms: Improper Integrl; diverge, converge A A f(t)dt lim f(t)dt Piecewise Continuous Function; jump discontinuity Function of Exponentil Order Lplce Trnsform
More informationI1 = I2 I1 = I2 + I3 I1 + I2 = I3 + I4 I 3
2 The Prllel Circuit Electric Circuits: Figure 2- elow show ttery nd multiple resistors rrnged in prllel. Ech resistor receives portion of the current from the ttery sed on its resistnce. The split is
More informationInterpreting Integrals and the Fundamental Theorem
Interpreting Integrls nd the Fundmentl Theorem Tody, we go further in interpreting the mening of the definite integrl. Using Units to Aid Interprettion We lredy know tht if f(t) is the rte of chnge of
More informationConvert the NFA into DFA
Convert the NF into F For ech NF we cn find F ccepting the sme lnguge. The numer of sttes of the F could e exponentil in the numer of sttes of the NF, ut in prctice this worst cse occurs rrely. lgorithm:
More informationp-adic Egyptian Fractions
p-adic Egyptin Frctions Contents 1 Introduction 1 2 Trditionl Egyptin Frctions nd Greedy Algorithm 2 3 Set-up 3 4 p-greedy Algorithm 5 5 p-egyptin Trditionl 10 6 Conclusion 1 Introduction An Egyptin frction
More informationQUADRATURE is an old-fashioned word that refers to
World Acdemy of Science Engineering nd Technology Interntionl Journl of Mthemticl nd Computtionl Sciences Vol:5 No:7 011 A New Qudrture Rule Derived from Spline Interpoltion with Error Anlysis Hdi Tghvfrd
More informationMonte Carlo method in solving numerical integration and differential equation
Monte Crlo method in solving numericl integrtion nd differentil eqution Ye Jin Chemistry Deprtment Duke University yj66@duke.edu Abstrct: Monte Crlo method is commonly used in rel physics problem. The
More informationLecture Solution of a System of Linear Equation
ChE Lecture Notes, Dept. of Chemicl Engineering, Univ. of TN, Knoville - D. Keffer, 5/9/98 (updted /) Lecture 8- - Solution of System of Liner Eqution 8. Why is it importnt to e le to solve system of liner
More informationResearch on the Quality Competence in Manufacturing Industry
Reserch on the Qulity Competence in Mnufcturing Industry Xioping M, Zhijun Hn Economics nd Mngement School Nnjing University of Science nd Technology Nnjing 210094, Chin Tel: 86-25-8431-5400 E-mil: hnzhij4531@sin.com
More informationDesigning Information Devices and Systems I Discussion 8B
Lst Updted: 2018-10-17 19:40 1 EECS 16A Fll 2018 Designing Informtion Devices nd Systems I Discussion 8B 1. Why Bother With Thévenin Anywy? () Find Thévenin eqiuvlent for the circuit shown elow. 2kΩ 5V
More informationMidterm#1 comments. Overview- chapter 6. Recombination. Recombination 1 st sense
Midterm#1 comments So fr, ~ 10% of exms grded, wide rnge of results: 1 perfect score, 1 score < 100pts rtil credit is given if you get prt of the nswer right Tests will e returned next Thursdy Some of
More informationAPPROXIMATE INTEGRATION
APPROXIMATE INTEGRATION. Introduction We hve seen tht there re functions whose nti-derivtives cnnot be expressed in closed form. For these resons ny definite integrl involving these integrnds cnnot be
More informationFast Frequent Free Tree Mining in Graph Databases
The Chinese University of Hong Kong Fst Frequent Free Tree Mining in Grph Dtses Peixing Zho Jeffrey Xu Yu The Chinese University of Hong Kong Decemer 18 th, 2006 ICDM Workshop MCD06 Synopsis Introduction
More informationDiscrete Mathematics and Probability Theory Summer 2014 James Cook Note 17
CS 70 Discrete Mthemtics nd Proility Theory Summer 2014 Jmes Cook Note 17 I.I.D. Rndom Vriles Estimting the is of coin Question: We wnt to estimte the proportion p of Democrts in the US popultion, y tking
More informationNew data structures to reduce data size and search time
New dt structures to reduce dt size nd serch time Tsuneo Kuwbr Deprtment of Informtion Sciences, Fculty of Science, Kngw University, Hirtsuk-shi, Jpn FIT2018 1D-1, No2, pp1-4 Copyright (c)2018 by The Institute
More informationHaplotype Frequencies and Linkage Disequilibrium. Biostatistics 666
Hlotye Frequencies nd Linkge isequilirium iosttistics 666 Lst Lecture Genotye Frequencies llele Frequencies Phenotyes nd Penetrnces Hrdy-Weinerg Equilirium Simle demonstrtion Exercise: NO2 nd owel isese
More informationChapter 3 Single Random Variables and Probability Distributions (Part 2)
Chpter 3 Single Rndom Vriles nd Proilit Distriutions (Prt ) Contents Wht is Rndom Vrile? Proilit Distriution Functions Cumultive Distriution Function Proilit Densit Function Common Rndom Vriles nd their
More informationPredict Global Earth Temperature using Linier Regression
Predict Globl Erth Temperture using Linier Regression Edwin Swndi Sijbt (23516012) Progrm Studi Mgister Informtik Sekolh Teknik Elektro dn Informtik ITB Jl. Gnesh 10 Bndung 40132, Indonesi 23516012@std.stei.itb.c.id
More informationC Dutch System Version as agreed by the 83rd FIDE Congress in Istanbul 2012
04.3.1. Dutch System Version s greed y the 83rd FIDE Congress in Istnul 2012 A Introductory Remrks nd Definitions A.1 Initil rnking list A.2 Order See 04.2.B (Generl Hndling Rules - Initil order) For pirings
More informationSeptember 13 Homework Solutions
College of Engineering nd Computer Science Mechnicl Engineering Deprtment Mechnicl Engineering 5A Seminr in Engineering Anlysis Fll Ticket: 5966 Instructor: Lrry Cretto Septemer Homework Solutions. Are
More informationPopulation bottleneck : dramatic reduction of population size followed by rapid expansion,
Selection We hve defined nucleotide diversity denoted by π s the proportion of nucleotides tht differ between two rndomly chosen sequences. We hve shown tht E[π] = θ = 4 e µ where µ cn be estimted directly.
More information5: The Definite Integral
5: The Definite Integrl 5.: Estimting with Finite Sums Consider moving oject its velocity (meters per second) t ny time (seconds) is given y v t = t+. Cn we use this informtion to determine the distnce
More informationThomas Whitham Sixth Form
Thoms Whithm Sith Form Pure Mthemtics Unit C Alger Trigonometry Geometry Clculus Vectors Trigonometry Compound ngle formule sin sin cos cos Pge A B sin Acos B cos Asin B A B sin Acos B cos Asin B A B cos
More informationCS 330 Formal Methods and Models Dana Richards, George Mason University, Spring 2016 Quiz Solutions
CS 330 Forml Methods nd Models Dn Richrds, George Mson University, Spring 2016 Quiz Solutions Quiz 1, Propositionl Logic Dte: Ferury 9 1. (4pts) ((p q) (q r)) (p r), prove tutology using truth tles. p
More informationChapter 9: Inferences based on Two samples: Confidence intervals and tests of hypotheses
Chpter 9: Inferences bsed on Two smples: Confidence intervls nd tests of hypotheses 9.1 The trget prmeter : difference between two popultion mens : difference between two popultion proportions : rtio of
More informationConnected-components. Summary of lecture 9. Algorithms and Data Structures Disjoint sets. Example: connected components in graphs
Prm University, Mth. Deprtment Summry of lecture 9 Algorithms nd Dt Structures Disjoint sets Summry of this lecture: (CLR.1-3) Dt Structures for Disjoint sets: Union opertion Find opertion Mrco Pellegrini
More informationChapter 4: Techniques of Circuit Analysis. Chapter 4: Techniques of Circuit Analysis
Chpter 4: Techniques of Circuit Anlysis Terminology Node-Voltge Method Introduction Dependent Sources Specil Cses Mesh-Current Method Introduction Dependent Sources Specil Cses Comprison of Methods Source
More informationMATHS NOTES. SUBJECT: Maths LEVEL: Higher TEACHER: Aidan Roantree. The Institute of Education Topics Covered: Powers and Logs
MATHS NOTES The Institute of Eduction 06 SUBJECT: Mths LEVEL: Higher TEACHER: Aidn Rontree Topics Covered: Powers nd Logs About Aidn: Aidn is our senior Mths techer t the Institute, where he hs been teching
More informationAcceptance Sampling by Attributes
Introduction Acceptnce Smpling by Attributes Acceptnce smpling is concerned with inspection nd decision mking regrding products. Three spects of smpling re importnt: o Involves rndom smpling of n entire
More informationM344 - ADVANCED ENGINEERING MATHEMATICS
M3 - ADVANCED ENGINEERING MATHEMATICS Lecture 18: Lplce s Eqution, Anltic nd Numericl Solution Our emple of n elliptic prtil differentil eqution is Lplce s eqution, lso clled the Diffusion Eqution. If
More informationCS 188: Artificial Intelligence Spring 2007
CS 188: Artificil Intelligence Spring 2007 Lecture 3: Queue-Bsed Serch 1/23/2007 Srini Nrynn UC Berkeley Mny slides over the course dpted from Dn Klein, Sturt Russell or Andrew Moore Announcements Assignment
More informationLINEAR ALGEBRA APPLIED
5.5 Applictions of Inner Product Spces 5.5 Applictions of Inner Product Spces 7 Find the cross product of two vectors in R. Find the liner or qudrtic lest squres pproimtion of function. Find the nth-order
More informationChapter 6 Techniques of Integration
MA Techniques of Integrtion Asst.Prof.Dr.Suprnee Liswdi Chpter 6 Techniques of Integrtion Recll: Some importnt integrls tht we hve lernt so fr. Tle of Integrls n+ n d = + C n + e d = e + C ( n ) d = ln
More informationAdministrivia CSE 190: Reinforcement Learning: An Introduction
Administrivi CSE 190: Reinforcement Lerning: An Introduction Any emil sent to me bout the course should hve CSE 190 in the subject line! Chpter 4: Dynmic Progrmming Acknowledgment: A good number of these
More information5.7 Improper Integrals
458 pplictions of definite integrls 5.7 Improper Integrls In Section 5.4, we computed the work required to lift pylod of mss m from the surfce of moon of mss nd rdius R to height H bove the surfce of the
More informationA Critical Path Problem Using Intuitionistic. Trapezoidal Fuzzy Number
pplied Mthemticl Sciences, Vol. 8, 0, no. 5, 555-56 HIKRI Ltd, www.m-hikri.com http://dx.doi.org/0.988/ms.0.9 Criticl Pth Prolem Using Intuitionistic Trpezoidl Fuzzy Numer P. Jygowri Deprtment of Mthemtics
More informationThe Shortest Confidence Interval for the Mean of a Normal Distribution
Interntionl Journl of Sttistics nd Proility; Vol. 7, No. 2; Mrch 208 ISSN 927-7032 E-ISSN 927-7040 Pulished y Cndin Center of Science nd Eduction The Shortest Confidence Intervl for the Men of Norml Distriution
More information19 Optimal behavior: Game theory
Intro. to Artificil Intelligence: Dle Schuurmns, Relu Ptrscu 1 19 Optiml behvior: Gme theory Adversril stte dynmics hve to ccount for worst cse Compute policy π : S A tht mximizes minimum rewrd Let S (,
More information7.1 Integral as Net Change and 7.2 Areas in the Plane Calculus
7.1 Integrl s Net Chnge nd 7. Ares in the Plne Clculus 7.1 INTEGRAL AS NET CHANGE Notecrds from 7.1: Displcement vs Totl Distnce, Integrl s Net Chnge We hve lredy seen how the position of n oject cn e
More informationLecture 14: Quadrature
Lecture 14: Qudrture This lecture is concerned with the evlution of integrls fx)dx 1) over finite intervl [, b] The integrnd fx) is ssumed to be rel-vlues nd smooth The pproximtion of n integrl by numericl
More informationPreview 11/1/2017. Greedy Algorithms. Coin Change. Coin Change. Coin Change. Coin Change. Greedy algorithms. Greedy Algorithms
Preview Greed Algorithms Greed Algorithms Coin Chnge Huffmn Code Greed lgorithms end to e simple nd strightforwrd. Are often used to solve optimiztion prolems. Alws mke the choice tht looks est t the moment,
More informationCS103B Handout 18 Winter 2007 February 28, 2007 Finite Automata
CS103B ndout 18 Winter 2007 Ferury 28, 2007 Finite Automt Initil text y Mggie Johnson. Introduction Severl childrens gmes fit the following description: Pieces re set up on plying ord; dice re thrown or
More information4.1. Probability Density Functions
STT 1 4.1-4. 4.1. Proility Density Functions Ojectives. Continuous rndom vrile - vers - discrete rndom vrile. Proility density function. Uniform distriution nd its properties. Expected vlue nd vrince of
More informationEECS 141 Due 04/19/02, 5pm, in 558 Cory
UIVERSITY OF CALIFORIA College of Engineering Deprtment of Electricl Engineering nd Computer Sciences Lst modified on April 8, 2002 y Tufn Krlr (tufn@eecs.erkeley.edu) Jn M. Rey, Andrei Vldemirescu Homework
More informationLinear Systems with Constant Coefficients
Liner Systems with Constnt Coefficients 4-3-05 Here is system of n differentil equtions in n unknowns: x x + + n x n, x x + + n x n, x n n x + + nn x n This is constnt coefficient liner homogeneous system
More informationCOSC 3361 Numerical Analysis I Numerical Integration and Differentiation (III) - Gauss Quadrature and Adaptive Quadrature
COSC 336 Numericl Anlysis I Numericl Integrtion nd Dierentition III - Guss Qudrture nd Adptive Qudrture Edgr Griel Fll 5 COSC 336 Numericl Anlysis I Edgr Griel Summry o the lst lecture I For pproximting
More informationFlexible Beam. Objectives
Flexile Bem Ojectives The ojective of this l is to lern out the chllenges posed y resonnces in feedck systems. An intuitive understnding will e gined through the mnul control of flexile em resemling lrge
More informationNon-Linear & Logistic Regression
Non-Liner & Logistic Regression If the sttistics re boring, then you've got the wrong numbers. Edwrd R. Tufte (Sttistics Professor, Yle University) Regression Anlyses When do we use these? PART 1: find
More informationPhysics 201 Lab 3: Measurement of Earth s local gravitational field I Data Acquisition and Preliminary Analysis Dr. Timothy C. Black Summer I, 2018
Physics 201 Lb 3: Mesurement of Erth s locl grvittionl field I Dt Acquisition nd Preliminry Anlysis Dr. Timothy C. Blck Summer I, 2018 Theoreticl Discussion Grvity is one of the four known fundmentl forces.
More informationIndustrial Electrical Engineering and Automation
CODEN:LUTEDX/(TEIE-719)/1-7/(7) Industril Electricl Engineering nd Automtion Estimtion of the Zero Sequence oltge on the D- side of Dy Trnsformer y Using One oltge Trnsformer on the D-side Frncesco Sull
More information1B40 Practical Skills
B40 Prcticl Skills Comining uncertinties from severl quntities error propgtion We usully encounter situtions where the result of n experiment is given in terms of two (or more) quntities. We then need
More information2.4 Linear Inequalities and Interval Notation
.4 Liner Inequlities nd Intervl Nottion We wnt to solve equtions tht hve n inequlity symol insted of n equl sign. There re four inequlity symols tht we will look t: Less thn , Less thn or
More informationFORM FIVE ADDITIONAL MATHEMATIC NOTE. ar 3 = (1) ar 5 = = (2) (2) (1) a = T 8 = 81
FORM FIVE ADDITIONAL MATHEMATIC NOTE CHAPTER : PROGRESSION Arithmetic Progression T n = + (n ) d S n = n [ + (n )d] = n [ + Tn ] S = T = T = S S Emple : The th term of n A.P. is 86 nd the sum of the first
More informationCS 330 Formal Methods and Models
CS 330 Forml Methods nd Models Dn Richrds, George Mson University, Spring 2017 Quiz Solutions Quiz 1, Propositionl Logic Dte: Ferury 2 1. Prove ((( p q) q) p) is tutology () (3pts) y truth tle. p q p q
More informationChapter 6 Continuous Random Variables and Distributions
Chpter 6 Continuous Rndom Vriles nd Distriutions Mny economic nd usiness mesures such s sles investment consumption nd cost cn hve the continuous numericl vlues so tht they cn not e represented y discrete
More informationCS 373, Spring Solutions to Mock midterm 1 (Based on first midterm in CS 273, Fall 2008.)
CS 373, Spring 29. Solutions to Mock midterm (sed on first midterm in CS 273, Fll 28.) Prolem : Short nswer (8 points) The nswers to these prolems should e short nd not complicted. () If n NF M ccepts
More informationChapter 5 Plan-Space Planning
Lecture slides for Automted Plnning: Theory nd Prctice Chpter 5 Pln-Spce Plnning Dn S. Nu CMSC 722, AI Plnning University of Mrylnd, Spring 2008 1 Stte-Spce Plnning Motivtion g 1 1 g 4 4 s 0 g 5 5 g 2
More informationSolution for Assignment 1 : Intro to Probability and Statistics, PAC learning
Solution for Assignment 1 : Intro to Probbility nd Sttistics, PAC lerning 10-701/15-781: Mchine Lerning (Fll 004) Due: Sept. 30th 004, Thursdy, Strt of clss Question 1. Bsic Probbility ( 18 pts) 1.1 (
More informationLecture 2: January 27
CS 684: Algorithmic Gme Theory Spring 217 Lecturer: Év Trdos Lecture 2: Jnury 27 Scrie: Alert Julius Liu 2.1 Logistics Scrie notes must e sumitted within 24 hours of the corresponding lecture for full
More informationNumerical Analysis: Trapezoidal and Simpson s Rule
nd Simpson s Mthemticl question we re interested in numericlly nswering How to we evlute I = f (x) dx? Clculus tells us tht if F(x) is the ntiderivtive of function f (x) on the intervl [, b], then I =
More informationA REVIEW OF CALCULUS CONCEPTS FOR JDEP 384H. Thomas Shores Department of Mathematics University of Nebraska Spring 2007
A REVIEW OF CALCULUS CONCEPTS FOR JDEP 384H Thoms Shores Deprtment of Mthemtics University of Nebrsk Spring 2007 Contents Rtes of Chnge nd Derivtives 1 Dierentils 4 Are nd Integrls 5 Multivrite Clculus
More informationChapter 2. Random Variables and Probability Distributions
Rndom Vriles nd Proilit Distriutions- 6 Chpter. Rndom Vriles nd Proilit Distriutions.. Introduction In the previous chpter, we introduced common topics of proilit. In this chpter, we trnslte those concepts
More information10 Vector Integral Calculus
Vector Integrl lculus Vector integrl clculus extends integrls s known from clculus to integrls over curves ("line integrls"), surfces ("surfce integrls") nd solids ("volume integrls"). These integrls hve
More informationClassification: Rules. Prof. Pier Luca Lanzi Laurea in Ingegneria Informatica Politecnico di Milano Polo regionale di Como
Metodologie per Sistemi Intelligenti Clssifiction: Prof. Pier Luc Lnzi Lure in Ingegneri Informtic Politecnico di Milno Polo regionle di Como Rules Lecture outline Why rules? Wht re clssifiction rules?
More informationUNIT 1 FUNCTIONS AND THEIR INVERSES Lesson 1.4: Logarithmic Functions as Inverses Instruction
Lesson : Logrithmic Functions s Inverses Prerequisite Skills This lesson requires the use of the following skills: determining the dependent nd independent vribles in n exponentil function bsed on dt from
More information12.1 Nondeterminism Nondeterministic Finite Automata. a a b ε. CS125 Lecture 12 Fall 2016
CS125 Lecture 12 Fll 2016 12.1 Nondeterminism The ide of nondeterministic computtions is to llow our lgorithms to mke guesses, nd only require tht they ccept when the guesses re correct. For exmple, simple
More information13: Diffusion in 2 Energy Groups
3: Diffusion in Energy Groups B. Rouben McMster University Course EP 4D3/6D3 Nucler Rector Anlysis (Rector Physics) 5 Sept.-Dec. 5 September Contents We study the diffusion eqution in two energy groups
More informationHow do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique?
XII. LINEAR ALGEBRA: SOLVING SYSTEMS OF EQUATIONS Tody we re going to tlk out solving systems of liner equtions. These re prolems tht give couple of equtions with couple of unknowns, like: 6= x + x 7=
More informationPartial Derivatives. Limits. For a single variable function f (x), the limit lim
Limits Prtil Derivtives For single vrible function f (x), the limit lim x f (x) exists only if the right-hnd side limit equls to the left-hnd side limit, i.e., lim f (x) = lim f (x). x x + For two vribles
More informationDerivations for maximum likelihood estimation of particle size distribution using in situ video imaging
2 TWMCC Texs-Wisconsin Modeling nd Control Consortium 1 Technicl report numer 27-1 Derivtions for mximum likelihood estimtion of prticle size distriution using in situ video imging Pul A. Lrsen nd Jmes
More informationLECTURE 14. Dr. Teresa D. Golden University of North Texas Department of Chemistry
LECTURE 14 Dr. Teres D. Golden University of North Texs Deprtment of Chemistry Quntittive Methods A. Quntittive Phse Anlysis Qulittive D phses by comprison with stndrd ptterns. Estimte of proportions of
More informationDiverse modes of eco-evolutionary dynamics in communities of antibiotic-producing microorganisms
In the formt provided y the uthors nd unedited. ULEMENTAY INFOMATION VOLUME: 1 ATICLE NUMBE: 0189 iverse modes of eco-evolutionry dynmics in communities of ntiiotic-producing microorgnisms Klin Vetsigin
More informationPHYS Summer Professor Caillault Homework Solutions. Chapter 2
PHYS 1111 - Summer 2007 - Professor Cillult Homework Solutions Chpter 2 5. Picture the Problem: The runner moves long the ovl trck. Strtegy: The distnce is the totl length of trvel, nd the displcement
More informationTorsion in Groups of Integral Triangles
Advnces in Pure Mthemtics, 01,, 116-10 http://dxdoiorg/1046/pm011015 Pulished Online Jnury 01 (http://wwwscirporg/journl/pm) Torsion in Groups of Integrl Tringles Will Murry Deprtment of Mthemtics nd Sttistics,
More informationORDER REDUCTION USING POLE CLUSTERING AND FACTOR DIVISION METHOD
Author Nme et. l. / Interntionl Journl of New Technologies in Science nd Engineering Vol., Issue., 7, ISSN 9-78 ORDER REDUCTION USING POLE CLUSTERING AND FACTOR DIVISION METHOD A Chinn Nidu* G Dileep**
More information1 Nondeterministic Finite Automata
1 Nondeterministic Finite Automt Suppose in life, whenever you hd choice, you could try oth possiilities nd live your life. At the end, you would go ck nd choose the one tht worked out the est. Then you
More informationMath 259 Winter Solutions to Homework #9
Mth 59 Winter 9 Solutions to Homework #9 Prolems from Pges 658-659 (Section.8). Given f(, y, z) = + y + z nd the constrint g(, y, z) = + y + z =, the three equtions tht we get y setting up the Lgrnge multiplier
More informationMulti-Armed Bandits: Non-adaptive and Adaptive Sampling
CSE 547/Stt 548: Mchine Lerning for Big Dt Lecture Multi-Armed Bndits: Non-dptive nd Adptive Smpling Instructor: Shm Kkde 1 The (stochstic) multi-rmed bndit problem The bsic prdigm is s follows: K Independent
More information7. Indefinite Integrals
7. Indefinite Integrls These lecture notes present my interprettion of Ruth Lwrence s lecture notes (in Herew) 7. Prolem sttement By the fundmentl theorem of clculus, to clculte n integrl we need to find
More informationDuality # Second iteration for HW problem. Recall our LP example problem we have been working on, in equality form, is given below.
Dulity #. Second itertion for HW problem Recll our LP emple problem we hve been working on, in equlity form, is given below.,,,, 8 m F which, when written in slightly different form, is 8 F Recll tht we
More informationA recursive construction of efficiently decodable list-disjunct matrices
CSE 709: Compressed Sensing nd Group Testing. Prt I Lecturers: Hung Q. Ngo nd Atri Rudr SUNY t Bufflo, Fll 2011 Lst updte: October 13, 2011 A recursive construction of efficiently decodble list-disjunct
More informationMatching patterns of line segments by eigenvector decomposition
Title Mtching ptterns of line segments y eigenvector decomposition Author(s) Chn, BHB; Hung, YS Cittion The 5th IEEE Southwest Symposium on Imge Anlysis nd Interprettion Proceedings, Snte Fe, NM., 7-9
More informationFig. 1. Open-Loop and Closed-Loop Systems with Plant Variations
ME 3600 Control ystems Chrcteristics of Open-Loop nd Closed-Loop ystems Importnt Control ystem Chrcteristics o ensitivity of system response to prmetric vritions cn be reduced o rnsient nd stedy-stte responses
More informationMathematics. Area under Curve.
Mthemtics Are under Curve www.testprepkrt.com Tle of Content 1. Introduction.. Procedure of Curve Sketching. 3. Sketching of Some common Curves. 4. Are of Bounded Regions. 5. Sign convention for finding
More informationChapter 9 Definite Integrals
Chpter 9 Definite Integrls In the previous chpter we found how to tke n ntiderivtive nd investigted the indefinite integrl. In this chpter the connection etween ntiderivtives nd definite integrls is estlished
More informationIntroduction to Electronic Circuits. DC Circuit Analysis: Transient Response of RC Circuits
Introduction to Electronic ircuits D ircuit Anlysis: Trnsient esponse of ircuits Up until this point, we hve een looking t the Stedy Stte response of D circuits. StedyStte implies tht nothing hs chnged
More informationSTEP FUNCTIONS, DELTA FUNCTIONS, AND THE VARIATION OF PARAMETERS FORMULA. 0 if t < 0, 1 if t > 0.
STEP FUNCTIONS, DELTA FUNCTIONS, AND THE VARIATION OF PARAMETERS FORMULA STEPHEN SCHECTER. The unit step function nd piecewise continuous functions The Heviside unit step function u(t) is given by if t
More information