Stochastic Simulations of Cellular Biological Processes

Size: px
Start display at page:

Download "Stochastic Simulations of Cellular Biological Processes"

Transcription

1 Proceedngs of Department of Defense Hgh Performance Computng Modernzaton Program Users Group Conference 2007, June 18-22, 2007, Pttsburgh, PA Stochastc Smulatons of Cellular Bologcal Processes Yaroslav Chushak Botechnology HPC Software Applcatons Insttute, HPCMP, Wrght-Patterson AFB, OH Brent Foy Wrght State Unversty, Dayton, OH John Frazer Ar Force Research Laboratory, Wrght-Patterson AFB, OH Introducton From a systems engneerng pont of vew, cells consst of a complex set of nested, nonlnear control systems domnated by feed-back and feed-forward loops. The more complex the system s, the more mportant are the ssues concernng the robustness and parameter optmzaton, therefore modelng and smulatons are mportant for both engneerng and reverse-engneerng of bosystems. Obectve At the functonal level, all bologcal processes n cells can be represented as a seres of bochemcal reactons. Snce such reactons are stochastc n nature, the user must run thousands of smulatons to characterze the ensemble behavor of bologcal systems. We developed a software package called Bomolecular Network Smulator (BNS) to model and smulate complex bomolecular reacton networks usng Hgh Performance Computng (HPC). Methodology The Bomolecular Network Smulator uses the Gllespe stochastc algorthm to smulate the evoluton of a system of bochemcal reactons. The BNS code s a combnaton of MATLAB and C-coded modules. Ths combnaton allows one to use the nteractve features and vsualzaton tools of MATLAB, whle achevng hgh speed for the computatonally ntensve part of the software. The software s parallelzed wth the MPI lbrary to run on multprocessor archtectures. Result The Bomolecular Network Smulator conssts of two sets of tools: for smulatons of the system and for the analyss of smulaton results. The Graphcal User Interface of BNS allows users to easly set parameters for the model and smulatons and to select analyss method. Multple types of post-smulaton analyses are avalable. Sgnfcance to DoD The Developed software allows DoD scentsts to buld, smulate and analyze complex cellular bomolecular networks utlzng the capactes of HPC. It provdes the foundatonal capablty to desgn and ntegrate bologcal constructs nto a new generaton of botechnology products.

2 Report Documentaton Page Form Approved OMB No Publc reportng burden for the collecton of nformaton s estmated to average 1 hour per response, ncludng the tme for revewng nstructons, searchng exstng data sources, gatherng and mantanng the data needed, and completng and revewng the collecton of nformaton. Send comments regardng ths burden estmate or any other aspect of ths collecton of nformaton, ncludng suggestons for reducng ths burden, to Washngton Headquarters Servces, Drectorate for Informaton Operatons and Reports, 1215 Jefferson Davs Hghway, Sute 1204, Arlngton VA Respondents should be aware that notwthstandng any other provson of law, no person shall be subect to a penalty for falng to comply wth a collecton of nformaton f t does not dsplay a currently vald OMB control number. 1. REPORT DATE REPORT TYPE 3. DATES COVERED to TITLE AND SUBTITLE Stochastc Smulatons of Cellular Bologcal Processes 5a. CONTRACT NUMBER 5b. GRANT NUMBER 5c. PROGRAM ELEMENT NUMBER 6. AUTHOR(S) 5d. PROJECT NUMBER 5e. TASK NUMBER 5f. WORK UNIT NUMBER 7. PERFORMING ORGANIZATION NAME(S) AND ADDRESS(ES) Ar Force Research Laboratory,Wrght Patterson AFB,OH, PERFORMING ORGANIZATION REPORT NUMBER 9. SPONSORING/MONITORING AGENCY NAME(S) AND ADDRESS(ES) 10. SPONSOR/MONITOR S ACRONYM(S) 12. DISTRIBUTION/AVAILABILITY STATEMENT Approved for publc release; dstrbuton unlmted 11. SPONSOR/MONITOR S REPORT NUMBER(S) 13. SUPPLEMENTARY NOTES Proceedngs of Department of Defense Hgh Performance Computng Modernzaton Program Users Group Conference 2007, June 18-22, 2007, Pttsburgh, PA 14. ABSTRACT 15. SUBJECT TERMS 16. SECURITY CLASSIFICATION OF: 17. LIMITATION OF ABSTRACT a. REPORT unclassfed b. ABSTRACT unclassfed c. THIS PAGE unclassfed Same as Report (SAR) 18. NUMBER OF PAGES 9 19a. NAME OF RESPONSIBLE PERSON Standard Form 298 (Rev. 8-98) Prescrbed by ANSI Std Z39-18

3 1 INTRODUCTION All chemcal reactons requre the nteracton of the reactants wth suffcent energy to overcome the actvaton energy barrer and, fundamentally, they are stochastc n nature. The best way to model knetcs of a system of chemcal reactons s to use a stochastc approach n terms of the Chemcal Master Equaton (CME), wth the number of molecules of each molecular speces as varables. The CME descrbes transtons of the system from one state to another state based on probablstc methods. Gllespe proposed a method to smulate probablstcally-correct traectores based on the CME through the use of Monte Carlo methods [1]. Although the Gllespe stochastc algorthm s a method for exact smulatons, as t explctly counts each reacton event that occurred n the system, the accuracy of the method comes at a hgh computatonal cost. Ths s especally true for systems wth a large number of molecular speces where reactons occur numerous tmes n a short perod of tme. To accelerate dscrete stochastc smulaton, Gllespe proposed the tau-leapng method as an approxmate smulaton strategy [2]. By usng Posson random numbers, the tau-leapng method can leap over many reactons wthout a sgnfcant loss of accuracy. We developed a software package the Bomolecular Network Smulator (BNS) that can use the Gllespe stochastc algorthm or the tau-leapng algorthm to smulate the behavor of a system of bochemcal reactons. It allows scentsts to buld a synthetc bomolecular network and explore ts performance utlzng the capactes of Hgh Performance Computng. BNS contans tools for both smulatng the system and for analyzng the results of the smulaton. Snce the smulatons are stochastc n nature, the user must run thousands of smulatons to characterze the ensemble behavor of bologcal systems. The parallelzed BNS code allows users to run multple smulatons and store results on multprocessor platforms. In ths paper, we present a bref descrpton of the Bomolecular Network Smulator software along wth some examples. 2 STOCHASTIC SIMULATION ALGORITHM Let us consder a system composed of N well mxed chemcal speces, S ( = 1, N), n a fxed volume V, whch are nvolved n M reactons, R ( = 1, M). The dynamcal state of the system can be specfed by the state vector X(t) = (X 1 (t), X 2 (t), X N (t)), where X (t) s the number of molecules of speces S at tme t. The probablty for each reacton R s defned by a propensty functon a (X)= c H (X), where c s the stochastc probablty constant and H (X) represents the number of possble combnatons of reactants. The probablty that reacton R wll occur n the tme nterval dt s defned as a (X)dt. Each reacton s also characterzed by ts state-change vector v = (v 1, v 2, v N ), where v s the change n the number of molecules S caused by one R reacton. To study the evoluton of the state vector X(t), Gllespe proposed an algorthm for Monte Carlo generaton of stochastc traectores [1]. The drect smulaton algorthm, whch s mplemented n the Bomolecular Network Smulator, answers two questons: (1) whch reacton wll occur next, and (2) what s the watng tme for the next reacton to occur. To answer these questons, two random numbers unformly dstrbuted over the nterval (0,1) r 1 and r 2 are generated. The frst random number s used to determne the next reacton R, such that 1 = 1 a < r 1 a 0 < = 1 a, (1)

