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

Computer Sciences Commons™

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

1997

Discipline
Institution
Keyword
Publication
Publication Type

Articles 1 - 30 of 407

Full-Text Articles in Computer Sciences

Module Embedding, Atanas Radenski Dec 1997

Module Embedding, Atanas Radenski

Mathematics, Physics, and Computer Science Faculty Articles and Research

This paper proposes a code reuse mechanism called module embedding that enables the building of new modules from existing ones through inheritance, overriding of procedures, and overriding of types; the paper also describes an implementation scheme for this mechanism. Module embedding is beneficial when modules and classes are used in combination and need to be extended together, or when modules are more appropriate medium than classes.

Go to article

Concept Vectors: A Synthesis Of Concept Mapping And Matrices For Knowledge Representation In Intelligent Tutoring Systems, Mark L. Dyson Dec 1997

Concept Vectors: A Synthesis Of Concept Mapping And Matrices For Knowledge Representation In Intelligent Tutoring Systems, Mark L. Dyson

Theses and Dissertations

A review of the literature relating to intelligent tutoring systems (ITS) reveals that the bulk of research to date is focused on the student, and on methods for representing the knowledge itself. From student models to learning schemas to presentation methods, comparatively little attention has been paid to the problem of educators attempting to build viable lesson plans for use in an ITS environment--yet when this problem is addressed in the literature, it is recognized as a potentially daunting one. This thesis addresses the problem of ITS lesson plan development by proposing a practical, computable approach for knowledge engineering that …

Go to article

Electro-Deposition Of Polymer Chains On An Adsorbing Wall: Density Profiles And Wall Coverage, Grace M. Foo, Ras B. Pandey Dec 1997

Electro-Deposition Of Polymer Chains On An Adsorbing Wall: Density Profiles And Wall Coverage, Grace M. Foo, Ras B. Pandey

Faculty Publications

Growth of polymer density in an electro-deposition model of polymer chains on an impenetrable wall is studied on a two dimensional discrete lattice using a Monte Carlo simulation. Polymer-polymer repulsion and polymer-wall attraction for the adsorbing wall (along with the neutral and repulsive interactions) are considered in an external field. Effects of the field strength (B), temperature (T), and chain length (L-c) on the density profile of the polymer chains and wall coverage are investigated. The spatial density profile shows onset of oscillation near the wall at a characteristic field (B-c) which depends on chain length and temperature, In low …

Go to article

Learning To See Analogies: A Connectionist Exploration, Douglas S. Blank Dec 1997

Learning To See Analogies: A Connectionist Exploration, Douglas S. Blank

Computer Science Faculty Research and Scholarship

The goal of this dissertation is to integrate learning and analogy-making. Although learning and analogy-making both have long histories as active areas of research in cognitive science, not enough attention has been given to the ways in which they may interact. To that end, this project focuses on developing a computer program, called Analogator, that learns to make analogies by seeing examples of many different analogy problems and their solutions. That is, it learns to make analogies by analogy. This approach stands in contrast to most existing computational models of analogy in which particular analogical mechanisms are assumed a priori …

Go to article

Bias And The Probability Of Generalization, Tony R. Martinez, D. Randall Wilson Dec 1997

Bias And The Probability Of Generalization, Tony R. Martinez, D. Randall Wilson

Faculty Publications

In order to be useful, a learning algorithm must be able to generalize well when faced with inputs not previously presented to the system. A bias is necessary for any generalization, and as shown by several researchers in recent years, no bias can lead to strictly better generalization than any other when summed over all possible functions or applications. This paper provides examples to illustrate this fact, but also explains how a bias or learning algorithm can be “better” than another in practice when the probability of the occurrence of functions is taken into account. It shows how domain knowledge …

Go to article

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

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

Ta Da! - The Text Adventure Design Assistant A Visual Tool For The Development Of Adventure Games, Sean Molley Dec 1997

Ta Da! - The Text Adventure Design Assistant A Visual Tool For The Development Of Adventure Games, Sean Molley

Masters Theses & Specialist Projects

