Digital Commons Network^™

An O(H^6) Quintic Spline Collocation Method For Second Order Two-Point Boundary Value Problems, M. Irodotou-Ellina, Elias N. Houstis, S. B. Kim

Department of Computer Science Technical Reports

No abstract provided.

Parity Retransmission Hybrid Arq Using Rate 1/2 Convolutional Codes On A Nonstationary Channel, L. R. Lugand, D. J. Costello, Jr., Robert H. Deng

Research Collection School Of Computing and Information Systems

A parity retransmission hybrid automatic repeat request (ARQ) scheme is proposed which uses rate 1/2 convolutional codes and Viterbi decoding. A protocol is described which is capable of achieving higher throughputs than previously proposed parity retransmission schemes. The performance analysis is based on a two-state Markov model of a nonstationary channel. This model constitutes a first approximation to a nonstationary channel. The two-state channel model is used to analyze the throughput and undetected error probability of the protocol presented when the receiver has both an infinite and a finite buffer size. It is shown that the throughput improves as the …

Performability Evaluation Of Gracefully Degradable Systems, Christoph W. Lindemann

Department of Computer Science Technical Reports

No abstract provided.

Simulated Annealing On Np-Complete Problems, Russell W. Howell

ACMS Conference Proceedings 1989

The Random House Dictionary defines anneal as " ... to free (glass, metals, etc.) from internal stress by heating and gradually cooling." In the physical world, impurities are annealed out of a substance by heating it to a high temperature. As it is cooled, its molecular structure gradually settles into a stable "low-energy" configuration. It is important to cool the substance slowly, especially at lower temperatures, so that impurities do not get "frozen" into place. With careful cooling, a low-energy state can eventually be reached. This state may not be the one with the lowest potential energy, where the spins …

Strokes For Representing Univariate Vector Field Maps, David Fowler, Colin Ware

Center for Coastal and Ocean Mapping

Particle systems make an excellent tool for creating tracks (which we call strokes) in vector fields. The question addressed in this paper is how such tracks should be made to vary in size and colour in order to reveal properties such as local direction and strength of the field. We find that for strokes that vary from large to small, direction is indicated by the large end. We also find that for strokes that vary in colour, the colour of the background is the most important determinant of perceived direction.

Displaying Correlations Using Position, Motion, Point Size Or Point Colour, Serge Limoges, Colin Ware, William Knight

Center for Coastal and Ocean Mapping

An empirical study is presented which explores the use of motion, point size and grey scales for the display of statistical data; specifically, the perception of correlations between variables. The task is to measure the subject's ability to perceive differences between high correlation and low correlation for a two dimensional plot presented in different ways. One variable is always mapped to position with respect to the x axis while the other is mapped to one of six different display parameters depending on experimental condition; namely: position with respect to the y axis, frequency, phase, and amplitude of oscillation, greyscale value …

Escim: A System For The Investigation Of Meaningful Motion, Siew Hong Yang, Colin Ware

Center for Coastal and Ocean Mapping

A language is described whose purpose is the investigation of meaningful motion using Stimulus Response animation techniques. The language is capable of adjusting the shape, size and velocity of an actor in real-time computer animation. Some results are presented showing how it is possible to generate such behaviours as chasing, avoidance and hitting using this animation technique. A set of primitives are presented which we find invaluable in the control of size, stretch and velocity parameters when attempting to produce fluid and meaningful interactions.

Towards A Bound For The Compression Of The Lzw Algorithm, Anoop Kumar Srivastava, Shinu Gupta

Theses

The LZW algorithm is a well known efficient adaptive compression algorithm. It is based on constructing a dictionary containing character strings from the text. A number of researchers have attempted to add variations to the original algorithm to achieve higher compression values. In this thesis we attempt to find a bound for the LZW approach. That is, we build a dictionary which gives maximum compression and satisfies prefix property of LZW algorithm.

In order to build such an optimum dictionary, the dynamic programming technique is applied. The final dictionary selected consists of entries which give maximum overall compression and also …

Cascading Lzw Algorithm With Huffman Coding : A Variable To Variable Length Compression Algorithm, Ashish Khandubhai Mehta

Theses

Two common schemes in data compression are fixed to variable length coding and variable to fixed length coding. Higher compression is expected from the more flexible scheme of variable to variable length coding. In such a scheme a compression dictionary is used to transfer variable length string over the text alphabet into variable length strings over the coding alphabet. The compression is achieved due to matching longer more frequent text strings with shorter coding strings.

To obtain a variable to variable length coding we choose to cascade the LZW , variable to fixed , coding with the Huffman , fixed …

Supporting Value Dependency For Nested Transactions In Interbase, Ahmed K. Elmagarmid, Weimin Du

Department of Computer Science Technical Reports

No abstract provided.

Automated Translation Of Digital Logic Equations Into Optimized Vhdl Code, John Evan Stark, George Winston Zobrist

Computer Science Technical Reports

It was desired to develop an algorithm for the automated translation of finite slate machines from state table form to optimized VHDL form. To do this, algorithms arc needed for reducing the state machine to simplest form, making state assignments, producing minimal logic equations to represent the state machine, and producing VHDL code which describes the intended circuit. Various such algorithms were examined and a prototype program written to perform this translation.

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, May 1989, 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.

Scientific Computing In The Soviet Union, Seymour E. Goodman, William Mchenry, Peter Wolcott

Information Systems and Quantitative Analysis Faculty Publications

