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

Digital Commons Network™

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

Computer Sciences

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 26041 - 26070 of 27694

Full-Text Articles in Entire DC Network

The Effect Of Repeatedly Sampling An Embedded Metamodel On The Simulation Response, John Kent Patterson Mar 1995

The Effect Of Repeatedly Sampling An Embedded Metamodel On The Simulation Response, John Kent Patterson

Theses and Dissertations

This study investigated the effect on simulation output of repeatedly sampling an embedded metamodel. A metamodel is said to be embedded within a simulation if it is used to replace a submodule of that simulation. Replacing a deterministic module with an embedded deterministic metamodel poses no apparent mathematical problems. However, using a deterministic metamodel to replace a stochastic simulation component could require additional corrective actions. This research was performed in two phases. The first phase dealt with a set of tandem queues. It was shown that as each queue was sequentially replaced with a metamodel, the total system variance was …


Nonlinear Time Series Analysis, James A. Stewart Mar 1995

Nonlinear Time Series Analysis, James A. Stewart

Theses and Dissertations

This thesis applies neural network feature selection techniques to multivariate time series data to improve prediction of a target time series. Two approaches to feature selection are used. First, a subset enumeration method is used to determine which financial indicators are most useful for aiding in prediction of the S&P 500 futures daily price. The candidate indicators evaluated include RSI, Stochastics and several moving averages. Results indicate that the Stochastics and RSI indicators result in better prediction results than the moving averages. The second approach to feature selection is calculation of individual saliency metrics. A new decision boundary-based individual saliency …


To Learn Or Not To Learn ...., Anupam Joshi Mar 1995

To Learn Or Not To Learn ...., Anupam Joshi

Department of Computer Science Technical Reports

No abstract provided.


Display - A Visualization And User Interaction Interface For Parallel Simulation Environments, Edward Mascarenhas, Vernon J. Rego Mar 1995

Display - A Visualization And User Interaction Interface For Parallel Simulation Environments, Edward Mascarenhas, Vernon J. Rego

Department of Computer Science Technical Reports

No abstract provided.


Defending A Computer System Using Autonomous Agents, Mark Crosbie, Eugene H. Spafford Mar 1995

Defending A Computer System Using Autonomous Agents, Mark Crosbie, Eugene H. Spafford

Department of Computer Science Technical Reports

No abstract provided.


Implementing Signatures For C++, Gerald Baumgartner, Vincent R. Russo Mar 1995

Implementing Signatures For C++, Gerald Baumgartner, Vincent R. Russo

Department of Computer Science Technical Reports

No abstract provided.


Classical Ip And Arp Over Atm, Christoph L. Schuba, Berry Kercheval, Eugene H. Spafford Mar 1995

Classical Ip And Arp Over Atm, Christoph L. Schuba, Berry Kercheval, Eugene H. Spafford

Department of Computer Science Technical Reports

No abstract provided.


An Efficient And Reliable Reservation Algorithm For Mobile Transactions, Ahmed K. Elmagarmid, Jin Jing, Omran Bukhres Mar 1995

An Efficient And Reliable Reservation Algorithm For Mobile Transactions, Ahmed K. Elmagarmid, Jin Jing, Omran Bukhres

Department of Computer Science Technical Reports

No abstract provided.


Study Of The Subjet Structure Of Quark And Gluon Jets, D. Buskulic, D., M. Thulasidas Mar 1995

Study Of The Subjet Structure Of Quark And Gluon Jets, D. Buskulic, D., M. Thulasidas

Research Collection School Of Computing and Information Systems

Measurements of the subjet structure of quark and gluon jets in hadronic Z decays are presented. The analysis is based on one million hadronic events recorded by the Aleph detector. Roughly symmetric three-jet events are selected with a coarse jet-resolution cut-off, y1. Gluon jets are identified with a purity of 94.6% in those events where evidence of long-lived heavy-flavour hadrons in the other two jets is found. The jets are then analyzed using a smaller cut-off y0 (< y1) so that subjets are resolved. The properties of the jets (subjet multiplicities (Nq), (Ng) and rates Rng(q) for n = 1, 2, 3, 4) are determined and are found to be in good agreement with the expectations of perturbative QCD as long as the subjet resolution parameter y0 is sufficiently large to keep non-perturbative effects small. In particular, the ratio , which to leading order in QCD is given by the ratio of colour factors , is measured to be 1.96 ± 0.15 for y0 = 2 · 10−3, but falls to 1.29 ± 0.03 for y0 = 1.6 · 10−5.


