Xilinx V H D L. Design with VHDL(1) Agenda. Basic Rule for VHDL Coding. Simple Gate Logic (1) Simple Gate Logic (2) Basic Rule for VHDL Coding
|
|
- Morgan Morton
- 5 years ago
- Views:
Transcription
1 gen Xilinx V H L esign with VHL ( Comintionl Logi ) L 1 esign with VHL ( Sequentil Logi ) Presente L 2 esign with VHL ( Hierh esign, esign Flow ) si Rule for VHL Coing si Rule for VHL Coing esign with VHL(1) (Comintionl Logi) ; (Line ), Spe ( Line Chnge, Tp ) Reserve Wor User efine Nme Sntx Pttern Comment -- Line Comment Line Line -- Tpe Simple Gte Logi (1) Simple Gte Logi (2) VHL Coe for Simple Gte (1) VHL Coe for Simple Gte (2) entit n2 is : in st_logi; : in st_logi; : out st_logi en n2; rhiteture _n of n2 is Gte entit gte is, : in st_logi;, : in st_logi; : out st_logi en gte; rhiteture _g of gte is Gte <= n ; <= n or n ; en _n; en _g; -- Logi Opertor : N OR NOT NOR NN XOR -- Coe Logi igrm?
2 Simple Gte Logi (3) Simple Gte Logi (4) VHL Coe for Simple Gte (3) Signl efine entit gte is,,, : in st_logi; : out st_logi en gte; rhiteture _g of gte is <= ( n ) or ( n not en _g; -- Not Logi Opertor -- Gte entit gte is,,, : in st_logi; : out st_logi en gte; rhiteture _g of gte is signl e,f : st_logi; e <= n ; f <= n ; <= e or f; en _g; -- Signl Entit Noe Gte eoer Logi (1) eoer Logi (2) eoer with Gte Comintion Truth Tle eoer Coe C Y eoer eoer with Gte Comintion entit e is,,, : in st_logi; : out st_logi en e; rhiteture _e of e is signl v3,v4,v6,v : st_logi; v3 <= (not ) n (not ) n n ; v4 <= (not ) n n (not ) n (not v6 <= (not ) n n n (not v <= n (not ) n n (not <= v3 or v4 or v6 or v; en _e; eo eoer Logi (3) eoer Logi (4) eoer with ehviorl Coe(1) entit e is,,, : in st_logi; : out st_logi en e; rhiteture _e of e is signl in : st_logi_vetor(3 ownto 0 signl v3,v4,v6,v : st_logi; in <= & & & ; v3 <= 1 when in = 0011 else 0 ; v4 <= 1 when in = 0100 else 0 ; v6 <= 1 when in = 0110 else 0 ; v <= 1 when in = 1010 else 0 ; <= v3 or v4 or v6 or v; en _e; eo eoer with ehviorl Coe(2) entit e is,,, : in st_logi; : out st_logi en e; rhiteture _e of e is signl in : st_logi_vetor(3 ownto 0 -- signl v3,v4,v6,v : st_logi; in <= & & & ; <= 1 when in = 0011 else 1 when in = 0100 else 1 when in = 0110 else 1 when in = 1010 else 0 ; en _e; eo
3 eoer Logi (5) Multiplexer Logi (1) eoer with ehviorl Coe(3) entit e is,,, : in st_logi; : out st_logi en e; rhiteture _e of e is signl in : st_logi_vetor(3 ownto 0 eo 2 to 1 Multiplexer 2 to 1 mux Gte Coe sel 2 to 1 mux ehviorl Coe I0 I1 Mux in <= & & & ; <= 1 when (in = 0011 ) or (in = 0100 ) or (in = 0110 ) or (in = 1010 ) else 0 ; en _e; Multiplexer Logi (2) Multiplexer Logi (3) 2 to 1 Multiplexer (Gte Comintion) 2 to 1 Multiplexer (ehviorl) entit mux2 is i0,i1 : in st_logi; sel : in st_logi; : out st_logi en mux2; rhiteture gte_mux2 of mux2 is sel I0 I1 Mux entit mux2 is i0,i1 : in st_logi; sel : in st_logi; : out st_logi en mux2; rhiteture ehve_mux2 of mux2 is sel I0 I1 Mux <= (i0 n not sel) or (i1 n sel <= i0 when sel = 0 else i1; en gte_mux2; en ehve_mux2; Multiplexer Logi (4) Multiplexer Logi (5) 4 to 1 Multiplexer (1) 4 to 1 Multiplexer (2) entit mux4 is i0,i1,i2,i3 : in st_logi; sel : in st_logi_vetor(1 ownto 0 : out st_logi en mux4; sel I0 I1 rhiteture ehve_mux4 of mux4 is <= en ehve_mux4; i0 when sel = 00 else i1 when sel = 01 else i2 when sel = 10 else i3 when sel = 11 else 0 ; 2 Mux I2 I3 entit mux4 is i0,i1,i2,i3 : in st_logi; sel : in st_logi_vetor(1 ownto 0 : out st_logi en mux4; sel I0 I1 rhiteture ehve_mux4 of mux4 is with sel selet <= i0 when 00, i1 when 01, 2 i2 when 10, i3 when 11, 0 when others; en ehve_mux4; Mux I2 I3
4 Multiplxer Logi(6) Comprtor Logi (1) - 4 to 1 Multiplexer Comprtor Smol Coe I3 I2 I1 I0 Z I0 I1 I2 I3 Sel Y Output = E, G, L Input = [3:0], [3:0] E G L = > < Comp E G L <when else> <with selet when> VHL Reltionl Opertor : =, /=, <, <=, >, >= Comprtor Comprtor Logi (2) entit omp is, : in st_logi_vetor(3 ownto 0 eq,g,l : out st_logi en omp; rhiteture _omp of omp is eq <= 1 when = else 0 ; g <= 1 when > else 0 ; l <= 1 when < else 0 ; en _omp; Comp E G L Constnt Comprtor Comprtor Logi (3) Single Input Constnt 0100 Comprtor 0100 Comp E G L? Comp with 0100 E G L rithmeti Opertor (1) rithmeti Opertor (2) rithmeti Opertor (1) rithmeti Opertor (2) use ieeest_logi_unsignell; entit er is, : in st_logi_vetor(3 ownto 0 : out st_logi_vetor(3 ownto 0) en er; rhiteture _er of er is <= + ; en _er; -- rithemti Opertors : +, -, *, /, ** er Y -- Coe rhiteture use ieeest_logi_unsignell; entit er is,,, : in st_logi_vetor(3 ownto 0 : out st_logi_vetor(3 ownto 0) er en er; rhiteture _er of er is <= ; C en _er; Y
5 rithmeti Opertor (3) rithmeti Opertor (4) rithmeti Opertor (3) rithmeti Opertor (4) -- Coe rhiteture -- Overflow use ieeest_logi_unsignell; use ieeest_logi_unsignell; entit er is,,, : in st_logi_vetor(3 ownto 0 : out st_logi_vetor(3 ownto 0) en er; rhiteture _er of er is <= ( + ) + ( + C en _er; er Y entit er is, : in st_logi_vetor(3 ownto 0 : out st_logi_vetor(4 ownto 0) en er; rhiteture _er of er is <= ( 0 & ) + ( 0 & en _er; er Y Comintionl Logi Summr Snthesis Logi Opertor rithmeti Opertor Reltionl Opertor Contention us < it iretion > when < > else with < > selet < > when RTL Snthesis : Single Cle Hr Wre rhiteture esign Mnul ( + + C + ) vs ( + ) + (C + ) Snthesis Tool Snthesis Tool? FF rhiteture esign with VHL(2) (Sequentil Logi ) - Sequentil Logi Proess - if then else -lok entit FF is, : in st_logi; : in st_logi; : out st_logi en entit FF ; rhiteture ehve of FF is proess (, ) if = 1 then <= 0 ; elsif ( event n = 1 ) then <= ; en ehve;
6 Proess * Sequentil Control * rhiteture * Sensitivit List Signl * Proess Instrution (Proess Conurrent ) proess (sensitivit list here) If then else * lterntive Seletion * Proess * Seletion Cover if (onition 1) then elsif (onition 2) then elsif (onition 3) then else en if; Clok efine * Clok * Proess if then else * Rising, Flling Ege * Proess Clok, Ege (signl event n signl = 1 ) -- rising ege (signl event n signl = 0 ) -- flling ege - si Register Register entit reg is : in st_logi_vetor(7 ownto 0 rst : in st_logi; lk : in st_logi; q : out st_logi_vetor(7 ownto 0) en reg; rhiteture ehve of reg is proess (lk,rst) q <= (others => 0 ) ; elsif ( lk event n lk = 1 ) then q <= ; en ehve; Reg - si Counter Counter (1) I/O Port iretion Tpes -Entit Port iretion Cnt + 1 Reg * IN : Input Onl ( in ) * OUT : Output Onl (Cn not fee-k) ( out) Cnt * INOUT : In n Out ( inout) * UFFER : Output Onl (Cn Fee-k) ( uffer)
7 Counter (1) Counter (2) - si Counter - Counter with Enle Logi use ieeest_logi_unsignell; entit nt is rst : in st_logi; lk : in st_logi; q : out st_logi_vetor(7 ownto 0) en nt ; rhiteture ehve of nt is signl tq : st_logi_vetor(7 ownto 0 proess (lk,rst) tq <= (others => 0 ) ; elsif ( lk event n lk = 1 ) then tq <= tq + 1; q <= tq; en ehve; Cnt EN CntE + 1 CntE 0 1 EN Reg - Counter with Enle Counter (3) use ieeest_logi_unsignell; entit nte is rst,en : in st_logi; lk : in st_logi; q : out st_logi_vetor(7 ownto 0) en nte ; rhiteture ehve of nte is signl tq : st_logi_vetor(7 ownto 0 proess (lk,rst) tq <= (others => 0 ) ; elsif ( lk event n lk = 1 ) then if en = 1 then tq <= tq + 1; q <= tq; en ehve; EN CntE Counter (4) - Counter with Enle n Snhronous Reset Logi * Enle Snhronous Reset? + 1 CntESR 0 1 EN 0 1 SR Reg Counter (5) - Counter with Enle n Sn Reset If / Else Sttements use ieeest_logi_unsignell; entit ntsre is rst,en : in st_logi; lk,sr : in st_logi; q : out st_logi_vetor(7 ownto 0) en ntsre ; rhiteture ehve of ntsre is signl tq : st_logi_vetor(7 ownto 0 proess (lk,rst) tq <= (others => 0 ) ; elsif ( lk event n lk = 1 ) then if sr = 1 then tq <= (others => 0 ) ; elsif en = 1 then tq <= tq + 1; q <= tq; en ehve; SR EN ntsre proess if ( oolen expression ) then sequentil sttements; proess if ( oolen expression ) then else The if / else sttement llows opertions to e performe se on ertin onitions It hs three si forms proess if ( oolen expression ) then elsif ( oolen expression ) then elsif ( oolen expression ) then
8 If/Elsif Exmple n Rules Cse Sttement C Sel Z 1 The first onition foun to e true will e exeute 2 Conitions n overlp 3 The first onition of n if / elsif will hve priorit proess (,, C,, Sel ) If (Sel= 00 ) then Z <= ; C elsif (Sel= 01 ) then Z <= ; elsif (Sel= 10 ) then Z <= C; else Z <= ; Z en if; en proess ; Compre with Sme Funtion Coe Z <= when (Sel = 00 ) else when (Sel = 01 ) else C when (Sel = 10 ) else ; proess ( ) se ( seletor expression ) is when => when => when => en se ; The CSE sttement llows opertions to e performe se on the vlue of single expression, s inite the seletor expression proess () se ( seletor expression ) is when => when others => en se ; C Sel Z Cse Exmples n Rules Cse sttements re preferle for LUT rhitetures given tht most snthesis tools will proue mux, or similrl miniml logi level struture 1 ll possile onitions must e speifie 2 No onitions n overlp 3 ll rnge speifitions must e of isrete tpe proess (,, C,, Sel ) se Sel is when 00 => Z <= ; when 01 => Z <= ; when 10 => Z <= C ; when others => Z <= ; en se ; Compre with Sme Funtion Coe With sel selet Z <= when 00, when 01, C when 10, when others; Loop Sttements Loop sttements n e onstrute for n repetitive opertion There re ifferent forms, eh hving ifferent metho of ontrol We shll exmine the for loop proess (, _us ) for I in 0 to 7 loop C_us (I) <= n _us (I) ; en loop ; The loop vrile Inex is not elre, n is not visile outsie the loop It is trete s onstnt With eh loop itertion, it suessivel ssumes the isrete vlues inite in the rnge S to P Shift Register - For Loop Seril in Prllel Out Shift Register SIN StoP - Seril in Prllel Out Shift Register S to P Shift Register entit s2p is rst,sin : in st_logi; lk : in st_logi; q : out st_logi_vetor(7 ownto 0) en s2p; rhiteture ehve of s2p is signl tq : st_logi_vetor(7 ownto 0) proess (lk,rst) tq <= (others => 0 ) ; elsif (lk event n lk = 1 ) then tq(0) <= sin; for I in 1 to 7 loop tq(i) <= tq(i-1 en loop; en if; q <= tq; en ehve; SIN StoP
9 uiz 1 Proess? 2 If Cse? 3 Entit Clok? esign with VHL (3) Hierrh esign esign Flow 4 Proess? CLK RST Hierrhil esign (1) Inrementl Counter 1 Coing Lirr ieee; use ieeest_logi_unsignell; entit 1 is : in st_logi_vetor(7 ownto 0 : out st_logi_vetor(7 ownto 0) en 1; rhiteture _ of 1 is <= + 1; en _; CNT Coing entit nt is rst,lk in st_logi; q : out st_logi_vetor(7 ownto 0) en 1; rhiteture _nt of nt is omponent 1 in st_logi_vetor(7 ownto 0 : out st_logi_vetor(7 ownto 0) en omponent; signl tq,in : st_logi_vetor(7 ownto 0 u0 : 1 port mp ( => tq, => in proess (rst,lk) tq <= (others => 0 elsif lk event n lk = 1 then tq <= in; en if; q <= tq; en _nt; Component elrtion U0 : 1 port mp ( tq, in 1Sstem efine 2 lgorithm efine 3 rhiteture efine 4 VHL Coe esign 5 Funtion Simultion 6 S n t h e s i s 7 Timing Simultion 1 Ple & Route 9 Timing Simultion 2 10 Trget evie 11 Hr Wre Test 12 Mss Proution esign Flow esign Flow (1) 1 Sstem efine - Sstem 2 lgorithm efine -Sstem lgorithm 3 rhiteture esign - lgorithm H/W rhiteture - Timing Chrt 4 Ciruit esign (VHL Coing) 5 Funtion Simultion -Stimulus Test enh (Simultor ) - lgorithm Timing Chrt
10 1Sstem efine 2 lgorithm efine 3 rhiteture efine 4 VHL Coe esign 5 Funtion Simultion 6 S n t h e s i s 7 Timing Simultion 1 Ple & Route 9 Timing Simultion 2 10 Trget evie 11 Hr Wre Test 12 Mss Proution esign Flow esign Flow (2) 6 Snthesis - Trget Tehnolog Lirr, Constrint 7 Timing Simultion 1 -Snthesis Cell el Simultion Ple & Route - Trget evie (Timing, Size) Cell, 9 Timing Simultion 2 - Cell + Routing el Simultion 10 Trget evie - SIC : Gte rr, Stnr Cell, Full Custom (Test Vetor,NRE) - PL : FPG, PL (Progrmming) 11 Hr Wre Test (On or, Test Logi) 12 Mss Proution 90% vs Erl etet Error => Chep to fix eug & Enhnement Solution 1 esign - Timing Mrgin, Fn Out - Snhronous esign (Counter, Exmple) - Trget Tehnolog (FPG Exmple) 2 Snthesis Control(Tool Performne, Option) 3 Ple n Routing Control Xilinx VHL Summr Xilinx VHL EN
Class Overview. Database Design. Database Design. Database Design Process. Entity / Relationship Diagrams. Introduction to Database Systems CSE 414
Introution to Dtse Systems CSE 44 Leture 9: E/R Digrms Clss Overview Unit : Intro Unit : Reltionl Dt Moels n Query Lnguges Unit : Non-reltionl t Unit 4: RDMBS internls n query optimiztion Unit 5: Prllel
More informationRoadmap of This Lecture
Reltionl Model Rodmp of This Lecture Structure of Reltionl Dtbses Fundmentl Reltionl-Algebr-Opertions Additionl Reltionl-Algebr-Opertions Extended Reltionl-Algebr-Opertions Null Vlues Modifiction of the
More informatione-quals Unit Syllabus Level 3 Designing and creating relational databases March 2007 Version 1.
e-quls Unit Syllus Level 3 Designing n reting reltionl tses 7266-047 www.itynguils.om/e-quls07 Mrh 2007 Version 1.0 Aout City & Guils City & Guils is the UK s leing provier of votionl qulifitions, offering
More informationPatterns and functions recursive number patterns Write the next 3 numbers in each sequence by following the rule:
Ptterns n funtions reursive numer ptterns Look roun you, n you see pttern? A pttern is n rrngement of shpes, numers or ojets forme oring to rule. Ptterns re everywhere, you n fin them in nture, rt, musi
More informationChapter 2: Relational Model. Chapter 2: Relational Model
Chpter : Reltionl Model Dtbse System Concepts, 5 th Ed. See www.db-book.com for conditions on re-use Chpter : Reltionl Model Structure of Reltionl Dtbses Fundmentl Reltionl-Algebr-Opertions Additionl Reltionl-Algebr-Opertions
More informationWhat is Monte Carlo Simulation? Monte Carlo Simulation
Wht is Monte Crlo Simultion? Monte Crlo methods re widely used clss of computtionl lgorithms for simulting the ehvior of vrious physicl nd mthemticl systems, nd for other computtions. Monte Crlo lgorithm
More informationE-Merge Process Table (Version 1)
E-Merge Proess Tle (Version 1) I 1 Indiies Trgets Stte Energy Environmentl ESTABLISHING GOALS & BASELINES Identify gols from stte energy offie perspetive Identify stte puli helth nd welfre gols ffeted
More informationLecture 9: The E/R Model II. 2. E/R Design Considerations 2/7/2018. Multiplicity of E/R Relationships. What you will learn about in this section
Leture 9: The E/R Moel II Leture n tivity ontents re se on wht Prof Chris Ré use in his CS 45 in the fll 06 term with permission.. E/R Design Consiertions Wht you will lern out in this setion Multipliity
More informationFuture Safety Design. Revision of ISO and Performance Level
Future Sfety Design Revision of ISO89- n Performne Level Introution ISO 89- is the most importnt stnr for regulting the si priniples n performne require of sfety ontrol system for mhines n evies. This
More informationOutline. CSE 326: Data Structures. Priority Queues Leftist Heaps & Skew Heaps. Announcements. New Heap Operation: Merge
CSE 26: Dt Structures Priority Queues Leftist Heps & Skew Heps Outline Announcements Leftist Heps & Skew Heps Reding: Weiss, Ch. 6 Hl Perkins Spring 2 Lectures 6 & 4//2 4//2 2 Announcements Written HW
More informationToday s Outline. One More Operation. Priority Queues. New Operation: Merge. Leftist Heaps. Priority Queues. Admin: Priority Queues
Tody s Outline Priority Queues CSE Dt Structures & Algorithms Ruth Anderson Spring 4// Admin: HW # due this Thursdy / t :9pm Printouts due Fridy in lecture. Priority Queues Leftist Heps Skew Heps 4// One
More informationT4.3 - Inverse of Matrices & Determinants
() Review T. - nverse of Mtries & Determinnts B Mth SL - Sntowski - t this stge of stuying mtries, we know how to, subtrt n multiply mtries i.e. if Then evlute: () + B (b) - () B () B (e) B n B (B) Review
More information! Homework. ! Exploring the data " Quantitative data: e.g., reading times. ! Inferential statistics " Parametric tests
Overview! Homework Introution to Psyholinguistis Leture 6 Experimentl Methos II Pi Knoeferle & M. W. Croker Deprtment of Computtionl Linguistis Srln University SS 2006! Exploring the t " Quntittive t:
More informationINF 4130 Exercise set 4
INF 4130 Exercise set 4 Exercise 1 List the order in which we extrct the nodes from the Live Set queue when we do redth first serch of the following grph (tree) with the Live Set implemented s LIFO queue.
More informationEffects of Entry Restriction on Free Entry General Competitive Equilibrium. Mitsuo Takase
CAES Working Pper Series Effects of Entry Restriction on Free Entry Generl Competitive Euilirium Mitsuo Tkse Fculty of Economics Fukuok University WP-2018-006 Center for Advnced Economic Study Fukuok University
More informationSolutions - Homework 3 (Due date: November 2 5:30 pm) Presentation and clarity are very important! Show your procedure!
LCRICAL AN COMPUR NGINRING PARMN, OAKLAN UNIVRSIY C-2700: igitl Logic eign Fll 2017 Solution - Homework 3 (ue dte: November 2 nd @ 5:30 pm) Preenttion nd clrit re ver importnt! Show our procedure! PROBLM
More informationReleased Assessment Questions, 2017 QUESTIONS
Relese Assessment Questions, 2017 QUESTIONS Gre 9 Assessment of Mthemtis Applie Re the instrutions elow. Along with this ooklet, mke sure you hve the Answer Booklet n the Formul Sheet. You my use ny spe
More informationA ppendix to. I soquants. Producing at Least Cost. Chapter
A ppendix to Chpter 0 Producing t est Cost This ppendix descries set of useful tools for studying firm s long-run production nd costs. The tools re isoqunts nd isocost lines. I soqunts FIGURE A0. SHOWS
More informationAcademic. Grade 9 Assessment of Mathematics. Winter 2009 SAMPLE ASSESSMENT QUESTIONS
Aemi Gre 9 Assessment of Mthemtis Winter 9 SAMPLE ASSESSMENT QUESTIONS Reor our nswers to the multiple-hoie questions on the lnk Stuent Answer Sheet (Winter 9, Aemi). Plese note: The formt of this ooklet
More informationThe phases of a simple compiler: Compiler Construction SMD163. From Intermediate To Target: An Optimizing Compiler: Lecture 13: Instruction selection
Compiler Constrution SMD163 The phses of simple ompiler: Lexer Prser Stti Anlysis IA32 Code Genertor Leture 13: Instrution seletion Viktor Leijon & Peter Jonsson with slides y John Nordlnder Contins mteril
More informationECE 410 Homework 1 -Solutions Spring 2008
ECE 410 Homework 1 -Solution Spring 2008 Prolem 1 For prolem 2-4 elow, ind the voltge required to keep the trnitor on ppling the rule dicued in cl. Aume VDD = 2.2V FET tpe Vt (V) Vg (V) Vi (V) n-tpe 0.5
More informationKEY SKILLS INFORMATION TECHNOLOGY Level 3 Games [KSI3J4] Question Paper. 28 and 29 January 2004
KEY SKILLS INFORMATION TECHNOLOGY Level 3 Gmes [KSI3J4] Question Pper 28 n 29 Jnury 2004 WHAT YOU NEED This Question Pper An Answer Cover Sheet Aess to omputer, softwre n printer Aess to the t files to
More informationFractions, decimals and percentages writing tenths as decimals. Tenths are written as decimals like this:
, eimls n perentges writing tenths s eimls Tenths re written s eimls like this: 0 0 0. 0. 0. 0. 0. 0. 0. 0.8 0.9.0 8 9 She the frtion strips so eh one mthes the frtion or the eiml: 0. 0. Orer eh set of
More informationSolutions - Homework 3 (Due date: March 15 5:30 pm) Presentation and clarity are very important! Show your procedure!
LCRICAL AN COMPUR NGINRING PARMN, OAKLAN UNIVRSIY C-2700: igitl Logic eign Winter 2018 Solution - Homework 3 (ue dte: Mrch 15 th @ 5:30 pm) Preenttion nd clrity re very importnt! Show your procedure! PROBLM
More informationOverview. (1) Problems In Synthesis. Terminology. Introduction to Logic Synthesis with ABC. (1) Problems in logic synthesis
Introution to Logi Synthesis with ABC Aln Mishhenko UC Berkeley Overview () Problems in logi synthesis Representtions n omputtions (2) An-Inverter Grphs (AIGs) The fountion of innovtive synthesis (3) AIG-bse
More information1 Manipulation for binary voters
STAT 206A: Soil Choie nd Networks Fll 2010 Mnipultion nd GS Theorem Otoer 21 Leturer: Elhnn Mossel Srie: Kristen Woyh In this leture we over mnipultion y single voter: whether single voter n lie out his
More informationA Notes on Partial Fraction
See iscussions, stts, n utho pofiles fo this publiction t: https://www.esechgte.net/publiction/388535 A Notes on Ptil Fction Metho August 07 DOI: 0.340/RG...66.49 CITATIONS 0 utho: Anku Knujiy Inin Institute
More informationTrigonometry - Activity 21 General Triangle Solution: Given three sides.
Nme: lss: p 43 Mths Helper Plus Resoure Set. opyright 003 rue. Vughn, Tehers hoie Softwre Trigonometry - tivity 1 Generl Tringle Solution: Given three sides. When the three side lengths '', '' nd '' of
More informationCOMPUTING THE ALL-PAIRS QUARTET DISTANCE ON A SET OF EVOLUTIONARY TREES
COMPUTING THE ALL-PAIRS QUARTET DISTANCE ON A SET OF EVOLUTIONARY TREES M. STISSING, T. MAILUND, C. N. S. PEDERSEN AND G. S. BRODAL Bioinformtis Reserh Center n Dept. of Computer Siene, University of Arhus,
More informationPlatform quick guide
Stndrd pltform Quik guide 1 Pltform quik guide This onise guide is to help you fmilirise yourself with the mny fetures nd tools ville on the St.George Diretshres stndrd pltform. Lern how to find stoks,
More informationCary Eclipse. Software Manual
Cry Elipse Softwre Mnul Noties Agilent Tehnologies, In. 2000 n 2010 No prt of this mnul my e reproue in ny form or y ny mens (inluing eletroni storge n retrievl or trnsltion into foreign lnguge) without
More informationNEW SIDEWALK CANOPIES
FLG F LG N SPRTNURG ISTRIT 6 SPRTNURG ISTRIT 6 1390 VLIER WY (864) 809-2007 MR. MRK KIRKLN RHITET McMILLN PZN SMITH RHITETS 127 UNR ST. PO OX 5331 SPRTNURG, S 29304 (864) 585-5678 MR. MIHEL L HEWNING,
More informationCSCI 104 Splay Trees. Mark Redekopp
CSCI 0 Sply Trees Mrk edekopp Soures / eding Mteril for these slides ws derived from the following soures https://www.s.mu.edu/~sletor/ppers/selfdjusting.pdf http://digitl.s.usu.edu/~lln/ds/notes/ch.pdf
More information3: Inventory management
INSE6300 Ji Yun Yu 3: Inventory mngement Concordi Februry 9, 2016 Supply chin mngement is bout mking sequence of decisions over sequence of time steps, fter mking observtions t ech of these time steps.
More informationDatabase System Concepts, 5 th Ed. Silberschatz, Korth and Sudarshan See for conditions on re-use
Chpter 2: Reltionl Model Dtbse System Concepts, 5 th Ed. See www.db-book.com for conditions on re-use Bnking Exmple brnch (brnch_nme, brnch_city, ssets) customer (customer_nme, customer_street, customer_city)
More informationJOURNAL THE ERGODIC TM CANDLESTICK OSCILLATOR ROBERT KRAUSZ'S. Volume 1, Issue 7
ROBERT KRUSZ'S JOURNL Volume 1, Issue 7 THE ERGODIC TM CNDLESTICK OSCILLTOR S ometimes we re lucky (due to our diligence) nd we find tool tht is useful nd does the jo etter thn previous tools, or nswers
More informationSolutions to Exercises, Set 3
Shool of Computer Siene, University of Nottinghm G5MAL Mhines nd their Lnguges, Spring 1 Thorsten Altenkirh Solutions to Exerises, Set 3 Fridy 3rd Mrh 1 1. () () L(+ +ǫ) = {L(E +F) = L(E) L(F)} L() L(
More informationTechnical Appendix. The Behavior of Growth Mixture Models Under Nonnormality: A Monte Carlo Analysis
Monte Crlo Technicl Appendix 1 Technicl Appendix The Behvior of Growth Mixture Models Under Nonnormlity: A Monte Crlo Anlysis Dniel J. Buer & Ptrick J. Currn 10/11/2002 These results re presented s compnion
More informationChoice of strategic variables under relative profit maximization in asymmetric oligopoly
Economics nd Business Letters () 5-6 04 Choice of strtegic vriles under reltive profit mximiztion in symmetric oligopoly Atsuhiro Stoh Ysuhito Tnk * Fculty of Economics Doshish University Kyoto Jpn Received:
More informationEconomics Department Fall 2013 Student Learning Outcomes (SLOs) Assessment Economics 4 (Principles of Microeconomics)
Jnury 2014 Economics Deprtment Fll 2013 Stuent Lerning Outcomes (SLOs) Assessment Economics 4 (Principles of Microeconomics) Lerning Outcome Sttement: In the Fll 2013 semester the Economics Deprtment engge
More informationBuffered Clock Tree Synthesis for 3D ICs Under Thermal Variations
Buffered Clok Tree Snthesis for D ICs Under Therml Vritions Jo Minz, Xin Zho, nd Sung Ku Lim Snoss Corortion, Mountin View, Cliforni, USA Georgi Institute of Tehnolog, Atlnt, Georgi, USA jo.minz@snoss.om,
More information13 Combinational Logic Devices
Prof. r. J. Reichardt Prof. r.. Schwarz F Elektrotechnik/Informatik ombinational ogic evices Purpose of combinational logic design: uilding larger, more sophisticated logic circuits by using adaptable
More informationMeasuring Search Trees
Mesuring Serch Trees Christin Bessiere 1, Bruno Znuttini 2, nd Cèsr Fernández 3 1 LIRMM-CNRS, Montpellier, Frnce 2 GREYC, Cen, Frnce 3 Univ. de Lleid, Lleid, Spin Astrct. The SAT nd CSP communities mke
More informationProblem Set 2 Solutions
Msshusetts Institute of Tehnology Hnout 6 6.854J/18.415J: Avne Algorithms Wenesy, Septemer 21, 2005 Dvi Krger Prolem Set 2 Solutions Prolem 1. We ugment every noe in the sply tree with the numer.es of
More informationMonthly Variance Reports
Monthly Vrine Reports Use this menu to quikly ess trining mterils for the MyReports UCSF Helth Monthly Vrine Reports. The jo is liste provie step-y-step instrutions for filtering n working with eh report.
More informationMath F412: Homework 4 Solutions February 20, κ I = s α κ α
All prts of this homework to be completed in Mple should be done in single worksheet. You cn submit either the worksheet by emil or printout of it with your homework. 1. Opre 1.4.1 Let α be not-necessrily
More informationarxiv: v1 [cs.db] 14 Dec 2012
Towrs Zero-Overhe Aptive Inexing in Hoop Stefn Rihter, Jorge-Arnulfo Quiné-Ruiz, Stefn Shuh, Jens Dittrih Informtion Systems Group Srln University http://infosys.s.uni-srln.e rxiv:1212.348v1 [s.db] 14
More informationCH 71 COMPLETING THE SQUARE INTRODUCTION FACTORING PERFECT SQUARE TRINOMIALS
CH 7 COMPLETING THE SQUARE INTRODUCTION I t s now time to py our dues regrding the Qudrtic Formul. Wht, you my sk, does this men? It mens tht the formul ws merely given to you once or twice in this course,
More informationEfficient outer join data skew handling in parallel DBMS
Effiient outer join t skew hnling in prllel DBMS Yu Xu Tert Sn Diego, CA, USA u.u@tert.om Pekk Kostm Tert El Seguno, CA, USA pekk.kostm@tert.om ABSTRACT Lrge enterprises hve een reling on prllel tse mngement
More informationCombinational Vs Sequential Logic Combinational circuit. Sequential Circuit ? F. CS221: Digital Design Sequential Logic Design (Latch & FF)
/5/25 22: Digil Design equenil Logic Design (Lch & FF) A. hu Dep of omp. c. & Engg. Indin Insiue of Technology Guwhi Ouline ominionl Vs equenil Logic Design Design flip flop, h sores one i lch ilizing
More information3/1/2016. Intermediate Microeconomics W3211. Lecture 7: The Endowment Economy. Today s Aims. The Story So Far. An Endowment Economy.
1 Intermedite Microeconomics W3211 Lecture 7: The Endowment Economy Introduction Columbi University, Spring 2016 Mrk Den: mrk.den@columbi.edu 2 The Story So Fr. 3 Tody s Aims 4 Remember: the course hd
More informationSmall Binary Voting Trees
Smll Binry Voting Trees Mihel Trik Astrt Sophistite voting on inry tree is ommon form of voting struture, s exemplifie y, for exmple, menment proeures. The prolem of hrterizing voting rules tht n e the
More informationThis paper consists of 28 pages including 4 sheets of paper for rough work plus instructions for the completion of one mark reading sheet.
1 This pper onsists of 28 pges inluing 4 sheets of pper for rough work plus instrutions for the ompletion of one mrk reing sheet. This exmintion pper remins the property of the University of South Afri
More informationA Fuzzy Inventory Model With Lot Size Dependent Carrying / Holding Cost
IOSR Journl of Mthemtics (IOSR-JM e-issn: 78-578,p-ISSN: 9-765X, Volume 7, Issue 6 (Sep. - Oct. 0, PP 06-0 www.iosrournls.org A Fuzzy Inventory Model With Lot Size Dependent Crrying / olding Cost P. Prvthi,
More informationA Closer Look at Bond Risk: Duration
W E B E X T E S I O 4C A Closer Look t Bond Risk: Durtion This Extension explins how to mnge the risk of bond portfolio using the concept of durtion. BOD RISK In our discussion of bond vlution in Chpter
More informationSanna-Randaccio: Lectures n The Ricardian Model
Snn-Rndccio: ectures n. 4-5 he Ricrdin Model Assumtions Absolute dvntge Comrtive dvntge (numericl emle) Comrtive dvntge nd rnsformtion Curve wh the C is liner wh comlete seciliztion ggregte trde benefits
More informationUNinhabited aerial vehicles (UAVs) are becoming increasingly
A Process Algebr Genetic Algorithm Sertc Krmn Tl Shim Emilio Frzzoli Abstrct A genetic lgorithm tht utilizes process lgebr for coding of solution chromosomes nd for defining evolutionry bsed opertors is
More informationAn Adaptive Nonlinear Function Controlled by Kurtosis for Blind Source Separation
An Adptive Nonliner Function Controlled b Kurtosis for Blind Source Seprtion Kenji NAKAYAMA Akihiro HIRANO Tkuki SAKAI Dept of Informtion nd Sstems Eng., Fcult of Eng., Knzw Univ. 2 2 Kodtsuno, Knzw, 92
More informationThis paper is not to be removed from the Examination Halls
This pper is not to be remove from the Exmintion Hlls UNIVESITY OF LONON FN3092 ZA (279 0092) BSc egrees n iploms for Grutes in Economics, Mngement, Finnce n the Socil Sciences, the iploms in Economics
More informationArithmetic and Geometric Sequences
Arithmetic nd Geometric Sequences A sequence is list of numbers or objects, clled terms, in certin order. In n rithmetic sequence, the difference between one term nd the next is lwys the sme. This difference
More informationDry Matter Intake Decreases Shortly After Initiation of Feeding Zilmax During the Summer
Dry Mtter Intke Dereses Shortly After Initition of Feeding Zilmx During the C.D. Reinhrdt, C.I. Vhl, nd B.E. Depenush Introdution Sine Zilmx (zilpterol hydrohloride, ZIL; Merk Animl Helth, Summit, NJ)
More informationCary WinUV. Software Manual
Cry WinUV Softwre Mnul Noties Agilent Tehnologies, In. 1998, 1999, 2000, 2002, 2010 n 2011 No prt of this mnul my e reproue in ny form or y ny mens (inluing eletroni storge n retrievl or trnsltion into
More informationREHABILITATION OF STORMWATER CANALS BAAKLINE MOUNT LEBANON MOHAFAZA
UNITE NTION EVELOPMENT PROGRMME UNP LENON SOIL N LOL EVELOPMENT PROGRMME REHILITTION OF STORMWTER NLS KLINE MOUNT LENON MOHFZ VOLUME 1 ETILE ESIGN RWINGS NOVEMER, 017 P-171H-GEN-001 LIST OF RWINGS P-171H-TOP-101
More informationAcademic. Grade 9 Assessment of Mathematics. Spring 2008 SAMPLE ASSESSMENT QUESTIONS
Aemi Gre 9 Assessment of Mthemtis Spring 8 SAMPLE ASSESSMENT QUESTIONS Reor your nswers to the multiple-hoie questions on the lnk Stuent Answer Sheet (Spring 8, Aemi). Plese note: The formt of these ooklets
More informationASYMMETRIC SWITCHING COSTS CAN IMPROVE THE PREDICTIVE POWER OF SHY S MODEL
Document de trvil 2012-14 / April 2012 ASYMMETRIC SWITCHIG COSTS CA IMPROVE THE PREDICTIVE POWER OF SHY S MODEL Evens Slies OFCE-Sciences-Po Asymmetric switching costs cn improve the predictive power of
More informationPlatform quick guide CFD
CFD Pltform quik guie This onise guie hs een put together to help you quikly fmilirise yourself with the mny fetures n tools ville on the Next Genertion pltform. Lern where to fin prouts to tre n mrket
More informationUNIVERSITY OF NOTTINGHAM. Discussion Papers in Economics BERTRAND VS. COURNOT COMPETITION IN ASYMMETRIC DUOPOLY: THE ROLE OF LICENSING
UNIVERSITY OF NOTTINGHAM Discussion Ppers in Economics Discussion Pper No. 0/0 BERTRAND VS. COURNOT COMPETITION IN ASYMMETRIC DUOPOLY: THE ROLE OF LICENSING by Arijit Mukherjee April 00 DP 0/0 ISSN 160-48
More informationSection 2.2 Trigonometry: The Triangle Identities
Se. 2.2 Trigonometry: The Tringle Identities 7 Setion 2.2 Trigonometry: The Tringle Identities DJENT ND OPPOSITE SIDES The study of tringle trigonometry is entered round the ute ngles in right tringle.
More informationHow to handle the acquisition of a subsidiary. with SAP Financial Consolidation 10.0, Starter Kit for IFRS?
How to hnle the quisition of susiiry with SAP Finnil Consolition 10.0, Strter Kit for IFRS? How to hnle the quisition of susiiry with SAP BusinessOjets IFRS Strter Kits Consolition Prtil Guie N 8 Mrh,
More informationSequence Cartridge Valves
Sequene rtridge Vlves rtridge Type Pge Pilot Operted, lned Piston T v xternlly rined, lned Piston, Modulting lement ir Pilot ir ontrolled, Pilot Operted, lned Piston iret ting without Reverse Flow hek
More informationRicardian Model. Mercantilism: 17 th and 18 th Century. Adam Smith s Absolute Income Hypothesis, End of 18 th Century: Major Shift in Paradigm
Mercntilism: th nd th Century Ricrdin Model lesson in Comprtive dvntge Trde ws considered s Zero-Sum Gme It ws viewed mens to ccumulte Gold & Silver Exports were encourged Imports were discourged End of
More informationMath-3 Lesson 2-5 Quadratic Formula
Mth- Lesson - Qudrti Formul Quiz 1. Complete the squre for: 10. Convert this perfet squre trinomil into the squre of inomil: 6 9. Solve ompleting the squre: 0 8 Your turn: Solve ftoring. 1.. 6 7 How would
More informationProblem Set 2 Suggested Solutions
4.472 Prolem Set 2 Suggested Solutions Reecc Zrutskie Question : First find the chnge in the cpitl stock, k, tht will occur when the OLG economy moves to the new stedy stte fter the government imposes
More informationPlatform quick guide CFD
CFD Pltform quik guie This onise guie hs een put together to help you quikly fmilirise yourself with the mny fetures n tools ville on the Next Genertion pltform. Lern where to fin prouts to tre n mrket
More information164 CHAPTER 2. VECTOR FUNCTIONS
164 CHAPTER. VECTOR FUNCTIONS.4 Curvture.4.1 Definitions nd Exmples The notion of curvture mesures how shrply curve bends. We would expect the curvture to be 0 for stright line, to be very smll for curves
More informationChapter 3: The Reinforcement Learning Problem. The Agent'Environment Interface. Getting the Degree of Abstraction Right. The Agent Learns a Policy
Chpter 3: The Reinforcement Lerning Problem The Agent'Environment Interfce Objectives of this chpter: describe the RL problem we will be studying for the reminder of the course present idelized form of
More information3Fractions, UNCORRECTED SAMPLE PAGES. decimals and percentages. Australian curriculum. What you will learn. Chapter 3A 3B 3C 3D 3E 3J 3K
A B C D E F G H I J K Chpter Wht you will lern Frtions, eimls n perentges Equivlent frtions (Consoliting) Opertions with frtions (Consoliting) Opertions with negtive frtions Unerstning eimls (Consoliting)
More informationThis paper is not to be removed from the Examination Halls
This pper is not to be remove from the Exmintion Hlls UNIVESITY OF LONON FN3092 ZB (279 0092) BSc egrees n iploms for Grutes in Economics, Mngement, Finnce n the Socil Sciences, the iploms in Economics
More information3. Argumentation Frameworks
3. Argumenttion Frmeworks Argumenttion current hot topic in AI. Historiclly more recent thn other pproches discussed here. Bsic ide: to construct cceptble set(s) of beliefs from given KB: 1 construct rguments
More informationThe Repeater Tree Construction Problem
The Repeter Tree Constrution Problem C. Brtoshek 1, S. Held 1, J. Mßberg 1, D. Rutenbh 2, nd J. Vygen 1 1 Forshungsinstitut für Diskrete Mthemtik, Universität Bonn, Lennéstr. 2, D-53113 Bonn, Germny, emils:
More information(a) by substituting u = x + 10 and applying the result on page 869 on the text, (b) integrating by parts with u = ln(x + 10), dv = dx, v = x, and
Supplementry Questions for HP Chpter 5. Derive the formul ln( + 0) d = ( + 0) ln( + 0) + C in three wys: () by substituting u = + 0 nd pplying the result on pge 869 on the tet, (b) integrting by prts with
More informationAddition and Subtraction
Addition nd Subtrction Nme: Dte: Definition: rtionl expression A rtionl expression is n lgebric expression in frction form, with polynomils in the numertor nd denomintor such tht t lest one vrible ppers
More informationNEW DEVELOPMENTS VALUATION
VINH SON SONG HINH HYDROPOWER JSC (VSH) Nguyen Mnh Tu Emil: Tu.NguyenMnh@tls.vn Ticker: VSH - Exchnge: HSX Anlyst s opinion: BUY Trget Price: VND 12.837 STOCK STATISTICS Price s of 08/23/2010: VND 9,000
More informationDYNAMIC PROGRAMMING REINFORCEMENT LEARNING. COGS 202 : Week 7 Presentation
DYNAMIC PROGRAMMING REINFORCEMENT LEARNING COGS 202 : Week 7 Preenttion OUTLINE Recp (Stte Vlue nd Action Vlue function) Computtion in MDP Dynmic Progrmming (DP) Policy Evlution Policy Improvement Policy
More informationHedging the volatility of Claim Expenses using Weather Future Contracts
Mrshll School of Business, USC Business Field Project t Helth Net, Inc. Investment Deprtment Hedging the voltility of Clim Epenses using Wether Future Contrcts by Arm Gbrielyn MSBA Cndidte co written by
More informationControlling a population of identical MDP
Controlling popultion of identicl MDP Nthlie Bertrnd Inri Rennes ongoing work with Miheer Dewskr (CMI), Blise Genest (IRISA) nd Hugo Gimert (LBRI) Trends nd Chllenges in Quntittive Verifiction Mysore,
More informationSystem Level Verification with Model Algebra
System Leel Verifition with Model Alger Smr Adi nd Dniel Gjski Tehnil Report CECS-04-29 Noemer 9, 2004 Center for Emedded Computer Systems Uniersity of Cliforni, Ire Ire, CA 92697-3425, USA (949) 824-8059
More informationInterest. Interest. Curriculum Ready ACMNA: 211, 229,
Inteest Cuiulum Redy ACMNA: 211, 229, 234 www.mthletis.om INTEREST The whole point of Finnil Mths is to pedit wht will hppen to money ove time. This is so you n e peped y knowing how muh money you will
More informationUNIT 7 SINGLE SAMPLING PLANS
UNIT 7 SINGLE SAMPLING PLANS Structure 7. Introduction Objectives 7. Single Smpling Pln 7.3 Operting Chrcteristics (OC) Curve 7.4 Producer s Risk nd Consumer s Risk 7.5 Averge Outgoing Qulity (AOQ) 7.6
More information6 Lotion n ress of the property 7 Usge of the property ( s pprove y the Competent Authority). LIFE INSURANCE CORPORATION OF INDIA 8 Resientil Commeril
Annexure - 1. ANNEXURES TO BE SUBMITTED BY THE VENDOR UNDER TWO BID SYSTEM FOR HIRING OF PREMISES TECHNICAL BID TO BE SUBMITTED IN ENVELOPE I Sr Detil Remrks 1 1 Nme of the Lessor 2 Communition Aress e
More informationUNIT 5 ACCEPTANCE SAMPLING PLANS 5.1 INTRODUCTION. Structure. 5.1 Introduction. 5.2 Inspection 5.3 Acceptance Sampling Plan
UNIT 5 ACCEPTANCE SAMPLING PLANS Struture 5.1 Introdution Objetives 5.2 Inspetion 5.3 Aeptne Smpling Pln Advntges nd Limittions of Aeptne Smpling Types of Aeptne Smpling Plns 5.4 Implementtion of Aeptne
More informationLecture 6 Phylogenetic Analysis. Algorithm. Types of Data. UPGMA Neighbor Joining. Minimum Evolution
Leture 6 Phylogeneti Anlysis Algorithms Types of Dt Distnes Nuleotie sites Tree-uiling Metho Clustering Algorithm Optimlity Criterion UPGMA Neighor Joining Minimum Evolution Mximum Prsimony Mximum Likelihoo
More informationChapter 7. Registers & Register Transfers. J.J. Shann. J. J. Shann
Chapter 7 Registers & Register Transfers J. J. Shann J.J. Shann Chapter Overview 7-1 Registers and Load Enable 7-2 Register Transfers 7-3 Register Transfer Operations 7-4 A Note for VHDL and Verilog Users
More information"Multilateralism, Regionalism, and the Sustainability of 'Natural' Trading Blocs"
"Multilterlism, Regionlism, nd the Sustinility of 'Nturl' Trding Blocs" y Eric Bond Deprtment of Economics Penn Stte June, 1999 Astrct: This pper compres the mximum level of world welfre ttinle in n incentive
More informationRecognizing IC-Planar and NIC-Planar Graphs
Journl of Grph Algorithms n Applitions http://jg.info/ vol. 22, no. 2, pp. 239 271 (2018) DOI: 10.7155/jg.00466 Reognizing IC-Plnr n NIC-Plnr Grphs Frnz J. Brnenurg 94030 Pssu, Germny Astrt We prove tht
More informationJUNE 2018 Level 2 Technical Certificate in Architectural Joinery Level 2 Architectural Joinery Theory exam
*79065050618* 7906-505 JUNE 2018 Level 2 Tehnil Certifite in Arhiteturl Joinery Level 2 Arhiteturl Joinery Theory exm Wenesy 20 June 2018 09:30 11:30 You shoul hve the following for this exmintion multiple-hoie
More information8.5 mm Diameter Single-Turn Fully Sealed Container Cermet Trimmer
Vishy Sfernie 8.5 mm Dimeter Single-Turn Fully Seled Continer Cermet Trimmer Models X nd Y feture TO-5 trnsistor type, rugged metl se housing. The ermet trk is printed to n lumin sustrte llowing high dissiption
More informationTechnical Report Global Leader Dry Bulk Derivatives. FIS Technical - Grains And Ferts. Highlights:
Technicl Report Technicl Anlyst FIS Technicl - Grins And Ferts Edwrd Hutn 442070901120 Edwrdh@freightinvesr.com Client Reltions Andrew Cullen 442070901120 Andrewc@freightinvesr.com Highlights: SOY remins
More informationDo We Really Need Gaussian Filters for Feature Detection? (Supplementary Material)
Do We Relly Need Gussin Filters for Feture Detection? (Supplementry Mteril) Lee-Kng Liu, Stnley H. Chn nd Truong Nguyen Februry 5, 0 This document is supplementry mteril to the pper submitted to EUSIPCO
More informationFINANCIAL ANALYSIS I. INTRODUCTION AND METHODOLOGY
Dhk Wter Supply Network Improvement Project (RRP BAN 47254003) FINANCIAL ANALYSIS I. INTRODUCTION AND METHODOLOGY A. Introduction 1. The Asin Development Bnk (ADB) finncil nlysis of the proposed Dhk Wter
More information