The research evaluates the feasibility of assisting orthodontists to treat irregularities in teeth by computing the transformations to move each tooth to its ideal position. The intent is to help orthodontists craft a precise and specific treatment plan for each patient. Computation of the transformations is achieved through the use of a reverse engineering package, Geomagic Studio, and a three dimensional modeling program, Rhino3D. The inputs for finding the transformation are the patient's teeth mold and dental arch templates. A 3D laser scanner is used to form a point cloud data representation of the patient's teeth mold. Geomagic is used to construct a Non-Uniform Rational B-Spline surface for the mold. Rhino3D is used to manipulate this surface and compute the required transformations using the scripting platform, Rhinoscript, in Rhino3D. The steps in the process and the algorithms developed in Rhinoscript to compute the transformations are discussed. Three case studies are presented to demonstrate the process. / text

Floating-point arithmetic is attractive for the implementation for a variety of Digital Signal Processing (DSP) applications because it allows the designer and user to concentrate on the algorithms and architecture without worrying about numerical issues. In the past, many DSP applications used fixed point arithmetic due to the high cost (in delay, silicon area, and power consumption) of floating-point arithmetic units. In the realization of modern general purpose processors, fused floating-point multiply add units have become attractive since their delay and silicon area is often less than that of a discrete floating-point multiplier followed by a floating point adder. Further the accuracy is improved by the fused implementation since rounding is performed only once (after the multiplication and addition). This work extends the consideration of fused floating-point arithmetic to operations that are frequently encountered in DSP. The Fast Fourier Transform is a case in point since it uses a complex butterfly operation. For a radix-2 implementation, the butterfly consists of a complex multiply and the complex addition and subtraction of the same pair of data. For a radix-4 implementation, the butterfly consists of three complex multiplications and eight complex additions and subtractions. Both of these butterfly operations can be implemented with two fused primitives, a fused two-term dot-product unit and a fused add-subtract unit. The fused two-term dot-product multiplies two sets of operands and adds the products as a single operation. The two products do not need to be rounded (only the sum is normalized and rounded) which reduces the delay by about 15% while reducing the silicon area by about 33%. For the add-subtract unit, much of the complexity of a discrete implementation comes from the need to compare the operand exponents and align the significands prior to the add and the subtract operations. For the fused implementation, sharing the comparison and alignment greatly reduces the complexity. The delay and the arithmetic results are the same as if the operations are performed in the conventional manner with a floating-point adder and a separate floating-point subtracter. In this case, the fused implementation is about 20% smaller than the discrete equivalent. / text

Not available / text

Not available

published_or_final_version / abstract / Electrical and Electronic Engineering / Master / Master of Philosophy

published_or_final_version / Physics / Master / Master of Philosophy

published_or_final_version / Electrical and Electronic Engineering / Master / Master of Philosophy

published_or_final_version / Civil and Structural Engineering / Doctoral / Doctor of Philosophy

Presented work covers one of the most important areas of OMG’s model driven architecture (MDA) – problems of object model transformations. Based on research of OMG specifications and other sources, author analyzes transformation process, states importance of modeling and metamodeling for designing of UML like modeling languages. Research work describes designed PIM ant PSM metamodels of aggregate systems. Structure and syntax of ATL and MTL model transformation languages was introduced. Author gives a short overview of model editors and graphical representation for these languages, created using EMF framework tools. Transformation languages have been compared. A result of experimental transformations was summarized by their qualitative and quantitative criteria. Advantages of hybrid ATL transformation language versus imperative MTL language were found. Experimental transformations were successfully produced and executed using ATL and MTL model transformation languages.

No description available.