The effectiveness of PIES comparing to FEM and BEM for 3D elasticity problems

Size: px
Start display at page:

Download "The effectiveness of PIES comparing to FEM and BEM for 3D elasticity problems"

Transcription

1 The effectiveness of PIES comparing to FEM and BEM for 3D elasticit problems A. Boltc, E. Zienik, K. Sersen Faclt of Mathematics and Compter Science, Universit of Bialstok, Sosnowa 64, Bialstok, Poland Abstract - The paper presents the reslts of research on the effectiveness of the PIES method developed b the athors, applied to modeling and solving comple 3D problems of elasticit. The reslts were compared with those obtained sing classical element methods FEM and BEM. For the calclation in mentioned methods we have sed professional programs ANSYS (FEM), BEASY (BEM) and or own software in the case of PIES. Several eamples were solved, bt we have inclded onl three of them, which seemed to be enogh comple. The effectiveness of methods was compared taking into accont: the nmber of inpt data reqired to define the geometr, the wa of modeling and imposing the bondar conditions, the nmber of solved algebraic eqations and the accrac and reliabilit of the reslts. Kewords - compter modeling and simlation, bondar problems, nmerical methods, PIES, FEM, BEM 1 Introdction Compter simlations in engineering problems are widespread, and even necessar. For modeling and solving bondar problems are sed so-called compter methods, among which the most poplar are the finite element method (FEM) [1,2,3] and the bondar element method (BEM) [2,4,5]. Both methods are sed for man ears, ths is available a commercial software implementing them. The main idea of these methods is modeling of an areas b the discretiation of the bondar (BEM) or the bondar and domain (FEM). This cases great possibilities taking into accont the compleit of considered geometries, becase an shape can be modeled b dividing it into smaller elements. However, on the other hand, the nmber of inpt data, the nmber of algebraic eqations in the sstem, which is solved to obtain final soltions, the time and effort we have to invested increase. In addition, we receive a nmber of redndant soltions at initiall defined bondar nodes (and area nodes), and in the case of insfficient accrac of the reslts we have to repeat the process of discretiation. These reasons were encoraged to searching and eventall developing a method, which wold at least partiall eliminated mentioned drawbacks. Or previos research reslted in the creation of the parametric integral eqation sstem (PIES) [6], in which the bondar geometr is analticall inclded and can be defined sing crves (2D) or srfaces (3D) known from compter graphics [7]. The effectiveness of this approach lies in the separation of the simltaneos approimation of the bondar geometr from the fnction which is the soltion of the eqation on the bondar. It gives a possibilit for modeling areas withot interfering in the approimation of the soltion and vice versa. Till now, the proposed approach was tested taking into accont 2D [8,9] and 3D [10,11] problems modeled b Laplace s, Poisson, Helmholt and Navier-Lame eqations. In 3D problems modeled b the last mentioned eqation, however, verification was referred onl to the comparison of obtained reslts with analtical soltions for fairl elementar eamples [12]. However, the main aim of the athors was to create an alternative to FEM and BEM, hence the necessit of the comparison of reslts obtained sing PIES with these methods. The first stdies on the comparison with BEM on the ver elementar shape (the cbe) was carried ot in [13]. The main aim of this paper is to eamine the effectiveness of the nmerical implementation of PIES for solving comple 3D problems of elasticit in comparison with classical methods. To implement FEM software ANSYS was sed, in the case of BEM - BEASY, whilst in PIES athors own software. Following sbjects were compared: the nmber and tpe of inpt data reqired to define the bondar geometr, the nmber of solved algebraic eqations and the accrac of calclations. 2 Comparative analsis of FEM, BEM and PIES In order to demonstrate the reliabilit and effectiveness of the proposed and tested in the paper PIES method, it is necessar to compare it with known nmerical methods, especiall with FEM and BEM. Histor and the mathematical basis of these methods are widel described in the literatre. In the case of FEM all abot its formlation and its compter aspects can be fond among others in [1,2,3]. Also BEM, despite the fact that it is a new compter method has a nmber of papers on it. Ths, information abot the following stages of solving bondar problems b BEM and its applications are available for eample in [2,4,5]. The PIES approach has been developed as an alternative to mentioned methods, and the first reslts of research were pblished in 2001 [6]. In a series of sbseqent papers we have inclded and described: the new techniqe of global modeling of the bondar in a parametric wa (withot the discretiation), the obtained PIES for varios differential eqations and the wa of its nmerical solving

