No description available.

No description available.

No description available.

No description available.

No description available.

No description available.

In this thesis, a system for studying human/computer interfaces is introduced. The human/computer interface provides several features, the most noteable of which is TOKEN COMPLETION. These features permit the user to define and/or redefine command tokens, define and/or delete synonym and noiseword tokens, and to establish a terminal environment. The terminal environment includes the ability to specify automatic comment blocking, token look-ahead, and to control the source of data input (keyboard, VMS file, or I/O buffer). The ability to token complete is based on a forest of generalized trees used to implement dynamic deterministic finite state automata (DDFA). These trees are built during IPL and loaded with command, synonym, and noiseword tokens, all of which are stored in separate VMS files. Synonym and noiseword translation is carried out in the lexical analysis process, thereby negating any need to specify these functions in the grammar of the language. Insertion and deletion into the forest may be executed at any time, permitting the dynamic definition and deletion of synonyms and noisewords. During synonym and/or noiseword definition, lexical analysis switches to a deterministic finite state automata (DFA) mode of operation. Upon completion, lexical analysis reverts to DDFA mode. A sample grammar is provided in the APPENDICES. The lexical analysis process is not tied into this grammar but rather is very general and will process any tokens stored in the command, synonym, and noiseword files. The sample grammar is LALR(1). / Master of Science

This thesis presents the development and validation of a simulation model for an on-line IMS/VS configuration. A conceptual queueing model is developed from an actual system configuration and the simulation model parallels this conceptualization. The validation of the simulation model is carried out in three phases utilizing operational data from IMS logs and system monitors. This model is then used to evaluate system performance under a variety of operating configurations and system loads. A configuration which results in improved IMS response is the objective of the simulation analysis. / Master of Science

The advantages of integrating artificial intelligence (AI) Technology with data base management system (DBMS) technology are widely recognized as indicated by the results from the survey of AI and data base (DB) researchers. ...In our work, we have focused on the use of data base systems to store large number of facts and rules for a rule-based AI system. / Master of Science

Many activities are comprised of temporally dependent events that must be executed in a specific chronological order. Supportive software applications must preserve these temporal dependencies. Whenever the processing of this type of an application includes transactions submitted to a database that is shared with other such applications, the transaction concurrency control mechanisms within the database must also preserve the temporal dependencies. A basis for preserving temporal dependencies is established by using (within the applications and databases) real-time timestamps to identify and order events and transactions. The use of optimistic approaches to transaction concurrency control can be undesirable in such situations, as they allow incorrect results for database read operations. Although the incorrectness is detected prior to transaction committal and the corresponding transaction(s) restarted, the impact on the application or entity that submitted the transaction can be too costly. Three transaction concurrency control algorithms are proposed in this dissertation. These algorithms are based on timestamp ordering, and are designed to preserve temporal dependencies existing among data-dependent transactions. The algorithms produce execution schedules that are equivalent to temporally ordered serial schedules, where the temporal order is established by the transactions' start times. The algorithms provide this equivalence while supporting currency to the extent out-of-order commits and reads. With respect to the stated concern with optimistic approaches, two of the proposed algorithms are risk-free and return to read operations only committed data-item values. Risk with the third algorithm is greatly reduced by its conservative bias. All three algorithms avoid deadlock while providing risk-free or reduced-risk operation. The performance of the algorithms is determined analytically and with experimentation. Experiments are performed using functional database management system models that implement the proposed algorithms and the well-known Conservative Multiversion Timestamp Ordering algorithm.