<p>Statistical analysis of massive array data is becoming indispensable in answering important scientific and business questions. Most analysis tasks consist of multiple steps, each making one or multiple passes over the arrays to be analyzed and generating intermediate results. In the big data setting, storage and I/O efficiency is a key to efficient analytics. Because of the distinct characteristics of disk-resident arrays and the operations performed on them, we need a computing environment that is easy to use, scalable to big data, and different from traditional, CPU- and memory-centric solutions.</p><p>R is a popular computing environment for statistical/numerical data analysis. Like many such environments, R performs poorly for large datasets. This dissertation presents RIOT (R with I/O Transparency), a framework to make R programs I/O-efficient in a way transparent to users. RIOT-DB, an implementation of RIOT using a relational database system as its backend, significantly outperforms R in many big-data scenarios. RIOT users are insulated from the data management backend and I/O optimization specifics. Because of this transparency, RIOT is easy to adopt by the majority of the R users.</p><p>While RIOT-DB demonstrates the feasibility of transparent I/O efficiency and the potential of database-style inter-operator optimizations, it also reveals significant deficiencies of database systems in handling statistical computation. To improve the efficiency of array storage, RIOT uses a novel storage structure called Linearized-Array B-tree, or LAB-tree. LAB-tree supports flexible array layouts and automatically adapts to varying sparsity across parts of an array and over time. It also implements splitting strategies and update batching policies with good theoretical guarantees and/or practical performance.</p><p>While LAB-tree removes many I/O inefficiencies that arise in accessing individual arrays, programs consisting of multiple operators need further optimization. To this end, RIOT incorporates an I/O optimization framework, RIOTShare, which is able to jointly optimize I/O sharing and array layouts for a broad range of analysis tasks expressible in nested-loop forms. RIOTShare explores the middle ground between the high-level, database-style operator-based query optimization and low-level, compiler-style loop-based code optimization.</p><p>In sum, combining a transparent language binding mechanism, an efficient and flexible storage engine, and an accurate I/O sharing and array layout optimizer, RIOT provides a systematic solution for data-intensive array-based statistical computing.</p> / Dissertation

This thesis study addresses the problem of overconstraint via introduction of conformal polyhedral linkages comprising revolute joints only and investigation of special geometric properties for the mobility of such overconstrained linkages. These linkages are of particular interest as deployable structures. First, planar case is issued and conditions for assembling irregular conformal polygonal linkages composed of regular and angulated scissor elements are derived. These planar assemblies are implemented into faces of polyhedral shapes and radially intersecting planes to obtain two different kind of polyhedral linkages. Rest of the thesis work relates to spatial linkages. Identical isosceles Bennett loops are assembled to obtain regular polygonal linkages and many such linkages are assembled to form polyhedral linkages. Then, Fulleroid-like linkages are presented. After these seemingly independent linkage types, Jitterbug-like linkages are introduced. Based on some observations on present linkages in the literature a definition for Jitterbug-like linkages is given first, and then a set of critical properties of these linkages are revealed. This special type of polyhedral linkages is further classified as being homothetic and non-homothetic, and geometric conditions to obtain mobile homothetic Jitterbug-like polyhedral linkages are investigated. Homohedral linkages, linkages with polyhedral supports with 3- and 4-valent vertices only, tangential polyhedral linkages are detailed as special cases and the degenerate case where all faces are coplanar is discussed. Two types of modifications on Jitterbug-like linkages are presented by addition of links on the faces and radial planes of Jitterbug-like linkages. Finally, a special class of Jitterbug-like linkages - modified Wren platforms are introduced as potential deployable structures.

We consider combinatorial t-design problems as discrete optimization problems. Our motivation is that only a few studies have been done on the use of exact optimization techniques in designs, and that classical methods in design theory have still left many open existence questions. Roughly defined, t-designs are pairs of discrete sets that are related following some strict properties of size, balance, and replication. These highly structured relationships provide optimal solutions to a variety of problems in computer science like error-correcting codes, secure communications, network interconnection, design of hardware; and are applicable to other areas like statistics, scheduling, games, among others. We give a new approach to combinatorial t-designs that is useful in constructing t-designs by polyhedral methods. The first contribution of our work is a new result of equivalence of t-design problems with a graph theory problem. This equivalence leads to a novel integer programming formulation for t-designs, which we call GDP. We analyze the polyhedral properties of GDP and conclude, among other results, the associated polyhedron dimension. We generate new classes of valid inequalities to aim at approximating this integer program by a linear program that has the same optimal solution. Some new classes of valid inequalities are generated as Chv´atal-Gomory cuts, other classes are generated by graph complements and combinatorial arguments, and others are generated by the use of incidence substructures in a t-design. In particular, we found a class of valid inequalities that we call stable-set class that represents an alternative graph equivalence for the problem of finding a t-design. We analyze and give results on the strength of these new classes of valid inequalities. We propose a separation problem and give its integer programming formulation as a maximum (or minimum) edge-weight biclique subgraph problem. We implement a pure cutting-plane algorithm using one of the stronger classes of valid inequalities derived. Several instances of t-designs were solved efficiently by this algorithm at the root node of the search tree. Also, we implement a branch-and-cut algorithm and solve several instances of 2-designs trying different base formulations. Computational results are included.

