Browse All Digital Items

The problem to which this thesis is addressed is known as the n by m scheduling problem. It can be briefly described as follows: n commodities are, each in a prescribed order, to be processed on one or more of m facilities which are initially idle, ready to provide service, and uncommited in the future. All ofthe n commodities are ready to be processed initially, and each must be processed for a prescribed period of time on each facility to which it is to be routed.

Implemented to provide the users with as much power as possible, LETEXT conforms to design criteria which include service to the users and security and privacy of the users' information.

First-order methods for convex and nonconvex optimization have been an important research topic in the past few years. This talk studies and develops efficient algorithms of first-order type, to solve a variety of problems. We first focus on the widely studied gradient-based methods in composite convex optimization problems that arise extensively in compressed sensing and machine learning.

This study considers the effect of priority dispatching in a labor and machine limited production system. A simulation model of an actual shop is developed using GASP II. The shop is characterized as a flow shop with cycling in which lots are subject to stochastic yields and reworks. Five labor sections, each operating on three shifts, exist in the shop.

Methods used by electric power companies for estimating future loads as a basis for timing generating capacity additions have been examined. It has been found that these estimates deviate widely from time to time from the loads subsequently experienced. A method is developed for interrelating the total annual energy requirements, annual energy sales by classes, and the annual peak loads as a possible basis for improving the timing of generating capacity additions.

The conversion of a decision table into an optimal decision tree is an integral part of most decision table compilers. This thesis establishes some fundamental concepts of a heuristic approach to the conversion of limited entry decision tables into decision trees and proposes algorithms for the latter two objectives.

Traditional methods of analyzing questions and answers as they occur in reference libraries are discussed and criticized. Methods are evaluated. A pragmatic scheme is suggested which classifies answers by their formats, dividing them into exact reproduction type, fill-in-the-blank type, short descriptive type, information-about type, and list-of-references types.

A general discussion of the principles of simulation is given, with emphasistoward an information retrieval system. The design of FOSSAL, the simulation model, is studied, with particular attention paid to the concept of programmable variables. An explanation is given for the use of each sampling distribution and all related data. It is concluded that FOSSAL is extremely useful in helping a designer to evaluate an on-line real-time information retrieval system which has its information stored on a tape or disk subsystem.

In general, problems are solvable along a continuum of abstraction. There is, at any given point in the development of the solution, a most efficient or optimum strategy. In information retrieval systems the ultimate solution is obtained at a more specific rather than at a more abstract level. An online computer program called GRINS is described which implements the information specialist's role in the negotiating of a user's need. The structure of the program is modular so that improvements may be easily made. Some improvements are suggested.

A disc-oriented processor for programs written in the FORTRAN IV language has been developed for the General Electric Model 225 computer at Lehigh University. The processor is an outgrowth of a tape-oriented system distributed by General Electric. The disc system has been shown to compile and execute FORTRAN IV programs in as little as 23% of the time required by the tape system.

This thesis was undertaken with the idea that there is a relationship between the level of technicality of a scientific paper and the style in which it is written, in particular, with respect to vocabulary and grammatical complexity. The newest area of interest is computational linguistics. Most work is in anlysis of syntactic structures and the construction of grammars.

Theoretical concepts underlying information systems are analyzed. The study is in general oriented towards computer-based, large capacity IS. An attempt has been made to identify the distinguishible elements of IS domain and establish interrelationships between them. Some current IS theories are evaluated.

Objectives of the development of the simulation are: a. To develop a model for the operation of an existing automatic punch press line, b. To write a program for the LGP-30 Digital Computer, c. To analyze the program and the model.