Program behavior under VAX/VMS /

"UILU-ENG 83 1727"--Cover.

Transformations on loop-free program schemata.

Thesis--University of Illinois.

A brief description of the routines in the ILLIAC active program library /

"March 16, 1955"

The coder : a program module for code generation in high-level language compilers /

Originally presented as the author's thesis (M.S.), University of Illinois at Urbana-Champaign.

The evolution of programs : program abstraction and instantiation /

"NSF-MCS-79-04897."

Learning without negative examples via variable-valued logic characterizations : the uniclass inductive program AQ7UNI /

"July 1979."

Bubble scan I program /

"This work was supported in part by the Atomic Energy Commission under Contract No. AT(11-1)-1018"

Use and description of the CALCOMP program to draw networks of logic gates /

Mode of access: Internet.

Osiris III; an integrated collection of computer programs for the management and analysis of social science data.

v. 1. System and program description.--v. 2. Error Messages.--v. 3. Summary of control cards.--v. 4. Sample jobs.--v. 5. Formulas and statistical references.--v. 6. Primer.

Description of the microcomputer program, MANPOWER /

"September 15, 1984."

Pedestrian model parametric studies. Interim report, volume II - vehicle design optimization program.

National Highway Traffic Safety Administration, Washington, D.C.

Proceedings of the Ocean Drilling Program.

Vols. for 176- consist of print manual containing summary report accompanied by CD-ROMs in pocket, containing (in 2 or more CDs) PDF version of the full-text of the report along with log and core data.

Proceedings of the Ocean Drilling Program.

Vols. for <152-> accompanied by charts and CD-ROM containing the electronic version of the v. in pocket.

Simulating the effects of dominance and epistasis on selection response in the CIMMYT wheat breeding program using QuCim

Plant breeders use many different breeding methods to develop superior cultivars. However, it is difficult, cumbersome, and expensive to evaluate the performance of a breeding method or to compare the efficiencies of different breeding methods within an ongoing breeding program. To facilitate comparisons, we developed a QU-GENE module called QuCim that can simulate a large number of breeding strategies for self-pollinated species. The wheat breeding strategy Selected Bulk used by CIMMYT's wheat breeding program was defined in QuCim as an example of how this is done. This selection method was simulated in QuCim to investigate the effects of deviations from the additive genetic model, in the form of dominance and epistasis, on selection outcomes. The simulation results indicate that the partial dominance model does not greatly influence genetic advance compared with the pure additive model. Genetic advance in genetic systems with overdominance and epistasis are slower than when gene effects are purely additive or partially dominant. The additive gene effect is an appropriate indicator of the change in gene frequency following selection when epistasis is absent. In the absence of epistasis, the additive variance decreases rapidly with selection. However, after several cycles of selection it remains relatively fixed when epistasis is present. The variance from partial dominance is relatively small and therefore hard to detect by the covariance among half sibs and the covariance among full sibs. The dominance variance from the overdominance model can be identified successfully, but it does not change significantly, which confirms that overdominance cannot be utilized by an inbred breeding program. QuCim is an effective tool to compare selection strategies and to validate some theories in quantitative genetics.

Procedures and parameters in the real-time program refinement calculus

The real-time refinement calculus is a formal method for the systematic derivation of real-time programs from real-time specifications in a style similar to the non-real-time refinement calculi of Back and Morgan. In this paper we extend the real-time refinement calculus with procedures and provide refinement rules for refining real-time specifications to procedure calls. A real-time specification can include constraints on, not only what outputs are produced, but also when they are produced. The derived programs can also include time constraints oil when certain points in the program must be reached; these are expressed in the form of deadline commands. Such programs are machine independent. An important consequence of the approach taken is that, not only are the specifications machine independent, but the whole refinement process is machine independent. To implement the machine independent code on a target machine one has a separate task of showing that the compiled machine code will reach all its deadlines before they expire. For real-time programs, externally observable input and output variables are essential. These differ from local variables in that their values are observable over the duration of the execution of the program. Hence procedures require input and output parameter mechanisms that are references to the actual parameters so that changes to external inputs are observable within the procedure and changes to output parameters are externally observable. In addition, we allow value and result parameters. These may be auxiliary parameters, which are used for reasoning about the correctness of real-time programs as well as in the expression of timing deadlines, but do not lead to any code being generated for them by a compiler. (c) 2006 Elsevier B.V. All rights reserved.