Accelerating 3D convolution using streaming architectures on FPGAs

Size: px
Start display at page:

Download "Accelerating 3D convolution using streaming architectures on FPGAs"

Transcription

1 Accelerting 3D convolution using streming rchitectures on FPGAs Hohun Fu, Robert G. Clpp, Oskr Mencer, nd Oliver Pell ABSTRACT We investigte FPGA rchitectures for ccelerting pplictions whose dominnt cost is 3D convolution, such s modeling nd Reverse Time Migrtion (RTM). We explore different design options, such s using different stencils, fitting multiple stencil opertors into the FPGA, processing multiple time steps in one pss, nd customizing the computtion precisions. The explortion revels constrints nd trdeoffs between different design prmeters nd metrics. The experiment results show tht the FPGA streming rchitecture provides gret potentil for ccelerting 3D convolution, nd cn chieve up to two orders of mgnitude speedup. INTRODUCTION The oil industry hs lwys been one of the leding consumers of high performnce computing systems. With the incresing of the CPU clock frequencies coming to n end, we cn no longer double our computtion speed by purchsing updted computers every eighteen months nd need to dpt to new computtion rchitectures, such s multi-core processors, Generl Purpose Grphic Processing Units (GPGPUs), nd Field Progrmmble Gte Arrys (FPGAs). Recent reserch work hs shown tht FPGAs cn provide customized solution for specific ppliction nd chieve more thn two orders of mgnitude speedup compred to single-core softwre implementtion. Exmples include cryptology pplictions (Cheung et l. 2005), finnce nd physics simultions (Zhng et l. 2005; Gokhle et l. 2004) s well s seismic computtions (Nemeth et l. 2008). The mjor difference between FPGA nd other computtion pltform is the reconfigurbility of the processing nd storge units in the device, which enbles n FPGA to be configured into rbitrry processing units nd circuit structures. The reconfigurbility of the FPGA leds to two mjor dvntges over other computtion pltforms: (1) A streming computtion rchitecture. While CPUs nd GPGPUs tke in sequence of instructions tht operte on corresponding dt in memory, in FPGAs the instructions re mpped into circuit units long the pth from input to output. The

2 Fu et l. 2 FPGAs FPGA then performs the computtion by streming the dt items through the circuit units. The streming rchitecture mkes efficient utiliztion of the computtion device, s every prt of the circuit is performing n opertion on one corresponding dt item in the dt strem. (2) Customizble number representtions. While CPUs nd GPGPUs cn only hndle 8-, 16-, 32- or 64-bit vribles, FPGAs support rbitrry bit width for ech vrible in the design. By djusting the bit widths ccording to the precision requirement, we cn often chieve significnt reduction in the silicon re cost of rithmetic units nd the bndwidth requirement between different hrdwre modules, thus improving the overll throughput of the entire system. To investigte FPGA s cpbility on solving the convolution problem, we explore design options such s: (1) using different stencils; (2) fitting multiple stencil opertors into the FPGA; (3) processing multiple time steps in one pss; (4) customizing the computtion precisions. The explortion demonstrtes constrints nd trdeoffs between different design prmeters nd metrics. Experiment results show tht the streming computtion rchitecture of FPGAs cn provide up to two orders of mgnitude speedup compred to single-core softwre implementtion. STREAMING ARCHITECTURE FOR CONVOLUTION Trget Appliction Our trget ppliction is 512 by 512 by 512 finite difference problem, with 6th to 8th order in spce nd 2nd order in time ccurcy. Ech time step of the computtion tkes the current wve-field stte, the wve-field stte from the previous time step nd the velocity model s inputs, nd produces the next wve-field stte s the output. FPGA Pltform Current Xilinx FPGAs contin three mjor ctegories of resources: (1) reconfigurble logic slices with 6-input lookup tbles (LUTs) nd flip flops (FFs); (2) DSP48E rithmetic units tht cn perform multiplictions; (3) 36-KBit Block RAM (BRAM)s used s locl storge or FIFOs. In our work, we use the Mxeler MAX2 ccelertion crd, which contins two Virtex-5 LX330T FPGA chips, 12 GB onbord memory, nd PCI-Express x16 interfce to the host PC. Tble 1 nd 2 show the resource summry of our current FPGAs nd the recently relesed Virtex-6 SX475T FPGA, nd the bsic cost for implementing single-precision floting-point units on FPGAs.

3 Fu et l. 3 FPGAs FPGAs #LUTs #FFs #DSP48Es #BRAMs LX330T 207, , SX475T 287, ,200 2,016 1,064 Tble 1: Resource summry of the Virtex-5 LX330T nd Virtex-6 SX475T FPGA. Opertions #LUTs #FFs #DSP48Es #BRAMs +/ Tble 2: Costs for single-precision floting-point units. Streming Architectures Finite difference bsed convolution opertors normlly perform multiplictions nd dditions on number of djcent points. While the points re neighbors to ech other in 3D geometric perspective, they re often stored reltively fr prt in memory. For exmple, in the 7-point 2D convolution performed on 2D rry shown in Figure 1, dt items (0, 3) nd (1, 3) re neighbors in the y direction. However, suppose the rry uses row-mjor storge nd hs row size of 512, the storge loctions of (0, 3) nd (1, 3) will be 512 items (one line) wy. For 3D rry of the size , the neighbors in z direction will be items wy. In softwre implementtions, this memory storge pttern cn incur lot of cche misses when the domin gets lrger, nd decreses the efficiency of the computtion. x 0,3 Figure 1: A streming exmple of 2D convolution. [NR] y 1,3 2,3 3,0 3,1 3,2 3,3 3,4 3,5 3,6 4,3 5,3 6,3 In n FPGA implementtion, we use streming rchitecture tht computes one result per cycle. As shown in Figure 1, suppose we re pplying the stencil on the dt item (3, 3), the circuit requires 13 different vlues (solid, drk-color), two of

