Payload Operations Control Center (POCC)

The Spacelab payload operations control center (POCC) timeline analysis program which is used to provide POCC activity and resource information as a function of mission time is described. This program is fully automated and interactive, and is equipped with tutorial displays. The tutorial displays are sufficiently detailed for use by a program analyst having no computer experience. The POCC timeline analysis program is designed to operate on the VAX/VMS version V2.1 computer system

STAR adaptation of QR algorithm

The QR algorithm used on a serial computer and executed on the Control Data Corporation 6000 Computer was adapted to execute efficiently on the Control Data STAR-100 computer. How the scalar program was adapted for the STAR-100 and why these adaptations yielded an efficient STAR program is described. Program listings of the old scalar version and the vectorized SL/1 version are presented in the appendices. Execution times for the two versions applied to the same system of linear equations, are compared

Command/response protocols and concurrent software

A version of the program to control the parallel jaw gripper is documented. The parallel jaw end-effector hardware and the Intel 8031 processor that is used to control the end-effector are briefly described. A general overview of the controller program is given and a complete description of the program's structure and design are contained. There are three appendices: a memory map of the on-chip RAM, a cross-reference listing of the self-scheduling routines, and a summary of the top-level and monitor commands

Optimal Unravellings for Feedback Control in Linear Quantum Systems

For quantum systems with linear dynamics in phase space much of classical feedback control theory applies. However, there are some questions that are sensible only for the quantum case, such as: given a fixed interaction between the system and the environment what is the optimal measurement on the environment for a particular control problem? We show that for a broad class of optimal (state-based) control problems (the stationary Linear-Quadratic-Gaussian class), this question is a semi-definite program. Moreover, the answer also applies to Markovian (current-based) feedback.Comment: 5 pages. Version published by Phys. Rev. Let

CARLOMAT_3.0, an automatic tool for the electron-positron annihilation into hadrons at low energies

A new version of CARLOMAT that allows to generate automatically the Monte Carlo programs dedicated to the description of the processes e+e- -> hadrons at low center-of-mass energies is presented. The program has been substantially modified in order to incorporate the photon-vector meson mixing terms and to make possible computation of the helicity amplitudes nvolving the Feynman interaction vertices of new tensor structures, like those predicted by the Resonance Chiral Theory or Hidden Local Symmetry model, and the effective Lagrangian of the electromagnetic interaction of the nucleons. Moreover, a number of new options have been introduced in the program in order to enable a better control over the effective models implemented. In particular, they offer a possibility to determine the dominant production mechanisms of the final state chosen by the user.Comment: 15 pages, 5 figures, matches version to be published in Computer Physics Communication

Star adaptation for two-algorithms used on serial computers

Two representative algorithms used on a serial computer and presently executed on the Control Data Corporation 6000 computer were adapted to execute efficiently on the Control Data STAR-100 computer. Gaussian elimination for the solution of simultaneous linear equations and the Gauss-Legendre quadrature formula for the approximation of an integral are the two algorithms discussed. A description is given of how the programs were adapted for STAR and why these adaptations were necessary to obtain an efficient STAR program. Some points to consider when adapting an algorithm for STAR are discussed. Program listings of the 6000 version coded in 6000 FORTRAN, the adapted STAR version coded in 6000 FORTRAN, and the STAR version coded in STAR FORTRAN are presented in the appendices

Aeroelastic stability analysis of the AD-1 manned oblique-wing aircraft

The AD-1 manned flight test program was conducted to evaluate the stability, control and handling characteristics of oblique wing aircraft. The results of the aeroelastic stability analysis are presented for both the wing alone and the wing with ailerons. A comparison was made between the results obtained using the traditional k-method of flutter analysis and the results using the PK or British method of flutter analysis. Studies were performed using the latest version of the NASTRAN computer code as well as the PASS/FLUT program

Logic + control: On program construction and verification

This paper presents an example of formal reasoning about the semantics of a Prolog program of practical importance (the SAT solver of Howe and King). The program is treated as a definite clause logic program with added control. The logic program is constructed by means of stepwise refinement, hand in hand with its correctness and completeness proofs. The proofs are declarative - they do not refer to any operational semantics. Each step of the logic program construction follows a systematic approach to constructing programs which are provably correct and complete. We also prove that correctness and completeness of the logic program is preserved in the final Prolog program. Additionally, we prove termination, occur-check freedom and non-floundering. Our example shows how dealing with "logic" and with "control" can be separated. Most of the proofs can be done at the "logic" level, abstracting from any operational semantics. The example employs approximate specifications; they are crucial in simplifying reasoning about logic programs. It also shows that the paradigm of semantics-preserving program transformations may be not sufficient. We suggest considering transformations which preserve correctness and completeness with respect to an approximate specification.Comment: 29 pages. Version 3 substantially reworked, in particular all informal reasoning replaced by proofs, part of the content moved to 1412.8739 and 1411.3015. Versions 4, 5 and this one -- various modifications and extensions. Under consideration in Theory and Practice of Logic Programming (TPLP