Michel Parameters And Τ Neutrino Helicity From Decay Correlations In Z → Τ+Τ-, D. Buskulic, Manoj Thulasidas Mar 1995

Michel Parameters And Τ Neutrino Helicity From Decay Correlations In Z → Τ+Τ-, D. Buskulic, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

No abstract provided.


1.3, Yolanda Jones Feb 1995

1.3, Yolanda Jones

E-lert

No abstract provided.


Weighted Coverings And Packings, G. D. Cohen, Iiro Honkala, S. N. Litsyn, H. F. Mattson Jr Feb 1995

Weighted Coverings And Packings, G. D. Cohen, Iiro Honkala, S. N. Litsyn, H. F. Mattson Jr

Electrical Engineering and Computer Science - Technical Reports

In this paper we introduce a generalization of the concepts of coverings and packings in Hamming space called weighted coverings and packings. This allows us to formulate a number of well-known coding theoretical problems in a uniform manner. We study the existence of perfect weighted codes, discuss connections between weighted coverings and packings, and present many constructions for them.


Dynamics Of Order-Parameter-Conserving Ising Models At T > Tc, J.C. Lee Feb 1995

Dynamics Of Order-Parameter-Conserving Ising Models At T > Tc, J.C. Lee

Faculty Publications

http://journals.aps.org/prb/pdf/10.1103/PhysRevB.51.2661


Active Defense Of A Computer System Using Autonomous Agents, Mark Crosbie, Eugene H. Spafford Feb 1995

Active Defense Of A Computer System Using Autonomous Agents, Mark Crosbie, Eugene H. Spafford

Department of Computer Science Technical Reports

No abstract provided.


Adapting Distributed Database Systems For High Availability, Xiangning Liu, Evaggelia Pitoura, Bharat Bhargava Feb 1995

Adapting Distributed Database Systems For High Availability, Xiangning Liu, Evaggelia Pitoura, Bharat Bhargava

Department of Computer Science Technical Reports

No abstract provided.


Concurrent And Fail-Safe Replicated Simulations On Heterogeneous Networks: An Introduction To Eclipse, Felipe Knop, Edward Mascarenhas, Vernon J. Rego, V. S. Sunderam Feb 1995

Concurrent And Fail-Safe Replicated Simulations On Heterogeneous Networks: An Introduction To Eclipse, Felipe Knop, Edward Mascarenhas, Vernon J. Rego, V. S. Sunderam

Department of Computer Science Technical Reports

No abstract provided.


Consistent And Recoverable Agent-Based Access To Heterogeneous Mobile Databases, Evaggelia Pitoura, Bharat Bhargava Feb 1995

Consistent And Recoverable Agent-Based Access To Heterogeneous Mobile Databases, Evaggelia Pitoura, Bharat Bhargava

Department of Computer Science Technical Reports

No abstract provided.


A Type I Hybrid Arq System With Adaptive Code Rates, Robert H. Deng, Michael L. Lin Feb 1995

A Type I Hybrid Arq System With Adaptive Code Rates, Robert H. Deng, Michael L. Lin

Research Collection School Of Computing and Information Systems

Type I hybrid ARQ systems use an error-control code of fixed rate for error-correction in each transmitted packet. In such systems, the code rate must be carefully chosen to match the channel bit error rate (BER) in order to maximize system throughput. Whenever there is a mismatch between code rate and channel BER, the throughput suffers. In this paper, we proposed a type I hybrid ARQ system which automatically adjusts its code rates to match channel BERs. The proposed system is very simple to implement and yet performs significantly better than type I hybrid ARQ systems of fixed code rate


A Study Of D*+ Π- Production In Semileptonic B Decay, D. Buskulic, M. Thulasidas Feb 1995

