RESISTIVE CIRCUITS MULTI NODE/LOOP CIRCUIT ANALYSIS
|
|
- Oliver Anderson
- 6 years ago
- Views:
Transcription
1 RESSTE CRCUTS MULT NODE/LOOP CRCUT ANALYSS
2 DEFNNG THE REFERENCE NODE S TAL 4 THESTATEMENT 4 S MEANNGLES UNTL THE REFERENCE PONT S DEFNED BY CONENTON THE GROUND SYMBOL SPECFES THE REFERENCE PONT. ALL NODE OLTAGES ARE MEASURED WTH RESPECT TO THAT REFERENCE PONT?
3 THE STRATEGY FOR NODE ANALYSS S a b c. DENTFY ALL NODES AND SELECT A REFERENCE NODE. DENTFY KNOWN NODE a : a s a a b 9k 6k b : 4 5 b a b b c k 4k c : 6 c b c 9k k 5 REFERENCE. AT EACH NODE WTH UNKNOWN OLTAGE WRTE A KCL EQUATON (e.g.,sum OF CURRENT LEANG ) 4. REPLACE CURRENTS N TERMS OF NODE OLTAGES AND GET ALGEBRAC EQUATONS N THE NODE OLTAGES... SHORTCUT: SKP WRTNG THESE EQUATONS... AND PRACTCE WRTNG THESE DRECTLY
4 EXAMPLE WRTE THE KCL NODE WE SUALZE THE CURRENTS LEANG AND WRTE THE KCL EQUATON REPEAT THE PROCESS AT NODE i v v v v R4 R OR SUALZE CURRENTS GONG NTO NODE
5 6mA Node : ma 6mA 6 : 6mA 6k k N MOST CASES THERE ARE SEERAL DFFERENT WAYS OF SOLNG A PROBLEM 8mA k (6 ma) ma k 6k 6k (6 ma) 4mA k 6k NODE EQS. BY NSPECTON k ( ) ( 6)mA 6k k ( ) 6 ma Once node voltages are known k 6k k CURRENTS COULD BE COMPUTED DRECTLY USNG KCL AND CURRENT DDER!!
6 nodes plus the reference. n principle one needs equations... but two nodes are connected to the reference through voltage sources. Hence those node voltages are known!!! Hint: Each voltage source connected to the reference node saves one node equation Only one KCL is necessary 6k k [ ] k 4 THESE ARE THE REMANNG TWO NODE EQUATONS 6[ ] SOLNG THE EQUATONS ( ) 6[ ] (.5[ ] )
7 THE SUPERNODE TECHNQUE SUPERNODE S Conventional analysis requires all currents at a node 4 ma S S k eqs, unknowns...panic!! The current through the source is not related to the voltage of the source Math solution: add one equation 6[ ] Efficient solution: enclose the source, and all elements in parallel, inside a surface. Apply KCL to the surface!!! 4mA 6k k 6 ma The source current is interior to the surface and is not required We STLL need one more equation 6[ ] Only eqs in two unknowns!!!
8 ALGEBRAC DETALS The Equations () () Solution 6mA 6k k 6[ ] 4mA. Eliminate denominators in Eq(). Multiply by... 4[ ] 6[ ]. Add equations to eliminate [ ] [ ]. Use Eq() to compute 6[ ] 4[ ]
9 Find alue of O SUPERNODE 4 6 SOURCES CONNECTED TO THE REFERENCE 4 CONSTRANT EQUATON SUPERNODE 6 k S NOT NEEDED FOR O ( 4) k k k * / k * / and add 5 8 OHM'S LAW O. 8mA k
10 Apply node analysis to this circuit - R R R R R - 8 There are 4 non reference nodes There is one super node There is one node connected to the reference through a voltage source We need three equations to compute all node voltages R BUT THERE S ONLY ONE CURRENT FLOWNG THROUGH ALL COMPONENTS AND F THAT CURRENT S DETERMNED ALL OLTAGES CAN BE COMPUTED WTH OHM S LAW STRATEGY:. Apply KL (sum of voltage drops ). Use Ohm s Law to express voltages in terms of the loop current. [ ] 8[ ] R R R [ ] R R 8[ ] R RESULT S ONE EQUATON N THE LOOP CURRENT!!! SHORTCUT 4 Skip this equation Write this one directly
11 LOOPS, MESHES AND LOOP CURRENTS a b 7 c f 6 e 5 d A BASC CRCUT EACH COMPONENT S CHARACTERZED BY TS OLTAGE ACROSS AND TS CURRENT THROUGH A LOOP S A CLOSED PATH THAT DOES NOT GO TWCE OER ANY NODE. THS CRCUT HAS THREE LOOPS fabef ebcde 4 fabcdef A MESH S A LOOP THAT DOES NOT ENCLOSE ANY OTHER LOOP. fabef, ebcde ARE MESHES A LOOP CURRENT S A (FCTCOUS) CURRENT THAT S ASSUMED TO FLOW AROUND A LOOP,, ARE LOOP CURRENTS A MESH CURRENT S A LOOP CURRENT ASSOCATED TO A MESH., ARE MESH CURRENTS CLAM: N A CRCUT, THE CURRENT THROUGH ANY COMPONENT CAN BE EXPRESSED N TERMS OF THE LOOP CURRENTS EXAMPLES FACT: NOT EERY LOOP CURRENT S REQURED TO COMPUTE ALL THE CURRENTS THROUGH COMPONENTS a a f b e b c b 7 c 4 f 6 e 5 d A BASC CRCUT THE DRECTON OF THE LOOP CURRENTS S SGNFCANT USNG TWO LOOP CURRENTS a f be bc FOR EERY CRCUT THERE S A MNMUM NUMBER OF LOOP CURRENTS THAT ARE NECESSARY TO COMPUTE EERY CURRENT N THE CRCUT. SUCH A COLLECTON S CALLED A MNMAL SET (OF LOOP CURRENTS).
12 FOR A GEN CRCUT LET B NUMBER OF BRANCHES N NUMBER OF NODES THE MNMUM REQURED NUMBER OF LOOP CURRENTS S L B ( N ) MESH CURRENTS ARE ALWAYS NDEPENDENT AN EXAMPLE DETERMNATON OF LOOP CURRENTS KL ON LEFT MESH KL ON RGHT MESH v v v v S 4 5 USNG OHM S LAW v i R, v i R, v ( i i ) R v i R, v i R REPLACNG AND REARRANGNG B 7 N 6 L 7 (6 ) TWO LOOP CURRENTS ARE REQURED. THE CURRENTS SHOWN ARE MESH CURRENTS. HENCE THEY ARE NDEPENDENT AND FORM A MNMAL SET
13 DEELOPNG A SHORTCUT WRTE THE MESH EQUATONS - R - R R WHENEER AN ELEMENT HAS MORE THAN ONE LOOP CURRENT FLOWNG THROUGH T WE COMPUTE NET CURRENT N THE DRECTON OF TRAEL R 5 R 4 DRAW THE MESH CURRENTS. ORENTATON CAN BE ARBTRARY. BUT BY CONENTON THEY ARE DEFNED CLOCKWSE NOW WRTE KL FOR EACH MESH AND APPLY OHM S LAW TO EERY RESSTOR. AT EACH LOOP FOLLOW THE PASSE SGN CONENTON USNG LOOP CURRENT REFERENCE DRECTON R ( ) R R5 R R4 ( ) R
14 EXAMPLE: FND o AN ALTERNATE SELECTON OF LOOP CURRENTS SHORTCUT: POLARTES ARE NOT NEEDED. APPLY OHM S LAW TO EACH ELEMENT AS KL S BENG WRTTEN REARRANGE k 6k 6k 9k * / and add k 6. 5mA 5 k 6k ma 4 EXPRESS ARABLE OF NTEREST AS FUNCTON OF LOOP CURRENTS O NOW O REARRANGE THS SELECTON S MORE EFFCENT k 6k * / 6k 9k 9 * / and substract 4k 8 ma 4
15 . DRAW THE MESH CURRENTS. WRTE MESH EQUATONS MESH k 4k k) k [ ] ( k (k 6k) (6 MESH ) DDE BY k. GET NUMBERS FOR COEFFCENTS ON THE LEFT AND ma ON THE RHS. SOLE EQUATONS 8 [ ma] 8 9[ ma] * / 4 and add [ ma] O 6k [ ] 5
16 KL THERE S NO RELATONSHP BETWEEN AND THE SOURCE CURRENT! HOWEER... MESH CURRENT S CONSTRANED MESH EQUATON MESH ma BY NSPECTON k 8k k (ma) ma O 6k 8k 4 9 [ ] CURRENT SOURCES THAT ARE NOT SHARED BY OTHER MESHES (OR LOOPS) SERE TO DEFNE A MESH (LOOP) CURRENT AND REDUCE THE NUMBER OF REQURED EQUATONS TO OBTAN APPLY KL TO ANY CLOSED PATH THAT NCLUDES
17 CURRENT SOURCES SHARED BY LOOPS - THE SUPERMESH APPROACH. WRTE CONSTRANT EQUATON DUE TO MESH CURRENTS SHARNG CURRENT SOURCES 4mA. WRTE EQUATONS FOR THE OTHER MESHES ma 4. DEFNE A SUPERMESH BY (MENTALLY) REMONG THE SHARED CURRENT SOURCE. SELECT MESH CURRENTS 5. WRTE KL FOR THE SUPERMESH 6 k k k( ) k ( ) SUPERMESH NOW WE HAE THREE EQUATONS N THREE UNKNOWNS. THE MODEL S COMPLETE
18 FND OLTAGES R 4 R S S 4 R ACROSS S R RESSTORS For loop analysis we notice... - S Three independent current sources. Four meshes. One current source shared by two meshes. Careful choice of loop currents should make only one loop equation necessary. Three loop currents can be chosen using meshes and not sharing any source. 4 Now we need a loop current that does not go over any current source and passes through all unused components. HNT: F ALL CURRENT SOURCES ARE REMOED THERE S ONLY ONE LOOP LEFT S SOLE FOR THE CURRENT 4. USE OHM S LAW TO CMPUTE REQURED OLTAGES MESH EQUATONS FOR LOOPS WTH CURRENT SOURCES s S S KL OF REMANNG LOOP R ( 4 ) R ( 4 ) R4 ( 4 ) R ( 4 ) R ( ) R ( 4 )
LOOP ANALYSIS. determine all currents and Voltages in IT IS DUAL TO NODE ANALYSIS - IT FIRST DETERMINES ALL CURRENTS IN A CIRCUIT
LOOP ANALYSS The second systematic technique to determine all currents and oltages 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 NECESSARY
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 informationBFF1303: ELECTRICAL / ELECTRONICS ENGINEERING. Direct Current Circuits : Methods of Analysis
BFF1303: ELECTRICAL / ELECTRONICS ENGINEERING Drect Current Crcuts : Methods of Analyss Ismal Mohd Kharuddn, Zulkfl Md Yusof Faculty of Manufacturng Engneerng Unerst Malaysa Pahang Drect Current Crcut
More informationCircuit 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 informationNODAL AND LOOP ANALYSIS TECHNIQUES. Develop systematic techniques to determine all the voltages and currents in a circuit NODE ANALYSIS
NODAL AND LOOP ANALYSS TECHNQUES LEANNG GOALS NODAL ANALYSS LOOP ANALYSS Develop systematic techniques to determine all the voltages and currents in a circuit NODE ANALYSS One of the systematic ways to
More informationELECTRICAL CIRCUIT AND MACHINE ENT 249/3. Methods of Analysis
ELECTRICAL CIRCUIT AND MACHINE ENT 49/ Methods of Analysis Introduction Nodal Analysis KCL & Ohm s Law Nodal Analysis with Voltage Sources (Supernode) KCL, Ohm s & KVL Law Mesh Analysis - KVL & Ohm s Law
More informationi v v 6 i 2 i 3 v + (1) (2) (3) (4) (5) Substituting (4) and (5) into (3) (6) = 2 (7) (5) and (6) (8) (4) and (6) ˆ
5V 6 v 6 î v v Ω î Ω v v 8Ω V î v 5 6Ω 5 Mesh : 6ˆ ˆ = Mesh : ˆ 8ˆ = Mesh : ˆ ˆ ˆ 8 0 = 5 Solvng ˆ ˆ ˆ from () = Solvng ˆ ˆ ˆ from () = 7 7 Substtutng () and (5) nto () (5) and (6) 9 ˆ = A 8 ˆ = A 0 ()
More informationNODAL AND LOOP ANALYSIS TECHNIQUES
NODAL AND LOOP ANALYSIS TECHNIQUES LEANING GOALS NODAL ANALYSIS LOOP ANALYSIS Deelop systematic techniques to determine all the oltages and currents in a circuit NODE ANALYSIS One of the systematic ways
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 informationNUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS
ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana
More informationMesh and Node Equations: Circuits Containing Dependent Sources
Mesh nd Node Equtons: Crcuts Contnng Dependent Sources Introducton The crcuts n ths set of problems re smll crcuts tht contn sngle dependent source. These crcuts cn be nlyzed usng mesh equton or usng node
More informationHermite Splines in Lie Groups as Products of Geodesics
Hermte Splnes n Le Groups as Products of Geodescs Ethan Eade Updated May 28, 2017 1 Introducton 1.1 Goal Ths document defnes a curve n the Le group G parametrzed by tme and by structural parameters n the
More informationThe 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 informationkccvoip.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 informationREFRACTION. a. To study the refraction of light from plane surfaces. b. To determine the index of refraction for Acrylic and Water.
Purpose Theory REFRACTION a. To study the refracton of lght from plane surfaces. b. To determne the ndex of refracton for Acrylc and Water. When a ray of lght passes from one medum nto another one of dfferent
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 informationThe mesh-current method
The mesh-current method Equivalent resistance Voltage / current dividers Source transformations Node voltages Mesh currents Superposition Mirror image of the node-voltage method. Define mesh currents flowing
More informationLobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide
Lobachevsky State Unversty of Nzhn Novgorod Polyhedron Quck Start Gude Nzhn Novgorod 2016 Contents Specfcaton of Polyhedron software... 3 Theoretcal background... 4 1. Interface of Polyhedron... 6 1.1.
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 informationCS240: 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 information5.0 Quality Assurance
5.0 Dr. Fred Omega Garces Analytcal Chemstry 25 Natural Scence, Mramar College Bascs of s what we do to get the rght answer for our purpose QA s planned and refers to planned and systematc producton processes
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 information2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements
Module 3: Element Propertes Lecture : Lagrange and Serendpty Elements 5 In last lecture note, the nterpolaton functons are derved on the bass of assumed polynomal from Pascal s trangle for the fled varable.
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 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 informationCourse 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 informationMethod of analysis. Bởi: Sy Hien Dinh
Method of analysis Bởi: Sy Hien Dinh INTRODUCTION Having understood the fundamental laws of circuit theory (Ohm s law and Kirchhhoff s laws), we are now prepared to apply to develop two powerful techniques
More informationAP PHYSICS B 2008 SCORING GUIDELINES
AP PHYSICS B 2008 SCORING GUIDELINES General Notes About 2008 AP Physcs Scorng Gudelnes 1. The solutons contan the most common method of solvng the free-response questons and the allocaton of ponts for
More informationCHAPTER 2 DECOMPOSITION OF GRAPHS
CHAPTER DECOMPOSITION OF GRAPHS. INTRODUCTION A graph H s called a Supersubdvson of a graph G f H s obtaned from G by replacng every edge uv of G by a bpartte graph,m (m may vary for each edge by dentfyng
More informationLearning the Kernel Parameters in Kernel Minimum Distance Classifier
Learnng the Kernel Parameters n Kernel Mnmum Dstance Classfer Daoqang Zhang 1,, Songcan Chen and Zh-Hua Zhou 1* 1 Natonal Laboratory for Novel Software Technology Nanjng Unversty, Nanjng 193, Chna Department
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 informationRange images. Range image registration. Examples of sampling patterns. Range images and range surfaces
Range mages For many structured lght scanners, the range data forms a hghly regular pattern known as a range mage. he samplng pattern s determned by the specfc scanner. Range mage regstraton 1 Examples
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 informationCompiler 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 informationStorage Binding in RTL synthesis
Storage Bndng n RTL synthess Pe Zhang Danel D. Gajsk Techncal Report ICS-0-37 August 0th, 200 Center for Embedded Computer Systems Department of Informaton and Computer Scence Unersty of Calforna, Irne
More informationK-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 informationImage Representation & Visualization Basic Imaging Algorithms Shape Representation and Analysis. outline
mage Vsualzaton mage Vsualzaton mage Representaton & Vsualzaton Basc magng Algorthms Shape Representaton and Analyss outlne mage Representaton & Vsualzaton Basc magng Algorthms Shape Representaton and
More informationChapter 3 Methods of Analysis: 2) Mesh Analysis
Chapter 3 Methods of Analysis: 2) Mesh Analysis Dr. Waleed Al-Hanafy waleed alhanafy@yahoo.com Faculty of Electronic Engineering, Menoufia Univ., Egypt MSA Summer Course: Electric Circuit Analysis I (ESE
More informationModule 6: FEM for Plates and Shells Lecture 6: Finite Element Analysis of Shell
Module 6: FEM for Plates and Shells Lecture 6: Fnte Element Analyss of Shell 3 6.6. Introducton A shell s a curved surface, whch by vrtue of ther shape can wthstand both membrane and bendng forces. A shell
More informationA mathematical programming approach to the analysis, design and scheduling of offshore oilfields
17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 A mathematcal programmng approach to the analyss, desgn and
More informationBiclique Cryptanalysis Of PRESENT, LED, And KLEIN
Bclque Cryptanalyss Of PREENT, LED, And KLEIN Reson 2013-05-20 Farzaneh Abed, Chrstan Forler, Ek Lst, tefan Lucks, Jakob Wenzel Bauhaus-Unerstät Wemar, Germany {frstname.lastname}@un-wemar.de Abstract.
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 informationData Representation in Digital Design, a Single Conversion Equation and a Formal Languages Approach
Data Representaton n Dgtal Desgn, a Sngle Converson Equaton and a Formal Languages Approach Hassan Farhat Unversty of Nebraska at Omaha Abstract- In the study of data representaton n dgtal desgn and computer
More informationCache 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 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 informationProper Choice of Data Used for the Estimation of Datum Transformation Parameters
Proper Choce of Data Used for the Estmaton of Datum Transformaton Parameters Hakan S. KUTOGLU, Turkey Key words: Coordnate systems; transformaton; estmaton, relablty. SUMMARY Advances n technologes and
More informationObject-Based Techniques for Image Retrieval
54 Zhang, Gao, & Luo Chapter VII Object-Based Technques for Image Retreval Y. J. Zhang, Tsnghua Unversty, Chna Y. Y. Gao, Tsnghua Unversty, Chna Y. Luo, Tsnghua Unversty, Chna ABSTRACT To overcome the
More informationOutline. Third Programming Project Two-Dimensional Arrays. Files You Can Download. Exercise 8 Linear Regression. General Regression
Project 3 Two-densonal arras Ma 9, 6 Thrd Prograng Project Two-Densonal Arras Larr Caretto Coputer Scence 6 Coputng n Engneerng and Scence Ma 9, 6 Outlne Quz three on Thursda for full lab perod See saple
More informationHybrid Non-Blind Color Image Watermarking
Hybrd Non-Blnd Color Image Watermarkng Ms C.N.Sujatha 1, Dr. P. Satyanarayana 2 1 Assocate Professor, Dept. of ECE, SNIST, Yamnampet, Ghatkesar Hyderabad-501301, Telangana 2 Professor, Dept. of ECE, AITS,
More informationSubspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;
Subspace clusterng Clusterng Fundamental to all clusterng technques s the choce of dstance measure between data ponts; D q ( ) ( ) 2 x x = x x, j k = 1 k jk Squared Eucldean dstance Assumpton: All features
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 informationSequential 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 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 informationAMath 483/583 Lecture 21 May 13, Notes: Notes: Jacobi iteration. Notes: Jacobi with OpenMP coarse grain
AMath 483/583 Lecture 21 May 13, 2011 Today: OpenMP and MPI versons of Jacob teraton Gauss-Sedel and SOR teratve methods Next week: More MPI Debuggng and totalvew GPU computng Read: Class notes and references
More informationOptimization Methods: Integer Programming Integer Linear Programming 1. Module 7 Lecture Notes 1. Integer Linear Programming
Optzaton Methods: Integer Prograng Integer Lnear Prograng Module Lecture Notes Integer Lnear Prograng Introducton In all the prevous lectures n lnear prograng dscussed so far, the desgn varables consdered
More informationSolitary and Traveling Wave Solutions to a Model. of Long Range Diffusion Involving Flux with. Stability Analysis
Internatonal Mathematcal Forum, Vol. 6,, no. 7, 8 Soltary and Travelng Wave Solutons to a Model of Long Range ffuson Involvng Flux wth Stablty Analyss Manar A. Al-Qudah Math epartment, Rabgh Faculty of
More informationAnalysis 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 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 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 Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices
Internatonal Mathematcal Forum, Vol 7, 2012, no 52, 2549-2554 An Applcaton of the Dulmage-Mendelsohn Decomposton to Sparse Null Space Bases of Full Row Rank Matrces Mostafa Khorramzadeh Department of Mathematcal
More informationFitting & Matching. Lecture 4 Prof. Bregler. Slides from: S. Lazebnik, S. Seitz, M. Pollefeys, A. Effros.
Fttng & Matchng Lecture 4 Prof. Bregler Sldes from: S. Lazebnk, S. Setz, M. Pollefeys, A. Effros. How do we buld panorama? We need to match (algn) mages Matchng wth Features Detect feature ponts n both
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 informationNew Extensions of the 3-Simplex for Exterior Orientation
New Extensons of the 3-Smplex for Exteror Orentaton John M. Stenbs Tyrone L. Vncent Wllam A. Hoff Colorado School of Mnes jstenbs@gmal.com tvncent@mnes.edu whoff@mnes.edu Abstract Object pose may be determned
More informationChapter 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 informationA fault tree analysis strategy using binary decision diagrams
Loughborough Unversty Insttutonal Repostory A fault tree analyss strategy usng bnary decson dagrams Ths tem was submtted to Loughborough Unversty's Insttutonal Repostory by the/an author. Addtonal Informaton:
More informationSum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints
Australan Journal of Basc and Appled Scences, 2(4): 1204-1208, 2008 ISSN 1991-8178 Sum of Lnear and Fractonal Multobjectve Programmng Problem under Fuzzy Rules Constrants 1 2 Sanjay Jan and Kalash Lachhwan
More informationGiving credit where credit is due
CSCE 23J Computer Organzaton Cache Memores Dr. Stee Goddard goddard@cse.unl.edu Gng credt where credt s due Most of sldes for ths lecture are based on sldes created by Drs. Bryant and O Hallaron, Carnege
More informationIntroduction to Geometrical Optics - a 2D ray tracing Excel model for spherical mirrors - Part 2
Introducton to Geometrcal Optcs - a D ra tracng Ecel model for sphercal mrrors - Part b George ungu - Ths s a tutoral eplanng the creaton of an eact D ra tracng model for both sphercal concave and sphercal
More informationRELATIVE ORIENTATION ESTIMATION OF VIDEO STREAMS FROM A SINGLE PAN-TILT-ZOOM CAMERA. Commission I, WG I/5
RELATIVE ORIENTATION ESTIMATION OF VIDEO STREAMS FROM A SINGLE PAN-TILT-ZOOM CAMERA Taeyoon Lee a, *, Taeung Km a, Gunho Sohn b, James Elder a a Department of Geonformatc Engneerng, Inha Unersty, 253 Yonghyun-dong,
More informationSupport Vector Machines. CS534 - Machine Learning
Support Vector Machnes CS534 - Machne Learnng Perceptron Revsted: Lnear Separators Bnar classfcaton can be veed as the task of separatng classes n feature space: b > 0 b 0 b < 0 f() sgn( b) Lnear Separators
More informationSolving two-person zero-sum game by Matlab
Appled Mechancs and Materals Onlne: 2011-02-02 ISSN: 1662-7482, Vols. 50-51, pp 262-265 do:10.4028/www.scentfc.net/amm.50-51.262 2011 Trans Tech Publcatons, Swtzerland Solvng two-person zero-sum game by
More informationLecture 3. ELECTRICAL ENGINEERING: PRINCIPLES AND APPLICATIONS, Fourth Edition, by Allan R. Hambley, 2008 Pearson Education, Inc.
Lecture 3 Circuit i Laws, Voltage & Current Dividers ELECTICAL ENGINEEING: PINCIPLES AND APPLICATIONS, Fourth Edition, by Allan. Hambley, 008 Pearson Education, Inc. KICHHOFF S CUENT LAW The net current
More informationSolving Route Planning Using Euler Path Transform
Solvng Route Plannng Usng Euler Path ransform Y-Chong Zeng Insttute of Informaton Scence Academa Snca awan ychongzeng@s.snca.edu.tw Abstract hs paper presents a method to solve route plannng problem n
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 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 informationSmoothing Spline ANOVA for variable screening
Smoothng Splne ANOVA for varable screenng a useful tool for metamodels tranng and mult-objectve optmzaton L. Rcco, E. Rgon, A. Turco Outlne RSM Introducton Possble couplng Test case MOO MOO wth Game Theory
More informationCluster Analysis of Electrical Behavior
Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School
More informationReading. 14. Subdivision curves. Recommended:
eadng ecommended: Stollntz, Deose, and Salesn. Wavelets for Computer Graphcs: heory and Applcatons, 996, secton 6.-6., A.5. 4. Subdvson curves Note: there s an error n Stollntz, et al., secton A.5. Equaton
More informationCE 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 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 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 information6.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 informationThe 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 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 informationNachos 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 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 informationQuality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation
Intellgent Informaton Management, 013, 5, 191-195 Publshed Onlne November 013 (http://www.scrp.org/journal/m) http://dx.do.org/10.36/m.013.5601 Qualty Improvement Algorthm for Tetrahedral Mesh Based on
More informationCHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION
24 CHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION The present chapter proposes an IPSO approach for multprocessor task schedulng problem wth two classfcatons, namely, statc ndependent tasks and
More informationIntra-Parametric Analysis of a Fuzzy MOLP
Intra-Parametrc Analyss of a Fuzzy MOLP a MIAO-LING WANG a Department of Industral Engneerng and Management a Mnghsn Insttute of Technology and Hsnchu Tawan, ROC b HSIAO-FAN WANG b Insttute of Industral
More information3D 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 informationA New Approach For the Ranking of Fuzzy Sets With Different Heights
New pproach For the ankng of Fuzzy Sets Wth Dfferent Heghts Pushpnder Sngh School of Mathematcs Computer pplcatons Thapar Unversty, Patala-7 00 Inda pushpndersnl@gmalcom STCT ankng of fuzzy sets plays
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 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 informationA Flexible Technique for Accurate Omnidirectional Camera Calibration and Structure from Motion
A Flexble Technque for Accurate Omndrectonal Camera Calbraton and Structure from Moton Dade Scaramuzza, Agostno Martnell, Roland Segwart Swss Federal Insttute of Technology Lausanne (EPFL) CH-5 Lausanne,
More informationDynamic Programming. Example - multi-stage graph. sink. source. Data Structures &Algorithms II
Dynamc Programmng Example - mult-stage graph 1 source 9 7 3 2 2 3 4 5 7 11 4 11 8 2 2 1 6 7 8 4 6 3 5 6 5 9 10 11 2 4 5 12 snk Data Structures &Algorthms II A labeled, drected graph Vertces can be parttoned
More informationLossless Compression of Map Contours by Context Tree Modeling of Chain Codes
Lossless Compresson of Map Contours by Context Tree Modelng of Chan Codes Alexander Akmo, Alexander Kolesnko, and Pas Fränt Department of Computer Scence, Unersty of Joensuu, P.O. Box 111, 80110 Joensuu,
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 informationHierarchical 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 informationsuch that is accepted of states in , where Finite Automata Lecture 2-1: Regular Languages be an FA. A string is the transition function,
* Lecture - Regular Languages S Lecture - Fnte Automata where A fnte automaton s a -tuple s a fnte set called the states s a fnte set called the alphabet s the transton functon s the ntal state s the set
More informationKent State University CS 4/ Design and Analysis of Algorithms. Dept. of Math & Computer Science LECT-16. Dynamic Programming
CS 4/560 Desgn and Analyss of Algorthms Kent State Unversty Dept. of Math & Computer Scence LECT-6 Dynamc Programmng 2 Dynamc Programmng Dynamc Programmng, lke the dvde-and-conquer method, solves problems
More information