A series of hybrid component based on reactive polyhedral oligomeric silsesquioxane(POSS) precusors and its reactive copolymers of PGMA were synthesized and utilized to nanobuild in epoxy. Reactive POSS and copolymer dispersed in homogenous in matrix, overcomed POSS-POSS interaction, which resulted in macroscale phase separation. The nanocomposites obtained were analyzed by Scanning electron microscopy, Transmission electron microscopy, X-ray scattering and dynamic mechanical. An analogue of POSS (denoted as POSSMOCA) was synthesized via addition reaction, which had reactive amino group bonding into epoxy network and improved the thermostability, because of the structural silicon, nitrogen and halogen. Epoxy/polyhedral oligomeric silsesquioxanes (POSS) hybrid composites were prepared from prereaction between trifunctional silanol POSS-OH and diglycidyl ether of bisphenol A (DGEBA) via silanol and the oxirane group. Reactive POSS-PGMA was polymerized via Reversible addition-fragmentation transfer polymerization. It was easy to tail the compatibility of the epoxide block copolymer with a step-growth polymerized matrix, to form nanostructure via reaction with PGMA segements. In the case of inert POSS-PMMA copolymers modified epoxy, topology of copolymer defined the final morphology and interaction between epoxy and them, because of directional hydrogen bonding and dilution effect. Tg of different epoxide conversion, obeyed of Gordon-Taylor equation and Kwei equation, k which reflected the interaction of modifier and DGEBA/MEDA and epoxy/amine oligomers, was consistent of the rheology and dynamic results.

The Eshelby-type problems of an arbitrary-shape polygonal or polyhedral inclusion embedded in an infinite homogeneous isotropic elastic material are analytically solved using a simplified strain gradient elasticity theory (SSGET) that contains a material length scale parameter. The Eshelby tensors for a plane strain inclusion with an arbitrary polygonal cross section and for an arbitrary-shape polyhedral inclusion are analytically derived in general forms in terms of three potential functions. These potential functions, as area integrals over the polygonal cross section and volume integrals over the polyhedral inclusion, are evaluated. For the polygonal inclusion problem, the three area integrals are first transformed to three line integrals using the Green's theorem, which are then evaluated analytically by direct integration. In the polyhedral inclusion case, each of the three volume integrals is first transformed to a surface integral by applying the divergence theorem, which is then transformed to a contour (line) integral based on Stokes' theorem and using an inverse approach. In addition, the Eshelby tensor for an anti-plane strain inclusion with an arbitrary polygonal cross section embedded in an infinite homogeneous isotropic elastic material is analytically solved. Each of the newly derived Eshelby tensors is separated into a classical part and a gradient part. The latter includes the material length scale parameter additionally, thereby enabling the interpretation of the inclusion size effect. For homogenization applications, the area or volume average of each newly derived Eshelby tensor over the polygonal cross section or the polyhedral inclusion domain is also provided in a general form. To illustrate the newly obtained Eshelby tensors and their area or volume averages, different types of polygonal and polyhedral inclusions are quantitatively studied by directly using the general formulas derived. The numerical results show that the components of the each SSGET-based Eshelby tensor for all inclusion shapes considered vary with both the position and the inclusion size. It is also observed that the components of each averaged Eshelby tensor based on the SSGET change with the inclusion size.

This thesis presents a new technique for the reconstruction of a smooth surface from a set of 3D data points. The reconstructed surface is represented by an everywhere -continuous subdivision surface which interpolates all the given data points. And the topological structure of the reconstructed surface is exactly the same as that of the data points. The new technique consists of two major steps. First, use an efficient surface reconstruction method to produce a polyhedral approximation to the given data points. Second, construct a Doo-Sabin subdivision surface that smoothly passes through all the data points in the given data set. A new technique is presented for the second step in this thesis. The new technique iteratively modifies the vertices of the polyhedral approximation 1CM until a new control meshM, whose Doo-Sabin subdivision surface interpolatesM, is reached. It is proved that, for any mesh M with any size and any topology, the iterative process is always convergent with Doo-Sabin subdivision scheme. The new technique has the advantages of both a local method and a global method, and the surface reconstruction process can reproduce special features such as edges and corners faithfully.

