Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “CALL”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,783 records · Page 99

Algorithms for Performance, Dependability, and Performability Evaluation using Stochastic Activity Networks

Modeling tools and technologies are important for aerospace development. At the University of Illinois, we have worked on advancing the state of the art in modeling by Markov reward models in two important areas: reducing the memory necessary to numerically solve systems represented as stochastic activity networks and other stochastic Petri net extensions while still obtaining solutions in a reasonable amount of time, and finding numerically stable and memory-efficient methods to solve for the reward accumulated during a finite mission time. A long standing problem when modeling with high level formalisms such as stochastic activity networks is the so-called state space explosion, where the number of states increases exponentially with size of the high level model. Thus, the corresponding Markov model becomes prohibitively large and solution is constrained by the the size of primary memory. To reduce the memory necessary to numerically solve complex systems, we propose new methods that can tolerate such large state spaces that do not require any special structure in the model (as many other techniques do). First, we develop methods that generate row and columns of the state transition-rate-matrix on-the-fly, eliminating the need to explicitly store the matrix at all. Next, we introduce a new iterative solution method, called modified adaptive Gauss-Seidel, that exhibits locality in its use of data from the state transition-rate-matrix, permitting us to cache portions of the matrix and hence reduce the solution time. Finally, we develop a new memory and computationally efficient technique for Gauss-Seidel based solvers that avoids the need for generating rows of A in order to solve Ax = b. This is a significant performance improvement for on-the-fly methods as well as other recent solution techniques based on Kronecker operators. Taken together, these new results show that one can solve very large models without any special structure.

Deavours, Daniel D.↗

Gravity Sensor Plasticity in the Space Environment

The ability of the brain to learn from experience and to adapt to new environments is recognized to be profound. This ability, called 'neural plasticity,' depends directly on properties of neurons (nerve cells) that permit them to change in dimension, sprout new parts called spines, change the shape and/or size of existing parts, and to generate, alter, or delete synapses. (Synapses are communication sites between neurons.) These neuronal properties are most evident during development, when evolution guides the laying down of a general plan of the nervous system. However, once a nervous system is established, experience interacts with cellular and genetic mechanisms and the internal milieu to produce unique neuronal substrates that define each individual. The capacity for experience-related neuronal growth in the brain, as measured by the potential for synaptogenesis, is speculated to be in the trillions of synapses, but the range of increment possible for any one part of the nervous system is unknown. The question has been whether more primitive endorgans such as gravity sensors of the inner ear have a capacity for adaptive change, since this is a form of learning from experience.

Ross, Muriel D.↗

Computer Based Training: Field Deployable Trainer and Shared Virtual Reality

Astronaut training has traditionally been conducted at specific sites with specialized facilities. Because of its size and nature the training equipment is generally not portable. Efforts are now under way to develop training tools that can be taken to remote locations, including into orbit. Two of these efforts are the Field Deployable Trainer and Shared Virtual Reality projects. Field Deployable Trainer NASA has used the recent shuttle mission by astronaut Shannon Lucid to the Russian space station, Mir, as an opportunity to develop and test a prototype of an on-orbit computer training system. A laptop computer with a customized user interface, a set of specially prepared CD's, and video tapes were taken to the Mir by Ms. Lucid. Based upon the feedback following the launch of the Lucid flight, our team prepared materials for the next Mir visitor. Astronaut John Blaha will fly on NASA/MIR Long Duration Mission 3, set to launch in mid September. He will take with him a customized hard disk drive and a package of compact disks containing training videos, references and maps. The FDT team continues to explore and develop new and innovative ways to conduct offsite astronaut training using personal computers. Shared Virtual Reality Training NASA's Space Flight Training Division has been investigating the use of virtual reality environments for astronaut training. Recent efforts have focused on activities requiring interaction by two or more people, called shared VR. Dr. Bowen Loftin, from the University of Houston, directs a virtual reality laboratory that conducts much of the NASA sponsored research. I worked on a project involving the development of a virtual environment that can be used to train astronauts and others to operate a science unit called a Biological Technology Facility (BTF). Facilities like this will be used to house and control microgravity experiments on the space station. It is hoped that astronauts and instructors will ultimately be able to share common virtual environments and, using telephone links, conduct interactive training from separate locations.

