Digital Commons Network^™

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 12, Number 7, September 1996, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

An eight page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

An Empirical Comparison Of Area-Universal And Other Parallel Computing Networks, Ronald I. Greenberg, Lee Guan

Computer Science: Faculty Publications and Other Works

This paper provides empirical comparison of the communication capabilities of two area-universal networks, the fat-tree and the fat-pyramid, to the popular mesh and hypercube networks for parallel computation. While area-universal networks have been proven capable of simulating, with modest slowdown, any computation of any other network of comparable area, prior work has generally left open the question of how area-universal networks compare to other networks in practice. Comparisons are performed using techniques of throughput and latency analysis that have previously been applied to k-ary n-cube networks and using various existing models to equate the hardware cost of the networks being …

Search For Charginos And Neutralinos With R-Parity Violation At √S = 130 And 136 Gev, Buskulic, D.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

Searches for charginos and neutralinos produced in e +e - collisions at centre-of-mass energies of 130 and 136 GeV have been performed under the assumptions that R-parity is not conserved, that the dominant R-parity violating coupling involves only leptonic fields, and that the lifetime of the lightest supersymmetric particle can be neglected. In the 5.7 pb -1 data sample collected by ALEPH, no candidate events were found. As a result, chargino and neutralino masses and couplings are constrained and the domains previously excluded at LEP1 are extended.

Mass Limit For The Standard Model Higgs Boson With The Full Lep I Aleph Data Sample, Buskulic, D.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

The reaction e+e− → HZ∗ is used to search for the standard model Higgs boson in the Hνν and the Hℓ+ℓ− channels. The data sample corresponds to about 4.5 million hadronic Z decays collected by the ALEPH experiment at LEP from 1989 to 1995 at centre-of-mass energies at and around the Z peak. Three candidate events are found in the Hμ+μ− channel, in agreement with the expected background from the electroweak process e+e− ℓ+ℓ−qq. This search results in a 95% C.L. lower limit on the Higgs boson mass of 63.9 GeV/c2.

Search For Cp Violation In The Decay Z → B B̄ G, Buskulic, D.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

About three million hadronic decays of the Z collected by ALEPH in the years 1991 to 1994 are used to search for anomalous CP violation beyond the Standard Model in the decay Z → bb̄g. The study is performed by analyzing angular correlations between the two quarks and the gluon in three-jet events and by measuring the differential two-jet rate. No signal of CP violation is found. For the combinations of anomalous CP violating couplings, ĥb = ĥAbgVh - ĥVbgAb and hb* = √ĥVb2 + ĥAb2, limits of | ĥb | b*

Concept Hierarchy Memory Model: A Neural Architecture For Conceptual Knowledge Representation, Learning, And Commonsense Reasoning, Ah-Hwee Tan, Hui-Shin Vivien Soon

Research Collection School Of Computing and Information Systems

This article introduces a neural network based cognitive architecture termed Concept Hierarchy Memory Model (CHMM) for conceptual knowledge representation and commonsense reasoning. CHMM is composed of two subnetworks: a Concept Formation Network (CFN), that acquires concepts based on their sensory representations; and a Concept Hierarchy Network (CHN), that encodes hierarchical relationships between concepts. Based on Adaptive Resonance Associative Map (ARAM), a supervised Adaptive Resonance Theory (ART) model, CHMM provides a systematic treatment for concept formation and organization of a concept hierarchy. Specifically, a concept can be learned by sampling activities across multiple sensory fields. By chunking relations between concepts as …

Visual Speech Recognition Using Multiple Deformable Lip Models, Devi Chandramohan

Electrical & Computer Engineering Theses & Dissertations

Motivated by the fact that human speech perception is a bimodal process (auditory and visual), several researchers have designed and implemented automatic speech recognition (ASR) systems consisting of both audio and visual subsystems, and shown improved performance relative to traditional purely auditory systems. Several visual speech reading approaches have used deformable templates to model the shape of a speaker's lips. Deformable templates are models of image objects, which can be deformed by adjusting a set of parameters to match the object in some optimal way, as defined by a cost function. Using a single deformable lip model has disadvantages such …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 12, Number 6, June 1996, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

A ten page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

Genetic Algorithms Vs. Simulated Annealing: A Comparison Of Approaches For Solving The Circuit Partitioning Problem, Theodore W. Manikas, James T. Cain

Computer Science and Engineering Research

An important stage in circuit design is placement, where components are assigned to physical locations on a chip. A popular contemporary approach for placement is the use of simulated annealing. While this approach has been shown to produce good placement solutions, recent work in genetic algorithms has produced promising results. The purpose of this study is to determine which approach will result in better placement solutions.

A simplified model of the placement problem, circuit partitioning, was tested on three circuits with both a genetic algorithm and a simulated annealing algorithm. When compared with simulated annealing, the genetic algorithm was found …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 12, Number 5, May 1996, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

An eight page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 12, Number 4, April 1996, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

A six page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

Speech Feature Computation For Visual Speech Articulation Training, Stefan Auberg

