1992 NASA/ASEE Summer Faculty Fellowship Program

For the 28th consecutive year, a NASA/ASEE Summer Faculty Fellowship Program was conducted at the Marshall Space Flight Center (MSFC). The program was conducted by the University of Alabama and MSFC during the period June 1, 1992 through August 7, 1992. Operated under the auspices of the American Society for Engineering Education, the MSFC program, was well as those at other centers, was sponsored by the Office of Educational Affairs, NASA Headquarters, Washington, DC. The basic objectives of the programs, which are the 29th year of operation nationally, are (1) to further the professional knowledge of qualified engineering and science faculty members; (2) to stimulate and exchange ideas between participants and NASA; (3) to enrich and refresh the research and teaching activities of the participants' institutions; and (4) to contribute to the research objectives of the NASA centers

Robust network design under polyhedral traffic uncertainty

Ankara : The Department of Industrial Engineering and The Institute of Engineering and Science of Bilkent Univ., 2007.Thesis (Ph.D.) -- Bilkent University, 2007.Includes bibliographical references leaves 160-166.In this thesis, we study the design of networks robust to changes in demand estimates. We consider the case where the set of feasible demands is defined by an arbitrary polyhedron. Our motivation is to determine link capacity or routing configurations, which remain feasible for any realization in the corresponding demand polyhedron. We consider three well-known problems under polyhedral demand uncertainty all of which are posed as semi-infinite mixed integer programming problems. We develop explicit, compact formulations for all three problems as well as alternative formulations and exact solution methods. The first problem arises in the Virtual Private Network (VPN) design field. We present compact linear mixed-integer programming formulations for the problem with the classical hose traffic model and for a new, less conservative, robust variant relying on accessible traffic statistics. Although we can solve these formulations for medium-to-large instances in reasonable times using off-the-shelf MIP solvers, we develop a combined branch-and-price and cutting plane algorithm to handle larger instances. We also provide an extensive discussion of our numerical results. Next, we study the Open Shortest Path First (OSPF) routing enhanced with traffic engineering tools under general demand uncertainty with the motivation to discuss if OSPF could be made comparable to the general unconstrained routing (MPLS) when it is provided with a less restrictive operating environment. To the best of our knowledge, these two routing mechanisms are compared for the first time under such a general setting. We provide compact formulations for both routing types and show that MPLS routing for polyhedral demands can be computed in polynomial time. Moreover, we present a specialized branchand-price algorithm strengthened with the inclusion of cuts as an exact solution tool. Subsequently, we compare the new and more flexible OSPF routing with MPLS as well as the traditional OSPF on several network instances. We observe that the management tools we use in OSPF make it significantly better than the generic OSPF. Moreover, we show that OSPF performance can get closer to that of MPLS in some cases. Finally, we consider the Network Loading Problem (NLP) under a polyhedral uncertainty description of traffic demands. After giving a compact multicommodity formulation of the problem, we prove an unexpected decomposition property obtained from projecting out the flow variables, considerably simplifying the resulting polyhedral analysis and computations by doing away with metric inequalities, an attendant feature of most successful algorithms on NLP. Under the hose model of feasible demands, we study the polyhedral aspects of NLP, used as the basis of an efficient branch-and-cut algorithm supported by a simple heuristic for generating upper bounds. We provide the results of extensive computational experiments on well-known network design instances.Altın, AyşegülPh.D

low-energy mobile packet radio networks : routing, scheduling, and architecture

Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, February 2000.Includes bibliographical references (leaves 171-176).Packet Radio Networks (PRNETs), which are also called ad-hoc networks, have the capability of fast (and ad-hoc) deployment and set-up, and therefore potentially have several useful civilian and military applications. Building low-energy PRNETs is an important design goal, because the communication devices are typically powered by batteries, and therefore are useless when the batteries are depleted. We choose to look at low-energy PRNETs by focusing on the problem of minimum-energy communication over a PRNET, resolving any related issues or design decisions in a manner consistent with the overall goal of low-energy PRNETs. We conclude that the problem of minimum-energy communication over a PRNET is really a joint routing-scheduling-topological problem. We find the joint problem to be intractable, and therefore propose to solve it by decomposing it, solving each component separately. The resulting solution is not optimal but the degree of suboptimality depends on how the problem is decomposed. Therefore we compare different decomposition methods, and select the one that is likely to yield the best solution to the joint problem. After deciding how to decompose the joint problem, we study the separate components. For the topological problem we decide that nodes should communicate with a limited number of other nodes, referred to as neighbors. We also propose and analyze the performance of a procedure for managing the set of neighbors. For the scheduling problem, we propose a novel and practical class of scheduling algorithms. The routing problem is more complex than wireline routing because of interference and fading. When they are incorporated, routing becomes a non-convex problem; and we overcome this by a novel approach that is non-optimal, but is more robust than the optimal approach.by Hisham Ibrahim Kassab.Ph.D