Mullen, Terence J.↗

Study of a Solar X-Ray Telescope

The highly structured nature of the outer solar atmosphere seems to be intimately linked to the presence, at the solar surface, of magnetic fields that have been generated inside the Sun and have emerged to the surface. The corona is brightest (and also hottest) at just those locations where the magnetic field has emerged from inside the Sun. Dynamo theory predicts that strong magnetic fields will be generated deep in the solar interior and that bundles or 'ropes' of magnetic flux will float to the surface. When this happens, a magnetically bipolar region will become visible, extending above the surface in a three-dimensional structure. The field lines penetrate through the surface, showing two magnetic poles, and also exhibit a three-dimensional structure above the surface. The structure created by the field emergence is rooted in the (relatively) cool photosphere and extends through the chromosphere and transition region to the corona. Thus, the magnetic field creates a region, called an active region, which contains portions at temperatures from less than 10(exp 4) K to greater than 10(exp 6) K, and is therefore visible at wavelengths from the infrared through x-rays. The locations where the magnetic field leaves and reenters the visible surface are called the 'footpoints' of the coronal structures associated with the magnetic field. The magnetic fields themselves are not directly visible. However, the hot coronal plasma is, for the most part, constrained to follow the direction of the magnetic field lines in the atmosphere. Now, 100 years after the discovery of x-rays by Wilhelm Roentgen in 1896, we can routinely make observations of the solar corona from outside the Earth's atmosphere in this region of the electromagnetic spectrum. As shown by comparing x-ray images with magnetograms, the bright corona over these bipolar magnetic regions consists of closed structures that seem to follow the orientation of the magnetic field. Although we can see down to the photosphere at x-ray wavelengths when observing the disk of the Sun, this part of the solar atmosphere emits so little that far from the peak of its Planck curve it appears dark in x-ray images. This impression of hot plasma following the magnetic field direction is further strengthened by quantitative studies that calculate coronal magnetic field strength and direction based on photospheric measurements and compare them with the observed brightness and location of the x-ray emitting structures. Such comparisons make it clear that, for the most part, the hot plasma conforms to the geometry of the magnetic field and that the coronal brightness is strongly linked to the strength of the magnetic fields which have erupted to the solar surface from the interior. It is also the case that the larger-scale, fainter corona, as well as coronal holes, are strongly influenced by the large-scale solar magnetic field. We may get a small hint of the reason that the coronal plasma outlines the direction of B by examining the thermal conductivity of a hot plasma in the presence of a magnetic field. This quantity has enormously different values in the directions parallel and perpendicular to the field for a coronal temperature of 10(exp 6) K, a particle density of 10(exp 9)/cu cm and a magnetic field strength of 100 G, the conductivity along the field is approximately 13 orders of magnitude greater than that perpendicular to the field. It is therefore not surprising that a parcel of plasma which is locally heated would conduct that heat preferentially in the direction of the field. We also note that the thermal conductivity parallel to the magnetic field increases with temperature T, while the perpendicular conductivity decreases. To the extent that the loop aspect ratio, i.e., the ratio of loop length to loop width, is determined by the thermal conductivity, we would expect that higher temperature loops are longer and thinner than cooler ones. However, if the loop width becomes smaller than the spatial resolution of the observing instrument, this effect will not be directly observable. For organizational purposes, we provide a listing of some scientific objectives for a Solar-B x-ray telescope, arranged in terms of identifiable features in the corona.

Golub, Leon↗

Monitoring Properties of Programs

Development of complex systems requires interaction between a large group of people at various levels of software development, including the communication of properties of the system and the data to be manipulated. A natural idea is to maintain a centralized database of properties of the system to which all members of the development group have access, and to automate the process of checking for violations against this database. The focus of this paper is to discuss such an automated process, called integrity constraint checking. The paper defines the notion of an integrity constraint and discusses considerations for adding an automated checker to a programming language compiler or interpreter. Current work on the implementation of integrity constraint checking in a very high-level language called SequenceL is discussed, and future work in developing a similar checker in an imperative language is outlined.

Fernandez, Francisco G.↗

Applications of Parallel Computation in Micro-Mechanics and Finite Element Method

