Digital Commons Network^™

Solving Pdes Using An Agent Based Architecture, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

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

Defining And Refining Frameless Rendering, Ellen J. Scher Zagier

Link Foundation Modeling, Simulation and Training Fellowship Reports

Frame1ess Rendering (FR) is a rendering paradigm which performs stochastic temporal filtering by updating pixels in a random order, based on most recent available input data, and displaying them to the screen immediately (3]. It has inherent in its design, visual artifacts that come across as "spatial scatter''. Due to the asynchronicity of pixel updates, a noisy or "scattered" image is perceived if the update rate is not fast enough. We describe the fac1ors that influence the perceptual quality when Frarneless Rendering is implemented such as object and viewpoint velocities, pattern and object size, and pattern and object separation. The …

Distributed Collaborative Learning Environments, Mark C. Kilby

Link Foundation Modeling, Simulation and Training Fellowship Reports

The evolution of technologies for the World Wide Web (WWW), computer-supported cooperative work (CSCW) and distributed simulation provides new opportunities for education delivery as well as unique perspectives for training. Simulation follows a learn-by-doing philosophy . The WWW and CSCW provides a collaborative learning perspective by encouraging collective knowledge building. By merging these two approaches, Distributed Collaborative Learning Environments (DCLEs) can be developed to provide new approaches to training in the military, industry, and academia. Traditional approaches toward educational rely on an information transfer model. Instructors deliver the material to the students and students are tested on how well they …

Search For Sleptons In E+E- Collisions At Centre-Of-Mass Energies Of 161 Gev And 172 Gev, R. Barate, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

The data recorded by the ALEPH experiment at LEP at centre–of–mass energies of 161 GeV and 172 GeV were analysed to search for sleptons, the supersymmetric partners of leptons. No evidence for the production of these particles was found. The number of candidates observed is consistent with the background expected from four–fermion processes and γγ–interactions. Improved mass limits at 95% C.L. are reported.

Information Retrieval On The World Wide Web, Venkat N. Gudivada, Vijay V. Raghavan, William I. Grosky, Rajesh Kasanagottu

Computer Science Faculty Research & Creative Works

Effective search and retrieval are enabling technologies for realizing the full potential of the Web. The authors examine relevant issues, including methods for representing document content. They also compare available search tools and suggest methods for improving retrieval effectiveness.

Calibration And Validation Of The Checkpoint Model To The Air Force Electronic Systems Center Software Database, Thomas C. Shrum

Theses and Dissertations

This research effort focused on the calibration and validation of CHECKPOINT Version 2.3.1, a computerized software cost estimating tool, to the USAF Electronic Systems Center (ESC) software database. This thesis is a direct follow-on to a 1996 CHECKPOINT study at the Air Force Institute of Technology, which successfully calibrated and validated CHECKPOINT to the SMC software database. While this research generally parallels the methodology in the aforementioned study, it offers advancements in the CHECKPOINT calibration and validation procedure, and it refines the data stratification process and the statistical analyses employed. After stratifying the ESC software database into ten usable data …

Extracting Functionally Equivalent Object-Oriented Designs From Legacy Imperative Code, Ricky E. Sward

Theses and Dissertations

This research defines a methodology for automatically extracting functionally equivalent object-oriented designs from legacy imperative programs. The Parameter-Based Object Identification (PBOI) methodology is based on fundamental ideas that relate programs written in imperative languages such as C or COBOL to objects and classes written in object-oriented languages such as Ada 95 or C ++. Transformations have been developed that formalize the PBOI methodology and a formal proof is provided showing the extracted object-oriented design is functionally equivalent to the legacy imperative system. To focus the task of re-engineering, generic models of imperative programming languages and object-oriented programming languages have been …

Performing Out-Of-Core Ffts On Parallel Disk Systems, Thomas H. Cormen, David M. Nicol

Computer Science Technical Reports

The Fast Fourier Transform (FFT) plays a key role in many areas of computational science and engineering. Although most one-dimensional FFT problems can be solved entirely in main memory, some important classes of applications require out-of-core techniques. For these, use of parallel I/O systems can improve performance considerably. This paper shows how to perform one-dimensional FFTs using a parallel disk system with independent disk accesses. We present both analytical and experimental results for performing out-of-core FFTs in two ways: using traditional virtual memory with demand paging, and using a provably asymptotically optimal algorithm for the Parallel Disk Model (PDM) of …

Parallel 3d Reconstruction Of Spherical Virus Particles From Digitized Images Of Entire Electron Micrographs Using Cartesian Coordinates And Fourier Analysis, Robert E. Lynch, Dan C. Marinescu

Department of Computer Science Technical Reports

No abstract provided.

Building Multi-Discipline, Multi-Format Digital Libraries Using Clusters And Buckets, Michael L. Nelson

Computer Science Theses & Dissertations

Our objective was to study the feasibility of extending the Dienst protocol to enable a multi-discipline, multi-format digital library. We implemented two new technologies: cluster functionality and publishing buckets. We have designed a possible implementation of clusters and buckets, and have prototyped some aspects of the resultant digital library.

