Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons™

Open Access. Powered by Scholars. Published by Universities.®

Computer Engineering

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 12361 - 12390 of 12790

Full-Text Articles in Physical Sciences and Mathematics

Dynamic Flow Switching: A New Communication Service For Atm Networks, Qiyong Bian, Kohei Shimoto, Jonathan Turner Jan 1997

Dynamic Flow Switching: A New Communication Service For Atm Networks, Qiyong Bian, Kohei Shimoto, Jonathan Turner

All Computer Science and Engineering Research

This paper presents a new communication service for ATM networks that provides one-way, adjustable rate, on-demand communication channels. The proposed dynamic flow service is designed to operate within a multi-service cell switched network that supports both conventional switched virtual circuits and IP packet routing and is designed to complement those services. It is particularly well suited to applications that transmit substantial amounts of data (a few tens of kilobytes or more) in fairly short time periods (up to a few seconds). Much of the current world-wide web traffic falls within this domain. Like IP packet networks, the new service permits …

Go to article

Balancing Consistency And Lag In Transaction-Based Computational Steering, Eileen Kraemer, Delbert Hart, Gruia-Catalin Roman Jan 1997

Balancing Consistency And Lag In Transaction-Based Computational Steering, Eileen Kraemer, Delbert Hart, Gruia-Catalin Roman

All Computer Science and Engineering Research

Computational steering, the interactive adjustment of application parameters and allocation of resources, is a promising technique for higher-productivity simulation, finer-grained optimization of dynamically varying algorithms, and greater understanding of program behavior and the characteristics of data sets and solution spaces. Tools for computational steering must provide monitoring, visualization, and interaction facilities. In addition, these tools must address issues related to the consistency, latency, and scalability at each of these phases, and must consider the perturbation that results. In this paper we describe transaction-based components for a computational steering system and present an approach that guarantees consistent monitoring and displays, supports …

Go to article

Cappucino: An Extensible Planning Tool For Constraint-Based Atm Network Design, Inderjeet Singh, Jonathan S. Turner Jan 1997

Cappucino: An Extensible Planning Tool For Constraint-Based Atm Network Design, Inderjeet Singh, Jonathan S. Turner

All Computer Science and Engineering Research

Cappuccino is a planning tool for topological design of ATM networks. It uses a novel constraint-based approach to ATM network design. Extensibility of the tool is a basic design goal and the tool provides an open interface to incorporate new algorithms.

Go to article

The Programmers' Playground Application Management System User Guide, William M. Shapiro, T. Paul Mccartney, E.F. Berkley Shands Jan 1997

The Programmers' Playground Application Management System User Guide, William M. Shapiro, T. Paul Mccartney, E.F. Berkley Shands

All Computer Science and Engineering Research

Application Management permits the advertising, launching, and configuring of distributed applications created using the Programmers' Playground. Applications can be documented and made available to end-users through the use of application pages on the World Wide Web. The launching and configuring of applications is performed by a brokerage system consisting of an applicatoin broker and one or more hierarchies of module launchers. This document describes how to setup and use the components of the Application Management system.

Go to article

Design And Implementation Of A New Connection Admission Control Algorithm Using A Multistate Traffic Source Model, Robert Engel Jan 1997

Design And Implementation Of A New Connection Admission Control Algorithm Using A Multistate Traffic Source Model, Robert Engel

All Computer Science and Engineering Research

This report develops a practical method for connection admission control in ATM networks. The method is based on a virtual cell loss probability criterion, is designed to handle heterogeneous traffic types and allows each traffic source to be described by an individual finite-state model with as many states as are needed to describe the source traffic. To make connection admission decisions with respect to individual links, an aggregate finite state model is computed from the individual models and used to estimate the virtual cell loss probabilities. To reduce the computational requirements for maintaining the aggregate traffic model, the aggregate model …

Go to article

Principles For Developing And Measuring High-Performance Web Servers Over Atm, James C. Hu, Sumedh Mungee, Douglas C. Schmidt Jan 1997

Principles For Developing And Measuring High-Performance Web Servers Over Atm, James C. Hu, Sumedh Mungee, Douglas C. Schmidt

All Computer Science and Engineering Research

High-performance Web servers are essential to meet the growing demands of the Internet. Satisfying these demands requires a thorough understanding of the key factors that affect Web server performance. This paper provides three contributions to the design, implementation, and evaluation of high-performance Web servers. First, we report the results of a comprehensive empirical study of popular high-performance Web servers (such as Apache, Netscape Enterprise, PHTTPD, and Zeus) over high-speed ATM networks. This study illustrates their relative performance and identifies their performance bottlenecks. To measure performance accurately, we developed a new benchmarking technique that subjects Web servers to varying connection frequencies. …

Go to article

Optimizing The Performance Of The Corba Internet Inter-Orb Protocol Over Atm, Aniruddha Gokhale, Douglas C. Schmidt Jan 1997

Optimizing The Performance Of The Corba Internet Inter-Orb Protocol Over Atm, Aniruddha Gokhale, Douglas C. Schmidt

All Computer Science and Engineering Research

