Notes on Organizing Java Code: Packages, Visibility, and Scope

Size: px
Start display at page:

Download "Notes on Organizing Java Code: Packages, Visibility, and Scope"

Transcription

1 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 those names n varous contexts, and the rules for how we go about ths determne how we organze our code. In ths set of notes, we wll consder these rules n detal; n partcular, we want to understand, for each entty, the followng: 1) What s the scope of the defnton (the locatons n code that the defnton can be used) and what mechansms exst for extendng or modfyng that scope? 2) How do we refer to the entty,.e., what s the syntax of the name when t s used? 3) What happens f we have multple defntons of a name? 4) What s the lfetme of the defnton,.e., when does t begn to be vsble and when does ts vsblty end? The purpose of ths study s frst to understand the detals of how we use class and class member defntons as we wrte lnes of Java code, but secondly we want to understand how these rules allow us to structure large Java projects followng the object- orented phlosophy. Packages and the fle system The envronment n whch you run Java on your computer conssts of fles of Java code (endng n.java) contanng class defntons, compled Java classes (fles endng n.class), and rules for how a partcular pece of code wll execute; most of these rules nvolve how to name classes and how to refer to one class from another class. In ths set of notes we wll consder broadly how code s organzed on your computer, focussng n partcular on the noton of a package. The man folder where you store your Java code s sometmes referred to as the workspace, and t s organzed herarchcally as follows: Workspace Packages (subfolders) Fles Classes Members: felds, methods and nested classes

2 Your workspace (or workng drectory) may contan subfolders to organze your Java code, and these are any number of packages, and packages are typcally organzed n a herarchcal structure (the dotted names correspond to the folder structure) but each package s a separate entty and so ths herarchy s just for keepng your fles organzed n the fle system: there s no concept of a subpackage and ths herarchy has no effect anythng we dscuss n these notes. If you don t specfy a package when you create a class, t s put n the default or nameless package, as you can see wth the class TestDefault below. For example, consder the followng fles and folders n our workspace, whch we wll use as a runnng example: Workspace TestDefault.java alpha TestAlpha.java beta TestBeta.java one Test1.java one.two Test12.java one.two.three Test123.java (where the folders are underlned). Ths mght appear n your Mac as follows:

3 Packages: Makng a fle part of a package A.java fle contans one or more class defntons, and to be n a package t must be n the approprate folder, as descrbed above, and also must contan a package statement, e.g., f Test1.java s n package one, t must begn wth the lne: package one; and f Test123.java s n package one.two.three, t begns wth the lne: package one.two.three; A fle wth no package declaraton s n the default package. Packages: Usng classes n the same package When you want to refer to classes n the same package, you smply use ther smple names (you have doubtless been dong ths all along for fles n the default package). However, when you want to use a publc class n the same project, but n a dfferent package, you have bascally two choces: 1) You can use the full name wth the package and the class name. For example, n the fgure, to declare a Test12 class nstance from package one.two from nsde Test123, you can wrte one.two.test12 t2; Ths wll work from any class n the project, ncludng classes n the default package. 1 2) You can mport the class and then smply use the name of the class; for example, to create an nstance of Test1 nsde Test123, you could wrte the followng (as seen n the fgure): mport one.test1;.. Test1 t = new Test1(); To mport all the publc classes n a package, you can use a wldcard n place of the class name, e.g., we could have mported all publc classes n package one usng: mport one.*; (snce there was only one class n any case, these would be equvalent). Important note: When you mport wth the wldcard *, you get only the classes n that package/folder and no others; e.g., when you mport one.* you do not 1 However, there s no way to refer to classes n the default package from a dfferent package, whch s a good reason to avod the default package!

4 automatcally get the classes n one.two and one.two.three. You have to lst all the packages separately you want to mport. Agan, the only reason for the herarchcal organzaton of packages s to organze your folders- - - there s no effect on the process of fndng defntons of names. Multple defntons of a class and the buldpath When you comple your Java code, the comple has to fnd the classes that you have referred to n your code, and to do ths, t uses the buldpath, whch s smply a lst of folders to look n, one after the other, for classes. The frst place t looks s n your workspace, and the second place s n the Java lbrary that came wth your compler (ths s where basc thngs lke the Math class are stored); you can change the buldpath f you lke, but that s outsde the scope of these notes. What happens when you have two classes wth the same name? The rule s very smple: a class may not be redefned wthn ts vsblty, wth the excepton of multple defntons n packages that are lsted on the buldpath, n whch case the Java compler wll use the frst defnton that t comes to n gong down the buldpath. Thus, you may redefne the class Math and provde your own defnton of the method pow(), and put t n your buldpath before the JRE, and ths s the one that wll be used by default. In every other case, the Java compler wll complan f you have multple defntons for a name (as you have no doubt experenced!). Access modfers: publc, prvate, and package access Now we can understand the vsblty of classes defned n fles n a package. There are two possbltes: 1) A class s declared as publc: there are no restrctons on ts vsblty; t can be used by any other class that can fnd t (e.g., n the same package, or n another package that has the approprate buldpath). 2) A class s declared as protected: ths has to do wth subclasses, and wll be dealt wth late n the course when we dscuss nhertance. 3) A class s declared wthout ether of these access modfers: n ths case, the default s package access, whch means that t s vsble only n ts own package. The class can not be mported or named by ts full package name n another package, and no modfcaton of the buldpath wll make t accessble from another project; for example, n the fgure f we removed the publc modfers from the defntons of Test1, Test12, or TestAlpha, we would get a not vsble error n Test123. For members (.e., felds, methods, and nner classes), we have four possbltes: 1) The member s declared as publc: t s vsble wherever the class s vsble; 2) The member s delcared as protected: agan, we shall deal wth ths later;

