Thesis (M. S.)--Washington State University.

M.Com. (Computer Auditing) / The implementation of EDI into South Africa business has only started in the recent past. The main reason for this is the fact that the huge benefits in terms of faster processing of business transactions, reduced costs of processing and the formation of strategic business alliances with key business partners, is only now being accepted by management. The other reason is due to the fact that large, commercially operated Value Added Networks (VANs) have only been in existence in this country during the last two years. The primary objective of this short dissertation can be summarised as follows: a) To provide a brief overview of the developments which are currently taking place in South Africa in the Electronic Data Interchange (EDI) environment and the Value Added Network (VAN) environment; b) To highlight how EDI is currently being implemented in South Africa; c) To develop a simplistic framework of key information systems controls which an auditor should consider when evaluating the information systems at a client; and d) To apply this controls framework to the EDI and VAN environments in order to derive lists of the information systems controls which should be reviewed by the auditor when their client makes use of an EDI VAN.

M.Comm. / The primary objective of the dissertation is: • To explain the design and implementation of effective accounting systems and procedures in a small organisation with a workforce of less than 100 employees. The secondary objectives of the dissertation are as follows: • To explain the nature of current non-value adding accounting systems and procedures whch the small organisation should change or eliminate; • To explain the nature of desired value-adding accounting systems and procedures which should be introduced by the small organisation; • To explain management involvement and participation in the design and implementation of accounting systems and procedures manuals in a small organisation; • To explain the purpose, objectives, need for and basic writing principles which a written accounting procedure of a small organisation must adhere to; • To explain the steps to be followed to design and implement an accounting system and procedure; and • To propose suggestions and recommendations with reference to the design and implementation of accounting systems and procedures. • To determine the minimum and maximum accounting systems and procedures that needed to be implemented in the small organisation; • To identify the shortcomings and positives regarding the information supplied by the current Accounting systems. All of the abovelisted primary and secondary objectives have effect on a small organisation with less than 100 employees, a limited cashflow and which pays limited attention to procedures, due to time constraints. The time constraints relate primarily to the limited workforce.

Note:

No description available.

International Telemetering Conference Proceedings / October 30-November 02, 1995 / Riviera Hotel, Las Vegas, Nevada / The RAH-66 Comanche flight test program requires a state of the art air vehicle and avionics data system consisting of: 1) An airborne, all digital multiplexing and recording system capable of combining digital streams at very high data rates; 2) The ability to record high speed avionics busses from the MEP (Mission Equipment Package) such as MIL-STD-1553B, HSDB (High Speed Data Bus,) PI (Processor Interconnect) Bus, DFN (Data Flow Network,) and TM (Test and Measurement Bus;) 3) A miniaturized, programmable, modular/distributed high speed PCM measurement system for 550 air vehicle measurements recorded on the Comanche Flight Test Aircraft and Propulsion System Test Bed; 4) an airborne digital multiplexing and recording system for recording a composite stream on an Ampex DCRsi tape recorder; 5) A high capacity ground data processing system using parallel processing computers for real time data compression; and 6) distributed analysis system using workstations for data processing with centralized disk storage.

This dissertation addresses the problem of scheduling a set of jobs under two different measures of performance: total tardiness and weighted number of tardy jobs. A new solution approach is presented for the single-machine tardiness problem. This views the problem as one of determining an optimal partition of the job set into early and tardy subsets. The scheme is validated by the development of necessary conditions for optimality. It is shown that if an optimal partition of the jobs into early and tardy subsets is given, the conditions are not only necessary but also sufficient. These results are used to derive a polynomial algorithm to generate a sequence that satisfies these conditions for any arbitrary partition. The implications of these results with respect to solving the tardiness problem, as well as some other related problems, are examined. Particular emphasis is placed on the impact of the partition approach as a device to enhance the performance of existing branch-and-bound procedures. The use of this approach to generate valid inequalities is also discussed. The problem of scheduling a single machine to minimize the weighted number of tardy jobs is examined in detail. A new branch-and-bound procedure is presented as well as the first extensive computational study of the problem. The proposed algorithm relies on lower bounds obtained by means of two relaxations of the problem for which efficient solution procedures exist. The merits of both bounding schemes are extensively tested. The computational results indicate that exact solutions for large problems can be obtained in just a few seconds of computer time. The efficacy of the approach as a heuristic method is also verified. Further, the computational experience provides insight into how various problem parameters affect the solution difficulty of particular problem instances. The multiple-processor version of the weighted number of tardy jobs model is also considered. The basic algorithmic framework for the single-machine problem is extended to obtain optimal preemptive schedules for parallel machines, which may be identical, uniform, or unrelated.

published_or_final_version / Mechanical Engineering / Doctoral / Doctor of Philosophy

published_or_final_version / Computer Science / Doctoral / Doctor of Philosophy

published_or_final_version / Architecture / Doctoral / Doctor of Philosophy