A branch-and-bound algorithm for optimal NOR networks (the algorithm description)

Bibliography: p. 29.

An algorithm for the minimization of two-level multiple-output networks.

Vita.

A geometrical model for the synthesis of interval covers,

"Supported by Contract AT(11-1)-2118 with the U.S. Atomic Energy Commission."

Synthesis of optimal double-rail logic networks using NOR-OR gates by integer programming.

"Supported in part by ... Grant no. NSF GJ-503."

Modeling of domain growth activity in polycrystalline ferrites.

"Supported in part by Contract No. U.S. AEC AT(11-1)-1018."

Program manual of programs for minimal covering problems : ILLOD-MINIC-B, ILLOD-MINIC-BP, ILLOD-MINIC-BS, ILLOD-MINIC-BA, ILLOD-MINIC-BG /

Includes bibliography references.

AQVAL/1 (AQ7) user's guide and program description /

Bibliography: p. 48-49.

Minimization of logic networks under a generalized cost function /

Includes bibliographical references.

A planar geometrical model for representing multidimensional discrete spaces and multiple-valued logic functions /

Bibliography: p. 37-38.

The minimal covering problem and automated design of two-level and/or optimal networks /

Vita.

Subgroups of the group G[subscript n] /

Originally presented as the author's thesis, University of Illinois at Urbana-Champaign.

ABC's of lasers and masers.

"cat no. BAB-1."

Aircraft automation tasks requiring switching control

A key feature in future aircraft operations will be automation of various aircraft processes, such as air traffic separation management and the management of forced landing events. Automated versions of these processes will often involve consideration of multiple modes of operations and hence require consideration of automated decision processes able to switch between various available modes of operations. This paper proposes a switching algorithm on the basis of max-min decision theory. This algorithm is particularly suitable in situations where each operational mode has access to different set of partial information. We apply our proposed algorithm to the air traffic separation management problem. A simulation study is presented that illustrates the performance of the proposed switching algorithm.

An improved genetic algorithm and graph theory based method for optimal sectionalizer switch placement in distribution networks with DG

In this paper a new graph-theory and improved genetic algorithm based practical method is employed to solve the optimal sectionalizer switch placement problem. The proposed method determines the best locations of sectionalizer switching devices in distribution networks considering the effects of presence of distributed generation (DG) in fitness functions and other optimization constraints, providing the maximum number of costumers to be supplied by distributed generation sources in islanded distribution systems after possible faults. The proposed method is simulated and tested on several distribution test systems in both cases of with DG and non DG situations. The results of the simulations validate the proposed method for switch placement of the distribution network in the presence of distributed generation.