4 where M a = 1 a0 =. (2) The dstrbuton of the watng tme s gven by followng probablty densty functon: P( τ, ) = a exp( a0τ ). (3) Here, P( τ, ) s the probablty that the watng tme for the reacton s τ and that t wll be an R reacton. The watng tme for the next reacton s calculated as [1] 1 1 τ = log. (4) a0 r2 After the next reacton and ts watng tme are determned, the reacton s executed and the state of the system s changed accordng to the state-change vector v. The smulaton tme s ncreased then by τ and the next smulaton step s generated. The Gllespe stochastc algorthm s exact for the elementary reactons (un-un, un-b and b-un types of reactons) wth any number of molecules n the system. For the system wth large numbers of molecules, the traectores generated by stochastc Monte Carlo smulatons converge to the traectory generated by determnstc dfferental equatons [1]. 3 TAU-LEAPING ALGORITHM The tau-leapng method calculates a tme nterval τ whch encompasses more than one reacton event and satsfes the Leap Condton,.e., the expected state change nduced by the leap must be suffcently small that no propensty functon changes ts value by a sgnfcant amount. Several methods have been proposed recently to choose the sze of the tme nterval for tau-leapng [3-5]. We mplemented the tauleapng method proposed by Cao et al. [6]. In that method a tau selecton formula s gven by 2 ' max{ εx / g,1} max{ εx / g,1} τ = mn, 2, (5) I rs µ ( x) σ ( x) where g s the hghest order of reacton n whch speces S appears as reactant, ε s an error control parameter, I rs s the set of ndces of all reactant speces, and µ ( x ) ν a ( x), (6) 2 = = 2 σ ( x ) ν a ( x). (7) After the tme nterval τ has been selected, the number of frngs of each reacton channel durng ths tme nterval s approxmated as a Posson random varable. The Posson random varable can have arbtrary large sample value and t s possble that the populaton of some of the molecular speces can run negatve. Therefore, a crtcal number of molecules n c (typcally n the range of 5-20) was ntroduced. If the number of molecular speces gets less then n c, all reacton n whch that speces appears as reactant are defned as crtcal. These reactons are smulated by the stochastc smulaton algorthm. We c calculate the sum of propensty functons of all the crtcal reactons a 0 and generate a second canddate tme τ accordng to '' 1 1 τ = log. (8) r a c o

5 The actual tme leap τ s selected as the smaller of τ and τ. If τ = τ, a number of frngs k s generated as a Posson random varable wth mean a (x) τ for all of the noncrtcal reacton and reactons are executed; no crtcal reacton s executed n ths case. If τ=τ, we generate k and fre noncrtcal reactons as n the prevous case; also, another random number wth unform dstrbuton s generated to fnd whch crtcal reacton needs to be fred accordng to Eq. (1). Evaluatons of the performance of the tau-leapng algorthm shows a 2-3 fold speed up of smulatons compared to the exact stochastc algorthm whle mantanng excellent accuracy wth regard to both rare and frequent events. 4 BIOMOLECULAR NETWORK SIMULATOR The Bomolecular Network Smulator uses a combnaton of MATLAB and C-coded modules. The front-end, graphcal user nterface (GUI) and analyss tools of BNS are wrtten n MATLAB, whle the smulaton core engne s wrtten n C. Such a combnaton allows one to use the nteractve features and vsualzaton tools of MATLAB, whle achevng hgh speed for the computatonally ntensve part of the software. The parallelzaton of the code s done wth the help of the MPI lbrary. The BNS can be run on any computer platform where MATLAB 6.5 or newer s nstalled. 4.1 Input Data A model s a set of mathematcal relatonshps that descrbe the behavor of bochemcal reactons that control cellular bologcal processes. Each of the Model drectores contans one or more subdrectores wth model descrpton fles and/or dfferent sets of parameters for the same model and an Output drectory where the results of smulatons are stored. There are two types of model drectores: one for models defned n the Systems Bology Markup Language (SBML) format [5] and one for models defned as a set of MATLAB m-fles, referred to as the BNS format. In addton, BNS allows one to perform smulatons wth multple parameter sets, wth each parameter set beng run multple tmes. Smulatons wth multple parameter sets can be used for optmzaton and senstvty analyss of the model. 4.2 Output Data Fgure 1. Scalng of BNS wth the number of processors. There are two types of output fles: snapshot data and event log data. Snapshot data fles contan the state of the system (number of molecules of each molecular speces) at user specfed tme ntervals. The nformaton stored n the snapshot fles are used to create runtme nteractve graphcs and for post hoc

6 analyss of the data. The second type of output fles the event log fles contan the record of every dscrete event that occurs durng the smulaton. The user should be aware that event log fles may requre consderable memory or hard dsk space and, therefore, may create memory management problems for smulatons nvolvng a large number of long runs or for large reacton networks. 4.3 Parallelzaton The parallelzaton of the BNS code s accomplshed usng the MPI lbrary. In our parallelzaton scheme, the master processor dvdes the total number of user specfed runs between the avalable processors, sends a set of obs to each of the workers and performs some of the smulaton runs tself. In ths approach to parallelzaton, sometmes called embarrassngly parallel we reduce the communcaton between the nodes and ncrease the speedup of multple smulatons. To test BNS scalng wth the number of processors, we ran 1000 smulatons on an SGI Orgn 3900 machne at ASC MSRC, whch has shared memory archtecture. A smulaton here s defned as a sngle run of the mathematcal model of a partcular bochemcal reacton network. A 92-fold speedup was observed by runnng BNS on 100 processors (Fgure 1). 4.4 Runnng the Smulatons The BNS can be run ether n command lne mode or va a GUI. The GUI allows the user to modfy model parameters at runtme and to execute smulatons n the nteractve or batch mode on HPC resources. (a) (b) Fgure 2. The screen shots of the BNS GUI dalog wndows. (a) The man BNS dalog wndow. (b) The parameters dalog wndow whch allows users to modfy the model parameters and to set smulaton parameters. The man dalog wndow of the BNS GUI s shown n Fgure 2. It allows the user to select the approprate Model and Parameters drectores and set the Run mode. A clck on the Detals button