4 Fu et l. 4 FPGAs which ((0, 3) nd (6, 3)) re three lines wy from the current dt item. As the dt items re stremed in one by one, in order to mke the vlues of (0, 3) nd (6, 3) vilble to the circuit, we put memory buffer tht stores ll the six lines of vlues from (0, 3) to (6, 3) (illustrted by the checker bord pttern on the grid). For row size of 512, this incurs storge cost of dt items. Similrly, for 7-point 3D convolution on rry, the design requires buffer for dt items. Assume ech dt item is singleprecision floting-point number, the buffer size mounts to 6 MB for the exmple. The FPGA chip we currently use provides 1.4 MB of potentil buffer size, which is not enough to store ll the stremed-in vlues. We solve this problem by 3D blocking, i.e. dividing the originl 3D rry into smller-size 3D rrys, nd performing convolution on them seprtely. 3D blocking reduces the buffer requirement for n FPGA convolution implementtion t cost. Given convolution stencil with ns non-zero lgs in ech direction, we must send in (nx + ns) (ny + ns) (nz + ns) block to produce nx ny nz output block. As nx, ny, nz becomes smll, the blocking overhed cn dominte. Menwhile, the initiliztion cost for setting up the memory ddress registers nd strt the streming process is lso incresed s we need to strem multiple blocks. Different Stencils EXPLORATION OF DESIGN OPTIONS Our trget ppliction uses 7-point str stencil (Figure 2()) to perform the 8th order finite difference. In our explortion, beside the str stencil, we lso consider 3-by-3-by-3 cube stencil (Figure 2(b)), which performs 6th order finite difference (Spotz nd Crey 1996). In softwre implementtions, the cube nd the str stencils provide similr performnce. For the FPGA implementtions, the resource costs for the str nd the cube stencils re different. The upper prt of Tble 3 shows the strightforwrd implementtions of str nd cube stencils for 120x120x120 rry. The cube consumes 20% more DSP48E rithmetic units thn str, s it involves more multiplictions. Menwhile, the memory cost (BRAM) of the cube is one third of the str, s the dt buffering requirement decreses from 6 slices to 2 slices. For the FPGA designs, we cn reduce the count of rithmetic opertions by exploiting the symmetry of the coefficients. For exmple, in the cube stencil shown in Figure 2(b), the stencil coefficients re the sme for the points mrked with the sme letters, s both the Lplce derivtives nd the scling rtio determined by the smpling rte of different xes re the sme for these points. Therefore, insted of computing 1 c + 2 c + 3 c, we compute ( ) c. Applying this technique, the computtion for the cube stencil reduces from 27 multiplictions nd

5 Fu et l. 5 FPGAs y z x y z x c d e d c b b g b f h f g b c d e d c () (b) Figure 2: Different 3D stencils: str vs. cube. [NR] Norml Stencils str cube FPGA #slices resource #BRAMs costs #DSP48Es Optimized Stencils str cube FPGA #slices resource #BRAMs cost #DSP48Es Tble 3: Resource costs of str nd cube 3D stencils for 120x120x120 3D rrys.

6 Fu et l. 6 FPGAs 26 dditions to 8 multiplictions nd 26 dditions, while the str stencil reduces from 19 multiplictions nd 18 dditions to 10 multiplictions nd 18 dditions. The lower prt of Tble 3 shows the resource costs for multipliction-reduced cube nd str. While the cost of BRAMs remins the sme, the number of DSP48Es reduces significntly for the cube. After the multipliction reduction, the cube consumes much less thn the str for both DSP48Es nd BRAMs. The str consumes less logic slices s it involves fewer dditions. As the stencil opertor only consumes 8 or 10 multiplictions nd 26 or 18 dditions, the FPGA hs the cpcity for multiple copies of the stencil opertors. Therefore, we hve two different wys to improve the performnce of the FPGA: (1) using multiple stencil opertors to work on multiple dt items in prllel; (2) processing multiple time steps in one pss. The following sections discusses these two options in more detil. Multiple Stencil Opertors To mke full utiliztion of ll the units on n FPGA, we cn try to fit s mny stencil opertors s possible into the chip. For the exmple shown in Figure 1, insted of processing only (3,3), we cn process consecutive dt items (such s (3,2), (3,3), nd (3,4)) in prllel. However, incresing the number of stencil units does not lwys improve the overll performnce due to the constrint of the bndwidth between the FPGA nd the onbord memories, which is pproximtely 13 GB/s in our pltform. Considering the controlling overheds, the bndwidth for pure input nd output dt is round 8 GB/s. When the input strems for the multiple stencil opertors pproch the sturtion point of the memory bndwidth, incresing the number of stencil opertors my not improve the performnce ny more. Using mesured experiment results, we built softwre tool tht models the costs nd performnce of vrious FPGA designs. Figure 3 shows the estimted performnce for processing D convolution using different number of computtion cores on n FPGA. The FPGA circuit is running t 125 MHz. The speedup is clculted ginst single-core softwre implementtion running on Intel Xeon 2.0 GHz. Due to the constrint of logic slices, the FPGA cn fit six concurrent cube stencils or eight concurrent str stencils. For ll the different number of stencil opertors, the cube provides slightly better performnce thn the str. Both the cube nd the str rrive t the sturtion point of round 25x speedup with four stencil opertors.

