Digital Commons Network^™

Computational Science And The Future Of Computing Research, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Experimental Study Of Tcp And Udp Protocols For Future Distributed Databases, Xiangning Liu, Lebin Cheng, Bharat Bhargava, Zhiyuan Zhao

Department of Computer Science Technical Reports

No abstract provided.

Frequency Computation And Bounded Queries (Conference Paper), William I. Gasarch, Efim Kinber

School of Computer Science & Engineering Faculty Publications

There have been several papers over the last ten years that consider the number of queries needed to compute a function as a measure of its complexity. The following function has been studied extensively in that light: FaA(x1, …, xa)=A(x1)···A(xa). We are interested in the complexity (in terms of the number of queries) of approximating FaA. Let b⩽a and let f be any function such that FaA(x1, …, x a) and f(x1, …, xa) agree on at least b bits. For a general set A we have matching upper and lower bounds that depend on coding theory. These are applied …

Matching And Indexing Techniques In Rules, Madhav Moganti

Computer Science Technical Reports

Rules are widely used in present-day intelligent systems for modeling intelligent behavior, building expert systems, database rule systems, and advanced document retrieval systems. Most rule-based system programs are extremely computation-intensive and run quite slowly. This problem may get still worse when a rulebase does not fit into primary memory completely. This article reviews currently existing rule matching and indexing techniques. This report is organized into two parts. Part I presents the well known rule matching algorithms, Rete and TREAT, along with their performance evaluations. Part II presents rule indexing techniques for large scale rulebases. Here two sources of indexing are …

Comparison Of System Identification Techniques For The Dexterous Orbital Servicing System (Doss), Allan Terrence Morris

Electrical & Computer Engineering Theses & Dissertations

The major contribution of system identification is the development of analytical models of a system. Many identification techniques can adequately describe the input and output map. One of the challenges of these techniques is to correctly infer from the measured data the characteristics of the individual, contributing components producing a more accurate system model.

In this thesis linear, dynamic, multivariable state-space models for three joints of the Dexterous Orbital Servicing System (DOSS) are identified. DOSS is a representative space station manipulator at the NASA Langley Research Center. The dynamic models of the manipulator will first be estimated by applying nonparametric …

Fault Tolerance In Critical Real-Time Systems, Balaji Tirukarneswaran

Electrical & Computer Engineering Theses & Dissertations

Critical real-time applications require work to be completed before a predefined deadline, else the consequences may be catastrophic. The anticipation of faults in such systems necessitates the need for fault tolerance. Fault tolerance can be achieved in many different ways. A real-time system designer may impose restrictions on any of the system performance measures such as the latency, throughput and number of processors, depending on the type of application. In this work, several different fault tolerant strategies for any given DFG (Data Flow Graph) are discussed. DFG models are developed using the strategies and the resulting worst case performances a.re …

Parallel Fast Multipole Algorithm Using Mpi, Daniel Okunbor, Eric Jui-Lin Lu

Computer Science Technical Reports

The simulation of many-body, many-particle system has a wide range of applications in area such as biophysics, chemistry, astrophysics, etc. It is known that the force calculation contributes ninety percent of the simulation time. This is mainly due to the fact that the total number of interactions in the force is 0( N 2 ), where N is the number of particles in the system. The fast multipole algorithm, proposed by Greengard and Rokhlin, reduces the time complexity of the force calculation to O(N). We implement the fast multipole algorithm, using MPI, based on optimal communication scheme which minimizes the …

Deciding Finiteness For Matrix Groups Over Function Fields, Robert Beals, Daniel N. Rockmore, Ki-Seng Tan

Computer Science Technical Reports

Let S be any finite subset GLn(F(t)) where F is a field. In this paper we give algorithms to decide if the group generated by S is finite. In the case of characteristic zero, slight modifications of earlier work of Babai, Beals and Rockmore [1] give polynomial time deterministic algorithms to solve this problem. The case of positive characteristic turns out to be more subtle and our algorithms depend on a structure theorem proved here, generalizing a theorem of Weil. We also present a fairly detailed analysis of the size of finite subgroups in this case and give bounds which …