7 next to the Parameters drectory opens a new wndow, shown n Fgure 2(b). Ths dalog wndow allows the user to modfy model parameters and to set parameters for the smulaton. If smulatons are run n the nteractve mode, partal results of the smulatons wll appear on the screen durng the run. Usually, HPC centers allocate lmted resources (n number of processors and runnng tme) for nteractve smulatons, therefore BNS can be run n Batch mode. In ths mode all output data are stored on the hard drve for further analyss. 4.5 Analyss The Bomolecular Network Smulator has a comprehensve set of tools for post-smulaton analyss. A GUI for the analyss tools allows the user to easly select the data and to set condtons for the analyss. Multple types of post-smulaton analyses are avalable Plots of number of molecules vs. tme The most frequently used type of analyss s a plot of the number of molecules vs. tme. Such plots are avalable n the nteractve mode or as post-smulaton analyss. There are two ways to create plots: each compound s plotted on a separate fgure or multple compounds are plotted on the same fgure wndow (groupng mode). The number of molecules vs. tme plots can be created wth both types of output fles: snapshot data or event log data. Fgure 3. The averaged number of compounds S1 and S2 n the smulaton nterval (0, 2000) obtaned usng the exact Gllespe stochastc algorthm and approxmate tau-leapng algorthm (ε=0.1, n c =5).The tme-weghted average was calculated usng a 50-sec tme-averagng nterval and the ndvdual tmeweghted averages were averaged over the 200 smulaton runs. Data for the mean ± SD are shown Tme-weghted average analyss A tme-weghted average analyss refers to the calculatons of the average number of molecules of a partcular molecular speces durng a user selected tme-averagng nterval. The average s weghted accordng to the amount of tme the compound exsts n each state durng the selected tme-averagng nterval. The tme weghted average s then plotted versus tme. The averagng analyss can be performed for a

8 sngle run or for a selected set of runs. When the analyss s appled to multple runs, the plot shows the between run average (the average of each ndvdual tme-weghted average) and standard devaton. The graphs n Fgure 3 show the behavor of two molecular speces, S1 and S2, over the tme nterval of 2000 seconds for a bomolecular reacton network contanng transcrpton, translaton and metabolc reactons. The smulatons were carred out usng two dfferent algorthms mplemented n BNS: Gllespe stochastc algorthm and tau-leapng algorthm wth parameters ε = 0.1 and n c = 5. Fgure 3 shows the between run average of the tme-weghted average number of molecules for 200 runs usng a tme-averagng nterval of 50 sec. The average number of molecules of speces S1 changed n the range of ~0-20 molecules, whle the average number of molecules of speces S2 changed from 0 to ~2500 molecules. Results obtaned usng an approxmate tau-leapng algorthm are almost ndstngushable from the result of exact Gllespe algorthm for both types of speces. On the other hand, usng the tau-leapng algorthm speeds up smulatons more than 3-fold compared to the exact stochastc algorthm Reacton frequency analyss Complex bomolecular reacton networks usually contan reactons that occur on dfferent tme scales: some reactons have a low propensty and occur rarely; other reactons are very fast and occur frequently. The data stored n the event log fles allow the user to perform varous reacton frequency analyses of the smulaton data to learn more about the basc nature of the system. One type of analyss creates plots of the total number of tmes each reacton n the network occurred durng the smulaton. Fgure 4. The averaged number of reacton occurrences per tme-averagng nterval for the reacton channels rxn21 and rxn24 obtaned usng the exact Gllespe stochastc algorthm and approxmate tauleapng algorthm (ε = 0.1, n c = 5). The tme-averaged rate was calculated usng a 5 sec tme-averagng nterval and the ndvdual tme-averaged rates were averaged over the 200 smulaton runs. Data for the mean ± SD are shown. A second type of analyss s the average and standard devaton of the tme-averaged reacton frequency n each reacton channel. Fgure 4 shows an example of the tme-averaged reacton frequency for two reacton channels averaged over the 200 runs obtaned by runnng smulatons wth the two algorthms. The reacton rxn21 belongs to the group of slow reactons wth the frequency of occurrences n

9 the range of 0-20 frngs per sec. The reacton rxn24 s a fast reacton and reached occurrences per sec. As n the case of average number of molecules, the tau-leapng algorthm shows an excellent agreement wth the results from exact stochastc smulatons for ths partcular bomolecular reacton network. 5 CONCLUSIONS The Bomolecular Network Smulator allows the users to smulate the behavor of complex bologcal processes utlzng the capactes of hgh performance computers. Some of the features that dstngush BNS from smlar tools are: usage of MATLAB and C-coded functons allows the user to combne ntensve vsualzaton of data wth hgh speed computatons; parallelzed code for multple smultaneous smulatons allows the user to run BNS on multprocessor machnes; optons to run the code n the nteractve or batch mode; user frendly graphcal user nterface allows the user to easly set and modfy parameters of the model, smulaton and analyss; and comprehensve tool sets provde for post-smulaton analyss of results. ACKNOWLEDGMENT The work of Yaroslav Chushak was sponsored by the US Department of Defense Hgh Performance Computng Modernzaton Program (HPCMP), under the Hgh Performance Computng Software Applcatons Insttutes (HSAI) ntatve. The work of Brent Foy was made possble by a grant from the Ar Force Offce of Scentfc Research (AFOSR) and by the Ar Force Summer Faculty Fellowshp Program. DISCLAIMER The opnons or assertons contaned heren are the prvate vews of the authors and are not to be construed as offcal or as reflectng the vews of the US Army or the US Department of Defense. Ths paper has been approved for publc release; dstrbuton s unlmted. REFERENCES [1] Gllespe, D., Exact Stochastc Smulaton of Coupled Chemcal Reactons. J. Phys. Chem. v. 81, p (1977). [2] Gllespe, D., 2001, Approxmate accelerated stochastc smulatons of chemcally reactng systems. J. Chem. Phys. v. 115, p (2001). [3] Gllespe, D. and Petzold, L., Improved leap-sze selecton for accelerated stochastc smulatons. J. Chem. Phys. v. 119, p.8229 (2003). [4] Tan, T. and Burrage, K. Bnomal leap methods for smulaton chemcal knetcs. J. Chem. Phys. v. 121, p (2004). [5] Chatteree, A., Vlachos, D. and Katsoulaks, M. Bnomal dstrbuton based τ-leap accelerated stochastc smulaton. J. Chem. Phys. v. 122, (2005). [6] Cao, Y., Gllespe, D. and Petzold, L. Effcent step sze selecton for the tau-leapng smulaton method. J. Chem. Phys. v.124, (2006).

10 [5] Huska, M., Fnney, A., Sauro H. M., Bolour, H. et al., 2003, The Systems Bology Markup Language (SBML): A medum for representaton and exchange of bochemcal network models. Bonformatcs, v. 19, no. 4:

Root Locus Properties of Adaptive Beamforming and Capon Estimation for Uniform Linear Arrays

Root Locus Properties of Adaptive Beamforming and Capon Estimation for Uniform Linear Arrays Root Locus Propertes of Adaptve Beamformng and Capon Estmaton for Unform Lnear Arrays Allan Stenhardt Alphatech phone: 703-284-8426 emal: astenhardt@dc.alphatech.com Abstract In ths paper we explore propertes

More information

NUMERICAL DIFFERENTIATION

