Computer Sciences Commons^™

Using Mathematica To Explore Abstract Algebra, Al Hibbard

ACMS Conference Proceedings 1999

No abstract provided.

Book Review: Math: Facing An American Phobia By Marilyn Burns, Stephen L. Brown

ACMS Conference Proceedings 1999

No abstract provided.

On The Solutions Of A Family Of Sextic Thue Equations, Alain Togbe

ACMS Conference Proceedings 1999

No abstract provided.

Preface (1999), Association Of Christians In The Mathematical Sciences

ACMS Conference Proceedings 1999

Twelfth ACMS Conference on Mathematics from a Christian Perspective

Introduction (1999), Association Of Christians In The Mathematical Sciences

ACMS Conference Proceedings 1999

Twelfth ACMS Conference on Mathematics from a Christian Perspective

Schedule (1999), Association Of Christians In The Mathematical Sciences

ACMS Conference Proceedings 1999

Twelfth ACMS Conference on Mathematics from a Christian Perspective

Table Of Contents (1999), Association Of Christians In The Mathematical Sciences

ACMS Conference Proceedings 1999

Twelfth ACMS Conference on Mathematics from a Christian Perspective

Connectivity Of Cycle Matroids And Bicircular Matroids, Zhi-Hong Chen, Kuang Ying-Qiang, Hong-Jian Lai

Scholarship and Professional Work - LAS

A unified approach to prove former connectivity results of Tutte, Cunningham, Inukai and Weinberg, Oxley and Wagner.

Designing An Integrated Environment For Artificial Intelligence, Andrew B. Ritger '99

Honors Projects

The SHELLEY RESEARCH GROUP (part of the Illinois Wesleyan Intelligence Network on Knowledge -IWINK) has been in existence for several years, and has benefited immensely from various student contributors who have added such components as robotic arm control, cross platform networking, an artificially intelligent tic-tac-toe player, and an interactive teaching tool demonstrating the functionality of artificial neural networks. What is lacking, however, amidst these undergraduate contributions to the SHELLEY Project, is an effective means of integrating existing components into a single cohesive functional unit, let alone any easy means of making further contributions within a simple unified context. The focus …

Shout With The Largest Mob : Toward A Model For Primitive Communication In Mobile Automata, Rebecca A. Weber

Honors Theses

We consider the problem of simulating communication between independent, autonomous agents, or machines, using only local rules with no global control over the agents' behavior. First, we construct an algorithm by which the machines will avoid collisions with each other and with boundaries or obstacles. Noting that collision avoidance alone will not result in higher-level behavior, and with the goal of creating agents which would self-organize, we begin to develop a signalling system by which agents can communicate. This leads to a new method for modeling agent motion in the plane. Throughout, we are motivated by possible linkages between our …

An Examination Of Codewords With Optimal Merit Factor, Michael W. Cammarano, Anthony G. Kirilusha

Department of Math & Statistics Technical Report Series

We examine the codewords with best possible merit factor (minimum sum of squares of periodic autocorrelations) for a variety of lengths. Many different approaches were tried in an attempt to find construction methods for such codewords, or for codewords with good but non-optimal merit factors.

Prestructuring Neural Networks Via Extended Dependency Analysis With Application To Pattern Classification, George G. Lendaris, Thaddeus T. Shannon, Martin Zwick

Complex Systems Faculty Publications and Presentations

We consider the problem of matching domain-specific statistical structure to neural-network (NN) architecture. In past work we have considered this problem in the function approximation context; here we consider the pattern classification context. General Systems Methodology tools for finding problem-domain structure suffer exponential scaling of computation with respect to the number of variables considered. Therefore we introduce the use of Extended Dependency Analysis (EDA), which scales only polynomially in the number of variables, for the desired analysis. Based on EDA, we demonstrate a number of NN pre-structuring techniques applicable for building neural classifiers. An example is provided in which EDA …

Structure-Function Relationships In The Pulmonary Arterial Tree, Christopher A. Dawson, Gary S. Krenz, Kelly Lynn Karau, Steven Thomas Haworth, Christopher C. Hanger, John H. Linehan

Mathematics, Statistics and Computer Science Faculty Research and Publications

