Digital Commons Network^™

Integrated Computer Controlled Sensor Monitor, Tariq Hafeez Malik

Theses : Honours

This research has developed an Integrated Computer Controlled Sensor Monitor (ICCSM) environment, to monitor and analyse alarm events associated with sensors, including an interface between a PC and a number of detectors. Such an environment will help the security industry analyse the factors causing false alarms at particular locations. The ICCSM environment monitors, and records, alarm data. Knowing exactly which sensor has been activated, and its location, is of paramount importance to the effective deployment of response forces and making the identification of causes of spurious alarms easier. The lCCSM environment is a combination of software and general purpose hardware, …

Clock Partitioning For Testability, Kent L. Einspahr, Sharad C. Seth, Vishwani D. Agrawal

School of Computing: Conference and Workshop Papers

An implementation of a design for testability model for sequential circuits is presented. The flip-flops in a sequential circuit are partitioned to reduce the number of cycles and the path lengths in each partition, thereby reducing the complexity of test generation. The implementation includes a Podem-based test generator. Preliminary results using the Contest sequential test generator are presented.

A-Hohfeld: A Language For Robust Structural Representation Of Knowledge In The Legal Domain To Build Interpretation-Assistance Expert Systems, Layman E. Allen, Charles S. Saxon

Book Chapters

The A-Hohfeld language is presented as a set of definitions; it can be used to precisely express legal norms. The usefulness of the AHohfeld language is illustrated in articulating 2560 alternative structural interpretations of the four-sentence 1982 Library Regulations of Imperial College and constructing an interpretation-assistance legal expert system for these regulations by means of the general-purpose Interpretation-Assistance legal expert system builder called MINT. The logical basis for A-Hohfeld is included as an appendix.

Genetic Algorithms With 3-Parent Crossover, L. Vincent Edmondson

Doctoral Dissertations

"A new genetic algorithm which uses a 3-parent uniform crossover operator is developed and analyzed. Uniform crossover operators are shown to be based on the premise that all bit-level genetic information should be passed from parents to children. The 3-parent uniform crossover operator is shown to adhere to this premise. The 3-parent uniform crossover operator is shown to be better than the 2-parent uniform crossover operator on the De Jong test functions.

Two new genetic algorithms which use 3-parent traditional crossover operators are developed and analyzed. The first uses a strategy of randomly selecting 3 of the 6 children resulting …

So Far (Schematically) Yet So Near (Semantically), Amit P. Sheth, Vipul Kashyap

Kno.e.sis Publications

In a multidatabase system, schematic conflicts between two objects are usually of interest only when the objects have some semantic affinity. In this paper we try to reconcile the two perspectives. We first define the concept of semantic proximity and provide a semantic taxonomy. We then enumerate and classify the schematic and data conflicts. We discuss possible semantic similarities between two objects that have various types of schematic and data conflicts. Issues of uncertain information and inconsistent information are also addressed.

On Matching Ann Structure To Problem Domain Structure, George G. Lendaris, Martin Zwick, Karl Mathia

Complex Systems Faculty Publications and Presentations

To achieve reduced training time and improved generalization with artificial neural networks (ANN, or NN), it is important to use a reduced complexity NN structure. A "problem" is defined by constraints among the variables describing it. If knowledge about these constraints could be obtained a priori, this could be used to reduce the complexity of the ANN before training it. Systems theory literature contains methods for determining and representing structural aspects of constrained data (these methods are herein called GSM, general systems method). The suggestion here is to use the GSM model of the given data as a pattern for …

Nova University Graduate Education Module (Gem) Master's And Educational Specialist Degrees Computer Science Education 1993, Nova University

Abraham S. Fischler College of Education and School of Criminal Justice College Archive

No abstract provided.

Asymptotically Tight Bounds For Performing Bmmc Permutations On Parallel Disk Systems, Thomas H. Cormen, Leonard F. Wisniewski

Computer Science Technical Reports

No abstract provided.

Vector Layout In Virtual-Memory Systems For Data-Parallel Computing, Thomas H. Cormen

Computer Science Technical Reports

In a data-parallel computer with virtual memory, the way in which vectors are laid out on the disk system affects the performance of data-parallel operations. We present a general method of vector layout called banded layout, in which we divide a vector into bands of a number of consecutive vector elements laid out in column-major order, and we analyze the effect of the band size on the major classes of data-parallel operations. We find that although the best band size varies among the operations, choosing fairly small band sizes—at most a track—works well in general.

Videoscheme: A Programmable Video Editing System For Automation And Media Recognition, James Matthews, Peter Gloor, Fillia Makedon

Computer Science Technical Reports

The recent development of powerful, inexpensive hardware and software support had made digital video editing possible on personal computers and workstations. To date the video editing application category has been dominated by visual, easy-to-use, direct manipulation interfaces. These systems bring high-bandwidth human-computer interaction to a task formerly characterized by slow, inflexible, indirectly-operated machines. However, the direct manipulation computer interfaces are limited by their manual nature, and can not easily accommodate algorithmically- defined operations. This paper proposes a melding of the common direct manipulation interfaces with a programming language which we have enhanced to manipulate digital audio and video. The result …