NUMERICAL DIFFERENTIATION NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the

More information

Numerical Heat and Mass Transfer

Numerical Heat and Mass Transfer Master degree n Mechancal Engneerng Numercal Heat and Mass Transfer 06-Fnte-Dfference Method (One-dmensonal, steady state heat conducton) Fausto Arpno f.arpno@uncas.t Introducton Why we use models and

More information

Markov Chain Monte Carlo Lecture 6

Markov Chain Monte Carlo Lecture 6 where (x 1,..., x N ) X N, N s called the populaton sze, f(x) f (x) for at least one {1, 2,..., N}, and those dfferent from f(x) are called the tral dstrbutons n terms of mportance samplng. Dfferent ways

More information

Higher Order Wall Boundary Conditions for Incompressible Flow Simulations

Higher Order Wall Boundary Conditions for Incompressible Flow Simulations THE 5 TH ASIAN COMPUTAITIONAL FLUID DYNAMICS BUSAN KOREA OCTOBER 7-30 003 Hgher Order Wall Boundary Condtons for Incompressble Flow Smulatons Hdetosh Nshda. Department of Mechancal and System Engneerng

More information

Queueing Networks II Network Performance

Queueing Networks II Network Performance Queueng Networks II Network Performance Davd Tpper Assocate Professor Graduate Telecommuncatons and Networkng Program Unversty of Pttsburgh Sldes 6 Networks of Queues Many communcaton systems must be modeled

More information

Comparison of Regression Lines

Comparison of Regression Lines STATGRAPHICS Rev. 9/13/2013 Comparson of Regresson Lnes Summary... 1 Data Input... 3 Analyss Summary... 4 Plot of Ftted Model... 6 Condtonal Sums of Squares... 6 Analyss Optons... 7 Forecasts... 8 Confdence

More information

Introduction to Vapor/Liquid Equilibrium, part 2. Raoult s Law:

Introduction to Vapor/Liquid Equilibrium, part 2. Raoult s Law: CE304, Sprng 2004 Lecture 4 Introducton to Vapor/Lqud Equlbrum, part 2 Raoult s Law: The smplest model that allows us do VLE calculatons s obtaned when we assume that the vapor phase s an deal gas, and

More information

Negative Binomial Regression

Negative Binomial Regression STATGRAPHICS Rev. 9/16/2013 Negatve Bnomal Regresson Summary... 1 Data Input... 3 Statstcal Model... 3 Analyss Summary... 4 Analyss Optons... 7 Plot of Ftted Model... 8 Observed Versus Predcted... 10 Predctons...

More information

Transfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system

Transfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system Transfer Functons Convenent representaton of a lnear, dynamc model. A transfer functon (TF) relates one nput and one output: x t X s y t system Y s The followng termnology s used: x y nput output forcng

More information

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:

More information

Generalized Linear Methods

Generalized Linear Methods Generalzed Lnear Methods 1 Introducton In the Ensemble Methods the general dea s that usng a combnaton of several weak learner one could make a better learner. More formally, assume that we have a set

More information

Supporting Information

Supporting Information Supportng Informaton The neural network f n Eq. 1 s gven by: f x l = ReLU W atom x l + b atom, 2 where ReLU s the element-wse rectfed lnear unt, 21.e., ReLUx = max0, x, W atom R d d s the weght matrx to

More information

Using T.O.M to Estimate Parameter of distributions that have not Single Exponential Family

Using T.O.M to Estimate Parameter of distributions that have not Single Exponential Family IOSR Journal of Mathematcs IOSR-JM) ISSN: 2278-5728. Volume 3, Issue 3 Sep-Oct. 202), PP 44-48 www.osrjournals.org Usng T.O.M to Estmate Parameter of dstrbutons that have not Sngle Exponental Famly Jubran

More information

Uncertainty in measurements of power and energy on power networks

Uncertainty in measurements of power and energy on power networks Uncertanty n measurements of power and energy on power networks E. Manov, N. Kolev Department of Measurement and Instrumentaton, Techncal Unversty Sofa, bul. Klment Ohrdsk No8, bl., 000 Sofa, Bulgara Tel./fax:

More information

CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE

CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE Analytcal soluton s usually not possble when exctaton vares arbtrarly wth tme or f the system s nonlnear. Such problems can be solved by numercal tmesteppng

More information

COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS

COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS Avalable onlne at http://sck.org J. Math. Comput. Sc. 3 (3), No., 6-3 ISSN: 97-537 COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS

More information

Note 10. Modeling and Simulation of Dynamic Systems

Note 10. Modeling and Simulation of Dynamic Systems Lecture Notes of ME 475: Introducton to Mechatroncs Note 0 Modelng and Smulaton of Dynamc Systems Department of Mechancal Engneerng, Unversty Of Saskatchewan, 57 Campus Drve, Saskatoon, SK S7N 5A9, Canada

More information

Linear Approximation with Regularization and Moving Least Squares

Linear Approximation with Regularization and Moving Least Squares Lnear Approxmaton wth Regularzaton and Movng Least Squares Igor Grešovn May 007 Revson 4.6 (Revson : March 004). 5 4 3 0.5 3 3.5 4 Contents: Lnear Fttng...4. Weghted Least Squares n Functon Approxmaton...

More information

Kernel Methods and SVMs Extension

Kernel Methods and SVMs Extension Kernel Methods and SVMs Extenson The purpose of ths document s to revew materal covered n Machne Learnng 1 Supervsed Learnng regardng support vector machnes (SVMs). Ths document also provdes a general

More information

More metrics on cartesian products

More metrics on cartesian products More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of

More information

Lecture 4: November 17, Part 1 Single Buffer Management

Lecture 4: November 17, Part 1 Single Buffer Management Lecturer: Ad Rosén Algorthms for the anagement of Networs Fall 2003-2004 Lecture 4: November 7, 2003 Scrbe: Guy Grebla Part Sngle Buffer anagement In the prevous lecture we taled about the Combned Input

More information

Comparison of the Population Variance Estimators. of 2-Parameter Exponential Distribution Based on. Multiple Criteria Decision Making Method

Comparison of the Population Variance Estimators. of 2-Parameter Exponential Distribution Based on. Multiple Criteria Decision Making Method Appled Mathematcal Scences, Vol. 7, 0, no. 47, 07-0 HIARI Ltd, www.m-hkar.com Comparson of the Populaton Varance Estmators of -Parameter Exponental Dstrbuton Based on Multple Crtera Decson Makng Method

More information

See Book Chapter 11 2 nd Edition (Chapter 10 1 st Edition)

See Book Chapter 11 2 nd Edition (Chapter 10 1 st Edition) Count Data Models See Book Chapter 11 2 nd Edton (Chapter 10 1 st Edton) Count data consst of non-negatve nteger values Examples: number of drver route changes per week, the number of trp departure changes

More information

An Interactive Optimisation Tool for Allocation Problems

An Interactive Optimisation Tool for Allocation Problems An Interactve Optmsaton ool for Allocaton Problems Fredr Bonäs, Joam Westerlund and apo Westerlund Process Desgn Laboratory, Faculty of echnology, Åbo Aadem Unversty, uru 20500, Fnland hs paper presents