Electrical & Computer Engineering Theses & Dissertations

A new version of the Visual Speech Articulation Training Aid was implemented which provides real-time visual feedback for speech articulation training. This version was migrated to a Windows Multimedia PC from a previous version which used a Personal Computer (PC) system and additional specialized and expensive custom hardware. This new version will make the system more available to schools and private users. A new method was developed for computing spectral/temporal features which characterize the speech sounds. In addition to the typical frame-based spectral analysis parameters, the new method represents temporal changes of the spectrum with a small number of features. …

Scheduling Processors For Distributed, Critical, Real-Time Systems, Hari K. Narasimhamurthy

Electrical & Computer Engineering Theses & Dissertations

The development of a procedure to obtain cyclo-static schedules for distributed, critical real-time applications is presented in this thesis. The applications considered in this thesis are characterized by hard deadlines and periodic inputs. The applica­ tions are described by a data flow graph model which guarantees performance. Given the data flow graph representation, processors are scheduled to complete tasks as specified in the representation. The scheduling technique separates the scheduling of tasks in time and the assignment of processors to tasks. While different criteria exist for task scheduling, a schedule which minimizes latency and maximizes throughput is used in this …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 12, Number 3, March 1996, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

A ten page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 12, Number 2, February 1996, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

A fourteen page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 12, Number 1, January 1996, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

A twelve page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

Translation Of 'Profiles In Faith', Monish Ranjan Chatterjee

Electrical and Computer Engineering Faculty Publications

Sarat Chandra Chatterjee (1876-1938) may be considered one of the three most significant figures of the literary component of the Bengal Renaissance, the other two being Bankim Chandra Chatterjee (1838-1894) and Rabindranath Tagore (1861-1941). As much as Bankim Chandra is identified with the new age in the Bengali novel, and the development of serious vernacular journalism, and Rabindranath with modern/classical movements in Bengali poetry and music, along with novel ideas in methods of education and teaching, Sarat Chandra, as a novelist and storyteller, perfected the art of narration and critical analyses of a variety of contemporaneous social and political issues, …

Incorporating Matlab's Signal Processing Toolbox Into A Dsp Course At An Undergraduate E.E. Program, Sol Neeman Ph.D.

Engineering Studies Faculty Publications and Creative Works

This paper provides some suggestions for incorporating MATLAB's Signal Processing Toolbox into a DSP course. Often, in a DSP course, students have difficulties understanding abstract and non-intuitive concepts and seeing their relevance to the practical part of their curriculum. The tools offered by MATLAB's Signal Processing Toolbox, can help to make these concepts more tangible and provide a perspective for students. Some basic tools relevant to an undergraduate DSP course will be introduced, including examples of tool use and graphic results. The tools presented will be applied in the areas of synthesis and analysis of signals, FFT computation, impulse response …

Compile-Time Performance Prediction Of Hpf/Fortran 90d, Manish Parashar, Salim Hariri

Electrical Engineering and Computer Science - All Scholarship

In this paper we present an interpretive approach for accurate and cost-effective performance prediction in a high performance computing environment, and describe the design of a compile-time HPF/Fortran 90D performance prediction framework based on this approach. The performance prediction framework has been implemented as a part of the HPF/Fortran 90D application development environment that integrates it with a HPF/Fortran 90D compiler and a functional interpreter. The current implementation of the environment framework is targeted to the iPSC/860 hypercube multicomputer system. A set of benchmarking kernels and application codes have been used to validate the accuracy, utility, and usability of the …

Software Quality: Definitions And Strategic Issues, Ronan Fitzpatrick

Reports

This paper contains two sections relating to software quality issues. First, the various definitions of software quality are examined and an alternative suggested. It continues with a review of the quality model as defined by McCall, Richards and Walters in 1977 and mentions the later model of Boëhm published in 1978. Each of McCall's quality factors is reviewed and the extent to which they still apply in the late 1990s is commented on. The factors include, integrity, reliability, usability, accuracy, efficiency, maintainability, testability, flexibility,interface facility (interoperability), re-usability and transferability (portability). They are subdivided into external and internal quality factors. Interrelationships …

Mobile Unity: Reasoning And Specification In Mobile Computing, Gruia-Catalin Roman, Peter J. Mccann

All Computer Science and Engineering Research

Mobile computing represents a major point of departure from the traditional distributed computing paradigm. The potentially very large number of independent computing units, a decoupled computing style, frequent disconnections, continuous position changes, and the location-dependent nature of the behavior and communication patterns present designers with unprecedented challenges in the areas of modularity and dependability. So far, the literature on mobile computing is dominated by concerns having to do with the development of protocols and services. This paper complements this perspective by considering the nature of the underlying formal models that will enable us to specify and reason about such computations. …

On The Performance Of Early Packet Discard, Maurizio Casoni, Jonathan S. Turner

All Computer Science and Engineering Research

