Artificial intelligence in process control: Knowledge base for the shuttle ECS model

The general operation of KATE, an artificial intelligence controller, is outlined. A shuttle environmental control system (ECS) demonstration system for KATE is explained. The knowledge base model for this system is derived. An experimental test procedure is given to verify parameters in the model

Equivalence Testing the Easy Way

The purpose of the article is to demonstrate an equivalence testing software application written under SAS^1 Institute software designed for use by pharmaceutical and other medical research professionals. Besides making the entire equivalence testing procedure easier and more efficient, the application “EquivEasy” offers three main advantages over similar software: a) testing for 3 x 3 in addition to 2 x 2 crossover designs, b) familiar SAS user environment, and c) export flexibility (MS Word, PDF, HTML). Two case studies are presented with report results provided in tabular and graphical form

“BOF” Trees Diagram as a Visual Way to Improve Interpretability of Tree Ensembles

The motivation for this research stemmed from a desire to create visual aids to help researchers/managers interpret ensembles of decision tree outputs generated by various algorithms. The method employed a simulation experiment (using only bagging) followed by application of the new visualization tools on actual survey data. Simulated data, with a pre-specified structure, were "bagged" with the results presented using five graphical tools that recreated (and/or portrayed) the known data structures captured by the bagging algorithm. Then the same methodology was generalized to a structurally unknown, virgin (survey) data set. Results of the research are that five visual aids tools were examined (two of which are new approaches) and found to be useful for making action-oriented interpretations from e.g., web-survey data

Encoder/decoder system for a rapidly synchronizable binary code Patent

Design and development of encoder/decoder system to generate binary code which is function of outputs of plurality of bistable element

CARE 3 phase 2 report - mathematical description

CARE III (Computer-Aided Reliability Estimation, version three) a computer program designed to help estimate the reliability of complex, redundant systems is described. Although the program can model a wide variety of redundant structures, it was developed specifically for fault tolerant avionics systems. CARE III generalizes the class of system structures that can be modeled and greatly expands the coverage model to take into account such effects as intermittent and transient faults, latent faults, and error propagation

EF+EX Forest Algebras

We examine languages of unranked forests definable using the temporal operators EF and EX. We characterize the languages definable in this logic, and various fragments thereof, using the syntactic forest algebras introduced by Bojanczyk and Walukiewicz. Our algebraic characterizations yield efficient algorithms for deciding when a given language of forests is definable in this logic. The proofs are based on understanding the wreath product closures of a few small algebras, for which we introduce a general ideal theory for forest algebras. This combines ideas from the work of Bojanczyk and Walukiewicz for the analogous logics on binary trees and from early work of Stiffler on wreath product of finite semigroups

Chapter 1. Extension of the fundamental theorem of finite semigroups

AbstractThis paper proves that some useful commutivity relations exist among semigroup wreath product factors that are either groups or combinatorial “units” U1, U2, or U3. Using these results it then obtains some characterizations of each of the classes of semigroups buildable from U1's, U2's, and groups (“buildable” meaning “dividing a wreath product of”).We show that up to division U1's can be moved to the right and U2's, and groups to the left over other units and groups, if it is allowed that the factors involved be replaced by their direct products, or in the case of U2, even by a wreath product. From this it is deduced that U1's and U2's do not affect group complexity, that any semigroup buildable from U1's, U2's, and groups has group complexity 0 or 1, and that all such semigroups can be represented, up to division, in a canonical form—namely, as a wreath product with all U1's on the right, all U2's on the left, and a group in the middle. This last fact is handy for developing charactérizations.An embedding theorem for semigroups with a unique 0-minimal ideal is introduced, and from this and the commutivity results and some constructions proved for RLM semigroups, there is obtained an algebraic characterization for each class of semigroups that is a wreath product-division closure of some combination of U1's, U2's, and the groups. In addition it is shown, for i = 1,2,3, that if the unit Ui does not divide a semigroup S, then S can be built using only groups and units not containing Ui. Thus, it can be deduced that any semigroup which does not contain U3 must have group complexity either 0 or 1. This then establishes that indeed U3 is the determinant of group complexity, since it is already proved that both U1 and U2 are transparent with regard to the group complexity function, and it is known that with U3 (and groups) one can build semigroups with complexities arbitrarily large. Another conclusion is a combinatorial counterpart for the Krohn-Rhodes prime decomposition theorem, saying that any semigroups can be built from the set of units which divide it together with the set of those semigroups not having unit divisors. Further, one can now characterize those semigroups which commute over groups, showing a semigroup commutes to the left over groups iff it is “R1” (i.e., does not contain U1, i.e., is buildable form U2's and groups), and commutes to the right over groups iff it does not contain U2 (i.e., is buildable from groups and U1's). Finally, from the characterizations and their proofs one sees some ways in which groups can do the work of combinatorials in building combinatorial semigroups