Partitioning strategy for efficient nonlinear finite element dynamic analysis on multiprocessor computers

A computational procedure is presented for the nonlinear dynamic analysis of unsymmetric structures on vector multiprocessor systems. The procedure is based on a novel hierarchical partitioning strategy in which the response of the unsymmetric and antisymmetric response vectors (modes), each obtained by using only a fraction of the degrees of freedom of the original finite element model. The three key elements of the procedure which result in high degree of concurrency throughout the solution process are: (1) mixed (or primitive variable) formulation with independent shape functions for the different fields; (2) operator splitting or restructuring of the discrete equations at each time step to delineate the symmetric and antisymmetric vectors constituting the response; and (3) two level iterative process for generating the response of the structure. An assessment is made of the effectiveness of the procedure on the CRAY X-MP/4 computers

A Data Transformation System for Biological Data Sources

Scientific data of importance to biologists in the Human Genome Project resides not only in conventional databases, but in structured files maintained in a number of different formats (e.g. ASN.1 and ACE) as well a.s sequence analysis packages (e.g. BLAST and FASTA). These formats and packages contain a number of data types not found in conventional databases, such as lists and variants, and may be deeply nested. We present in this paper techniques for querying and transforming such data, and illustrate their use in a prototype system developed in conjunction with the Human Genome Center for Chromosome 22. We also describe optimizations performed by the system, a crucial issue for bulk data

An extended relational algebra for nested relations

Ankara : Department of Computer Engineering and Information Science and Institute of Engineering and Science, Bilkent Univ., 1993.Thesis (Master's) -- Bilkent University, 1993.Includes bibliographical references leaves 40In this study the database models of Roth-Korth-Silberschatz (RKS) [cf. ACM TODS 13(4): 389—417, 1988] and Abiteboul-Bidoit (AB) [cf. Journal of Computer and System Sciences 33(4): 361—393, 1986] to formalize non-firstnormal-form relations are presented along with their extended relational algebra. We show that the extended set operators union and difference of RKS and AB are not information equivalent Using the model of RKS and restricting ourselves to union and difference, we define our extended set operators and show that these two operators and the extended intersection of RKS are information equivalent.Sükan, EserM.S

Advances in contact algorithms and their application to tires

Currently used techniques for tire contact analysis are reviewed. Discussion focuses on the different techniques used in modeling frictional forces and the treatment of contact conditions. A status report is presented on a new computational strategy for the modeling and analysis of tires, including the solution of the contact problem. The key elements of the proposed strategy are: (1) use of semianalytic mixed finite elements in which the shell variables are represented by Fourier series in the circumferential direction and piecewise polynomials in the meridional direction; (2) use of perturbed Lagrangian formulation for the determination of the contact area and pressure; and (3) application of multilevel iterative procedures and reduction techniques to generate the response of the tire. Numerical results are presented to demonstrate the effectiveness of a proposed procedure for generating the tire response associated with different Fourier harmonics

Weak functional dependencies on trees with restructuring

We present an axiomatisation for weak functional dependencies, i.e. disjunctions of functional dependencies, in the presence of several constructors for complex values. The investigated constructors capture records, sets, multisets, lists, disjoint union and optionality, i.e. the complex values are indeed trees. The constructors cover the gist of all complex value data models including object oriented databases and XML. Functional and weak functional dependencies are expressed on a lattice of subattributes, which even carries the structure of a Brouwer algebra as long as the union-constructor is absent. Its presence, however, complicates all results and proofs significantly. The reason for this is that the union-constructor causes non-trivial restructuring rules to hold. In particular, if either the set- or the the union-constructor is absent, a subset of the rules is complete for the implication of ordinary functional dependencies, while in the general case no finite axiomatisation for functional dependencies exists

Incremental Recomputation of Pig Latin’s Nest and Unnest Operators

This master’s thesis addresses the maintenance of pre-computed structures, which store a frequent or expensive query, for the nested bag data type in the high level work-flow language Pig Latin. This thesis defines a model suitable to accommodate incremental expressions over nested bags on Pig Latin. Afterwards, the partitioned normal form for sets is extended with further restrictions, in order to accommodate the nested bag model, allow the Pig Latin nest and unnest operators revert each other, and create a suitable environment to the incremental computations. Subsequently, the extended operators – extended union and extended difference – are defined for the nested bag data model with the partitioned normal form for bags (PNF Bag) restriction, and semantics for the extended operators are given. Finally, incremental data propagation expressions are proposed for the nest and unnest operators on the data model proposed with the PNF Bag restriction, and the proof of correctness is given.Esta tese de mestrado aborda a problemática da manutenção de estruturas pré-cumputas, que – regra geral – armazenam uma pesquisa computacionalmente dispendiosa ou frequente, para a linguagem de fluxo de dados de alto nível Pig Latin. Esta tese começa por definir um modelo de dados para acomodar o tipo de dados nested bag do Pig Latin. Posteriormente a partitioned normal form para sets ´e transformada para poder: acomodar o tipo de dados nested bag, permitir que os operadores do Pig Latin nest e unnest possam reverter-se mutuamente, e para criar um ambiente propicio `a utilização de expressões incrementais. De seguida os operadores extendidos – extended union e extended difference – são definidos para o modelo nested bag com a restrição partitioned normal form para bags (PNF Bag), sendo a semântica dos operadores também dada nesta tese. Por fim, são propostas expressões incrementais de propagação da informação para os operadores nest e unnest no modelo proposto com a restrição PNF Bag