In the last decade, the Soviet Union has placed increased emphasis on the development of high-speed computers and networks for use in scientific, economic, and military applications. When Communist Party General Secretary Mikhail Gorbachev labeled supercomputer development a "top priority task for our science and economy" in April, 1987, he added new urgency to the production of machines that would both support activities in these applications and also serve as high-profile standard-bearers for perestroika, his program of restructuring and modernization for the nation. The Soviets have also undertaken some major projects in networking, including the creation of a nationwide packet-switched …

Constructing Trees In Parallel, Mikhail J. Atallah, S. R. Kosaraju, L. L. Larmore, G. L. Miller

Department of Computer Science Technical Reports

No abstract provided.

High Rate Concatenated Coding Systems Using Bandwidth Efficient Trellis Inner Codes, Robert H. Deng, D. J. Costello, Jr.

Research Collection School Of Computing and Information Systems

High-rate concatenated coding systems with bandwidth-efficient trellis inner codes and Reed-Solomon (RS) outer codes are investigated for application in high-speed satellite communication systems. Two concatenated coding schemes are proposed. In one the inner code is decoded with soft-decision Viterbi decoding, and the outer RS code performs error-correction-only decoding (decoding without side information). In the other the inner code is decoded with a modified Viterbi algorithm, which produces reliability information along with the decoded output. In this algorithm, path metrics are used to estimate the entire information sequence, whereas branch metrics are used to provide reliability information on the decoded sequence. …

Quadric And Cubic Hypersurface Parameterization, Chanderjit Bajaj

Department of Computer Science Technical Reports

No abstract provided.

In The Image Of Man: Reflections On Artificial Intelligence, Noreen L. Herzfeld

Theology Faculty Publications

No abstract provided.

Parameter Non-Stationarity In A Model To Estimate The Business Value Of Information Technology, Robert J. Kauffman

Research Collection School Of Computing and Information Systems

Developing robust and refined measures to quantify strategic impacts is a major challenge facing researchers who seek to improve methods for IT investment evaluation. This paper presents a means to test for parameter "non-stationarity" in a model which quantifies the strategic contribution of IT. An iterative "jackknife" procedure is used to diagnose if different local competitive and demographic conditions present in branch banking enhance or suppress leverage on deposit market share associated with membership in an ATM network. Preliminary results suggest this approach will be useful for managers who need to evaluate similar ITs which operate in different environments.

Approximate Delay Analysis Of Transaction Oriented Communication In A Distributed System, Dan C. Marinescu

Department of Computer Science Technical Reports

No abstract provided.

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, March 1989, 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.

Automatic Load Balanced Partitioning Strategies For Pde Computations, N. P. Chrisochoides, C. E. Houstis, Elias N. Houstis, S. K. Kortesis, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Local Perimeterization, Implicitization And Inversion Of Real Algebraic Curves, Chanderjit Bajaj

Department of Computer Science Technical Reports

No abstract provided.

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, February 1989, 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.

Sequence Comparison Of The Connection Machine, Mikhail J. Atallah, Scott Mcfaddin

Department of Computer Science Technical Reports

No abstract provided.

Critical Path Analysis Of Real-Time Ada Programs, Dan C. Marinescu, Ryan Stansifer

Department of Computer Science Technical Reports

No abstract provided.

On Variable Radius Blending Using Dupin Cyclides, Vijaya Chandru, Debasish Dutta, Christoph M. Hoffmann

Department of Computer Science Technical Reports

No abstract provided.

Enhancing Manufacturing Planning And Control Systems Through Artificial Intelligence Techniques, Ronald S. Dattero, John J. Kanet, Edna M. White

MIS/OM/DS Faculty Publications

Manufacturing planning and control systems are currently dominated by systems based upon Material Requirements Planning (MRP). MRP systems have a number of fundamental flaws. A potential alternative to MRP systems is suggested after research into the economic batch scheduling problem.

Based on the ideas of economic batch scheduling, and enhanced through artificial intelligence techniques, an alternative approach to manufacturing planning and control is developed. A framework for future research on this alternative to MRP is presented.

A Logic Programming Elucidation Of Oda - Document Descriptions And Processes, Howard A. Blair, Allen Brown Jr.

Electrical Engineering and Computer Science - Technical Reports

We are pursuing a programme of research in document representation. The principal aim of this research is to develop a document description language that has a precise formal semantics, that is fully expressive of the constructs typical of traditional (procedural) document description languages, that is constraint-based, and that cleanly separates specifications of form and content. The research is currently in the first of three envisioned three phases. In the first phase we are formalising the Office Document Architecture (ODA) by faithfully translating ODA document descriptions into logic programmes. The transition utilizes highly restricted forms of Prolog programmes.1 In the second …

Augustine’S Mathematical Realism, Paul Zwier

ACMS Journal 2004

This paper begins by outlining an argument advanced against mathematical realism by Philip Kitcher. It then sketches the life and work of the great Christian philosopher and theologian, Augustine of Hippo. It discusses Augustine’s view that there exist eternal ideas in the mind of God that God used as templates in his creation of material objects. Among these are ideas about numbers and other mathematical objects. It also discusses Augustine’s understanding of how human beings have access to such ideas. It concludes with a discussion of some possible objections to Augustine’s perspective.

The Fourth Dimension And The Theology Of Edwin Abbott Abbott, Thomas Banchoff

ACMS Journal 2004

This paper is a brief biography of Edwin Abbott Abbott, author of Flatland, and a sketch of the main ideas in the book. It also incorporates some personal reflections.