More information

Operating conditions of a mine fan under conditions of variable resistance

Operating conditions of a mine fan under conditions of variable resistance Paper No. 11 ISMS 216 Operatng condtons of a mne fan under condtons of varable resstance Zhang Ynghua a, Chen L a, b, Huang Zhan a, *, Gao Yukun a a State Key Laboratory of Hgh-Effcent Mnng and Safety

More information

Chapter 13: Multiple Regression

Chapter 13: Multiple Regression Chapter 13: Multple Regresson 13.1 Developng the multple-regresson Model The general model can be descrbed as: It smplfes for two ndependent varables: The sample ft parameter b 0, b 1, and b are used to

More information

Department of Statistics University of Toronto STA305H1S / 1004 HS Design and Analysis of Experiments Term Test - Winter Solution

Department of Statistics University of Toronto STA305H1S / 1004 HS Design and Analysis of Experiments Term Test - Winter Solution Department of Statstcs Unversty of Toronto STA35HS / HS Desgn and Analyss of Experments Term Test - Wnter - Soluton February, Last Name: Frst Name: Student Number: Instructons: Tme: hours. Ads: a non-programmable

More information

A PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS

A PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS HCMC Unversty of Pedagogy Thong Nguyen Huu et al. A PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS Thong Nguyen Huu and Hao Tran Van Department of mathematcs-nformaton,

More information

6. Stochastic processes (2)

6. Stochastic processes (2) 6. Stochastc processes () Lect6.ppt S-38.45 - Introducton to Teletraffc Theory Sprng 5 6. Stochastc processes () Contents Markov processes Brth-death processes 6. Stochastc processes () Markov process

More information

6. Stochastic processes (2)

6. Stochastic processes (2) Contents Markov processes Brth-death processes Lect6.ppt S-38.45 - Introducton to Teletraffc Theory Sprng 5 Markov process Consder a contnuous-tme and dscrete-state stochastc process X(t) wth state space

More information

Supplementary Notes for Chapter 9 Mixture Thermodynamics

Supplementary Notes for Chapter 9 Mixture Thermodynamics Supplementary Notes for Chapter 9 Mxture Thermodynamcs Key ponts Nne major topcs of Chapter 9 are revewed below: 1. Notaton and operatonal equatons for mxtures 2. PVTN EOSs for mxtures 3. General effects

More information

18.1 Introduction and Recap

18.1 Introduction and Recap CS787: Advanced Algorthms Scrbe: Pryananda Shenoy and Shjn Kong Lecturer: Shuch Chawla Topc: Streamng Algorthmscontnued) Date: 0/26/2007 We contnue talng about streamng algorthms n ths lecture, ncludng

More information

Design and Optimization of Fuzzy Controller for Inverse Pendulum System Using Genetic Algorithm

Design and Optimization of Fuzzy Controller for Inverse Pendulum System Using Genetic Algorithm Desgn and Optmzaton of Fuzzy Controller for Inverse Pendulum System Usng Genetc Algorthm H. Mehraban A. Ashoor Unversty of Tehran Unversty of Tehran h.mehraban@ece.ut.ac.r a.ashoor@ece.ut.ac.r Abstract:

More information

Aging model for a 40 V Nch MOS, based on an innovative approach F. Alagi, R. Stella, E. Viganò

Aging model for a 40 V Nch MOS, based on an innovative approach F. Alagi, R. Stella, E. Viganò Agng model for a 4 V Nch MOS, based on an nnovatve approach F. Alag, R. Stella, E. Vganò ST Mcroelectroncs Cornaredo (Mlan) - Italy Agng modelng WHAT IS AGING MODELING: Agng modelng s a tool to smulate

More information

Markov Chain Monte Carlo (MCMC), Gibbs Sampling, Metropolis Algorithms, and Simulated Annealing Bioinformatics Course Supplement

Markov Chain Monte Carlo (MCMC), Gibbs Sampling, Metropolis Algorithms, and Simulated Annealing Bioinformatics Course Supplement Markov Chan Monte Carlo MCMC, Gbbs Samplng, Metropols Algorthms, and Smulated Annealng 2001 Bonformatcs Course Supplement SNU Bontellgence Lab http://bsnuackr/ Outlne! Markov Chan Monte Carlo MCMC! Metropols-Hastngs

More information

Week3, Chapter 4. Position and Displacement. Motion in Two Dimensions. Instantaneous Velocity. Average Velocity

Week3, Chapter 4. Position and Displacement. Motion in Two Dimensions. Instantaneous Velocity. Average Velocity Week3, Chapter 4 Moton n Two Dmensons Lecture Quz A partcle confned to moton along the x axs moves wth constant acceleraton from x =.0 m to x = 8.0 m durng a 1-s tme nterval. The velocty of the partcle

More information

Chapter 11: Simple Linear Regression and Correlation

Chapter 11: Simple Linear Regression and Correlation Chapter 11: Smple Lnear Regresson and Correlaton 11-1 Emprcal Models 11-2 Smple Lnear Regresson 11-3 Propertes of the Least Squares Estmators 11-4 Hypothess Test n Smple Lnear Regresson 11-4.1 Use of t-tests

More information

Credit Card Pricing and Impact of Adverse Selection

Credit Card Pricing and Impact of Adverse Selection Credt Card Prcng and Impact of Adverse Selecton Bo Huang and Lyn C. Thomas Unversty of Southampton Contents Background Aucton model of credt card solctaton - Errors n probablty of beng Good - Errors n

More information

Errors for Linear Systems

Errors for Linear Systems Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch

More information

The Study of Teaching-learning-based Optimization Algorithm

The Study of Teaching-learning-based Optimization Algorithm Advanced Scence and Technology Letters Vol. (AST 06), pp.05- http://dx.do.org/0.57/astl.06. The Study of Teachng-learnng-based Optmzaton Algorthm u Sun, Yan fu, Lele Kong, Haolang Q,, Helongang Insttute

More information

Lecture Notes on Linear Regression

Lecture Notes on Linear Regression Lecture Notes on Lnear Regresson Feng L fl@sdueducn Shandong Unversty, Chna Lnear Regresson Problem In regresson problem, we am at predct a contnuous target value gven an nput feature vector We assume

More information

Simulated Power of the Discrete Cramér-von Mises Goodness-of-Fit Tests

Simulated Power of the Discrete Cramér-von Mises Goodness-of-Fit Tests Smulated of the Cramér-von Mses Goodness-of-Ft Tests Steele, M., Chaselng, J. and 3 Hurst, C. School of Mathematcal and Physcal Scences, James Cook Unversty, Australan School of Envronmental Studes, Grffth

More information

Econ107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4)

Econ107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4) I. Classcal Assumptons Econ7 Appled Econometrcs Topc 3: Classcal Model (Studenmund, Chapter 4) We have defned OLS and studed some algebrac propertes of OLS. In ths topc we wll study statstcal propertes

More information