5 3) The member s declared as prvate, and t s vsble nsde the class only, and nvsble outsde the curly braces of the class; 4) The member s declared wthout a modfer, and has package access; ths means t s vsble nsde the package only. How to organze your classes n fles Fnally, there s the matter of how classes are arranged n the fles. Recall that a package s really a folder whch contans fles whch contan defntons of classes. There can be more than one class defnton per fle, but we have the followng restrctons on publc classes: 1) There can be at most one publc class per fle; 2) A publc class must have the same name as the fle (wth the.java suffx); and 3) Man methods can only occur n publc classes. It s a good dea to put any substantal class n ts own fle, and to have multple classes n a fle only when they are very closely related to each other; f they are only used n one class n that fle, then they should be made nto nner classes. Vsblty of class felds and local varables [Optonal] We wll now consder the ssue of vsblty n the case of local varables, felds, and then the combnaton of these two. Local Varables n Methods The rule for local varables defned nsde methods s actually qute smple: the scope of a local varable defnton s from the pont of the defnton to the end of the closest enclosng par of curly braces, and you may not redefne a varable wthn ts scope. Defntons nsde the headng of for loops, and parameters n methods, have scope from the pont of defnton to the end of the curly braces enclosng the loop or method. For example, here s the scope of the sx local varables n a slly method; note carefully that j and k are both defned twce, but not redefned nsde ther scope, so there s no problem (e.g., the two j s are dfferent varables): statc vod slly(nt m) { m nt = 4; m m for(nt j=0; j<10; j++) { m j nt k = 2; m j k k = k + + j; m j k m m for(nt j=0; j<20; j++) { m j nt k = 9; m j k k = k + - j; m j k

6 m m A varable must be ntalzed before ts frst use (there s no default ntalzaton for local varables). Felds n Classes The stuaton for felds s somewhat dfferent, snce the felds are defntons of the members avalable n a class, and are not so obvously part of an executable regon of code. Here the rule s: a feld defnton has scope over the entre class, but may be redefned as part of a method or nested class; ntalzatons (f they are done n the defnton, and not n the constructor) take place n the order of the felds n the class. Although the usual practce s to provde explct ntalzaton values n the constructor, we may do t n the defnton n the class tself, n whch case the ntalzatons take place n the order of the felds (as f they were executable statements n a method). Thus, a method may refer to a feld that s defned anywhere n the class, but feld ntalzaton may only use the defntons above t n the lst of felds. Felds are ntalzed to 0 or null or false by default. For example, n the followng class, n s ntalzed to 0, m would be ntalzed to 4, k to 4, and p to 5; the dagram shows the scope of each of the felds, and the underlned names show the scope of the sequental ntalzaton. Thus, f we were to change the ntalzaton of k = n + p t would be an error, snce the defnton of p occurs below the defnton of k. publc class TestDefault { nt n; n m k p nt m = 4; n m k p n m k p nt sllymethod(nt q) { n m k p q return q + n + m + k; n m k p q n m k p n m k p nt k = n + m; n m k p nt p = m + 1; n m k p We saw above that we may not redefne a local varable n ts scope. However, t s possble to redefne a feld name nsde ts scope, by reusng the name as a local varable or a feld n a nested class. Ths s sometmes useful, snce the name may be descrptve n a way that s dentcal n two contexts (e.g.,, counter, next ). Reusng common names may be easer and less confusng than comng up wth new names. The basc dea when reusng feld names, or when mxng felds and local varables, s that a use of a name refers to the closest enclosng defnton. For example, n the followng (contrved) example, there s a feld whch s superceded

7 by a local varable n a method and a feld nsde an nner class, creatng two holes n the outermost defnton of ; the nested class feld s n turn superceded by a local varable of the same name. Each column of s showng the scope s a dstnct varable: publc class TestDefault { nt = 1; // feld class TestIt { nt = 2; // feld // here == 2 nt testitmethod() { nt = 3; // local varable // here == 3 return ; nt testdefaultmethod() { nt = 4; // local varable // here == 4 TestIt t = new TestIt(); return ; // prnts 4 //return ths.; prnts 1 //return t.; prnts 2 //return t.testitmethod(); prnts 3 publc statc vod man (Strng [] cmd) { TestDefault d = new TestDefault(); System.out.prntln(d.testDefaultMethod()); A sgnfcant ssue when redefnton s allowed s how we may refer to the varous defntons. Of course, the default s to use the closest enclosng defnton. However, we can also refer n some cases to other defntons, as shown n the comments attached to the varous alternatve return statements n testmethod() above: 1) return yelds 4 usng the default rule; 2) return ths. yelds 1, as the keyword ths refers to the current nstance of the class where ths method was defned (just go outward untl you ht a defnton of a feld ); 3) return t. yelds 2, as ths s a feld defned nsde t, whch s an nstance of TestIt; and 4) return t.testitmethod() yelds 3, as the method returns the value of ts local varable. Note that you may not refer to the feld n TestDefault from wthn the scope of the feld n TestIt, snce ths would refer to ts own current nstance; we wll see later n the course that ths wll be possble when usng statc classes. [End Optonal]

8 Lfetme of Defntons: Statc vs Instance Felds and Methods Up to ths pont, we have not engaged wth our fourth queston wth whch we began,.e., when do defntons come nto beng and when do they end? In Java ths queston s very smply answered: 1) When a member of a class s declared wth the statc keyword, there s exactly one nstance of that member, whch s created automatcally before the program begns to run, and exsts untl the program termnates. 2) When member of a class s declared wthout the statc keyword, then an nstance of that member s created by the constructor for each nstance of the class that s created; ts lfetme s the lfetme of the nstance. In addton to the temporal ssue of lfetme, t s very mportant to note that statc members have only one nstance, and although all nstances of the class may use t, they all use that sngle nstance. Statc Felds The best way to see how ths works s wth an example: the followng class represents a lne and contans a statc feld countng how many nstances have been created: class Lne { statc nt count = 0; // keeps track of how many lnes exst publc nt order; // when was ths one created publc double x, double y; publc Lne(double x, double y) { order = ++count; ths.x = x; ths.y = y; publc class LneTest { publc statc vod man(strng[] args) { Lne l1 = new Lne(0.0, 0.0); Lne l2 = new Lne(2.3, 3.4); // Now l1.count == 2 and l2.order == 2 Lne l3 = new Lne(1.2, 6.7); // Now l1.count == 3 and l2.order == 2 We may llustrate ths as follows, where we show a statc regon of memory whch exsts durng the entre program lfetme, and a dynamc regon of memory where (possbly multple ) nstances of a class are created and (perhaps) destroyed:

9 Statc Memory Dynamc Memory Lne l1 l2 l3 count: 3 order: 1 x: 0.0 y: 0.0 order: 2 x: 2.3 y: 3.4 order: 3 x: 1.2 y: 6.7 When referrng to members of classes, t s very mportant to realze that there are multple nstances of non- statc members (one for each class nstances), and that these must be referred ether locally nsde the methods of the class nstances, or from outsde through the name of the nstance, e.g., l1.order, l2.x, etc. A statc member may be referred n the same way as a non- statc member BUT ALSO through the name of the class, e.g., Lne.count. Note that nstance felds may be ntalzed by the constructor, but statc felds have no explct constructor, and must be ntalzed n the class defnton tself (as we see wth count above). Statc Methods We may also defne statc methods, n whch case there s exactly one nstance of the method, wth all ts local varables (whch are themselves statc); for example, man() s always a statc method. Agan, any nstance may refer to a statc method by ts smple name nsde the class, by the nstance from outsde the class, and through the name of the class. However, there s an mportant restrcton to keep n mnd wth statc methods: a statc method may not refer to a non- statc member except through the name of the nstance, because there may be no such nstances, or multple nstances. A example wll make ths clear. Here s the Lne class wth a non- statc method whch calculates the length of the lne: class Lne {

10 statc nt count = 0; // keeps track of how many lnes exst publc nt order; // when was ths one created publc double x, double y; publc Lne(double x, double y) { order = ++count; ths.x = x; ths.y = y; double length() { return Math.sqrt(x*x + y*y); // sqrt s a statc method of class Math! publc class LneTest { publc statc vod man(strng[] args) { Lne l1 = new Lne(0.0, 0.0); Lne l2 = new Lne(2.3, 3.4); // Now l2.length() would return We could call length() nsde another method of Lne, or call t through the name of ts nstance. But what would happen f we made length() statc? statc double length() { return Math.sqrt(x*x + y*y); The answer s that we would get four comple- tme errors Can not make a statc reference to the non- statc feld, one for each occurrence of x and y. Clearly, ths defnton makes no sense: whch x and y are ntended? However, a statc method statc nt getcount() { return count; would generate no errors. We may magne the code for statc methods as lvng n the statc memory nstance of the class, and the non- statc methods as lvng n each nstance, and so a method may refer only to felds n ts own nstance: Statc Memory Dynamc Memory Lne l1 l2 l3 count: 3 nt getcount() { order: 1 x: 0.0 y: 0.0 double length() {. order: 2 x: 2.3 y: 3.4 double length() {. order: 3 x: 1.2 y: 6.7 double length() {.

11 Why are statc felds and methods useful? Frstly, some utlty methods, such as those n the Math class, have no need for any local data, and hence the class s just a contaner for a bunch of commonly- used functons; t s more effcent to have only one nstance of ths class rather than havng to create an nstance every tme we want to use the Math methods. Second, sometmes, as wth the feld count above, t s useful to have some global nformaton that all class nstances can use. Summary 1) The nformaton herarchy s workspace : projects : packages : fles : classes : members. We may have a herarchy of nested classes as felds nsde classes or as local varables n methods. 2) Packages are stored n a herarchcal fle system n ther projects correspondng to the structure of ther (dot- separated) compound names. 3) Fles can contan any number of classes, but at most one publc class, whch has to have the same name as the fle; publc statc man methods can only occur n such publc classes. 4) Publc enttes are vsble anywhere ther defner s, prvate enttes are vsble only n ther own class, and the default vsblty s nsde one s own package. 5) Classes can refer to classes n the same package by ther smple names, can refer to classes n the same project but dfferent packages by mportng the package or prefxng the name of the package, and projects can refer to each other by extendng the buldpath. 6) Classes may not be redefned wthn ther vsblty, wth the excepton of multple defntons exstng on the buldpath, n whch case the compler uses the frst defnton encountered. 7) The scope of a local varable s from the pont of defnton to the end of the closest enclosng rght brace, or, n the case of method or loop parameters, to the end of the loop or method; local varables may not be redefned wthn ther scope. 8) The scope of a feld n a class s the entre class (except for holes- n- scope produced by redefntons), but ntalzatons take place n the feld order. 9) Names of felds may be redefned by local varables n methods, or by felds n nested classes; one may refer to felds outsde of ther scope only by usng the usual rules for referrng to felds n nstances of classes, the keyword ths beng used to refer to the current nstance of the closest enclosng class. 10) Statc felds have exactly one nstance, whch exsts for the entre runnng tme of the program, and whch are accessble from nsde any nstance, and from outsde through an nstance name, or through the name of the class. Statc methods may be referred to analogously, but may themselves only refer to statc felds.

