Research for Computer Programs

Syndicate content
February 1, 1986
This paper presents formulas for the initial and final headings on the shortest great circle path between an origin 'O' and a destination 'D' whose positions are specified by latitude and longitude. A FORTRAN subroutine to implement the formulas is also included.
Read More | Download Report
October 1, 1984
This research contribution analyzes the problem of ordnance acquisition when the targets to be attacked are uncertain. It introduces the use of a utility function to evaluate the outcome of the attack process. Two models of the attack process are considered: The first assumes that the random target vector is attacked simultaneously with the available weapons. The second is a Sequential-Attack Model (SEAM) in which targets appear one at a time and the attack process continues as long as the current target can be attacked. The expected utility for a mix of weapons for the Simultaneous-Attack Model (SIAM) is computed as the weighted average of the expected utility of the mix of weapons against each target vector. The expected value for the SEAM is estimated by using a simulation of the attack process. It is argued that older methods of selecting weapons are biased towards special-purpose weapons and that the SIAM and SEAM models are not subjected to this deficiency. Furthermore, in spite of being the more complicated model, the SEAM approach appears more realistic in the way that it models that attack process. An operational example is used to illustrate the problem and the SEAM approach.
Read More | Download Report
August 1, 1983
This analysis investigates the savings that could be achieved from using selected reenlistment bonuses to improve the long-run balance between accession and first-term retention in the Navy. It also provides a brief summary of the model used in addressing this issue.
Read More | Download Report
August 1, 1983
This paper describes the procedures followed to create the Navy Comprehensive Compensation and Supply Study requirements. The report also includes the computer program which was used to determine these requirements.
Read More | Download Report
May 1, 1983
Recruiting, training, and reenlistment bonus costs are calculated for recruits with 4-year enlistments in 28 rating groups. A computer simulation model is developed to minimize these costs while meeting manpower requirements.
Read More | Download Report
March 1, 1983
This paper reviews, from the U.S. point of view, the approach usually taken in analyzing the acoustic detection process, and presents some methods that are used to check whether our descriptions bear any resemblance to what actually happens.
Read More | Download Report
November 1, 1982
This paper proposes two estimators of hte correlation coefficient, p, when statisticians will not construct a master file on individuals because of confidentiality issues.
Read More | Download Report
September 1, 1982
This Research Contribution describes a methodology for assessing enemy ability to trail friendly ships at sea. It consists of four parts. The first part treats the search for a lost quarry by shipborne helicopter or long-range reconnaissance aircraft. The second describes a Markov model yielding the fraction of time the ship is free of trail. The third part estimates enemy aircraft requirements to achieve specific search results. The last part presents and documents an APL program, TRAIL, that performs all required calculations.
Read More | Download Report
August 1, 1982
This report is a user's manual for a set of programs used to calculate Marine Corps retention goals for individual commands, given overall Marine Corps retention goals. The programs allow adjustments to differentiate between usual and early reenlistments and to account for differences in the situations of individual commands. Current goals consider commands' occupational field compositions; programs are also provided for the case in which occupational fields are not considered.
Read More | Download Report
June 1, 1982
This paper derives the method for aggregating conditional absorbing Markov chains into a single chain that is representative of the total process and has the same state space as the conditional chains.
Read More | Download Report