2 [10,8,9,11,12,13]. De to the fact that each of mentioned methods has been alread repeatedl characteried, the paper is limited onl to a brief smmar of their advantages and drawbacks, and also potential possibilities. This smmar is given in Table 1. Table 1 The comparison of considered methods Featre FEM BEM PIES generalit high possibilit of application onl if a fndamental soltion as in BEM discretiation workload / compting resorces / time accrac soltions mathematical aspects effectiveness of applications modification of the bondar geometr software bondar and domain b finite elements high, tedios thickening of a mesh, especiall in mltiple discretiation high at a high level of discretiation, the accrac of soltions and their derivatives is different discrete, at bondar and area nodes, a lot of nnecessar information matri is sparse, smmetrical and wellconditioned high, difficlties with infinite areas reqires rediscretiation of the modified area and its bondar widel available eists onl bondar b bondar elements, domain is discretied onl in some cases (e.g. material nonlinearit, Poisson eqation, et) smaller, redces the dimensionalit of the problem b one high, higher than in FEM at the same level of discretiation, the same accrac of soltions and their derivatives, less accrate soltions in the vicinit of the bondar discrete on the bondar, continos in the area, redndant information at bondar nodes difficlt to calclate singlar integrals, fll, asmmetrical, not positive definite and worse than in FEM conditioned matri infinite areas are considered in natral wa, not ver effective for thin areas reqires rediscretiation of the modified bondar and dividing of the area into cells in the case of integration over area less available than in FEM none, modeling as in compter graphics (b crves or srfaces) least, the minimm nmber of data for modeling and nmerical solving high, withot discretiation, the rest as in BEM continos, obtained at an points as in BEM as in BEM atomaticall adapts to the modified shape, modification b small nmber of points onl athors software As shown in Table I, the main differences between methods lies in the wa of modeling the area and the resltant benefits or disadvantages. Therefore, later in the paper this aspect is characteried more precisel, and modeling approaches sed in different methods are presented on the eample of the ball (Fig. 1). Fig. 1. Modeling of the ball b: a) FEM, b) BEM and c) PIES In the case of FEM modeling of the area is done sing socalled finite elements and is redced to divide the area and the bondar into smaller 3D sb-areas. Finite elements in this method serves two fnctions. The are sed to model the considered area and to facilitate the approimation of problem soltions on individal elements. Ths, is realied the simltaneos approimation of both the area (throgh its division into finite elements) and the soltions on each of finite elements b local shape fnctions. Eisting in FEM opportnit for sing different shape fnctions makes it possible to improve the accrac and convergence of the method. The most freqentl sed elements in 3D problems of elasticit are tetrahedral and heahedral elements of varios degrees, which involves posing of a different nmber of nodes to define them. Combining finite element leads to rising an element mesh representing the 3D area. Generation of the finite element mesh can be performed sing varios atomated techniqes (e.g. technolog of primitives, sperelements or trianglation) and man other programs that se these techniqes [1,14]. It shold be noted that in case of too low accrac of obtained b FEM soltions it is necessar to make a re-discretiation: into a greater nmber of elements, another kind or degree or jst a different arrangement. This is a tedios process and often totall nnecessar in terms of the accrac of the area definition. As mentioned earlier eample of sch modeling in FEM sing tetrahedral finite elements is shown in Fig.1a, where discretied was the whole area of the ball. Another method BEM is also based on the simltaneos approimation of the bondar geometr and bondar fnctions. From a practical point of view, the considered bondar shold be divided (discretied) into small segments called bondar elements and on each of them one shold assme the tpe of bondar fnction, in the form of known in advance shape fnction. Bondar elements sall take the form of triangles or qadrangles declared b the different nmber of nodes (e.g. triangles b 3, 6 or 9 nodes).

3 Used strateg of the simltaneos approimation of the bondar shape and bondar fnctions is one of the ke disadvantages of BEM. In order to improve the accrac of bondar soltions it is necessar to concentrate the nmber of nodes. There are two was (which reslt in increased cost of calclations): b introdcing elements of the higher degree (declared b the higher nmber of nodes) or the division of the bondar into the large nmber of bondar elements. In both cases, however, we still have to deal with the discrete form of the bondar fnction. The advantage in comparison to FEM is redction the dimensionalit of the problem b one, de to onl bondar discretiation, not the bondar and the area. An eample of modeling the ball b trianglar bondar elements is presented in Fig.1b, where onl the sphere is discretied. The method proposed b the athors is characteried b the elimination of the discretiation of both the area and the bondar. The wa of modeling the bondar for 3D isses is taken directl from compter graphics and is integrated in PIES. We are talking abot the se of the varios tpes of parametric srfaces, etremel poplar in compter visaliation of three-dimensional geometric objects, and also widel sed in the design of mechanical strctres in CAD sstems. The simplest srfaces are rectanglar Coons srfaces of the first degree [15]. These patches are characteried b the fact that to their practical definition is reqired, as shown in Fig.2a, imposing onl for corner points. Eqall simple in the declaration are trianglar srfaces [15], where it is necessar to define three vertices of this triangle (Fig.2b). However, these srfaces are flat, so the allow the modeling of onl polhedral areas. To model areas with crved bondar we shold take into accont srfaces of higher degrees, the most versatile and poplar are Béier rectanglar and trianglar patches of the third degree [16] (Fig.2c,d). eample of modeling in PIES sing trianglar Béier srfaces of the forth degree is presented in Fig. 1c, where a ball, or rather as in BEM its sphere, is defined b onl 8 sch srfaces (for each of the srfaces we have to define 15 control points). Mentioned patches can imitate an large and comple srfaces, so long as we are able to obtain the shape of considered part sing one srface. Comple geometries can be modeled in a similar manner sing the combination of mltiple srfaces. A ver important advantage of this techniqe is that the nmber of srfaces is associated onl with the possibilit of modeling the chosen phsical geometr. The accrac of soltions depends on the completel other elements, what comes from the main idea of the PIES method - the separation of the approimation of the bondar shape from bondar fnctions. Therefore, the shape of the bondar in PIES is defined sing the minimm nmber of srfaces needed for the accrate modeling, which eliminates the necessit for tedios mesh generation, and ths the process of discretiation. In addition, modeling sing srfaces is more effective, becase it helps ensre the class of continit at borders between srfaces. Eqall simple in PIES is the modification of the declared geometr. It reqires changing single corner or control points. It is worth to emphasied, that after modification PIES atomaticall adjsts to the new shape, becase sch are the mathematical basis of the method. Changing the location of even a single point reslts in a sbstantial change in the shape, which can be seen in Fig. 3. Fig. 3. Modification of the 3D area b moving one control point d. Fig. 2. Flat srfaces: a) rectanglar, b) trianglar and crvilinear: c) Béier rectanglar of the 3 degree, d) Béier trianglar of the 3 degree. In the case of the srfaces of higher degrees (than first) to define their shape it is necessar to pose so-called control points. Considering a rectanglar srface of the third degree we shold define coordinates of 16 control points, and 10 for trianglar one. In the case of increasing the degree of the srface increases also the nmber of control points. An It shold be noted that in FEM or BEM making a modification of the shape we are alwas dealing with the rediscretisation and generating a new mesh of elements. This is particlarl disadvantageos and inefficient in the problems of optimiation or identification of the bondar geometr, where revised geometr modeling is done man times in sbseqent steps of an iterative process. 3 Analsis of reslts In order to show the effectiveness and confirm the reliabilit of PIES paper presents three eamples. To solve problems sing all considered methods we have sed a software mentioned in the introdction of the paper. Compared were: the nmber of inpt data needed to define the bondar and bondar conditions, the nmber of solved algebraic