Pass by Reference vs. Pass by Value

Pass by Reference vs. Pass by Value Pass by Reference vs. Pass by Value Most methods are passed arguments when they are called. An argument may be a constant or a varable. For example, n the expresson Math.sqrt(33) the constant 33 s passed

More information

News. Recap: While Loop Example. Reading. Recap: Do Loop Example. Recap: For Loop Example

News. 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 information

Complex 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. 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 information

For instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1)

For 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 information

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster

More information

CMPS 10 Introduction to Computer Science Lecture Notes

CMPS 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 information

Intro. Iterators. 1. Access

Intro. 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 information

Harvard University CS 101 Fall 2005, Shimon Schocken. Assembler. Elements of Computing Systems 1 Assembler (Ch. 6)

Harvard 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 information

Assembler. Building a Modern Computer From First Principles.

Assembler. 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 information

Agenda & Reading. Simple If. Decision-Making Statements. COMPSCI 280 S1C Applications Programming. Programming Fundamentals

Agenda & 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 information

Esc101 Lecture 1 st April, 2008 Generating Permutation

Esc101 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 information

Programming in Fortran 90 : 2017/2018

Programming 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 information

TN348: Openlab Module - Colocalization

TN348: 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 information

Brave New World Pseudocode Reference

Brave 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 information