A presente dissertação busca analisar os aspectos subjacentes à emergência de um novo paradigma no que tange à inovação: open innovation (ou inovação aberta). Tendo em vista que o estudo comporta a necessidade de conceituação, importa observar que atualmente o conhecimento se mostra difundido entre inúmeras fontes. Sendo assim, a ideia de uma estrutura totalmente vertical e autossuficiente de pesquisa e desenvolvimento, inerente aos modelos fulcrados no paradigma anterior (closed innovation ou inovação fechada), vem dando lugar à crença de que ideias valiosas podem surgir tanto internamente quanto externamente, da mesma maneira que as inovações resultantes das atividades empresariais podem chegar ao mercado por caminhos internos e externos. Essa abordagem atribui grande relevância ao intercâmbio de conhecimento e à perspectiva colaborativa, destacando como principal vantagem a diminuição dos custos com pesquisa e desenvolvimento. Dentre os vários pontos de distinção entre os referidos paradigmas encontra-se a função a ser desempenhada pela propriedade intelectual. Por conseguinte, o objetivo desta dissertação consiste em investigar como a propriedade intelectual funciona dentro da lógica pela qual se orienta a inovação aberta, isto é, se ela impede o fluxo de conhecimento entre os diversos agentes do mercado envolvendo tecnologia ou, ao contrário, se a proteção formal desses ativos intangíveis é o elemento que permite tal intercâmbio. Nesses termos, busca-se demonstrar que as sociedades empresárias adotantes desse modelo aberto abordam a questão da titularidade de direitos de propriedade intelectual como ponto crucial à consecução de práticas baseadas em inovação aberta, as quais se instrumentalizam a partir de contratos formais. Importa observar que, através de uma metodologia científica de análise de conteúdo, toda a investigação em curso se perfaz tendo em conta a empresa enquanto conceito dinâmico dentro do contexto da manifestação do mercado como um fenômeno poliédrico, o qual, em se tratando de temas como propriedade intelectual, será orientado para a inovação. Desta feita, a conclusão da pesquisa indica que os direitos da propriedade intelectual são importantes ativos em uma lógica de open innovation, pois esta não advoga a extinção da propriedade intelectual, mas a flexibilização de sua exploração. / This dissertation aims to analyze the underlying aspects regarding the emergence of a new paradigm in terms of innovation: open innovation. Given that the study demands conceptualization, it is important to notice that, currently, knowledge is diffused among various sources. Thus, the idea of a vertical and self-sufficient structure of research and development, inherent to the business models based on the previous paradigm (closed innovation) is being substituted by the believe that valuable ideas may come from inside and outside the company. Likewise, innovations resulting from the business activities may find their way to market from internal or external paths. This approach assigns great importance to knowledge exchange and collaborative perspective, and also highlights the advantage of a decrease on costs of research and development. Among the numerous elements of distinction between the two referred paradigms is the role played by intellectual property. Therefore, the aim of this dissertation is the investigation on how intellectual property works in an open innovation oriented logic, that is, if it prevents the knowledge flow between the several agents of technology market, or, instead, if the formal protection of intangible assets enables such exchange. Thereby, the present work seeks to demonstrate that firms involved with open innovation practices address the issue of intellectual property ownership as crucial to the development of their business with great use of formal contractual instruments. It shall be noticed that through a methodology consisting in content analysis all this investigation is conducted taking into account the enterprise as a dynamic concept inside the context of the market as a manifestation of a polyhedral phenomenon which, regarding intellectual property, shall be oriented towards innovation. Thus, the conclusion of the present research indicates that intellectual property rights are important assets when it comes to an open innovation landscape since it does not advocates intellectual propertys extinction, but an easing regarding its profiteering.

