# Register now to access 7 million high quality study materials (What's Course Hero?) Course Hero is the premier provider of high quality online educational resources. With millions of study documents, online tutors, digital flashcards and free courseware, Course Hero is helping students learn more efficiently and effectively. Whether you're interested in exploring new subjects or mastering key topics for your next exam, Course Hero has the tools you need to achieve your goals.

45 Pages

### hms_7091

Course: HST 512, Spring 2006
School: MIT
Rating:

Word Count: 2968

#### Document Preview

Division Harvard-MIT of Health Sciences and Technology HST.512: Genomic Medicine Prof. Marco F. Ramoni Machine Learning Methods for Microarray Data Analysis Marco F. Ramoni Children's Hospital Informatics Program Harvard Partners Center for Genetics and Genomics Harvard Medical School HST 512 Outline Supervised vs Unsupervised Supervised Classification Definition Supervision Feature Selection Differential...

Register Now

#### Unformatted Document Excerpt

Coursehero >> Massachusetts >> MIT >> HST 512

Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.

Course Hero has millions of student submitted documents similar to the one below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.
Division Harvard-MIT of Health Sciences and Technology HST.512: Genomic Medicine Prof. Marco F. Ramoni Machine Learning Methods for Microarray Data Analysis Marco F. Ramoni Children's Hospital Informatics Program Harvard Partners Center for Genetics and Genomics Harvard Medical School HST 512 Outline Supervised vs Unsupervised Supervised Classification Definition Supervision Feature Selection Differential Analysis Normalization Prediction and Validation Probabilistic Voting Schemes Independent Validation Cross Validation Clustering One-dimensional Self Organizing Maps Hierarchical Bayesian Temporal Bayesian networks Definitions Learning Prediction Validation HST 512 Central Dogma of Molecular Biology Traits Diseases RNA DNA mRNA Proteins Physiology Metabolism Drug Resistance HST 512 Functional Genomics Goal: Elucidate functions and interactions of genes. Method: Gene expression is used to identify function. Tools: Characteristic tools of functional genomics: High throughput platforms. Computational and statistical data analysis. Style: The intellectual style is different: Research is no longer hypothesis driven. Research is based on exploratory analysis. Issue: Functional genomics is in search of a sound and accepted methodological paradigm. HST 512 Microarray Technology Scope: Microarrays are reshaping molecular biology. Task: Simultaneously measure the expression value of thousands of genes and, possibly, of entire genomes. Definition: A microarray is a vector of probes measuring the expression values of an equal number of genes. Measure: Microarrays measure gene expression values as abundance of mRNA. Types: There are two main classes of microarrays: cDNA: use entire transcripts; Oligonucleotide: use representative gene segments. HST 512 Measuring Expression Rationale: Measurement of gene expression reverses the natural expression process. Hybridization: Process of joining two complementary strands of DNA or one each of DNA and RNA to from a double-stranded molecule. Artificial process: Backward the mRNA production. DNA samples (probes) are on the microarray. Put cellular labeled mRNA on the microarray. Wait for the sample to hybridize (bind). Scan the image and, for each point, quantify the amount of hybridized mRNA. HST 512 From Tissues to Microarrays Tissues mRNA tagged by fluorescent dye Fluidics Station Image Scanner Data HST 512 cDNA microarrays Fix, for each gene, many copies of two functional DNA on a glass. The labeled probes are allowed to bind to complementary DNA strands on the microarray. Fluorescent intensity in each probe measures which genes are present in which sample. HST 512 cDNA Microarray Data Green: genetic material is present in the control but not in the treated sample. Red: genetic material is only present in the treated sample but not in the control. Yellow: genetic material is present in both samples. Gray: genetic material is not contained in either samples. HST 512 Oligonucleotide Microarrays Oligonucleotide arrays : Affymetrix genechip. Represent a gene with a set of about 20 probe pairs: Each probe (oligonucleotide) is a sequence of 25 pairs of bases, characteristic of one gene. Each probe pair is made by: Perfect match (PM): a probe that should hybridize. Mismatch (MM): a probe that should not hybridize, because the central base has been inverted. PM MM ATGAGCTGATGCCATGCCATGAGAG ATGAGCTGATGCGATGCCATGAGAG HST 512 Oligonucleotide Microarray Data Scanned microarray Each cell measures the expression level of a probe. mRNA reference sequence 5 3 Spaced DNA probe pairs Reference sequence ... TGTGATGGTGGGAATGGGTCAGAAGGACTCCTATGTGGGTGACGGAGGCC ... AATGGGTCAGAACGACTCCTATGTGGGTG Mismatch Oligo AATGGGTCAGAAGGACTCCTATGTGGGTG Perfect match Oligo Perfect match probe cells Fluorescence Intensity Image Mismatch probe cells Intensity: Gene expression level is quantified by the intensity of its cells in the scanned image. Expression = avg(PM-MM) HST 512 Expression Measures Definition: Expression is calculated by estimating the amount of hybridized mRNA for each probe as of quantity of its fluorescent emission. Design: Different microarrays are designed differently: cDNA: Combine conditions in paired experiments. Oligonucleotide: Independent measures. Experiments: Require different design per platform: cDNA: One array for an experimental unit. Oligonucleotide: 2 arrays for a experimental unit. HST 512 Statistical Challenges Small N large P: Many variables, few cases. Noisy results: Measurements are vary variable. Brittle conditions: Sensitive to small changes in factors. Design: Platforms are designed without considering the analysis to be done. HST 512 Supervised vs Unsupervised Elements: Features (genes) and a training signal (class). Question: Which function best maps features to class? Goal: Find a good predictive system of class (e.g. build a system able to take a patient and return a diagnosis). Assumption: Different features are best predictor. Task: Estimation (except for feature selection, the task of finding the best predictors). Elements: Features (genes) but no training signal. Question: Which features behave in a related (similar) way across experiments? Goal: Understand interaction (e.g. how genes behave similarly under certain experimental conditions). Assumption: Same behaviors mean same functional class. Task: Model selection. HST 512 Healthy Cell Comparative Experiments Tumor Cell Sample 1 Sample 2 Sample 3 Sample 4 Samples k=1,...,ni Gene.Description S1 S2 S3 S4 S5 AFFX-BioC-5_at (endogenous control) 309 88 283 12 hum_alu_at (miscellaneous control) 16692 15091 11038 15763 AFFX-DapX-M_at 311 (endogenous control) 378 134 268 AFFX-LysX-5_at (endogenous 21 21 control) 67 43 AFFX-HUMISGF3A/M97935_MB_at (endogenous control) 215 116 476 155 AFFX-HUMISGF3A/M97935_3_at (endogenous control) 797 433 1474 415 AFFX-HUMRGE/M10098_5_at (endogenous control) 14538 615 5669 4850 AFFX-HUMRGE/M10098_M_at (endogenous control) 9738 115 3272 2293 AFFX-HUMRGE/M10098_3_at (endogenous control) 8529 1518 3668 2569 AFFX-HUMGAPDH/M33197_5_at (endogenous control) 15076 19448 27410 14920 AFFX-HUMGAPDH/M33197_M_at (endogenous 11439 11126 13568 16756 control) AFFX-HUMGAPDH/M33197_3_at (endogenous control) 17782 18112 23006 17633 AFFX-HSAC07/X00351_5_at (endogenous control) 16287 17926 22626 15770 168 18128 118 8 122 483 1284 2731 316 14653 15030 17384 16386 genes g=1,...,G y gik Identify genes that are differentially expressed in two conditions i=A,B. HST 512 Comparative Experiments Case Control: Asses how many times a gene is more (less) intense in one condition than in another. Elements: Condition = training signal; genes = features. Measure of differential expression: fold = y gA y gB difference = y gA - y gB sg Threshold: decide a threshold, to select genes that are "significantly" differentially expressed. Rationale: A particular experimental condition creates differences in expression for some genes. Distribution Free Tests Permutation tests to identify gene specific threshold: SAM (Stanford) uses a statistic similar to the classical tstatistic. The parameter a is chosen to minimize the coefficient of variation. GeneCluster (Whitehead) uses signal-to-noise ratio statistic. Problem: p-values in multiple comparisons corrections make impossible to identify any change. tg = a+ ygA - y gB S gA 2 nA + S gB nB 2 s2ng = y gA - y gB S gA S + gB nA nB Supervised Classification Goal: A predictive (diagnostic) model associating features to class. Rationale: Difference is an indicator of predictive power. Components: Dataset of features and a training signal. Features: Gene expression levels in different classes. Training signal: The class label. Feature selection: Find the best predictors to maximize accuracy. C G1 G2 G3 G4 G5 G6 Feature Selection Task: Identify those genes that best predict the class. Advantage I: Typically increases predictive accuracy. Advantage II: More compact representation. Advantage III: Provide insights into the process. Type of Task: Model selection. Differential analysis: A special case (binary) of feature (the most discriminating genes) selection. Rationale: Since we cannot try all combinations, most different features should be the best at discriminating. HST 512 Parametric Methods A simple approach to prediction is to assume that the features (genes) are conditionally independent given the class. These models are called Nave Bayes Classifiers. Estimate, for each gene, the probability density of the gene given each class: p(g|c). The challenge is to identify the right distribution. C G1 G2 G3 G4 G5 G6 HST 512 Prediction Once a mapping function (or a model + function for feature selection) has been identified, we can use this function to classify new cases. Non parametric methods do not provide explicit functions to map features to class. Mixture of Experts is a weighted voting algorithm to make prediction from non parametric models. Intuitively, in a weighted voting algorithm: Each gene casts a vote for one of the possible classes and. This vote is weighted by a score assessing the reliability of the expert (in this case, the gene). The class receiving the highest will be the predicted class. HST 512 Parametric Prediction Analysis: Suppose the analysis leads to select a group of genes which are differentially expressed across the two conditions. Prediction: we may want to classify new samples on the basis of their expression profile z (molecular diagnosis): p (class = i | sample molecular profile) = p(class = i | z ) Bayes rule: choose the maximum probability classification. p (class = i | z ) f ( z | class = i ) p (class = i ) f ( z | class = i ) = j { f ( z j | i, M gj ) p( M gj ) + f ( z j | i , M lj ) p( M lj )} Assumptions: gene independent given class and parameters. HST 512 Predictive Validation Prediction: To assess the validity of a classification system (either a function or a model + function), we can use an independent labeled data set and predict the class of each case with the generated system. Or split a sample in two sets: Training set: a data set used to build the model/function; Test set: a labeled data set to predict with the model/function. Cross Validation: When an independent test set is not available, we use can cross validation: 1. Split the sample in k subsets; 2. Predict one subset using the other k-1 subsets to build the model/function; 3. Repeat the operation predicting the other sets. Leave one out: for small samples, use single cases as k sets. HST 512 An Example Example: Acute lymphoblastic leukemia (27) vs acute myeloid leukemia (11). Method: Correlate gene profiles to an "extreme" dummy vector of 0s and 1s. Results: 50 genes on each side. Please see Figure 3b of Science. 1999 Oct 15; 286 (5439):531-7. Molecular classification of cancer: class discovery and class prediction by gene expression monitoring. Golub TR, Slonim DK, Tamayo P, Huard C, Gaasenbeek M, Mesirov JP, Coller H, Loh ML, Downing JR, Calligiuri MA, Bloomfield CD, Lander ES. HST 512 Normalization An attempt to solve the problem of small sample size is to use "normalization" a technique to reduce the variance. Normalization is an accepted procedure to balance the two channels of a cDNA microarray. When oligo microarrays were introduced, some tried to apply some form of variance reduction under the name of normalization to this new platform that has NO paired experiments. There are hundreds of different "normalization" methods. Please see Figure 1 of Nat Rev Genet. 2001 Jun; 2(6):418-27. Computational analysis of microarray data. Quackenbush J. HST 512 Normalization? HST 512 Unsupervised Methods Differential experiments usually end up with: A list of genes changed across the two conditions; A "stochastic profile" of each condition. Useful to identify diagnostic profiles and prognostic models. They are not designed to tell us something about regulatory mechanisms, structures of cellular control. With supervised methods, we look only at relations between gene expression and experimental condition. Unsupervised methods answer different experimental questions. We use unsupervised methods when we are interested in finding the relationships between genes rather than the relationship between genes and a training signal (eg a disease). HST 512 One Dimensional Clustering Strategy: Compute a table of pair-wise distances (eg, correlation, Euclidean distance, information measures) between genes. Clustering: Use permutation tests to assess the cut point. Relevance networks: Create a network of correlated genes and remove the links below the chosen threshold. Gene 1 Gene 20.5 Gene 3 0.6 Gene 4 Gene 5 Gene 60.3 Gene 7 1 -0.2 -0.5 1 1 0.2 0.8 -0.3 0.5 0.7 0.1 2 1 0.5 0.6 -0.2 -0.5 0.3 3 1 0.2 0.1 -0.2 0.1 4 1 0.9 0.4 0.3 5 1 0.1 -0.4 6 1 0.1 7 1 Gene Gene Gene Gene Gene Gene Gene Please see Figure 2 of Proc Nati Acad Sci U S A. 2000 Oct 24;97(22):12182-6. Discovering functional relationships between RNA expression and chemotherapeutic susceptibility using relevance networks. Butte AJ, Tamayo P, Slonim D, Golub TR, Kohane IS. HST 512 Hierarchical Clustering Components: Expression profiles, no training signal. Method: Sort the expression profiles in a tree a using a pair-wise similarity measure (say, correlation) between all the profiles. Model: Build a single tree merging all sequences. Use the mean of each set of merged sequences as representation of the joint to traverse the tree and proceed until all series are merged. Abstraction: When two genes are merged, we need to create an abstract representation of their merging (average profile). Recursion: The distance step is repeated at each merging until a single tree is created. Clustering: Pick a threshold to break down the single tree into a set of clusters. Eisen et al., PNAS (1998) HST 512 Dendrogram Please refer to Curr Opin Mol Ther. 1999 Jun;1(3):344-58. Modified oligonucleotides-synthesis, properties and applications. Lyer RP, Roland A, Zhou W, Ghosh K. HST 512 Two Dimensional Clustering We want to discover an unknown set of patient classes based on an unknown set of gene functional classes. A two-dimensional optimization problem trying to simultaneously optimize distribution of genes and samples. Survival time (KL curves) were used as independent validation of patient clusters. Please see Figures 1 and 5 of Nature. 2000 Feb 3;403(6769):503-11. Distinct types of diffuse large B-cell lymphoma identified by gene expression profiling. Alizadeh AA, et al. HST 512 Bayesian Clustering Problem: How do we decide that N genes are sufficiently similar become a cluster on their own? Similarity: Profiles are "similar" when they are generated by the same stochastic process. Example: EKGs are similar but not identical series generated by the a set of physiological process. Clusters: Cluster profiles on the basis of their similarity is to group profiles generated by the same process. Bayesian solution: The most probable set of generating processes responsible for the observed profiles. Strategy: Compute posterior probability p(M|D) of each clustering model given the data and take the highest. Ramoni et al., PNAS (2002) HST 512 Posterior Probability We want the most probable model given the data: p ( M i , ) p ( | M i ) p ( M i ) = p( M i | ) = p ( ) p ( ) But we use the same data for all models: p(Mi|) p( |Mi)p(Mi). We assume all models are a priori equally likely: p(Mi|) p( |Mi). This is the marginal likelihood, which gives the most probable model generating . HST 512 Temporal Clustering A process developing along time (eg yeast cell cycle). Take microarray measurements along this process (2h for 24h). Cannot use standard similarity measures (eg correlation) because observations are not independent. Need a model able to take into account this dependence of observations Our perception of what is similar may be completely different under these new conditions. 1.4 1.2 1 0.8 0.6 0.4 0.2 0 1 2 3 4 5 6 7 8 9 1 0 1 1 1 2 1 3 2.5 2 1.5 1 0.5 0 1 2 3 4 5 6 7 8 9 10 11 12 13 HST 512 Autoregressive Models Take a time series, of dependent observations: x 0 x1 x 2 x 3 K Under the assumption is that t0 is independent of the remote past given the recent past: P(x t | x t - p ,..., x t -1 ) P(x t | x 0 , x 1 , K , x t -1 ) The length of the recent past is the Markov Order p. 6 5 Past (Regressor) 4 3 2 1 0 0 0.5 1 1.5 2 2.5 3 3.5 4 4.5 5 Present (Reponse ) HST 512 Networks Clustering rests on the assumption that genes behaving in similar ways belong to the same process. The result of a clustering model is to break down the set of all genes into boxes containing genes belonging to the same process. However, clustering tells us nothing about the internal mechanisms of this control structures: it provides boxes, not chains of command. To discover chains of command, we need to resort to a new approach: Bayesian networks. HST 512 Bayesian Networks Bayesian networks (also called Causal probabilistic networks) were originally developed to encode human experts' knowledge, to they are easily understandable by humans. Their two main features are: The ability to represent causal knowledge to perform diagnosis, prediction, etc. They are grounded in statistics and graph theory. Late '80s, people realize that the statistical foundations of Bayesian networks makes it possible to learn them from data rather than from experts. HST 512 Components Qualitative: A dependency graph made by: Node: a variable X, with a set of states {x1,...,xn}. Arc: a dependency of a variable X on its parents . Quantitative: The distributions of a variable X given each combination of states i of its parents . A p(A) A p(A) Y Y O O 0.3 0.3 0.7 0.7 A I E A E II p(I|A,E) p(I|A,E) A E Y Y Y Y Y Y Y Y O O O O O O O O L L L L H H H H L L L L H H H H L L H H L L H H L L H H L L H H 0.9 0.9 0.1 0.1 0.5 0.5 0.5 0.5 0.7 0.7 0.3 0.3 0.2 0.2 0.8 0.8 E p(E) E p(E) L L H H 0.8 0.8 0.2 0.2 A=Age; E=Education; I=Income HST 512 Learn the Structure In principle, the process of learning a Bayesian network structure involves: Search strategy to explore the possible structures; Scoring metric to select a structure. In practice, it also requires some smart heuristic to avoid the combinatorial explosion of all models: Decomposability of the graph; Finite horizon heuristic search strategies; Methods to limit the risk of ending in local maxima. HST 512 An Application Cases: 41 patients affect by leukemia. Genomic: expression measures on 72 genes; Clinical: 38 clinical phenotypes (3 used). Representational Risks: Deterministic links: hide other links more interesting. Overfitting: Too many states for the available data. Transformations: Definitional dependencies: if suspected, removed. Sparse phenotypes: consolidated (oncogene status). HST 512 The Network HST 512 Dependency Strength Bayes factor: ratio between the probability of 2 models. Threshold: To add a link, we need to gain at least 3 BF. HST 512 Validation Cross-validation: A form of predictive validation. 1. For each case, remove it from the database; 2. Use these data to learn the probability distributions of the network; 3. Use the quantified network to predict value on a variable of the removed case. Validation parameters: Correctness: Number of cases correctly predicted; Coverage: Number of cases actually predicted; Average Distance: How uncertain is a prediction. HST 512 Take Home Messages Machine learning methods are now an integral part of the new, genome-wide, biology. Genome-wide biology presents some new challenges to machine learning, such as the sample size of the experiments. Supervised and unsupervised methods answer different questions: Supervised methods try to map a set of gene profiles to a predefined class. Unsupervised methods try to dissect interactions of genes. Distance-based clustering rests on the assumption that genes with similar behavior also belong to the same process/function. There are methods to identify dependency structures from data. HST 512 Reading/Software List Reviews: P Sebastiani et al. Statistical Challenges in Functional Genomics. Statistical Science, 2003. http://genomethods.org/papers/statscience02.pdf. IS Kohane et al. Microarrays for an Integrative Genomics. MIT Press, Cambridge, MA, 2002. Software: GeneCluster: http://www-genome.wi.mit.edu/cancer. SAM: http://www-stat.stanford.edu/~tibs/SAM. CAGED: http://genomethods.org/caged. Assignment: Supervised: Using GeneCluster or SAM; Unsupervised: Using GeneCluster or CAGED. HST 512
Find millions of documents on Course Hero - Study Guides, Lecture Notes, Reference Materials, Practice Exams and more. Course Hero has millions of course specific materials providing students with the best way to expand their education.