Development Of A Hypermedia Database For The Elementary Classroom, Jane Pattison Brown

All Graduate Projects

A hypermedia database including selected flora and fauna in Kittitas County, Washington, was developed using HyperCard software for researching information about 400+ species. students had the opportunity to use the database in school libraries and in the author's fifth-grade classroom. The database cards accessed videodisc images where available. On the basis of limited study to date, it appears that when studying the environment, student learning was enhanced by the use of database material created by the author.

The Introduction Of A Catalog Automation And Manufacturing Costing System For Use In A Jewelry Manufacturing Company, Moshe S. Raab

CCAC Theses and Dissertations

The jewelry manufacturing industry is an example of an industry that is slow to accept and incorporate new technology. There are, however, some large companies that have automated the accounting and inventory functions. Some of these companies have even invested in systems that can do image storage and retrieval. Until recently, these computer systems have been very expensive to purchase.

Prestige Marketing, Ltd. is a small jewelry manufacturing company. The owner of Prestige recognized the advantage of utilizing inexpensive personal computers to develop a software system that would calculate the cost of manufacturing and determine the recommended selling price of …

Computer Program: General University Requirements Package, Abhishek Kejriwal '93

Honors Projects

The objective of my research project was to write a computer program in Turbo Pascal which would determine how many general university requirements a student has completed and what requirements he or she needs to complete in order to graduate. There are six degrees offered at Illinois Wesleyan University. They are: BA (Bachelor of Arts); BS (Bachelor of Science); BFA (Bachelor of Fine Arts); BSN (Bachelor of Science in Nursing); BM (Bachelor of Music) and BME (Bachelor of Music Education). There is a different set of criteria to be met for the completion of each of these degrees. The program …

Ensuring The Satisfaction Of A Temporal Specification At Run-Time, Grace Tsai, Matt Insall, Bruce M. Mcmillin

Computer Science Technical Reports

This paper presents an approach to operationally evaluate a temporal specification in a distributed computing environment. First, an algorithm Compute History is proposed to allow every distributed processor to collect events executed by itself and by other processors, and to order the collected events by causality. This algorithm employs neither monitors nor a global clock to order collected events of a processor. These collected events of a processor form an execution history of a distributed computation, and they represent behaviors of all the processors during execution. Next, the semantics of operational evaluation of a temporal assertion is presented. The evaluation …

Optimal Greedy Algorithms For Indifference Graphs, Peter J. Looges, Stephan Olariu

Computer Science Faculty Publications

A fundamental problem in social sciences and management is understanding and predicting decisions made by individuals, various groups, or the society as a whole. In this context, one important concept is the notion of indifference. We characterize the class of indifference graphs, that is, graphs which arise in the process of quantifying indifference relations. In particular, we show that these graphs are characterized by the existence of a special ordering of their vertices. As it turns out, this ordering leads naturally to optimal greedy algorithms for a number of computational problems, including coloring, finding a shortest path between two vertices, …

Observation Of B0 Decay To Two Charmless Mesons, M. Battle, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

We report results from a search for the decays B0→π+π-, B0→K+π-, and B0→K+K-. We find 90% confidence level upper limits on the branching fractions, Bππ

Tau Decays With One Charged Particle Plus Multiple Π0'S, M. Procario, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

With the CLEO-II detector at the Cornell Electron Storage Ring, we have measured branching fractions for tau lepton decay into one-prong final states with multiple π0’s B0hnπ, normalized to the branching fraction for tau decay into one charged particle and a single π0. We find B0h2π/B0hπ=0.345±0.006±0.016, B0h3π/B0hπ=0.041 ±0.003±0.005, and B0h4π/B0hπ=0.006±0.002±0.002.

Measurement Of Charmless Semileptonic Decays Of B Mesons, Bartelt; J.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

No abstract provided.

Observation Of The Charmed Baryon C+ And Measurement Of The Isospin Mass Splittings Of The C, Crawford, G.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

No abstract provided.

Evidence For Penguin-Diagram Decays: First Observation Of B→K*(892)Γ, R. Ammar, M. Thulasidas

Research Collection School Of Computing and Information Systems

We have observed the decays B0→K*(892)0γ and B−→K*(892)−γ, which are evidence for the quark-level process b→sγ. The average branching fraction is (4.5±1.5±0.9)×10−5. This value is consistent with standard model predictions from electromagnetic penguin diagrams.

Search For Τ-→Γμ-: A Test Of Lepton Number Conservation, A. Bean, M. Thulasidas

Research Collection School Of Computing and Information Systems

A search for the lepton mumber violating decay of the τ lepton to the γμ final state has been performed with the CLEO II detector at the Cornell e+e− storage ring CESR. In a data sample that corresponds to an integrated luminosity of 1.55 fb−1, we observe no candidates in the signal region. We thus determine an upper limit of B(τ−→γμ−)

Study Of D0 Decays Into K̄0 And K̄*0, M. Procario, M. Thulasidas