This project discusses the application of parallel computations related with respect to material analyses. Briefly speaking, we analyze some kind of material by elements computations. We call an element a cell here. A cell is divided into a number of subelements called subcells and all subcells in a cell have the identical structure. The detailed structure will be given later in this paper. It is obvious that the problem is "well-structured". SIMD machine would be a better choice. In this paper we try to look into the potentials of SIMD machine in dealing with finite element computation by developing appropriate algorithms on MasPar, a SIMD parallel machine. In section 2, the architecture of MasPar will be discussed. A brief review of the parallel programming language MPL also is given in that section. In section 3, some general parallel algorithms which might be useful to the project will be proposed. And, combining with the algorithms, some features of MPL will be discussed in more detail. In section 4, the computational structure of cell/subcell model will be given. The idea of designing the parallel algorithm for the model will be demonstrated. Finally in section 5, a summary will be given.

Tan, Hui-Qian↗

Dynamic Flow Management Problems in Air Transportation

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.

Patterson, Sarah Stock↗

Multiple Hub Network Choice in the Liberalized European Market

A key question that so far has received relatively little attention in the germane literature is that of the changes at various airports as a result of the EU liberalization policies. That is, presently, most major European airports still benefit from the so-called home-carrier phenomenon where the country's publicly or semi-publicly owned carrier uses the country's main airport as its gateway hub and, consequently, the home-carrier is also the principal user of this airport (in terms of proportion of total aircraft movements, number of passengers transported, connections, slots ownership, etc.). The country's main airport has substantially benefited from these monopoly conditions of airline captivity, strongly determined by the bilateral system of international air transport regulation. Therefore, European major airports were used to operate in essentially different markets, compared to the increasingly competitive markets of their home based carriers. This partly explains relative stability of transport volumes and financial results of European major airports compared to the relatively volatile financial results of most European national airlines. However, the liberalization of European aviation is likely to change this situation. Market access is open now to all community carriers, i.e. carriers with majority ownership and effective control in the hands of EU citizens. Ticket prices are free, governments can only intervene in case of dumping or excessive pricing. A community airline can choose its seat in any of the 15 member states. Licensing procedures are harmonized between member states. In the last few months community carriers have had unrestricted route access within the EU. Most probably this development will be extended to countries inside and outside Europe. Last year the European Commission got the mandate to start negotiations with 10 other European countries. In the meantime the EC has also started negotiations with the USA on so-called soft rights. In the meantime, open skies agreements have been concluded between the USA and most of the EU member states to facilitate strategic alliances between airlines of the states involved. As a result of this on-going liberalization the model of the single 'national' carrier using the national home base as its single hub for the designated third, fourth and sixth freedom operations will stepwise disappear. Within the EU the concept of the national carrier has already been replaced by that of the community carrier. State ownership in more and more European carriers is reduced. On the longer run mergers or even bankruptcy will further undermine the "single national carrier - single national hub" model in Europe. In the meantime, strategic alliances between national carriers in Europe will already reduce the airlines' loyalty to a single airport. Profit maximization and accountability to share holders will supersede the loyalty of these newly emerging alliances, probably looking for the opportunities of a multiple hub network to adequately cover the whole European market. As a consequence, some European airports might see a substantial decline in arriving, departing and transfer traffic, thus in revenues and financial solvency, as well as in their connection to other inter-continental and intra-European destinations. At the same time, other airports might realize a significant increase in traffic as they will be sought after by the profit maximizing airlines as their major gateway hubs. Which will be the losing airports and which will be the winning ones? Can airports anticipate the actions of airlines in deregulated markets and utilize policies which will improve their relative position? If so, what should be these anticipatory policies? These questions become the more urgent, since an increasing number of major European airports will be privatized in the near future. Although increasing airport congestion in Europe will also be reflected in a growing demand pressure for airport slots, this is not a guarantee for a stable transport volume growth of individual airports. The more volatile the market is, the more vulnerable privatized airports become. Therefore, the main issue of this study is the analysis of the opportunities of major European airports to become a central hub as a result of the network choices made by the new European airlines in a completely liberalized market. In a previous study (Berechman and de Wit, 1996), we already explored the potential of Amsterdam Airport Schiphol of becoming the major West-European hub, once European aviation markets are deregulated. A major hindrance of that study was the use of a single hub-and-spoke network. For example that model could not analyze the viability of different combinations of European hubs within a multiple hub network of alternative airline alliances. In this study, we have formulated the model of a multi-hub network where two West-European airports are used for inter-continental and intra-European travel to enable a more realistic analysis of hub choice. Like the previous one also this multi-hub model is primarily used to assess the potential ability of Amsterdam Airport Schiphol for becoming a major West-European hub. Thus, in particular, the policy tests focus on this airport in a double hub network.