Knowledge of the relationship between structure and function of the normal pulmonary arterial tree is necessary for understanding normal pulmonary hemodynamics and the functional consequences of the vascular remodeling that accompanies pulmonary vascular diseases. In an effort to provide a means for relating the measurable vascular geometry and vessel mechanics data to the mean pressure-flow relationship and longitudinal pressure profile, we present a mathematical model of the pulmonary arterial tree. The model is based on the observation that the normal pulmonary arterial tree is a bifurcating tree in which the parent-to-daughter diameter ratios at a bifurcation and vessel distensibility are …

Can Mathematics Be Taught In A Christian Way?, Johan Deklerk

ACMS Journal 2004

Some people would argue that mathematics cannot be taught in a Christian way. Others would say it can be done, but that they are unsure how to do it, and therefore do not do it. Some methods mentioned from time to time will be briefly discussed in this address. The question will be asked whether these techniques bring one closer to a Christian perspective on mathematics. My view is that some of these methods are just not sufficient and that more should be done. More attention should be paid to the context in which a mathematical subject is imbedded. Attention …

Lewis Carroll: Author, Mathematician, And Christian, David L. Neuhouser

ACMS Journal 2004

Although a Christian, an author, and a mathematician, Charles Letwidge Dodgson (better known as Lewis Carroll) wrote very few works in which these three aspects of his person was present. The only examples of him merging these interests are in Sylvie and Bruno and Sylvie and Bruno Concluded. This paper will explore what motivated him to make these works and whether or not they were successful.

The Deconstruction Of Mathematics, David J. Stucki

ACMS Journal 2004

Mathematics, as an academic discipline, has stood for many years as the last bastion against a growing tide of intellectual relativism that has become all but ubiquitous. More recently, however, efforts have been made to "humanize" mathematics by advocating a social-constructivist approach to the philosophy of mathematics, both in practice and education. This paper is intended to serve as a critical response to one advocate of this approach, Reuben Hersh (What Is Mathematics, Really?, 1997), and in the process a defense of Platonism.

Method For Identification Of Origins Of Replication And Genes Regulated By Dnaa In Bacteria, Olga G. Troyanskaya

Honors Theses

The study is focused on developing computer programs to identify origin of DNA replication based on analysis of total bacterial genomes, scoring regions for number of DnaA binding sites, AT content, DNA adenine methylase boxes, and integration host factors binding sites. The programs were tested on cyanobacterium Synechocystis, and several potential origins were identified. However, no one definite region could be located. Currently, software is being developed to analyze common motifs around the origins of all bacteria with known origins. Genes whose transcription could be regulated by DnaA were identified by searching for DnaA boxes preceding promoter regions.

Even Subgraphs Of A Graph, Hong-Jian Lai, Zhi-Hong Chen

Scholarship and Professional Work - LAS

No abstract provided.

Locked And Unlocked Polygonal Chains In 3d, Therese Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Mark Overmars, Steve Robbins, Ileana Streinu, Godfried Toussaint, Sue Whitesides

Computer Science: Faculty Publications

In this paper, we study movements of simple polygonal chains in 3D. We say that an open, simple polygonal chain can be straightened if it can be continuously reconfigured to a straight sequence of segments in such a manner that both the length of each link and the simplicity of the chain are maintained throughout the movement. The analogous concept for closed chains is convexification: reconfiguration to a planar convex polygon. Chains that cannot be straightened or convexified are called locked. While there are open chains in 3D that are locked, we show that if an open chain has a …

Codes, Correlations And Power Control In Ofdm, James A. Davis, Jonathan Jedwab, Kenneth G. Paterson

Department of Math & Statistics Faculty Publications

Practical communications engineering is continually producing problems of interest to the coding theory community. A recent example is the power-control problem in Orthogonal Frequency Division Multiplexing (OFDM). We report recent work which gives a mathematical framework for generating solutions to this notorious problem that are suited to low-cost wireless applications. The key result is a connection between Golay complementary sequences and Reed-Muller codes. The former are almost ideal for OFDM transmissions because they have a very low peak-to-mean envelope power ratio (PMEPR), while the latter have efficient encoding and decoding algorithms and good error correction capability. This result is then …

Computational Geometry Column 35, Joseph O'Rourke

Computer Science: Faculty Publications

