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

Computer Sciences Commons

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

Mathematics

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 2101 - 2130 of 2384

Full-Text Articles in Computer Sciences

Temporal Flocking And Cacophony Simulating Agent Communication In A Noisy Environment, Jessica R. Crawford Apr 1997

Temporal Flocking And Cacophony Simulating Agent Communication In A Noisy Environment, Jessica R. Crawford

Honors Theses

Realistic communication is one of the most difficult aspects of simulating group behavior because the patterns produced by group communication are complex and not easily definable. In this paper, we present a model, developed using artificial life methodology, for creating simulations of group communication. Our model employs autonomous, artificial agents to produce emergent group behavior that resembles the communication patterns of a group, specifically, a flock of birds. Each agent collects information about its environment and its neighbors and follows a set of rules designed to meet both group goals and individual agent goals. Because we seek to establish emergent …


On The Automatic Generation Of Network Protocol Simulators, Andrew Chen Apr 1997

On The Automatic Generation Of Network Protocol Simulators, Andrew Chen

Honors Theses

Computers communicate with each other over various communication networks via a language known as a protocol. The design of the protocol can have a significant impact on the efficiency (and effectiveness) of the network. Because building an actual network to test the performance (and reliability) of a new protocol is rather expensive and time consuming, there is an interest in simulating network protocols in order to determine how efficient the communication network is. We are therefore interested in automatically generating simulators that could measure the performance of the new protocols. There are two main parts to this project. The first …


Parallel Programming, Peter Dailey Apr 1997

Parallel Programming, Peter Dailey

Honors Theses

The speed of technology is always increasing, especially in the field of computing. Unfortunately, the size of the problems needing to be solved are also growing in many areas. In order to keep up with this, parallel computing has become an important research area. The term parallel computing essentially refers to using multiple processors cooperating to solve a problem. For certain problems this can speed up the solution by a factor ofN, the number of processors being used. There are algorithms, for which there is no speed increase due to certain dependencies.


Circles Of The Gods: Copernicus, Kepler, And The Ellipse, Owen Gingerich Mar 1997

Circles Of The Gods: Copernicus, Kepler, And The Ellipse, Owen Gingerich

ACMS Conference Proceedings 1997

No abstract provided.


Peak-To-Mean Power Control And Error Correction For Ofdm Transmission Using Golay Sequences And Reed-Muller Codes, James A. Davis, J Jedwab Feb 1997

Peak-To-Mean Power Control And Error Correction For Ofdm Transmission Using Golay Sequences And Reed-Muller Codes, James A. Davis, J Jedwab

Department of Math & Statistics Faculty Publications

A coding scheme for OFDM transmission is proposed, exploiting a previously unrecognised connection between pairs of Golay complementary sequences and second-order Reed-Muller codes. The scheme solves the notorious problem of power control in OFDM systems by maintaining a peak-to-mean envelope power ratio of at most 3dB while allowing simple encoding and decoding at high code rates for binary, quaternary or higher-phase signalling together with good error correction.


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

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 …


Random Walks On Wheels, Matthew Lee, Mark Stamp Jan 1997

Random Walks On Wheels, Matthew Lee, Mark Stamp

Faculty Publications, Computer Science

Suppose two particles occupy distinct vertices of a wheel graph and at each step the two particles move independently to adjacent vertices. In this paper we find the expected number of moves until the particles land on the same vertex.


Mathematics At Chartres Cathedral, Richard Stout Jan 1997

Mathematics At Chartres Cathedral, Richard Stout

ACMS Journal 2004

Chartres Cathedral is highly regarded as a magnificent Gothic structure including beautiful stained glass windows and striking sculptures. Mathematics, especially geometry, played a central role in the design of this cathedral. This paper explores that mathematics and how it contributes to the overall effectiveness of the design.


Mathematics And Values: Can Philosophy Guide Projects?, Michael H. Veatch Jan 1997

Mathematics And Values: Can Philosophy Guide Projects?, Michael H. Veatch

ACMS Journal 2004

The philosophy of mathematics has provided insight on questions of foundations and mathematical truth; however, it has not been very fruitful in guiding the practice of mathematics. This paper attempts to find points of contact between a Christian worldview and the choice of mathematical projects and methods. Three areas are considered: (i) dubitability in current research, (ii) the intrinsic value of contemporary mathematics to contemporary society, and (iii) the affirmation of human value in the use of mathematics. Finally, a framework for valuing mathematics is proposed as an encouragement to think more deeply about how a Christian might choose a …


Genetic Algorithms: A Visual Search, Paul W. Jones Jan 1997

Genetic Algorithms: A Visual Search, Paul W. Jones

Honors Theses, 1963-2015

Genetic algorithms apply the biological principles of selection, mutation, and crossover to a population set containing individuals representing target solutions to a given problem. Using these principles genetic algorithms attempt to create a migration of the individuals in subsequent generations toward the optimal solution.