Overview. CSC 2400: Computer Systems. Pointers in C. Pointers - Variables that hold memory addresses - Using pointers to do call-by-reference in C

Overview. 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 information

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.

Assignment # 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 information

Mathematics 256 a course in differential equations for engineering students

Mathematics 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 information

11. HARMS How To: CSV Import

11. HARMS How To: CSV Import and Rsk System 11. How To: CSV Import Preparng the spreadsheet for CSV Import Refer to the spreadsheet template to ad algnng spreadsheet columns wth Data Felds. The spreadsheet s shown n the Appendx, an

More information

ON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE

ON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE Yordzhev K., Kostadnova H. Інформаційні технології в освіті ON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE Yordzhev K., Kostadnova H. Some aspects of programmng educaton

More information

Assembler. Shimon Schocken. Spring Elements of Computing Systems 1 Assembler (Ch. 6) Compiler. abstract interface.

Assembler. 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 information

On Some Entertaining Applications of the Concept of Set in Computer Science Course

On Some Entertaining Applications of the Concept of Set in Computer Science Course On Some Entertanng Applcatons of the Concept of Set n Computer Scence Course Krasmr Yordzhev *, Hrstna Kostadnova ** * Assocate Professor Krasmr Yordzhev, Ph.D., Faculty of Mathematcs and Natural Scences,

More information

ELEC 377 Operating Systems. Week 6 Class 3

ELEC 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 information

UNIT 2 : INEQUALITIES AND CONVEX SETS

UNIT 2 : INEQUALITIES AND CONVEX SETS UNT 2 : NEQUALTES AND CONVEX SETS ' Structure 2. ntroducton Objectves, nequaltes and ther Graphs Convex Sets and ther Geometry Noton of Convex Sets Extreme Ponts of Convex Set Hyper Planes and Half Spaces

