Hardware-Accelerated Free-Form Deformation
|
|
- Georgiana Copeland
- 6 years ago
- Views:
Transcription
1 Hardware-Accelerated Free-Form Deformation Clint Cha and Ulrich Nemann Compter Science Department Integrated Media Systems Center University of Sothern California Abstract Hardware-acceleration for geometric deformation is developed in the framework of an extension to the OpenGL specification. The method reqires an addition to the front-end of the OpenGL rendering pipeline and an appropriate OpenGL primitive. Or approach is to implement general geometric deformations so the system spports additional layers of abstraction, inclding physically based simlations. This approach wold spport a wide range of sers with an accelerated implementation of a wellnderstood deformation method, redcing the need for software deformation engines and the exection time penalty associated with them. CR Categories and Sbject Descriptors: I.. [Compter Graphics]: Hardware Architectre --- Graphics Processors Additional Keywords: Free-Form Deformation, OpenGL INTRODUCTION Many animations are limited to rigid body transformations. While these approximate many ordinary object motions, rigid body animations preclde the class of elastic deformations fond in soft or organic objects sch cloth or hman limbs. In order to achieve these elastic deformations, programmers have had to constrct software deformation engines, often copled to physical simlations sch as mass-spring models []. Despite the large body of research literatre on deformations, interactive systems tend to avoid deformation techniqes de to their software implementation cost. Instead, application developers often se approximations based on precompted keyframes or rigid body animations that hopeflly mask any artifacts that arise. Often, in spite of these efforts, seams in the model and inter-penetrations are visible, especially in complex hman or animal models. With the contining increase of rendering qality provided by new graphics cards and gaming consoles [0], it becomes important to consider the addition of high-resoltion model deformations that allow single-skin models to deform * {cha nemann}@graphics.sc.ed seamlessly and natrally. Althogh single-skin deformations are available on a next-generation gaming console, deformation does not have widespread spport among most graphics cards or APIs. Deformable single-skin models allow arbitrary interactively controlled deformations not easily approximated by key frames and rigid transformations. The hardware and software API proposed in this paper provides these deformations in the framework of an incremental modification to OpenGL. Or approach tilizes the well-known Extended Free-Form Deformation (EFFD) method []. We show how to integrate the EFFD system into the OpenGL API by extending the crrent eval fnctions already within OpenGL. This approach yields several benefits. The EFFD method is a widely sed and intitive approach that programmers can easily se for creating and controlling deformable objects. The EFFD deformation operations are simple and reglar, therefore allowing efficient implementation as hardware (or optimized firmware) in the OpenGL rendering pipeline. The remainder of the paper is arranged as follows. The next section provides backgrond on EFFD. Section details the proposed hardware additions. Section 4 discsses several possible hardware organizations. Section 5 describes the OpenGL API fnctions. The last section smmarizes the tility of the system. ACKGROUND Free Form Deformation (FFD) is a poplar techniqe for creating geometric deformations. There are several types of FFDs, ranging from the standard FFD [8], the EFFD [], and FFDs with arbitrary topology [4]. We chose to work with the EFFD in or approach since it preserves the mathematical simplicity of the standard FFD yet it covers a wider variety of control lattices. The intition behind all types of FFDs is embedding an object into a piece of Jell-O, and as the Jell-O deforms, the embedded object deforms with it. The different FFDs mentioned above only vary the initial shape of the Jell-O in which the object is embedded. A standard FFD works solely with rectanglar parallelepipeds. Arbitrary topology FFDs allow any control lattice. The EFFD, while not as versatile as the arbitrary topology FFD, can work with cylinders, spheres and other reglar shapes more complex than a rectanglar parallelepiped, while still sing the efficient deformation eqations of the standard FFD. All FFD techniqes share some common properties. Here is a brief smmary of these properties. FFDs can deform nearly any type of geometric model ranging from simple triangle patches to parametric srfaces. It can be applied hierarchically to perform both local and global space deformations. In addition, FFDs can control srface continity as well as volme preservation. The reader is directed to [,4,8] for more details on these properties.
2 EFFD operation is divided into steps. The first step embeds the object in the initial control lattice (Plates,,5,,9) and comptes the parameterized coordinates of the object. The next step moves the control lattice points to new locations, ths deforming the enclosed region of space. The last step calclates the deformed positions of every object point based on the new locations of the control points (Plates,4,7,8,0). The deformed object is then ready for rendering. The embedding process starts with a lattice of reglarly spaced control points. For now, we can assme that the control points are arranged in a rectanglar parallelepiped. An object is embedded within the lattice by compting a transformation of coordinate systems from the object coordinate system to the local lattice coordinate system. For a rectanglar parallelepiped control lattice, the embedding or freezing of the object is accomplished by a simple affine coordinate transformation [8]. Since more complex control lattice shapes are possible with the EFFD, the parameterization also becomes more complex, reqiring a soltion to a system of non-linear eqations []. This system of non-linear eqations is defined by the eqations of deformation so we will first introdce these eqations and then show how the embedding is done. Assming that each object point X(x,y,z) has a parameterized local coordinate (s,t,), then with the set of control points P, we calclate the deformed position q with qi, j, k ( s, t, ) P i+ l, j+ k+ n l, n 0 ( s) ( t) ( ) () where P i,j,k is the i th, j th, k th control point and the s are the niform cbic -spline blending fnctions shown below. ( ) 0 ( ) ( ) ( ) ( (4 ( + + Ths, given a set of parameterized local coordinates, we evalate the above eqation to get the set of deformed points based on the new positions of the control points. For non-rectanglar lattices, we need to derive the system of non-linear eqations to determine the parameterized local coordinates. From eqation (), we can derive the system of nonlinear eqations for the (s,t,) parameterization of an object point X. The intition behind the embedding procedre for the EFFD is that it is the inverse of deformation of the object in the initial control lattice to a rectanglar parallelepiped control lattice. Hence, the initial EFFD control lattice shape is constrained by the existence of a mapping or morph between it and a standard rectanglar parallelepiped. The morph mst not incr any space folding, that is, it mst be invertible. From this we can see why the EFFD is not appropriate for lattices of arbitrary topology since the morph from the arbitrary lattice to the rectanglar parallelepiped may not exist. To derive the system of non-linear eqations, we set the object point X eqal to q, the deformed point in Eqation (). The goal then is then to find a parameterization (s,t,) that satisfies this eqation. In order to find (s,t,), we rearrange the Eqation () to obtain the following eqation. + l m + ) ) ) n P, j+ k+ nl ( s) m ( t) n( ) X i, j, 0 i+ l k l, n 0 where X i,j,k is the object point within the deformable region of P i,j,k to P i+,j+,k+. Since this is a -D vector eqation, we have one eqation from each dimension, and nknowns, namely (s,t,). We se a Newton-Raphson root-finding method [7] with initial gess 0.5 to find (s,t,). While the calclation of parameterized coordinates cold be done mltiple times, this process is typically done only once. In other words, once the initial control lattice has been selected and the parameterization done for it, the control lattice is not changed. In this case, the embedding procedre is done as a pre-processing step for each model and its initial control lattice. At rn time, the control lattice points P are moved (between key frames or based on ser inpt) and the deformed model coordinates are evalated by sing Eqation (). It is this evalation that reqires efficiency and hardware acceleration. HARDWARE ARCHITECTURE. OpenGL System The hardware architectre illstrates how we accelerate the evalation of Eqation (). We take advantage of the similarity between the form of Eqation () and the evalation of splinebased crves and srfaces already handled by OpenGL. Let s first take a look at OpenGL s crve and srface rendering system. Fndamentally, OpenGL s crve and srface capability is based on the evalator system [5]. This system advocates (bt does not reqire) the se of hardware accelerated polynomial evalators [9]. The evalations of the crrently spported crves and srfaces all take the form of Eqation (). y changing the blending fnctions, we obtain different families of crves ranging from ezier and -spline to Hermite. To simplify the syste OpenGL chose to fix the blending fnctions to the ernstein fnctions. y doing so, hardware implementers are able to optimize their designs for a single polynomial evalator sing the ernstein blending fnctions shown below. a, b a b ( c) ( c) The choice of the ernstein blending fnctions does not limit OpenGL s capability for rendering other families of crves. In fact, the GLU library flly implements a NURS renderer on top of OpenGL s evalator system. This is achieved by finding a transformation between families of crves. In order to represent one type of crve with another, there mst exist a mapping between the crve s original type of control points and the reslting family s control points sch that the crve represented by both control points are the same. This well-known transformation is described in []. Ths, OpenGL can render a wide variety of crves and srfaces by sing this transformation.. Proposed System a b () OpenGL does not constrain implementations, so the hardware designer can choose how many hardware polynomial evalators to inclde. Clearly, a single evalator is sfficient to increase the c a
3 s t P x P y P z /(-s+s -s ) /(-t+t -t ) /(-+ - ) Register File for Polynomial Coefficients PE PE PE From Control Point Cache s t P (a) (b) Inpt latches Pipeline Stage (d) -bit conter (c) Pipeline Stage Otpt latch reg reg reg Mltiplier Accmlator Figre. Data Flow of the Pipeline with optional components. This shows how the data flows throgh the pipeline with the general polynomial evalators set to the niform cbic -spline blending fnction,. speed for evalating Eqation () bt a second evalator allows parallel evalations in bivariate hyperpatches (srfaces). This design freedom leads to or proposed architectre, shown in Figre Or conceptal design (Fig. ) shows a three stage pipelined trivariate EFFD evalator. The first stage ses three polynomial evalators to evalate each blending fnction in parallel. The next stage is a for-inpt floating-point vector mltiplier that mltiplies the reslts of the blending fnctions with the control point vector. The last stage is the vector-accmlator that comptes the smmations for each dimension in Eqation (). A -bit conter controls the asynchronos reset of the accmlators after every 4 additions. The system also shows two optional components: the register file for polynomial coefficients and the control point cache. Their fnctions are discssed in later sections. The base system withot optional components works as follows. First the parameterized coordinates (s,t,) for a model vertex and a control point P are fed into the polynomial evalator. Once the blending fnctions are evalated, all the reslts are mltiplied together and this prodct is then mltiplied with the control point vector. The final vertex coordinate is accmlated for each dimension after every 4 additions. With a pipleline architectre, vertex coordinates are fed into the pipeline continosly and removed at the same rate after a fixed processing latency. These deformed vertices are then passed to the transformation engine for rendering. A smmary of the data flow is shown in Figre.. Other Featres To OpenGL vertex rendering Figre. lock-level design of the OpenGL Evalator Sb-block. (a) PE refers to a Polynomial Evalator. (b) Stage is a floating point vector mltiplier (c) The otpt stage is a vector accmlator (d) -bit conter s otpt s go throgh a NOR gate and is attached to the asynchronos reset of the accmlator s register. To optimize the throghpt of this syste we mst psh the parameterized coordinates (s,t,) and the control points into the pipeline as fast as possible. The addition of three featres will help address this problem... Control Point Cache This optional component insres that the control points are available to the pipeline as reqired. The control points are first loaded into the control point cache prior to sending the parameterized coordinates (s,t,) for any vertices in a model. Once the control points are loaded vertices in the model can be deformed efficiently. Since the model is embedded in the control lattice as a preprocess, a synchronized seqence of model vertices and control points can be compted and stored for all or any part of a model (like a vertex array) to optimize cache performance and minimize its reqired size. Althogh the control point positions change to obtain deformations, their nmber and neighborhood relationships within the control lattice and the model vertices do not change. It is clearly possible to maintain either separate model and control point arrays or a single nified model and control point array. In either case, cache performance can be statically determined by the degree of array synchronization... Data Interleaving and Direct Memory Access Another optimization to evalating the FFD is DMA. The parameterized object points (and their synchronized control lattice points) can reside in a fixed block of memory. A DMA controller can copy the model and control data directly to the OpenGL pipeline. This can insre that the evalator pipeline is flly tilized while the CPU is free to execte the application.
4 One method that takes advantage of DMA is interleaving parameterized local coordinates and their corresponding 4 control points. As data is streamed into the hardware, control points are sent directly to the polynomial evalator while the control points are sent to the cache (Figre ). This method is inefficient de to the redndancy of control points in the data stream. Crrently, we are investigating caching strategies and optimized arrangements of the data in order to redce redndancy. Interleaved Data Stream Via DMA Control Point Cache parameterized local coord. Control Points parameterized local coord. Control Points.. Polynomial Coefficient Register File Althogh predetermining the polynomial evalator has the advantage of simplifying the hardware design, it forces programmers to convert from one family of crves to another. This additional conversion process cold be seen as another point of optimization. Instead of sing CPU cycles in compting this transformation, we cold add specialized hardware jst for this transformation. This is however not optimal since the transformation involves matrix mltiplication. Dplicating the existing mltiplication hardware is wastefl and reroting the existing OpenGL matrix mltiplication hardware disrpts the pipeline. y modifying the behavior of the polynomial evalators in or syste we can bypass the transformation step. The only modification is to implement a more general polynomial evalator. This means that the polynomial evalator can evalate a three-degree polynomial with arbitrary coefficients. Ths, or general polynomial evalators are of the following form. GPE ax + bx + cx + Proposed asic System Figre : The Interleaved Data Stream. We see how the Control Points associated with each parameterized local coordinate is loaded into the cache while the local coordinate is sent to the proposed system for evalation. With this general polynomial evalator, we can change the blending fnctions by changing the coefficients and degree of the polynomial evalator. This is where the polynomial coefficient register file is sefl. In order to maintain state for the family of crve we are crrently rendering, we set the crrent coefficients and polynomial degree in the register file. d.4 Frther Enhancements Another possible enhancement is the addition of a combination generator. From Eqation (), we see that the smmation goes over all the 4 possible combination of the blending fnction for each of the three inpts s, t, and. This means that if we did a straight evalation of all possible combinations of the blending fnctions, we wold be repeating 89 evalations. One idea is to generate each blending fnction with each inpt s, t, and and then forward the reslts to a combination generator that will then feed into the stage mltiplier of Figre. This introdces additional memory and logic into the pipeline bt it is worth considering, as shown in the next section. Revisiting Eqation () reveals that the mltiply-accmlate operation is sed often. It is natral to consider DSP floating-point mltiply-accmlate (FMAC) strctres. Althogh not shown here, we can replace the Mltiplier and the Accmlator in Figre with FMAC hardware..5 Other Isses For nmerical representation, single-precision floating point sffices, bt the efficiency of fixed-point is desirable. The concerns with fixed-point calclations are precision and range. Since the local coordinates (s,t,) all range between 0 and, fixed point representations appear feasible. We plan to investigate a fixed-point optimization in the ftre. 4 DISCUSSION The system described so far is the core hardware nit. There are several ways to attain better performance. In order to gage performance, we need to calclate the pper bond time complexity of each hardware organization. Let m be the time it takes to calclate a floating-point mltiplication. We can also se m as an pper bond on addition and other operations. For the polynomial evalator, we designed a simple iterative nested-form evalator (Figre 4). This design comes from the transformation shown below. MUX coeff coeff ax + bx + cx + d d + ( c + ( b + Figre 4: Polynomial Evalator. Given the parameter and the coefficients of a cbic polynomial, we are able to evalate the reslt in loops. a) ) ) Coefficient a is first mltiplexed into the loop and mltiplied with the parameter. Then the reslt is added to the next coefficient. The reslt of the addition is then looped back into the mltiplier and the process is contined two more times. The whole process takes loops and performs operations in each loop for a total of m time.
5 4. asic System The first approach is to se the core nit by itself. This is the simplest implementation and the slowest. From Figre, we see that Stage a takes m time, Stage b takes m time, and Stage c takes m time. This loops 4 times which gives s a total of 4(++) 40m time. 4. Flly Parallel System On the other extreme, we can parallelize the whole operation by dplicating the basic system 4 times. Then we replace all the Accmlators of each basic system with a single tree adder for each dimension (Figre 5). This calclates all 4 basis fnction combinations in 9m time (m for the polynomial evalator and m for the Mltiplier) while the tree adder takes log (4) m time to add all the 4 reslts. The flly parallel system takes a total of 5m time. 4. Iterative Tree System Instead of bilding all 4 nits, we can bild n nits and loop several times to accmlate the calclation. The organization is the same as the Flly Parallel System (Figre 5) except we replace the tree adder with a tree accmlator. Each nit will take 9m time to calclate the basis fnctions and then it will take log (n) for the tree accmlator to add the reslts. This organization will then loop ceil(4/n) times. The total time for this organization is shown below. time 4.4 asic System with a Combination Generator ( 9 + In Section.4, we pointed ot that a lot of the calclations were repeated. In order to enhance the performance of the syste a new hardware nit called the Combination Generator (CG) cold be sed. This nit (Figre ) is banks of register files that contain 4 floating-point registers each. The CG stores niqe basis fnction calclations. Once stored, log ( n)) V V 4 4 the CG generates all possible combinations and feeds them into the Mltiplier. The organization that ses the CG (Fig. 7) Figre 5: Flly Parallel System. The vectors are fed into a row of 4 parallel nits and then their reslts are all added together by a tree adder. The block is the basic system with ot the Accmlator s R0 0 n From Polynomial Evalator t R 0 To Mltiplier R 0 Figre : Combination Generator. It is composed of register banks each with 4 locations. The Polynomial evalator will calclate all vales and store the reslts in the appropriate location. The data is then selected from each bank and sent to the vector mltiplier is not different from the basic system. We simply insert a CG in between the Polynomial Evalator and the Mltiplier in Figre. To load the CG with vales, assming we only have polynomial evalator, takes *7m time. Then assming that the CG takes no more than m time to generate a combination, it takes 5m time (CG + Mltiplier + Accmlator) to perform one loop. The total time for this organization is 7+4*59m time. Compared to the basic syste this amonts to a 9% savings. To gain an additional 7% savings, we can se three Polynomial Evalators in parallel. This takes 4*4m time to fill the CG. The total time sing three Polynomial Evalators only contribtes to the time it takes to fill the CG. We get a total of 4+4*5 44m time which is a 4% savings. 5 OPENGL COMMAND EXTENSIONS The OpenGL extensions are described in two variations. The first set are the extensions needed if the general polynomial evalator is not sed while the other set is for se with the general polynomial evalator. 5. asic System PE Combination Generator Mltiplier Accmlator Figre 7: System with Combination Generator. We add in a Combination Generator between the polynomial evalator and the vector mltiplier of the basic system. In the basic syste we need to provide the OpenGL API that allows an application to interface with the hardware withot the general polynomial evalator. Since the GLU libraries already have a well-known interface for rendering NURS, we tilize the same approach to render FFDs. elow we list the necessary OpenGL API calls. glnewffdrenderer generate a new FFD object to refer to when rendering. glffdproperty change common properties like line width, etc. glffdcallback Callback sed to monitor the progress of the rendering. Also sed for error monitoring.
6 glffdvolme Used to generate the srface based on the control points and the model. This is the main call that accepts the array of parameterized local coordinates and control points. The programmer does not need to explicitly interleave the data bt they do need to provide a forth dimension that indexes into the control point array. The OpenGL implementation can then repackage the data by interleaving parameterized local coordinates with the appropriate control points. This extension of the GLU library is similar to the GLU NURS interface. In fact, it is sed in exactly the same way [5]. 5. System with Optional Components y adding the general polynomial evalator, we no longer have to work in the GLU library interface. With the general polynomial evalator hardware, we can access the evalators directly. Here are the corresponding OpenGL API calls for this system [5]. glmap similar to glmap, it is sed to specify the array of control points. glevalcoord sed to evalate a parameterized object point. This and glmap is sed to evalate a single parameterized local coordinate. gllendcoefficient sed to specify the blending polynomial degree and coefficients. glffd This call mimics the behavior of glffdvolme. It accepts an interleaved stream and sends it directly to the hardware nit. Notice that similar calls to glmapgrid or glevalmesh do not exist. This is becase it does not make sense to evalate a reglarly spaced grid since most of the time the coordinates to be evalated will come from a complex model. An implementation may inclde them bt they wold be of limited se. Plate Plate Plate Plate 4 Plate 5 Plate Plate 7 Plate 8 EXAMPLES All of the models were parameterized within a single cbe of deformation consisting of a 4-point control lattice. The cat and the second chair (Plates 9 and 0) were embedded inside the deformable region while the office chair (Plates 5,,7,8) had its stem and wheels embedded in the deformable region. Most deformations shown here were obtained by rotating the top 4 corner control points by 90 degrees abot the y-axis. All other control points are linearly interpolated based on the position of the 8 corner control points. The shearing deformation on the office chair was obtained by lowering the bottom left corner control points while lifting the bottom right corner control points (See Plates and 8). Plates and show views of a cat being embedded in a control lattice. Plates and 4 show the cat being twisted after the control points are rotated 90 degrees arond the Y- axis. Plates 5 and show an office chair being embedded in a control lattice. Plates 7 and 8 show the legs of the office chair being sheared. Plate 9 shows another chair being embedded in a control lattice. Plate 0 shows the chair being twisted. 7 CONCLUSIONS Plate 9 Plate 0 We show how to integrate free form deformation, a poplar geometric deformation techniqe, into OpenGL by adding a few OpenGL API calls. In addition, we propose a block-level design of the OpenGL evalator sb-system in order to spport FFD evalation in hardware. y implementing these changes, programmers wold have access to a standard geometric deformation programming interface as well as a hardware accelerated deformation system.
7 References [] D. echmann. Space Deformation Models Srvey. Compters & Graphics 994, 8(4), pages [] S. Coqillart. Extended Free-Form Deformation: A Sclptring Tool for D Geometric Modeling. SIGGRAPH 990, volme 4, pages [] J.D. Foley, A. van Da S.K. Feiner, J.F. Hghes. Compter Graphics Principles and Practice, nd edition in C. Addison- Wesley, 99, pp [4] R. MacCracken and K.I. Joy. Free-Form Deformations With Lattices of Arbitrary Topology. SIGGRAPH 99, pages [5] J. Neider, T. Davis, M. Woo. OpenGL Programming Gide: The Official Gide to Learning OpenGL, Release. Addison- Wesley, 99. [] OpenGL Architectre Review oard. OpenGL Reference Manal: The Official Reference Docment for OpenGL, Release. Addison-Wesley, 99. [7] W. H. Press, S. A. Tekolsky, W. T. Vetterling, and. P. Flannery. Nmerical Recipes in C: The Art of Scientific Compting. nd Edition, Cambridge University Press, 99, pages [8] T. W. Sederberg and S.R. Parry. Free-Form Deformation of Solid Geometric Models. SIGGRAPH 98, volme 0, pages 5-0. [9] M. Segal, K. Akeley. The OpenGL Graphics Pipeline l.html [0] Sony Compter Entertainment of America. PlayStation Technical Specifications and Technical Demos. [] A. Witkin and D. araff. Physically-ased Modeling. SIGGRAPH 997 Corse Notes. Corse 9, Differential Eqation asics.
Picking and Curves Week 6
CS 48/68 INTERACTIVE COMPUTER GRAPHICS Picking and Crves Week 6 David Breen Department of Compter Science Drexel University Based on material from Ed Angel, University of New Mexico Objectives Picking
More informationCS 4204 Computer Graphics
CS 424 Compter Graphics Crves and Srfaces Yong Cao Virginia Tech Reference: Ed Angle, Interactive Compter Graphics, University of New Mexico, class notes Crve and Srface Modeling Objectives Introdce types
More informationCurves and Surfaces. CS 537 Interactive Computer Graphics Prof. David E. Breen Department of Computer Science
Crves and Srfaces CS 57 Interactive Compter Graphics Prof. David E. Breen Department of Compter Science E. Angel and D. Shreiner: Interactive Compter Graphics 6E Addison-Wesley 22 Objectives Introdce types
More informationEECS 487: Interactive Computer Graphics f
Interpolating Key Vales EECS 487: Interactive Compter Graphics f Keys Lectre 33: Keyframe interpolation and splines Cbic splines The key vales of each variable may occr at different frames The interpolation
More informationA sufficient condition for spiral cone beam long object imaging via backprojection
A sfficient condition for spiral cone beam long object imaging via backprojection K. C. Tam Siemens Corporate Research, Inc., Princeton, NJ, USA Abstract The response of a point object in cone beam spiral
More informationBlended Deformable Models
Blended Deformable Models (In IEEE Trans. Pattern Analysis and Machine Intelligence, April 996, 8:4, pp. 443-448) Doglas DeCarlo and Dimitri Metaxas Department of Compter & Information Science University
More informationBias of Higher Order Predictive Interpolation for Sub-pixel Registration
Bias of Higher Order Predictive Interpolation for Sb-pixel Registration Donald G Bailey Institte of Information Sciences and Technology Massey University Palmerston North, New Zealand D.G.Bailey@massey.ac.nz
More informationTdb: A Source-level Debugger for Dynamically Translated Programs
Tdb: A Sorce-level Debgger for Dynamically Translated Programs Naveen Kmar, Brce R. Childers, and Mary Lo Soffa Department of Compter Science University of Pittsbrgh Pittsbrgh, Pennsylvania 15260 {naveen,
More informationThe single-cycle design from last time
lticycle path Last time we saw a single-cycle path and control nit for or simple IPS-based instrction set. A mlticycle processor fies some shortcomings in the single-cycle CPU. Faster instrctions are not
More informationOn the Computational Complexity and Effectiveness of N-hub Shortest-Path Routing
1 On the Comptational Complexity and Effectiveness of N-hb Shortest-Path Roting Reven Cohen Gabi Nakibli Dept. of Compter Sciences Technion Israel Abstract In this paper we stdy the comptational complexity
More informationChapter 6: Pipelining
CSE 322 COPUTER ARCHITECTURE II Chapter 6: Pipelining Chapter 6: Pipelining Febrary 10, 2000 1 Clothes Washing CSE 322 COPUTER ARCHITECTURE II The Assembly Line Accmlate dirty clothes in hamper Place in
More informationNetworks An introduction to microcomputer networking concepts
Behavior Research Methods& Instrmentation 1978, Vol 10 (4),522-526 Networks An introdction to microcompter networking concepts RALPH WALLACE and RICHARD N. JOHNSON GA TX, Chicago, Illinois60648 and JAMES
More informationComputer-Aided Mechanical Design Using Configuration Spaces
Compter-Aided Mechanical Design Using Configration Spaces Leo Joskowicz Institte of Compter Science The Hebrew University Jersalem 91904, Israel E-mail: josko@cs.hji.ac.il Elisha Sacks (corresponding athor)
More informationMulti-lingual Multi-media Information Retrieval System
Mlti-lingal Mlti-media Information Retrieval System Shoji Mizobchi, Sankon Lee, Fmihiko Kawano, Tsyoshi Kobayashi, Takahiro Komats Gradate School of Engineering, University of Tokshima 2-1 Minamijosanjima,
More informationMaster for Co-Simulation Using FMI
Master for Co-Simlation Using FMI Jens Bastian Christoph Claß Ssann Wolf Peter Schneider Franhofer Institte for Integrated Circits IIS / Design Atomation Division EAS Zenerstraße 38, 69 Dresden, Germany
More informationAn Introduction to GPU Computing. Aaron Coutino MFCF
An Introdction to GPU Compting Aaron Cotino acotino@waterloo.ca MFCF What is a GPU? A GPU (Graphical Processing Unit) is a special type of processor that was designed to render and maniplate textres. They
More informationThe extra single-cycle adders
lticycle Datapath As an added bons, we can eliminate some of the etra hardware from the single-cycle path. We will restrict orselves to sing each fnctional nit once per cycle, jst like before. Bt since
More informationThe Disciplined Flood Protocol in Sensor Networks
The Disciplined Flood Protocol in Sensor Networks Yong-ri Choi and Mohamed G. Goda Department of Compter Sciences The University of Texas at Astin, U.S.A. fyrchoi, godag@cs.texas.ed Hssein M. Abdel-Wahab
More informationThe final datapath. M u x. Add. 4 Add. Shift left 2. PCSrc. RegWrite. MemToR. MemWrite. Read data 1 I [25-21] Instruction. Read. register 1 Read.
The final path PC 4 Add Reg Shift left 2 Add PCSrc Instrction [3-] Instrction I [25-2] I [2-6] I [5 - ] register register 2 register 2 Registers ALU Zero Reslt ALUOp em Data emtor RegDst ALUSrc em I [5
More informationPipelined van Emde Boas Tree: Algorithms, Analysis, and Applications
This fll text paper was peer reviewed at the direction of IEEE Commnications Society sbject matter experts for pblication in the IEEE INFOCOM 007 proceedings Pipelined van Emde Boas Tree: Algorithms, Analysis,
More informationLocal Run Manager Generate FASTQ Analysis Module
Local Rn Manager Generate FASTQ Analysis Modle Workflow Gide For Research Use Only. Not for se in diagnostic procedres. Overview 3 Set Parameters 3 Analysis Methods 5 View Analysis Reslts 5 Analysis Report
More informationFault Tolerance in Hypercubes
Falt Tolerance in Hypercbes Shobana Balakrishnan, Füsn Özgüner, and Baback A. Izadi Department of Electrical Engineering, The Ohio State University, Colmbs, OH 40, USA Abstract: This paper describes different
More informationObject Pose from a Single Image
Object Pose from a Single Image How Do We See Objects in Depth? Stereo Use differences between images in or left and right eye How mch is this difference for a car at 00 m? Moe or head sideways Or, the
More informationReview. A single-cycle MIPS processor
Review If three instrctions have opcodes, 7 and 5 are they all of the same type? If we were to add an instrction to IPS of the form OD $t, $t2, $t3, which performs $t = $t2 OD $t3, what wold be its opcode?
More informationReading. 13. Texture Mapping. Non-parametric texture mapping. Texture mapping. Required. Watt, intro to Chapter 8 and intros to 8.1, 8.4, 8.6, 8.8.
Reading Reqired Watt, intro to Chapter 8 and intros to 8.1, 8.4, 8.6, 8.8. Recommended 13. Textre Mapping Pal S. Heckbert. Srvey of textre mapping. IEEE Compter Graphics and Applications 6(11): 56--67,
More informationMinimal Edge Addition for Network Controllability
This article has been accepted for pblication in a ftre isse of this jornal, bt has not been flly edited. Content may change prior to final pblication. Citation information: DOI 10.1109/TCNS.2018.2814841,
More informationEvaluating Influence Diagrams
Evalating Inflence Diagrams Where we ve been and where we re going Mark Crowley Department of Compter Science University of British Colmbia crowley@cs.bc.ca Agst 31, 2004 Abstract In this paper we will
More informationImage Denoising Algorithms
Image Denoising Algorithms Xiang Hao School of Compting, University of Utah, USA, hao@cs.tah.ed Abstract. This is a report of an assignment of the class Mathematics of Imaging. In this assignment, we first
More informationOptimal Sampling in Compressed Sensing
Optimal Sampling in Compressed Sensing Joyita Dtta Introdction Compressed sensing allows s to recover objects reasonably well from highly ndersampled data, in spite of violating the Nyqist criterion. In
More informationToday. B-splines. B-splines. B-splines. Computergrafik. Curves NURBS Surfaces. Bilinear patch Bicubic Bézier patch Advanced surface modeling
Comptergrafik Matthias Zwicker Uniersität Bern Herbst 29 Cres Srfaces Parametric srfaces Bicbic Bézier patch Adanced srface modeling Piecewise Bézier cres Each segment spans for control points Each segment
More informationREPLICATION IN BANDWIDTH-SYMMETRIC BITTORRENT NETWORKS. M. Meulpolder, D.H.J. Epema, H.J. Sips
REPLICATION IN BANDWIDTH-SYMMETRIC BITTORRENT NETWORKS M. Melpolder, D.H.J. Epema, H.J. Sips Parallel and Distribted Systems Grop Department of Compter Science, Delft University of Technology, the Netherlands
More informationContinuity Smooth Path Planning Using Cubic Polynomial Interpolation with Membership Function
J Electr Eng Technol Vol., No.?: 74-?, 5 http://dx.doi.org/.537/jeet.5..?.74 ISSN(Print) 975- ISSN(Online) 93-743 Continity Smooth Path Planning Using Cbic Polomial Interpolation with Membership Fnction
More informationEEC 483 Computer Organization
EEC 483 Compter Organization Chapter 4.4 A Simple Implementation Scheme Chans Y The Big Pictre The Five Classic Components of a Compter Processor Control emory Inpt path Otpt path & Control 2 path and
More informationUncertainty Determination for Dimensional Measurements with Computed Tomography
Uncertainty Determination for Dimensional Measrements with Compted Tomography Kim Kiekens 1,, Tan Ye 1,, Frank Welkenhyzen, Jean-Pierre Krth, Wim Dewlf 1, 1 Grop T even University College, KU even Association
More informationThe LS-STAG Method : A new Immersed Boundary / Level-Set Method for the Computation of Incompressible Viscous Flows in Complex Geometries
The LS-STAG Method : A new Immersed Bondary / Level-Set Method for the Comptation of Incompressible Viscos Flows in Complex Geometries Yoann Cheny & Olivier Botella Nancy Universités LEMTA - UMR 7563 (CNRS-INPL-UHP)
More informationDate: December 5, 1999 Dist'n: T1E1.4
12/4/99 1 T1E14/99-559 Project: T1E14: VDSL Title: Vectored VDSL (99-559) Contact: J Cioffi, G Ginis, W Y Dept of EE, Stanford U, Stanford, CA 945 Cioffi@stanforded, 1-65-723-215, F: 1-65-724-3652 Date:
More informationTu P7 15 First-arrival Traveltime Tomography with Modified Total Variation Regularization
T P7 15 First-arrival Traveltime Tomography with Modified Total Variation Reglarization W. Jiang* (University of Science and Technology of China) & J. Zhang (University of Science and Technology of China)
More informationResolving Linkage Anomalies in Extracted Software System Models
Resolving Linkage Anomalies in Extracted Software System Models Jingwei W and Richard C. Holt School of Compter Science University of Waterloo Waterloo, Canada j25w, holt @plg.waterloo.ca Abstract Program
More informationIEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 6, NO. 5, MAY On the Analysis of the Bluetooth Time Division Duplex Mechanism
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 6, NO. 5, MAY 2007 1 On the Analysis of the Bletooth Time Division Dplex Mechanism Gil Zssman Member, IEEE, Adrian Segall Fellow, IEEE, and Uri Yechiali
More informationPavlin and Daniel D. Corkill. Department of Computer and Information Science University of Massachusetts Amherst, Massachusetts 01003
From: AAAI-84 Proceedings. Copyright 1984, AAAI (www.aaai.org). All rights reserved. SELECTIVE ABSTRACTION OF AI SYSTEM ACTIVITY Jasmina Pavlin and Daniel D. Corkill Department of Compter and Information
More informationReading. 11. Texture Mapping. Texture mapping. Non-parametric texture mapping. Required. Watt, intro to Chapter 8 and intros to 8.1, 8.4, 8.6, 8.8.
Reading Reqired Watt, intro to Chapter 8 and intros to 8.1, 8.4, 8.6, 8.8. Optional 11. Textre Mapping Watt, the rest of Chapter 8 Woo, Neider, & Davis, Chapter 9 James F. Blinn and Martin E. Newell. Textre
More informationA RECOGNITION METHOD FOR AIRPLANE TARGETS USING 3D POINT CLOUD DATA
A RECOGNITION METHOD FOR AIRPLANE TARGETS USING 3D POINT CLOUD DATA Mei Zho*, Ling-li Tang, Chan-rong Li, Zhi Peng, Jing-mei Li Academy of Opto-Electronics, Chinese Academy of Sciences, No.9, Dengzhang
More informationCS 251, Winter 2019, Assignment % of course mark
CS 25, Winter 29, Assignment.. 3% of corse mark De Wednesday, arch 3th, 5:3P Lates accepted ntil Thrsday arch th, pm with a 5% penalty. (7 points) In the diagram below, the mlticycle compter from the corse
More informationImage Compression Compression Fundamentals
Compression Fndamentals Data compression refers to the process of redcing the amont of data reqired to represent given qantity of information. Note that data and information are not the same. Data refers
More informationA choice relation framework for supporting category-partition test case generation
Title A choice relation framework for spporting category-partition test case generation Athor(s) Chen, TY; Poon, PL; Tse, TH Citation Ieee Transactions On Software Engineering, 2003, v. 29 n. 7, p. 577-593
More informationSZ-1.4: Significantly Improving Lossy Compression for Scientific Data Sets Based on Multidimensional Prediction and Error- Controlled Quantization
SZ-1.4: Significantly Improving Lossy Compression for Scientific Data Sets Based on Mltidimensional Prediction and Error- Controlled Qantization Dingwen Tao (University of California, Riverside) Sheng
More informationThis chapter is based on the following sources, which are all recommended reading:
Bioinformatics I, WS 09-10, D. Hson, December 7, 2009 105 6 Fast String Matching This chapter is based on the following sorces, which are all recommended reading: 1. An earlier version of this chapter
More informationCOMPOSITION OF STABLE SET POLYHEDRA
COMPOSITION OF STABLE SET POLYHEDRA Benjamin McClosky and Illya V. Hicks Department of Comptational and Applied Mathematics Rice University November 30, 2007 Abstract Barahona and Mahjob fond a defining
More informationMethod to build an initial adaptive Neuro-Fuzzy controller for joints control of a legged robot
Method to bild an initial adaptive Nero-Fzzy controller for joints control of a legged robot J-C Habmremyi, P. ool and Y. Badoin Royal Military Academy-Free University of Brssels 08 Hobbema str, box:mrm,
More informationIsilon InsightIQ. Version 2.5. User Guide
Isilon InsightIQ Version 2.5 User Gide Pblished March, 2014 Copyright 2010-2014 EMC Corporation. All rights reserved. EMC believes the information in this pblication is accrate as of its pblication date.
More informationMETAPOST and the FIIT Logo
METAPOST and the FIIT Logo Matej KOŠÍK Slovak University of Technology Faclty of Informatics and Information Technologies Ilkovičova 3, 842 16 Bratislava, Slovakia kosik@fiit.stba.sk 1 The Tools Abstract.
More informationThe Intersection of Two Ringed Surfaces and Some Related Problems
Graphical Models 63, 8 44 001) doi:10.1006/gmod.001.0553, available online at http://www.idealibrary.com on The Intersection of Two Ringed Srfaces and Some Related Problems Hee-Seok Heo and Sng Je Hong
More informationTopic Continuity for Web Document Categorization and Ranking
Topic Continity for Web ocment Categorization and Ranking B. L. Narayan, C. A. Mrthy and Sankar. Pal Machine Intelligence Unit, Indian Statistical Institte, 03, B. T. Road, olkata - 70008, India. E-mail:
More informationIDENTIFICATION OF THE AEROELASTIC MODEL OF A LARGE TRANSPORT CIVIL AIRCRAFT FOR CONTROL LAW DESIGN AND VALIDATION
ICAS 2 CONGRESS IDENTIFICATION OF THE AEROELASTIC MODEL OF A LARGE TRANSPORT CIVIL AIRCRAFT FOR CONTROL LAW DESIGN AND VALIDATION Christophe Le Garrec, Marc Hmbert, Michel Lacabanne Aérospatiale Matra
More informationProf. Kozyrakis. 1. (10 points) Consider the following fragment of Java code:
EE8 Winter 25 Homework #2 Soltions De Thrsday, Feb 2, 5 P. ( points) Consider the following fragment of Java code: for (i=; i
More informationSeismic trace interpolation with approximate message passing Navid Ghadermarzy and Felix Herrmann and Özgür Yılmaz, University of British Columbia
Seismic trace interpolation with approximate message passing Navid Ghadermarzy and Felix Herrmann and Özgür Yılmaz, University of British Colmbia SUMMARY Approximate message passing (AMP) is a comptationally
More informationPOWER-OF-2 BOUNDARIES
Warren.3.fm Page 5 Monday, Jne 17, 5:6 PM CHAPTER 3 POWER-OF- BOUNDARIES 3 1 Ronding Up/Down to a Mltiple of a Known Power of Ronding an nsigned integer down to, for eample, the net smaller mltiple of
More informationFINITE ELEMENT APPROXIMATION OF CONVECTION DIFFUSION PROBLEMS USING GRADED MESHES
FINITE ELEMENT APPROXIMATION OF CONVECTION DIFFUSION PROBLEMS USING GRADED MESHES RICARDO G. DURÁN AND ARIEL L. LOMBARDI Abstract. We consider the nmerical approximation of a model convection-diffsion
More informationComputer User s Guide 4.0
Compter User s Gide 4.0 2001 Glenn A. Miller, All rights reserved 2 The SASSI Compter User s Gide 4.0 Table of Contents Chapter 1 Introdction...3 Chapter 2 Installation and Start Up...5 System Reqirements
More informationEXAMINATIONS 2010 END OF YEAR NWEN 242 COMPUTER ORGANIZATION
EXAINATIONS 2010 END OF YEAR COPUTER ORGANIZATION Time Allowed: 3 Hors (180 mintes) Instrctions: Answer all qestions. ake sre yor answers are clear and to the point. Calclators and paper foreign langage
More informationFast Obstacle Detection using Flow/Depth Constraint
Fast Obstacle etection sing Flow/epth Constraint S. Heinrich aimlerchrylser AG P.O.Box 2360, -89013 Ulm, Germany Stefan.Heinrich@aimlerChrysler.com Abstract The early recognition of potentially harmfl
More information4.13 Advanced Topic: An Introduction to Digital Design Using a Hardware Design Language 345.e1
.3 Advanced Topic: An Introdction to Digital Design Using a Hardware Design Langage 35.e.3 Advanced Topic: An Introdction to Digital Design Using a Hardware Design Langage to Describe and odel a Pipeline
More informationMaking Full Use of Multi-Core ECUs with AUTOSAR Basic Software Distribution
Making Fll Use of Mlti-Core ECUs with AUTOSAR Basic Software Distribtion Webinar V0.1 2018-09-07 Agenda Motivation for Mlti-Core AUTOSAR Standard: SWC-Split MICROSAR Extension: BSW-Split BSW-Split: Technical
More informationMultiple-Choice Test Chapter Golden Section Search Method Optimization COMPLETE SOLUTION SET
Mltiple-Choice Test Chapter 09.0 Golden Section Search Method Optimization COMPLETE SOLUTION SET. Which o the ollowing statements is incorrect regarding the Eqal Interval Search and Golden Section Search
More informationh-vectors of PS ear-decomposable graphs
h-vectors of PS ear-decomposable graphs Nima Imani 2, Lee Johnson 1, Mckenzie Keeling-Garcia 1, Steven Klee 1 and Casey Pinckney 1 1 Seattle University Department of Mathematics, 901 12th Avene, Seattle,
More informationAugmenting the edge connectivity of planar straight line graphs to three
Agmenting the edge connectivity of planar straight line graphs to three Marwan Al-Jbeh Mashhood Ishaqe Kristóf Rédei Diane L. Sovaine Csaba D. Tóth Pavel Valtr Abstract We characterize the planar straight
More informationIMPLEMENTATION OF OBJECT ORIENTED APPROACH TO MODIFIED ANT ALGORITHM FOR TASK SCHEDULING IN GRID COMPUTING
International Jornal of Modern Engineering Research (IJMER) www.imer.com Vol.1, Isse1, pp-134-139 ISSN: 2249-6645 IMPLEMENTATION OF OBJECT ORIENTED APPROACH TO MODIFIED ANT ALGORITHM FOR TASK SCHEDULING
More informationSketch-Based Aesthetic Product Form Exploration from Existing Images Using Piecewise Clothoid Curves
Sketch-Based Aesthetic Prodct Form Exploration from Existing Images Using Piecewise Clothoid Crves Günay Orbay, Mehmet Ersin Yümer, Levent Brak Kara* Mechanical Engineering Department Carnegie Mellon University
More informationCost Based Local Forwarding Transmission Schemes for Two-hop Cellular Networks
Cost Based Local Forwarding Transmission Schemes for Two-hop Celllar Networks Zhenggang Zhao, Xming Fang, Yan Long, Xiaopeng H, Ye Zhao Key Lab of Information Coding & Transmission Sothwest Jiaotong University,
More informationFunctions of Combinational Logic
CHPTER 6 Fnctions of Combinational Logic CHPTER OUTLINE 6 6 6 6 6 5 6 6 6 7 6 8 6 9 6 6 Half and Fll dders Parallel inary dders Ripple Carry and Look-head Carry dders Comparators Decoders Encoders Code
More informationCS 251, Winter 2018, Assignment % of course mark
CS 25, Winter 28, Assignment 4.. 3% of corse mark De Wednesday, arch 7th, 4:3P Lates accepted ntil Thrsday arch 8th, am with a 5% penalty. (6 points) In the diagram below, the mlticycle compter from the
More informationCS 450: COMPUTER GRAPHICS REVIEW: CLIPPING SPRING 2015 DR. MICHAEL J. REALE
CS 45: COMPUTER GRAPHICS REVIEW: CLIPPING SPRING 215 DR. MICHAEL J. REALE CLIPPING Clipping = removing part or all of the primitives otside of the clipping volme/window Clipping volme in OpenGL nit cbe
More informationCS 153 Design of Operating Systems
CS 153 Design of Operating Systems Spring 18 Lectre 3: OS model and Architectral Spport Instrctor: Chengy Song Slide contribtions from Nael Ab-Ghazaleh, Harsha Madhyvasta and Zhiyn Qian Last time/today
More informationReal-time mean-shift based tracker for thermal vision systems
9 th International Conference on Qantitative InfraRed Thermography Jly -5, 008, Krakow - Poland Real-time mean-shift based tracker for thermal vision systems G. Bieszczad* T. Sosnowski** * Military University
More informationLecture 10. Diffraction. incident
1 Introdction Lectre 1 Diffraction It is qite often the case that no line-of-sight path exists between a cell phone and a basestation. In other words there are no basestations that the cstomer can see
More informationIllumina LIMS. Software Guide. For Research Use Only. Not for use in diagnostic procedures. Document # June 2017 ILLUMINA PROPRIETARY
Illmina LIMS Software Gide Jne 2017 ILLUMINA PROPRIETARY This docment and its contents are proprietary to Illmina, Inc. and its affiliates ("Illmina"), and are intended solely for the contractal se of
More informationCurve Modeling (Spline) Dr. S.M. Malaek. Assistant: M. Younesi
Crve Modeling Sline Dr. S.M. Malae Assistant: M. Yonesi Crve Modeling Sline Crve Control Points Convex Hll Shae of sline crve Interolation Slines Aroximation Slines Continity Conditions Parametric & Geometric
More informationCS 153 Design of Operating Systems Spring 18
CS 53 Design of Operating Systems Spring 8 Lectre 2: Virtal Memory Instrctor: Chengy Song Slide contribtions from Nael Ab-Ghazaleh, Harsha Madhyvasta and Zhiyn Qian Recap: cache Well-written programs exhibit
More informationWhat s New in AppSense Management Suite Version 7.0?
What s New in AMS V7.0 What s New in AppSense Management Site Version 7.0? AppSense Management Site Version 7.0 is the latest version of the AppSense prodct range and comprises three prodct components,
More informationA Highly-Digital Frequency Synthesizer Using Ring Oscillator Frequency-to-Digital Conversion and Noise Cancellation
A Highly- Freqency Synthesizer Using Ring Oscillator Freqency-to- Conversion and Noise Cancellation Colin Weltin-W,2, Gobi Zhao, Ian Galton University of California at San Diego, La Jolla, CA 2 Analog
More informationUnit Testing with VectorCAST and AUTOSAR
Unit Testing with VectorCAST and AUTOSAR Vector TechDay Software Testing with VectorCAST V1.0 2018-11-15 Agenda Introdction Unit Testing Demo Working with AUTOSAR Generated Code Unit Testing AUTOSAR SWCs
More informationAn Adaptive Strategy for Maximizing Throughput in MAC layer Wireless Multicast
University of Pennsylvania ScholarlyCommons Departmental Papers (ESE) Department of Electrical & Systems Engineering May 24 An Adaptive Strategy for Maximizing Throghpt in MAC layer Wireless Mlticast Prasanna
More informationSTABILITY OF SIMULTANEOUS RECURRENT NEURAL NETWORK DYNAMICS FOR STATIC OPTIMIZATION
STABILITY OF SIMULTANEOUS RECURRENT NEURAL NETWOR DYNAMICS FOR STATIC OPTIMIZATION Grsel Serpen and Yifeng X Electrical Engineering and Compter Science Department, The University of Toledo, Toledo, OH
More informationAlliances and Bisection Width for Planar Graphs
Alliances and Bisection Width for Planar Graphs Martin Olsen 1 and Morten Revsbæk 1 AU Herning Aarhs University, Denmark. martino@hih.a.dk MADAGO, Department of Compter Science Aarhs University, Denmark.
More informationMaximal Cliques in Unit Disk Graphs: Polynomial Approximation
Maximal Cliqes in Unit Disk Graphs: Polynomial Approximation Rajarshi Gpta, Jean Walrand, Oliier Goldschmidt 2 Department of Electrical Engineering and Compter Science Uniersity of California, Berkeley,
More informationEEC 483 Computer Organization. Branch (Control) Hazards
EEC 483 Compter Organization Section 4.8 Branch Hazards Section 4.9 Exceptions Chans Y Branch (Control) Hazards While execting a previos branch, next instrction address might not yet be known. s n i o
More informationPARAMETER OPTIMIZATION FOR TAKAGI-SUGENO FUZZY MODELS LESSONS LEARNT
PAAMETE OPTIMIZATION FO TAKAGI-SUGENO FUZZY MODELS LESSONS LEANT Manfred Männle Inst. for Compter Design and Falt Tolerance Univ. of Karlsrhe, 768 Karlsrhe, Germany maennle@compter.org Brokat Technologies
More informationMETAMODEL FOR SOFTWARE SOLUTIONS IN COMPUTED TOMOGRAPHY
VOL. 10, NO 22, DECEBER, 2015 ISSN 1819-6608 ETAODEL FOR SOFTWARE SOLUTIONS IN COPUTED TOOGRAPHY Vitaliy ezhyev Faclty of Compter Systems and Software Engineering, Universiti alaysia Pahang, Gambang, alaysia
More informationEnhanced Performance with Pipelining
Chapter 6 Enhanced Performance with Pipelining Note: The slides being presented represent a mi. Some are created by ark Franklin, Washington University in St. Lois, Dept. of CSE. any are taken from the
More informationMaximum Weight Independent Sets in an Infinite Plane
Maximm Weight Independent Sets in an Infinite Plane Jarno Nosiainen, Jorma Virtamo, Pasi Lassila jarno.nosiainen@tkk.fi, jorma.virtamo@tkk.fi, pasi.lassila@tkk.fi Department of Commnications and Networking
More informationSubgraph Matching with Set Similarity in a Large Graph Database
1 Sbgraph Matching with Set Similarity in a Large Graph Database Liang Hong, Lei Zo, Xiang Lian, Philip S. Y Abstract In real-world graphs sch as social networks, Semantic Web and biological networks,
More informationThe Occlusion Camera
EUROGRAPHICS 2005 / M. Alexa and J. Marks Volme 24 (2005, Nmber 3 (Gest Editors The Occlsion Camera Chnhi Mei, Voic Popesc, and Elisha Sacks Prde University Abstract We introdce the occlsion camera: a
More informationConstrained Routing Between Non-Visible Vertices
Constrained Roting Between Non-Visible Vertices Prosenjit Bose 1, Matias Korman 2, André van Renssen 3,4, and Sander Verdonschot 1 1 School of Compter Science, Carleton University, Ottawa, Canada. jit@scs.carleton.ca,
More informationConstructing and Comparing User Mobility Profiles for Location-based Services
Constrcting and Comparing User Mobility Profiles for Location-based Services Xihi Chen Interdisciplinary Centre for Secrity, Reliability and Trst, University of Lxemborg Jn Pang Compter Science and Commnications,
More informationA GENERIC MODEL OF A BASE-ISOLATED BUILDING
Chapter 5 A GENERIC MODEL OF A BASE-ISOLATED BUILDING This chapter draws together the work o Chapters 3 and 4 and describes the assembly o a generic model o a base-isolated bilding. The irst section describes
More informationFast Ray Tetrahedron Intersection using Plücker Coordinates
Fast Ray Tetrahedron Intersection sing Plücker Coordinates Nikos Platis and Theoharis Theoharis Department of Informatics & Telecommnications University of Athens Panepistemiopolis, GR 157 84 Ilissia,
More informationIntroduction to Computational Manifolds and Applications
IMPA - Institto de Matemática Pra e Aplicada, Rio de Janeiro, RJ, Brazil Introdction to Comptational Manifolds and Applications Part 1 - Constrctions Prof. Marcelo Ferreira Siqeira mfsiqeira@dimap.frn.br
More informationAAA CENTER FOR DRIVING SAFETY & TECHNOLOGY
AAA CENTER FOR DRIVING SAFETY & TECHNOLOGY 2017 FORD MUSTANG PREMIUM CONVERTIBLE INFOTAINMENT SYSTEM* DEMAND RATING Very High Demand The Ford Mstang Convertible s SYNC 3 (version 2.20) infotainment system
More informationFree-Form Deformation and Other Deformation Techniques
Free-Form Deformation and Other Deformation Techniques Deformation Deformation Basic Definition Deformation: A transformation/mapping of the positions of every particle in the original object to those
More informationABSOLUTE DEFORMATION PROFILE MEASUREMENT IN TUNNELS USING RELATIVE CONVERGENCE MEASUREMENTS
Proceedings th FIG Symposim on Deformation Measrements Santorini Greece 00. ABSOUTE DEFORMATION PROFIE MEASUREMENT IN TUNNES USING REATIVE CONVERGENCE MEASUREMENTS Mahdi Moosai and Saeid Khazaei Mining
More information