Conventional modal analysis is performed using FFT Analyzers with modal analysis software developed by one of many test/analysis software vendors. The analysis is performed in the frequency domain using frequency response functions. A recent advancement in modal analysis involves analyzing the measured free response of a structure in the time domain. The Ibrahim Time Domain (ITD) Algorithm is such a method which has been used and verified at government environmental test facilities. The ITD is an accurate numeric solution. Minimal operator interaction is required for proper performance of the algorithm. The results of the ITD Algorithm are far superior to those of conventional frequency response methods when the test structure has closely spaced or heavily damped modes of vibration. Currently, the ITD exists only on mainframe computers. The purpose of this research is to adapt the numeric routine to a mini-computer (DEC PDP-11/34). In this way, the ITD Algorithm could be incorporated in any environmental test facility with access to a mini-computer.

A software package for linear programming has been developed using the revised simplex and dual simplex algorithms. The design of the program incorporates an experimental change in the dual simplex algorithm. If the entered problem is not primal feasible, a modified dual simplex algorithm is used. The traditional dual simplex method requires an initial dual feasible basis and maintains feasibility throughout its application. The experimental change is to ignore this criteria of dual feasibility. The objective then becomes to obtain primal feasibility. Once this is attained, the revised simplex algorithm is applied to obtain optimality, if this has not been reached through use of the dual. This experimental change redirects the goal of the dual simplex method from obtaining objective function optimality to obtaining primal feasibility. Program testing has shown the experimental design to produce correct results for a variety of linear programming problems. The program is written for an IBM PC using PASCAL for coding. Spreadsheet format and menus provide ease in problem input and output. Devices for output of problem and solution are printer, screen and/or disk. A problem can be saved and retrieved at a later time for editing.

The purpose of this manual is to provide a guide to Florida Technological University Computer Center programs which are commonly used for Industrial Engineering analysis. The user need not have extensive prior knowledge of computers to use this manual but an adequate understanding of the applied engineering techniques is recommended.

This study presents five supporting programs in the area of facility layout design. Programs are "stand alone" adapted type which cover data analysis and analytical techniques. Programs are From/To (From/To Chart generator), CRAFT* (Computerized Relative Allocation of Facilities Technique), RELVAL (Relationship Chart generator), CORELAP* (Computerized Relationship Layout Planning), and EVAL (Layout Evaluation program). Theory, complete program documentation, and case example for each program are presented. Programs are written in an interactive basic mode and have been tested on the Apple II Plus system.

Yes / The decision of the High Court in Astron Clinica Limited and others v The Comptroller General of Patents, Designs and Trade Marks(1) in January 2008 by the Honourable Mr. Justice Kitchin aligns the United Kingdom patent office with the European patent office(2), by overturning the practice of rejecting computer programs patents. The importance of this case was confirmed by the practice note released on the 7th of February 2008 by the UK patent office which indicated that the decision would not be appealed. However, the area is by no means settled with the decision in Symbian in March 2008 casting uncertainly on the Astron Clinica decision and the Aerotel/ Macrossan four step test.

Typescript (photocopy). / Digitized by Kansas Correctional Industries

A major purpose of this dissertation is to design and develop data structures for the Critical Path Method-Material Requirements Planning (CPM/MRP) methodology. The data structures developed consider the trade-off between processing time required to perform the required operations on data structures and the computer capacity utilization to store data. The CPM/MRP technique was designed to combine the capabilities of the critical path method and material requirements planning system. The critical path method is a project planning and control technique which schedules projects subject to technological sequence constraints and activity durations. When combined with material requirements planning, the methodology explicitly considers both the resources required by the activities comprising the project and the lead time to acquire the required resources. CPM/MRP contains algorithms for project scheduling subject to technological sequence and resource constraints. The early start and late start algorithms find feasible early start and late start schedules for both activity start times and resource order release times. The major drawback of the FORTRAN IV computer program which incorporated the CPM/MRP algorithms was the tremendous computer memory capacity requirements. This prohibited application of the CPM/MRP to large projects. The data structures developed in this dissertation are efficient with respect to both computer memory utilization and processing time. To design the data structures, the characteristics of storable and non-storable resources and the necessary operations within each resource category is studied. Another purpose of this dissertation is to develop an algorithm to schedule operating rooms for surgery procedures in hospitals subject to resource constraints to increase operating suite utilization. Since the major reason for low operating suite utilization is lack of required resources when they are needed and where they are needed, the CPM/MRP concept is applied to schedule surgeries. The late start algorithm outlined in this dissertation schedules surgeries and resources required for each surgery. The data structures and the surgery scheduling algorithm are incorporated into a FORTRAN IV computer program. The program has been tested with actual data gathered from a hospital. The results met the objectives of both computer memory utilization and low computation time.

No description available.

No description available.

Transportation is one of the most frequent problems in the business world. The major feature of the problem is that there are many warehouses and many delivery places. The objective of solving this problem is to find the amount of goods that should be sent from each warehouse to each customer while minimizing cost.Unfortunately, understanding the process and interpreting the results are not easy tasks. The method is very complex. The result is in the form of a table. We might say that it is not a friendly user-interface.In this thesis, we will create an application which uses a window as an interface, and uses minimal storage.Borland C++ v.4.0 is chosen to handle the implementation, and Borland Object Windows (class) Library for C++ v.2.0, OWL, is used for the interface. Therefore, this application operates on Windows 3.1 or Windows 95, but not on DOS. / Department of Computer Science