Physical Sciences and Mathematics Commons^™

The Ohio Gis Network: Stage 2 1996 Investment Fund Grant First Year Progress Report To The Ohio Board Of Regents (Ohio Gis Network), Mark Salling

All Maxine Goodman Levin School of Urban Affairs Publications

The Ohio Geographic Information Systems Network (Ohio GIS-Net) is an innovative consortium of Ohio’s urban and rural universities. The consortium is building a center of excellence where state-of-the-art geographic information systems (GIS) technology is applied to a research agenda that is critical to Ohio's economic development and central to research issues in policy sciences, civil engineering, public administration, economics and the environmental, urban and regional sciences. This cutting edge technology is an essential component of the basic research infrastructure of universities. It is also a critical resource in state and local economic development efforts, building and maintaining public infrastructure, and …

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

Low-Degree Graph Partitioning Via Local Search With Applications To Constraint Satisfaction, Max Cut, And Coloring, Magnus M. Halldorsson, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

We present practical algorithms for constructing partitions of graphs into a fixed number of vertex-disjoint subgraphs that satisfy particular degree constraints. We use this in particular to find k-cuts of graphs of maximum degree ∆ that cut at least a k - 1/k (1 + 1/2∆+k-1 ) fraction of the edges, improving previous bounds known. The partitions also apply to constraint networks, for which we give a tight analysis of natural local search heuristics for the maximum constraint satisfaction problem. These partitions also imply efficient approximations for several problems on weighted bounded-degree graphs. In particular, we improve the best performance …

The Use Of Prime Numbers As An Effective Method Of Cryptology, Joshua Flynn

Honors Theses, 1963-2015

With the increasing amount of information transmitted over networks, there is a need to be able to keep this information from falling into the wrong hands. The method that has been used for the past couple of decades is that of cryptography. This paper gives an explanation of cryptography, as well as different alogorithms that are used to solve the problem. One unique thing about a couple of the algorithms is that they use properties provided by prime numbers. In particular, the RSA model, invented by Rivest, Shamir and Adelman, is one model which utilizes the theory that it is …

Randomised Shuffle And Applied Misinformation: An Enhanced Model For Contact-Based Smart-Card Serial Data Transfer, Michael Collins

Theses: Doctorates and Masters

Contact-based smart-cards, which comply to the International Standard IS0-7816, communicate with their associated read/write machines via a single bi-directional serial link. This link is easy to monitor with inexpensive equipment and resources, enabling captured data to be removed for later examination. In many contact-based smart-cards the logical abilities are provided by eight-bit microcontroller units (MCU) which are slow at performing effective cryptographic functions. Consequently, for expediency, much data may be transferred in plain-text across the vulnerable communications link, further easing an eavesdropper's task. Practitioners in military communications protect transmitted information by varying a link's carrier frequency in an apparently random …

An Approach To Display Layout Of Dynamic Windows, Nihar Trivedi

Theses: Doctorates and Masters