This project is an attempt to visually represent the progress of a genetic algorithm. The coordinate fitness program attempts to find the maximum or minimum value of a given function. It visually represents the progress of the algorithm by providing a plot of each individual in each generation in time. It is then possible to view …


Resolution Of Local Inconsistency In Identification, Douglas Ray Anderson, Martin Zwick Jan 1997

Resolution Of Local Inconsistency In Identification, Douglas Ray Anderson, Martin Zwick

Complex Systems Faculty Publications and Presentations

This paper reports an algorithm for the resolution of local inconsistency in information-theoretic identification. This problem was first pointed out by Klir as an important research area in reconstructability analysis. Local inconsistency commonly arises when an attempt is made to integrate multiple data sources, i.e., contingency tables, which have differing common margins. For example, if one ha)s an AB table and a BC table, the B margins obtained from the two tables may disagree. If the disagreement can be assigned to sampling error, then one can arrive at a compromise B margin, adjust the original AB and BC tables to …


Some Applications Of Sophisticated Mathematics To Randomized Computing, Ronald I. Greenberg Aug 1996

Some Applications Of Sophisticated Mathematics To Randomized Computing, Ronald I. Greenberg

Computer Science: Faculty Publications and Other Works

No abstract provided.


Communication Games, Kimberly I. Noonan May 1996

Communication Games, Kimberly I. Noonan

Honors Theses

A communication game combines traditional n-person game theory with graph theory. The result is a model of a bargaining situation where communication is restricted. The game's multilinear extension (MLE), a polynomial that summarizes the solutions of the game, is well known for the case where the graph is a tree or simple cycle. This paper simplifies the computation of MLE of the communication game in the case when the graph is a series of simple cycles. The results are then applied to studying the power of each Canadian province in passing an amendment to the constitution, taking geographic location into …


Ideals Of The Lipschitz Class, Konstantin G. Kulev May 1996

Ideals Of The Lipschitz Class, Konstantin G. Kulev

Honors Theses

In this paper, a classification of the closed ideals of the Little Oh Lipschitz class of functions on the interval [0,1] is provided. The technique used to classify the ideals of the class of continuous functions is modified and applied to the Little Oh Lipschitz class. It is shown that every ideal of these two classes has the form I = {f : flE = 0} for some closed set E C [0, 1]. Furthermore, it is demonstrated that the same technique cannot be successfully applied to the classification of the closed ideals of the Big Oh Lipschitz class.


Banach Spaces Of Analytic Functions, Michael T. Nimchek May 1996

Banach Spaces Of Analytic Functions, Michael T. Nimchek

Honors Theses

In this paper, we explore certain Banach spaces of analytic functions. In particular, we study the space A-1, demonstrating some of its basic properties including non-separability. We ask the question: given a class C of analytic functions on the unit disk D and a sequence [Zn] = 0 for all n? Finally, we explore Mz invariant subspaces of A-1, demonstrating that they may possess the codimension-2 property.


The Use Of Non-Commutative Algebra In Cryptographically Secure Pseudo-Random Number Generators, Brian M. Mckeever May 1996

The Use Of Non-Commutative Algebra In Cryptographically Secure Pseudo-Random Number Generators, Brian M. Mckeever

Honors Theses

This thesis begins with a general overview of pseudo-random number generators and some of their applications. This thesis then describes their applications to cryptography, and some additional requirements imposed by cryptography. This thesis then provides an introduction to the ring of quaternions, and discusses how they can be included in pseudo-random number generators. Finally, this thesis provides a description of the performance of these generators.


Application Of Neural Networks To The Non-Destructive Testing Of Aluminum Cans, B. Balasubramaniam, Daniel .. Clair May 1996

Application Of Neural Networks To The Non-Destructive Testing Of Aluminum Cans, B. Balasubramaniam, Daniel .. Clair

Computer Science Technical Reports

Neural Networks are used to c lassify aluminum beverage containers as acceptable or non acceptable, depending upon their wall thicknesses. For each can, the thickness of the wall of the can at different points is measured using a non-destructive, ultra-sound technique. These measureI\}ents are then applied as inputs to the networks and the classification is provided as the output Three architectures, one unsupervised and two supervised, are tested. Their performances are analyzed and compared and the paradigm best suited to the problem is selected.


Computer Assisted Control Of Robotic Rock Drilling Equipment Using Rock Face Image Mapping, William Robert Macneil, Peter (C. Y.)(Chung You) Ho May 1996

Computer Assisted Control Of Robotic Rock Drilling Equipment Using Rock Face Image Mapping, William Robert Macneil, Peter (C. Y.)(Chung You) Ho

Computer Science Technical Reports

Use of a totally unmanned mining robot is an ideal solution in removing humans from the dangerous underground mining environment. However, a complete autonomous system is a long way from reality. In the meantime, steps towards that goal can be made and integrated into current mining technology to take away some of the risk and stress from the miner making him more alert and the environment safer for those that do have to be undergroμnd. For our purposes here, the machine will be an automated robotic platform with the intelligence necessary for accurate placement of the drill tip on an …


How I Got Gnarly, Rudy Rucker May 1996