4 eqations and the accrac and convergence of the reslts. 3.1 Eample 1 The first eample concerns a polhedron presented in Fig. 4a. The considered rectanglar cboid, which is a bracket, is firml fied at the left end and sbjected to a niform normal load p 5 MPa acting along the pper side. Selected for the calclation vales of material constants are Yong's modls E 1 MPa and Poisson's ratio v The same constants were adopted in all the eamples presented in the paper. a. b. Fig. 4. A bracket with bondar conditions modeled in PIES (a) and meshes from: BEASY (b) and ANSYS (c) Taking into accont tested in the paper method PIES the considered shape is ver simple to model, becase its faces are rectangles. For this reason, defining the geometr is limited to the se of the simplest flat srfaces rectanglar Coons srfaces of the first degree. For each of them we have to define onl corner points, reslting in a si srfaces and 8 corner points. Ths, the considered shape was modeled sing the minimm amont of data that allows its accrate projection. For the nmerical soltion of the problem we have assmed a niform distribtion of 25 collocation points on each srface. As a reslt, the sstem of 450 algebraic eqations was solved. The aim of this std is to eamine the effectiveness of PIES compared to classical element methods, sch as FEM and BEM. Particlar emphasis is placed on the comparison of the wa of modeling the shape and the accrac of obtained reslts. For this reason, the same problem was solved sing the ANSYS software and BEASY. In both cases, we have searched for the mesh for which the minimm nmber of elements gives stable soltions. Finall, in ANSYS we have sed node heahedral finite elements tpe SOLID45 (defined sing nodes) and the sstem of algebraic eqations was solved. In the case of BEASY 600 qadrilateral qadratic elements were sed, whilst in order to define them 2046 bondar nodes were imposed. Finall, in order to obtain the final reslts the sstem of 6138 algebraic eqations was solved. A detailed analsis of the effectiveness of modeling the considered polhedron for each of the three considered above methods is shown in the table below. Table 2 The comparison of considered methods in terms of the nmber of data PIES BEM FEM bondar modeling nmber and tpe of data nmber of algebraic eqations imposing the bondar conditions obtaining of soltions 6 rectanglar Coons srfaces 8 corner points 600 qadratic qadrilateral bondar elements 2046 bondar nodes node heahedral finite elements nodes in the bondar and area continos on each srface at an point of the bondar and area discrete at 2046 bondar nodes and an point of the area discrete at nodes in the area and bondar The first comparison of methods in terms of the nmber of data for modeling, the nmber of solved algebraic eqations, and the wa of obtaining the reslts came ot favorabl for PIES. Net, we shold check whether this redction in the nmber of data will not redce the accrac of soltions. Therefore, the vales of displacements in all directions at 13 points of the horiontal cross-section passing throgh the center of the area were eamined. The reslts obtained b PIES, BEM and FEM are presented in Table 3. Table 3 The comparison of displacements obtained b considered methods point FEM BEM PIES FEM BEM PIES FEM BEM PIES As shown in Table 3 obtained b each method soltions are characteried b a similar level of accra This allows to confirm the reliabilit of proposed and tested b the athors