A Study Of D*+ Π- Production In Semileptonic B Decay, D. Buskulic, M. Thulasidas

Research Collection School Of Computing and Information Systems

In a sample of 1.5 million hadronic decays of the Z collected by the ALEPH detector, a search is carried out for the decays B→ D10(2420)l−νX and B→ D2∗0(2460)l−νX. The product branching ratio for D10 production is measured to be Br(b →B) × Br(B→ D10l−νX) × Br(D10→ D∗+π−) = (2.04 ± 0.58stat± 0.34syst) × 10−3, and a 95% confidence level limit of Br(b →B) × Br(B→ D2∗0l−νX) × Br(D2∗0→ D∗+π−) ≤ 0.81 × 10−3 is obtained for D2∗0 production.A topological search sensitive to the processes above, but also to wide resonances that decay to D∗+π− and to non-resonant D∗+π− production …


Off-Line Hand-Printed Chinese Character Recognition Based On Stroke Matching, Sunshine Chang Jan 1995

Off-Line Hand-Printed Chinese Character Recognition Based On Stroke Matching, Sunshine Chang

Theses

The specific purpose of this thesis is the automated recognition of the off-line Chinese hand-printed characters by using a blue ball-point pen. Through mask processing, the main components in a Chinese character such as vertical, horizontal, and slant strokes can be extracted. Then, the connected components with the coordinates of the top, bottom, leftmost, and rightmost ends of each stroke extracted are found. From these coordinates, the length and position of each stroke can be computed.

According to the number, relative length, and relative position of each stroke, both of the coarse and fine rule-based classification can be made, and …


Requirements, Design And Business Process Reengineering As Vital Parts Of Any System Development Methodology, Alicja Ruszala Jan 1995

Requirements, Design And Business Process Reengineering As Vital Parts Of Any System Development Methodology, Alicja Ruszala

Theses

This thesis analyzes different aspects of system development life cycle, concentrating on the requirements and design stages. It describes various methodologies, methods and tools that have been developed over the years. It evaluates them and compares them against each other. Finally a conclusion is made that there is a very important stage missing in the system development life cycle, which is the Business Process Reengineering Stage.


1.2, Yolanda Jones Jan 1995

1.2, Yolanda Jones

E-lert

No abstract provided.


Parallel Algorithm Derivation And Program Transformation In A Preprocessing Compiler For Scientific Languages: The Psi Project And Hpf, L. R. Mullin, Thom Mcmahon Jan 1995

Parallel Algorithm Derivation And Program Transformation In A Preprocessing Compiler For Scientific Languages: The Psi Project And Hpf, L. R. Mullin, Thom Mcmahon

Computer Science Technical Reports

Scientific Programming and subsequent compilation is significantly complicated when programs are expected to perform on one or many processors for any size or dimensional problem. Scientific languages, although sophisticated and powerful, have been slow to evolve from their Von Neumann scalar by scalar operations to monolithic data parallel functions, e.g. Fortran 90/95. The structure of an array and corresponding architectural topology to which the arrays are mapped, may provide ways to increase portability and scalability of designs. This paper presents how the Psi(w) Calculus in conjunction with a useful algebra that provides convolutions, permutations, and scalar operations, is being used …


On Programming Scientific Applications In A Functional Language Extended By A \L' - Calculus Subsystem For Array Operations, L. R. Mullin, Werner Kluge Jan 1995

On Programming Scientific Applications In A Functional Language Extended By A \L' - Calculus Subsystem For Array Operations, L. R. Mullin, Werner Kluge

Computer Science Technical Reports

This paper discusses some of the pros and cons of extending functional languages by high-level array operations similar to those that are available in APL. This extension is based on the lp~calculus, an algebra of arrays which provides a small set of essential array operations defined in terms of dimensionalities, shapes and indexing functions. Since these operations specify context-free substitutions of array expressions by others, the lpcalculus fits perfectly into a functional programming paradigm.

In order to demonstrate the programming techniques made possible by the lp-calculus, we study a functional program for the approximation of numerical solutions of partial differential …


Kripke Logical Relations And Pcf, Peter W. O'Hearn, John G. Riecke Jan 1995