The Internet Inter-ORB Protocol (IIOP) enables heterogeneous CORBA-compliant Object Request Brokers (ORBs) to interoperate over TCP/IP networks. The IIOP uses the Common Data Representation (CDR) transfer syntax to map CORBA Interface Definition Langauge (IDL) data types into a bi-canonical wire format. Due to the excessive marshaling/demarshaling overhead, data copying, and high-levels of function call overhead, conventional implementation of IIOP protocols yield poor performance over high-speed networks. To meet the demands of emerging distributed multimedia applications, CORBA-compliant ORBs must support both interoperable and highly efficient IIOP implementations. This paper provides two contributions to the study and design of high performance CORBA …

Go to article

Using Snapshot Streams To Support Visual Exploration, Delbert Hart, Eileen Kraemer, Gruia-Catalin Roman Jan 1997

Using Snapshot Streams To Support Visual Exploration, Delbert Hart, Eileen Kraemer, Gruia-Catalin Roman

All Computer Science and Engineering Research

The non-determinism, complexity, and size of distributed software systems present significant difficulties for designers and maintainers. Visualization can help alleviate these difficulties through interactive exploratory tools that allow both novice and experienced users to investigate a distributed computation using a common tool set. Essential to the success of a visual exploration tool is the ability to provide accurate representations of global states. This paper is concerned with the use of snapshots in support of interactive visual exploration of distributed computations. The nature of the visualization process requires snapshots that (1) are consecutive, thus facilitating smooth animation of state changes, (2) …

Go to article

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 13, Number 1, January 1997, College Of Engineering And Computer Science, Wright State University Jan 1997

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 13, Number 1, January 1997, 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.

Go to article

Measurement Of The Spectral Functions Of Vector Current Hadronic Tau Decays, R. Barate, M. Thulasidas Jan 1997

Measurement Of The Spectral Functions Of Vector Current Hadronic Tau Decays, R. Barate, M. Thulasidas

Research Collection School Of Computing and Information Systems

A measurement of the spectral functions of non-strange τ vector current final states is presented, using 124 358 τ pairs recorded by the ALEPH detector at LEP during the years 1991 to 1994. The spectral functions of the dominant two- and four-pion τ decay channels are compared to published results of e + e - annihilation experiments via isospin rotation. A combined fit of the pion form factor from τ decays and e + e - data is performed using different parametrizations. The mass and the width of the ρ ±(770) and the ρ 0(770) are separately determined in order …

Go to article

A Study Of Τ Decays Involving Η And Ω Mesons, D. Buskulic, M. Thulasidas Jan 1997

A Study Of Τ Decays Involving Η And Ω Mesons, D. Buskulic, M. Thulasidas

Research Collection School Of Computing and Information Systems

The 132 pbt - 1 of data collected by ALEPH from 1991 to 1994 have been used to analyze η and ω production in τ decays. The following branching fractions have been measured: B(τ−→ντωh−)=(1.91±0.07±0.06)×10−2,B(τ−→ντωh−)=(1.91±0.07±0.06)×10−2, B(τ−→ντωh−π0)=(4.3±0.6±0.5)×10−3,B(τ−→ντωh−π0)=(4.3±0.6±0.5)×10−3, B(τ−→ντηK−)=(2.9+1.3−1.2±0.7)×10−4,B(τ−→ντηK−)=(2.9−1.2+1.3±0.7)×10−4, B(τ−→ντηh−π0)=(1.8±0.4±0.2)×10−3B(τ−→ντηh−π0)=(1.8±0.4±0.2)×10−3 and the 95% C.L. limit B(τ− → ντηπt -) t - 4 has been obtained. The ωπt- and ηπt -π0 rates and dynamics are found in agreement with the predictions made from e+e∼ - annihilation data with the help of isospin invariance (CVC).

Go to article

Physical Media Independence: System Support For Dynamically Available Network Interfaces, Jon Inouye, Jim Binkley, Jonathan Walpole Jan 1997

Physical Media Independence: System Support For Dynamically Available Network Interfaces, Jon Inouye, Jim Binkley, Jonathan Walpole

Computer Science Faculty Publications and Presentations

Advances in hardware technology has fueled the proliferation of dynamically configurable network interface cards. This empowers mobile laptop users to select the most appropriate interface for their current environment. Unfortunately, the majority of system software remains "customized" for a particular network configuration, and assumes many network characteristics remain invariant over the runtime of the software. Physical Media Independence (PMI) is the concept of making assumptions about a particular device explicit, detecting events which invalidate these assumptions, and recovering once events are detected. This paper presents a model supporting PMI. Based on device availablilty, the model identifies implicit device-related assumptions made …

Go to article

Lyceum: A Multi-Protocol Digital Library Gateway, Ming-Hokng Maa, Michael L. Nelson, Sandra L. Esler Jan 1997

Lyceum: A Multi-Protocol Digital Library Gateway, Ming-Hokng Maa, Michael L. Nelson, Sandra L. Esler

Computer Science Faculty Publications