A Multiple Discrete Pass Algorithm On A Dec Alpha 2100, Scott R. Cushman

Dartmouth College Undergraduate Theses

No abstract provided.

Simulation Of A Video-On-Demand System, Song Bac Toh

Dartmouth College Undergraduate Theses

This paper presents a simulation study of a video-on-demand system. The focus of the study is the effectiveness of different caching strategies on a video-on-demand system with two levels of cache, RAM and disks, in front of a tape library. Using an event-driven simulator, I show that caching was helpful in increasing the service capacity of the system. On-demand caching showed its advantages especially when the requests were clustered around a few popular titles (in other words, there was temporal locality).

Tias: A Transportable Intelligent Agent System, Kenneth Harker

Dartmouth College Undergraduate Theses

In recent years, there has been an explosive growth in the amount of information available to our society. In particular, the amount of information available on-line through vast networks like the global Internet has been growing at a staggering rate. This growth rate has by far exceeded the rate of growth in network speeds, as has the number of individuals and organizations seeking access to this information. There is thus a motivation to find abstract methods of manipulating this on-line data in ways that both serve the needs of end users efficiently and use network resources intelligently. In lieu of …

Mathematics From The Viewpoint Of Science In Context, Johan Deklerk

ACMS Conference Proceedings 1995

This is the first of a series of papers presented over several years by deKlerk exploring the notion of how mathematics might be taught from a Christian perspective. In this paper, he introduces the notion of context as the basis for such an approach. He then discusses seven contexts a teacher can employ.

Improving The Teaching Of Mathematics, David S. Moore

ACMS Conference Proceedings 1995

No one concerned about the teaching of college mathematics--and few mathematicians who are not concerned--can have missed the movement to reform teaching in the mathematical sciences at all levels. The teaching of any active branch of knowledge, like the church, is of course "reforming and ever to be reformed." Calls to modernize what we offer students are always with us. What is striking about the current reform movement is not only its momentum but the fact that it centers on pedagogy rather than on content. We ought, say the reformers, to radically alter our style of teaching. My purpose in …

Experimenting With The Calculus Laboratory Setting, Glen Van Brummelen

ACMS Conference Proceedings 1995

Reform of post-secondary mathematics education, particularly introductory calculus, is becoming commonplace across North America. Although there are many varieties of reform, most can be placed within the philosophical camp of social constructivism. According to this movement, mathematical knowledge is constructed in an interactive way through instructor-student and inter-student dialogue, rather than built in an axiomatic sense such as the "new math" of 20 years ago, or in the reductionistic, algorithmic sense dominant in secondary and introductory college mathematics. While I hold serious concerns about the relativizing of mathematical knowledge that occurs when social constructivism is adopted as a philosophy of …

What Does A Computer Program Mean? An Introduction To Denotational Semantics, Gene B. Chase

ACMS Conference Proceedings 1995

This paper is for mathematicians who are curious about how topology is being used to prove computer programs correct. Those advanced parts have been limited to Sections III, V, and VI, and they are marked by a [clock symbol]. By contrast, sections II, IV, and VII are suitable as a companion to existing textbooks in a Computer Science course such as Organization of Programming Languages, the course CS 8 as described in Curriculum [1979]. Perhaps in a first reading you might read just those sections.

Among many books and articles on the semantics, or meaning, of computer languages, …

Using Data To Develop Mathematical Methods, Philip R. Carlson

ACMS Conference Proceedings 1995

An analysis of ordered pairs and their scatter plots leads to interesting questions related to mathematical modeling. Some statistical methods suggest ways to approach this analysis of the ordered pairs. Both high school and college methods are illustrated in this paper.

The 25 Greatest Mathematicians, Robert Brabenec

ACMS Conference Proceedings 1995

Many have tried to determine the greatest mathematicians in history. The purpose of this paper is to consider making such a list, along with some criteria to consider in making a rank order of these mathematicians.

Mathematical And Theological Beliefs: A Cognitive Science Perspective, Ron Benbow

ACMS Conference Proceedings 1995