Data gathering techniques on wireless sensor networks

The nearly exponential growth of the performance/price and performance/size ratios of computers has given rise to the development of inexpensive, miniaturized systems with wireless and sensing capabilities. Such wireless sensors are able to produce a wealth of information about our personal environment, in agricultural and industrial monitoring, and many other scenarios. Each sensor due to its miniature nature has severe resource constraints in terms of processing power, storage space, battery capacity and bandwidth of radio. Our goal in this research is to maximize the extraction of information out of the sensor network by efficient resource utilization

Aeronautical engineering: A continuing bibliography with indexes (supplement 292)

This bibliography lists 675 reports, articles, and other documents recently introduced into the NASA scientific and technical information system database. Subject coverage includes the following: design, construction and testing of aircraft and aircraft engines; aircraft components, equipment, and systems; ground support systems; and theoretical and applied aspects of aerodynamics and general fluid dynamics

Wave Propagation

A wave is one of the basic physics phenomena observed by mankind since ancient time. The wave is also one of the most-studied physics phenomena that can be well described by mathematics. The study may be the best illustration of what is “science”, which approximates the laws of nature by using human defined symbols, operators, and languages. Having a good understanding of waves and wave propagation can help us to improve the quality of life and provide a pathway for future explorations of the nature and universe. This book introduces some exciting applications and theories to those who have general interests in waves and wave propagations, and provides insights and references to those who are specialized in the areas presented in the book

NASA patent abstracts bibliography: A continuing bibliography. Section 1: Abstracts (supplement 32)

Abstracts are provided for 136 patents and patent applications entered into the NASA scientific and technical information system during the period July through December 1987. Each entry consists of a citation , an abstract, and in most cases, a key illustration selected from the patent or patent application

Aeronautical engineering: A continuing bibliography with indexes (supplement 272)

This bibliography lists 719 reports, articles, and other documents introduced into the NASA scientific and technical information system in November, 1991. Subject coverage includes: design, construction and testing of aircraft and aircraft engines; aircraft components, equipment, and systems; ground support systems; and theoretical and applied aspects of aerodynamics and general fluid dynamics

Proceedings of the 3rd International Conference on Models and Technologies for Intelligent Transportation Systems 2013

Challenges arising from an increasing traffic demand, limited resource availability and growing quality expectations of the customers can only be met successfully, if each transport mode is regarded as an intelligent transportation system itself, but also as part of one intelligent transportation system with “intelligent” intramodal and intermodal interfaces. This topic is well reflected in the Third International Conference on “Models and Technologies for Intelligent Transportation Systems” which took place in Dresden 2013 (previous editions: Rome 2009, Leuven 2011). With its variety of traffic management problems that can be solved using similar methods and technologies, but with application specific models, objective functions and constraints the conference stands for an intensive exchange between theory and practice and the presentation of case studies for all transport modes and gives a discussion forum for control engineers, computer scientists, mathematicians and other researchers and practitioners. The present book comprises fifty short papers accepted for presentation at the Third Edition of the conference. All submissions have undergone intensive reviews by the organisers of the special sessions, the members of the scientific and technical advisory committees and further external experts in the field. Like the conference itself the proceedings are structured in twelve streams: the more model-oriented streams of Road-Bound Public Transport Management, Modelling and Control of Urban Traffic Flow, Railway Traffic Management in four different sessions, Air Traffic Management, Water Traffic and Traffic and Transit Assignment, as well as the technology-oriented streams of Floating Car Data, Localisation Technologies for Intelligent Transportation Systems and Image Processing in Transportation. With this broad range of topics this book will be of interest to a number of groups: ITS experts in research and industry, students of transport and control engineering, operations research and computer science. The case studies will also be of interest for transport operators and members of traffic administration