Kripke Logical Relations And Pcf, Peter W. O'Hearn, John G. Riecke

College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects

Sieber has described a model of PCF consisting of continuous functions that are invariant under certain (finitary) logical relations, and shown that it is fully abstract for closed terms of up to third-order types. We show that one may achieve full abstraction at all types using a form of "Kripke logical relations" introduced by Jung and Tiuryn to characterize λ definability.


Objects, Interference, And The Yoneda Embedding, Peter W. O'Hearn, Uday S. Reddy Jan 1995

Objects, Interference, And The Yoneda Embedding, Peter W. O'Hearn, Uday S. Reddy

College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects

We present a new semantics for Algol-like languages that combines methods from two prior lines of development: [1] the object-based approach of [28,29], where the meaning of an imperative program is described in terms of sequences of observable actions, and [2] the functor-category approach initiated by Reynolds [31], where the varying nature of the run-time stack is explained using functors from a category of store shapes to a category of cpos. The semantics gives an account of both the phenomena of local state and irreversibility of state change. As an indication of the accuracy obtained, we present a full abstraction …


Syntactic Control Of Interference Revisited, Peter W. O'Hearn, A. J. Power, M. Takeyama, R. D. Tennent Jan 1995

Syntactic Control Of Interference Revisited, Peter W. O'Hearn, A. J. Power, M. Takeyama, R. D. Tennent

College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects

In "Syntactic Control of Interference" (POPL, 1978), J. C. Reynolds proposes three design principles intended to constrain the scope of imperative state effects in Algol-like languages. The resulting linguistic framework seems to be a very satisfactory way of combining functional and imperative concepts, having the desirable attributes of both purely functional languages (such as pcf) and simple imperative languages (such as the language of while programs). However, Reynolds points out that the "obvious" syntax for interference control has the unfortunate property that fi-reductions do not always preserve typings. Reynolds has subsequently presented a solution to this problem (ICALP, 1989), but …


Parametricity And Local Variables, Peter W. O'Hearn, R. D. Tennent Jan 1995

Parametricity And Local Variables, Peter W. O'Hearn, R. D. Tennent

College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects

We propose that the phenomenon of local state may be understood in terms of Strachey 's concept of parametric (i.e., uniform) polymorphism. The intuitive basis for our proposal is the following analogy: a non-local procedure is independent of locally-declared variables in the same way that a parametrically polymorphic function is independent of types to which it is instantiated. A connection between parametricity and representational abstraction was first suggested by J. C. Reynolds. Reynolds used logical relations to formalize this connection in languages with type variables and user-defined types. We use relational parametricity to construct a model for an Algol-like language …


Run-Time Support For Parallelization Of Data-Parallel Applications On Adaptive And Nonuniform Computational Environments, Maher Kaddoura, Sanjay Ranka Jan 1995

Run-Time Support For Parallelization Of Data-Parallel Applications On Adaptive And Nonuniform Computational Environments, Maher Kaddoura, Sanjay Ranka

College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects

In this paper we discuss the runtime support required for the parallelization of unstructured data parallel applications on nonuniform and adaptive environments. The approach presented is reasonably general and is applicable to a wide variety of regular as well as irregular applications. We present performance results for the solution of an unstructured mesh on a cluster of heterogeneous workstations.


Liability Issues In The Development Of Electronic Chart Display Information Systems, Daniel R. Martin Jan 1995

Liability Issues In The Development Of Electronic Chart Display Information Systems, Daniel R. Martin

Marine Affairs Theses and Major Papers

The Electronic Chart Display Information System (ECDIS) is a new and evolving aid to navigation. Proponents claim ECDIS will help navigators to synthesize previously disparate information and result in safer navigation. The technology to implement ECDIS already exists; the major hurdle the maritime community faces is the legal uncertainties associated with ECDIS. This paper investigates the potential legal impact ECDIS would have on the government, shipowners, mariners, and manufacturers, and evaluates current international efforts to promote ECDIS. Through a detailed analysis of admiralty and aeronautical case history, it is evident that; 1) generation of electronic nautical charts can post a …