Berechman, Joseph↗

High Resolution X-Ray Explorer (HIREX)

SAO is involved in a study to determine the feasibility of building an orbiting telescope capable of resolving 7 km structure on the Sun. In order to achieve the required imaging the telescope must have a resolution 0.01 arcsec. This fact challenges the state of the art of orbiting telescopes in several areas: Mirror Figuring; Optical Metrology; Optical Mounting; Mirror Figure Control; System Alignment; Optical Stability; Observatory Pointing; and Image Stability. The telescope design concept is based on a 0.6 m Gregorian-style telescope with a 240 meter effective focal length. This is achieved with 2 mirrors supported at opposite ends of a 35 m space-deployable boom. The telescope mirrors are coated with multilayers designed to reflect a broad XUV passband. A third, small mirror, near the focal plane performs the function of selecting the narrow band that is finally imaged. Image stabilization to the 0.005 arcsec level is achieved by active control of the secondary mirror. The primary mirror is held unadjustably to the spacecraft, its pointing set by the spacecraft orientation. The secondary mirror is mounted on a 6-axis stage that permits its position to be changed to align the telescope in space. The stage is intended for intermittent adjustment, both because of its speed of travel, and the TBD alignment procedure. The third mirror is called the TXI (Tuneable X-ray Imager). It is mounted on a gimbal that permits it to be tipped over a 60 degree range, selecting between the individual wavelengths in the initial bandpass. It can also rotated completely out of the way to allow the full, broadband EUV flux to strike the focal plane. Finally, the focal plane assembly is designed to rotate on the outer edge of a circle centered on the TXI mirror rotation axis. This permits the focal plane to move to the location that the TXI redirects the light once it has been set to a given wavelength response. The Engineering Study is divided into the following areas: Mirror Fabrication and Metrology; Optical Layout-Trade Study between On-axis and Off-axis; Overall System Design; and Pointing Control/Image Stabilization. The observational goals of the mission are described in the Mission Requirements document. The work is being performed to the requirements called out in the Science Requirements document.

Goulb, Leon↗

Investigation of Machine Design for Friction Stir Welding

The process of joining two pieces of metal together has not significantly changed over the last few decades. The basic idea used is to bring the pieces together and apply enough heat to melt the metal at the interface. The molten metal mixes and after cooling forms a strong joint. This process is called the fusion process. The most significant difference between the many fusion processes is how the heat is generated and applied. The Welding Institute (TWI), in Great Britain, has recently patented an innovative application of mechanical friction. TWI designed a tool and process called Friction Stir Welding (FSW) that uses friction to heat the metal to within a few hundred degrees Fahrenheit of melting, just to the point of being plastic-like. The tool then stirs the plasticized metal together forming a joint that has been shown to be as good or better than an equivalent fusion joint. The FSW process is well suited for the joining of the aluminum alloys used in the aerospace industry. The relatively low melting point of aluminum eliminates the requirements for exotic materials for pin tool design. The FSW process has been successfully used to join alloys such as 7075 which were before considered "unweldable", and aluminum-lithium 2195 which exhibits many problems when fusion welded. The objective this summer was to investigate the design of a FSW system that could take this process from the laboratory to the manufacturing floor. In particular, it was the goal of my NASA colleague to develop a concept for applying the FSW process to the manufacturing of aluminum cryogenic oxygen and hydrogen tanks, of the sort used to make the Shuttle External Tank.

Romine, Peter L.↗

Interfacing with Legacy using Remote Method Invocation