In a previous paper [3], one of the authors, gave a worst-case analysis for the Early Packet Discard (EPD) technique for maintaining packet integrity during overload in ATM switches. This analysis showed that to ensure 100% goodput during overload under worst-case conditions, requires a buffer with enough storage for one maximum length packet from every active virtual circuit. This paper refines that analysis, using assumptions that are closer to what we expect to see in practice and examines how EPD performs when the buffer is not large enough to achieve 100% goodput. We show that 100% goodput can be achieved …

Extending Atm Networks For Efficient Reliable Multicast, Jonathan S. Turner

All Computer Science and Engineering Research

One of the important features of ATM networks is their ability to support multicast communications. This facilitates the efficient distribution of multimedia information streams (such as audio and video) to large groups of receivers (potentially millions). Because ATM networks do not provide reliable delivery mechanisms, it is up to end systems to provide end-to-end reliability where it is needed. While this is straightforward for point-to-point virtual circuits, it is more difficult for one-to many and many-to-mamy virtual circuits. In this report, we propose some minimal extensions to the hardware of ATM switches that enables end systems to implement reliable multicast …

A Pilot Study Of Speech And Pen User Interface For Graphical Editing, Karl E. Schmidt

All Computer Science and Engineering Research

As computer size continues to decrease and new user interface technologies become more ubiquitous, the conventional keyboard and mouse input interfaces are becoming harder to design into newer machines and less practical for use in some applications. The pen is one input technology more suited for the upcoming generation of smaller computers using direct manipulation interfaces. However, a pen-only user interface relies on continuous gesture and handwriting tecognizers that are often slow, inaccurate, and error prone for command and text entry. Speech recognition is an input modality that can input commands quickly and potentially be a fast text entry mechanism, …

Vaudeville: A High Performance, Voice-Activated Teleconferencing Application, Jyoti K. Parwatikar, T. Paul Mccartney, John D. Dehart, Maynard Engebretson, Kenneth J. Goldman

All Computer Science and Engineering Research

We present a voice-activated, hands-off, ATM-based video conferencing application. The application, called Vaudeville, features high quality NTSC video, voice-activated audio transmission, audio bridging of two audio streams, and voice-activated video switching. It supports multiple simultaneous multi-party conferences using a scalable multicast mechanism. We describe how Vaudeville was built using a component-based distributed programming environment. We also describe the algorithms used to contorl the audio and video of the applciation. Audio and video are encoded in hardware using an ATM hardware multimedia interface.

Supporting Dis Applications Using Atm Multipoint Connection Caching, Anshul Kantawala, Guru Parulkar, John Dehart, Ted Marz

All Computer Science and Engineering Research

This report describes an ATM Multipoint Connection Caching strategy (AMCC) to control the explosive growth of traffic within the network and at an endpoint in a large Distributed Interactive Simulation (DIS) application such as a battlefield simulation. For very large DIS applications with 100,000 entities, the current method of broadcasting information among entities will no longer be feasible due to computational and network bandwidth limitations. Our scheme divides the simulation space into grids and each grid square or a set of grid squares forms a multicast group. Entities join the groups within their perception range and thus, they receive state …

Negotiation As A Resource Allocation Process, Fernando Tohme

All Computer Science and Engineering Research

The main economic-theoretic approcahes to the problem of resource allocation make little if any reference to negotiation processes. These processes are fundamentally linguistic, based on the exchange of messages among agents. Communication being so fundamental in the characterization of negotiation processes, the analysis of negotiation must emphasize on the structure of the language in which the negotiations take place. Computer science and particularly Artificial Intelligence have provided interesting insights about that linguistic structure. In the first part of this work we present a brief survey of the literature on resource allocation processes in which communication among agents plays a relevant …

New Results On Generalized Caching, Saied Hosseini-Khayat

All Computer Science and Engineering Research

We report a number of new results in generalized caching. This problem arises in modern computer networks in which data objects of various sizes are transmitted frequently. First it is shown that its optimal solution is NP-complete. Then we explore two methods of obtaining nearly optimal answers based on the dynamic programming algorithm that we provided in [5]. These methods enable a trade-off between optimality and speed. It is also shown that LFD (the longest forward distance algorithm which is the optimal policy in the classical case), is no longer optimal but is competitive. We also prove that LRU remains …

Alchourron's Defeasible Conditionals And Defeasible Reasoning, Fernando Tohme, Ronald P. Loui

All Computer Science and Engineering Research

No abstract provided.

Leap Forward Virtual Clock: An O(Loglogn) Fair Queuing Scheme With Guaranteed Delays And Throughput Fairness, Subhash Suri, George Varghese, Girish P. Chandranmenon

All Computer Science and Engineering Research

We describe an efficient fair queuing scheme, Leap Forward Virtual Clock, that provides end-to-end delay bounds almost identical to that of PGPS fair queuing, along with throughput fairness. Our scheme can be implemented with a worst-case time O(loglogN) per packet guaranteed delay and throughput fairness. As its name suggests, our scheme is based on Zhang's virtual clock. While the original virtual clock scheme does not achieve throughput fairness, we can modify it with a simple leap forward mechanism that keeps the server clock from lagging too far behind the packet tags. We prove that our scheme guarantees a fair share …