5 method, bt also to emphasie the fact that these reslts were obtained in a mch more efficient wa than in classical methods FEM and BEM. In their case, the mesh was generated consisting of a large nmber of finite or bondar elements, mch more nmeros sstem of algebraic eqations was solved and was obtained a nmber of redndant information at the nodes of the bondar or area. 3.2 Eample 2 In Eample 2, we have considered a polhedron of more comple shape shown in Fig. 5a, firml fied and sbjected to a niform normal load p 10 MPa. Fig.5. Considered geometr and bondar conditions a) PIES, b) BEASY and c) ANSYS In the PIES software the analed polhedral shape was modeled onl b rectanglar Coons srfaces (Fig.5a). Shold be emphasied fleibilit in the shape of srfaces (rectanglar and trapeoidal) and their sie. Generated in sch wa bondar was modeled b the minimm nmber of inpt data after posing 16 corner points and defining 14 rectanglar Coons srfaces. For calclations we have consider 25 collocation points on each srface arranged niforml. Finall, this involves the soltion of 1050 eqations reqired to obtain the final reslts. The same shape was modeled in BEM (with the help of BEASY) sing 205 qadratic qadrilateral elements, for which definition 903 nodes were sed (Fig. 5b), and ths the sstem of 2709 algebraic eqations was solved. The last stage concerned the modeling of the problem sing the FEM method (ANSYS). Fig. 5c presents the area defined b node heahedral finite elements, for which definition we reqire nodes. Finall the sstem consisting of algebraic eqations was solved. It shold be noted that the nmber of nodes in FEM and BEM is several times higher compared with 16 corner points in PIES. The advantage of PIES is also the nmber of solved algebraic eqations, ver important for the accrac of the final soltions. Nmerical error in fact ma increase with the increase in the nmber of eqations in the solved sstem. The smmar of the tpe and nmber of data sed for modeling is presented in Table 4. Table 4 The comparison of considered methods in terms of the nmber of data PIES BEM FEM bondar modeling nmber and tpe of data nmber of algebraic eqations 14 rectanglar Coons srfaces 16 corner points 205 qadratic qadrilateral elements 903 bondar nodes node heahedral finite elements bondar and area nodes The effectiveness of the proposed method was shown taking into accont the wa of the shape modeling, the nmber of necessar inpt data and the nmber of eqations solved. Bt eqall important qestion to be answered is the level of the accrac of obtained b PIES soltions compared to the reslts obtained sing ANSYS and BEASY. Displacement vales,, were eamined at 16 selected points of the domain, and the reslts of the comparison are given in Fig. 6. As can be seen in Fig.6 reslts obtained b BEASY, ANSYS and PIES are similar taking into accont the vales of displacements, as well as their distribtion. In order to accratel anale the reslts, Table 5 contains the eact soltions at few selected points. As seen, at most points the soltions are ver similar, and occrred differences will be eplained in the frther stages of the development of the method. It shold be stressed again that soltions throgh PIES were obtained at 2.5 times less nmeros sstem of eqations than in BEM. Mch, mch more data and nknowns are in the FEM method. Ths, with mch less effort on modeling and mch smaller nmber of inpt data we have obtained reliable soltions b PIES. a.

6 flat rectanglar Coons srfaces with bondar conditions (niform normal load p 1 MPa) is shown in Fig. 7a. b. Fig. 7. Considered geometr modeled in a) PIES, b) BEM (BEASY) Fig. 6. Displacements a), b), c) PIES, BEASY and ANSYS at considered points obtained b Table 5 The comparison of displacements obtained b FEM, BEM and PIES ANSYS BEASY PIES A complete declaration of the bondar defined in PIES b 14 srfaces reqires 112 points (control points of Béier and corner points of Coons srfaces). In Fig. 7a, for clarit, onl for main points of each srface are marked. On each srface we have defined 25 niforml spaced collocation points and eventall have solved the sstem of 1050 algebraic eqations. In connection with some reglarit of reslts observed in two previos eamples, this time the effectiveness and accrac of the proposed method were compared onl with BEM. For this reason, the considered geometr was modeled in BEASY (Fig.7b), where as in the previos eample, for the comparative analsis we have chosen sch mesh for which the minimm nmber of elements gives stable nmerical soltions. Finall, 104 qadrilateral and trianglar qadratic elements defined b 475 nodes were sed. The nmber of algebraic eqations that had to be solved is Soltions from varios cross-sections were analed, bt we have decided to inclde onl one of them 1.5, 4.5 1, 1. Vales of displacements obtained b PIES and classical BEM implemented b BEASY are presented in Fig.8. In order to detailed analsis of the reliabilit of obtained b PIES soltions we have also eamined stress vales, which selected components are presented in Fig Eample 3 In practical applications, ecept bondar problems defined in polhedral areas, ver important are also isses defined in areas with crvilinear bondaries. These bondaries in PIES can be described sing Béier srface patches. An eample of the geometr modeled b 7 rectanglar Béier srfaces of the third degree (crved bondar fragments) and 5 Fig. 8. Displacements in the considered cross-section

