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

Physical Sciences and Mathematics Commons™

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

Computer Sciences

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 55471 - 55500 of 58014

Full-Text Articles in Physical Sciences and Mathematics

Fourier Analysis Of Frequency Domain Discrete Event Simulation Experiments, Mousumi Mitra Hazra Jan 1993

Fourier Analysis Of Frequency Domain Discrete Event Simulation Experiments, Mousumi Mitra Hazra

Dissertations, Theses, and Masters Projects

Frequency Domain Experiments (FDEs) were first used in discrete-event simulation to perform system parameter sensitivity analysis for factor screening in stochastic system simulations. FDEs are based on the intuitive assertion that if one or more system parameters are oscillated at fixed frequencies throughout a simulation run, then oscillations at the same frequencies will be induced in the system's response. Spectral (Fourier) analysis of these induced oscillations is then used to characterize and analyze the system. Since their introduction 12 years ago, significant work has been done to extend the applicability of FDEs to regression analysis, simulation optimization and gradient estimation. …

Go to article

Flush Communication Channels: Effective Implementation And Verification, Tracy Kay Camp Jan 1993

Flush Communication Channels: Effective Implementation And Verification, Tracy Kay Camp

Dissertations, Theses, and Masters Projects

Flush communication channels, or F-channels, generalize more conventional asynchronous communication paradigms. A distributed system which uses an F-channel allows a programmer to define the delivery order of each message in relation to other messages transmitted on the channel. Unreliable datagrams and FIFO (first-in-first-out) communication channels have strictly defined delivery semantics. No restrictions are allowed on message delivery order with unreliable datagrams--message delivery is completely unordered. FIFO channels, on the other hand, insist messages are delivered in the order of their transmission. Flush channels can provide either of these delivery order semantics; in addition, F-channels allow the user to define the …

Go to article

An Integration Of Case-Based And Model-Based Reasoning And Its Application To Physical System Faults, Stamos T. Karamouzis Jan 1993

An Integration Of Case-Based And Model-Based Reasoning And Its Application To Physical System Faults, Stamos T. Karamouzis

Dissertations, Theses, and Masters Projects

Case-Based Reasoning (CBR) systems solve new problems by finding stored instances of problems similar to the current one, and by adapting previous solutions to fit the current problem, taking into consideration any differences between the current and previous situations. CBR has been proposed as a more robust and plausible model of expert reasoning than the better-known rule-based systems.;Current CBR systems have been used in planning, engineering design, and memory organization. There has been minimal work, however, in the area of reasoning about physical systems. This type of reasoning is a difficult task, and every attempt to automate the process must …

Go to article

End-To-End Analysis Of Hexagonal Vs Rectangular Sampling In Digital Imaging Systems, John Clifton Burton Ii Jan 1993

End-To-End Analysis Of Hexagonal Vs Rectangular Sampling In Digital Imaging Systems, John Clifton Burton Ii

Dissertations, Theses, and Masters Projects

The purpose of this study was to compare two common methods for image sampling in digital image processing: hexagonal sampling and rectangular sampling. The two methods differ primarily in the arrangement of the sample points on the image focal plane. In order to quantitatively compare the two sampling methods, a mathematical model of an idealized digital imaging system was used to develop a set of mean-squared-error fidelity loss metrics. The noiseless continuous/discrete/continuous end-to-end digital imaging system model consisted of four independent components: an input scene, an image formation point spread function, a sampling function, and a reconstruction function. The metrics …

Go to article

Temporal Model Of An Optically Pumped Co-Doped Solid State Laser, T. G. Wangler, J. J. Swetits, A. M. Buoncristiani Jan 1993

Temporal Model Of An Optically Pumped Co-Doped Solid State Laser, T. G. Wangler, J. J. Swetits, A. M. Buoncristiani

Mathematics & Statistics Faculty Publications

Currently, research is being conducted on the optical properties of materials associated with the development of solid-state lasers in the 2 micron region. In support of this effort, a mathematical model describing the energy transfer in a holmium laser sensitized with thulium is developed. In this paper, we establish some qualitative properties of the solution of the model, such as non-negativity, boundedness, and integrability. A local stability analysis is then performed from which conditions for asymptotic stability are obtained. Finally, we report on our numerical analysis of the system and how it compares with experimental results.

Go to article

Design And Implementation Of Fuzzy Logic Controllers. Thesis Final Report, 27 July 1992 - 1 January 1993, Osama A. Abihana, Oscar R. Gonzalez Jan 1993

Design And Implementation Of Fuzzy Logic Controllers. Thesis Final Report, 27 July 1992 - 1 January 1993, Osama A. Abihana, Oscar R. Gonzalez