A presente dissertação busca analisar os aspectos subjacentes à emergência de um novo paradigma no que tange à inovação: open innovation (ou inovação aberta). Tendo em vista que o estudo comporta a necessidade de conceituação, importa observar que atualmente o conhecimento se mostra difundido entre inúmeras fontes. Sendo assim, a ideia de uma estrutura totalmente vertical e autossuficiente de pesquisa e desenvolvimento, inerente aos modelos fulcrados no paradigma anterior (closed innovation ou inovação fechada), vem dando lugar à crença de que ideias valiosas podem surgir tanto internamente quanto externamente, da mesma maneira que as inovações resultantes das atividades empresariais podem chegar ao mercado por caminhos internos e externos. Essa abordagem atribui grande relevância ao intercâmbio de conhecimento e à perspectiva colaborativa, destacando como principal vantagem a diminuição dos custos com pesquisa e desenvolvimento. Dentre os vários pontos de distinção entre os referidos paradigmas encontra-se a função a ser desempenhada pela propriedade intelectual. Por conseguinte, o objetivo desta dissertação consiste em investigar como a propriedade intelectual funciona dentro da lógica pela qual se orienta a inovação aberta, isto é, se ela impede o fluxo de conhecimento entre os diversos agentes do mercado envolvendo tecnologia ou, ao contrário, se a proteção formal desses ativos intangíveis é o elemento que permite tal intercâmbio. Nesses termos, busca-se demonstrar que as sociedades empresárias adotantes desse modelo aberto abordam a questão da titularidade de direitos de propriedade intelectual como ponto crucial à consecução de práticas baseadas em inovação aberta, as quais se instrumentalizam a partir de contratos formais. Importa observar que, através de uma metodologia científica de análise de conteúdo, toda a investigação em curso se perfaz tendo em conta a empresa enquanto conceito dinâmico dentro do contexto da manifestação do mercado como um fenômeno poliédrico, o qual, em se tratando de temas como propriedade intelectual, será orientado para a inovação. Desta feita, a conclusão da pesquisa indica que os direitos da propriedade intelectual são importantes ativos em uma lógica de open innovation, pois esta não advoga a extinção da propriedade intelectual, mas a flexibilização de sua exploração. / This dissertation aims to analyze the underlying aspects regarding the emergence of a new paradigm in terms of innovation: open innovation. Given that the study demands conceptualization, it is important to notice that, currently, knowledge is diffused among various sources. Thus, the idea of a vertical and self-sufficient structure of research and development, inherent to the business models based on the previous paradigm (closed innovation) is being substituted by the believe that valuable ideas may come from inside and outside the company. Likewise, innovations resulting from the business activities may find their way to market from internal or external paths. This approach assigns great importance to knowledge exchange and collaborative perspective, and also highlights the advantage of a decrease on costs of research and development. Among the numerous elements of distinction between the two referred paradigms is the role played by intellectual property. Therefore, the aim of this dissertation is the investigation on how intellectual property works in an open innovation oriented logic, that is, if it prevents the knowledge flow between the several agents of technology market, or, instead, if the formal protection of intangible assets enables such exchange. Thereby, the present work seeks to demonstrate that firms involved with open innovation practices address the issue of intellectual property ownership as crucial to the development of their business with great use of formal contractual instruments. It shall be noticed that through a methodology consisting in content analysis all this investigation is conducted taking into account the enterprise as a dynamic concept inside the context of the market as a manifestation of a polyhedral phenomenon which, regarding intellectual property, shall be oriented towards innovation. Thus, the conclusion of the present research indicates that intellectual property rights are important assets when it comes to an open innovation landscape since it does not advocates intellectual propertys extinction, but an easing regarding its profiteering.

