ALBERT

Description: The short-circuit current reduction in GaAs shallow junction heteroface solar cells was calculated according to a simplified solar cell damage model in which the nonuniformity of the damage as a function of penetration depth is treated explicitly. Although the equivalent electron fluence was not uniquely defined for low-energy monoenergetic proton exposure, an equivalent electron fluence is found for proton spectra characteristic of the space environment. The equivalent electron fluence ratio was calculated for a typical large solar flare event for which the proton spectrum is PHI(sub p)(E) = A/E(p/sq. cm) where E is in MeV. The equivalent fluence ratio is a function of the cover glass shield thickness or the corresponding cutoff energy E(sub c). In terms of the cutoff energy, the equivalent 1 MeV electron fluence ratio is r(sub p)(E sub c) = 10(9)/E(sub c)(1.8) where E(sub c) is in units of KeV.

Description: An automatic program for the reduction of overlapping Carte du Ciel plates is described. The projection and transformation equations are given and the RAA subprogram flow is outlined. The program was applied to two different sets of data, namely to nine overlapping plates of the Cape Zone of the CdC, and to fifteen plates taken with the CIDA-refractor of the open cluster Tr10.

Description: It is desirable to perform qualification tests prior to deployment of solar cells in space power applications. Such test procedures are complicated by the complex mixture of differing radiation components in space which are difficult to simulate in ground test facilities. Although it has been shown that an equivalent electron fluence ratio cannot be uniquely defined for monoenergetic proton exposure of GaAs shallow junction cells, an equivalent electron fluence test can be defined for common spectral components of protons found in space. Equivalent electron fluence levels for the geosynchronous environment are presented.

Description: A rapid and accurate method for the reduction of comet or asteroid plates is described. Projection equations, scale length correction, rotation of coordinates, linearization, the search for additional reference stars, and the final solution are examined.

Description: Probabilistic composite micromechanics methods are developed that simulate expected uncertainties in unidirectional fiber composite properties. These methods are in the form of computational procedures using Monte Carlo simulation. The variables in which uncertainties are accounted for include constituent and void volume ratios, constituent elastic properties and strengths, and fiber misalignment. A graphite/epoxy unidirectional composite (ply) is studied to demonstrate fiber composite material property variations induced by random changes expected at the material micro level. Regression results are presented to show the relative correlation between predictor and response variables in the study. These computational procedures make possible a formal description of anticipated random processes at the intra-ply level, and the related effects of these on composite properties.

Description: In 1995, over six hundred thousand licensed pilots flew nearly thirty-five million flights into over eighteen thousand U.S. airports, logging more than 519 billion passenger miles. Since demand for air travel has increased by more than 50% in the last decade while capacity has stagnated, congestion is a problem of undeniable practical significance. In this thesis, we will develop optimization techniques that reduce the impact of congestion on the national airspace. We start by determining the optimal release times for flights into the airspace and the optimal speed adjustment while airborne taking into account the capacitated airspace. This is called the Air Traffic Flow Management Problem (TFMP). We address the complexity, showing that it is NP-hard. We build an integer programming formulation that is quite strong as some of the proposed inequalities are facet defining for the convex hull of solutions. For practical problems, the solutions of the LP relaxation of the TFMP are very often integral. In essence, we reduce the problem to efficiently solving large scale linear programming problems. Thus, the computation times are reasonably small for large scale, practical problems involving thousands of flights. Next, we address the problem of determining how to reroute aircraft in the airspace system when faced with dynamically changing weather conditions. This is called the Air Traffic Flow Management Rerouting Problem (TFMRP) We present an integrated mathematical programming approach for the TFMRP, which utilizes several methodologies, in order to minimize delay costs. In order to address the high dimensionality, we present an aggregate model, in which we formulate the TFMRP as a multicommodity, integer, dynamic network flow problem with certain side constraints. Using Lagrangian relaxation, we generate aggregate flows that are decomposed into a collection of flight paths using a randomized rounding heuristic. This collection of paths is used in a packing integer programming formulation, the solution of which generates feasible and near-optimal routes for individual flights. The algorithm, termed the Lagrangian Generation Algorithm, is used to solve practical problems in the southwestern portion of United States in which the solutions are within 1% of the corresponding lower bounds.