LINEAR REGRESSION ANALYSIS. MODULE VIII Lecture Indicator Variables

LINEAR REGRESSION ANALYSIS. MODULE VIII Lecture Indicator Variables LINEAR REGRESSION ANALYSIS MODULE VIII Lecture - 7 Indcator Varables Dr. Shalabh Department of Maematcs and Statstcs Indan Insttute of Technology Kanpur Indcator varables versus quanttatve explanatory

More information

Feature Selection: Part 1

Feature Selection: Part 1 CSE 546: Machne Learnng Lecture 5 Feature Selecton: Part 1 Instructor: Sham Kakade 1 Regresson n the hgh dmensonal settng How do we learn when the number of features d s greater than the sample sze n?

More information

EEE 241: Linear Systems

EEE 241: Linear Systems EEE : Lnear Systems Summary #: Backpropagaton BACKPROPAGATION The perceptron rule as well as the Wdrow Hoff learnng were desgned to tran sngle layer networks. They suffer from the same dsadvantage: they

More information

Parametric fractional imputation for missing data analysis. Jae Kwang Kim Survey Working Group Seminar March 29, 2010

Parametric fractional imputation for missing data analysis. Jae Kwang Kim Survey Working Group Seminar March 29, 2010 Parametrc fractonal mputaton for mssng data analyss Jae Kwang Km Survey Workng Group Semnar March 29, 2010 1 Outlne Introducton Proposed method Fractonal mputaton Approxmaton Varance estmaton Multple mputaton

More information

Lecture 4. Macrostates and Microstates (Ch. 2 )

Lecture 4. Macrostates and Microstates (Ch. 2 ) Lecture 4. Macrostates and Mcrostates (Ch. ) The past three lectures: we have learned about thermal energy, how t s stored at the mcroscopc level, and how t can be transferred from one system to another.

More information

Application of B-Spline to Numerical Solution of a System of Singularly Perturbed Problems

Application of B-Spline to Numerical Solution of a System of Singularly Perturbed Problems Mathematca Aeterna, Vol. 1, 011, no. 06, 405 415 Applcaton of B-Splne to Numercal Soluton of a System of Sngularly Perturbed Problems Yogesh Gupta Department of Mathematcs Unted College of Engneerng &

More information

Foundations of Arithmetic

Foundations of Arithmetic Foundatons of Arthmetc Notaton We shall denote the sum and product of numbers n the usual notaton as a 2 + a 2 + a 3 + + a = a, a 1 a 2 a 3 a = a The notaton a b means a dvdes b,.e. ac = b where c s an

More information

Chapter 14 Simple Linear Regression

Chapter 14 Simple Linear Regression Chapter 4 Smple Lnear Regresson Chapter 4 - Smple Lnear Regresson Manageral decsons often are based on the relatonshp between two or more varables. Regresson analss can be used to develop an equaton showng

More information

Simulation and Probability Distribution

Simulation and Probability Distribution CHAPTER Probablty, Statstcs, and Relablty for Engneers and Scentsts Second Edton PROBABILIT DISTRIBUTION FOR CONTINUOUS RANDOM VARIABLES A. J. Clark School of Engneerng Department of Cvl and Envronmental

More information

Calculation of time complexity (3%)

Calculation of time complexity (3%) Problem 1. (30%) Calculaton of tme complexty (3%) Gven n ctes, usng exhaust search to see every result takes O(n!). Calculaton of tme needed to solve the problem (2%) 40 ctes:40! dfferent tours 40 add

More information

Numerical Solution of Ordinary Differential Equations

Numerical Solution of Ordinary Differential Equations Numercal Methods (CENG 00) CHAPTER-VI Numercal Soluton of Ordnar Dfferental Equatons 6 Introducton Dfferental equatons are equatons composed of an unknown functon and ts dervatves The followng are examples

More information

Statistics for Economics & Business

Statistics for Economics & Business Statstcs for Economcs & Busness Smple Lnear Regresson Learnng Objectves In ths chapter, you learn: How to use regresson analyss to predct the value of a dependent varable based on an ndependent varable

More information

3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X

3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number

More information

BOOTSTRAP METHOD FOR TESTING OF EQUALITY OF SEVERAL MEANS. M. Krishna Reddy, B. Naveen Kumar and Y. Ramu

BOOTSTRAP METHOD FOR TESTING OF EQUALITY OF SEVERAL MEANS. M. Krishna Reddy, B. Naveen Kumar and Y. Ramu BOOTSTRAP METHOD FOR TESTING OF EQUALITY OF SEVERAL MEANS M. Krshna Reddy, B. Naveen Kumar and Y. Ramu Department of Statstcs, Osmana Unversty, Hyderabad -500 007, Inda. nanbyrozu@gmal.com, ramu0@gmal.com

More information

This column is a continuation of our previous column

This column is a continuation of our previous column Comparson of Goodness of Ft Statstcs for Lnear Regresson, Part II The authors contnue ther dscusson of the correlaton coeffcent n developng a calbraton for quanttatve analyss. Jerome Workman Jr. and Howard

More information

Polynomial Regression Models

Polynomial Regression Models LINEAR REGRESSION ANALYSIS MODULE XII Lecture - 6 Polynomal Regresson Models Dr. Shalabh Department of Mathematcs and Statstcs Indan Insttute of Technology Kanpur Test of sgnfcance To test the sgnfcance

More information

A Simple Inventory System

A Simple Inventory System A Smple Inventory System Lawrence M. Leems and Stephen K. Park, Dscrete-Event Smulaton: A Frst Course, Prentce Hall, 2006 Hu Chen Computer Scence Vrgna State Unversty Petersburg, Vrgna February 8, 2017

More information

Convergence of random processes

Convergence of random processes DS-GA 12 Lecture notes 6 Fall 216 Convergence of random processes 1 Introducton In these notes we study convergence of dscrete random processes. Ths allows to characterze phenomena such as the law of large

More information

Lecture 17 : Stochastic Processes II

Lecture 17 : Stochastic Processes II : Stochastc Processes II 1 Contnuous-tme stochastc process So far we have studed dscrete-tme stochastc processes. We studed the concept of Makov chans and martngales, tme seres analyss, and regresson analyss

More information

The Expectation-Maximization Algorithm

The Expectation-Maximization Algorithm The Expectaton-Maxmaton Algorthm Charles Elan elan@cs.ucsd.edu November 16, 2007 Ths chapter explans the EM algorthm at multple levels of generalty. Secton 1 gves the standard hgh-level verson of the algorthm.

More information

CS-433: Simulation and Modeling Modeling and Probability Review

CS-433: Simulation and Modeling Modeling and Probability Review CS-433: Smulaton and Modelng Modelng and Probablty Revew Exercse 1. (Probablty of Smple Events) Exercse 1.1 The owner of a camera shop receves a shpment of fve cameras from a camera manufacturer. Unknown

More information

FREQUENCY DISTRIBUTIONS Page 1 of The idea of a frequency distribution for sets of observations will be introduced,