In this paper, I survey past and present tools available to text adventure game authors, and then describe a new product: the Text Adventure Design Assistant (TA DA!), a visual programming system for creating text adventure games. My system consists of two parts: an abstract framework which defines an archetypical game, and a user interface which allows for the construction of games in a visual manner by manipulating the elements of the abstract game to produce a concrete design. The two most popular contemporary programming languages for creating text adventure games, TADS and Inform, are compared and contrasted, and my …

Go to article

Flow And Congestion Control For Internet Streaming Applications, Shanwei Cen, Calton Pu, Jonathan Walpole Dec 1997

Flow And Congestion Control For Internet Streaming Applications, Shanwei Cen, Calton Pu, Jonathan Walpole

Computer Science Faculty Publications and Presentations

The emergence of streaming multimedia players provides users with low latency audio and video content over the Internet. Providing high-quality, best-effort, real-time multimedia content requires adaptive delivery schemes that fairly share the available network bandwidth with reliable data protocols such as TCP. This paper proposes a new flow and congestion control scheme, SCP (Streaming Control Protocol) , for real-time streaming of continuous multimedia data across the Internet. The design of SCP arose from several years of experience in building and using adaptive real-time streaming video players. SCP addresses two issues associated with real-time streaming. First, it uses a congestion control …

Go to article

Layout For Visualizing Large Software Structures In 3d, Colin Ware, Glenn Franck, Monica Parkhi, Tim Dudley Dec 1997

Layout For Visualizing Large Software Structures In 3d, Colin Ware, Glenn Franck, Monica Parkhi, Tim Dudley

Center for Coastal and Ocean Mapping

There is increasing evidence that 3D visualization of complex structures has advantages over 2D visualization. While nested directed graphs are an important method of representing information in 2D or 3D, they must be effectively organized in order to be understood. Most work on graph layout has assumed that fully automatic layout is desirable. Through our work with graphs representing large software structures, we have found that, due to the importance of the semantic content, it is necessary to combine automatic layout with manual layout. This paper describes a system called GraphVisualizer3D, which was designed to help people understand large nested …

Go to article

An Incompleteness Handling Methodology For Validation Of Bayesian Knowledge Bases, David J. Bawcom Dec 1997

An Incompleteness Handling Methodology For Validation Of Bayesian Knowledge Bases, David J. Bawcom

Theses and Dissertations

The PESKI (Probabilities, Expert Systems, Knowledge, and Inference) system attempts to address some of the problems in expert system design through the use of the Bayesian Knowledge Base (BKB) representation. Knowledge gathered from a domain expert is placed into this framework and inferencing is performed over it. However, by the nature of BKBs, not all knowledge is incorporated, i.e. the representation need not be a complete representation of all combinations and possibilities of the knowledge, as this would be impractical in many real-world systems. Therefore, inherent in such a system is the problem of incomplete knowledge, or spaces within the …

Go to article

Developing A Corpus Specific Stoplist Using Quantitative Comparison, Craig N. Berg Dec 1997

Developing A Corpus Specific Stoplist Using Quantitative Comparison, Craig N. Berg

Theses and Dissertations

We have become overwhelmed with electronic information and it seems our situation is not going to improve. It is becoming increasingly common for people to work with information on a daily basis. We seem to spend more and more time looking for information, and it is taking longer because more information is available. This thesis will look at how we can provide faster access to the information we want to find. Today's requirements are closely related to searching for information using queries. At the heart of the query process is the removal of search terms having little or no significance …

Go to article

Visualization And Animation Of A Missile/Target Encounter, Jeffrey T. Bush Dec 1997

Visualization And Animation Of A Missile/Target Encounter, Jeffrey T. Bush

Theses and Dissertations

Existing missile/target encounter modeling and simulation systems focus on improving probability of kill models. Little research has been done to visualize these encounters. These systems can be made more useful to the engineers by incorporating current computer graphics technology for visualizing and animating the encounter. Our research has been to develop a graphical simulation package for visualizing both endgame and full fly-out encounters. Endgame visualization includes showing the interaction of a missile, its fuze cone proximity sensors, and its target during the final fraction of a second of the missile/target encounter. Additionally, this system displays dynamic effects such as the …