Research Collection School Of Computing and Information Systems

Using the CLEO II detector at CESR we have studied D0 decays into final states with a ¯K0 or ¯K*0, and have measured branching ratios for the decay modes D0→(¯K0¯K*0)π0, η, η′. These results are compared with predictions of various charm decay models, and contributions of final-state interactions are discussed.

Repository Evaluation Of Software Reuse: An Empirical Study, R. D. Banker, Robert J. Kauffman, D. Zweig

Research Collection School Of Computing and Information Systems

The use and benefits of repository evaluation of software reuse are illustrated through an analysis of the evolving repositories of two large firms that recently implemented integrated CASE development tools. The analysis shows that these tools have supported high levels of software reuse, but it also suggests that there remains considerable unexploited reuse potential. The findings indicate that organizational changes will be required before the full potential of the new technology can be realized.

Dna Mapping Algorithms: Synchronized Double Digest Mapping, Jim Daues, Will Gillett

All Computer Science and Engineering Research

A technique called Synchronized Double Digest Mapping (SDDM) is presented; it combines classical Double Digest Mapping (DDM) and Multiple-Restriction-Enzyme Mapping (MREM). Classical DDM is a technique for determining the order of restriction fragments in a clone given three digestions of the clone: a digestion by enzyme1, a digestion by enzyme2, and a digestion by enzyme1 and enzyme2 combined. All algorithms for applying this technique are exponential (in the number of fragments present in the clone) in nature. MREM is an extension of classical high-resolution restriction-fragment mapping of a YAC or a genome, in which the overlaps among a set of …

Rule-Maker's And Rule-Follower's Meaning, R. P. Loui

All Computer Science and Engineering Research

No abstract provided.

The Washington University Multimedia System, William D. Richard, Jerome R. Cox Jr., Brian Gottlieb, Ken Krieger

All Computer Science and Engineering Research

The Washington University Multimedia System (MMS) is a complete multimedia system capable of transmitting and receiving video, audio, and radiological images, in addition to normal network traffic, over the Washingon University broadband ATM network. The MMS consists of an ATMizer and three multimedia subsystems. The ATMizer implements the host interface, the interface to the ATM network, and the interface to the three multimedia subsystems. The video sybsystem encodes and decodes JPEG compressed video using two hardware compression engines. The audio subsystem encodes and decodes CD-quality stereo audio. The high-speed radiological image subsystem reformats radiological image data transmitted by a dedicated …

A Fault Tolerant Connectionist Architecture For Construction Of Logic Proofs, Gadi Pinkas

All Computer Science and Engineering Research

This chapter considers the problems of expressing logic and constructing proofs in fault tolerant connectionist networks that are based on energy minimalism. Given a first-order-logic knowledge base and a bound k, a symmetric network is constructed (like a Boltzman machine or a Hopfield network) that searches for a proof for a given query. If a resolution-based proof of length no longer than k exists, then the global minima of the energy function that is associated with the network represent such proofs. If no proof exist then the global minima indicate the lack of a proof. The network that is generated …

Effective Loss Of Multiplexed Atm Cell Streams, Seyyed M-R Mahdavian, Andreas D. Bovopoulos

All Computer Science and Engineering Research

Cell loss is an inherent problem of ATM networks. The magnitude of the service degeneration caused by cell loss depends on the application and loss distribution. This paper introduces a new performance criterion, called effective loss, which can quantitatively measure this degradation. Effective loss is particularly suitable for block-oriented transmissions, such as file transfer applications, but can also be applied to a broad range of other applications. In this paper the effective loss measure is applied to the study of the effectiveness of bandwidth reservation mechanisms in an ATM multiplexer. Numerical results demonstrate circumstances under which bandwidth reservation improves performance …

Representing And Learning Propositional Logic In Symmetric Connectionist Networks, Gadi Pinkas

All Computer Science and Engineering Research

The chapter presents methods for efficiently representing logic formulas in connectionist networks that perform energy minimization. Algorithms are given for transforming any formula into a network in linear time and space and for learning representations of unknown formulas by observing examples of satisfying truth assignments. The relaxation process that underlies networks of energy minimization reveals an efficient hill climbing algorithm for satisfiability problems. Experimental results indicate that the parallel implementation of the algorithm with give extremely good average-case performance, even for large-scale, hard satisfiability problems (randomly generated).

The Washington University Multimedia Explorer, William D. Richard, Jerome R. Cox Jr., A. Maynard Engebretson, Jason Fritts, Craig Horn

All Computer Science and Engineering Research

The Washington University MultiMedia eXplorer (MMX) is a complete, host-independent multimedia system capable of transmitting and receiving JPEG-compressed video, CD-quality audio, and high-resolution radiographic images over the Washington University broadband ATM network. If the host is equipped with an ATM interface card, normal network traffic is supported via "T" and "Y" connections. The MMX consists of an ATMizer and three multimedia subsystems. The ATMizer implements the host interface, the interface to the ATM network, and the interface to the three multimdeia channels. This paper describes the architecture of the MMX, the software used with the system, and the applications which …