Thesis (Ph.D)--Computing, Georgia Institute of Technology, 2009. / Committee Chair: Santosh Vempala; Committee Member: Adam Kalai; Committee Member: Haesun Park; Committee Member: Ravi Kannan; Committee Member: Vladimir Koltchinskii. Part of the SMARTech Electronic Thesis and Dissertation Collection.

In recent years, massive data sets are generated in many areas of science and business, and are gathered by using advanced data acquisition techniques. New approaches are therefore required to facilitate effective data management and data analysis in this big data era, especially to analyze multidimensional data for real-time applications. This thesis aims at developing generic and effective algorithms for compressing and recovering online multidimensional data, and applying such algorithms in image processing and other related areas. Since multidimensional data are usually represented by tensors, this research uses multilinear algebra as the mathematical foundation to facilitate development. After reviewing the techniques of singular value decomposition (SVD), principal component analysis (PCA) and tensor decomposition, this thesis deduces an effective multilinear principal component analysis (MPCA) method to process such data by seeking optimal orthogonal basis functions that map the original tensor space to a tensor subspace with minimal reconstruction error. Two real examples, 3D data compression for positron emission tomography (PET) and offline fabric defect detection, are used to illustrate the tensor decomposition method and the deduced MPCA method, respectively. Based on the deduced MPCA method, this research develops an incremental MPCA (IMPCA) algorithm which targets at compressing and recovering online tensor objects. To reduce computational complexity of the IMPCA algorithm, this research investigates the low-rank updates of singular values in the matrix and tensor domains, which leads to the development of a sequential low-rank update scheme similar to the sequential Karhunen-Loeve algorithm (SKL) for incremental matrix singular value decomposition, a sequential low-rank update scheme for incremental tensor decomposition, and a quick subspace tracking (QST) algorithm to further enhance the low-rank updates of singular values if the matrix is positive-symmetric definite. Although QST is slightly inferior to the SKL algorithm in terms of accuracy in estimating eigenvector and eigenvalue, the algorithm has lower computational complexity. Two fast incremental MPCA (IMPCA) algorithms are then developed by incorporating the SKL algorithm and the QST algorithm separately into the IMPCA algorithm. Results obtained from applying the developed IMPCA algorithms to detect anomalies from online multidimensional data in a number of numerical experiments, and to track and reconstruct the global surface temperature anomalies over the past several decades clearly confirm the excellent performance of the algorithms. This research also applies the developed IMPCA algorithms to solve an online fabric defect inspection problem. Unlike existing pixel-wise detection schemes, the developed algorithms employ a scanning window to extract tensor objects from fabric images, and to detect the occurrence of anomalies. The proposed method is unsupervised because no pre-training is needed. Two image processing techniques, selective local Gabor binary patterns (SLGBP) and multi-channel feature combination, are developed to accomplish the feature extraction of textile patterns and represent the features as tensor objects. Results of experiments conducted by using a real textile dataset confirm that the developed algorithms are comparable to existing supervised methods in terms of accuracy and computational complexity. A cost-effective parallel implementation scheme is developed to solve the problem in real-time. / published_or_final_version / Industrial and Manufacturing Systems Engineering / Doctoral / Doctor of Philosophy

published_or_final_version / Geography and Geology / Master / Master of Philosophy

No description available.

The study describes how product visual aspects affect development processes and success in the component supply industry. Past research has demonstrated the importance of the product development function to component supply companies. Previous publications have also shown that visual and aesthetic properties are important for the success of manufactured products. The objective of the study was firstly, to establish on a general level how supply companies control the development process and whether supplier involvement in component development affects their business success. The second stage was to examine more specifically whether visual aspects of products affect development control and business success in the supply industry. The thesis is presented as six chapters. Chapter 1 provides an introduction. Chapter 2 sets up a model of product development in the supply industry, conducts a series of case studies in industry and develops three hypotheses predicting the impact of product visuals on the development process and success in the component supply industry. In chapter 3 develops a research method for an extensive survey. Chapter 4 plots the data collected in the survey. Chapter 5 discusses the plots examining the three hypotheses. It was shown that supplier control in the development of component visuals decreased with the visual significance of the component in the final product. Furthermore, component profits for supply companies increased with the visual significance of the component in the final product. Finally in chapter 6 conclusions are made.

Folding empowers the user to change the form and function of a sheet of paper through a sequence of manipulations. Unfolding the once folded artefact produces a diagram that describes its own making that can be replicated at different scales using a new material. Architecturally, folding can be employed a morphogenetic solution to design a system that can be fabricated from a sheet material, that like paper, can be folded into a inhabitable structure. The ease and cost efficiency of fabrication based on folding can be used to design a system that executed using low cost materials can be used as a shelter that accommodates programmatic and aesthetic evolution. Thus, the system lends itself to being a transitional shelter for communities that have been displaced due to a natural disaster or other form of crisis. Technological advances in design and structural analysis can give the designer the power to define the complex process folding parametrically allowing the input a real-time feedback based design based on an a folding inspired algorithm.

The thesis presents a Finite Element Analysis (FEA) based wear modelling algorithm devised in the course of the reported research activity. FEA is used as a tool to calculate nodal pressures at the contact region for small sliding steps. These pressures are then inputted to a customised wear calculating routine. The routine uses averaged wear coefficients (wear rates) obtained from custom designed experiments. The FEA contact geometry is modified after each sliding step to account for the contact height decay, thus determining the volume loss due to wear over usage time, thus predicting the worn geometry. Consequently, the designer gains invaluable insight into the extent of wear-caused component deformation along with the number of usage cycles lapsed prior to such deformation.

This thesis presents an approach to reusing components which alleviates some of the main problems encountered in component-based reuse; in particular modifying components to suit user's specific needs, and locating suitable components within a library. The focus of the thesis is on components described using a formal language (in other words components with a formal interface specification). The main reason for this is the concise and precise nature of formal languages, which can be exploited in developing more sophisticated methods and tools which take advantage of the semantics of the component. The solution is presented in two main stages: firstly a framework for adapting components is defined; secondly a framework for retrieving components based on matching component interfaces is defined. Both of these frameworks take advantage of the formal nature of the component interfaces, as a result more sophisticated tools can be developed. For generality it is proposed that formal languages used to represent interfaces are partitioned into three separate levels of granularity - expressions, units and modules - and solutions to adaptation and retrieval are developed separately at each level. An important consideration in developing these frameworks is to ensure that certain component properties are preserved when adapting and retrieving components. Having proposed these general frameworks, algorithms for adapting and retrieving components are defined in a more concrete and detailed sense within the CARE system. CARE was chosen because the language is relatively simple and compact, yet contains many of the features found in other formal languages, including: variables; functions; predicates; binders; application; typing; parameters; inputs and outputs (and their types); preconditions and postconditions; textual and formal parameters; separation of specification and implementation; case statements; modules; applicability conditions; encapsulation; and information hiding. These techniques for adapting and retrieving components have been prototyped as extensions to existing CARE tools. As a means of illustrating the value that these extensions have added to the overall CARE system, several example developments using the extended tools are presented at the end of the thesis. The approach to component reuse presented in this thesis represents a significant advance on other similar approaches. The approach given here is far more general than other approaches, particularly with respect to the scope of components and their interfaces that are considered. Also the adaptation framework goes beyond other approaches which have typically been restricted to parameter instantiation.

Thesis (Ph.D.)--Baylor University, 2007. / Includes bibliographical references (p. 225-231).

Thesis (M.S.)--Ohio University, November, 2007. / Title from PDF t.p. Includes bibliographical references.