Lyceum is a prototype scalable query gateway that provides a logically central interface to multi-protocol and physically distributed, digital libraries of scientific and technical information. Lyceum processes queries to multiple syntactically distinct search engines used by various distributed information servers from a single logically central interface without modification of the remote search engines. A working prototype (http://www.larc.nasa.gov/lyceum/) demonstrates the capabilities, potentials, and advantages of this type of meta-search engine by providing access to over 50 servers covering over 20 disciplines.

Go to article

Computer System For Simulating Physical Processes Using Multiple Integer State Vectors Us:5594671, Hudong Chen, Peter Churchill, Robert Iannucci, Kim Molvig, Gregory Papadopoulos, Stephen Remondi, Christopher Teixeira, Kenneth Traub Dec 1996

Computer System For Simulating Physical Processes Using Multiple Integer State Vectors Us:5594671, Hudong Chen, Peter Churchill, Robert Iannucci, Kim Molvig, Gregory Papadopoulos, Stephen Remondi, Christopher Teixeira, Kenneth Traub

Robert A Iannucci

No abstract provided.

Go to article

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 12, Number 10, December 1996, College Of Engineering And Computer Science, Wright State University Dec 1996

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 12, Number 10, December 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.

Go to article

A Specialization Toolkit To Increase The Diversity Of Operating Systems, Calton Pu, Andrew P. Black, Crispin Cowan, Jonathan Walpole, Charles Consel Dec 1996

A Specialization Toolkit To Increase The Diversity Of Operating Systems, Calton Pu, Andrew P. Black, Crispin Cowan, Jonathan Walpole, Charles Consel

Computer Science Faculty Publications and Presentations

Virus and worm attacks that exploit system implementation details can be countered with a diversified set of implementations. Furthermore, immune systems show that attacks from previously unknown organisms require effective dynamic response. In the Synthetix project, we have been developing a specialization toolkit to improve the performance of operating system kernels. The toolkit helps programmers generate and manage diverse specialized implementations of software modules. The Tempo-C specializer tool generates different versions for both compile-time and run-time specialization. We are now adapting the toolkit to improve operating system survivability against implementations attacks.

Go to article

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 12, Number 9, November 1996, College Of Engineering And Computer Science, Wright State University Nov 1996

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 12, Number 9, November 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.

Go to article

Multimedia Applications Require Adaptive Cpu Scheduling, Veronica Baiceanu, Crispin Cowan, Dylan Mcnamee, Calton Pu, Jonathan Walpole Nov 1996

Multimedia Applications Require Adaptive Cpu Scheduling, Veronica Baiceanu, Crispin Cowan, Dylan Mcnamee, Calton Pu, Jonathan Walpole

Computer Science Faculty Publications and Presentations

CPU scheduling and admission testing for multimedia applications have been extensively studied, and various solutions have been proposed using assorted simplifying assumptions. However, we believe that the complexity and dynamic behavior of multimedia applications and systems make static solutions hard to apply in real-world situations. We are analyzing the difficulties that arise when applying the rate-monotonic (RM) scheduling algorithm and the corresponding admission tests for CPU management, in the context of real multimedia applications running on real systems. RM requires statically predictable, periodic workloads, and while multimedia applications appear to be periodic, in practice they exhibit numerous variabilities in workload. …

Go to article

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 12, Number 8, October 1996, College Of Engineering And Computer Science, Wright State University Oct 1996

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 12, Number 8, October 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.

Go to article

An Empirical Comparison Of Networks And Routing Strategies For Parallel Computation, Ronald I. Greenberg, Lee Guan Oct 1996

An Empirical Comparison Of Networks And Routing Strategies For Parallel Computation, Ronald I. Greenberg, Lee Guan

Computer Science: Faculty Publications and Other Works

This paper compares message routing capabilities of important networks proposed for general-purpose parallel computing. All the networks have been proven to have some type of universality property, i.e., an ability to simulate other networks of comparable cost with modest slowdown, using appropriate cost and communication models. But in this paper we seek an empirical comparison of communication capability under typical direct use rather than an analysis of worst-case results for simulating message traffic of another network.

Go to article

Resource/Dataflow Graph Operating System Development, Sriram J. Coimbatore Oct 1996

Resource/Dataflow Graph Operating System Development, Sriram J. Coimbatore

Electrical & Computer Engineering Theses & Dissertations

Implementation of a new dataflow schedule model is the objective of this thesis. The dataflow model algorithm called the resource/dataflow graph model is implemented on a peer-to-peer communication network comprising of six personal computers. This dataflow model is implemented making use of an earlier dataflow model called ATAMM (Algorithm to Architecture Mapping Model) developed by ODU and National Aeronautics and Space Administration (NASA). Development issues include modification of the RDFG testbed operating system and a scheme to transfer data buffers using the ethernet channel from one processor to another processor. This, in turn, equips each sub-module of an application with …

Go to article

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 Sep 1996

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.

Go to article

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

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.

Go to article

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

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.

Go to article

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

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 …

Go to article

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

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*

Go to article

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

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 …

Go to article

Visual Speech Recognition Using Multiple Deformable Lip Models, Devi Chandramohan Jul 1996

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 …

Go to article

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 Jun 1996

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.

Go to article

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 May 1996

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.

Go to article

First Prev Next Last