An alternative to annualizing the cost-of-living adjustments on federal retirement : hearing before the Subcommittee on Civil Service, Post Office, and General Services of the Committee on Governmental Affairs, United States Senate, Ninety-seventh Congress, first session, on S. 677 ... April 1, 1981.

Mode of access: Internet.

Cost-of-living allowances for federal employees in nonforeign areas : hearing before the Subcommittee on Civil Service, Post Office, and General Services of the Committee on Governmental Affairs, United States Senate, Ninety-seventh Congress, first session, May 14, 1981.

Mode of access: Internet.

Oversight of GSA's federal surplus real property disposal program : hearing before the Subcommittee on Civil Service, Post Office, and General Services of the Committee on Governmental Affairs, United States Senate, Ninety-eighth Congress, first session, November 1, 1983.

Mode of access: Internet.

Merit pay and proposed pay-for-performance regulations : hearing before the Subcommittee on Civil Service, Post Office, and General Services of the Committee on Governmental Affairs, United States Senate, Ninety-eighth Congress, first session.

"S. 958, the Merit Pay Reform Act of 1983, and amendments to expand its coverage with regard to regulations proposed by the Office of Personnel Management; May 26, June 9, and July 14, 1983"--Pt. 2.

Annual report of the Postmaster General : hearing before the Subcommittee on Federal Services, Post Office, and Civil Service of the Committee on Governmental Affairs, United States Senate, One hundredth Congress, first session, March 16, 1987.

Shipping list no.: 87-469-P.

Annual report of the Postmaster General : hearing before the Subcommittee on Federal Services, Post Office, and Civil Service of the Committee on Governmental Affairs, United States Senate, One Hundred First Congress, second session, April 27, 1990.

Includes bibliographical references.

The space program in the post-Apollo period; a report of the President's Science Advisory Committee,

Commonly known as the Long report [Long, Franklin A.]

Receipts and Classes of Post Offices with Basic Salaries of Postmasters

Title Varies: Revenues and Classes of Post Offices

Post-hatching growth and development of the pectoral and pelvic limbs in the black noddy, Anous minutus

The black tern (Anous minutus) uses a semi-precocial growth strategy. Terrestrial locomotor capacity occurs soon after hatching, but pectoral limb development is delayed and flight is not possible until about post-hatching day 50. A growth series (hatchlings to fledglings) was used to explore how limb musculoskeletal development varied with body mass. In the pelvic limb, bone lengths scaled isometrically or with negative allometry. Gastrocnemius muscle mass and the failure load and stiffness of the tibiotarsus scaled isometrically. In the pectoral limb, pectoralis and supracoracoideus muscle masses increased with strong positive allometry that was mirrored by increases in wing bone strength and stiffness. Bending strength (σult) and modulus (E) remained fairly constant throughout development to fledging for all limb bones. The moment of inertia (I) scaled with negative allometry for the tibiotarsus and with strong positive allometry in the wing bones. Differences in σult and E of the tibiotarsus between pre-fledged chicks and adults was due, primarily, to increases in bone density rather than increases in the moment of inertia of the skeletal elements, whereas σult of wing bones was a function of increases in both bone density and I. Early development of functional pelvic limbs in tree-nesting birds is relatively unusual, and presumably reflects a familial trait that does not appear to compromise breeding success in this species.

Incremental derivation of abstraction relations for data refinements

Data refinements are refinement steps in which a program’s local data structures are changed. Data refinement proof obligations require the software designer to find an abstraction relation that relates the states of the original and new program. In this paper we describe an algorithm that helps a designer find an abstraction relation for a proposed refinement. Given sufficient time and space, the algorithm can find a minimal abstraction relation, and thus show that the refinement holds. As it executes, the algorithm displays mappings that cannot be in any abstraction relation. When the algorithm is not given sufficient resources to terminate, these mappings can help the designer find a suitable abstraction relation. The same algorithm can be used to test an abstraction relation supplied by the designer.