The assignment described was enough to make a neophyte Java developer bolt for the door: provide a remote method for use by an applet which invokes a native method that wraps a function in an existing legacy library. The purpose of the remote method is to return an instance of a class object whose contents reflect the data structure returned by the legacy function. While embroiled in implementation, I would have spent the time wading through their JNI use group archive as well, but I couldn't seem to locate one. Subsequently, I made the decision to try to document my findings in order to assist others. Before we start on the class design, let's look at what the existing legacy code does. The C function to be called, Get-Legacy-Data, consists of two steps: an ASII file is read from the local disk and its contents are parsed into a Legacy_Type structure whose address is passed as an argument by the caller. The legacy code was compiled into a shared object library, legacy. so, using the IRIX 6.2 compiler and then loaded onto the Web server, a Silicon Graphics Indy station loaded with the IRIX 6.4 operating system. As far as the class design is concerned, the first thing required is a class to act as a template for the data structure returned by the legacy function. This class, JLegacy, declares a series of public instance variables which correspond to the members of Legacy_Type and provides a parameterless constructor. This constructor is never called, not even by the native method which allocates the object for return to the remote method. Next, the remote interface declaration for the remote object must be defined. In order for JLegacyRO to implement getJLegacy, JLegacyRO must interface with the existing legacy code through a native method, getn. getn is declared in the JLegacyRO class but implemented in C, just like the legacy code. getn returns a JLegacy instance and is declared static since its implementation is the same for all instances of the JLegacyRO class.

Howard, Scott M.↗

Finding corner point correspondence from wavelet decomposition of image data

A time efficient algorithm for image registration between two images that differ in translation is discussed. The algorithm is based on coarse-fine strategy using wavelet decomposition of both the images. The wavelet decomposition serves two different purposes: (1) its high frequency components are used to detect feature points (corner points here) and (2) it provides coarse-to-fine structure for making the algorithm time efficient. The algorithm is based on detecting the corner points from one of the images called reference image and computing corresponding points from the other image called test image by using local correlations using 7x7 windows centered around the corner points. The corresponding points are detected at the lowest decomposition level in a search area of about 11x11 (depending on the translation) and potential points of correspondence are projected onto higher levels. In the subsequent levels the local correlations are computed in a search area of no more than 3x3 for refinement of the correspondence.

Manohar, Mareboyana↗

Spaceborne Simulations of Two Direct-Detection Doppler Lidar Techniques

Direct-detection (or incoherent) lidar is now a proven technique for measuring winds in the atmosphere. Over the last few years, several types of direct-detection lidar have evolved. These methods rely on Fabry-Perot interferometers(also termed etalons) or other narrow-passband filters to provide the required spectral resolution. One method, now called the edge (EDG) technique, uses a sharply-sloping filter and measures changes in the filter transmission caused by Doppler shifting of the laser wavelength. A variation of the EDG method, called the double-edge (DEDG) technique, uses two filters. The molecular DEDG method was first demonstrated by Chanin et al. for stratospheric measurements and more recently Korb et al. successfully demonstrated the aerosol DEDG through the troposphere. A second method, here termed the multi-channel (MC) technique, measures Doppler shifts by observing angular displacement of a Fabry-Perot fringe in a spatially resolving detector. The EDG technique thus employs the Fabry-Perot to convert the frequency shift into an amplitude signal, while the MC technique uses the Fabry-Perot to resolve the spectral signature which is then fitted to determine the centroid. The focus of this presentation is on the DEDG and MC methods because these are viewed as the current state of the art in direct-detection lidar. Successful ground-based demonstrations of direct-detection wind measurements have resulted in proposals for spaceborne systems. With this new emphasis on spaceborne systems comes the need for accurate prediction of spaceborne direct-detection Doppler lidar performance. Previously, the EDG and MC methods have been compared although only for aerosol Doppler systems. A recent paper by McGill and Spinhirne compares the DEDG and MC methods in a non-system specific manner for both the aerosol and molecular Doppler systems. The purpose of this presentation is to extend the previous work of McGill and Spinhirne to examine the performance of spaceborne profiling systems. Particular emphasis will be placed on the molecular systems, as these are viewed as the strength of direct-detection Doppler lidar.

McGill, Matthew J.↗

RH1020 Single Event Clock Upset Summary Report