More information

Problem Set 3 Solutions

Problem Set 3 Solutions Introducton to Algorthms October 4, 2002 Massachusetts Insttute of Technology 6046J/18410J Professors Erk Demane and Shaf Goldwasser Handout 14 Problem Set 3 Solutons (Exercses were not to be turned n,

More information

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision

SLAM 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 information

High level vs Low Level. What is a Computer Program? What does gcc do for you? Program = Instructions + Data. Basic Computer Organization

High 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 information

Parallelism for Nested Loops with Non-uniform and Flow Dependences

Parallelism 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 information

A Taste of Java and Object-Oriented Programming

A Taste of Java and Object-Oriented Programming Introducn Computer Scence Shm Schocken IDC Herzlya Lecture 1-2: Lecture 1-2: A Taste Java Object-Orented Programmng A Taste Java OO programmng, Shm Schocken, IDC Herzlya, www.ntro2cs.com slde 1 Lecture

More information

CE 221 Data Structures and Algorithms

CE 221 Data Structures and Algorithms CE 1 ata Structures and Algorthms Chapter 4: Trees BST Text: Read Wess, 4.3 Izmr Unversty of Economcs 1 The Search Tree AT Bnary Search Trees An mportant applcaton of bnary trees s n searchng. Let us assume

More information

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour 6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAX-SAT wth weghts, such that the

More information

Helsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr)

Helsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr) Helsnk Unversty Of Technology, Systems Analyss Laboratory Mat-2.08 Independent research projects n appled mathematcs (3 cr) "! #$&% Antt Laukkanen 506 R ajlaukka@cc.hut.f 2 Introducton...3 2 Multattrbute

More information

Priority queues and heaps Professors Clark F. Olson and Carol Zander

Priority queues and heaps Professors Clark F. Olson and Carol Zander Prorty queues and eaps Professors Clark F. Olson and Carol Zander Prorty queues A common abstract data type (ADT) n computer scence s te prorty queue. As you mgt expect from te name, eac tem n te prorty

More information

Virtual Memory. Background. No. 10. Virtual Memory: concept. Logical Memory Space (review) Demand Paging(1) Virtual Memory

Virtual 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 information

Lecture #15 Lecture Notes

Lecture #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 information

VRT012 User s guide V0.1. Address: Žirmūnų g. 27, Vilnius LT-09105, Phone: (370-5) , Fax: (370-5) ,

VRT012 User s guide V0.1. Address: Žirmūnų g. 27, Vilnius LT-09105, Phone: (370-5) , Fax: (370-5) , VRT012 User s gude V0.1 Thank you for purchasng our product. We hope ths user-frendly devce wll be helpful n realsng your deas and brngng comfort to your lfe. Please take few mnutes to read ths manual

More information

Computer models of motion: Iterative calculations

Computer 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 information

Sequential search. Building Java Programs Chapter 13. Sequential search. Sequential search

Sequential search. Building Java Programs Chapter 13. Sequential search. Sequential search Sequental search Buldng Java Programs Chapter 13 Searchng and Sortng sequental search: Locates a target value n an array/lst by examnng each element from start to fnsh. How many elements wll t need to

More information

Analysis of Continuous Beams in General

Analysis 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 information

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes

R 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 information

USING GRAPHING SKILLS

USING 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 information

An Optimal Algorithm for Prufer Codes *

An 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 information

Improving Low Density Parity Check Codes Over the Erasure Channel. The Nelder Mead Downhill Simplex Method. Scott Stransky

Improving Low Density Parity Check Codes Over the Erasure Channel. The Nelder Mead Downhill Simplex Method. Scott Stransky Improvng Low Densty Party Check Codes Over the Erasure Channel The Nelder Mead Downhll Smplex Method Scott Stransky Programmng n conjuncton wth: Bors Cukalovc 18.413 Fnal Project Sprng 2004 Page 1 Abstract

More information

9. BASIC programming: Control and Repetition

9. 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 information

Wightman. Mobility. Quick Reference Guide THIS SPACE INTENTIONALLY LEFT BLANK

Wightman. Mobility. Quick Reference Guide THIS SPACE INTENTIONALLY LEFT BLANK Wghtman Moblty Quck Reference Gude THIS SPACE INTENTIONALLY LEFT BLANK WIGHTMAN MOBILITY BASICS How to Set Up Your Vocemal 1. On your phone s dal screen, press and hold 1 to access your vocemal. If your

More information

Module Management Tool in Software Development Organizations

Module Management Tool in Software Development Organizations Journal of Computer Scence (5): 8-, 7 ISSN 59-66 7 Scence Publcatons Management Tool n Software Development Organzatons Ahmad A. Al-Rababah and Mohammad A. Al-Rababah Faculty of IT, Al-Ahlyyah Amman Unversty,

More information

The Codesign Challenge