FREQUENCY DISTRIBUTIONS Page 1 of The idea of a frequency distribution for sets of observations will be introduced, FREQUENCY DISTRIBUTIONS Page 1 of 6 I. Introducton 1. The dea of a frequency dstrbuton for sets of observatons wll be ntroduced, together wth some of the mechancs for constructng dstrbutons of data. Then

More information

Solving Nonlinear Differential Equations by a Neural Network Method

Solving Nonlinear Differential Equations by a Neural Network Method Solvng Nonlnear Dfferental Equatons by a Neural Network Method Luce P. Aarts and Peter Van der Veer Delft Unversty of Technology, Faculty of Cvlengneerng and Geoscences, Secton of Cvlengneerng Informatcs,

More information

BIO Lab 2: TWO-LEVEL NORMAL MODELS with school children popularity data

BIO Lab 2: TWO-LEVEL NORMAL MODELS with school children popularity data Lab : TWO-LEVEL NORMAL MODELS wth school chldren popularty data Purpose: Introduce basc two-level models for normally dstrbuted responses usng STATA. In partcular, we dscuss Random ntercept models wthout

More information

RELIABILITY ASSESSMENT

RELIABILITY ASSESSMENT CHAPTER Rsk Analyss n Engneerng and Economcs RELIABILITY ASSESSMENT A. J. Clark School of Engneerng Department of Cvl and Envronmental Engneerng 4a CHAPMAN HALL/CRC Rsk Analyss for Engneerng Department

More information

1 Derivation of Rate Equations from Single-Cell Conductance (Hodgkin-Huxley-like) Equations

1 Derivation of Rate Equations from Single-Cell Conductance (Hodgkin-Huxley-like) Equations Physcs 171/271 -Davd Klenfeld - Fall 2005 (revsed Wnter 2011) 1 Dervaton of Rate Equatons from Sngle-Cell Conductance (Hodgkn-Huxley-lke) Equatons We consder a network of many neurons, each of whch obeys

More information

LOW BIAS INTEGRATED PATH ESTIMATORS. James M. Calvin

LOW BIAS INTEGRATED PATH ESTIMATORS. James M. Calvin Proceedngs of the 007 Wnter Smulaton Conference S G Henderson, B Bller, M-H Hseh, J Shortle, J D Tew, and R R Barton, eds LOW BIAS INTEGRATED PATH ESTIMATORS James M Calvn Department of Computer Scence

More information

Mathematical Approaches for Analysis of Biochemical Reaction Networks

Mathematical Approaches for Analysis of Biochemical Reaction Networks Mathematcal Approaches for Analyss of Bochemcal Reacton Networks Chang Hyeong Lee Asa Pacfc Mathematcs Newsletter Abstract. A bochemcal reacton network s the system n whch bochemcal speces nteract through

More information

Global Sensitivity. Tuesday 20 th February, 2018

Global Sensitivity. Tuesday 20 th February, 2018 Global Senstvty Tuesday 2 th February, 28 ) Local Senstvty Most senstvty analyses [] are based on local estmates of senstvty, typcally by expandng the response n a Taylor seres about some specfc values

More information

9 Derivation of Rate Equations from Single-Cell Conductance (Hodgkin-Huxley-like) Equations

9 Derivation of Rate Equations from Single-Cell Conductance (Hodgkin-Huxley-like) Equations Physcs 171/271 - Chapter 9R -Davd Klenfeld - Fall 2005 9 Dervaton of Rate Equatons from Sngle-Cell Conductance (Hodgkn-Huxley-lke) Equatons We consder a network of many neurons, each of whch obeys a set

More information

Distributions /06. G.Serazzi 05/06 Dimensionamento degli Impianti Informatici distrib - 1

Distributions /06. G.Serazzi 05/06 Dimensionamento degli Impianti Informatici distrib - 1 Dstrbutons 8/03/06 /06 G.Serazz 05/06 Dmensonamento degl Impant Informatc dstrb - outlne densty, dstrbuton, moments unform dstrbuton Posson process, eponental dstrbuton Pareto functon densty and dstrbuton

More information

ESCI 341 Atmospheric Thermodynamics Lesson 10 The Physical Meaning of Entropy

ESCI 341 Atmospheric Thermodynamics Lesson 10 The Physical Meaning of Entropy ESCI 341 Atmospherc Thermodynamcs Lesson 10 The Physcal Meanng of Entropy References: An Introducton to Statstcal Thermodynamcs, T.L. Hll An Introducton to Thermodynamcs and Thermostatstcs, H.B. Callen

More information

Chapter 8 Indicator Variables

Chapter 8 Indicator Variables Chapter 8 Indcator Varables In general, e explanatory varables n any regresson analyss are assumed to be quanttatve n nature. For example, e varables lke temperature, dstance, age etc. are quanttatve n

More information

AP Physics 1 & 2 Summer Assignment

AP Physics 1 & 2 Summer Assignment AP Physcs 1 & 2 Summer Assgnment AP Physcs 1 requres an exceptonal profcency n algebra, trgonometry, and geometry. It was desgned by a select group of college professors and hgh school scence teachers

More information

Speeding up Computation of Scalar Multiplication in Elliptic Curve Cryptosystem

Speeding up Computation of Scalar Multiplication in Elliptic Curve Cryptosystem H.K. Pathak et. al. / (IJCSE) Internatonal Journal on Computer Scence and Engneerng Speedng up Computaton of Scalar Multplcaton n Ellptc Curve Cryptosystem H. K. Pathak Manju Sangh S.o.S n Computer scence

More information

Single-Facility Scheduling over Long Time Horizons by Logic-based Benders Decomposition

Single-Facility Scheduling over Long Time Horizons by Logic-based Benders Decomposition Sngle-Faclty Schedulng over Long Tme Horzons by Logc-based Benders Decomposton Elvn Coban and J. N. Hooker Tepper School of Busness, Carnege Mellon Unversty ecoban@andrew.cmu.edu, john@hooker.tepper.cmu.edu

More information

Amplification and Relaxation of Electron Spin Polarization in Semiconductor Devices

Amplification and Relaxation of Electron Spin Polarization in Semiconductor Devices Amplfcaton and Relaxaton of Electron Spn Polarzaton n Semconductor Devces Yury V. Pershn and Vladmr Prvman Center for Quantum Devce Technology, Clarkson Unversty, Potsdam, New York 13699-570, USA Spn Relaxaton

More information

An identification algorithm of model kinetic parameters of the interfacial layer growth in fiber composites

An identification algorithm of model kinetic parameters of the interfacial layer growth in fiber composites IOP Conference Seres: Materals Scence and Engneerng PAPER OPE ACCESS An dentfcaton algorthm of model knetc parameters of the nterfacal layer growth n fber compostes o cte ths artcle: V Zubov et al 216

More information

Hidden Markov Models & The Multivariate Gaussian (10/26/04)

Hidden Markov Models & The Multivariate Gaussian (10/26/04) CS281A/Stat241A: Statstcal Learnng Theory Hdden Markov Models & The Multvarate Gaussan (10/26/04) Lecturer: Mchael I. Jordan Scrbes: Jonathan W. Hu 1 Hdden Markov Models As a bref revew, hdden Markov models