This report summarizes the testing and analysis of "single event clock upset' in the RH1020. Also included are SEU-rate predictions and design recommendations for risk analysis and reduction. The subject of "upsets" in the RH1020 is best understood by using a model consisting of a global clock buffer and a D-type flip-flop as the basic memory unit. The RH1020 is built on the ACT 1 family architecture. As such, it has one low-skew global clock buffer with a TTL-level input threshold that is accessed via a single dedicated pin. The clock signal is driven to full CMOS levels, buffered, and sent to individual row buffers with one buffer per channel. For low-skew performance, the outputs of all of the RH1020 row buffers are shorted together via metal lines, as is done in the A1020B. All storage in the RH1020 consists of routed flip-flops, constructed with multiplexors and feedback through the routing segments. A simple latch can be constructed from a single (combinatorial or C) module; an edge-triggered flip-flop is constructed using two concatenated latches. There is no storage in the I/O modules. The front end of the clock buffering circuitry, at a common point relative to the row buffer, is a sub-circuit that was determined to be the most susceptible to heavy ions. This is due, in part, to its smaller transistors compared to the rest of the circuitry. This conclusion is also supported by SPICE simulations and an analysis of the heavy ion data, described in this report. The edge triggered D flip-flop has two single-event-upset modes. Mode one, called C-module upset, is caused by a heavy ion striking the C-module's sensitive area on the silicon and produces a soft single bit error at the output of the flip-flop. Mode two, called clock upset, is caused by a heavy ion strike on the clock buffer, generating a runt pulse interpreted as a false clock signal and consequently producing errors at the flip-flop outputs. C-module upset sensitivity in the RH1020 is essentially the same as that of its ACT 1 siblings (A1020, A1020A and A1020B), which were well tested, analyzed, and documented in the literature.

Katz, Richard B.↗

Statistical Aspects of ENSO Events (1950-1997) and the El Nino-Atlantic Intense Hurricane Activity Relationship

On the basis of Trenberth's quantitative definition for marking the occurrence of an El Nino (or La Nina), one can precisely identify by month and year the starts and ends of some 15 El Nino and 10 La Nina events during the interval of 1950-1997, an interval corresponding to the most reliable for cataloging intense hurricane activity in the Atlantic basin (i.e., those of category 3-5 on the Saffir-Simpson hurricane scale). The main purpose of this investigation is primarily two-fold: First, the statistical aspects of these identified extremes and the intervening periods between them (called "interludes") are examined and, second, the statistics of the seasonal frequency of intense hurricanes in comparison to the extremes and interludes are determined. This study clearly demonstrates that of the last 48 hurricane seasons, 20 (42 percent) can be described as being "El Nino-related" (i.e., an El Nino was in progress during all, or part, of the yearly hurricane season--June-November), 13 (27 percent) as "La Nina-related" (i.e., a La Nina was in progress during all, or part, of the yearly hurricane season), and 15 (31 percent) as "interlude-related" (i.e., neither an El Nino nor a La Nina was in progress during any portion of the yearly hurricane season). Combining the latter two subgroups into a single grouping called "non-El Nino-related" seasons, one finds that they have had a mean frequency of intense hurricanes measuring 2.8 events per season, while the El Nino-related seasons have had a mean frequency of intense hurricanes measuring 1.3 events per season, where the observed difference in the means is inferred to be statistically important at the 99.8-percent level of confidence. Therefore, as previously shown more than a decade ago using a different data set, there undeniably exists an El Nino-Atlantic hurricane activity relationship, one which also extends to the class of intense hurricanes. During the interval of 1950-1997, fewer intense hurricanes occurred during El Nino-related seasons (always less than or equal to 3 and usually less than or equal to 2, this latter value having been true for 18 of the 20 El Nino-related seasons), while more usually occurred during non-El Nino-related seasons (typically greater than or equal to 2, having been true for 22 of the 28 non-El Nino-related seasons). Implications for the 1998 and 1999 hurricane seasons are discussed.

Wilson, Robert M.↗

Demonstration of Automatically-Generated Adjoint Code for Use in Aerodynamic Shape Optimization