Below is a small sample set of documents:

MIT - HST - 512
Harvard-MIT Division of Health Sciences and Technology HST.512: Genomic Medicine Prof. Atul Butte Please see Proc Natl Acad Sci U S A. 2003 Jul 8;(100)14:8466-71. Epub 2003. Jun 27 Coordinated reduction of genes of oxidative metabolism in humans with
MIT - HST - 512
Mar 18, 2004Harvard-MIT Division of Health Sciences and Technology HST.512: Genomic Medicine Prof. Alvin T.KhoGenomic Medicine HT 512Data representation, transformation &amp; modeling in genomicsLecture 11, Mar 18, 2004Alvin T. Kho Childr
MIT - HST - 512
Harvard-MIT Division of Health Sciences and Technology HST.512: Genomic Medicine Prof. Isaac Samuel KohaneGenomic MedicineLecture 1 Block 1 Isaac S. KohaneOverview The future is now Genomic vs genetic Heredity Resequencing of the diag
MIT - HST - 512
Harvard-MIT Division of Health Sciences and Technology HST.512: Genomic Medicine Prof. Zoltan SzallasiLimitations of massively parallel technologiesZoltan Szallasi, MDChildren's Hospital Informatics Program www.chip.orgNew technologyAl
MIT - HST - 512
Harvard-MIT Division of Health Sciences and Technology HST.512: Genomic Medicine Prof. Alberto A. RivaInformational Resources(Finding your way through the Human Genome)Alberto Riva, PhD Children's Hospital Informatics Program Harvard Medical Sch
Wisconsin - ECE - 332
ECE 332 Homework #21) Draw the Nyquist and Bode plots for each of the following rational functions. 1 a) s3 +3s2 +2s s+1 b) s4 +5s3 +6s2 c) s2 +1 s -s d) s3 + 3s2 + 2s 2) Determine whether each of the following is BIBO stable. a) ss+1 2 -1 b) ss-1
Wisconsin - ECE - 332
Wisconsin - ECE - 332
ECE 332 Homework #21) Draw the Nyquist and Bode plots for each of the following rational functions. 1 a) s3 +3s2 +2s s+1 b) s4 +5s3 +6s2 c) s2 +1 s -s d) s3 + 3s2 + 2s 2) Determine whether each of the following is BIBO stable. a) ss+1 2 -1 b) ss-1
Wisconsin - ECE - 332
ECE 332 Homework #31) Design a second-order transfer function Hd (s) to meet all of the following specifications. Choose n as small as possible. a) ess0 = 0 b) Mr 1.3 c) Mp 1.3 d) ess1 .8 s e) b 1.5 rad/s f) r .7 rad/s g) Tr 2.3 s h) Tp 3.5
Wisconsin - ECE - 317
Abstract In this lab, the characteristic and function of two sound sensor, electret microphone element and a speaker, will be introduced. First, student will be asked to measure the output the voltage of the circuit corresponding to the several diffe
Texas A&M - CPSC - 110
ORDINAL TYPESA Type whose values are specified by a list is called an Ordinal Type.Integer Char Boolean Given a value( e.g. `D' , 10 , False) in an ordinal type ,we can specify the one unique value which proceeds or follows the value.Real and
Tufts - EE - 12
Tufts - EE - 12
Tufts - EE - 12
Tufts - EE - 12
Tufts - EE - 12
Tufts - EE - 12
Tufts - EE - 12
MOSFET PRIMERSameer Sonkusale http:/nanolab.ece.tufts.eduMOSFETMetal Oxide Semiconductor Field Effect TransistorGate electrode is used to control the electric field in the channel region which in turn controls the flow of charges between sourc
Tufts - EE - 12
Tufts - EE - 12
Tufts - EE - 12
Tufts - EE - 12
Tufts - EE - 12
Tufts - EE - 12
Tufts - EE - 12
Tufts - EE - 12
Texas A&M - CPSC - 110
WELCOME TO CPSC 110STRUCTURED PROGRAMMING INPASCAL1LECTURE INFORMATIONhttp:/people.cs.tamu.edu/yjoo9317/cpsc206/2INTRODUCTION TO COMPUTER SCIENCECONCEPTS AND PROGRAMMING3Outline Part I: An overview of Computer Science. Part II: Compu
Wisconsin - EE - ECE 332
Discussion Notes - ECE 332 - 12/11/06 Algebraic Pole Placement DesignLet's say we have a plant G(s) in a unity feedback system, where we design the compensator Gc (s) to achieve some desired CLTF H(s). The most obvious way to accomplish this is to s
Texas A&M - CPSC - 110
CPSC 110 PASCAL PROGRAMMING Developed at Dartmouth (1970) by Wirth Designed as a language that can be utilized to develop programs in a structured manner. A high-level general purpose language1General Format of a Pascal ProgramProgram Heading
Texas A&M - CPSC - 110
Predefined FunctionsName Type of Argument Type of Result Exampleabs integer real real real integer real real or integer integer real integer integer integer real real abs (-2) abs (-2.4) round (2.6) trunc (2.6) sqr (2) sqr (1.100) sqrt (4)Value o
Texas A&M - CPSC - 110
Chapter 5 Modularity, Functions, and Data FlowLocal Variables: The SCOPE of a valuable is determined by where the variable is created. A Local variable is one that is declared within a procedure. It is known and can be referenced ONLY within that pr
Texas A&M - CPSC - 110
Multi way BranchingIf-Then Handles A 2-choice problem If Age &gt; 65 Then else Code-1 Code - 2 ;we either execute (1) Code-1 or (2) Code - 2101Problem: Assign the student the correct letter grade based on the following: 90 - 100 A 80 - 89 B 70 - 7
Texas A&M - CPSC - 110
Chapter 7Design And Implementation Of LoopsRepeat until : Repeat Body of Loop until Boolean Expression 1. Repeat Body Until Expression is True 2. No Compound statement used. 3. Always at least 1 pass through the loop.116Loop CategoriesConditi
Texas A&M - CPSC - 110
Chapter 1 Notes Computers- machines that perform very simple tasks according to specific instructions Program- a set of instructions for a computer to follow Software- a collection of programs Hardware- the physical machines that make up a computer C
Texas A&M - CPSC - 110
{ -Program Description: This program will use procedures to evaluate gross and gross pay of the worker by inputing the number of hours worked and calculating withholdings. pg.104 --} program WorkersPay; const payrate= 9.63; sstax= 0.06; fitax= 0.14;
Texas A&M - CPSC - 110
{ -Program Description: This program will allow the user to compute their electric bill. pg.351 #22. -} program Grades; var Scores: array[1.50] of integer; Students: array[1.50] of integer;{-PromptForInput: This procedure prompts the user to enter
Texas A&M - CPSC - 110
program Mechanics; vars hrs, quaterhrs, mechanic1charge, mechanic2charge : real;Procedure GetData(var hrs:real); begin writeln('Please enter the number of hours you expect the job to take, then press return:'); readln(hrs); end; Procedure CalcQuart
Texas A&M - CPSC - 110
program Sizes; vars height, weight, age, hatsize, sweatersize, pantsize : real;Procedure GetData(var height, weight, age: real); begin writeln('Please enter your height in inches, then press enter:'); readln(height); writeln('Please enter your weig
Texas A&M - CPSC - 110
program WorkersPay; const payrate= 9.63 sstax= .06 fitax= .14 sitax= .05 uniondues= 6 dependdues= 10 overtimerate= 1.5 vars hrs, grosspay, netpay, dependents, withholdings, socialdeduc, federaldeduc, statededuc, uniondeduc, dependdeduc := real;Proc
Wisconsin - EE - ECE 332
10-28 Bode plot for Gp(s)Bode Diagram 50 System: sys Frequency (rad/sec): 985 Magnitude (dB): -28.6Magnitude (dB) Phase (deg)0-50-100-150 -90-180 System: sys Frequency (rad/sec): 999 Phase (deg): -180-270-360 10110210 Frequenc
Texas A&M - CPSC - 110
{ -Program Description: This program will use procedures to evaluate gross and gross pay of the worker by inputing the number of hours worked and calculating withholdings. pg.104 --} program WorkersPay; const payrate= 9.63; sstax= 0.06; fitax= 0.14;
Texas A&M - CPSC - 110
{ -Program Description: This program will use procedures to compare the prices of two different mechanics. It will accept the number of hours it will take to complete the job and then calculate the price of the services. pg.142 -} program Mechanics(i
Texas A&M - CPSC - 110
{ -Program Description: This program will use procedures to evaluate the hat, sweater, and pant sizes using the user's input of their weight, height, and age. pg.142 --} program Sizes; var height, weight, age, hatsize, sweatersize, pantsize : real; {
Texas A&M - CPSC - 110
{ -Program Description: This program will use procedures to evaluate the area of a triangle. pg.104 -} program TriangleArea(input,output); var a, b, c, s, area : real; {one side of the triangle} {one side of the triangle} {one side of the triangle} {
Wisconsin - MICROBIO - 101
Wisconsin - EE - ECE 332
beforeAfter
Catawba Valley Community College - HUM - Spa-181
Lee L. Skinner2/28/08Northern Mexico FactsDonde Esta Norte Mxico? Mxico esta al norte Guatemala y El Salvador. Mexico es un pais de America Central. La capital de Mxico es Ciudad de Mxico Distrito Federal. Los colores de Mxico es verde y blanco
Texas A&M - STAT - 211
STATISTICS 211 HONORS 2007 PROF EMANUEL PARZEN KEY CONCEPTS ONE SAMPLE STATISTICAL INFERENCE 10/31 0.Population Parameters \mu, p Estimators from sample \mu\hat, \p\hat Denote standard error by S.E.; derive formulas from SONG OF SUMS for mean, varian
Texas A&M - STAT - 211
STAT 211 Prof Parzen CHAPTER 2 PROBABILITY, CONDITIONAL PROBABILITY, BAYES Probability theory enables us to measure uncertainity, chance, likelihood. Probability theory has applications to explain and predict observations in every aspect of life: sci
Texas A&M - STAT - 211
Statistics 211 Prof. Emanuel Parzen Chapter 5 Sampling Distributions, Central Limit Theorem, Normal Approximation to the Binomial This chapter will complete our set of tools of probability theory that we need to conduct statistical inference. defined
Texas A&M - STAT - 211
1 Stat 211 Prof Parzen CHAPTER 1 STATISTICAL DATA ANALYSIS Statistical methods seek to learn patterns from a data set by computing, comparing, and interpreting statistical summaries, including mean, median, quartiles, midquartile, inter-quartile rang
Texas A&M - STAT - 211
Stat 211 Prof Parzen CHAPTER 3 Binomial Probability, Random Variables, ExpectationA Binomial Probability problem considers independent trials whose outcome are 0 or 1 (also called failure or success) according as a specified event A does not or doe
Texas A&M - STAT - 211
Statistics 211 Prof. Emanuel Parzen Chapter 6 STATISTICAL INFERENCE, HYPOTHESIS TESTS, CONFIDENCE INTERVALS Statistical inference is the science of learning from data. Its strategy (long range plan) is to determine probability models which fit the ob
Wisconsin - EE - ECE 332
I and B part2I and C part2I and A Part4I and D part 4A and D part 6A (grounded) and C part 7D (grounded) and CPart 9 commonPart 10 P (grounded) and CPart 10 Q (grounded) and C
Texas A&M - STAT - 211
STATISTICS 211 HONORS Chapter 6A STATISTICAL INFERENCE CONFIDENCE INTERVALS HYPOTHESIS TESTSPROF EMANUEL PARZENSTATISTICAL INFERENCE seeks to learn from data values of parameters of the probability distribution obeyed by the random variable of wh
Texas A&M - STAT - 211
STATISTICS 211 PROF EMANUEL PARZEN Chapter 7 ONE SAMPLE, TWO SAMPLE STATISTICAL METHODS STATISTICAL INFERENCE PARAMETERS , pOur Data Modeling Strategy has VALIDATION action, phase, problem 3 whose goal is to find parameters of probability models t
Texas A&M - STAT - 211
STATISTICS 211 Prof EMANUEL PARZEN Chapter 7A OUTLINE TWO SAMPLE INFERENCE CASE \mu: Two samples of continuous variable Y Scientific nature of random variable Y being observed Distribution of variable Y: (1) Assume NORMAL or (2) assume finite populat
Texas A&M - STAT - 211
STATISTICS 211 PROF EMANUEL PARZEN CHAPTER 8 ANALYSIS OF VARIANCE, MULTIPLE SAMPLES Statistical methods for learning from multiple (more than 2) samples is called Analysis of Variance; they were pioneered by Sir Ronald Fisher in the 1920/s. We observ
Texas A&M - STAT - 211
STATISTICS 211 CHAPTER 8A REGRSSION SUMMARY This chapter is a summary of the formulas derive in the next chapter on Simple Linear RegressionREGRESSION FORMULAS SUMMARY Response variable Y continuous quantitative ; Y Random variable Explanatory vari
Texas A&M - STAT - 211
STATISTICS 211 PROF EMANUEL PARZEN CHAPTER 9 BIVARIATE DATA ANALYSIS, CORRELATION, REGRESSION LINE A very important application of statistical methods is study of relations between two continuous variables X and Y . given observed data ( X j , Y j )
Texas A&M - STAT - 211
Chapter 4 Stat 211 Prof Parzen STANDARD DISTRIBUTIONS FOR APPLIED STATISTICS In statistical practice there are a small number of distinguished distributions which researchers use as models for observed data. The continuous distributions that are fund