More information

Uncertainty as the Overlap of Alternate Conditional Distributions

Uncertainty as the Overlap of Alternate Conditional Distributions Uncertanty as the Overlap of Alternate Condtonal Dstrbutons Olena Babak and Clayton V. Deutsch Centre for Computatonal Geostatstcs Department of Cvl & Envronmental Engneerng Unversty of Alberta An mportant

More information

Lecture 16 Statistical Analysis in Biomaterials Research (Part II)

Lecture 16 Statistical Analysis in Biomaterials Research (Part II) 3.051J/0.340J 1 Lecture 16 Statstcal Analyss n Bomaterals Research (Part II) C. F Dstrbuton Allows comparson of varablty of behavor between populatons usng test of hypothess: σ x = σ x amed for Brtsh statstcan

More information

A FAST HEURISTIC FOR TASKS ASSIGNMENT IN MANYCORE SYSTEMS WITH VOLTAGE-FREQUENCY ISLANDS

A FAST HEURISTIC FOR TASKS ASSIGNMENT IN MANYCORE SYSTEMS WITH VOLTAGE-FREQUENCY ISLANDS Shervn Haamn A FAST HEURISTIC FOR TASKS ASSIGNMENT IN MANYCORE SYSTEMS WITH VOLTAGE-FREQUENCY ISLANDS INTRODUCTION Increasng computatons n applcatons has led to faster processng. o Use more cores n a chp

More information

Winter 2008 CS567 Stochastic Linear/Integer Programming Guest Lecturer: Xu, Huan

Winter 2008 CS567 Stochastic Linear/Integer Programming Guest Lecturer: Xu, Huan Wnter 2008 CS567 Stochastc Lnear/Integer Programmng Guest Lecturer: Xu, Huan Class 2: More Modelng Examples 1 Capacty Expanson Capacty expanson models optmal choces of the tmng and levels of nvestments

More information

x = , so that calculated

x = , so that calculated Stat 4, secton Sngle Factor ANOVA notes by Tm Plachowsk n chapter 8 we conducted hypothess tests n whch we compared a sngle sample s mean or proporton to some hypotheszed value Chapter 9 expanded ths to

More information

On an Extension of Stochastic Approximation EM Algorithm for Incomplete Data Problems. Vahid Tadayon 1

On an Extension of Stochastic Approximation EM Algorithm for Incomplete Data Problems. Vahid Tadayon 1 On an Extenson of Stochastc Approxmaton EM Algorthm for Incomplete Data Problems Vahd Tadayon Abstract: The Stochastc Approxmaton EM (SAEM algorthm, a varant stochastc approxmaton of EM, s a versatle tool

More information

Physics 5153 Classical Mechanics. D Alembert s Principle and The Lagrangian-1

Physics 5153 Classical Mechanics. D Alembert s Principle and The Lagrangian-1 P. Guterrez Physcs 5153 Classcal Mechancs D Alembert s Prncple and The Lagrangan 1 Introducton The prncple of vrtual work provdes a method of solvng problems of statc equlbrum wthout havng to consder the

More information

Report on Image warping

Report on Image warping Report on Image warpng Xuan Ne, Dec. 20, 2004 Ths document summarzed the algorthms of our mage warpng soluton for further study, and there s a detaled descrpton about the mplementaton of these algorthms.

More information

Chapter 5 Multilevel Models

Chapter 5 Multilevel Models Chapter 5 Multlevel Models 5.1 Cross-sectonal multlevel models 5.1.1 Two-level models 5.1.2 Multple level models 5.1.3 Multple level modelng n other felds 5.2 Longtudnal multlevel models 5.2.1 Two-level

More information

Appendix B. The Finite Difference Scheme

Appendix B. The Finite Difference Scheme 140 APPENDIXES Appendx B. The Fnte Dfference Scheme In ths appendx we present numercal technques whch are used to approxmate solutons of system 3.1 3.3. A comprehensve treatment of theoretcal and mplementaton

More information

Linear Regression Analysis: Terminology and Notation

Linear Regression Analysis: Terminology and Notation ECON 35* -- Secton : Basc Concepts of Regresson Analyss (Page ) Lnear Regresson Analyss: Termnology and Notaton Consder the generc verson of the smple (two-varable) lnear regresson model. It s represented

More information

Real-Time Systems. Multiprocessor scheduling. Multiprocessor scheduling. Multiprocessor scheduling

Real-Time Systems. Multiprocessor scheduling. Multiprocessor scheduling. Multiprocessor scheduling Real-Tme Systems Multprocessor schedulng Specfcaton Implementaton Verfcaton Multprocessor schedulng -- -- Global schedulng How are tasks assgned to processors? Statc assgnment The processor(s) used for

More information

ANSWERS. Problem 1. and the moment generating function (mgf) by. defined for any real t. Use this to show that E( U) var( U)

ANSWERS. Problem 1. and the moment generating function (mgf) by. defined for any real t. Use this to show that E( U) var( U) Econ 413 Exam 13 H ANSWERS Settet er nndelt 9 deloppgaver, A,B,C, som alle anbefales å telle lkt for å gøre det ltt lettere å stå. Svar er gtt . Unfortunately, there s a prntng error n the hnt of

More information

Uncertainty and auto-correlation in. Measurement

Uncertainty and auto-correlation in. Measurement Uncertanty and auto-correlaton n arxv:1707.03276v2 [physcs.data-an] 30 Dec 2017 Measurement Markus Schebl Federal Offce of Metrology and Surveyng (BEV), 1160 Venna, Austra E-mal: markus.schebl@bev.gv.at

More information

EEL 6266 Power System Operation and Control. Chapter 3 Economic Dispatch Using Dynamic Programming

EEL 6266 Power System Operation and Control. Chapter 3 Economic Dispatch Using Dynamic Programming EEL 6266 Power System Operaton and Control Chapter 3 Economc Dspatch Usng Dynamc Programmng Pecewse Lnear Cost Functons Common practce many utltes prefer to represent ther generator cost functons as sngle-

More information

DETERMINATION OF TEMPERATURE DISTRIBUTION FOR ANNULAR FINS WITH TEMPERATURE DEPENDENT THERMAL CONDUCTIVITY BY HPM

DETERMINATION OF TEMPERATURE DISTRIBUTION FOR ANNULAR FINS WITH TEMPERATURE DEPENDENT THERMAL CONDUCTIVITY BY HPM Ganj, Z. Z., et al.: Determnaton of Temperature Dstrbuton for S111 DETERMINATION OF TEMPERATURE DISTRIBUTION FOR ANNULAR FINS WITH TEMPERATURE DEPENDENT THERMAL CONDUCTIVITY BY HPM by Davood Domr GANJI

More information

ECE559VV Project Report

ECE559VV Project Report ECE559VV Project Report (Supplementary Notes Loc Xuan Bu I. MAX SUM-RATE SCHEDULING: THE UPLINK CASE We have seen (n the presentaton that, for downlnk (broadcast channels, the strategy maxmzng the sum-rate

More information