7 * + + Fu et l. 7 FPGAs % (" & Figure 3: Speedups for processing D convo-, - ) * lution using multiple stencil opertors. [NR] "!$#%'& ( input 0 unit 1 time step 1 1 [n][i][j] = conv( 0 [n+1][i][j], 0 [n][i][j], 0 [n-1][i][j], ) Figure 4: Bsic circuit structure for processing multiple time steps ( i denotes the wve-field dt in the time step i). [NR] unit 2 unit 3 time step 2 2 [n-1][i][j] = conv( 1 [n][i][j], 1 [n-1][i][j], 1 [n-2][i][j], ) time step 3 3 [n-2][i][j] = conv( 2 [n-1][i][j], 2 [n-2][i][j], 2 [n-3][i][j], ) output 3 Processing Multiple Time Steps Insted of putting concurrent cores, nother strtegy is to process multiple time steps in one pss. Figure 4 shows the bsic structure of circuit tht processes three time steps in one pss. The three units process three time steps seprtely with the output of ech unit s the input of the next unit. The exmple in the figure uses 3-by-3-by-3 cube stencil. In generl, the computtion of wve-field dt in slice n requires the wve-field dt in slices (n + 1), n, nd (n 1) in the previous time step. Therefore, when the unit 1 strts processing slice n, the unit 2 cn strt processing slice (n 1). Menwhile, unit 2 needs intermedite buffers to store the results for slices (n 1) nd n from unit 1. An dvntge of processing multiple time steps over putting multiple stencil opertors is tht the performnce will not be constrined by the memory bndwidth, s the unit for ech time step is getting inputs from the previous time step, nd does

8 Fu et l. 8 FPGAs not consume the memory bndwidth of the FPGA. However, on the dt side, s we re doing 3D blocking of the rry, processing multiple time steps requires extr dt items to strt with. Given convolution stencil with ns non-zero lgs in ech direction, to process n time steps in one pss for nx ny rry, we need to strt with n rry of the size (nx + 2 n ns) (ny + 2 n ns). Considering doing 10 time steps for 100x100 size, the dt overhed is 44% for the cube nd 156% for the str. Menwhile, s the unit t ech time step needs to store the results of the previous time step, this pproch lso increses the requirement for BRAM resources. Therefore, to increse the number of time steps, we need to reduce the blocking size, nd thus incresing the cost of streming overlpping dt items nd doing lrger number of strems. Another dvntge of this multiple-time-step rchitecture is tht we cn improve the order of time ccurcy with reltively smll costs. For exmple, for the unit 3 in Figure 4, insted of only getting the previous wve-field dt 2 from unit 2, we cn get in the wve-field dt 2 nd 1 from both units 2 nd 1 to chieve 4th order in time ccurcy. The cost for improving the time order is the extr buffer to store the wve-field dt from unit 1 nd the incresed number of dders nd multipliers. Figure 5 shows the estimted performnce for FPGA convolution designs tht process multiple time steps in one pss. The str, the 2nd nd 4th order cube re compred here. For this pproch, the cube stencil shows much better performnce thn the str stencil due to its smller requirement for BRAM resources ( str needs to buffer six slices for the convolution opertion, while cube only needs to buffer two). Due to the constrint of logic slices, the FPGA cn fit eight time steps for the str, six nd five steps for the 2nd nd 4th order cube. The str gets its pek performnce of 11x speedup with four time steps. After tht, the performnce becomes worse with more time steps. The 2nd order cube stencil increses ll the wy to 29x speedup with 6 time steps. The 4th order cube chieves 25x speedup with 5 time steps. Different Precisions As mentioned bove, one of FPGA s dvntges is the support for customizble number representtions. Our previous work (Fu et l. 2008) hs shown tht, in certin cses of seismic computtions, reduced precision provides equivlent results within cceptble tolernces. For FPGA designs, reduced precision cn significntly reduce the re cost nd I/O bndwidth of the design, nd multiply the performnce with more computtion units on the FPGA. Figure 6 shows the performnce we cn chieve using reduced floting-point precision. With 16-bit floting-point precision, the multiple-stencil pproch provides 49x speedup nd the multiple-time-step pproch provides 46x speedup.

9 $ % % Fu et l. 9 FPGAs (! ) ( "+*,- Figure 5: Speedups for processing different number of time steps processed in one pss. [NR] & ' # $ "! ACCELERATION RESULTS We hve implemented the 2nd order cube with 6 time steps nd the 4th order cube with 5 time steps onto the Mxeler ccelertion crd. The 2nd order cube processes 6 time steps in seconds, nd the 4th order cube processes 5 time steps in seconds. Compred to the 6.36 seconds to process one time step in 2nd order, the 2nd nd 4th order cube designs provide 27.5x nd 23.5x speedups, slightly lower thn our estimted performnce. The speedup discussed so fr is chieved by using one FPGA of the ccelertion crd. The ccelertion crd contins two FPGAs of the sme settings. There is lso inter-fpga link which cn updte the overlpping boundries between the FPGAs in prllel with the computtion performed on the FPGAs. Therefore, by dividing the rry into two prts nd computing in two FPGAs concurrently, we cn get nother 2x nd chieve up to 55x nd 47x speedup in totl. Note tht the FPGAs we re using re Xilinx Virtex-5 LX330T chips relesed severl yers go. Projecting our designs into the recently nnounced Xilinx Virtex-6 SX475T FPGAs (shown in Tble 1), we cn fit up to 13 time steps in one FPGA nd chieve up to 55x speedup. With two FPGAs working concurrently on n ccelertion crd, we cn chieve up to 110x speedup compred to single-core CPU version. CONCLUSIONS Our explortion on FPGA convolution designs shows tht, the cube stencil fits the FPGA streming rchitecture much better thn the str stencil. We especilly investigte the rchitecture tht processes multiple time steps in one pss. This pproch removes the constrints of the memory bndwidth, nd improves the performnce t the cost of extr dt buffering nd streming overhed. Experiment results show

10 " # # Fu et l. 10 FPGAs &(' )(*+-, ). &/' )01 & )(.2 )-. Figure 6: Speedups for different floting-point precisions. [NR] $ %! " tht the FPGA streming rchitecture provides gret potentil for ccelerting 3D convolution, nd cn chieve up to two orders of mgnitude speedup. ACKNOWLEDGMENTS We would like to thnk Mxeler Technologies for providing the hrdwre device nd the Center for Computtionl Erth nd Environmentl Science in Stnford University for funding this reserch. REFERENCES Cheung, R., N. Telle, W. Luk, nd P. Cheung, 2005, Customisble elliptic curve cryptosystems: IEEE Trnsctions on VLSI Systems, 13, Fu, H., W. Osborne, R. Clpp, nd O. Pell, 2008, Accelerting seismic computtions on fpgs: From the perspective of number representtions: Presented t the. Gokhle, M., J. Frigo, C. Ahrens, J. Tripp, nd R. Minnich, 2004, Monte Crlo rditive het trnsfer simultion on reconfigurble computer: Proc. FPL, LNCS 3203, Nemeth, T., J. Stefni, W. Liu, R. Dimond, O. Pell, nd R. Ergs, 2008, An implementtion of the coustic wve eqution on FPGAs: Presented t the. Spotz, W. nd G. Crey, 1996, A high-order compct formultion for the 3d poisson eqution: Numericl Methods for Prtil Differentil Equtions. Zhng, G., P. Leong, C. Ho, K. Tsoi, C. Cheung, D. Lee, R. Cheung, nd W. Luk, 2005, Reconfigurble Accelertion for Monte Crlo bsed Finncil Simultion: Proc. FPT,

Engineer To Engineer Note

Engineer To Engineer Note Engineer To Engineer Note EE-186 Technicl Notes on using Anlog Devices' DSP components nd development tools Contct our technicl support by phone: (800) ANALOG-D or e-mil: dsp.support@nlog.com Or visit

More information

Complete Coverage Path Planning of Mobile Robot Based on Dynamic Programming Algorithm Peng Zhou, Zhong-min Wang, Zhen-nan Li, Yang Li

Complete Coverage Path Planning of Mobile Robot Based on Dynamic Programming Algorithm Peng Zhou, Zhong-min Wang, Zhen-nan Li, Yang Li 2nd Interntionl Conference on Electronic & Mechnicl Engineering nd Informtion Technology (EMEIT-212) Complete Coverge Pth Plnning of Mobile Robot Bsed on Dynmic Progrmming Algorithm Peng Zhou, Zhong-min

More information

Parallel Square and Cube Computations

Parallel Square and Cube Computations Prllel Squre nd Cube Computtions Albert A. Liddicot nd Michel J. Flynn Computer Systems Lbortory, Deprtment of Electricl Engineering Stnford University Gtes Building 5 Serr Mll, Stnford, CA 945, USA liddicot@stnford.edu

More information

Stained Glass Design. Teaching Goals:

Stained Glass Design. Teaching Goals: Stined Glss Design Time required 45-90 minutes Teching Gols: 1. Students pply grphic methods to design vrious shpes on the plne.. Students pply geometric trnsformtions of grphs of functions in order to

More information

Fig.1. Let a source of monochromatic light be incident on a slit of finite width a, as shown in Fig. 1.

Fig.1. Let a source of monochromatic light be incident on a slit of finite width a, as shown in Fig. 1. Answer on Question #5692, Physics, Optics Stte slient fetures of single slit Frunhofer diffrction pttern. The slit is verticl nd illuminted by point source. Also, obtin n expression for intensity distribution

More information

Engineer To Engineer Note

Engineer To Engineer Note Engineer To Engineer Note EE-169 Technicl Notes on using Anlog Devices' DSP components nd development tools Contct our technicl support by phone: (800) ANALOG-D or e-mil: dsp.support@nlog.com Or visit

More information

What do all those bits mean now? Number Systems and Arithmetic. Introduction to Binary Numbers. Questions About Numbers

What do all those bits mean now? Number Systems and Arithmetic. Introduction to Binary Numbers. Questions About Numbers Wht do ll those bits men now? bits (...) Number Systems nd Arithmetic or Computers go to elementry school instruction R-formt I-formt... integer dt number text chrs... floting point signed unsigned single

More information

Before We Begin. Introduction to Spatial Domain Filtering. Introduction to Digital Image Processing. Overview (1): Administrative Details (1):

Before We Begin. Introduction to Spatial Domain Filtering. Introduction to Digital Image Processing. Overview (1): Administrative Details (1): Overview (): Before We Begin Administrtive detils Review some questions to consider Winter 2006 Imge Enhncement in the Sptil Domin: Bsics of Sptil Filtering, Smoothing Sptil Filters, Order Sttistics Filters

More information

The Distributed Data Access Schemes in Lambda Grid Networks

The Distributed Data Access Schemes in Lambda Grid Networks The Distributed Dt Access Schemes in Lmbd Grid Networks Ryot Usui, Hiroyuki Miygi, Yutk Arkw, Storu Okmoto, nd Noki Ymnk Grdute School of Science for Open nd Environmentl Systems, Keio University, Jpn

More information

Stack. A list whose end points are pointed by top and bottom

Stack. A list whose end points are pointed by top and bottom 4. Stck Stck A list whose end points re pointed by top nd bottom Insertion nd deletion tke plce t the top (cf: Wht is the difference between Stck nd Arry?) Bottom is constnt, but top grows nd shrinks!

More information

Questions About Numbers. Number Systems and Arithmetic. Introduction to Binary Numbers. Negative Numbers?

Questions About Numbers. Number Systems and Arithmetic. Introduction to Binary Numbers. Negative Numbers? Questions About Numbers Number Systems nd Arithmetic or Computers go to elementry school How do you represent negtive numbers? frctions? relly lrge numbers? relly smll numbers? How do you do rithmetic?

More information

5 Regular 4-Sided Composition

5 Regular 4-Sided Composition Xilinx-Lv User Guide 5 Regulr 4-Sided Composition This tutoril shows how regulr circuits with 4-sided elements cn be described in Lv. The type of regulr circuits tht re discussed in this tutoril re those

More information

Unit #9 : Definite Integral Properties, Fundamental Theorem of Calculus

Unit #9 : Definite Integral Properties, Fundamental Theorem of Calculus Unit #9 : Definite Integrl Properties, Fundmentl Theorem of Clculus Gols: Identify properties of definite integrls Define odd nd even functions, nd reltionship to integrl vlues Introduce the Fundmentl

More information

1. SEQUENCES INVOLVING EXPONENTIAL GROWTH (GEOMETRIC SEQUENCES)

1. SEQUENCES INVOLVING EXPONENTIAL GROWTH (GEOMETRIC SEQUENCES) Numbers nd Opertions, Algebr, nd Functions 45. SEQUENCES INVOLVING EXPONENTIAL GROWTH (GEOMETRIC SEQUENCES) In sequence of terms involving eponentil growth, which the testing service lso clls geometric

More information

A New Learning Algorithm for the MAXQ Hierarchical Reinforcement Learning Method

A New Learning Algorithm for the MAXQ Hierarchical Reinforcement Learning Method A New Lerning Algorithm for the MAXQ Hierrchicl Reinforcement Lerning Method Frzneh Mirzzdeh 1, Bbk Behsz 2, nd Hmid Beigy 1 1 Deprtment of Computer Engineering, Shrif University of Technology, Tehrn,

More information

ECEN 468 Advanced Logic Design Lecture 36: RTL Optimization

ECEN 468 Advanced Logic Design Lecture 36: RTL Optimization ECEN 468 Advnced Logic Design Lecture 36: RTL Optimiztion ECEN 468 Lecture 36 RTL Design Optimiztions nd Trdeoffs 6.5 While creting dtpth during RTL design, there re severl optimiztions nd trdeoffs, involving

More information

Dynamic Programming. Andreas Klappenecker. [partially based on slides by Prof. Welch] Monday, September 24, 2012

Dynamic Programming. Andreas Klappenecker. [partially based on slides by Prof. Welch] Monday, September 24, 2012 Dynmic Progrmming Andres Klppenecker [prtilly bsed on slides by Prof. Welch] 1 Dynmic Progrmming Optiml substructure An optiml solution to the problem contins within it optiml solutions to subproblems.

More information

1 Quad-Edge Construction Operators

1 Quad-Edge Construction Operators CS48: Computer Grphics Hndout # Geometric Modeling Originl Hndout #5 Stnford University Tuesdy, 8 December 99 Originl Lecture #5: 9 November 99 Topics: Mnipultions with Qud-Edge Dt Structures Scribe: Mike

More information

3.5.1 Single slit diffraction

3.5.1 Single slit diffraction 3..1 Single slit diffrction ves pssing through single slit will lso diffrct nd produce n interference pttern. The reson for this is to do with the finite width of the slit. e will consider this lter. Tke

More information

What do all those bits mean now? Number Systems and Arithmetic. Introduction to Binary Numbers. Questions About Numbers

What do all those bits mean now? Number Systems and Arithmetic. Introduction to Binary Numbers. Questions About Numbers Wht do ll those bits men now? bits (...) Number Systems nd Arithmetic or Computers go to elementry school instruction R-formt I-formt... integer dt number text chrs... floting point signed unsigned single

More information

P(r)dr = probability of generating a random number in the interval dr near r. For this probability idea to make sense we must have

P(r)dr = probability of generating a random number in the interval dr near r. For this probability idea to make sense we must have Rndom Numers nd Monte Crlo Methods Rndom Numer Methods The integrtion methods discussed so fr ll re sed upon mking polynomil pproximtions to the integrnd. Another clss of numericl methods relies upon using

More information

Engineer-to-Engineer Note

Engineer-to-Engineer Note Engineer-to-Engineer Note EE-295 Technicl notes on using Anlog Devices DSPs, processors nd development tools Visit our Web resources http://www.nlog.com/ee-notes nd http://www.nlog.com/processors or e-mil

More information

Tilt-Sensing with Kionix MEMS Accelerometers

Tilt-Sensing with Kionix MEMS Accelerometers Tilt-Sensing with Kionix MEMS Accelerometers Introduction Tilt/Inclintion sensing is common ppliction for low-g ccelerometers. This ppliction note describes how to use Kionix MEMS low-g ccelerometers to

More information

Small Business Networking

Small Business Networking Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd processes. Introducing technology

More information

Small Business Networking

Small Business Networking Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd business. Introducing technology

More information

CSCI 446: Artificial Intelligence

CSCI 446: Artificial Intelligence CSCI 446: Artificil Intelligence Serch Instructor: Michele Vn Dyne [These slides were creted by Dn Klein nd Pieter Abbeel for CS188 Intro to AI t UC Berkeley. All CS188 mterils re vilble t http://i.berkeley.edu.]

More information

Small Business Networking

Small Business Networking Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd business. Introducing technology

More information

Transparent neutral-element elimination in MPI reduction operations

Transparent neutral-element elimination in MPI reduction operations Trnsprent neutrl-element elimintion in MPI reduction opertions Jesper Lrsson Träff Deprtment of Scientific Computing University of Vienn Disclimer Exploiting repetition nd sprsity in input for reducing

More information

Chapter Spline Method of Interpolation More Examples Electrical Engineering

Chapter Spline Method of Interpolation More Examples Electrical Engineering Chpter. Spline Method of Interpoltion More Exmples Electricl Engineering Exmple Thermistors re used to mesure the temperture of bodies. Thermistors re bsed on mterils chnge in resistnce with temperture.

More information

Small Business Networking

Small Business Networking Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd business. Introducing technology

More information

Today. Search Problems. Uninformed Search Methods. Depth-First Search Breadth-First Search Uniform-Cost Search

Today. Search Problems. Uninformed Search Methods. Depth-First Search Breadth-First Search Uniform-Cost Search Uninformed Serch [These slides were creted by Dn Klein nd Pieter Abbeel for CS188 Intro to AI t UC Berkeley. All CS188 mterils re vilble t http://i.berkeley.edu.] Tody Serch Problems Uninformed Serch Methods

More information

3.5.1 Single slit diffraction

3.5.1 Single slit diffraction 3.5.1 Single slit diffrction Wves pssing through single slit will lso diffrct nd produce n interference pttern. The reson for this is to do with the finite width of the slit. We will consider this lter.

More information

Approximate computations

Approximate computations Living with floting-point numers Stndrd normlized representtion (sign + frction + exponent): Approximte computtions Rnges of vlues: Representtions for:, +, +0, 0, NN (not numer) Jordi Cortdell Deprtment

More information

Chapter 2 Sensitivity Analysis: Differential Calculus of Models

Chapter 2 Sensitivity Analysis: Differential Calculus of Models Chpter 2 Sensitivity Anlysis: Differentil Clculus of Models Abstrct Models in remote sensing nd in science nd engineering, in generl re, essentilly, functions of discrete model input prmeters, nd/or functionls

More information

EECS150 - Digital Design Lecture 23 - High-level Design and Optimization 3, Parallelism and Pipelining

EECS150 - Digital Design Lecture 23 - High-level Design and Optimization 3, Parallelism and Pipelining EECS150 - Digitl Design Lecture 23 - High-level Design nd Optimiztion 3, Prllelism nd Pipelining Nov 12, 2002 John Wwrzynek Fll 2002 EECS150 - Lec23-HL3 Pge 1 Prllelism Prllelism is the ct of doing more

More information

Small Business Networking

Small Business Networking Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd business. Introducing technology

More information

MA1008. Calculus and Linear Algebra for Engineers. Course Notes for Section B. Stephen Wills. Department of Mathematics. University College Cork

MA1008. Calculus and Linear Algebra for Engineers. Course Notes for Section B. Stephen Wills. Department of Mathematics. University College Cork MA1008 Clculus nd Liner Algebr for Engineers Course Notes for Section B Stephen Wills Deprtment of Mthemtics University College Cork s.wills@ucc.ie http://euclid.ucc.ie/pges/stff/wills/teching/m1008/ma1008.html

More information

a < a+ x < a+2 x < < a+n x = b, n A i n f(x i ) x. i=1 i=1

a < a+ x < a+2 x < < a+n x = b, n A i n f(x i ) x. i=1 i=1 Mth 33 Volume Stewrt 5.2 Geometry of integrls. In this section, we will lern how to compute volumes using integrls defined by slice nlysis. First, we recll from Clculus I how to compute res. Given the

More information

Caches I. CSE 351 Spring Instructor: Ruth Anderson

Caches I. CSE 351 Spring Instructor: Ruth Anderson L16: Cches I Cches I CSE 351 Spring 2017 Instructor: Ruth Anderson Teching Assistnts: Dyln Johnson Kevin Bi Linxing Preston Jing Cody Ohlsen Yufng Sun Joshu Curtis L16: Cches I Administrivi Homework 3,

More information

II. THE ALGORITHM. A. Depth Map Processing

II. THE ALGORITHM. A. Depth Map Processing Lerning Plnr Geometric Scene Context Using Stereo Vision Pul G. Bumstrck, Bryn D. Brudevold, nd Pul D. Reynolds {pbumstrck,brynb,pulr2}@stnford.edu CS229 Finl Project Report December 15, 2006 Abstrct A

More information

Geometric transformations

Geometric transformations Geometric trnsformtions Computer Grphics Some slides re bsed on Shy Shlom slides from TAU mn n n m m T A,,,,,, 2 1 2 22 12 1 21 11 Rows become columns nd columns become rows nm n n m m A,,,,,, 1 1 2 22

More information

Caches I. CSE 351 Autumn Instructor: Justin Hsia

Caches I. CSE 351 Autumn Instructor: Justin Hsia L01: Intro, L01: L16: Combintionl Introduction Cches I Logic CSE369, CSE351, Autumn 2016 Cches I CSE 351 Autumn 2016 Instructor: Justin Hsi Teching Assistnts: Chris M Hunter Zhn John Kltenbch Kevin Bi

More information

Representation of Numbers. Number Representation. Representation of Numbers. 32-bit Unsigned Integers 3/24/2014. Fixed point Integer Representation

Representation of Numbers. Number Representation. Representation of Numbers. 32-bit Unsigned Integers 3/24/2014. Fixed point Integer Representation Representtion of Numbers Number Representtion Computer represent ll numbers, other thn integers nd some frctions with imprecision. Numbers re stored in some pproximtion which cn be represented by fixed

More information

Engineer-to-Engineer Note

Engineer-to-Engineer Note Engineer-to-Engineer Note EE-270 Technicl notes on using Anlog Devices DSPs, processors nd development tools Contct our technicl support t processor.support@nlog.com nd dsptools.support@nlog.com Or visit

More information

Small Business Networking

Small Business Networking Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd processes. Introducing technology

More information

Small Business Networking

Small Business Networking Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd processes. Introducing technology

More information

Computing offsets of freeform curves using quadratic trigonometric splines

Computing offsets of freeform curves using quadratic trigonometric splines Computing offsets of freeform curves using qudrtic trigonometric splines JIULONG GU, JAE-DEUK YUN, YOONG-HO JUNG*, TAE-GYEONG KIM,JEONG-WOON LEE, BONG-JUN KIM School of Mechnicl Engineering Pusn Ntionl

More information

Small Business Networking

Small Business Networking Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd processes. Introducing technology

More information

CS201 Discussion 10 DRAWTREE + TRIES

CS201 Discussion 10 DRAWTREE + TRIES CS201 Discussion 10 DRAWTREE + TRIES DrwTree First instinct: recursion As very generic structure, we could tckle this problem s follows: drw(): Find the root drw(root) drw(root): Write the line for the

More information

Section 10.4 Hyperbolas

Section 10.4 Hyperbolas 66 Section 10.4 Hyperbols Objective : Definition of hyperbol & hyperbols centered t (0, 0). The third type of conic we will study is the hyperbol. It is defined in the sme mnner tht we defined the prbol

More information

Unit 5 Vocabulary. A function is a special relationship where each input has a single output.

Unit 5 Vocabulary. A function is a special relationship where each input has a single output. MODULE 3 Terms Definition Picture/Exmple/Nottion 1 Function Nottion Function nottion is n efficient nd effective wy to write functions of ll types. This nottion llows you to identify the input vlue with

More information

A Fast Imaging Algorithm for Near Field SAR

A Fast Imaging Algorithm for Near Field SAR Journl of Computing nd Electronic Informtion Mngement ISSN: 2413-1660 A Fst Imging Algorithm for Ner Field SAR Guoping Chen, Lin Zhng, * College of Optoelectronic Engineering, Chongqing University of Posts

More information

IZT DAB ContentServer, IZT S1000 Testing DAB Receivers Using ETI

IZT DAB ContentServer, IZT S1000 Testing DAB Receivers Using ETI IZT DAB ContentServer, IZT S1000 Testing DAB Receivers Using ETI Appliction Note Rel-time nd offline modultion from ETI files Generting nd nlyzing ETI files Rel-time interfce using EDI/ETI IZT DAB CONTENTSERVER

More information

a Technical Notes on using Analog Devices' DSP components and development tools

a Technical Notes on using Analog Devices' DSP components and development tools Engineer To Engineer Note EE-146 Technicl Notes on using Anlog Devices' DSP components nd development tools Contct our technicl support by phone: (800) ANALOG-D or e-mil: dsp.support@nlog.com Or visit

More information

2014 Haskell January Test Regular Expressions and Finite Automata

2014 Haskell January Test Regular Expressions and Finite Automata 0 Hskell Jnury Test Regulr Expressions nd Finite Automt This test comprises four prts nd the mximum mrk is 5. Prts I, II nd III re worth 3 of the 5 mrks vilble. The 0 Hskell Progrmming Prize will be wrded

More information

UNIT 11. Query Optimization

UNIT 11. Query Optimization UNIT Query Optimiztion Contents Introduction to Query Optimiztion 2 The Optimiztion Process: An Overview 3 Optimiztion in System R 4 Optimiztion in INGRES 5 Implementing the Join Opertors Wei-Png Yng,

More information

Small Business Networking

Small Business Networking Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd processes. Introducing technology

More information

On Computation and Resource Management in Networked Embedded Systems

On Computation and Resource Management in Networked Embedded Systems On Computtion nd Resource Mngement in Networed Embedded Systems Soheil Ghisi Krlene Nguyen Elheh Bozorgzdeh Mjid Srrfzdeh Computer Science Deprtment University of Cliforni, Los Angeles, CA 90095 soheil,

More information

Engineer-to-Engineer Note

Engineer-to-Engineer Note Engineer-to-Engineer Note EE-204 Technicl notes on using Anlog Devices DSPs, processors nd development tools Visit our Web resources http://www.nlog.com/ee-notes nd http://www.nlog.com/processors or e-mil

More information

Digital Signal Processing: A Hardware-Based Approach

Digital Signal Processing: A Hardware-Based Approach Digitl Signl Processing: A Hrdwre-Bsed Approch Roert Esposito Electricl nd Computer Engineering Temple University troduction Teching Digitl Signl Processing (DSP) hs included the utilition of simultion

More information

AVolumePreservingMapfromCubetoOctahedron

AVolumePreservingMapfromCubetoOctahedron Globl Journl of Science Frontier Reserch: F Mthemtics nd Decision Sciences Volume 18 Issue 1 Version 1.0 er 018 Type: Double Blind Peer Reviewed Interntionl Reserch Journl Publisher: Globl Journls Online

More information

Lecture 10 Evolutionary Computation: Evolution strategies and genetic programming

Lecture 10 Evolutionary Computation: Evolution strategies and genetic programming Lecture 10 Evolutionry Computtion: Evolution strtegies nd genetic progrmming Evolution strtegies Genetic progrmming Summry Negnevitsky, Person Eduction, 2011 1 Evolution Strtegies Another pproch to simulting

More information

x )Scales are the reciprocal of each other. e

x )Scales are the reciprocal of each other. e 9. Reciprocls A Complete Slide Rule Mnul - eville W Young Chpter 9 Further Applictions of the LL scles The LL (e x ) scles nd the corresponding LL 0 (e -x or Exmple : 0.244 4.. Set the hir line over 4.

More information

Address Register Assignment for Reducing Code Size

Address Register Assignment for Reducing Code Size Address Register Assignment for Reducing Code Size M. Kndemir 1, M.J. Irwin 1, G. Chen 1, nd J. Rmnujm 2 1 CSE Deprtment Pennsylvni Stte University University Prk, PA 16802 {kndemir,mji,guilchen}@cse.psu.edu

More information

Pin-down Cache: A Virtual Memory Management Technique for Zero-copy Communication

Pin-down Cache: A Virtual Memory Management Technique for Zero-copy Communication Pin-down Cche: A Virtul Memory Mngement Technique for Zero-copy Communiction Hiroshi Tezuk, Frncis 0 Cnoll, Atsushi Hori, nd Yutk Ishikw Rel World Computing Prtnership { tezuk, ocrroll, hori, ishikw) @rwcp.or.jp

More information

Delivering Acceleration: The Potential for Increased HPC Application Performance Using Reconfigurable Logic

Delivering Acceleration: The Potential for Increased HPC Application Performance Using Reconfigurable Logic elivering Accelertion: The Potentil for Incresed HPC Appliction Performnce Using Reconfigurble Logic vid Clig SRC Computers, Inc 0 N. Nevd Ave Colordo Springs, CO 80907 79--0 dvid.clig@srccomp.com vid

More information

Union-Find Problem. Using Arrays And Chains. A Set As A Tree. Result Of A Find Operation

Union-Find Problem. Using Arrays And Chains. A Set As A Tree. Result Of A Find Operation Union-Find Problem Given set {,,, n} of n elements. Initilly ech element is in different set. ƒ {}, {},, {n} An intermixed sequence of union nd find opertions is performed. A union opertion combines two

More information

A Scalable and Reliable Mobile Agent Computation Model

A Scalable and Reliable Mobile Agent Computation Model A Sclble nd Relible Mobile Agent Computtion Model Yong Liu, Congfu Xu, Zhohui Wu, nd Yunhe Pn College of Computer Science, Zhejing University Hngzhou 310027, Chin cckffe@yhoo.com.cn Abstrct. This pper

More information

A NOVEL ASYNCHRONOUS FPGA ARCHITECTURE DESIGN AND ITS PERFORMANCE EVALUATION. Xin Jia, Ranga Vemuri

A NOVEL ASYNCHRONOUS FPGA ARCHITECTURE DESIGN AND ITS PERFORMANCE EVALUATION. Xin Jia, Ranga Vemuri A OVL ASYCHROOUS FPGA ARCHITCTUR DSIG AD ITS PRFORMAC VALUATIO Xin Ji, Rng Vemuri University of Cincinnti Cincinnti, OH, USA 45221 emil: jix,rng @ececs.uc.edu ABSTRACT This pperproposesgapla: Globlly Loclly

More information

Enginner To Engineer Note

Enginner To Engineer Note Technicl Notes on using Anlog Devices DSP components nd development tools from the DSP Division Phone: (800) ANALOG-D, FAX: (781) 461-3010, EMAIL: dsp_pplictions@nlog.com, FTP: ftp.nlog.com Using n ADSP-2181

More information

Stack Manipulation. Other Issues. How about larger constants? Frame Pointer. PowerPC. Alternative Architectures

Stack Manipulation. Other Issues. How about larger constants? Frame Pointer. PowerPC. Alternative Architectures Other Issues Stck Mnipultion support for procedures (Refer to section 3.6), stcks, frmes, recursion mnipulting strings nd pointers linkers, loders, memory lyout Interrupts, exceptions, system clls nd conventions

More information

CS 268: IP Multicast Routing

CS 268: IP Multicast Routing Motivtion CS 268: IP Multicst Routing Ion Stoic April 5, 2004 Mny pplictions requires one-to-mny communiction - E.g., video/udio conferencing, news dissemintion, file updtes, etc. Using unicst to replicte

More information

Fault injection attacks on cryptographic devices and countermeasures Part 2

Fault injection attacks on cryptographic devices and countermeasures Part 2 Fult injection ttcks on cryptogrphic devices nd countermesures Prt Isrel Koren Deprtment of Electricl nd Computer Engineering University of Msschusetts Amherst, MA Countermesures - Exmples Must first detect

More information

Regular Expression Matching with Multi-Strings and Intervals. Philip Bille Mikkel Thorup

Regular Expression Matching with Multi-Strings and Intervals. Philip Bille Mikkel Thorup Regulr Expression Mtching with Multi-Strings nd Intervls Philip Bille Mikkel Thorup Outline Definition Applictions Previous work Two new problems: Multi-strings nd chrcter clss intervls Algorithms Thompson

More information

Engineer To Engineer Note

Engineer To Engineer Note Engineer To Engineer Note EE-208 Technicl Notes on using Anlog Devices' DSP components nd development tools Contct our technicl support by phone: (800) ANALOG-D or e-mil: dsp.support@nlog.com Or visit

More information

Caches I. CSE 351 Autumn 2018

Caches I. CSE 351 Autumn 2018 Cches I CSE 351 Autumn 2018 Instructors: Mx Willsey Luis Ceze Teching Assistnts: Britt Henderson Luks Joswik Josie Lee Wei Lin Dniel Snitkovsky Luis Veg Kory Wtson Ivy Yu Alt text: I looked t some of the

More information

Computer Arithmetic Logical, Integer Addition & Subtraction Chapter

Computer Arithmetic Logical, Integer Addition & Subtraction Chapter Computer Arithmetic Logicl, Integer Addition & Sutrction Chpter 3.-3.3 3.3 EEC7 FQ 25 MIPS Integer Representtion -it signed integers,, e.g., for numeric opertions 2 s s complement: one representtion for

More information

In the last lecture, we discussed how valid tokens may be specified by regular expressions.

In the last lecture, we discussed how valid tokens may be specified by regular expressions. LECTURE 5 Scnning SYNTAX ANALYSIS We know from our previous lectures tht the process of verifying the syntx of the progrm is performed in two stges: Scnning: Identifying nd verifying tokens in progrm.

More information

Introduction to hardware design using VHDL

Introduction to hardware design using VHDL Introuction to hrwre esign using VHDL Tim Güneysu n Nele Mentens ECC school Novemer 11, 2017, Nijmegen Outline Implementtion pltforms Introuction to VHDL Hrwre tutoril 1 Implementtion pltforms Microprocessor

More information

Overview. Network characteristics. Network architecture. Data dissemination. Network characteristics (cont d) Mobile computing and databases

Overview. Network characteristics. Network architecture. Data dissemination. Network characteristics (cont d) Mobile computing and databases Overview Mobile computing nd dtbses Generl issues in mobile dt mngement Dt dissemintion Dt consistency Loction dependent queries Interfces Detils of brodcst disks thlis klfigopoulos Network rchitecture

More information

USING HOUGH TRANSFORM IN LINE EXTRACTION

USING HOUGH TRANSFORM IN LINE EXTRACTION Stylinidis, Efstrtios USING HOUGH TRANSFORM IN LINE EXTRACTION Efstrtios STYLIANIDIS, Petros PATIAS The Aristotle University of Thessloniki, Deprtment of Cdstre Photogrmmetry nd Crtogrphy Univ. Box 473,

More information

Elena Baralis, Silvia Chiusano Politecnico di Torino. Pag. 1. Query optimization. DBMS Architecture. Query optimizer. Query optimizer.

Elena Baralis, Silvia Chiusano Politecnico di Torino. Pag. 1. Query optimization. DBMS Architecture. Query optimizer. Query optimizer. DBMS Architecture SQL INSTRUCTION OPTIMIZER Dtbse Mngement Systems MANAGEMENT OF ACCESS METHODS BUFFER MANAGER CONCURRENCY CONTROL RELIABILITY MANAGEMENT Index Files Dt Files System Ctlog DATABASE 2 Query

More information

Algorithm Design (5) Text Search

Algorithm Design (5) Text Search Algorithm Design (5) Text Serch Tkshi Chikym School of Engineering The University of Tokyo Text Serch Find sustring tht mtches the given key string in text dt of lrge mount Key string: chr x[m] Text Dt:

More information

Math 17 - Review. Review for Chapter 12

Math 17 - Review. Review for Chapter 12 Mth 17 - eview Ying Wu eview for hpter 12 1. Given prmetric plnr curve x = f(t), y = g(t), where t b, how to eliminte the prmeter? (Use substitutions, or use trigonometry identities, etc). How to prmeterize

More information

CSEP 573 Artificial Intelligence Winter 2016

CSEP 573 Artificial Intelligence Winter 2016 CSEP 573 Artificil Intelligence Winter 2016 Luke Zettlemoyer Problem Spces nd Serch slides from Dn Klein, Sturt Russell, Andrew Moore, Dn Weld, Pieter Abbeel, Ali Frhdi Outline Agents tht Pln Ahed Serch

More information

Epson Projector Content Manager Operation Guide

Epson Projector Content Manager Operation Guide Epson Projector Content Mnger Opertion Guide Contents 2 Introduction to the Epson Projector Content Mnger Softwre 3 Epson Projector Content Mnger Fetures... 4 Setting Up the Softwre for the First Time

More information

Tixeo compared to other videoconferencing solutions

Tixeo compared to other videoconferencing solutions compred to other videoconferencing solutions for V171026EN , unique solution on the video conferencing field Adobe Connect Web RTC Vydio for High security level, privcy Zero impct on network security policies

More information

Functor (1A) Young Won Lim 10/5/17

Functor (1A) Young Won Lim 10/5/17 Copyright (c) 2016-2017 Young W. Lim. Permission is grnted to copy, distribute nd/or modify this document under the terms of the GNU Free Documenttion License, Version 1.2 or ny lter version published

More information

Allocator Basics. Dynamic Memory Allocation in the Heap (malloc and free) Allocator Goals: malloc/free. Internal Fragmentation

Allocator Basics. Dynamic Memory Allocation in the Heap (malloc and free) Allocator Goals: malloc/free. Internal Fragmentation Alloctor Bsics Dynmic Memory Alloction in the Hep (mlloc nd free) Pges too corse-grined for llocting individul objects. Insted: flexible-sized, word-ligned blocks. Allocted block (4 words) Free block (3

More information

Functor (1A) Young Won Lim 8/2/17

Functor (1A) Young Won Lim 8/2/17 Copyright (c) 2016-2017 Young W. Lim. Permission is grnted to copy, distribute nd/or modify this document under the terms of the GNU Free Documenttion License, Version 1.2 or ny lter version published

More information

It consists of two cold rooms, each with their own evaporator but sharing the same cooling flui d R134a system ( compressor, condenser...).

It consists of two cold rooms, each with their own evaporator but sharing the same cooling flui d R134a system ( compressor, condenser...). This system llows study of refrigertion systems implementtion of rmodyn mic clcultions pplied to refrigertion Its uniqueness is tht it is fully controllble vi Internet directly from web browser like Internet

More information

CMSC 331 First Midterm Exam

CMSC 331 First Midterm Exam 0 00/ 1 20/ 2 05/ 3 15/ 4 15/ 5 15/ 6 20/ 7 30/ 8 30/ 150/ 331 First Midterm Exm 7 October 2003 CMC 331 First Midterm Exm Nme: mple Answers tudent ID#: You will hve seventy-five (75) minutes to complete

More information

LECT-10, S-1 FP2P08, Javed I.

LECT-10, S-1 FP2P08, Javed I. A Course on Foundtions of Peer-to-Peer Systems & Applictions LECT-10, S-1 CS /799 Foundtion of Peer-to-Peer Applictions & Systems Kent Stte University Dept. of Computer Science www.cs.kent.edu/~jved/clss-p2p08

More information

9 Graph Cutting Procedures

9 Graph Cutting Procedures 9 Grph Cutting Procedures Lst clss we begn looking t how to embed rbitrry metrics into distributions of trees, nd proved the following theorem due to Brtl (1996): Theorem 9.1 (Brtl (1996)) Given metric

More information

A Transportation Problem Analysed by a New Ranking Method

A Transportation Problem Analysed by a New Ranking Method (IJIRSE) Interntionl Journl of Innovtive Reserch in Science & Engineering ISSN (Online) 7-07 A Trnsporttion Problem Anlysed by New Rnking Method Dr. A. Shy Sudh P. Chinthiy Associte Professor PG Scholr

More information

9 4. CISC - Curriculum & Instruction Steering Committee. California County Superintendents Educational Services Association

9 4. CISC - Curriculum & Instruction Steering Committee. California County Superintendents Educational Services Association 9. CISC - Curriculum & Instruction Steering Committee The Winning EQUATION A HIGH QUALITY MATHEMATICS PROFESSIONAL DEVELOPMENT PROGRAM FOR TEACHERS IN GRADES THROUGH ALGEBRA II STRAND: NUMBER SENSE: Rtionl

More information

Explicit Decoupled Group Iterative Method for the Triangle Element Solution of 2D Helmholtz Equations

Explicit Decoupled Group Iterative Method for the Triangle Element Solution of 2D Helmholtz Equations Interntionl Mthemticl Forum, Vol. 12, 2017, no. 16, 771-779 HIKARI Ltd, www.m-hikri.com https://doi.org/10.12988/imf.2017.7654 Explicit Decoupled Group Itertive Method for the Tringle Element Solution

More information

Presentation Martin Randers

Presentation Martin Randers Presenttion Mrtin Rnders Outline Introduction Algorithms Implementtion nd experiments Memory consumption Summry Introduction Introduction Evolution of species cn e modelled in trees Trees consist of nodes

More information

About the Finite Element Analysis for Beam-Hinged Frame. Duan Jin1,a, Li Yun-gui1

About the Finite Element Analysis for Beam-Hinged Frame. Duan Jin1,a, Li Yun-gui1 Advnces in Engineering Reserch (AER), volume 143 6th Interntionl Conference on Energy nd Environmentl Protection (ICEEP 2017) About the Finite Element Anlysis for Bem-Hinged Frme Dun Jin1,, Li Yun-gui1

More information

Digital Design. Chapter 1: Introduction. Digital Design. Copyright 2006 Frank Vahid

Digital Design. Chapter 1: Introduction. Digital Design. Copyright 2006 Frank Vahid Chpter : Introduction Copyright 6 Why Study?. Look under the hood of computers Solid understnding --> confidence, insight, even better progrmmer when wre of hrdwre resource issues Electronic devices becoming

More information