Electrical & Computer Engineering Faculty Publications

The main objectives of our research are to present a self-contained overview of fuzzy sets and fuzzy logic, develop a methodology for control system design using fuzzy logic controllers, and to design and implement a fuzzy logic controller for a real system. We first present the fundamental concepts of fuzzy sets and fuzzy logic. Fuzzy sets and basic fuzzy operations are defined. In addition, for control systems, it is important to understand the concepts of linguistic values, term sets, fuzzy rule base, inference methods, and defuzzification methods. Second, we introduce a four-step fuzzy logic control system design procedure. The design …

Go to article

Digital Information In The Peel-Harvey Catchment Area, Dennis Van Gool Jan 1993

Digital Information In The Peel-Harvey Catchment Area, Dennis Van Gool

Agriculture reports

This paper presents a summary of the main features of the digital mapping data available in the Peel-Harvey Catchment area. This type of information is essential for Geographic Information System (GIS) users to assess projects involving the use of digital data such as plotting of mapped themes, topological overlays, area calculations and reporting.

Go to article

Integrated Computer Controlled Sensor Monitor, Tariq Hafeez Malik Jan 1993

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, …

Go to article

Development Of A Classification System For Computer Viruses In The Ibm Pc Environment Using The Dos Operating System, Hugh R. Browne Jan 1993

Development Of A Classification System For Computer Viruses In The Ibm Pc Environment Using The Dos Operating System, Hugh R. Browne

Theses : Honours

The threat to computers worldwide from computer viruses is increasing as new viruses and variants proliferate. Availability of virus construction tools to facilitate 'customised' virus production and wider use of more sophisticated means of evading detection, such as encryption, polymorphic transformation and memory resident 'stealth' techniques increase this problem. Some viruses employ methods to guard against their own eradication from an infected computer, whilst other viruses adopt measures to prevent disassembly of the virus for examination and analysis. Growth in computer numbers and connectivity provide a growing pool of candidate hosts for infection. Standardised and flexible systems for classification and …

Go to article

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

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.

Go to article

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

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 …

Go to article

Clinical Decision-Support Systems In Radiation Therapy, Nilesh L. Jain, Michael G. Kahn Jan 1993

Clinical Decision-Support Systems In Radiation Therapy, Nilesh L. Jain, Michael G. Kahn

All Computer Science and Engineering Research

Computers have been used in radiation therapy since the early 1960s to perform dose calculations. In the last decade, researchers have developed computer-based clinical decision-support systems for assisting in different decision-making tasks in radiation therapy. This paper reviews eleven prototype systems developed for target volume delineation, treatment planning, treatment plan evaluation, and treatment machine diagnosis. The advent of three-dimensional (3D) conformal radiation therapy (CRT) provides radiation oncologists with the opportunity to consider innovative beam arrangements which were not possible in two-dimensional class solutions. The difficulty of manually generating the thousands of clinically plausible 3D treatment plans calls for the use …

Go to article

The N-Body Problem: Distributed System Load Balancing And Performance Evaluation, Vasudha Govindan, Mark A. Franklin Jan 1993

The N-Body Problem: Distributed System Load Balancing And Performance Evaluation, Vasudha Govindan, Mark A. Franklin

All Computer Science and Engineering Research

In this paper, the N-body simulation problem is considered, its parallel implementation described, its execution time performance is modeled and compared with measured results, and two alternative load balancing algorithms for enhancing performance investigated. Parallel N-body techniques are widely applied in various fields and possess characteristics that challenge the computation and communication capabilities of parallel computing systems and are therefore good candidates for use as parallel benchmarks. Performance models may be used to estimate the performance of an algorithm on a given system, identify performance bottlenecks and study the performance implications of several algorithm are system enhancements. In this paper, …

Go to article

Supervised Competitive Learning With Backpropagation Network And Fuzzy Logic, Takayuki Dan Kimura, Thomas H. Fuller Jr., Ce Wang Jan 1993

Supervised Competitive Learning With Backpropagation Network And Fuzzy Logic, Takayuki Dan Kimura, Thomas H. Fuller Jr., Ce Wang

All Computer Science and Engineering Research

SCL assembles a set of learning modules into a supervised learning system to address the stability-plasticity dilemma. Each learning module acts as a similarity detector for a prototype, and includes prototype resetting (akin to that of ART) to respond to new prototypes. Here (Part I) we report SCL results using back-propagation networks as the learning modules. We used two feature extractors: about 30 energy-based features, and a combination of energy-based and graphical features (about 60). ACL recognized 96% (energy) and 99% (energy/graphical) of test digits, and 91% (energy) and 96% (energy/graphical) of test letters. In the accompanying paper (Part II), …

