Physical Sciences and Mathematics Commons^™

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

Department of Computer Science Technical Reports

No abstract provided.

Ariadne: Architecture Of A Portable Threads System Supporting Mobile Processes, Edward Mascarenhas, Vernon Rego

Department of Computer Science Technical Reports

No abstract provided.

Box-Structured Requirement Determination Methods, A. R. Hevner, Harlan D. Mills

The Harlan D. Mills Collection

Requirements determination is an iterative process of eliciting, gathering, modeling, specifying, and analyzing system requirements information. It is the most critical, yet least understood, phase of systems development. This paper presents a rigorous approach for performing requirements determination with box-structured methods. By capturing requirements information in black box transactions and transaction hierarchies, intellectual control is maintained over large amounts of requirements information. The results of the box-structured requirements determination methods provide the basis for formal system design techniques. A concise example of box-structured requirements determination is included in an appendix.

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 …

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.

Analysis Of Heads-Up Display Quickening Versus Handling Qualities, Gary M. Konnert

Theses and Dissertations

This study investigated an analytical means of selecting the quickening time constant for the standardized Heads-Up Display flight path marker. The theoretically determined time constant allowed a faster, less resource intensive means of selecting the quickening time constant. The theoretically best time constant for pilot-aircraft handling qualities was equal to the airframe pitch attitude high frequency zero time constant, T_θ2. Flight test indicated an empirical, more labor intensive method yielded better handling qualities, even though paper analysis indicated the theoretical method was better. The theoretically determined time constant gave slightly lower handling qualities. but was less costly to …

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.

Formal Foundations For The Specification Of Software Architecture, Mark J. Gerken

Theses and Dissertations

This investigation establishes a formal foundation for software architecture that allows for the specification of large, non-trivial software systems using well founded, consistency preserving construction techniques. Two fundamental problems were addressed: how to define and express architectures formally using the concept of theories, and how architecture theories can be practically applied in specification construction. The initial stages of this investigation sought to establish a formal, mathematical relationship between functional specifications of behavior and specifications defining system structure. Experimental results lead to the conclusion that architectures defining the structure of functional operations can be defined using functional logic, but more complex …

Teaching Accommodation Task Skills: From Human Demonstration To Robot Control Via Artificial Neural Networks, Paul V. Whalen

Theses and Dissertations

A simple edge-mating task, performed automatically by accommodation control, was used to study the feasibility of using data collected during a human demonstration to train an artificial neural network (ANN) to control a common robot manipulator to complete similar tasks. The 2-dimensional (planar) edge-mating task which aligns a peg normal to a fiat table served as the basis for the investigation. A simple multi-layered perceptron (MLP) ANN with a single hidden layer and linear output nodes was trained using the back-propagation algorithm with momentum. The inputs to the ANN were the planar components of the contact force between the peg …

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 …

Content-Based Image Retrieval: Color And Edges, Robert S. Gray

Computer Science Technical Reports

One of the tools that will be essential for future electronic publishing is a powerful image retrieval system. The author should be able to search an image database for images that convey the desired information or mood; a reader should be able to search a corpus of published work for images that are relevant to his or her needs. Most commercial image retrieval systems associate keywords or text with each image and require the user to enter a keyword or textual description of the desired image. This text-based approach has numerous drawbacks -- associating keywords or text with each image …

Interview: Joel Slayton, Christine Laffer

SWITCH

Interview with Joel Slayton, Professor of Computers in Fine Art at San José State University, and Director of the CADRE Institute. Slayton discusses the history of the Cadre Institute and details his views on the relationship between art and new technology. Slayton describes the role of artists in exploring the possibilities and ethical implications of emerging technologies such as genetic engineering, nano-techology, robotics, and artificial life. He describes installations and in-progress work focused on ubiquitous video surveillance. The interview concludes with a discussion of Slayton’s use of the DoWhatDo model for artistic collaboration and of his piece "Conduits," presented in …

Exploring The Use Of I/O Nodes For Computation In A Mimd Multiprocessor, David Kotz, Ting Cai

Computer Science Technical Reports

As parallel systems move into the production scientific computing world, the emphasis will be on cost-effective solutions that provide high throughput for a mix of applications. Cost-effective solutions demand that a system make effective use of all of its resources. Many MIMD multiprocessors today, however, distinguish between ``compute'' and ``I/O'' nodes, the latter having attached disks and being dedicated to running the file-system server. This static division of responsibilities simplifies system management but does not necessarily lead to the best performance in workloads that need a different balance of computation and I/O. Of course, computational processes sharing a node with …

Psusort: A Parallel External Sort For A Shared Memory Multiprocessor System, Sujata V. Ramamoorthy

Dissertations and Theses

A method to parallelize external sorts on a shared memory multiprocessing system is presented in this thesis. The main goal of the thesis is to develop a sorting package that is scale able and efficient. No prior knowledge of the nature, source or size of the data is assumed for this work. A dynamic load-balancing architecture is used with no static allocation of tasks to processes. The package consists of an interface and a kernel. The interface provides the sort with the following - the sort input, output and temporary work spaces as abstract data types (ADTs), memory available, number …

1.3, Yolanda Jones

E-lert

No abstract provided.

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

BITs and PCs Newsletter

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

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.

A Pyramid Approach To Stereo Coorespondence, Piper L. Canfield, Anupam Joshi

Department of Computer Science Technical Reports

No abstract provided.

A Software Architecture To Support Misuse Intrusion Detection, Sandeep Kumar, Eugene H. Spafford

Department of Computer Science Technical Reports

No abstract provided.

Parallel Adaptive Mesh Generation And Decomposition, Poting Wu, Elias N. Houstis

Department of Computer Science Technical Reports

No abstract provided.

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

Department of Computer Science Technical Reports

No abstract provided.

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

Department of Computer Science Technical Reports

No abstract provided.

Multi-Parameterized Schwarz Alternating Methods For Elliptic Boundary Value Problems, S. B. Kim, A. Hadjidimos, Elias N. Houstis, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

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

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

Department of Computer Science Technical Reports

No abstract provided.

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

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 …

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

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

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.