Go to article

An Examination Of Multi-Tier Designs For Legacy Data Access, Michael L. Acker Dec 1997

An Examination Of Multi-Tier Designs For Legacy Data Access, Michael L. Acker

Theses and Dissertations

This work examines the application of Java and the Common Object Request Broker Architecture (CORBA) to support access to remote databases via the Internet. The research applies these software technologies to assist an Air Force distance learning provider in improving the capabilities of its World Wide Web-based correspondence system. An analysis of the distance learning provider's operation revealed a strong dependency on a non-collocated legacy relational database. This dependency limits the distance learning provider's future web-based capabilities. A recommendation to improve operation by data replication is proposed, and the implementation details are provided for two alternative test systems that support …

Go to article

Breast Cancer Mass Detection Using Difference Of Gaussians And Pulse Coupled Neural Networks, Donald A. Cournoyer Dec 1997

Breast Cancer Mass Detection Using Difference Of Gaussians And Pulse Coupled Neural Networks, Donald A. Cournoyer

Theses and Dissertations

CAD, serving as a second reader, has been shown to improve the success of radiologists at detecting breast cancer. This thesis will develop a new algorithm to identify masses in mammograms. The system developed for this thesis will be capable of assisting a radiologist in making decisions.

Go to article

A Single Chip Low Power Implementation Of An Asynchronous Fft Algorithm For Space Applications, Bruce W. Hunt Dec 1997

A Single Chip Low Power Implementation Of An Asynchronous Fft Algorithm For Space Applications, Bruce W. Hunt

Theses and Dissertations

A fully asynchronous fixed point FFT processor is introduced for low power space applications. The architecture is based on an algorithm developed by Suter and Stevens specifically for a low power implementation. The novelty of this architecture lies in its high localization of components and pipelining with no need to share a global memory. High throughput is attained using large numbers of small, local components working in parallel. A derivation of the algorithm from the discrete Fourier transform is presented followed by a discussion of circuit design parameters specifically, those relevant to space applications. The generic architecture is explained with …

Go to article

A Representational Approach To Knowledge And Multiple Skill Levels For Broad Classes Of Computer Generated Forces, Larry J. Hutson Dec 1997

A Representational Approach To Knowledge And Multiple Skill Levels For Broad Classes Of Computer Generated Forces, Larry J. Hutson

Theses and Dissertations

Current computer generated forces (CGFs) in the 'synthetic battlespace', a training arena used by the military, exhibit several deficiencies. Human actors within the battlespace rapidly identify these CGFs and defeat them using unrealistic and potentially fatal tactics, reducing the overall effectiveness of this training arena. Simulators attached to the synthetic battlespace host local threat systems, leading to training inconsistencies when different simulators display the same threat at different levels of fidelity. Finally, current CGFs are engineered 'from the ground up', often without exploiting commonalities with other existing CGFs, increasing development (and ultimately training) costs. This thesis addresses these issues by …

Go to article

A Model For Determining Information To Be Captured Regarding Unauthorized Computer Entry Of An Air Force Computer System, Leslie F. Himebrook Dec 1997

A Model For Determining Information To Be Captured Regarding Unauthorized Computer Entry Of An Air Force Computer System, Leslie F. Himebrook

Theses and Dissertations

This thesis presents a model of information to capture regarding unauthorized computer systems access attempts. This model takes a management focus, and incorporates the technical focus, intelligence focus, and legal focus as inputs. The author used an exploratory, qualitative methodology consisting of an extensive literature review and interviews with experts in the field. These efforts produced the proposed model, which was reviewed by experts in the field using a delphi technique. The model consists of information that is divided into the following areas: 1. What information was compromised. 2. What type of intrusion occurred. 3. How the intrusion was attempted. …

Go to article

A Modeling And Simulation Approach To Characterize Network Layer Internet Survivability, Leif S. King Dec 1997

A Modeling And Simulation Approach To Characterize Network Layer Internet Survivability, Leif S. King