The subquadratic algorithm of Kapoor for finding shortest paths on a polyhedron is described.

(Ω, Ξ)-Logic: On The Algebraic Extension Of Coalgebraic Specifications, Rolf Hennicker, Alexander Kurz

Engineering Faculty Articles and Research

We present an extension of standard coalgebraic specification techniques for statebased systems which allows us to integrate constants and n-ary operations in a smooth way and, moreover, leads to a simplification of the coalgebraic structure of the models of a specification. The framework of (Ω,Ξ)-logic can be considered as the result of a translation of concepts of observational logic (cf. [9]) into the coalgebraic world. As a particular outcome we obtain the notion of an (Ω, Ξ)- structure and a sound and complete proof system for (first-order) observational properties of specifications.

Fan-Type Conditions For Collapsible Graphs, Zhi-Hong Chen

Scholarship and Professional Work - LAS

No abstract provided.

Octary Codewords With Power Envelopes Of 3∗2M, Katherine M. Nieswand, Kara N. Wagner

Department of Math & Statistics Technical Report Series

This paper examines codewords of length 2^m in Z₈ with envelope power maxima of 3 ∗ 2^m. Using the general form for Golay pairs as a base, a general form is derived for the set of coset leaders that generate these codewords. From this general form it will be proven that there exists at least one element in the coset that achieves a power of 3 ∗ 2^m for each m-even and m-odd case.

Maximally Disjoint Solutions Of The Set Covering Problem, David J. Rader, Peter L. Hammer

Mathematical Sciences Technical Reports (MSTR)

This paper is concerned with finding two solutions of a set covering problem that have a minimum number of variables in common. We show that this problem is NP­ complete, even in the case where we are only interested in completely disjoint solutions. We describe three heuristic methods based on the standard greedy algorithm for set covering problems. Two of these algorithms find the solutions sequentially, while the third finds them simultaneously. A local search method for reducing the overlap of the two given solutions is then described. This method involves the solution of a reduced set covering problem. Finally, …

Coupled Electrodynamic-Monte Carlo Simulations Of Nanoscale Gaas Terahertz Optical Mixers, Jiang Li

Electrical & Computer Engineering Theses & Dissertations

The concept of mixing or heterodyning has traditionally been used for microwaves and for radio frequency communications. However, the concept can easily be extended into the optical frequency regime. By doing so, the photomixing process can serve as a very versatile tool for both the generation of ultrahigh frequency (terahertz) and the detection of weak optical signals.

The aim of this thesis is to perform a theoretical study of the photomixing process inside GaAs devices as the non-linear elements. A coupled approach which combines the Monte Carlo simulation scheme for the carrier transport, with Maxwell's equation for the electrodynamics, has …

Representations, Approximations, And Algorithms For Mathematical Speech Processing, Laura R. Suzuki

Theses and Dissertations

Representing speech signals such that specific characteristics of speech are included is essential in many Air Force and DoD signal processing applications. A mathematical construct called a frame is presented which captures the important time-varying characteristic of speech. Roughly speaking, frames generalize the idea of an orthogonal basis in a Hilbert space, Specific spaces applicable to speech are L₂(R) and the Hardy spaces H_p(D) for p> 1 where D is the unit disk in the complex plane. Results are given for representations in the Hardy spaces involving Carleson's inequalities (and its extensions), …

Computational Geometry Column 33, Joseph O'Rourke

Computer Science: Faculty Publications

Several recent SIGGRAPH papers on surface simplification are described.

The Dirichlet Problem And Its Physical Motivations, Andrew E. Pitts

Honors Theses

In this work, we explore the basics of harmonic function theory and its relationship to problems in the theory of heat diffusion. In particular, we will focus on the classical Dirichlet problem.

Problems In Harmonic Function Theory, Ronald A. Walker

Honors Theses

Harmonic Function Theory is a field of differential mathematics that has both many theoretical constructs and physical connections, as well as its store of classical problems.

One such problem is the Dirichlet Problem. While the proof of the existence of a solution is well-founded on basic theory, and general methods for polynomial solutions have been well studied, much ground is still yet to be overturned. In this paper we focus on the examination, properties and computation methods and limitations, of solutions for rational boundary functions.

Another area that we shall study is the properties and generalizations of the zero sets …