Go to article

Dynamic Reconfiguration With I/O Abstraction, Bala Swaminathan, Kenneth J. Goldman Jan 1993

Dynamic Reconfiguration With I/O Abstraction, Bala Swaminathan, Kenneth J. Goldman

All Computer Science and Engineering Research

Dynamic reconfiguration is explored in the context of I/O abstraction, a new programming model that defines the communication structure of a system in terms of connections among well-defined data interfaces for the modules in the system. The properties of I/O abstraction, particularly the clear separation of computation from communication and the availability of a module's state information, help simplify the reconfiguration strategy. Both logical and physical reconfiguration are discussed, with an emphasis on a new module migration mechanism that (1) takes advantage of the underlying I/O abstraction model, (2) avoids the expense and complication of state extraction techniques, (3) minimizes …

Go to article

Efficiently Computing {Phi}-Nodes On-The-Fly, Ron K. Cytron, Jeanne Ferrante Jan 1993

Efficiently Computing {Phi}-Nodes On-The-Fly, Ron K. Cytron, Jeanne Ferrante

All Computer Science and Engineering Research

Recently, Static Single Assignment Form and Sparse Evaluation Graphs have been advanced for the efficient solution of program optimization problems. Each method is provided with an initial set of flow graph nodes that inherently affect a problem's solution. Other relevant nodes are those where potentially disparate solutions must combine. Previously, these so-called {phi}-nodes were found by computing the iterated dominance frontiers of the initial set of nodes, a process that could take worst case quadratic time with respect to the input flow graph. In this paper we present an almost-linear algorithm for detemining exactly the same set of {phi}-nodes.

Go to article

Human And Machine Cognition Workshop Papers 1989, 1991, 1993, R. P. Loui Jan 1993

Human And Machine Cognition Workshop Papers 1989, 1991, 1993, R. P. Loui

All Computer Science and Engineering Research

No abstract provided.

Go to article

A Design For Reasoning With Policies, Prrecedents And Rationales, Ronald P. Loui, Jeff Norman, Jon Olson, Andrew Merrill Jan 1993

A Design For Reasoning With Policies, Prrecedents And Rationales, Ronald P. Loui, Jeff Norman, Jon Olson, Andrew Merrill

All Computer Science and Engineering Research

No abstract provided.

Go to article

An Optimal Nonblocking Multicast Virtual Circuit Switch, Jonathan S. Turner Jan 1993

An Optimal Nonblocking Multicast Virtual Circuit Switch, Jonathan S. Turner

All Computer Science and Engineering Research

This paper describes an architecture for a multicast virtual circuit switch using cell recycling. This is the first nonblocking switch architecture that is optimal in both the switching network complexity and the amount of memory required for multicast address translation. Furthermore, it is optimal in the amount of effort required for multicast connection modification. This architecture makes it both technically and economically feasible to construct the large switching systems that will ultimately be needed for wide scale deployment of Broadband ISDN to residential users. In particular, we estimate that systems with tens of thousands of 620 Mb/s ports can be …

Go to article

Real-Time Admission Control Algorithms With Delay And Loss Guarantees In Atm Networks, Apostolos Dailianas, Andreas D. Bovopoulos Jan 1993

Real-Time Admission Control Algorithms With Delay And Loss Guarantees In Atm Networks, Apostolos Dailianas, Andreas D. Bovopoulos

All Computer Science and Engineering Research

A multimedia ATM network is shared by media streams with different performance requirements. For media streams such as file transfers, the preservation of bursts and the provision of guarantees for loss probability at the burst level is of primary importance, while, for media streams such as voice, loss guarantees at the cell level are sufficient. Continuous media have stringent delay jitter requirements. Finally, some applications require loss-free transmission. In this paper, the first complete traffic management scheme for multimedia ATM networks is introduced. The traffic management scheme supports four different classes of traffic, each of which has different performance requirements …

Go to article

Clocked And Asynchronous Instruction Pipelines, Mark A. Franklin, Tienyo Pan Jan 1993

Clocked And Asynchronous Instruction Pipelines, Mark A. Franklin, Tienyo Pan

All Computer Science and Engineering Research

Clocked (synchronous) and self-timed (asynchronous) represent the two prinicipal methodologies associated with timing control and synchronization of digital systems. In this paper, clocked and the asynchronous instruction pipelines are modeled and compared. The approach which yields the best performance is dependent on technology parameters, operating range and pipeline algorithm characteristics. Design curves are presented which permit selection of the best approach for a given application and technology environment.

Go to article