How I Got Gnarly, Rudy Rucker

SWITCH

The article describes how Rudy Rucker’s curious interest in celluar automata led to his career in mathematical computer science at San José State University. After conducting interviews on the theory of cellular automata as a freelance writer, he felt compelled to be involved in this great intellectual revolution in computer-aided experimental mathematics. Committed to reinventing himself, Rucker's interactions with mathematicians inspired him to write “Mind Tools”, a book that surveys mathematics from the standpoint that is information. After publishing his book, in 1987, he was eventually offered a position at SJSU in the Mathematics and Computer Science department. With assistance …


Tests Of Random Number Generators Using Ising Model Simulations, Paul D. Coddington Jan 1996

Tests Of Random Number Generators Using Ising Model Simulations, Paul D. Coddington

Northeast Parallel Architecture Center

Large-scale Monte Carlo simulations require high-quality random number generators to ensure correct results. The contrapositive of this statement is also true – the quality of random number generators can be tested by using them in large-scale Monte Carlo simulations. We have tested many commonly used random number generators with high precision Monte Carlo simulations of the 2-d Ising model using the Metropolis, Swendsen-Wang, and Wolff algorithms. This work is being extended to the testing of random number generators for parallel computers. The results of these tests are presented, along with recommendations for random number generators for high-performance computers, particularly for …


Data Compression Based On The Cubic B-Spline Wavelet With Uniform Two-Scale Relation, S. K. Yang, C. H. Cooke Jan 1996

Data Compression Based On The Cubic B-Spline Wavelet With Uniform Two-Scale Relation, S. K. Yang, C. H. Cooke

Mathematics & Statistics Faculty Publications

The aim of this paper is to investigate the potential artificial compression which can be achieved using an interval multiresolution analysis based on a semiorthogonal cubic B-spline wavelet. The Chui-Quak [1] spline multiresolution analysis for the finite interval has been modified [2] so as to be characterized by natural spline projection and uniform two-scale relation. Strengths and weaknesses of the semiorthogonal wavelet as regards artificial compression and data smoothing by the method of thresholding wavelet coefficients are indicated.


Secure Trapdoor Hash Functions Based On Public-Key Cryptosystems, Gary R. Greenfield, Sarah Agnes Spence Dec 1995

Secure Trapdoor Hash Functions Based On Public-Key Cryptosystems, Gary R. Greenfield, Sarah Agnes Spence

Department of Math & Statistics Technical Report Series

In this paper we systematically consider examples representative of the various families of public-key cryptosystems to see if it would be possible to incorporate them into trapdoor hash functions, and we attempt to evaluate the resulting strengths and weaknesses of the functions we are able to construct. We are motivated by the following question:

Question 1.2 How likely is it that the discoverer of a heretofore unknown public-key cryptosystem could subvert it for use in a plausible secure trapdoor hash algorithm?

In subsequent sections, our investigations will lead to a variety of constructions and bring to light the non-adaptability of …


Virtual Celluoid, Switch Staffs Sep 1995

Virtual Celluoid, Switch Staffs

SWITCH

The article is an analysis of the author’s research pertaining to films relating to or containing the concept of virtual reality. The author lists several films such as Johnny Mnemnonic, Virtuosity, The Net, and Disclosure and provides a brief synopsis and review of each movie. Each film explains the concept of virtual reality through differing plots and methods such as cyberspace, progressive software, and artificial intelligence. The author also gives their own insight into and ratings of the films, explaining what they think is the most relatable in terms of overall storyline as well as how realisticly the movie portrays …


Vr Products, P.D. Quick Sep 1995

Vr Products, P.D. Quick

SWITCH

The article is an analysis of the author’s experience testing several virtual reality items at Siggraph, an annual convention displaying computer machinery and interactive technology products. The author explains each device and how they work, the company behind the invention, as well as how it can help with future technological advancements. Several products are explained in more depth; the i-Glasses by Virtual I/O, Red Planet by Virtual World Entertainment Inc., Venturer S-2 by Thomson Entertainment Systems, and several more. Each item explores virtual reality in differing ways such as interactive video games, more user-friendly 3D modeling, and virtual movie theater …


An Object Oriented Implemtation Of Fractal Image Compression, Darrell Burkhead Jul 1995

An Object Oriented Implemtation Of Fractal Image Compression, Darrell Burkhead

Masters Theses & Specialist Projects

The technique of Fractal Image Compression, although new, has been described in several ways. Thus far, all descriptions of this compression algorithm read by the author have been in procedural form. The purpose of this paper is to present the Fractal Image Compression algorithm in an object-oriented form and to point out the advantages of this organization. The main advantages of taking an object-oriented approach to this problem are flexibility and maintainability. Different aspects of this algorithm are handled by different objects, thereby allowing for easy customization and testing of each part. Another advantage of this approach is that the …


Mathematics From The Viewpoint Of Science In Context, Johan Deklerk Jun 1995

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 Jun 1995

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 Jun 1995

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 Jun 1995

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 Jun 1995

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.