The Codesign Challenge ECE 4530 Codesgn Challenge Fall 2007 Hardware/Software Codesgn The Codesgn Challenge Objectves In the codesgn challenge, your task s to accelerate a gven software reference mplementaton as fast as possble.

More information

CHARUTAR VIDYA MANDAL S SEMCOM Vallabh Vidyanagar

CHARUTAR 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 information

Sorting Review. Sorting. Comparison Sorting. CSE 680 Prof. Roger Crawfis. Assumptions

Sorting Review. Sorting. Comparison Sorting. CSE 680 Prof. Roger Crawfis. Assumptions Sortng Revew Introducton to Algorthms Qucksort CSE 680 Prof. Roger Crawfs Inserton Sort T(n) = Θ(n 2 ) In-place Merge Sort T(n) = Θ(n lg(n)) Not n-place Selecton Sort (from homework) T(n) = Θ(n 2 ) In-place

More information

Math Homotopy Theory Additional notes

Math Homotopy Theory Additional notes Math 527 - Homotopy Theory Addtonal notes Martn Frankland February 4, 2013 The category Top s not Cartesan closed. problem. In these notes, we explan how to remedy that 1 Compactly generated spaces Ths

More information

BITPLANE AG IMARISCOLOC. Operating Instructions. Manual Version 1.0 January the image revolution starts here.

BITPLANE AG IMARISCOLOC. Operating Instructions. Manual Version 1.0 January the image revolution starts here. BITPLANE AG IMARISCOLOC Operatng Instructons Manual Verson 1.0 January 2003 the mage revoluton starts here. Operatng Instructons BITPLANE AG Copyrght Ths document contans propretary nformaton protected

More information

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices Steps for Computng the Dssmlarty, Entropy, Herfndahl-Hrschman and Accessblty (Gravty wth Competton) Indces I. Dssmlarty Index Measurement: The followng formula can be used to measure the evenness between

More information

Lecture 5: Multilayer Perceptrons

Lecture 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 information

GSLM Operations Research II Fall 13/14

GSLM 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 information

CSCI 104 Sorting Algorithms. Mark Redekopp David Kempe

CSCI 104 Sorting Algorithms. Mark Redekopp David Kempe CSCI 104 Sortng Algorthms Mark Redekopp Davd Kempe Algorthm Effcency SORTING 2 Sortng If we have an unordered lst, sequental search becomes our only choce If we wll perform a lot of searches t may be benefcal

More information

Active Contours/Snakes

Active Contours/Snakes Actve Contours/Snakes Erkut Erdem Acknowledgement: The sldes are adapted from the sldes prepared by K. Grauman of Unversty of Texas at Austn Fttng: Edges vs. boundares Edges useful sgnal to ndcate occludng

More information

Introduction to Programming. Lecture 13: Container data structures. Container data structures. Topics for this lecture. A basic issue with containers

Introduction 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 information

kccvoip.com basic voip training NAT/PAT extract 2008

kccvoip.com basic voip training NAT/PAT extract 2008 kccvop.com basc vop tranng NAT/PAT extract 28 As we have seen n the prevous sldes, SIP and H2 both use addressng nsde ther packets to rely nformaton. Thnk of an envelope where we place the addresses of

More information

Outline. CIS 110: Introduction to Computer Programming. Review: Interactive Sum. More Cumulative Algorithms. Interactive Sum Trace (2)

Outline. CIS 110: Introduction to Computer Programming. Review: Interactive Sum. More Cumulative Algorithms. Interactive Sum Trace (2) Outlne CIS 110: Introducton to Computer Programmng More on Cumulatve Algorthms Processng Text Tacklng Programmng Problems Lecture 11 Text Processng and More On Desgn ( 4.2-4.3) 10/17/2011 CIS 110 (11fa)

More information

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique //00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy

More information

Circuit Analysis I (ENGR 2405) Chapter 3 Method of Analysis Nodal(KCL) and Mesh(KVL)

Circuit Analysis I (ENGR 2405) Chapter 3 Method of Analysis Nodal(KCL) and Mesh(KVL) Crcut Analyss I (ENG 405) Chapter Method of Analyss Nodal(KCL) and Mesh(KVL) Nodal Analyss If nstead of focusng on the oltages of the crcut elements, one looks at the oltages at the nodes of the crcut,

More information

Performance Evaluation of Information Retrieval Systems