Submitted by Marlene Santos (marlene.bc.ufg@gmail.com) on 2016-09-15T14:07:03Z No. of bitstreams: 2 Dissertação - Luis Felipe Narvaez Plaza - 2016.pdf: 3790150 bytes, checksum: 40cc7247bbdbbb26d25f05bd967a463e (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) / Approved for entry into archive by Luciana Ferreira (lucgeral@gmail.com) on 2016-09-15T14:46:20Z (GMT) No. of bitstreams: 2 Dissertação - Luis Felipe Narvaez Plaza - 2016.pdf: 3790150 bytes, checksum: 40cc7247bbdbbb26d25f05bd967a463e (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) / Made available in DSpace on 2016-09-15T14:46:20Z (GMT). No. of bitstreams: 2 Dissertação - Luis Felipe Narvaez Plaza - 2016.pdf: 3790150 bytes, checksum: 40cc7247bbdbbb26d25f05bd967a463e (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) Previous issue date: 2016-03-14 / Conselho Nacional de Pesquisa e Desenvolvimento Científico e Tecnológico - CNPq / This work is divided in four parts, in the first chapter we give an introduction. In the next chapter we study basic theory of geometry and differential equations, we study some results of geodesics theory on surfaces in R3; based in the works of R. Garcia and J. Sotomayor in [10] and W. Klingenberg in [15]. These ones provide a study of the behavior of the geodesic in the ellipsoid. The third chapter is inspired by the famous question given in 1905, in his famous article “Sur les lignes géodésiques des surfaces convexes” H. Poincaré posed a question on the existence of at least three geometrically different closed geodesics without self-intersections on any smooth convex two-dimensional surface (2-surface) M homeomorphic to the two-dimensional sphere (2-sphere) S2. We study this question for convex polyhedral surfaces following the paper [9] by G. Galperin and the books [1],[4]. In the last topic we will address the behavior of geodesics on Lorentz surfaces, focusing our study on the ellipsoid based mainly on the book of Tilla Weinstein [25] and in the paper [11] by S. Tabachnikov, Khesin and Genin. / Este trabalho se divide em quatro partes principais, no primeiro capítulo fazemos uma breve introdução. No segundo capítulo estudamos teoria básica de geometria e equações diferenciais, estudamos também geodésicas em superfícies no R3 baseados nos trabalhos de R. Garcia e J. Sotomayor em [10] e de W. Klingenberg em [15], estes fornecem um estudo rigoroso do comportamento das geodésicas no elipsóide. O terceiro capítulo é inspirado na famosa conjectura dada em em 1905 em seu artigo “Sur les lignes géodésiques des surfaces convexes” H. Poincaré fez uma pergunta sobre a existência de pelo menos três geodésicas simples fechadas sobre superfícies suaves convexas homeomorfas à esfera S2, neste capítulo estudamos esta conjectura em superfícies poliedrais baseado em [9] e os textos [1],[4]. No último tema de abordagem analisamos o comportamento de geodésicas em superfícies no espaço de Lorentz, focando nosso estudo no elipsóide, este estudo é baseado principalmente no livro de Tilla Weinstein [25] e no artigo [11] de S. Tabachnikov, Khesin e Genin.

Efficient memory usage is crucial for data-intensive applications as a smaller memory footprint ensures better cache performance and allows one to run a larger problem size given a axed amount of main memory. The solutions found by existing techniques for automatic storage optimization for arrays in a new loop-nests, which minimize the storage requirements for the arrays, are often far from good or optimal and could even miss nearly all storage optimization potential. In this work, we present a new automatic storage optimization framework and techniques that can be used to achieve intra-array as well as inter-array storage reuse within a new loop-nests with a pre-determined schedule. Over the last two decades, several heuristics have been developed for achieving complex transformations of a new loop-nests using the polyhedral model. However, there are no comparably strong heuristics for tackling the problem of automatic memory footprint optimization. We tackle the problem of storage optimization for arrays by formulating it as one of ending the right storage partitioning hyperplanes: each storage partition corresponds to a single storage location. Statement-wise storage partitioning hyperplanes are determined that partition a unit end global array space so that values with overlapping live ranges are not mapped to the same partition. Our integrated heuristic for exploiting intra-array as well as inter-array reuse opportunities is driven by a fourfold objective function that not only minimizes the dimensionality and storage requirements of arrays required for each high-level statement, but also maximizes inter-statement storage reuse. We built an automatic polyhedral storage optimizer called SMO using our storage partitioning approach. Storage reduction factors and other results we report from SMO demon-strate the e activeness of our approach on several benchmarks drawn from the domains of image processing, stencil computations, high-performance computing, and the class of tiled codes in general. The reductions in storage requirement over previous approaches range from a constant factor to asymptotic in the loop blocking factor or array extents { the latter being a dramatic improvement for practical purposes. As an incidental and related topic, we also studied the problem of polyhedral compilation of graphical data programs. While polyhedral techniques for program transformation are now used in several proprietary and open source compilers, most of the research on poly-herald compilation has focused on imperative languages such as C, where the computation is species in terms of statements with zero or more nested loops and other control structures around them. Graphical data ow languages, where there is no notion of statements or a schedule specifying their relative execution order, have so far not been studied using a powerful transformation or optimization approach. The execution semantics and ref-eventual transparency of data ow languages impose a di errant set of challenges. In this work, we attempt to bridge this gap by presenting techniques that can be used to extract polyhedral representation from data ow programs and to synthesize them from their equivalent polyhedral representation. We then describe Polyglot, a framework for automatic transformation of data ow programs that we built using our techniques and other popular research tools such as Clan and Pluto. For the purpose of experimental evaluation, we used our tools to compile LabVIEW, one of the most widely used data ow programming languages. Results show that data ow programs transformed using our framework are able to outperform those compiled otherwise by up to a factor of seventeen, with a mean speed-up of 2.30 while running on an 8-core Intel system.