7 Fig. 9. Stresses in the analed cross-section As can be seen from above figres, both displacements and stresses obtained sing the proposed and developed b the athors method are characteried b high accrac in comparison to BEM. Lines representing the varios fnctions of soltions have the same shape, which shows a similar accrac of considered techniqes. It shold be noted that in BEM the wa of modeling of the bondar geometr is mch less efficient (the discretiation), which eventall leads to the soltion of the eqation sstem containing approimatel 1.5- times more of algebraic eqations. The se of PIES limits time to data preparation, their analsis, and finall minimie the set of soltions to those that are necessar for analsis. 4 Conclsions The paper presents the effectiveness of solving 3D bondar vale problems of elasticit sing the proposed PIES method. A nmber of eamples were solved, for which we have compared with classical element methods (FEM, BEM): the data necessar to model the geometr (the tpe and nmber), the wa of the modeling and posing of bondar conditions, as well as the reliabilit of reslts (displacements and stresses). It can be stated that obtained sing PIES soltions are comparable to those obtained with other nmerical methods, however, the are obtained with a mch smaller nmber of inpt data. Moreover, the sstem of eqations solved in PIES is mch less nmeros, and soltions can be obtained at an points of the bondar and area, not previosl selected nodes. 5 Acknowledgment This work is fnded b resorces for science in the ears as a research project. 6 References [1] O. C. Zienkiewic, R. L. Talor. The Finite Element Method. McGraw- Hill, [2] M. Ameen. Comptational elasticit. Alpha Science International Ltd., [3] R. D. Cook. Finite element modeling for stress analsis. John Wile&Sons, [4] M. H. Aliabadi. The bondar element method vol. 2. Applications in Solid and Strctres. John Wile&Sons, Ltd, [5] C. A. Brebbia, J. Dominge. Bondar element methods for potential problems ; Applied Mathematical Modelling, 1, , [6] E. Zienik. Potential problems with polgonal bondaries b a BEM with parametric linear fnctions ; Engineering Analsis with Bondar Elements, 25, , [7] G. Farin. Crves and Srfaces for compter Aided Geometric Design. Academic Press In, [8] E. Zienik, A. Bołtć. Non-element method of solving 2D bondar problems defined on polgonal domains modeled b Navier eqation ; International Jornal of Solid and Strctres, 43, , [9] E. Zienik, A. Bołtć. Béier crves in the modeling of bondar geometr for 2D bondar problems defined b Helmholt eqation ; Jornal of Comptational Acostics, 14/3, , [10] E. Zienik, K. Serseń. Linear Coons srfaces in the modeling of polgonal geometries in 3D bondar problems modeled b Laplace eqation ; Archiwm Informatki Teoretcnej i Stosowanej, 17/2, , 2005 (in polish). [11] E. Zienik, K. Serseń. Trianglar Béier patches in modelling smooth bondar srface in eterior Helmholt problems solved b PIES ; Archives of Acostics, 1/34, 1-11, [12] E. Zienik, K. Serseń, A. Bołtć. PIES in solving 3D bondar problems modeled b Navier-Lame eqation in polhedral areas ; Modelowanie Inżnierskie, 11/42, , 2011 (in polish). [13] E. Zienik, A. Bołtć, K. Serseń. The effectiveness of PIES compared to BEM in the modelling of 3D polgonal problems defined b Navier-Lame eqations ; Proceedings of 2nd International Conference on Information and Commnication, 77-82, Amsterdam, Holland, [14] P. Ladevèe, J.T. Oden (Editors). Advances in Adaptive Comptational Methods in Mechanics ; Stdies in Applied Mechanics, 47, [15] M. Mortenson. Mathematics for Compter Graphics Applications: An Introdction to the Mathematics and Geometr of Cad/Cam. Geometric Modeling, Scientific Visaliation, and Other CG Applications, Indstrial Press, [16] P. Kiciak. Fndamentals of modeling crves and srfaces. WNT, 2000 (in polish).

Advanced Techniques for Predicting Mechanical Product Design via COMSOL Multiphysics

Advanced Techniques for Predicting Mechanical Product Design via COMSOL Multiphysics Advanced Techniqes for Predicting Mechanical Prodct Design via COMSOL Mltiphsics Shobing Zhang 1 1 CAEaid, Inc. *Corresponding athor: 184 Jeffs Ln, Astin, TX 78717, shobing.hang@caeaid.com Abstract: Mechanical

More information

Switched state-feedback controllers with multi-estimators for MIMO systems

Switched state-feedback controllers with multi-estimators for MIMO systems Proceedings of the th WEA Int Conf on COMPUTATIONAL INTELLIGENCE MAN-MACHINE YTEM AND CYBERNETIC Venice Ital November - 6 89 witched state-feedback controllers with mlti-estimators for MIMO sstems LIBOR

More information

A sufficient condition for spiral cone beam long object imaging via backprojection

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

CS 4204 Computer Graphics

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

CS 450: COMPUTER GRAPHICS REVIEW: CLIPPING SPRING 2015 DR. MICHAEL J. REALE

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

Tu P7 15 First-arrival Traveltime Tomography with Modified Total Variation Regularization

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

Multiple-Choice Test Chapter Golden Section Search Method Optimization COMPLETE SOLUTION SET

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

Bias of Higher Order Predictive Interpolation for Sub-pixel Registration

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

Curves and Surfaces. CS 537 Interactive Computer Graphics Prof. David E. Breen Department of Computer Science

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

Picking and Curves Week 6

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 information

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

Master for Co-Simulation Using FMI

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

Maximum Weight Independent Sets in an Infinite Plane

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

Method to build an initial adaptive Neuro-Fuzzy controller for joints control of a legged robot

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

Lecture 1: Introduction

Lecture 1: Introduction Lectre : Introdction.. Introdction The Finite Element Method (FEM) is a nmerical techniqe to find approimate soltions of partial differential eqations. It as originated from the need of soling comple elasticit

More information

Continuity Smooth Path Planning Using Cubic Polynomial Interpolation with Membership Function

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

Evaluating Influence Diagrams

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

On the Computational Complexity and Effectiveness of N-hub Shortest-Path Routing

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

FINITE ELEMENT APPROXIMATION OF CONVECTION DIFFUSION PROBLEMS USING GRADED MESHES

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

STABILITY OF SIMULTANEOUS RECURRENT NEURAL NETWORK DYNAMICS FOR STATIC OPTIMIZATION

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

The Disciplined Flood Protocol in Sensor Networks

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

Uncertainty Determination for Dimensional Measurements with Computed Tomography

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

An Optimization of Granular Network by Evolutionary Methods

An Optimization of Granular Network by Evolutionary Methods An Optimization of Granlar Networ by Evoltionary Methods YUN-HEE HAN, KEUN-CHANG KWAK* Dept. of Control, Instrmentation, and Robot Engineering Chosn University 375 Seos-dong, Dong-g, Gwangj, 50-759 Soth

More information

Optimal Sampling in Compressed Sensing

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

Automatic Fault Detection for 3D Seismic Data