Currently, digital libraries are segregated by the disciplines they serve ( computer science, aeronautics, etc.), and by the format of their holdings (reports, software, datasets, etc.). NCSTRL+ is a multi-discipline, multi-format digital library (DL) prototype created to explore the feasibility of the design and implementation issues involved with created a …

Learning Recursive Functions From Approximations, John Case, Susanne Kaufmann, Martin Kummer, Efim Kinber

School of Computer Science & Engineering Faculty Publications

This article investigates algorithmic learning, in the limit, of correct programs for recursive functionsffrom both input/output examples offand several interesting varieties ofapproximateadditional (algorithmic) information aboutf. Specifically considered, as such approximate additional information aboutf, are Rose's frequency computations forfand several natural generalizations from the literature, each generalization involving programs for restricted trees of recursive functions which havefas a branch. Considered as the types of trees are those with bounded variation, bounded width, and bounded rank. For the case of learning final correct programs for recursive functions, EX-learning, …

Fast Discrete Polynomial Transforms With Applications To Data Analysis For Distance Transitive Graphs, J. R. Driscoll, D. M. Healy, D. N. Rockmore

Dartmouth Scholarship

Let $\poly = \{P_0,\dots,P_{n-1}\}$ denote a set of polynomials with complex coefficients. Let $\pts = \{z_0,\dots,z_{n-1}\}\subset \cplx$ denote any set of {\it sample points}. For any $f = (f_0,\dots,f_{n-1}) \in \cplx^n$, the {\it discrete polynomial transform} of f (with respect to $\poly$ and $\pts$) is defined as the collection of sums, $\{\fhat(P_0),\dots,\fhat(P_{n-1})\}$, where $\fhat(P_j) = \langle f,P_j \rangle = \sum_{i=0}^{n-1} f_iP_j(z_i)w(i)$ for some associated weight function w. These sorts of transforms find important applications in areas such as medical imaging and signal processing.

In this paper, we present fast algorithms for computing discrete orthogonal polynomial transforms. For a system …

Using The Quantum Computer To Break Elliptic Curve Cryptosystems, Jodie Eicher, Yaw Opoku

Department of Math & Statistics Technical Report Series

This article gives an introduction to Elliptic Curve Cryptography and Quantum Computing. It includes an analysis of Peter Shor’s algorithm for the quantum computer breakdown of Discrete Log Cryptosystems and an analog to Shor’s algorithm for Elliptic Curve Cryptosystems. An extended example is included which illustrates how this modified Shor’s algorithm will work.

Multimedia Data Analysis Using Imagetcl (Extended Version), Charles B. Owen, Fillia Makedon

Computer Science Technical Reports

ImageTcl is an new system which provides powerful Tcl/Tk based media scripting capabilities similar to those of the ViewSystem and Rivl in a unique environment that allows rapid prototyping and development of new components in the C++ language. Powerful user tools automate the creation of new components as well as the addition of new data types and file formats. Applications using ImageTcl at the Dartmouth Experimental Visualization Laboratory (DEVLAB) include multiple stream media data analysis, automatic image annotation, and image sequence motion analysis. ImageTcl combines the high speed of compiled languages with the testing and parameterization advantages of scripting languages.

Hybrid Probabilistic Programs, Alex Dekhtyar, V. S. Subrahmanian

Computer Science and Software Engineering

The precise probability of a compound event (e.g. e₁ V e₂, e₁ Ʌ e₂) depends upon the known relationships (e.g. independence, mutual exclusion, ignorance of any relationship, etc.) between the primitive events that constitute the compound event. To date, most research on probabilistic logic programming [20, 24, 25, 26] has assumed that we are ignorant of the relationship between primitive events. Likewise, most research in AI (e.g. Bayesian approaches) has assumed that primitive events are independent. In this paper, we propose a hybrid probabilistic logic programming language in which the user can explicitly associate, …

Mail Server Installation And Integration, Tim Lewis

Honors Capstone Projects and Theses

No abstract provided.

A Synthesized Methodology For Eliciting Expert Judgment For Addressing Uncertainty In Decision Analysis, Richard W. Monroe

Engineering Management & Systems Engineering Theses & Dissertations

This dissertation describes the development, refinement, and demonstration of an expert judgment elicitation methodology. The methodology has been developed by synthesizing the literature across several social science and scientific fields. The foremost consideration in the methodology development has been to incorporate elements that are based on reasonable expectations for the human capabilities of the user, the expert in this case.

Many methodologies exist for eliciting assessments for uncertain events. These are frequently elicited in probability form. This methodology differs by incorporating a qualitative element as a beginning step for the elicitation process. The qualitative assessment is a more reasonable way …

Report On The 5th Ifip International Workshop On Quality Of Service, Oguz Angin, Andrew T. Campbell, Lai Tee Cheok, Raymond Liao, Koon-Seng Lim, Klara Nahrstedt

Research Collection School Of Computing and Information Systems