Theses and Dissertations

The Air Force Core Competency of Information Superiority will be achieved in an age of decreasing AF manpower and corporate expertise. Increased AF reliance on COTS solutions, coupled with nearly ubiquitous points of entry to communication networks, create unique challenges in maintaining the Information Superiority edge. The protection of the internet is part of this equation. The internet supports the daily business traffic of the Air Force. Personnel, finance, and supply data flow through its routers. Controlling an adversary's access to our information systems, either the data, or the hardware and software that control the data and transform it into …

Go to article

Requirements, Design And Prototype Of A Virtual User Interface For The Afit Virtual Spaceplane, John M. Lewis Dec 1997

Requirements, Design And Prototype Of A Virtual User Interface For The Afit Virtual Spaceplane, John M. Lewis

Theses and Dissertations

The United States Air Force is evaluating the feasibility of designing a military spaceplane capable of accomplishing military objectives from a low earth orbit and atmospheric flight regimes. Current efforts are involved in determining the scientific, operational, and budgetary constraints associated with this concept. This thesis looks at the exploration of new interface techniques associated with the design of a virtual spaceplane and is a subset of the overall virtual spaceplane effort which will assist researchers in determining the feasibility of a military spaceplane. Interface techniques are integrated into a virtual user interface that is designed to accommodate expected operations …

Go to article

Architecture, Design, And Implementation Of A Rapidly Prototyped Virtual Environment For A Military Spaceplane, Scott A. Rothermel Dec 1997

Architecture, Design, And Implementation Of A Rapidly Prototyped Virtual Environment For A Military Spaceplane, Scott A. Rothermel

Theses and Dissertations

The new Global Engagement vision places increased emphasis on the Air Force's ability to control and exploit space. A military spaceplane combining reliable access to space, high operational tempos, and multi-mission capabilities is in conceptual stages of development. Virtual environment technology provides an opportunity to investigate system requirements and unconventional interface paradigms for this unique vehicle. A virtual environment architecture and design based on support for a rapid prototyping development process, separation of concerns, and user interface development is presented. The rapid prototyping process allowed management of changing requirements via an evolutionary approach to implementation. Separation of the activities performed …

Go to article

Modeling And Simulation Support For Parallel Algorithms In A High-Speed Network, Dustin E. Yates Dec 1997

Modeling And Simulation Support For Parallel Algorithms In A High-Speed Network, Dustin E. Yates

Theses and Dissertations

This thesis investigates the ability of a simulation model to compare and contrast parallel processing algorithms in a high-speed network. The model extends existing modeling, analysis, and comparison of parallel algorithms by providing graphics based components that facilitate the measurement of system resources. Simulation components are based on the Myrinet local area network standard. The models provide seven different topologies to contrast the performance of five variations of Fast Fourier Transform (FFT) algorithms. Furthermore, the models were implemented using a commercially developed product that facilitates the testing of additional topologies and the investigation of hardware variations. Accurate comparisons are statistically …

Go to article

Subjective Quality Of Experience With The Internet: Accounting For Temporal Changes In User Acceptance Of Information Technology, Jason M. Turner Dec 1997

Subjective Quality Of Experience With The Internet: Accounting For Temporal Changes In User Acceptance Of Information Technology, Jason M. Turner

Theses and Dissertations

Contemporary information technology (IT) related research has focused on use as a key dependent measure for valuing IT. By understanding the determinants of IT use, we gain descriptive information about successful IT, and prescriptive information for better deploying IT resources. Although there are several competing theories regarding IT use, research findings often cite their inability to account for temporal changes in usage behaviors. This thesis introduces quality of experience as a potential moderator between the determinants of use and actual usage behaviors. A pilot survey concerning Internet usage generated potentially relevant items which were later refined into a questionnaire assessing …

Go to article

Microprogramming A Writeable Control Memory Using Very Long Instruction Word (Vliw) Compilation Techniques, Randall S. Whitman Dec 1997

Microprogramming A Writeable Control Memory Using Very Long Instruction Word (Vliw) Compilation Techniques, Randall S. Whitman