Automatic Fault Detection for 3D Seismic Data Atomatic Falt Detection for 3D Seismic Data David Gibson 1, Michael Spann 1 and Jonathan Trner 1 School of Electronic Engineering, Universit of Birmingham, Edgbaston, Birmingham, B15 TT, U.K. {gibsond,

More information

Date: December 5, 1999 Dist'n: T1E1.4

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

Homing, Calibration and Model-Based Predictive Control for Planar Parallel Robots

Homing, Calibration and Model-Based Predictive Control for Planar Parallel Robots Homing, Calibration and Model-Based Predictive Control for Planar Parallel Robots Květoslav Belda*, Pavel Píša** * Department of Adaptive Sstems, Institte of Information heor and Atomation, Academ of Sciences

More information

Discrete Cost Multicommodity Network Optimization Problems and Exact Solution Methods

Discrete Cost Multicommodity Network Optimization Problems and Exact Solution Methods Annals of Operations Research 106, 19 46, 2001 2002 Klwer Academic Pblishers. Manfactred in The Netherlands. Discrete Cost Mlticommodity Network Optimization Problems and Exact Soltion Methods MICHEL MINOUX

More information

Image Enhancement in the Frequency Domain Periodicity and the need for Padding:

Image Enhancement in the Frequency Domain Periodicity and the need for Padding: Prepared B: Dr. Hasan Demirel PhD Image Enhancement in the Freqenc Domain Periodicit and the need for Padding: Periodicit propert of the DFT: The discrete Forier Transform and the inverse Forier transforms

More information

Computer-Aided Mechanical Design Using Configuration Spaces

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

Prof. Kozyrakis. 1. (10 points) Consider the following fragment of Java code:

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

Hardware-Accelerated Free-Form Deformation

Hardware-Accelerated Free-Form Deformation 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

More information

REPLICATION IN BANDWIDTH-SYMMETRIC BITTORRENT NETWORKS. M. Meulpolder, D.H.J. Epema, H.J. Sips

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

Blended Deformable Models

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

Object Pose from a Single Image

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

Introduction to Computational Manifolds and Applications

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

Real-time mean-shift based tracker for thermal vision systems

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

POWER-OF-2 BOUNDARIES

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

10.2 Solving Quadratic Equations by Completing the Square

10.2 Solving Quadratic Equations by Completing the Square . Solving Qadratic Eqations b Completing the Sqare Consider the eqation We can see clearl that the soltions are However, What if the eqation was given to s in standard form, that is 6 How wold we go abot

More information

Advance Fuzzy Programming Approach to Bi-Level Quadratic Fractional Programming Problems by Genetic Algorithm

Advance Fuzzy Programming Approach to Bi-Level Quadratic Fractional Programming Problems by Genetic Algorithm American International Jornal of Research in Science, Technology, Engineering & Mathematics Available online at http://www.iasir.net ISSN (Print): 38-349, ISSN (Online): 38-3580, ISSN (CD-ROM): 38-369

More information

Enhanced Performance with Pipelining

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

StaCo: Stackelberg-based Coverage Approach in Robotic Swarms

StaCo: Stackelberg-based Coverage Approach in Robotic Swarms Maastricht University Department of Knowledge Engineering Technical Report No.:... : Stackelberg-based Coverage Approach in Robotic Swarms Kateřina Staňková, Bijan Ranjbar-Sahraei, Gerhard Weiss, Karl

More information

A Frequency-optimized Discontinuous Formulation for Wave Propagation Problems

A Frequency-optimized Discontinuous Formulation for Wave Propagation Problems th Flid Dynamics Conference and Ehibit 8 Jne - Jly, Chicago, Illinois AIAA -55 A Freqency-optimized Discontinos Formlation for Wave Propagation Problems Yi Li and Z. J. Wang Department of Aerospace Engineering

More information

DETC2002/DAC DESIGN OPTIMIZATION FOR STRUCTURAL-ACOUSTIC PROBLEMS USING FEM-BEM

DETC2002/DAC DESIGN OPTIMIZATION FOR STRUCTURAL-ACOUSTIC PROBLEMS USING FEM-BEM Proceedings of DETC 02 AME 2002 Design Engineering Technical Conferences and Compters and Information in Engineering Conference Montreal, CANADA, eptember 29-October 2, 2002 DETC2002/DAC-34131 DEIGN OPTIMIZATION

More information

Networks An introduction to microcomputer networking concepts

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

Pavlin and Daniel D. Corkill. Department of Computer and Information Science University of Massachusetts Amherst, Massachusetts 01003

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

Multi-lingual Multi-media Information Retrieval System

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

OPTI-502 Optical Design and Instrumentation I John E. Greivenkamp Homework Set 9 Fall, 2018

OPTI-502 Optical Design and Instrumentation I John E. Greivenkamp Homework Set 9 Fall, 2018 OPTI-502 Optical Design and Instrmentation I John E. Greivenkamp Assigned: 10/31/18 Lectre 21 De: 11/7/18 Lectre 23 Note that in man 502 homework and exam problems (as in the real world!!), onl the magnitde

More information

A GENERIC MODEL OF A BASE-ISOLATED BUILDING

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

AUTOMATIC REGISTRATION FOR REPEAT-TRACK INSAR DATA PROCESSING

AUTOMATIC REGISTRATION FOR REPEAT-TRACK INSAR DATA PROCESSING AUTOMATIC REGISTRATION FOR REPEAT-TRACK INSAR DATA PROCESSING Mingsheng LIAO, Li ZHANG, Zxn ZHANG, Jiangqing ZHANG Whan Technical University of Srveying and Mapping, Natinal Lab. for Information Eng. in

More information

IDENTIFICATION OF THE AEROELASTIC MODEL OF A LARGE TRANSPORT CIVIL AIRCRAFT FOR CONTROL LAW DESIGN AND VALIDATION

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

PART I: Adding Instructions to the Datapath. (2 nd Edition):

PART I: Adding Instructions to the Datapath. (2 nd Edition): EE57 Instrctor: G. Pvvada ===================================================================== Homework #5b De: check on the blackboard =====================================================================

More information

A Hybrid Weight-Based Clustering Algorithm for Wireless Sensor Networks

A Hybrid Weight-Based Clustering Algorithm for Wireless Sensor Networks Open Access Library Jornal A Hybrid Weight-Based Clstering Algorithm for Wireless Sensor Networks Cheikh Sidy Mohamed Cisse, Cheikh Sarr * Faclty of Science and Technology, University of Thies, Thies,

More information

Input Selection Using Local Model Network Trees

Input Selection Using Local Model Network Trees Preprints of the 9th World Congress The International Federation of Atomatic Control Cape Town, Soth Africa. Agst -9, Inpt Selection Using Local Model Network Trees Jlian Belz Oliver Nelles Universit of

More information

Maximal Cliques in Unit Disk Graphs: Polynomial Approximation

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

Estimating Model Parameters and Boundaries By Minimizing a Joint, Robust Objective Function

Estimating Model Parameters and Boundaries By Minimizing a Joint, Robust Objective Function Proceedings 999 IEEE Conf. on Compter Vision and Pattern Recognition, pp. 87-9 Estimating Model Parameters and Bondaries By Minimiing a Joint, Robst Objective Fnction Charles V. Stewart Kishore Bbna Amitha

More information

EECS 487: Interactive Computer Graphics f

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

The Intersection of Two Ringed Surfaces and Some Related Problems

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

Towards Understanding Bilevel Multi-objective Optimization with Deterministic Lower Level Decisions

Towards Understanding Bilevel Multi-objective Optimization with Deterministic Lower Level Decisions Towards Understanding Bilevel Mlti-objective Optimization with Deterministic Lower Level Decisions Ankr Sinha Ankr.Sinha@aalto.fi Department of Information and Service Economy, Aalto University School

More information

EUCLIDEAN SKELETONS USING CLOSEST POINTS. Songting Luo. Leonidas J. Guibas. Hong-Kai Zhao. (Communicated by the associate editor name)

EUCLIDEAN SKELETONS USING CLOSEST POINTS. Songting Luo. Leonidas J. Guibas. Hong-Kai Zhao. (Communicated by the associate editor name) Volme X, No. 0X, 200X, X XX Web site: http://www.aimsciences.org EUCLIDEAN SKELETONS USING CLOSEST POINTS Songting Lo Department of Mathematics, University of California, Irvine Irvine, CA 92697-3875,

More information

Lecture 10. Diffraction. incident

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

Tdb: A Source-level Debugger for Dynamically Translated Programs

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

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

Pipelined van Emde Boas Tree: Algorithms, Analysis, and Applications

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

Exploiting Actuator Limits with Feedforward Control based on Inverse Models

Exploiting Actuator Limits with Feedforward Control based on Inverse Models Exploiting Actator Limits with Feedforward Control based on Inverse Models Manel Gräber TLK-Thermo GmbH Hans-Sommer-Str. 5, 386 Branschweig, German Abstract Feedforward control based on inverse dnamic

More information

Engineering, University of Malaya, Kuala Lumpur, Malaysia 2 Department of Mechanical Engineering, Osaka University, 2-1

Engineering, University of Malaya, Kuala Lumpur, Malaysia 2 Department of Mechanical Engineering, Osaka University, 2-1 nternational Jornal o Mechanical and Materials Engineering (JMME), Vol. 4 (2009), No. 1, 98-102. TECHNCAL NOTE: MMERSED BOUNDARY METHOD (BODY FORCE) FOR FLOW AROUND THN BODES WTH SHARP EDGES T. M. Y. S.

More information

An Adaptive Strategy for Maximizing Throughput in MAC layer Wireless Multicast

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

Cost Based Local Forwarding Transmission Schemes for Two-hop Cellular Networks

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

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

PARAMETER OPTIMIZATION FOR TAKAGI-SUGENO FUZZY MODELS LESSONS LEARNT

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

Topic Continuity for Web Document Categorization and Ranking

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

METAMODEL FOR SOFTWARE SOLUTIONS IN COMPUTED TOMOGRAPHY

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

Image Denoising Algorithms

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

4.13 Advanced Topic: An Introduction to Digital Design Using a Hardware Design Language 345.e1

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

Constructing and Comparing User Mobility Profiles for Location-based Services

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

A SIMULATION PLATFORM FOR LOCALIZATION AND MAPPING

A SIMULATION PLATFORM FOR LOCALIZATION AND MAPPING A SIMULATION PLATFORM FOR LOCALIZATION AND MAPPING Thomas Hanefeld Sejerøe, Niels Kjølstad Polsen Ole Ravn, Ørsted DTU, Atomation, The Technical Universit of Denmark, Bilding 6, DK-8 Kgs. Lngb, Denmark

More information

Constrained Routing Between Non-Visible Vertices

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

The extra single-cycle adders

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

Fast Ray Tetrahedron Intersection using Plücker Coordinates

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

Chapter 2: Finite Difference Approximations

Chapter 2: Finite Difference Approximations Chapter : Finite Difference Approximations.) Introdction The first chapter introdced s to several of the different kinds of partial differential eqations (PDEs) that govern the evoltion of physical systems.