In recent years, research studies have shown that control decisions and processes, beliefs about the nature of mathematics, attitudes, and other affective variables have enormous impact on the mathematical performance of students. This paper gives an overview of the research on mathematical beliefs and reviews some work done in Christian education relating to theological beliefs. It then compares the two.

Parallel Processing In The Undergraduate Curriculum, William E. Toll

ACMS Conference Proceedings 1995

No abstract provided.

Drawing The Boundaries: Mathematical Statistics In Twentieth-Century America, Patti W. Hunter

ACMS Conference Proceedings 1995

No abstract provided.

A Course In Mathematical Recreations, Richard Laatsch

ACMS Conference Proceedings 1995

No abstract provided.

The Intermediate Value Theorem, Dale Varberg

ACMS Conference Proceedings 1995

The Intermediate Value Theorem (a continuous function on an interval assumes all values between any two of its values) is one of the big theorems of calculus. Yet the theorem is absent or briefly mentioned in most calculus textbooks. The theorem deserves better as we intend to show by listing ten picturesque consequences that we think could enliven any calculus course.

Constructivism, Mathematics Education And Christianity, Ted Watanabe

ACMS Conference Proceedings 1995

In this paper, I briefly describe what constructivism is and its implications in the field of mathematics education. I will then discuss what this epistemology may mean to Christians who are in the field of mathematics education

Statistics, Mathematics, And Teaching, David S. Moore

ACMS Conference Proceedings 1995

In discussing our teaching, we may focus on content, what we want our students to learn, or on pedagogy, what we do to help them learn. These two topics are of course related. In particular, changes in pedagogy are often driven in part by changing priorities for what kinds of things we want students to learn. It is nonetheless convenient to address content and pedagogy separately. Pedagogy, certainly the less specific of the two, is the topic of my second paper. This paper concerns content, and in particular contains one side of a conversation between a statistician and mathematicians …

The 25 Greatest Mathematicians, Robert L. Brabenec

ACMS Conference Proceedings 1995

No abstract provided.

Integration Methods For N-Body Problems, D. I. Okunbor

Computer Science Technical Reports

Particle simulation studies the time evolution of the dynamical state of a system of interacting particles by the computation of trajectories of particles based on the numerical integration of the Newton equations of motion. This approach is widely used in biomolecular modeling to study, for example, proteins; and in astrophysics to study gravitational N-body system. The dimension of this system of equations of motion is in the order of tens of thousands. To solve this system involves an enormous amount of computer time. Several techniques have been advanced to reduce the computational complexity of this problem. Some of which are: …

An Interactive Graphical User Interface Generator In The Client-Server Computational Model, Chavva Sudarshan

Masters Theses & Specialist Projects

Providing a user friendly and sophisticated user interface is a time-consuming and difficult task. On the other hand, the success of a software system is directly related to the quality of the user interface that it provides. In this thesis, a technique for the development of an automatic user interface is described and implemented; that is, we provide a tool that can be used to develop user interfaces on a platform known as the X-Window System. The hallmark of this tool is its ability to aid in developing reasonably sophisticated Graphical User Interfaces (GUI) interactively in relatively short time. The …

Introduction (1995), David L. Neuhouser

ACMS Conference Proceedings 1995

Tenth ACMS Conference on Mathematics from a Christian Perspective

Accessing Earth System Science Data And Applications Through High-Bandwidth Networks, R. Vetter, M. Ali, M. Daily, J. Gabrynowic, Sunil G. Narumalani, K. Nygard, W. Perrizo, P. Ram, S. Reichenbach, G. A. Seielstad, W. White

School of Computing: Faculty Publications

In this paper, we discuss gigabit network applications enabled by "Mission to Planet Earth," an international effort to monitor the Earth as a system. We describe the design of a network architecture to support applications developed as part of this program; introduce a new component, public access resource centers (PARC9s); and discuss how PARC's would facilitate access by users outside the traditional research community. We also describe how a particular class of users, agriculture users, might to Planet Earth program and delivered in a value-added form to them by a so-called AgPARC. The suggested architecture requires the deployment of high-bandwidth …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 11, Number 6, June 1995, 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.