Computation of scalar far-field patterns of large-aperture antennas

In computer programs used for evaluating the performance of high-gain antennas, efficient numerical methods for calculating the far-field patterns must be used since the majority of computer time and storage requirements may be attributed to this phase of the program. The numerical method most frequently used is the Fast Fourier Transform (FFT), which computes the far field as the Fourier transform of the field distribution in the antenna aperture. A new numerical method that in many applications is superior to the FFT in terms of reducing computer time and storage requirements is described

Computer program for analysis of coupled-cavity traveling wave tubes

A flexible, accurate, large signal computer program was developed for the design of coupled cavity traveling wave tubes. The program is written in FORTRAN IV for an IBM 360/67 time sharing system. The beam is described by a disk model and the slow wave structure by a sequence of cavities, or cells. The computational approach is arranged so that each cavity may have geometrical or electrical parameters different from those of its neighbors. This allows the program user to simulate a tube of almost arbitrary complexity. Input and output couplers, severs, complicated velocity tapers, and other features peculiar to one or a few cavities may be modeled by a correct choice of input data. The beam-wave interaction is handled by an approach in which the radio frequency fields are expanded in solutions to the transverse magnetic wave equation. All significant space harmonics are retained. The program was used to perform a design study of the traveling-wave tube developed for the Communications Technology Satellite. Good agreement was obtained between the predictions of the program and the measured performance of the flight tube

Station keeping of high power communication satellites

Station keeping of high power communication satellite

Regional landscape change: A case for ERTS-1

There are no author-identified significant results in this report

A summary of existing and planned experiment hardware for low-gravity fluids research

An overview is presented of (1) existing ground-based, low gravity research facilities, with examples of hardware capabilities, and (2) existing and planned space-based research facilities, with examples of current and past flight hardware. Low-gravity, ground-based facilities, such as drop towers and aircraft, provide the experimenter with quick turnaround time, easy access to equipment, gravity levels ranging from 10(exp -2) to 10(exp -6) G, and low-gravity durations ranging from 2 to 30 sec. Currently, the only operational space-based facility is the Space Shuttle. The Shuttle's payload bay and middeck facilities are described. Existing and planned low-gravity fluids research facilities are also described with examples of experiments and hardware capabilities

Some results on the divergence criterion used to solve the feature selection problem

Techniques for solving the feature selection problem are presented. Topics discussed include the reduction of the number of variables in "best b", and the iterative selection of H sub i

A counter example in linear feature selection theory

The linear feature selection problem in multi-class pattern recognition is described as that of linearly transforming statistical information from n-dimensional (real Euclidean) space into k-dimensional space, while requiring that average interclass divergence in the transformed space decrease as little as possible. Divergence is the expected interclass divergence derived from Hajek two-class divergence; it is known that there always exists a k x n matrix B such that the transformation determined by B maximizes the divergence in k-dimensional space. It is known that, if Q is any k x k invertible matrix, and B is as defined above, then QB again maximizes the divergence in k-space. It is shown that the converse of this result is false: two matrices exist, B sub 1 and B sub 2, each of which maximizes transformed divergence, which are not related in the fashion B sub 2 = QB sub 1 for any k x k matrix Q

A fixed point theorem for certain operator valued maps

In this paper, we develop a family of Neuberger-like results to find points z epsilon H satisfying L(z)z = z and P(z) = z. This family includes Neuberger's theorem and has the additional property that most of the sequences q sub n converge to idempotent elements of B sub 1(H)

On Nth roots of positive operators

A bounded operator A on a Hilbert space H was positive. These operators were symmetric, and as such constitute a natural generalization of nonnegative real diagonal matrices. The following result is thus both well known and not surprising: A positive operator has a unique positive square root (under operator composition)

The role of eigenvalues in linear feature selection theory

A particular measure of pattern class distinction called the average interclass divergence, or more simply, divergence, is considered. Here divergence will be the pairwise average of the expected interclass divergence derived from Hajek's two-class divergence