More information

Chapter 6: Pipelining

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

On the complexity of Submap Isomorphism

On the complexity of Submap Isomorphism On the compleit of Sbmap Isomorphism Christine Solnon 1,2, Gillame Damiand 1,2, Colin de la Higera 3, and Jean-Christophe Janodet 4 1 INSA de Lon, LIRIS, UMR 5205 CNRS, 69621 Villerbanne, France 2 Université

More information

EMC ViPR. User Guide. Version

EMC ViPR. User Guide. Version EMC ViPR Version 1.1.0 User Gide 302-000-481 01 Copyright 2013-2014 EMC Corporation. All rights reserved. Pblished in USA. Pblished Febrary, 2014 EMC believes the information in this pblication is accrate

More information

Image Compression Compression Fundamentals

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

Statistical Methods in functional MRI. Standard Analysis. Data Processing Pipeline. Multiple Comparisons Problem. Multiple Comparisons Problem

Statistical Methods in functional MRI. Standard Analysis. Data Processing Pipeline. Multiple Comparisons Problem. Multiple Comparisons Problem Statistical Methods in fnctional MRI Lectre 7: Mltiple Comparisons 04/3/13 Martin Lindqist Department of Biostatistics Johns Hopkins University Data Processing Pipeline Standard Analysis Data Acqisition

