From zero to Matlab in six weeks
|
|
- Edward Matthews
- 6 years ago
- Views:
Transcription
1 From zero to Matlab n sx weeks Frederk J Smons Adam C. Maloof Prnceton Unversty
2 Explan the bascs I 1. help 2. lookfor 3. type 4. who, whos, whch 7. dary
3 Explan the bascs II 7. plot 8. xlabel, ylabel, ttle 11. hold on, hold off 13. sprntf 14. prnt 15. load, mread
4 Make a cheat sheet Name Functon Example mread Reads an mage fle x=mread('flename'); fullfle Constructs a vald path name ff=fullfle('drn','fname'); sze Queres the sze of a varable s=sze(x); plot Plots (x, y) values on a graph x=[1 2 3]; y=[ ]; plot(x,y,'o') xlabel Uses a quoted strng for an x-axs label xlabel('elevaton [m]') ylabel Uses a quoted strng for a y-axs label xlabel('roughness') hold on Keeps current axes for next tme you plot anythng x=[1 2 p]; y=[ ]; plot(x,y,'bo'); hold on; plot(10*x,3*y,'rs') lnspace Makes an array of N evenly spaced values x=lnspace(-3,3,100) between a and b reshape Changes the dmensons of an array x x=lnspace(-3,3,100); to a rows and b columns xr=reshape(x,20,5) hst Makes a hstogram (and plots t) x=lnspace(-3,3,10); hst(x) bar axs xy axs j
5 Explan the bascs III Addressng: rows, columns, dmensons, range 17. sze 18. transpose 19. colon 20. lnspace 21. <, >, ==,, &, Logc: logcal, character, strng, double
6 Practce on the command lne % Specfy the path - drectory strng to where the 'fname' s dro='/u/fjsmons/classes/frs-span/matlabdemos/matlab-lec01/'; fname='h1w-18_35-test2-small.jpg'; % Read n the mage usng a canned Matlab functon rgb=mread(fullfle(dro,fname)); % Convert to grey scale red=rgb(:,:,1); green=rgb(:,:,2); blue =rgb(:,:,3); % These values are unsgned 8-bt nteger (from 0-255) so % they requre specal attenton to convert to grey scales grae=unt8(round([double(red)+double(green)+double(blue)]/3)); % Make a pcture plot(grae(rand(sze(grae,1),1),:)); axs tght
7 count Wrte the frst scrpt 2 # # # red value green value blue value dro='/u/fjsmons/classes/frs-span/matlabdemos/matlab-lec01/'; fname='h1w-18_35-test2-small.jpg'; rgb=mread(fullfle(dro,fname)); red=rgb(:,:,1); green=rgb(:,:,2); blue =rgb(:,:,3); % Make hstograms of the colors and annotate ah(1)=subplot(231); h(1)=hstogram(red,0:10:ntmax('unt8')); xlabel('red value') ah(2)=subplot(232); h(2)=hstogram(green,0:10:ntmax('unt8')); xlabel('green value') ah(3)=subplot(233); h(3)=hstogram(blue,0:10:ntmax('unt8')); xlabel('blue value') % Annotate; set the x-axes to reason and y-axes to the same lmts ah(1).ylabel.strng='count'; h(1).facecolor='red'; h(2).facecolor='green'; h(3).facecolor='blue'; set(ah(:),'xlm',[0 ntmax('unt8')],'ylm',[0 1.1*max([h(:).Values])]) % Prnt the pcture for ncluson n a report prnt -dpdf madson02
8 Wrte the frst functon functon madson03(dro,fname,szo) 100 % MADISON03(dro,fname,szo) 150 % dro drectory200strng % fname mage flename strng 250 % szo sze dvsor rgb=mread(fullfle(dro,fname)); red=rgb(:,:,1); green=rgb(:,:,2); blue =rgb(:,:,3); grae=unt8(round([double(red)+double(green)+double(blue)]/3)); % Plot the szoth part of the mage n color subplot(411); mage(rgb(1:round(sze(rgb,1)/szo),:,:)) % And plot the same szoth fracton n gray scale subplot(412); mage(repmat(grae(1:round(sze(grae,1)/szo),:),[1 1 3])) % Prnt to a fle wth a flename that you learn from the functon name prnt('-dpdf',mflename)
9 Code hygene 1. If you type t twce, you need to use a varable 2. If you say t n the absolute, you need to reformulate to the relatve 3. Annotate all graphs completely, and gve them meanngful names 4. Annotate all code completely, to a rdculous degree Documentaton/Help/Date Input/Output Computaton/Algorthm Fgures/Embellshment Varable Output
10 Fve ways to do spectral analyss on tme seres Inspecton Play wth the plot, the axes, the grd lnes, the annotatons, etc. Correlaton Guess a perod, generate a synthetc, calculate how well they agree Inverson Guess a perod and conduct a formal regresson, calculate how well t fts Stackng Guess a stackng length and see how well the result fts a meanngful oscllaton Fourer analyss Do as the adults do! Inspect, nterpret, and understand the results
11 temp ( C) temp ( C) Shfts and Cycles I Inspecton /27 10/04 10/11 10/18 10/25 11/01 11/08 11/15 dates hours functon madson04 % Read the data and dentfy the varables w=webread(' tme=w.var1; temp=w.var5; % Convert and plot n a human-ntellgble format dates=tme/24/60/60+datenum(1970,1,1,0,0,0); subplot(311) plot(dates,temp); axs tght; grd on datetck('x',6); xlabel('dates'); ylabel(sprntf('temp (%sc)','\crc')) % Convert and plot n hours snce the frst sample whch s last hours=[dates-datenum(dates(end))]*24; subplot(312); plot(hours,temp) set(gca,'xtck',0:3*24:hours(1)); axs tght; grd on xlabel('hours'); ylabel(sprntf('temp (%sc)','\crc'))
12 temp ( C) Shfts and Cycles II Correlaton P of 24 h wth phase h has rmse 4.1 deg, corr hours functon madson05(p,ph) % MADISON05(P,ph) % P Tral perod (h) % ph Tral phase (h) % Read the data, dentfy the varables and plot exactly as t was done by MADISON04 w=webread(' tme=w.var1; temp=w.var5; dates=tme/24/60/60+datenum(1970,1,1,0,0,0); hours=[dates-datenum(dates(end))]*24; subplot(311); plot(hours,temp); set(gca,'xtck',0:3*24:hours(1)); axs tght; grd on xlabel('hours'); ylabel(sprntf('temp (%sc)','\crc')) % Make a 24-hour snusod to overlay on the data, calculate RESIDUAL and ROOT-MEAN-SQUARED ERROR A=std(temp); m=mean(temp); tpred=m+a*sn(2*p*[hours-ph]/p); resd=temp-tpred; rmser=sqrt(sum(resd.ˆ2)/length(resd)); hold on; p=plot(hours,tpred,'k'); hold off % Compute the CORRELATION COEFFICIENT between the synthetc and the data and fnsh the plot [r,pval]=corrcoef(temp,tpred); ttle(sprntf('p of %g h wth phase %g h has rmse %3.1f deg, corr %5.2f',P,ph,rmser,r(2)))
13 temp ( C) Shfts and Cycles III Inverson P of h has rmse 3.9 deg, varance redux 36%, corr hours functon madson06(p) % MADISON06(P) % P A vector of tral perods (h) % Read the data, dentfy the varables as n MADISON04 w=webread(' tme=w.var1; temp=w.var5; dates=tme/24/60/60+datenum(1970,1,1,0,0,0); hours=[dates-datenum(dates(end))]*24; subplot(311); plot(hours,temp); set(gca,'xtck',0:3*24:hours(1)); axs tght; grd on; xlabel('hours'); ylabel(sprntf('temp (%sc)','\crc')) % Do the INVERSION, PREDICTION, RESIDUAL, ROOT-MEAN-SQUARED ERROR, VARIANCE REDUCTION, CORRELATION argm=[1./p(:)*hours(:)']'; F=[ones(sze(temp)) cos(2*p*argm) sn(2*p*argm)]; A=pnv(F)*temp; tpred=f*a; resd=temp-tpred; [r,pval]=corrcoef(temp,tpred) rmser=sqrt(sum(resd.ˆ2)/length(resd)); vard=100*[1-var(resd)/var(temp)]; % Now fnsh the plot by plottng the predcton rght on top of the data hold on; p=plot(hours,tpred,'k'); hold off; ttle(sprntf(sprntf(... 'P of %s h has rmse %s, varance redux %s, corr %s',repmat('%g ',sze(p)),... '%3.1f deg','%g%%','%3.1f'),p,rmser,round(vard),r(2)))
14 temp ( C) Shfts and Cycles IV Stackng stackng over P of 24 h hours functon madson07(p) %%%%%%%%%%%%%%%%%%% Data loadng etc %%%%%%%%%%%%%%%%%%% % Remove duplcates snce we wll be nterpolatng later [hours,sort]=unque(hours); temp=temp(sort); % About how often dd we sample and how many blocks of length P can we dentfy? Interpolate snth=1/round(1/abs(medan(dff(hours)))); mblock=floor(max(hours)/p)*p; hours=[snth:snth:mblock]'; temp=nterp1(hours,temp,hours,'lnear'); % Now we are ready to 'stack', all of these are segments of exactly P n length hoursd=reshape(hours,p/snth,[]); tempd=reshape(temp,p/snth,[]); % Wth a lttle luckk these are ALL the same modulo P! f all(all(dff(mod(hoursd,p),[],2)<1000*eps)); hoursu=hoursd(:,1); end % Now comes the 'medan stack' and some dea of the varablty tempu=nanmedan(tempd,2); tempup=prctle(tempd,95,2); tempdn=prctle(tempd,05,2); %%%%%%%%%%%%%%%%%%% Plottng etc %%%%%%%%%%%%%%%%%%%%%%%%
15 varance # hour Shfts and Cycles V Fourer analyss h 12 h frequency (h -1 ) functon madson08 % Read the data, dentfy the varables as n MADISON04 w=webread(' tme=w.var1; temp=w.var5; dates=tme/24/60/60+datenum(1970,1,1,0,0,0); hours=[dates-datenum(dates(end))]*24; subplot(311); % Make a frequency axs ahead of tme nfft=length(hours); physl=hours(1); selekt=1:floor(nfft/2)+1; fax=(selekt-1)'/physl*(length(temp)-1)/nfft; % Compute a nave spectral estmate, the perodogram, and plot t S=abs(fft(hannng(length(temp)).*[temp-mean(temp)],nfft)).ˆ2; loglog(fax,s(selekt),'lnew',2); grd on xlabel('frequency (hˆ{-1})'); ylabel(sprntf('varance %s hour','\tmes')) % Annotate P=[24 12]; hold on ; plot(1./[p(:) P(:)]',repmat(ylm,length(P),1)','k'); hold off text(1/p(1),1e11,sprntf('% h',p(1))); text(1/p(2),1e11,sprntf('% h',p(2))) xlm([1e-2 10]); ylm([1e2 1e10])
16 Conclusons ˆ All Earth scentsts comng of age n ths century wll wrte computer code ˆ Computatonal analyss need not be scary f you take t slow! ˆ Learnng to mx pant won t turn us nto Rembrandts, but pantng mght! ˆ Masterng the Java whle-loop hasn t taught anyone the scentfc method ˆ Students wll want to program the computer when they have data of ther own ˆ Home-grown data can come from smartphones, local weather statons, etc ˆ Matlab s a sophstcated, yet low-threshold language wth stayng power ˆ Geoscences are a gentle frst step nto a lfe of the programmng scentst ˆ Codng enables students to take control and s a tool for dversty ˆ Home and student lcenses need not be costly, open-source clones exst
Hello Earth! A grounded introduction to Matlab. Frederik J Simons. Christopher Harig. Adam C. Maloof Princeton University
Hello Earth! A grounded introduction to Matlab Frederik J Simons Christopher Harig Adam C. Maloof Princeton University (Enter teacher) i 2 Something canny Matlab can do i 3 200 400 600 800 1000 100 200
More informationProgramming in Fortran 90 : 2017/2018
Programmng n Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Exercse 1 : Evaluaton of functon dependng on nput Wrte a program who evaluate the functon f (x,y) for any two user specfed values
More informationNews. Recap: While Loop Example. Reading. Recap: Do Loop Example. Recap: For Loop Example
Unversty of Brtsh Columba CPSC, Intro to Computaton Jan-Apr Tamara Munzner News Assgnment correctons to ASCIIArtste.java posted defntely read WebCT bboards Arrays Lecture, Tue Feb based on sldes by Kurt
More informationUSING GRAPHING SKILLS
Name: BOLOGY: Date: _ Class: USNG GRAPHNG SKLLS NTRODUCTON: Recorded data can be plotted on a graph. A graph s a pctoral representaton of nformaton recorded n a data table. t s used to show a relatonshp
More informationBrave New World Pseudocode Reference
Brave New World Pseudocode Reference Pseudocode s a way to descrbe how to accomplsh tasks usng basc steps lke those a computer mght perform. In ths week s lab, you'll see how a form of pseudocode can be
More informationX- Chart Using ANOM Approach
ISSN 1684-8403 Journal of Statstcs Volume 17, 010, pp. 3-3 Abstract X- Chart Usng ANOM Approach Gullapall Chakravarth 1 and Chaluvad Venkateswara Rao Control lmts for ndvdual measurements (X) chart are
More informationSupport Vector Machines
/9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.
More informationSome Advanced SPC Tools 1. Cumulative Sum Control (Cusum) Chart For the data shown in Table 9-1, the x chart can be generated.
Some Advanced SP Tools 1. umulatve Sum ontrol (usum) hart For the data shown n Table 9-1, the x chart can be generated. However, the shft taken place at sample #21 s not apparent. 92 For ths set samples,
More informationProgramming Assignment Six. Semester Calendar. 1D Excel Worksheet Arrays. Review VBA Arrays from Excel. Programming Assignment Six May 2, 2017
Programmng Assgnment Sx, 07 Programmng Assgnment Sx Larry Caretto Mechancal Engneerng 09 Computer Programmng for Mechancal Engneers Outlne Practce quz for actual quz on Thursday Revew approach dscussed
More informationVirtual Memory. Background. No. 10. Virtual Memory: concept. Logical Memory Space (review) Demand Paging(1) Virtual Memory
Background EECS. Operatng System Fundamentals No. Vrtual Memory Prof. Hu Jang Department of Electrcal Engneerng and Computer Scence, York Unversty Memory-management methods normally requres the entre process
More informationCMPS 10 Introduction to Computer Science Lecture Notes
CPS 0 Introducton to Computer Scence Lecture Notes Chapter : Algorthm Desgn How should we present algorthms? Natural languages lke Englsh, Spansh, or French whch are rch n nterpretaton and meanng are not
More informationLife Tables (Times) Summary. Sample StatFolio: lifetable times.sgp
Lfe Tables (Tmes) Summary... 1 Data Input... 2 Analyss Summary... 3 Survval Functon... 5 Log Survval Functon... 6 Cumulatve Hazard Functon... 7 Percentles... 7 Group Comparsons... 8 Summary The Lfe Tables
More information9. BASIC programming: Control and Repetition
Am: In ths lesson, you wll learn: H. 9. BASIC programmng: Control and Repetton Scenaro: Moz s showng how some nterestng patterns can be generated usng math. Jyot [after seeng the nterestng graphcs]: Usng
More informationIntro. Iterators. 1. Access
Intro Ths mornng I d lke to talk a lttle bt about s and s. We wll start out wth smlartes and dfferences, then we wll see how to draw them n envronment dagrams, and we wll fnsh wth some examples. Happy
More informationR s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes
SPH3UW Unt 7.3 Sphercal Concave Mrrors Page 1 of 1 Notes Physcs Tool box Concave Mrror If the reflectng surface takes place on the nner surface of the sphercal shape so that the centre of the mrror bulges
More informationWhy visualisation? IRDS: Visualization. Univariate data. Visualisations that we won t be interested in. Graphics provide little additional information
Why vsualsaton? IRDS: Vsualzaton Charles Sutton Unversty of Ednburgh Goal : Have a data set that I want to understand. Ths s called exploratory data analyss. Today s lecture. Goal II: Want to dsplay data
More informationFor instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1)
Secton 1.2 Subsets and the Boolean operatons on sets If every element of the set A s an element of the set B, we say that A s a subset of B, or that A s contaned n B, or that B contans A, and we wrte A
More informationLoad Balancing for Hex-Cell Interconnection Network
Int. J. Communcatons, Network and System Scences,,, - Publshed Onlne Aprl n ScRes. http://www.scrp.org/journal/jcns http://dx.do.org/./jcns.. Load Balancng for Hex-Cell Interconnecton Network Saher Manaseer,
More informationEconometrics 2. Panel Data Methods. Advanced Panel Data Methods I
Panel Data Methods Econometrcs 2 Advanced Panel Data Methods I Last tme: Panel data concepts and the two-perod case (13.3-4) Unobserved effects model: Tme-nvarant and dosyncratc effects Omted varables
More informationSkew Angle Estimation and Correction of Hand Written, Textual and Large areas of Non-Textual Document Images: A Novel Approach
Angle Estmaton and Correcton of Hand Wrtten, Textual and Large areas of Non-Textual Document Images: A Novel Approach D.R.Ramesh Babu Pyush M Kumat Mahesh D Dhannawat PES Insttute of Technology Research
More informationELEC 377 Operating Systems. Week 6 Class 3
ELEC 377 Operatng Systems Week 6 Class 3 Last Class Memory Management Memory Pagng Pagng Structure ELEC 377 Operatng Systems Today Pagng Szes Vrtual Memory Concept Demand Pagng ELEC 377 Operatng Systems
More informationOutline. Midterm Review. Declaring Variables. Main Variable Data Types. Symbolic Constants. Arithmetic Operators. Midterm Review March 24, 2014
Mdterm Revew March 4, 4 Mdterm Revew Larry Caretto Mechancal Engneerng 9 Numercal Analyss of Engneerng Systems March 4, 4 Outlne VBA and MATLAB codng Varable types Control structures (Loopng and Choce)
More informationMidterms Save the Dates!
Unversty of Brtsh Columba CPSC, Intro to Computaton Alan J. Hu Readngs Ths Week: Ch 6 (Ch 7 n old 2 nd ed). (Remnder: Readngs are absolutely vtal for learnng ths stuff!) Thnkng About Loops Lecture 9 Some
More informationArray transposition in CUDA shared memory
Array transposton n CUDA shared memory Mke Gles February 19, 2014 Abstract Ths short note s nspred by some code wrtten by Jeremy Appleyard for the transposton of data through shared memory. I had some
More informationMachine Learning. Support Vector Machines. (contains material adapted from talks by Constantin F. Aliferis & Ioannis Tsamardinos, and Martin Law)
Machne Learnng Support Vector Machnes (contans materal adapted from talks by Constantn F. Alfers & Ioanns Tsamardnos, and Martn Law) Bryan Pardo, Machne Learnng: EECS 349 Fall 2014 Support Vector Machnes
More informationSorting: The Big Picture. The steps of QuickSort. QuickSort Example. QuickSort Example. QuickSort Example. Recursive Quicksort
Sortng: The Bg Pcture Gven n comparable elements n an array, sort them n an ncreasng (or decreasng) order. Smple algorthms: O(n ) Inserton sort Selecton sort Bubble sort Shell sort Fancer algorthms: O(n
More informationComplex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following.
Complex Numbers The last topc n ths secton s not really related to most of what we ve done n ths chapter, although t s somewhat related to the radcals secton as we wll see. We also won t need the materal
More informationTN348: Openlab Module - Colocalization
TN348: Openlab Module - Colocalzaton Topc The Colocalzaton module provdes the faclty to vsualze and quantfy colocalzaton between pars of mages. The Colocalzaton wndow contans a prevew of the two mages
More informationFeature Reduction and Selection
Feature Reducton and Selecton Dr. Shuang LIANG School of Software Engneerng TongJ Unversty Fall, 2012 Today s Topcs Introducton Problems of Dmensonalty Feature Reducton Statstc methods Prncpal Components
More informationLESSON 15: BODE PLOTS OF TRANSFER FUNCTIONS
10/8/015 1 LESSON 15: BODE PLOTS OF TRANSFER FUNCTIONS ET 438a Automatc Control Systems Technology Learnng Objectves After ths presentaton you wll be able to: Compute the magntude of a transfer functon
More informationSimulation: Solving Dynamic Models ABE 5646 Week 11 Chapter 2, Spring 2010
Smulaton: Solvng Dynamc Models ABE 5646 Week Chapter 2, Sprng 200 Week Descrpton Readng Materal Mar 5- Mar 9 Evaluatng [Crop] Models Comparng a model wth data - Graphcal, errors - Measures of agreement
More informationParallelism for Nested Loops with Non-uniform and Flow Dependences
Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr
More informationMATHEMATICS FORM ONE SCHEME OF WORK 2004
MATHEMATICS FORM ONE SCHEME OF WORK 2004 WEEK TOPICS/SUBTOPICS LEARNING OBJECTIVES LEARNING OUTCOMES VALUES CREATIVE & CRITICAL THINKING 1 WHOLE NUMBER Students wll be able to: GENERICS 1 1.1 Concept of
More informationLecture 5: Multilayer Perceptrons
Lecture 5: Multlayer Perceptrons Roger Grosse 1 Introducton So far, we ve only talked about lnear models: lnear regresson and lnear bnary classfers. We noted that there are functons that can t be represented
More informationExercises (Part 4) Introduction to R UCLA/CCPR. John Fox, February 2005
Exercses (Part 4) Introducton to R UCLA/CCPR John Fox, February 2005 1. A challengng problem: Iterated weghted least squares (IWLS) s a standard method of fttng generalzed lnear models to data. As descrbed
More informationLecture #15 Lecture Notes
Lecture #15 Lecture Notes The ocean water column s very much a 3-D spatal entt and we need to represent that structure n an economcal way to deal wth t n calculatons. We wll dscuss one way to do so, emprcal
More informationA Binarization Algorithm specialized on Document Images and Photos
A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a
More informationSetup and Use. For events not using AuctionMaestro Pro. Version /7/2013
Verson 3.1.2 2/7/2013 Setup and Use For events not usng AuctonMaestro Pro MaestroSoft, Inc. 1750 112th Avenue NE, Sute A200, Bellevue, WA 98004 425.688.0809 / 800.438.6498 Fax: 425.688.0999 www.maestrosoft.com
More informationy and the total sum of
Lnear regresson Testng for non-lnearty In analytcal chemstry, lnear regresson s commonly used n the constructon of calbraton functons requred for analytcal technques such as gas chromatography, atomc absorpton
More informationHarvard University CS 101 Fall 2005, Shimon Schocken. Assembler. Elements of Computing Systems 1 Assembler (Ch. 6)
Harvard Unversty CS 101 Fall 2005, Shmon Schocken Assembler Elements of Computng Systems 1 Assembler (Ch. 6) Why care about assemblers? Because Assemblers employ some nfty trcks Assemblers are the frst
More informationInsertion Sort. Divide and Conquer Sorting. Divide and Conquer. Mergesort. Mergesort Example. Auxiliary Array
Inserton Sort Dvde and Conquer Sortng CSE 6 Data Structures Lecture 18 What f frst k elements of array are already sorted? 4, 7, 1, 5, 1, 16 We can shft the tal of the sorted elements lst down and then
More informationNotes on Organizing Java Code: Packages, Visibility, and Scope
Notes on Organzng Java Code: Packages, Vsblty, and Scope CS 112 Wayne Snyder Java programmng n large measure s a process of defnng enttes (.e., packages, classes, methods, or felds) by name and then usng
More informationGSLM Operations Research II Fall 13/14
GSLM 58 Operatons Research II Fall /4 6. Separable Programmng Consder a general NLP mn f(x) s.t. g j (x) b j j =. m. Defnton 6.. The NLP s a separable program f ts objectve functon and all constrants are
More informationCHARUTAR VIDYA MANDAL S SEMCOM Vallabh Vidyanagar
CHARUTAR VIDYA MANDAL S SEMCOM Vallabh Vdyanagar Faculty Name: Am D. Trved Class: SYBCA Subject: US03CBCA03 (Advanced Data & Fle Structure) *UNIT 1 (ARRAYS AND TREES) **INTRODUCTION TO ARRAYS If we want
More informationAssembler. Shimon Schocken. Spring Elements of Computing Systems 1 Assembler (Ch. 6) Compiler. abstract interface.
IDC Herzlya Shmon Schocken Assembler Shmon Schocken Sprng 2005 Elements of Computng Systems 1 Assembler (Ch. 6) Where we are at: Human Thought Abstract desgn Chapters 9, 12 abstract nterface H.L. Language
More informationLecture 4: Principal components
/3/6 Lecture 4: Prncpal components 3..6 Multvarate lnear regresson MLR s optmal for the estmaton data...but poor for handlng collnear data Covarance matrx s not nvertble (large condton number) Robustness
More informationNGPM -- A NSGA-II Program in Matlab
Verson 1.4 LIN Song Aerospace Structural Dynamcs Research Laboratory College of Astronautcs, Northwestern Polytechncal Unversty, Chna Emal: lsssswc@163.com 2011-07-26 Contents Contents... 1. Introducton...
More informationSetup and Use. Version 3.7 2/1/2014
Verson 3.7 2/1/2014 Setup and Use MaestroSoft, Inc. 1750 112th Avenue NE, Sute A200, Bellevue, WA 98004 425.688.0809 / 800.438.6498 Fax: 425.688.0999 www.maestrosoft.com Contents Text2Bd checklst 3 Preparng
More informationToday s Outline. Sorting: The Big Picture. Why Sort? Selection Sort: Idea. Insertion Sort: Idea. Sorting Chapter 7 in Weiss.
Today s Outlne Sortng Chapter 7 n Wess CSE 26 Data Structures Ruth Anderson Announcements Wrtten Homework #6 due Frday 2/26 at the begnnng of lecture Proect Code due Mon March 1 by 11pm Today s Topcs:
More informationMachine Learning. Topic 6: Clustering
Machne Learnng Topc 6: lusterng lusterng Groupng data nto (hopefully useful) sets. Thngs on the left Thngs on the rght Applcatons of lusterng Hypothess Generaton lusters mght suggest natural groups. Hypothess
More informationSynthesizer 1.0. User s Guide. A Varying Coefficient Meta. nalytic Tool. Z. Krizan Employing Microsoft Excel 2007
Syntheszer 1.0 A Varyng Coeffcent Meta Meta-Analytc nalytc Tool Employng Mcrosoft Excel 007.38.17.5 User s Gude Z. Krzan 009 Table of Contents 1. Introducton and Acknowledgments 3. Operatonal Functons
More informationEsc101 Lecture 1 st April, 2008 Generating Permutation
Esc101 Lecture 1 Aprl, 2008 Generatng Permutaton In ths class we wll look at a problem to wrte a program that takes as nput 1,2,...,N and prnts out all possble permutatons of the numbers 1,2,...,N. For
More informationAgenda & Reading. Simple If. Decision-Making Statements. COMPSCI 280 S1C Applications Programming. Programming Fundamentals
Agenda & Readng COMPSCI 8 SC Applcatons Programmng Programmng Fundamentals Control Flow Agenda: Decsonmakng statements: Smple If, Ifelse, nested felse, Select Case s Whle, DoWhle/Untl, For, For Each, Nested
More informationProblem Definitions and Evaluation Criteria for Computational Expensive Optimization
Problem efntons and Evaluaton Crtera for Computatonal Expensve Optmzaton B. Lu 1, Q. Chen and Q. Zhang 3, J. J. Lang 4, P. N. Suganthan, B. Y. Qu 6 1 epartment of Computng, Glyndwr Unversty, UK Faclty
More informationA Fast Visual Tracking Algorithm Based on Circle Pixels Matching
A Fast Vsual Trackng Algorthm Based on Crcle Pxels Matchng Zhqang Hou hou_zhq@sohu.com Chongzhao Han czhan@mal.xjtu.edu.cn Ln Zheng Abstract: A fast vsual trackng algorthm based on crcle pxels matchng
More informationEmpirical Distributions of Parameter Estimates. in Binary Logistic Regression Using Bootstrap
Int. Journal of Math. Analyss, Vol. 8, 4, no. 5, 7-7 HIKARI Ltd, www.m-hkar.com http://dx.do.org/.988/jma.4.494 Emprcal Dstrbutons of Parameter Estmates n Bnary Logstc Regresson Usng Bootstrap Anwar Ftranto*
More informationmquest Quickstart Version 11.0
mquest Quckstart Verson 11.0 cluetec GmbH Emmy-Noether-Straße 17 76131 Karlsruhe Germany www.cluetec.de www.mquest.nfo cluetec GmbH Karlsruhe, 2016 Document verson 5 27.04.2016 16:59 > Propretary notce
More informationLecture 3: Computer Arithmetic: Multiplication and Division
8-447 Lecture 3: Computer Arthmetc: Multplcaton and Dvson James C. Hoe Dept of ECE, CMU January 26, 29 S 9 L3- Announcements: Handout survey due Lab partner?? Read P&H Ch 3 Read IEEE 754-985 Handouts:
More informationFEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur
FEATURE EXTRACTION Dr. K.Vjayarekha Assocate Dean School of Electrcal and Electroncs Engneerng SASTRA Unversty, Thanjavur613 41 Jont Intatve of IITs and IISc Funded by MHRD Page 1 of 8 Table of Contents
More informationData Mining: Model Evaluation
Data Mnng: Model Evaluaton Aprl 16, 2013 1 Issues: Evaluatng Classfcaton Methods Accurac classfer accurac: predctng class label predctor accurac: guessng value of predcted attrbutes Speed tme to construct
More informationAnalysis of Malaysian Wind Direction Data Using ORIANA
Modern Appled Scence March, 29 Analyss of Malaysan Wnd Drecton Data Usng ORIANA St Fatmah Hassan (Correspondng author) Centre for Foundaton Studes n Scence Unversty of Malaya, 63 Kuala Lumpur, Malaysa
More informationOutline. Discriminative classifiers for image recognition. Where in the World? A nearest neighbor recognition example 4/14/2011. CS 376 Lecture 22 1
4/14/011 Outlne Dscrmnatve classfers for mage recognton Wednesday, Aprl 13 Krsten Grauman UT-Austn Last tme: wndow-based generc obect detecton basc ppelne face detecton wth boostng as case study Today:
More informationCS1100 Introduction to Programming
Factoral (n) Recursve Program fact(n) = n*fact(n-) CS00 Introducton to Programmng Recurson and Sortng Madhu Mutyam Department of Computer Scence and Engneerng Indan Insttute of Technology Madras nt fact
More informationECONOMICS 452* -- Stata 11 Tutorial 6. Stata 11 Tutorial 6. TOPIC: Representing Multi-Category Categorical Variables with Dummy Variable Regressors
ECONOMICS * -- Stata 11 Tutoral Stata 11 Tutoral TOPIC: Representng Mult-Category Categorcal Varables wth Dummy Varable Regressors DATA: wage1_econ.dta (a Stata-format dataset) TASKS: Stata 11 Tutoral
More informationOn the diameter of random planar graphs
On the dameter of random planar graphs Gullaume Chapuy, CNRS & LIAFA, Pars jont work wth Érc Fusy, Pars, Omer Gménez, ex-barcelona, Marc Noy, Barcelona. Probablty and Graphs, Eurandom, Endhoven, 04. Planar
More informationRelated-Mode Attacks on CTR Encryption Mode
Internatonal Journal of Network Securty, Vol.4, No.3, PP.282 287, May 2007 282 Related-Mode Attacks on CTR Encrypton Mode Dayn Wang, Dongda Ln, and Wenlng Wu (Correspondng author: Dayn Wang) Key Laboratory
More informationWishing you all a Total Quality New Year!
Total Qualty Management and Sx Sgma Post Graduate Program 214-15 Sesson 4 Vnay Kumar Kalakband Assstant Professor Operatons & Systems Area 1 Wshng you all a Total Qualty New Year! Hope you acheve Sx sgma
More informationNAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics
Introducton G10 NAG Fortran Lbrary Chapter Introducton G10 Smoothng n Statstcs Contents 1 Scope of the Chapter... 2 2 Background to the Problems... 2 2.1 Smoothng Methods... 2 2.2 Smoothng Splnes and Regresson
More informationHigh level vs Low Level. What is a Computer Program? What does gcc do for you? Program = Instructions + Data. Basic Computer Organization
What s a Computer Program? Descrpton of algorthms and data structures to acheve a specfc ojectve Could e done n any language, even a natural language lke Englsh Programmng language: A Standard notaton
More informationAPPLICATION OF A COMPUTATIONALLY EFFICIENT GEOSTATISTICAL APPROACH TO CHARACTERIZING VARIABLY SPACED WATER-TABLE DATA
RFr"W/FZD JAN 2 4 1995 OST control # 1385 John J Q U ~ M Argonne Natonal Laboratory Argonne, L 60439 Tel: 708-252-5357, Fax: 708-252-3 611 APPLCATON OF A COMPUTATONALLY EFFCENT GEOSTATSTCAL APPROACH TO
More informationAn Optimal Algorithm for Prufer Codes *
J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,
More informationAnalysis of Continuous Beams in General
Analyss of Contnuous Beams n General Contnuous beams consdered here are prsmatc, rgdly connected to each beam segment and supported at varous ponts along the beam. onts are selected at ponts of support,
More informationAssembler. Building a Modern Computer From First Principles.
Assembler Buldng a Modern Computer From Frst Prncples www.nand2tetrs.org Elements of Computng Systems, Nsan & Schocken, MIT Press, www.nand2tetrs.org, Chapter 6: Assembler slde Where we are at: Human Thought
More informationThis chapter discusses aspects of heat conduction. The equilibrium heat conduction on a rod. In this chapter, Arrays will be discussed.
1 Heat Flow n a Rod Ths chapter dscusses aspects of heat conducton. The equlbrum heat conducton on a rod. In ths chapter, Arrays wll be dscussed. Arrays provde a mechansm for declarng and accessng several
More informationOracle Database: SQL and PL/SQL Fundamentals Certification Course
Oracle Database: SQL and PL/SQL Fundamentals Certfcaton Course 1 Duraton: 5 Days (30 hours) What you wll learn: Ths Oracle Database: SQL and PL/SQL Fundamentals tranng delvers the fundamentals of SQL and
More informationSolutions to Programming Assignment Five Interpolation and Numerical Differentiation
College of Engneerng and Coputer Scence Mechancal Engneerng Departent Mechancal Engneerng 309 Nuercal Analyss of Engneerng Systes Sprng 04 Nuber: 537 Instructor: Larry Caretto Solutons to Prograng Assgnent
More informationLEAST SQUARES. RANSAC. HOUGH TRANSFORM.
LEAS SQUARES. RANSAC. HOUGH RANSFORM. he sldes are from several sources through James Has (Brown); Srnvasa Narasmhan (CMU); Slvo Savarese (U. of Mchgan); Bll Freeman and Antono orralba (MI), ncludng ther
More informationCSE 326: Data Structures Quicksort Comparison Sorting Bound
CSE 326: Data Structures Qucksort Comparson Sortng Bound Steve Setz Wnter 2009 Qucksort Qucksort uses a dvde and conquer strategy, but does not requre the O(N) extra space that MergeSort does. Here s the
More informationMathematics 256 a course in differential equations for engineering students
Mathematcs 56 a course n dfferental equatons for engneerng students Chapter 5. More effcent methods of numercal soluton Euler s method s qute neffcent. Because the error s essentally proportonal to the
More informationA DATA ANALYSIS CODE FOR MCNP MESH AND STANDARD TALLIES
Supercomputng n uclear Applcatons (M&C + SA 007) Monterey, Calforna, Aprl 15-19, 007, on CD-ROM, Amercan uclear Socety, LaGrange Par, IL (007) A DATA AALYSIS CODE FOR MCP MESH AD STADARD TALLIES Kenneth
More informationStata data file Log file (explained below) ASCII (text) file
Usng Stata Welcome to Stata, one of the most un-user frendly programs ever created. Although later versons have some features to make t easer to use, they more than make up for t by not beng 00% compatble
More informationRadial Basis Functions
Radal Bass Functons Mesh Reconstructon Input: pont cloud Output: water-tght manfold mesh Explct Connectvty estmaton Implct Sgned dstance functon estmaton Image from: Reconstructon and Representaton of
More informationLOOP ANALYSIS. The second systematic technique to determine all currents and voltages in a circuit
LOOP ANALYSS The second systematic technique to determine all currents and voltages in a circuit T S DUAL TO NODE ANALYSS - T FRST DETERMNES ALL CURRENTS N A CRCUT AND THEN T USES OHM S LAW TO COMPUTE
More informationOverview. CSC 2400: Computer Systems. Pointers in C. Pointers - Variables that hold memory addresses - Using pointers to do call-by-reference in C
CSC 2400: Comuter Systems Ponters n C Overvew Ponters - Varables that hold memory addresses - Usng onters to do call-by-reference n C Ponters vs. Arrays - Array names are constant onters Ponters and Strngs
More information8.5 Special-purpose plots
K23166 2015/1/9 17:35 page 130 #156 130 CHAPTER 8. A GRAPHICAL COMPENDIUM 8.4.3 Contour plots A contour plot shows the Cartesan plan wth smlar valued ponts lnked by lnes. The most famlar versons of such
More informationAssignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.
Farrukh Jabeen Algorthms 51 Assgnment #2 Due Date: June 15, 29. Assgnment # 2 Chapter 3 Dscrete Fourer Transforms Implement the FFT for the DFT. Descrbed n sectons 3.1 and 3.2. Delverables: 1. Concse descrpton
More informationS1 Note. Basis functions.
S1 Note. Bass functons. Contents Types of bass functons...1 The Fourer bass...2 B-splne bass...3 Power and type I error rates wth dfferent numbers of bass functons...4 Table S1. Smulaton results of type
More informationIntroduction to Programming. Lecture 13: Container data structures. Container data structures. Topics for this lecture. A basic issue with containers
1 2 Introducton to Programmng Bertrand Meyer Lecture 13: Contaner data structures Last revsed 1 December 2003 Topcs for ths lecture 3 Contaner data structures 4 Contaners and genercty Contan other objects
More informationECONOMICS 452* -- Stata 12 Tutorial 6. Stata 12 Tutorial 6. TOPIC: Representing Multi-Category Categorical Variables with Dummy Variable Regressors
ECONOMICS 45* -- Stata 1 Tutoral 6 Stata 1 Tutoral 6 TOPIC: Representng Mult-Category Categorcal Varables wth Dummy Varable Regressors DATA: wage1_econ45.dta (a Stata-format dataset) TASKS: Stata 1 Tutoral
More informationPRÉSENTATIONS DE PROJETS
PRÉSENTATIONS DE PROJETS Rex Onlne (V. Atanasu) What s Rex? Rex s an onlne browser for collectons of wrtten documents [1]. Asde ths core functon t has however many other applcatons that make t nterestng
More informationSLAM Summer School 2006 Practical 2: SLAM using Monocular Vision
SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,
More informationClassification / Regression Support Vector Machines
Classfcaton / Regresson Support Vector Machnes Jeff Howbert Introducton to Machne Learnng Wnter 04 Topcs SVM classfers for lnearly separable classes SVM classfers for non-lnearly separable classes SVM
More informationReport on On-line Graph Coloring
2003 Fall Semester Comp 670K Onlne Algorthm Report on LO Yuet Me (00086365) cndylo@ust.hk Abstract Onlne algorthm deals wth data that has no future nformaton. Lots of examples demonstrate that onlne algorthm
More informationMachine Learning 9. week
Machne Learnng 9. week Mappng Concept Radal Bass Functons (RBF) RBF Networks 1 Mappng It s probably the best scenaro for the classfcaton of two dataset s to separate them lnearly. As you see n the below
More informationOutline. CIS 110: Intro to Computer Programming. What Do Our Programs Look Like? The Scanner Object. CIS 110 (11fa) - University of Pennsylvania 1
Outlne CIS 110: Intro to Computer Programmng The Scanner Object Introducng Condtonal Statements Cumulatve Algorthms Lecture 10 Interacton and Condtonals ( 3.3, 4.1-4.2) 10/15/2011 CIS 110 (11fa) - Unversty
More informationComputer models of motion: Iterative calculations
Computer models o moton: Iteratve calculatons OBJECTIVES In ths actvty you wll learn how to: Create 3D box objects Update the poston o an object teratvely (repeatedly) to anmate ts moton Update the momentum
More informationMultiple optimum values
1.204 Lecture 22 Unconstraned nonlnear optmzaton: Amoeba BFGS Lnear programmng: Glpk Multple optmum values A B C G E Z X F Y D X 1 X 2 Fgure by MIT OpenCourseWare. Heurstcs to deal wth multple optma: Start
More informationMutual Information between Discrete and Continuous Data Sets
Mutual Informaton between Dscrete and Contnuous Data Sets Bran C. Ross* Department of Physcs, Unversty of Washngton, Seattle, Washngton, Unted States of Amerca Abstract Mutual nformaton (MI) s a powerful
More informationAn efficient method to build panoramic image mosaics
An effcent method to buld panoramc mage mosacs Pattern Recognton Letters vol. 4 003 Dae-Hyun Km Yong-In Yoon Jong-Soo Cho School of Electrcal Engneerng and Computer Scence Kyungpook Natonal Unv. Abstract
More informationLecture 5: Probability Distributions. Random Variables
Lecture 5: Probablty Dstrbutons Random Varables Probablty Dstrbutons Dscrete Random Varables Contnuous Random Varables and ther Dstrbutons Dscrete Jont Dstrbutons Contnuous Jont Dstrbutons Independent
More information