This paper presents a summary of the fifth International Workshop on Quality of Service (IWQOS) which was held at Columbia University in May 1997. The goal of this three-day meeting was to foster interaction between researchers active in the area of Quality of Service(QOS) research, to reflect on past experiences and lessons learnt, and to discuss future QOS challenges. To reflect this goal, this year's workshop included a hot program made up of (i) a keynote address on "Programming Telecommunications Networks"; (ii) panels addressing "QOS for Distributed Object Computing Middleware --- Fact or Fiction?" and "Reservations about Reservations"; (iii) a …

Specification And Verification Of Generic Cell Rate Algorithms In Pvs, Huseyin Ozgungor

Electrical & Computer Engineering Theses & Dissertations

Formal verification methods have been considered as a powerful complementary approach to define standards and to prove correctness of the systems. In this work, formal specification of Generic Cell Rate Algorithms are defined and proved. The specification process enables standardization for constructing Generic Cell Rate Algorithms. Standardization is an important process in the Asynchronous Transfer Mode (ATM) networks. By employing formal methods, the necessary standards could be constructed to allow different algorithms to be employed which still meet system requirements. Those system requirements are quantified in the Quality of Service (QOS).

Congestion management is a vital concept for networks in …

Integrating Research Into The Core Curriculum - A Case Study, Erika Rogers

Computer Science and Software Engineering

No abstract provided.

Agent Tcl: A Flexible And Secure Mobile-Agent System, Robert S. Gray

Dartmouth College Ph.D Dissertations

A mobile agent is an autonomous program that can migrate under its own control from machine to machine in a heterogeneous network. In other words, the program can suspend its execution at an arbitrary point, transport itself to another machine, and then resume execution from the point of suspension. Mobile agents have the potential to provide a {\em single, general framework} in which a wide range of distributed applications can be implemented efficiently and easily. Several challenges must be faced, however, most notably reducing migration overhead, protecting a machine from malicious agents (and an agent from malicious machines), and insulating …

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

BITs and PCs Newsletter

Wright State University College of Engineering and Computer Science

Practical Sliced Configuration Spaces For Curved Planar Pairs, Elisha Sacks

Department of Computer Science Technical Reports

No abstract provided.

Improving Data Availability In Mobile Computing Using Prewrite Operations, Sanjay Kumar Madria, Bharat Bhargava

Department of Computer Science Technical Reports

No abstract provided.

Exploiting And-Or Parallelism In Prolog: The Oasys Computational Model And Abstract Architecture, I. P. Vlachavas

Department of Computer Science Technical Reports

No abstract provided.

Technologies For Ubiquitous Supercomputing: A Java Interface To The Nexus Communication System, Ian Foster, George K. Thiruvathukal, Steven Tuecke

Computer Science: Faculty Publications and Other Works

We use the term ubiquitous supercomputing to refer to systems that integrate low- and mid-range computing systems, advanced networks and remote high-end computers with the goal of enhancing the computational power accessible from local environments. Such systems promise to enable new applications in areas as diverse as smart instruments and collaborative environments. However, they also demand tools for transporting code between computers and for establishing flexible, dynamic communication structures. In this article, we propose that these requirements be satisfied by introducing Java classes that implement the global pointer and remote service request mechanisms defined by a communication library called Nexus. …

Search For The Bc Meson In Hadronic Z Decays, R. Barate, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

A search for the Bc meson decaying into the channels Jψπ+ and Jψℓ+νℓ (ℓ = e or μ) is performed in a sample of 3.9 million hadronic Z decays collected by the ALEPH detector. This search results in the observation of 0 and 2 candidates in each of these channels, respectively, while 0.44 and 0.81 background events are expected. The following 90% confidence level upper limits are derived:Br(Z→BcXBr(Z→qq̄Br(Bc+→Jψπ+)

Physiologically-Based Vision Modeling Applications And Gradient Descent-Based Parameter Adaptation Of Pulse Coupled Neural Networks, Randy P. Broussard

Theses and Dissertations

In this research, pulse coupled neural networks (PCNNs) are analyzed and evaluated for use in primate vision modeling. An adaptive PCNN is developed that automatically sets near-optimal parameter values to achieve a desired output. For vision modeling, a physiologically motivated vision model is developed from current theoretical and experimental biological data. The biological vision processing principles used in this model, such as spatial frequency filtering, competitive feature selection, multiple processing paths, and state dependent modulation are analyzed and implemented to create a PCNN based feature extraction network. This network extracts luminance, orientation, pitch, wavelength, and motion, and can be cascaded …

Efficient Parallel Processing With Optical Interconnections, Lili Hai

Dissertations

With the advances in VLSI technology, it is now possible to build chips which can each contain thousands of processors. The efficiency of such chips in executing parallel algorithms heavily depends on the interconnection topology of the processors. It is not possible to build a fully interconnected network of processors with constant fan-in/fan-out using electrical interconnections. Free space optics is a remedy to this limitation. Qualities exclusive to the optical medium are its ability to be directed for propagation in free space and the property that optical channels can cross in space without any interference. In this thesis, we present …