More information

Requirements Engineering. Objectives. System requirements. Types of requirements. FAQS about requirements. Requirements problems

Requirements Engineering. Objectives. System requirements. Types of requirements. FAQS about requirements. Requirements problems Reqirements Engineering Objectives An introdction to reqirements Gerald Kotonya and Ian Sommerville To introdce the notion of system reqirements and the reqirements process. To explain how reqirements

More information

What s New in AppSense Management Suite Version 7.0?

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

Fault Tolerance in Hypercubes

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

ABSOLUTE DEFORMATION PROFILE MEASUREMENT IN TUNNELS USING RELATIVE CONVERGENCE MEASUREMENTS

ABSOLUTE 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

OPTI-502 Optical Design and Instrumentation I John E. Greivenkamp Homework Set 7 Fall, 2018

OPTI-502 Optical Design and Instrumentation I John E. Greivenkamp Homework Set 7 Fall, 2018 Assigned: 10/10/18 Lectre 15 De: 10/17/18 Lectre 17 Midterm Exam: Wednesda October 24 (Lectre 19) The eqation sheet for the exam has been posted on the corse website. This eqation sheet will be inclded

More information

The Impact of Avatar Mobility on Distributed Server Assignment for Delivering Mobile Immersive Communication Environment

The Impact of Avatar Mobility on Distributed Server Assignment for Delivering Mobile Immersive Communication Environment This fll text paper was peer reviewed at the direction of IEEE Commnications Society sbject matter experts for pblication in the ICC 27 proceedings. The Impact of Avatar Mobility on Distribted Server Assignment

More information

A least-square radial point collocation method for adaptive analysis in linear elasticity

A least-square radial point collocation method for adaptive analysis in linear elasticity Engineering Analysis with Bondary Elements 3 (8) 44 46 www.elsevier.com/locate/enganabond A least-sqare radial point collocation method for adaptive analysis in linear elasticity Bernard B.T. Kee a,, G.R.

More information

The single-cycle design from last time

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

Semantic segmentation is the task of labeling every pixel in

Semantic segmentation is the task of labeling every pixel in Deep Learning for Visal Understanding: Part Anrag Arnab, Shai Zheng, Sadeep Jayasmana, Bernardino Romera-Paredes, Måns Larsson, Alexander Kirillov, Bogdan Savchynskyy, Carsten Rother, Fredrik Kahl, and

More information

EEC 483 Computer Organization

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

This article was pblished in an Elsevier jornal. The attached copy is frnished to the athor for non-commercial research and edcation se, inclding for instrction at the athor s instittion, sharing with

More information

Bearing capacity of foundations resting on a spatially random soil

Bearing capacity of foundations resting on a spatially random soil Bearing capacity of fondations resting on a spatially random soil Abdl-Hamid Sobra, Dalia S. Yossef Abdel Massih 2 and Mikaël Kalfa 3 rofessor, University of Nantes, GeM, UMR CNRS 683, Bd. de l niversité,

More information

Inteligencia Artificial. Revista Iberoamericana de Inteligencia Artificial ISSN:

Inteligencia Artificial. Revista Iberoamericana de Inteligencia Artificial ISSN: Inteligencia Artificial. Revista Iberoamericana de Inteligencia Artificial ISSN: 1137-3601 revista@aepia.org Asociación Española para la Inteligencia Artificial España Zaballos, Lis J.; Henning, Gabriela

More information

Real-Time Implementation of Adaptive Optimal Controller Based on a Pseudo-Space Model into PLC

Real-Time Implementation of Adaptive Optimal Controller Based on a Pseudo-Space Model into PLC Proceedings of the th WSEAS International Conference on SYSEMS, Agios Nikolaos, Crete Island, Greece, Jl 3-5, 7 3 Real-ime Implementation of Adaptive Optimal Controller Based on a Psedo-Space Model into

More information

Review Multicycle: What is Happening. Controlling The Multicycle Design

Review Multicycle: What is Happening. Controlling The Multicycle Design Review lticycle: What is Happening Reslt Zero Op SrcA SrcB Registers Reg Address emory em Data Sign etend Shift left Sorce A B Ot [-6] [5-] [-6] [5-] [5-] Instrction emory IR RegDst emtoreg IorD em em

More information