Theses and Dissertations

Microprogrammed Digital Signal Processors (DSP) are frequently used as a solution to embedded processor applications. These processors utilize a control memory which permits execution of the processor's instruction set architecture (ISA). The control memory can take the form of a static, read only memory (ROM) or a dynamic, writeable control memory (WCM), or both. Microcoding the WCM permits redefining the processor's ISA and provides speedup due to its instruction level parallelism (ILP) potential. In the past, code generation efforts for microprogrammable processors focused on creating assembly and microcode as two separate steps. In this thesis an alternative approach was chosen …

Go to article

A Parallel Algorithm For Determining Orientations Of Biological Macro- Molecules Imaged By Electron Microscopy, Timothy S. Baker, Ionana M. Boier Martin, Dan C. Marinescu Dec 1997

A Parallel Algorithm For Determining Orientations Of Biological Macro- Molecules Imaged By Electron Microscopy, Timothy S. Baker, Ionana M. Boier Martin, Dan C. Marinescu

Department of Computer Science Technical Reports

No abstract provided.

Go to article

The Platonic Spheroids, Jörg Peters, Leif Kobbelt Dec 1997

The Platonic Spheroids, Jörg Peters, Leif Kobbelt

Department of Computer Science Technical Reports

No abstract provided.

Go to article

Interactive Visualization Of Multi- Dimensional Scientific Data (Ph.D. Thesis), Daniel R. Schikore Dec 1997

Interactive Visualization Of Multi- Dimensional Scientific Data (Ph.D. Thesis), Daniel R. Schikore

Department of Computer Science Technical Reports

No abstract provided.

Go to article

Compact Recognizers Of Episode Sequences, Alberto Apostolico, Mikhail J. Attalah Dec 1997

Compact Recognizers Of Episode Sequences, Alberto Apostolico, Mikhail J. Attalah

Department of Computer Science Technical Reports

No abstract provided.

Go to article

Collaborative Environments For Scientific Computing The Task Of Algorithm/Software Selection, N. Ramakrishnan, Anupam Joshi, Elias N. Houstis, John R. Rice Dec 1997

Collaborative Environments For Scientific Computing The Task Of Algorithm/Software Selection, N. Ramakrishnan, Anupam Joshi, Elias N. Houstis, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Go to article

Corrigendum To “Post-Surgical Passive Response Of Local Environment To Primary Tumor Removal”: Mathl. Comput. Modelling, Vol. 25, No. 6, Pp. 7–17, 1997, J. A. Adam, C. Bellomo Dec 1997

Corrigendum To “Post-Surgical Passive Response Of Local Environment To Primary Tumor Removal”: Mathl. Comput. Modelling, Vol. 25, No. 6, Pp. 7–17, 1997, J. A. Adam, C. Bellomo

Mathematics & Statistics Faculty Publications

The computer program that was used to generate the graphs for the concentration of inhibitor contained an error. This influenced the scaling in the original Figures 2 and 3. As an example, a sample of the corrected graphs are given below. Copies of other corrected figures can be obtained from the authors. It is important to note that the “pulse” appears for the function rC(r, t). As can be seen, it travels slowly outward with decreasing amplitude. The mathematical analysis in the paper remains unchanged.

Go to article

Pseudorandom Code Generation For Communication And Navigation System Applications, John F. Brendle Jr. Dec 1997

Pseudorandom Code Generation For Communication And Navigation System Applications, John F. Brendle Jr.

Theses and Dissertations

This research project investigated the design, construction and evaluation of a pseudorandom code generator for communication and navigation system applications. These types of codes include spreading codes, Gold codes, Jet Propulsion Laboratory (JPL) ranging codes, syncopated codes, and nonlinear codes. Such waveforms are typically used in communication and navigation system applications. The code generator uses the Stanford Telecom STEL-1032 Pseudorandom Number (PRN) coder. A coder interface was designed and constructed for manual data entry to the registers of the PRN coder. The code generator is capable of independently clocking and generating all possible codes with lengths up to 4,294,967,295 bits. …

Go to article

Next Last