The Dim System: Woz Simulation Results - Phase Ii, Anne Johnstone, Umesh Berry, Tina Nguyen Jan 1993

The Dim System: Woz Simulation Results - Phase Ii, Anne Johnstone, Umesh Berry, Tina Nguyen

All Computer Science and Engineering Research

We report an experiment designed to compare human-human spoken dialogues with human-computer spoken dialogue. Our primary purpose was to collect data on the kinds of protocols that were used to control the interaction. Three groups of 12 subjects each were asked to complete tasks over the phone. These tasks involved the use of custom-calling features such as call-forwarding and speed-dialing. The experimental procedure was a new variation on the Wizard of Oz (WOZ) technique that allowed much clearer comparisons to be made between human-human and human-computer interactions. Subjects in the Operator Group were told they were talking to a human …

Go to article

A Unified Model For Shared-Memory And Message-Passing Systems, Kenneth Goldman, Katherine Yelick Jan 1993

A Unified Model For Shared-Memory And Message-Passing Systems, Kenneth Goldman, Katherine Yelick

All Computer Science and Engineering Research

A unified model of distributed systems that accomodates both shared-memory and message-passing communication is proposed. An extension of the I/O automaton model of Lynch and Tuttle, the model provides a full range of types of atomic accesses to shared memory, from basic reads and writes to read-modify-write. In addition to supporting the specification and verification of shared memory algorithms, the unified model is particularly helpful for proving correspondences between atomic shared objects and invocation-response systems and for proving the correctness of systems that contain both message passing and shared memory (such as a network of shared-memory multiprocessors or a distributed …

Go to article

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

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 …

Go to article

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

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 …

Go to article

The Dynamics Of Growth-Factor-Modified Immune-Response To Cancer Growth: One-Dimensional Models, J. A. Adam Jan 1993

The Dynamics Of Growth-Factor-Modified Immune-Response To Cancer Growth: One-Dimensional Models, J. A. Adam

Mathematics & Statistics Faculty Publications

By characterizing the effect of tumor growth factors as deviations from normal logistic-type growth rates, the spatio-temporal dynamics for a one-dimensional model of cancer growth incorporating immune response are studied. The growth rates considered are classified respectively as normal, activated, inhibited and delay activated. The homogeneous steady states are defined by relative extrema of a ''free energy'' function V(x) for each of the above four cases. This function is of particular importance in studying the coexistence of tumoral and cancer-free steady states, and in identifying the nature (progressive or regressive) of travelling wave solutions to the nonlinear partial differential equation …

Go to article

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 Jan 1993

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.

Go to article

Practical Prefetching Techniques For Multiprocessor File Systems, David Kotz, Carla Schlatter Ellis Jan 1993

Practical Prefetching Techniques For Multiprocessor File Systems, David Kotz, Carla Schlatter Ellis

Dartmouth Scholarship

Improvements in the processing speed of multiprocessors are outpacing improvements in the speed of disk hardware. Parallel disk I/O subsystems have been proposed as one way to close the gap between processor and disk speeds. In a previous paper we showed that prefetching and caching have the potential to deliver the performance benefits of parallel file systems to parallel applications. In this paper we describe experiments with practical prefetching policies that base decisions only on on-line reference history, and that can be implemented efficiently. We also test the ability of these policies across a range of architectural parameters.

Go to article

Multiprocessor File System Interfaces, David Kotz Jan 1993

Multiprocessor File System Interfaces, David Kotz

Dartmouth Scholarship

Increasingly, file systems for multiprocessors are designed with parallel access to multiple disks, to keep I/O from becoming a serious bottleneck for parallel applications. Although file system software can transparently provide high-performance access to parallel disks, a new file system interface is needed to facilitate parallel access to a file from a parallel application. We describe the difficulties faced when using the conventional (Unix-like) interface in parallel applications, and then outline ways to extend the conventional interface to provide convenient access to the file for parallel programs, while retaining the traditional interface for programs that have no need for explicitly …

Go to article

Pseudobases In Direct Powers Of An Algebra, Paul Bankston Jan 1993

Pseudobases In Direct Powers Of An Algebra, Paul Bankston

Mathematics, Statistics and Computer Science Faculty Research and Publications

A subset P of an abstract algebra A is a pseudobasis if every function from P into A extends uniquely to an endomorphism on A. A is called K-free has a pseudobasis of cardinality K; A is minimally free if A has a pseudobasis. (The 0-free algebras are "rigid" in the strong sense; the 1-free groups are always abelian, and are precisely the additive groups of E-rings.) Our interest here is in the existence of pseudobases in direct powers AI of an algebra A. On the positive side, if A is a rigid …

Go to article

First Prev Next Last