Engineering derivatives from biological systems for advanced aerospace applications

The present study consisted of a literature survey, a survey of researchers, and a workshop on bionics. These tasks produced an extensive annotated bibliography of bionics research (282 citations), a directory of bionics researchers, and a workshop report on specific bionics research topics applicable to space technology. These deliverables are included as Appendix A, Appendix B, and Section 5.0, respectively. To provide organization to this highly interdisciplinary field and to serve as a guide for interested researchers, we have also prepared a taxonomy or classification of the various subelements of natural engineering systems. Finally, we have synthesized the results of the various components of this study into a discussion of the most promising opportunities for accelerated research, seeking solutions which apply engineering principles from natural systems to advanced aerospace problems. A discussion of opportunities within the areas of materials, structures, sensors, information processing, robotics, autonomous systems, life support systems, and aeronautics is given. Following the conclusions are six discipline summaries that highlight the potential benefits of research in these areas for NASA's space technology programs

Combinatorial Design and Analysis of Optimal Multiple Bus Systems for Parallel Algorithms.

This dissertation develops a formal and systematic methodology for designing optimal, synchronous multiple bus systems (MBSs) realizing given (classes of) parallel algorithms. Our approach utilizes graph and group theoretic concepts to develop the necessary model and procedural tools. By partitioning the vertex set of the graphical representation CFG of the algorithm, we extract a set of interconnection functions that represents the interprocessor communication requirement of the algorithm. We prove that the optimal partitioning problem is NP-Hard. However, we show how to obtain polynomial time solutions by exploiting certain regularities present in many well-behaved parallel algorithms. The extracted set of interconnection functions is represented by an edge colored, directed graph called interconnection function graph (IFG). We show that the problem of constructing an optimal MBS to realize an IFG is NP-Hard. We show important special cases where polynomial time solutions exist. In particular, we prove that polynomial time solutions exist when the IFG is vertex symmetric. This is the case of interest for the vast majority of important interconnection function sets, whether extracted from algorithms or correspond to existing interconnection networks. We show that an IFG is vertex symmetric if and only if it is the Cayley color graph of a finite group $\Gamma$ and its generating set $\Delta.$ Using this property, we present a particular scheme to construct a symmetric $MBS\ M(\Gamma,\Delta)$ with minimum number of buses as well as minimum number of interfaces realizing a vertex symmetric IFG. We demonstrate several advantages of the optimal $MBS\ M(\Gamma,\Delta)$ in terms of its symmetry, number of ports per processor, number of neighbors per processor, and the diameter. We also investigate the fault tolerant capabilities and performance degradation of $M(\Gamma,\Delta)$ in the case of a single bus failure, single driver failure, single receiver failure, and single processor failure. Further, we address the problem of designing an optimal MBS realizing a class of algorithms when the number of buses and/or processors in the target MBS are specified. The optimality criteria are maximizing the speed and minimizing the number of interfaces

University of Oregon General Catalog 1987-1988

324 page

Clemson Catalog, 1992-1993, Volume 67

https://tigerprints.clemson.edu/clemson_catalog/1145/thumbnail.jp

2015, UMaine News Press Releases

This is a catalog of press releases put out by the University of Maine Division of Marketing and Communications between January 2, 2015 and December 31, 2015

Clemson Catalog, 1993-1994, Volume 68

https://tigerprints.clemson.edu/clemson_catalog/1146/thumbnail.jp

Research in the Archival Multiverse

Over the past 15 years, the field of archival studies around the world has experienced unprecedented growth within the academy and within the profession, and archival studies graduate education programs today have among the highest enrolments in any information field. During the same period, there has also been unparalleled expansion and innovation in the diversity of methods and theories being applied in archival scholarship. Global in scope, Research in the Archival Multiverse compiles critical and reflective essays across a wide range of emerging research areas and interests in archival studies; it aims to provide current and future archival academics with a text addressing possible methods and theoretical frameworks that have been and might be used in archival scholarship and research

2014, UMaine News Press Releases

This is a catalog of press releases put out by the University of Maine Division of Marketing and Communications between January 6, 2014 and December 31, 2014

Research in the Archival Multiverse

Over the past 15 years, the field of archival studies around the world has experienced unprecedented growth within the academy and within the profession, and archival studies graduate education programs today have among the highest enrolments in any information field. During the same period, there has also been unparalleled expansion and innovation in the diversity of methods and theories being applied in archival scholarship. Global in scope, Research in the Archival Multiverse compiles critical and reflective essays across a wide range of emerging research areas and interests in archival studies; it aims to provide current and future archival academics with a text addressing possible methods and theoretical frameworks that have been and might be used in archival scholarship and research

Accountants\u27 index. Twenty-seventh supplement, January-December 1978, volume 1: A-L

https://egrove.olemiss.edu/aicpa_accind/1031/thumbnail.jp