Gradient-based optimization requires accurate derivatives of the objective function and constraints. These gradients may have previously been obtained by manual differentiation of analysis codes, symbolic manipulators, finite-difference approximations, or existing automatic differentiation (AD) tools such as ADIFOR (Automatic Differentiation in FORTRAN). Each of these methods has certain deficiencies, particularly when applied to complex, coupled analyses with many design variables. Recently, a new AD tool called ADJIFOR (Automatic Adjoint Generation in FORTRAN), based upon ADIFOR, was developed and demonstrated. Whereas ADIFOR implements forward-mode (direct) differentiation throughout an analysis program to obtain exact derivatives via the chain rule of calculus, ADJIFOR implements the reverse-mode counterpart of the chain rule to obtain exact adjoint form derivatives from FORTRAN code. Automatically-generated adjoint versions of the widely-used CFL3D computational fluid dynamics (CFD) code and an algebraic wing grid generation code were obtained with just a few hours processing time using the ADJIFOR tool. The codes were verified for accuracy and were shown to compute the exact gradient of the wing lift-to-drag ratio, with respect to any number of shape parameters, in about the time required for 7 to 20 function evaluations. The codes have now been executed on various computers with typical memory and disk space for problems with up to 129 x 65 x 33 grid points, and for hundreds to thousands of independent variables. These adjoint codes are now used in a gradient-based aerodynamic shape optimization problem for a swept, tapered wing. For each design iteration, the optimization package constructs an approximate, linear optimization problem, based upon the current objective function, constraints, and gradient values. The optimizer subroutines are called within a design loop employing the approximate linear problem until an optimum shape is found, the design loop limit is reached, or no further design improvement is possible due to active design variable bounds and/or constraints. The resulting shape parameters are then used by the grid generation code to define a new wing surface and computational grid. The lift-to-drag ratio and its gradient are computed for the new design by the automatically-generated adjoint codes. Several optimization iterations may be required to find an optimum wing shape. Results from two sample cases will be discussed. The reader should note that this work primarily represents a demonstration of use of automatically- generated adjoint code within an aerodynamic shape optimization. As such, little significance is placed upon the actual optimization results, relative to the method for obtaining the results.

Green, Lawrence↗

Making the Learning of Mathematics More Meaningful

In the early 1980's, the National Commission on Excellence in Education responded to the call for reform in the teaching and learning of mathematics. In particular, the Commission developed a document addressing the consensus that all students need to learn more, and often different, mathematics and that instruction in mathematics must be significantly revised. In a response to these calls for mathematics education reform, the National Council of Teachers of Mathematics (NCTM) developed its Curriculum and Evaluation Standards (1989) with a two-fold purpose: 1) to create a coherent vision of what it means to be mathematically literate in a world that relies on calculators and computers, and 2) to create a set of standards to guide the revisions of school mathematics curriculum.

Ward, Robin A.↗

Comment on "The Predicted Size of Cycle 23 Based on the Inferred three-cycle Quasiperiodicity of the Planetary Index Ap"

Recently, Ahluwalia reviewed the solar and geomagnetic data for the last 6 decades and remarked that these data "indicate the existence of a three-solar-activity-cycle quasiperiodicity in them." Furthermore, on the basis of this inferred quasiperiodicity, he asserted that cycle 23 represents the initial cycle in a new three-cycle string, implying that it "will be more modest (a la cycle 17) with an annual mean sunspot number count of 119.3 +/- 30 at the maximum", a prediction that is considerably below the consensus prediction of 160 +/- 30 by Joselin et al. and of similar predictions by others based on a variety of predictive techniques. Several major sticking points of Ahluwalia's presentation, however, must be readdressed, and these issues form the basis of this comment. First, Ahluwalia appears to have based his analysis on a data set of Ap index values that is erroneous. For example, he depicts for the interval of 1932-1997 the variation of the Ap index in terms of annual averages, contrasting them against annual averages of sunspot number (SSN), and he lists for cycles 17-23 the minimum and maximum value of each, as well as the years in which they occur and a quantity which he calls "Amplitude" (defined as the numeric difference between the maximum and minimum values). In particular, he identifies the minimum Ap index (i.e., the minimum value of the Ap index in the vicinity of sunspot cycle minimum, which usually occurs in the year following sunspot minimum and which will be called hereafter, simply, Ap min) and the year in which it occur for cycles 17 - 23 respectively.

Wilson, Robert M.↗