Performance Evaluation of Information Retrieval Systems Why System Evaluaton? Performance Evaluaton of Informaton Retreval Systems Many sldes n ths secton are adapted from Prof. Joydeep Ghosh (UT ECE) who n turn adapted them from Prof. Dk Lee (Unv. of Scence

More information

Lecture 15: Memory Hierarchy Optimizations. I. Caches: A Quick Review II. Iteration Space & Loop Transformations III.

Lecture 15: Memory Hierarchy Optimizations. I. Caches: A Quick Review II. Iteration Space & Loop Transformations III. Lecture 15: Memory Herarchy Optmzatons I. Caches: A Quck Revew II. Iteraton Space & Loop Transformatons III. Types of Reuse ALSU 7.4.2-7.4.3, 11.2-11.5.1 15-745: Memory Herarchy Optmzatons Phllp B. Gbbons

More information

OPL: a modelling language

OPL: a modelling language OPL: a modellng language Carlo Mannno (from OPL reference manual) Unversty of Oslo, INF-MAT60 - Autumn 00 (Mathematcal optmzaton) ILOG Optmzaton Programmng Language OPL s an Optmzaton Programmng Language

More information

Exercises (Part 4) Introduction to R UCLA/CCPR. John Fox, February 2005

Exercises (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 information

Life Tables (Times) Summary. Sample StatFolio: lifetable times.sgp

Life 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 information

Course Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms

Course Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms Course Introducton Course Topcs Exams, abs, Proects A quc loo at a few algorthms 1 Advanced Data Structures and Algorthms Descrpton: We are gong to dscuss algorthm complexty analyss, algorthm desgn technques

More information

A DATA ANALYSIS CODE FOR MCNP MESH AND STANDARD TALLIES

A 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 information

A Binarization Algorithm specialized on Document Images and Photos

A 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 information

IP Camera Configuration Software Instruction Manual

IP Camera Configuration Software Instruction Manual IP Camera 9483 - Confguraton Software Instructon Manual VBD 612-4 (10.14) Dear Customer, Wth your purchase of ths IP Camera, you have chosen a qualty product manufactured by RADEMACHER. Thank you for the

More information

Chapter 6 Programmng the fnte element method Inow turn to the man subject of ths book: The mplementaton of the fnte element algorthm n computer programs. In order to make my dscusson as straghtforward

More information

FROG and TURTLE: Visual Bridges Between Files and Object-Oriented Data y

FROG and TURTLE: Visual Bridges Between Files and Object-Oriented Data y FROG and TURTLE: Vsual Brdges Between Fles and Object-Orented Data y Vashnav Anjur Yanns E. Ioannds z Mron Lvny Department of Computer Scences, Unversty of Wsconsn, Madson, WI 53706 fvash,yanns,mrong@cs.wsc.edu

More information

Nachos Project 3. Speaker: Sheng-Wei Cheng 2010/12/16

Nachos Project 3. Speaker: Sheng-Wei Cheng 2010/12/16 Nachos Project Speaker: Sheng-We Cheng //6 Agenda Motvaton User Programs n Nachos Related Nachos Code for User Programs Project Assgnment Bonus Submsson Agenda Motvaton User Programs n Nachos Related Nachos

More information

Security. Workplace Manager

Security. Workplace Manager User Gude Manageablty and Securty Workplace Manager Congratulatons on your purchase of an nnovatve product from Fujtsu. The latest nformaton about our products, tps, updates etc. can be found on the Internet

More information

User Manual SAPERION Web Client 7.1

User Manual SAPERION Web Client 7.1 User Manual SAPERION Web Clent 7.1 Copyrght 2016 Lexmark. All rghts reserved. Lexmark s a trademark of Lexmark Internatonal, Inc., regstered n the U.S. and/or other countres. All other trademarks are the

More information

CS240: Programming in C. Lecture 12: Polymorphic Sorting

CS240: Programming in C. Lecture 12: Polymorphic Sorting CS240: Programmng n C ecture 12: Polymorphc Sortng Sortng Gven a collecton of tems and a total order over them, sort the collecton under ths order. Total order: every tem s ordered wth respect to every

More information

Hierarchical clustering for gene expression data analysis

Hierarchical clustering for gene expression data analysis Herarchcal clusterng for gene expresson data analyss Gorgo Valentn e-mal: valentn@ds.unm.t Clusterng of Mcroarray Data. Clusterng of gene expresson profles (rows) => dscovery of co-regulated and functonally

More information

ETAtouch RESTful Webservices

ETAtouch RESTful Webservices ETAtouch RESTful Webservces Verson 1.1 November 8, 2012 Contents 1 Introducton 3 2 The resource /user/ap 6 2.1 HTTP GET................................... 6 2.2 HTTP POST..................................

More information

CSE 326: Data Structures Quicksort Comparison Sorting Bound

CSE 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 information

CS1100 Introduction to Programming

CS1100 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 information

5.1 The ISR: Overvieui. chapter

5.1 The ISR: Overvieui. chapter chapter 5 The LC-3 n Chapter 4, we dscussed the basc components of a computer ts memory, ts processng unt, ncludng the assocated temporary storage (usually a set of regsters), nput and output devces, and

More information

Smart Cities SESSION II: Lecture 2: The Smart City as a Communications Mechanism: Transit Movements

Smart Cities SESSION II: Lecture 2: The Smart City as a Communications Mechanism: Transit Movements Wednesday 7 October, 2015 Smart Ctes SESSION II: Lecture 2: The Smart Cty as a Communcatons Mechansm: Transt Movements Mchael Batty m.batty@ucl.ac.uk @mchaelbatty http://www.spatalcomplexty.nfo/ http://www.casa.ucl.ac.uk/

More information

CS221: Algorithms and Data Structures. Priority Queues and Heaps. Alan J. Hu (Borrowing slides from Steve Wolfman)

CS221: Algorithms and Data Structures. Priority Queues and Heaps. Alan J. Hu (Borrowing slides from Steve Wolfman) CS: Algorthms and Data Structures Prorty Queues and Heaps Alan J. Hu (Borrowng sldes from Steve Wolfman) Learnng Goals After ths unt, you should be able to: Provde examples of approprate applcatons for

More information

Enjoy this tour of Curio!

Enjoy this tour of Curio! Welcome to Curo! Clck through the dea spaces lsted n the Organzer on the left (or press ) to learn more about the most amazng app for note takng, branstormng, and creatve exploraton. About Ths Project

More information

This chapter discusses aspects of heat conduction. The equilibrium heat conduction on a rod. In this chapter, Arrays will be discussed.

This 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 information

Graphical Program Development with PECAN Program Development Systemst

Graphical Program Development with PECAN Program Development Systemst Graphcal Program Development wth PECAN Program Development Systemst Steven P. Ress Department of Computer Scence Brown Unversty Provdence, RI 02912 ABSTRACT Ths paper descrbes the user's vew of the PECAN

More information

3D vector computer graphics

3D vector computer graphics 3D vector computer graphcs Paolo Varagnolo: freelance engneer Padova Aprl 2016 Prvate Practce ----------------------------------- 1. Introducton Vector 3D model representaton n computer graphcs requres

More information

Setup and Use. For events not using AuctionMaestro Pro. Version /7/2013

Setup 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 information

Report on On-line Graph Coloring

Report 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 information

K-means and Hierarchical Clustering

K-means and Hierarchical Clustering Note to other teachers and users of these sldes. Andrew would be delghted f you found ths source materal useful n gvng your own lectures. Feel free to use these sldes verbatm, or to modfy them to ft your

More information

Analysis of 3D Cracks in an Arbitrary Geometry with Weld Residual Stress

Analysis of 3D Cracks in an Arbitrary Geometry with Weld Residual Stress Analyss of 3D Cracks n an Arbtrary Geometry wth Weld Resdual Stress Greg Thorwald, Ph.D. Ted L. Anderson, Ph.D. Structural Relablty Technology, Boulder, CO Abstract Materals contanng flaws lke nclusons

More information

Algorithm To Convert A Decimal To A Fraction

Algorithm To Convert A Decimal To A Fraction Algorthm To Convert A ecmal To A Fracton by John Kennedy Mathematcs epartment Santa Monca College 1900 Pco Blvd. Santa Monca, CA 90405 jrkennedy6@gmal.com Except for ths comment explanng that t s blank

More information

Sorting. Sorted Original. index. index

Sorting. Sorted Original. index. index 1 Unt 16 Sortng 2 Sortng Sortng requres us to move data around wthn an array Allows users to see and organze data more effcently Behnd the scenes t allows more effectve searchng of data There are MANY

More information

ANSYS FLUENT 12.1 in Workbench User s Guide

ANSYS FLUENT 12.1 in Workbench User s Guide ANSYS FLUENT 12.1 n Workbench User s Gude October 2009 Copyrght c 2009 by ANSYS, Inc. All Rghts Reserved. No part of ths document may be reproduced or otherwse used n any form wthout express wrtten permsson

More information

Verification by testing

Verification by testing Real-Tme Systems Specfcaton Implementaton System models Executon-tme analyss Verfcaton Verfcaton by testng Dad? How do they know how much weght a brdge can handle? They drve bgger and bgger trucks over

More information

CS 534: Computer Vision Model Fitting

CS 534: Computer Vision Model Fitting CS 534: Computer Vson Model Fttng Sprng 004 Ahmed Elgammal Dept of Computer Scence CS 534 Model Fttng - 1 Outlnes Model fttng s mportant Least-squares fttng Maxmum lkelhood estmaton MAP estmaton Robust

More information

ECONOMICS 452* -- Stata 12 Tutorial 6. Stata 12 Tutorial 6. TOPIC: Representing Multi-Category Categorical Variables with Dummy Variable Regressors

ECONOMICS 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 information

Setup and Use. Version 3.7 2/1/2014

Setup 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 information

Cache Memories. Lecture 14 Cache Memories. Inserting an L1 Cache Between the CPU and Main Memory. General Org of a Cache Memory

Cache Memories. Lecture 14 Cache Memories. Inserting an L1 Cache Between the CPU and Main Memory. General Org of a Cache Memory Topcs Lecture 4 Cache Memores Generc cache memory organzaton Drect mapped caches Set assocate caches Impact of caches on performance Cache Memores Cache memores are small, fast SRAM-based memores managed

More information

User Manual SAPERION Rich Client 7.1

User Manual SAPERION Rich Client 7.1 User Manual SAPERION Rch Clent 7.1 Copyrght 2016 Lexmark. All rghts reserved. Lexmark s a trademark of Lexmark Internatonal, Inc., regstered n the U.S. and/or other countres. All other trademarks are the

More information

Array transposition in CUDA shared memory

Array 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 information