The development of windows based user interface has introduced a new dimension to the field of human computer interaction. Now a user is able to perform multiple tasks at a time, often switching from one task to another. However windows environment also imposes the burden of manual windows management on the user. Several studies have suggested that manual window management is an unproductive chore often resulting in clutter and confusion on the display screen. Therefore we need a automatic windows layout generator to free the user to perform other useful tasks. This thesis introduces SPORDAC {Shadow Propagation for Overlap Removal …

A Study Of User Level Scheduling And Software Caching In The Educational Interactive System, Kaoru Tsunoda

Theses Digitization Project

No abstract provided.

Time-Optimal Tree Computations On Sparse Meshes, D. Bhagavathi, V. Bokka, H. Gurla, S. Olariu, J. L. Schwing

Computer Science Faculty Publications

The main goal of this work is to fathom the suitability of the mesh with multiple broadcasting architecture (MMB) for some tree-related computations. We view our contribution at two levels: on the one hand, we exhibit time lower bounds for a number of tree-related problems on the MMB. On the other hand, we show that these lower bounds are tight by exhibiting time-optimal tree algorithms on the MMB. Specifically, we show that the task of encoding and/or decoding n-node binary and ordered trees cannot be solved faster than Ω(log n) time even if the MMB has an infinite …

Measurement Of The Spectral Functions Of Vector Current Hadronic Tau Decays, R. Barate, M. Thulasidas

Research Collection School Of Computing and Information Systems

A measurement of the spectral functions of non-strange τ vector current final states is presented, using 124 358 τ pairs recorded by the ALEPH detector at LEP during the years 1991 to 1994. The spectral functions of the dominant two- and four-pion τ decay channels are compared to published results of e + e - annihilation experiments via isospin rotation. A combined fit of the pion form factor from τ decays and e + e - data is performed using different parametrizations. The mass and the width of the ρ ±(770) and the ρ 0(770) are separately determined in order …

Measurement Of The Τ Lepton Lifetime With The Three-Dimensional Impact Parameter Method, R. Barate, M. Thulasidas

Research Collection School Of Computing and Information Systems

A new method is presented for the measurement of the mean lepton lifetime using events in which are pair-produced and both's decay to hadrons.

The Topology Dependence Of Charged Particle Multiplicities In Three-Jet Events, R. Barate, M. Thulasidas

Research Collection School Of Computing and Information Systems

A study of individual jet and whole-event charged particle multiplicities in three-jet events measured in e + e − annihilation at the Z reveals a significant topology dependence. Mean jet multiplicities are inadequately described by jet energies; interjet angles must also be specified. Quantitative tests suggest that it is necessary to use transversemomentum- like scales to describe the data.

A Study Of Τ Decays Involving Η And Ω Mesons, D. Buskulic, M. Thulasidas

Research Collection School Of Computing and Information Systems

The 132 pbt - 1 of data collected by ALEPH from 1991 to 1994 have been used to analyze η and ω production in τ decays. The following branching fractions have been measured: B(τ−→ντωh−)=(1.91±0.07±0.06)×10−2,B(τ−→ντωh−)=(1.91±0.07±0.06)×10−2, B(τ−→ντωh−π0)=(4.3±0.6±0.5)×10−3,B(τ−→ντωh−π0)=(4.3±0.6±0.5)×10−3, B(τ−→ντηK−)=(2.9+1.3−1.2±0.7)×10−4,B(τ−→ντηK−)=(2.9−1.2+1.3±0.7)×10−4, B(τ−→ντηh−π0)=(1.8±0.4±0.2)×10−3B(τ−→ντηh−π0)=(1.8±0.4±0.2)×10−3 and the 95% C.L. limit B(τ− → ντηπt -) t - 4 has been obtained. The ωπt- and ηπt -π0 rates and dynamics are found in agreement with the predictions made from e+e∼ - annihilation data with the help of isospin invariance (CVC).

Parallel Algorithms For Single-Layer Channel Routing, Ronald I. Greenberg, Shih-Chuan Hung, Jau-Der Shih

Computer Science: Faculty Publications and Other Works

We provide efficient parallel algorithms for the minimum separation, offset range, and optimal offset problems for single-layer channel routing. We consider all the variations of these problems that are known to have linear- time sequential solutions rather than limiting attention to the "river-routing" context, where single-sided connections are disallowed. For the minimum separation problem, we obtain O(lgN) time on a CREW PRAM or O(lgN / lglgN) time on a (common) CRCW PRAM, both with optimal work (processor- time product) of O(N), where N is the number of terminals. For the offset range problem, we obtain the same time and processor …

Development And Evaluation Of Interactive Courseware For Visualization Of Graph Data Structure And Algorithms, Thomas E. Beutel

CCE Theses and Dissertations

The primary goal of this dissertation was to develop and pilot test interactive, multimedia courseware which would facilitate learning the abstract structures, operations, and concepts associated with graph and network data structures in Computer Science. Learning objectives and prerequisites are presented in an introduction section of the courseware and a variety of learning activities are provided including tutorials, animated demonstrations, interactive laboratory sessions, and self-tests. Courseware development incorporated principles and practices from software engineering, instructional design, and cognitive learning theories. Implementation utilized an easy-to-use authoring tool, NeoBook Professional (1994), to create the overall framework and the user interfaces, and Microsoft …

Global State Predicates In Rough Real-Time, Jean Ann Mayo

Dissertations, Theses, and Masters Projects

Distributed systems are characterized by the fact that the constituent processes have neither common memory nor a common system clock. These processes communicate solely via message passing. While providing a number of benefits such as increased reliability, increased computational power, and geographic dispersion, this architecture significantly complicates many of the tasks of software development and verification, including evaluation of the program state. In the case of distributed systems, the program state is comprised of the local states of the constituent processes, as well as the state of the channels between processes, and is called the global state.;With no common system …

The Effects Of User Interface Metaphors On The Learnability Of Computer Systems By Field Dependent And Field Independent Computer Users, Robert N. Urwiler Jr.

CCE Theses and Dissertations

This study was designed to assess the differences in the learning performance (speed and accuracy) with which field dependent and field independent subjects could complete a set of checkbook management tasks using software employing a user interface making strong use of common checkbook management metaphors versus software employing an interface adhering to a defacto industry standard-based graphical user interface design guideline. It was hypothesized that both field dependent and field independent users would complete tasks more quickly and accurately using both user interface types.

From a population of traditional and non-traditional college students, 64 individuals volunteered to participate in the …

Keyboardless Visual Programming Using Voice, Handwriting, And Gesture, Jennifer Leopold, A. Ambler

Computer Science Faculty Research & Creative Works

Visual programming languages have facilitated the application development process, improving our ability to express programs, as well as our ability to view, edit and interact with them. Yet even in programming environments, productivity is restricted by the primary input sources: the mouse and the keyboard. As an alternative, we investigate a program development interface which responds to the most natural human communication technologies: voice, handwriting and gesture. Speech- and pen-based systems have yet to find broad acceptance in everyday life because they are insufficiently advantageous to overcome problems with reliability. However, we believe that a visual programming environment with a …

A Concurrency Control Algorithm For An Open And Safe Nested Transaction Model, Sanjay Kumar Madria

Computer Science Faculty Research & Creative Works

We present a concurrency control algorithm for an open and safe nested transaction model. We use prewrite operations in our model to increase the concurrency. Prewrite operations are modeled as subtransactions in the nested transaction tree. The subtransaction which initiates prewrite subtransactions are modelled as recovery point subtransaction. The recovery point subtransaction can release their locks before its ancestors commit. Thus, our model increases the concurrency in comparison to other nested transaction models. Our model is useful an environment of long-running transactions common in object oriented databases, computer aided design and in the software development process

High-Order Object Model Based Software Analysis, Xiaoqing Frank Liu, Hungwen Lin

Computer Science Faculty Research & Creative Works

The integration of object oriented modeling and structured analysis (SA) for developing a well structured object oriented software system is a challenge for requirements analysts and software designers. Some of the existing object oriented modeling techniques adopt approaches that are very different from SA, and others have clumsily stayed with SA after a few modifications. Our High Order Object Modeling Technique (HOOMT) however, attempts to strike a mean between both extremes while at the same time provides an effective modeling method. HOOMT consists of two models, the High Order Object Model and the Object Information Flow Model. By using the …

Rmesh Algorithms For Parallel String Matching, Hsi-Chieh Lee, Fikret Erçal

Computer Science Faculty Research & Creative Works

String matching problem received much attention over the years due to its importance in various applications such as text/file comparison, DNA sequencing, search engines, and spelling correction. Especially with the introduction of search engines dealing with tremendous amount of textual information presented on the world wide web and the research on DNA sequencing, this problem deserves special attention and any algorithmic or hardware improvements to speed up the process will benefit these important applications. In this paper, we present three algorithms for string matching on reconfigurable mesh architectures. Given a text T of length n and a pattern P of …

Clusters Of Stars, Ileana Streinu

Computer Science: Faculty Publications

We solve two open problems posed by Goodman and Pollack[GP84] about sets of signed circular permutations (clusters of stars) arising from generalized configurations of points: recognition and efficient reconstruction (drawing). As a biproduct we get an O(n2) space data structure constructible in O(n2) time, representing the order type of a (generalized) configuration of points and from which the orientation of each triple can be found in constant time, a problem posed in [EHN].

Vertex-Edge Pseudo-Visibility Graphs: Characterization And Recognition, Joseph O'Rourke, Ileana Streinu

Computer Science: Faculty Publications

We extend the notion of polygon visibility graphs to pseudo-polygons defined on generalized configurations of points. We consider both vertex-to-vertex, as well as vertex-to-edge visibility in pseudo-polygons. We study the characterization and recognition problems for vertex-edge pseudo-visibility graphs. Given a bipartite graph G satisfying three simple properties, which can all be checked in polynomial time, we show that we can define a generalized configuration of points and a pseudo-polygon on it, so that its vertex-edge pseudo-visibility graph is G. This provides a full characterization of vertex-edge pseudo-visibility graphs and a polynomial-time algorithm for the decision problem. It also implies that …

Physical Media Independence: System Support For Dynamically Available Network Interfaces, Jon Inouye, Jim Binkley, Jonathan Walpole

Computer Science Faculty Publications and Presentations

Advances in hardware technology has fueled the proliferation of dynamically configurable network interface cards. This empowers mobile laptop users to select the most appropriate interface for their current environment. Unfortunately, the majority of system software remains "customized" for a particular network configuration, and assumes many network characteristics remain invariant over the runtime of the software. Physical Media Independence (PMI) is the concept of making assumptions about a particular device explicit, detecting events which invalidate these assumptions, and recovering once events are detected. This paper presents a model supporting PMI. Based on device availablilty, the model identifies implicit device-related assumptions made …

A Migratable User-Level Process Package For Pvm, Ravi Kunuru, Steve Otto, Jonathan Walpole

Computer Science Faculty Publications and Presentations

Shared, multi-user, workstation networks are characterized by unpredictable variability in system load. Further, the concept of workstation ownership is typically present. For efficient and unobtrusive computing in such environments, applications must not only overlap their computation with communication but also redistribute their computations adaptively based on changes in workstation availability and load. Managing these issues at application level leads to programs that are difficult to write and debug. In this paper, we present a system that manages this dynamic multi-processor environment while exporting a simple message-based programming model of a dedicated, distributed memory multiprocessor to applications. Programmers are thus insulated …

A Hypermedia Database To Manage World-Wide-Web Documents, Schubert Shou Boon Foo, Ee Peng Lim

Research Collection School Of Computing and Information Systems

The surge of interest in the World-Wide-Web (WWW) with its potential commercial payoff has resulted in an explosion of information as organisations join in to publish and do business on the Internet. A related development, Intranet, which basically uses the same technology to build private corporate WWW-based networks, has emerged to provide cost-effective and efficient groupware and information management solutions for organisations. As a result, the Hyper Text Markup Language (HTML), used for constructing WWW documents, has become a contender for authoring future office documents. With this scenario, this study examines WWW practices and highlights the inadequacy and drawbacks of …

Managing World Wide Web Publications, Schubert Foo, Ee Peng Lim

Research Collection School Of Computing and Information Systems

The surge of interest in the World Wide Web (WWW), with its potential commercial payoff, has resulted in an explosion of information as organizations join in the fray to publish and do business on the Internet. In addition, Intranet, the private corporate WWW‐based network, has also emerged to provide cost‐effective and efficient groupware and information management solutions for organizations. As a result, the HyperText Markup Language used for constructing WWW documents has become a contender for authoring future office documents. Examines the current practices of WWW publishing and highlights its inadequacies and drawbacks. Demonstrates the need and advantages of using …

Lyceum: A Multi-Protocol Digital Library Gateway, Ming-Hokng Maa, Michael L. Nelson, Sandra L. Esler

Computer Science Faculty Publications

Lyceum is a prototype scalable query gateway that provides a logically central interface to multi-protocol and physically distributed, digital libraries of scientific and technical information. Lyceum processes queries to multiple syntactically distinct search engines used by various distributed information servers from a single logically central interface without modification of the remote search engines. A working prototype (http://www.larc.nasa.gov/lyceum/) demonstrates the capabilities, potentials, and advantages of this type of meta-search engine by providing access to over 50 servers covering over 20 disciplines.

The Hadamard Matroid And An Anomaly In Its Single Element Extensions, C. H. Cooke

Mathematics & Statistics Faculty Publications

A nonstandard vector space is formulated, whose bases afford a representation of what is called a Hadamard matroid, M_p. For prime p, existence of M_p is equivalent to the existence of both a classical Hadamard matrix H(p,p) and a certain affine resolvable, balanced incomplete block design AR(p). An anomaly in the representable single element extension of a Hadamard matroid is discussed.

Webassess, Justin Anthony Brown

Theses : Honours

This project and research has resulted in the development of a World Wide Web (WWW) based testing system. WEBassess can be accessed and used from any point in the world that has a connection to the WWW. The WEBassess system allows for the creation and completion of tests through the WWW interface. Scoring and feedback of submitted tests is completely automated, allowing students to see their test result immediately, including visual indicators for correct and incorrect answers. These test results may then be viewed by academic staff, showing complete test details, such as unit code, test title, score, percentage, date …

The Toysim Project, Anthony Rodriguez

Theses : Honours

No abstract provided.