| Mathematics and Computer Sciences
Highlights |
 |
|
Total Listing: 55
(Listed by the order of record adding time, Descending)
|
|
|
| ( 1 )
|
Recorded at: 2/14/2008 
|
| Title |
Abundancy "outlaws" of the form /s/(/N/)+/t/)//N/ |
| Journal |
J Integer Sequences, 2007;10:Article 07.9.6, Stanton W, Holdener J
|
| Description |
The abundancy index of a positive integer /n/ is defined to be the rational number /I/(/n/) = /s/(/n/)//n/, where /s/ is the sum of divisors function. An abundancy outlaw is a rational number greater than 1 that fails to be in the image of of the map /I/. Abundancy outlaws are important in the study of odd perfect numbers and related questions in number theory. The authors investigated rational numbers of the form (/s/(/N/) + /t/)//N/ and were able to prove that under certain conditions such rationals are abundancy outlaws
|
| Faculty |
Judy Holdener is an associate professor in the Department of Mathematics
|
| Student |
William Stanton participated in this research during the summer after his sophomore year; he is currently a senior |
| Fund |
The research was supported by the Kenyon College Summer Science Scholars Program
|
|
|
| ( 2 )
|
Recorded at: 11/19/2007
|
| Title |
New type of block design |
| Journal |
B I Comb Appl, 2007;50:26-28, Sarvate DG, Beam WA
|
| Description |
Combinatorial Design Theory includes study of different types of arrangements of elements of a given set which satisfies certain properties. In many of these designs a common thread is to find a collection of subsets where every pair or triple or an n-tuple occurs in the same number of subsets. In this note we define and study designs, called adesigns, where every pair occurs in a different number of subsets of the design. This novel idea caught attention of the Editor-in-Chief of the Bulletin of the Institute of Combinatorics, Professor Ralph Stanton, and he wrote a paper: A note on Sarvate-Beam Triple System, Bulletin of the Institute of Combinatorics and its Application, 2007;50:61-66 and in it named these designs as "Sarvate-Beam Triple Systems".
|
| Faculty |
Dinesh G. Sarvate is a professor of mathematics
|
| Student |
William Beam worked on this as a senior; he graduated in May 2007 |
| Fund |
Department of Mathematics provided Beam partial support to present the paper at the Thirty-Eighth Southeastern International Conference on Combinatorics, Graph Theory and Computing
|
|
|
| ( 3 )
|
Recorded at: 11/19/2007
|
| Title |
Global asymptotic behavior for delay dynamic equations |
| Journal |
Nonlinear Anal, 2007;66:1633-1644, Anderson DR, Kenz ZR
|
| Description |
We found conditions under which solutions of a first-order nonlinear variable-delay dynamic equation go to zero at infinity, for arbitrary time scales that are unbounded above. In an example, we applied our techniques to a logistic dynamic equation on isolated, unbounded time scales. This work unified previous work on delay differential and difference equations, extending the results to delay quantum equations and other general dynamic equations
|
| Faculty |
Douglas Anderson is an associate professor of mathematics at Concordia College-Moorhead.
|
| Student |
Zackary Kenz participated in this research in his sophomore year for fun. He is currently a senior, student body president, and doing a summer research project for the Department of Defense |
| Fund |
The research was unsupported
|
|
|
| ( 4 )
|
Recorded at: 11/19/2007
|
| Title |
Multidecomposition of ? Km into small cycles and claws |
| Journal |
B Inst Comb Appl., 2007;49:32-40, Abueida A, O’Neil T
|
| Description |
A (G, H)-multidecomposition of ? Km is a partition of the edges of ? Km into copies of G and H with at least one copy of G and at least one copy of H. In this paper, we consider the existence of multidecompositions of ? Km when Gn = K1,n-1 and Hn = Cn for n = 3, 4, and 5
|
| Faculty |
Atif Abueida is an associate professor of mathematics
|
| Student |
Theresa O’Neil completed this research as part of independent study project in her senior year in 2005. She later received her MS in Economics from University of North Carolina at Greensboro and is now employed at Bank of America. |
| Fund |
The research was not funded externally
|
|
|
| ( 5 )
|
Recorded at: 11/19/2007
|
| Title |
Saari's conjecture for the restricted three-body problem |
| Journal |
Celest Mech Dyn Astr., 2007;97:211-223, Roberts GE, Melanson L
|
| Description |
Saari's conjecture adapted to the restricted three-body problem is proven analytically using BKK theory. Specifically, we show that it is not possible for a solution of the planar, circular, restricted three-body problem to travel along a level curve of the amended potential function unless it is fixed at a critical point (one of the five libration points.) Due to the low dimension of the problem, our proof does not rely on the use of a computer
|
| Faculty |
Gareth Roberts is an assistant professor of mathematics
|
| Student |
Lisa Melanson participated in this research the summer after her junior year, continuing on in her senior year in a directed project. She is currently working toward a doctoral degree at Northwestern University in the Engineering Sciences and Applied Mathematics Department |
| Fund |
The research was supported by a Fisher Summer Student Research Fellowship through Holy Cross
|
|
|
| ( 6 )
|
Recorded at: 11/19/2007
|
| Title |
q-Dominant and q-recessive matrix solutions for linear quantum systems |
| Journal |
Electron J Qual Theor Differ Equat+., 2007;11:1-29, Anderson DR, Moats LM
|
| Description |
In this study, linear second-order matrix quantum (q-difference) equations were shown to be formally self-adjoint equations with respect to a certain inner product and the associated self-adjoint boundary conditions. A generalized Wronskian was introduced and a Lagrange identity and Abel's formula were established; two reduction-of-order theorems were given. The analysis and characterization of q-dominant and q-recessive solutions at infinity were presented, emphasizing the case when the quantum system is disconjugate
|
| Faculty |
Douglas Anderson is an associate professor of mathematics
|
| Student |
Lisa Moats participated in this research in her freshman year for fun. She is currently a sophomore |
| Fund |
The research was unsupported
|
|
|
| ( 7 )
|
Recorded at: 11/6/2007
|
| Title |
What's in a name? A study of identifiers |
| Journal |
ICPC, 2006;1:3-12, Lawrie D, Morrell C, Feild H, Binkley D
|
| Description |
Results from a study designed to investigate the impact of program identifier quality on comprehension is presented. The study involved over one hundred programmers ranging from undergraduate students (about 23% of the participants) to those with 40+ years of experience. Each was asked to describe twelve different functions that used one of three different identifier quality levels. The results show that full-word identifiers lead to the best comprehension; however, in many cases, there is no statistical difference between using full words and abbreviations. When considered in the light of limited human short-term memory, the results support the use of well-chosen abbreviations as identifiers with fewer syllables are easier to remember
|
| Faculty |
Dawn Lawrie is an assistant professor of computer science. Chris Morrell is a professor of mathematical sciences. Dave Binkley is a professor of computer science
|
| Student |
Henry Feild participated in this research as a Loyola Summer Hauber Fellowship recipient and will be attending the University of Massachusetts Amherst as a first-year graduate student next year |
| Fund |
The research was supported through a NSF-RUI grant.
|
|
|
| ( 8 )
|
Recorded at: 10/31/2007
|
| Title |
Quasi-random Structures from elliptic curves |
| Journal |
JP J Algebra, Number Theory Appl, 2006;6:561-571, Caragiu M, Johns RA, Gieseler J
|
| Description |
The distribution properties of the sets obtained by projecting an elliptic curve on the x-axis are investigated. The distribution is proved to be quasi-random. For a certain class of quasi-random walks associated to the projection sets, chi-squared based statistical tests are used to show that from the point of view of the number of returns to the origin they cannot be distinguished from genuine random walks
|
| Faculty |
Mihai Caragiu and Ronald A. Johns are associate professors of mathematics
|
| Student |
Justin Gieseler is an undergraduate student majoring in mathematics and computer science. Justin participated in this research during his sophomore year, and presented parts of this research at the Undergraduate Mathematics Day at Dayton, in November 2005, as well as at the 2006 San Antonio Joint AMS-MAA Meetings. |
| Fund |
The research was supported by the Getty College of Arts and Sciences at Ohio Northern University
|
|
|
| ( 9 )
|
Recorded at: 10/31/2007
|
| Title |
Kneser’s theorem for upper Banach density |
| Journal |
Journal de Theorie des Numbres, 2006;18:323-343, Bihani P, Jin R
|
| Description |
For a set of non-negative integers with upper Banach density of a, if the upper Banach density of A+A is less than 2a, then it is shown, by using nonstandard analysis, that A+A must have certain structure. This theorem solves one of the inverse problems for upper Banach density. The work demonstrates how a standard problem can be solved using nonstandard methods. The nonstandard analysis uses mathematical logic, which is relatively new to number theorists typically interested in this branch of mathematics
|
| Faculty |
Renling Jin is an associate professor of mathematics
|
| Student |
Prerna Bihani graduated in May of 2004 with a BS in mathematics and a minor in philosophy. This work was done over the summer of 2003 and over the 2003-04 academic year as part of a Bachelor’s Essay. Prerna is currently in her third year of graduate school, working towards a PhD at the University of Notre Dame |
| Fund |
Funding for the summer research effort was provided by a competitive internal award from College of Charleston’s Summer Undergraduate Research with Faculty program
|
|
|
| ( 10 )
|
Recorded at: 10/31/2007
|
| Title |
Cooling the Macon volunteer clinic |
| Journal |
The UMAP J, 2006;27(4):431-447, Denny JK, Trivett CK
|
| Description |
This paper develops a mathematical model of the air conditioning system at the Macon Volunteer Clinic. Four air conditioning systems control the temperature in the clinic but are poorly arranged and have difficulty regulating the temperature. Using a system of eight differential equations, we model the effects of the outdoor temperature, the air conditioning systems, and people in the clinic. After defining and investigating measures of efficiency and comfort, we use the model to suggest changes to the clinic, which proved effective when implemented
|
| Faculty |
Jeff Denny is an associate professor of mathematics
|
| Student |
Carrie K. Trivett participated in this project during the summer after her junior year and is now a mathematics teacher at the Upper School of Mount de Sales Academy in Macon, GA. |
| Fund |
This research was supported through a grant from the College of Liberal Arts at Mercer University
|
|
|
| ( 11 )
|
Recorded at: 2/22/2007
|
| Title |
Intelligent virtual companion system for independent living |
| Journal |
Proceedings of ‘The International Conference on Artificial Intelligence (ICAI’06), Las Vegas, Nevada, June 26-29, 2006, ©CSREA Press, pp. 439-445, Todd M, Sasi S
|
| Description |
The main goal of independent living facilities is to maximize the independence and productivity of individuals with disabilities, and their integration and inclusiveness into mainstream society. A component of independent living is an elderly companionship service. In this research, an Intelligent Virtual Companion System for Independent Living (IVCSIL) is designed to add a social companionship aspect to smart home systems. This artificial intelligent system will initiate casual conversation, provide cues for performing daily living tasks, monitoring a subject’s health, and perform secretarial tasks that will enhance autonomy
|
| Faculty |
Sreela Sasi is associate professor of computer and information science
|
| Student |
Michael Todd is a senior student in electrical and computer engineering. He will be graduating in December 2006. Michael worked on this project from Spring 2005 through Spring 2006 |
| Fund |
A Faculty Development Grant from Gannon University was used to meet the expense of the conference
|
|
|
| ( 12 )
|
Recorded at: 2/22/2007
|
| Title |
The volume principle |
| Journal |
Math Mag, 2006;79:251-261, Dickinson WC, Lund K
|
| Description |
The dual theorems of Menelaus and Ceva are among the most beautiful and useful results in Euclidean geometry. Grunbaum and Shephard, in their article, Ceva, Menelaus and the Area Principle, introduce a simple tool, called the Area Principle, and use it to present deservingly elegant proofs of both Ceva's and Menelaus' Theorems and their generalizations. In this paper, we prove the Volume Principle, which is valid for the Euclidean plane, the hyperbolic plane and the two-dimensional sphere. This tool allows us to extend all the theorems from Grunbaum and Shephard's article, except for those generalizations that require linearity, into these other geometries
|
| Faculty |
William Dickinson is a professor of mathematics
|
| Student |
Kristina Lund participated in this research the summer after her junior year and is currently a graduate student in mathematics at the University of Nebraska-Lincoln |
| Fund |
The research was supported through a student summer scholars grant from Grand Valley State University
|
|
|
| ( 13 )
|
Recorded at: 2/21/2007
|
| Title |
Linked triangle pairs in a straight edge embedding of K6 |
| Journal |
The pme J, 2006;213-218, Hughes C, Ludwig LD
|
| Description |
In 1983, Conway and Gordon showed that any embedding of the complete graph on six vertices, K6, must contain at least one linked triangle pair with a maximum of ten linked pairs. In 2004, a question was posed at a knot theory workshop asking for the total number of linked pairs in any straight-edge of K6. We answered this question by showing that any straight-edge embedding of K6 contains either 1 or 3 linked triangle pairs
|
| Faculty |
Lewis D. Ludwig is an assistant professor of mathematics and computer science
|
| Student |
Colleen Hughes participated in this summer research after her sophomore year at Denison and continued the work for her honor’s thesis. She is in her first year of graduate studies at Clemson University |
| Fund |
The Howard Hughes Medical Foundation supported this research
|
|
|
| ( 14 )
|
Recorded at: 2/21/2007
|
| Title |
Matching scale-space features in 1D panoramas. |
| Journal |
Comput Vis Image Und, 103(3):184-195, Briggs A, Detweiler C, Li Y, Mullen P, Scharstein D
|
| Description |
The goal of this work is to enable a mobile robot to navigate using 1D panoramic images, i.e., single scanlines spanning 360-degree horizontal views. Invariant features are extracted from the scale-space of such images, and a novel dynamic programming algorithm matches features between different viewpoints. The method can handle arbitrary rotations, missing features, and is robust to changes in lighting conditions and in the presence of some occlusion
|
| Faculty |
Amy Briggs and Daniel Scharstein are associate professors of computer science
|
| Student |
Peter Mullen is a researcher based in Seattle. Carrick Detweiler participated in this research during two summers after his sophomore and junior years. He is currently pursuing a PhD in computer science at the Massachusetts Institute of Technology. Yunpeng Li participated in this research during two summers after his junior and senior years. He is currently pursuing a PhD in computer science at Cornell University |
| Fund |
The research was supported through NSF-RUI grants
|
|
|
| ( 15 )
|
Recorded at: 2/21/2007
|
| Title |
LDPC codes generated by conics in the classical projective plane |
| Journal |
Designs Codes Cryptog, 2006;40(3):343-356, Droms, Sean V., Mellinger, Keith E., and Meyer, C
|
| Description |
Several classes of Low-Density Parity-Check codes are constructed from various point-line incidence structures in the finite projective plane PG(2,q). The codes are analyzed mathematically and through simulation. Such codes can be used for error-correction on certain memory devices and short range transmissions
|
| Faculty |
Keith Mellinger is an assistant professor of mathematics
|
| Student |
Sean Droms and Chris Meyer completed this research after their sophomore and junior years, respectively, during the summer of 2005. Chris Meyer now works at the Naval Surface Warfare Center at Dahlgren. Sean will graduate in May 2007 and aspires to attend graduate school in mathematics next year |
| Fund |
The research was funded by the University of Mary Washington's Summer Science Institute
|
|
|
| ( 16 )
|
Recorded at: 2/21/2007
|
| Title |
The greatest prime factor and related sequences |
| Journal |
J Algebra Numb Theory Appl, 2006;6:403-409, Caragiu M, Scheckelhoff, L
|
| Description |
A class of prime sequences, in which each term is the greatest prime factor of a fixed linear function of the previous term, is investigated. Computational evidence is provided, suggesting the conjecture that all such sequences are ultimately periodic. A complete proof of the conjecture is provided in the special case in which the linear polynomial is a translation
|
| Faculty |
Mihai Caragiu is an associate professor of mathematics
|
| Student |
Lisa Scheckelhoff is an undergraduate student majoring in mathematics and biology. Lisa Scheckelhoff participated in this research in her senior year and then presented it as part of her senior capstone project in mathematics. Parts of this research were also presented at the 2006 Annual Nebraska Conference for Undergraduate Women in Mathematics and at the 2006 MAA Ohio Spring Meeting |
| Fund |
The research was supported by the Getty College of Arts and Sciences at Ohio Northern University
|
|
|
| ( 17 )
|
Recorded at: 2/21/2007
|
| Title |
Application of simulation in computer architecture, Proceedings of the 4th International Conference on Education and Information Systems: Technologies and Applications. |
| Journal |
, 2006;1:168-173, Parker BC, Edmondson JR
|
| Description |
A software teaching tool was created to enhance already existing pedagogy and practice to augment student learning, motivation, and retention of Computer Architecture. The RSC Emulator teaches students through compilation, emulation, and simulation of a virtual RSC (Relatively Simple Computer). Logical groupings of components and the ability to debug component functions down to microcode give students a chance to gain an in-depth understanding of hardware functions by appealing to student needs for visualization and abstraction
|
| Faculty |
Brenda Parker is an associate professor of computer science
|
| Student |
James Edmondson is a senior computer science undergraduate. |
| Fund |
The research was conducted in Fall of 2005 and Spring of 2006 and supported by an URSCP Grant from the Office of Research and Sponsored Programs at MTSU
|
|
|
| ( 18 )
|
Recorded at: 12/8/2006
|
| Title |
Infinite family of approximations of the Digamma function |
| Journal |
J Math Comp Modelling, 2006; 43(11-12):1329-1336, Muqattash I, Yahdi M
|
| Description |
The aim of the work was to find “good” approximations to the Digamma function ?. We construct an infinite family of “basic” functions covering the Digamma function. These functions are shown to approximate ? locally and asymptotically. Local and global bounding error functions are found and new inequalities for the Digamma functions are introduced
|
| Faculty |
Mohammed Yahdi is assistant professor of mathematics at Ursinus College
|
| Student |
Isa Muqattash participated in this research the summer after his junior year,; he graduated from Ursinus College in 2005 and is currently on a graduate school fellowship and teaching assistantship at Columbia University |
| Fund |
funded through the Ursinus College Summer Fellows program
|
|
|
| ( 19 )
|
Recorded at: 12/8/2006
|
| Title |
Toward a practical data privacy scheme for a distributed implementation of the Smith-Waterman genome sequence comparison algorithm |
| Journal |
Proc 2006 ISOC Ntwk Distrib Sys Sec Symp, 13:253-265, Szajda D, Pohl M, Owen J, Lawson B
|
| Description |
This paper introduces a strategy for enhancing data privacy in some distributed volunteer computations, providing an important first step toward a general data privacy solution for these computations. The strategy is used to provide enhanced data privacy for the Smith-Waterman local nucleotide sequence comparison algorithm. Our modified Smith-Waterman algorithm provides reasonable performance, identifying most, and in many cases all, sequence pairs that exhibit statistically significant similarity according to the unmodified algorithm, with reasonable levels of false positives. Moreover the modified algorithm achieves a net decrease in execution time, with no increase in memory requirements. Most importantly, our scheme represents an important first step toward providing data privacy for a practical and important real-world algorithm
|
| Faculty |
Douglas Szajda is an associate professor of Computer Science; Jason Owen is an assistant professor of Mathematics; Barry Lawson is an assistant professor of Computer Science.
|
| Student |
Michael Pohl was a junior while completing this work. He will continue his study at the University of Richmond over the next year. |
| Fund |
This work was partially supported by a grant from the National Science Foundation.
|
|
|
| ( 20 )
|
Recorded at: 12/8/2006
|
| Title |
On decompositions of the KdV 2-soliton |
| Journal |
J Nonlinear Sci, 2006;16:179-200, Benes N, Kasman A, Young K
|
| Description |
The soliton is an important concept in mathematics, physics and engineering because it is a nonlinear wave which exhibits particle-like properties. This paper, in particular, investigates the interaction of two solitons of the KdV equation that was originally written to describe surface waves of water on a canal. If one does not look closely, it may appear that the two "humps" of water simply pass right through each other. However, as is well known, a closer investigation reveals a nonlinear interaction that manifests itself in the form of a "phase shift". Original results in this paper include a demonstration of non-synchronicity in the asymptotic behavior of incoming and outgoing solitons, as well as novel decompositions of the solution that reveal the nature of the collision
|
| Faculty |
Alex Kasman is an associate professor of mathematics at the College of Charleston
|
| Student |
Nick Benes worked on this project as part of his graduate studies in mathematics at the College of Charleston. Kevin Young worked on this project as an undergraduate during the Summer of 2004, between his junior and senior years. Young is now a graduate student at the University of California at Berkeley and Benes is continuing with his graduate education at the College of Charleston |
| Fund |
The project was supported solely by the Department of Mathematics at the College of Charleston
|
|
|
| ( 21 )
|
Recorded at: 7/19/2006
|
| Title |
Irreducible polynomials and full elasticity in rings of integer-valued polynomials |
| Journal |
Journal of Algebra, 2005(293):595–610, Chapman ST, McClain BA
|
| Description |
Let D be a unique factorization domain and S an infinite subset of D. If f(X) is an element in the ring of integer-valued polynomials over S with respect to D (denoted Int(S, D)), then we characterize the irreducible elements of Int(S, D) in terms of the fixed-divisor of f(X). The characterization allows us to show that every nonzero rational number n/m is the leading coefficient of infinitely many irreducible polynomials in the ring Int(Z) = Int(Z, Z). Further use of the characterization leads to an analysis of the particular factorization properties of such integer-valued polynomial rings. In the case where D = Z, we are able to show that every rational number greater than 1 serves as the elasticity of some polynomial in Int(S, Z) (i.e., Int(S, Z) is fully elastic)
|
| Faculty |
Scott Chapman is a professor of mathematics
|
| Student |
Barbara McClain is employed by the National Security Agency. Part of this work is contained in her Senior Honors Thesis at Trinity University. |
|
|
| ( 22 )
|
Recorded at: 7/19/2006
|
| Title |
p-adic interpolation of the Fibonacci sequence via hypergeometric functions |
| Journal |
The Fibonacci Quarterly, 2005(43.3):213-226, Bihani P, Sheppard WP, Young PT
|
| Description |
Several authors have considered the problem of extending the Fibonacci sequence to arbitrary real or complex subscripts. In this paper we consider the extent to which the Fibonacci and Lucas sequences can be extended to arbitrary p-adic subscripts in a continuous way. In the process we determine several new expressions, both p-adic and real, for the Fibonacci sequence in terms of hypergeometric functions and combinatorial sums
|
| Faculty |
Paul Thomas Young is professor of mathematics
|
| Student |
The work was done as a summer project in 2002, when Prerna Bihani was a sophomore and Wendy Sheppard was a graduate student at College of Charleston. Prerna received her Bachelor of Science degree in mathematics in 2004 and is now a graduate student in mathematics at the University of Notre Dame. Wendy received her Master of Science degree in mathematics in 2004 and is currently a visiting lecturer in the mathematics department at the College of Charleston. |
|
|
| ( 23 )
|
Recorded at: 7/19/2006
|
| Title |
Tight bounds on plurality |
| Journal |
Information Processing Letters, 2005(96):93-95, Srivastava N, Taylor AD
|
| Description |
We consider the problem of efficiently finding a ball of a plurality color within a finite set of colored balls. The corresponding question for a majority color has been studied in depth. We show here that n-1-choose-two comparisons are necessary in the worst case, and we give an algorithm that never uses more than this many comparisons
|
| Faculty |
Alan D. Taylor is the Marie Louise Bailey Professor of Mathematics
|
| Student |
Nikhil Srivastava was an undergraduate at Union College when this was written as a part of his senior thesis. He graduated in June, 2005 and is now doing Ph.D. work in computer science at Yale University |
|
|
| ( 24 )
|
Recorded at: 7/19/2006
|
| Title |
Statistical methods in the journal |
| Journal |
The New England Journal of Medicine, 2005(353):1977-1979, Horton NJ, Switzer SS
|
| Description |
This article surveys recent issues of "The New England Journal of Medicine" for the use of statistical methods. Prior work by Emerson and Colditz (1979, 1989) had shown a growth in the use of statistics in this widely read medical journal. We found a continued trend toward increased use of newer and more sophisticated statistical methods not normally covered in an introductory statistics course. This growth has important implications in medical and statistical education
|
| Faculty |
Nicholas Horton is an assistant professor of Mathematics at Smith College
|
| Student |
Suzanne Switzer participated in this research the summer after her junior year and anticipates graduating in May 2006 |
| Fund |
The research was funded by the Howard Hughes Medical Institute
|
|
|
| ( 25 )
|
Recorded at: 1/6/2006
|
| Title |
When Thue-Morse meets Koch |
| Journal |
Fractals: Complex Geometry, Patterns, and Scaling in Nature and Societ, 2005, 13, 191-206, Jun Ma, Judy Holdener. (Kenyon College).
|
| Description |
Using turtle geometry and polygon maps, the Thue-Morse sequence is realized as a limit of polygonal curves in the plane. This sequence of curves converges to the Koch Snowflake in the Hausdorff metric. The Thue-Morse sequence is then generalized to obtain other sequences that encode curves converging to the Koch Snowflake.
|
| Faculty |
Judy Holdener is an associate professor of mathematics at Kenyon College.
|
| Student |
Jun Ma participated in this research during the summer of 2004 following his junior year at Kenyon College. He continued the work throughout the following fall and was funded through Kenyon's Summer Science Scholar program. Jun received Kenyon's Tomsich Science Award (a research award typically awarded to faculty) for this work. He is currently working towards his Ph.D. in Statistics at Duke University. |
|
|
| ( 26 )
|
Recorded at: 1/6/2006
|
| Title |
The Cover Pebbling Number of Graphs |
| Journal |
Discrete Mathematics, 2005, 296, 15-23, Betsy Crull, Tammy Cundiff, Paul Feltman, Glenn H. Hurlbert, Lara Pudwell, Zsuzsanna Szaniszlo, Zsolt Tuza (Valparaiso University).
|
| Description |
A pebbling move on a vertex-edge graph consists of taking two pebbles off of one vertex and placing another pebble on an adjacent vertex. The cover pebbling number of the graph is the minimum number of pebbles such that however the pebbles are initially placed on the vertices of the graph we can eventually, after a series of pebbling move, put a pebble on every vertex of the graph simultaneously.
|
| Faculty |
Zsuzsanna Szaniszlo is an associate professor at Valparaiso University, Glenn H. Hurlbert is a professor at Arizona State University, Zsolt Tuza is a research professor at the Computer and Automation Institute of the Hungarian Academy of Sciences.
|
| Student |
The other four authors were working as an undergraduate research group at Valparaiso University. During the time of the project Betsy Crull and Paul Feltman were freshmen and are now juniors, Tammy Cundiff was a senior, she is now employed in industry, and Lara Pudwell was a senior, she is now in the Ph.D. program of the mathematics department at Rutgers University. |
|
|
| ( 27 )
|
Recorded at: 1/6/2006
|
| Title |
SUITEDasher – A Multilingual Keyboard and Mouse Interface for Motor-Impaired Users |
| Journal |
Proceedings of 11th International Conference on Human-Computer Interaction (HCI 2005), Las Vegas, NV, 2005, 7, CD-ROM (10 pages), David Lyle, Bill Manaris. (College of Charleston).
|
| Description |
A speech user interface for motor-impaired users was designed and prototyped. Design objectives included improved usability relative to an earlier system, multilingual support, and platform independence. To achieve these objectives, SUITEDasher presents a minimal graphical user interface, incorporates a trigram-based probabilistic model, and loads appropriate syntactic, lexical, and (potentially) phonetic models dynamically at run time. Usability tests indicate that SUITEDasher is 30% more efficient than its predecessor.
|
| Faculty |
Bill Manaris is an associate professor of computer science at the College of Charleston in South Carolina, USA.
|
| Student |
David Lyle participated in this research the summer after his junior year and then continued it as a senior project. He is currently employed in industry. |
| Fund |
The research was supported through a College of Charleston SURF grant.
|
|
|
| ( 28 )
|
Recorded at: 9/29/2005
|
| Title |
Use of R as a Toolbox for Mathematical Statistics Exploration |
| Journal |
The American Statistician, , 2004, 58(4), 343-357, N. J. Horton, E. R. Brown, L. Qian (Smith College).
|
| Description |
The R language, a freely available environment for statistical computing and graphics is widely used in many fields. This expert-friendly system has a powerful command language and programming environment, combined with an active user community. In this paper, we discuss how R is ideal as a platform to support experimentation in mathematical statistics, both at the undergraduate and graduate levels. Using a series of case studies and activities, we describe how R can be utilized in a mathematical statistics course as a toolbox for experimentation. These activities, often requiring only a few dozen lines of code, offer the student the opportunity to explore statistical concepts and experiment, while providing an introduction to the framework and idioms available in this rich environment.
|
| Faculty |
Nicholas Horton is assistant professor, Department of Mathematics, Smith College
|
| Student |
Linjuan Qian (Smith College class of 2005) undertook the work during summer 2004 and is currently planning to matriculate into a doctoral program in Statistics at Harvard University. |
| Fund |
This work was funded in part by NIH grant MH54693.
|
|
|
| ( 29 )
|
Recorded at: 9/29/2005
|
| Title |
Debugging with Aspects |
| Journal |
Journal of the Consortium of Computing Sciences in Colleges, 2005, 20-5, 44-55, John Stamey, Bryan Saunders (Coastal Carolina University).
|
| Description |
This paper illustrates techniques for tracing the execution of loops, methods and constructors using AOP. The use of aspects to implement debugging can also eliminate the need to install and learn new debugging packages for code tracing.
|
| Faculty |
John Stamey is a professor of computer science at Coastal Carolina University
|
| Student |
Bryan Saunders participated in this research during his sophomore year. He is currently still enrolled at Coastal Carolina University as a junior. |
|
|
| ( 30 )
|
Recorded at: 9/29/2005
|
| Title |
Primitive Ideals of non-Noetherian Down-up Algebras |
| Journal |
Communications in Algebra, 2005, 33, 605-622, Iwan Praton, Stephen May (Franklin and Marshall College).
|
| Description |
We determine generators of all primitive ideals of non-Noetherian down-up algebras. Since primitive ideals of Noetherian down-up algebras have been previously calculated, this work completes the classification of all primitive ideals of down-up algebras-we now have explicit descriptions of all of them.
|
| Faculty |
Iwan Praton is a faculty member in the mathematics department at Franklin & Marshall College
|
| Student |
Stephen May participated in this project during the summer after his junior year. He is now in graduate school at North Carolina State University. |
| Fund |
The work was supported by Franklin & Marshall's Hackman summer grant.
|
|
|
| ( 31 )
|
Recorded at: 9/29/2005
|
| Title |
Building Infrastructure for an Honors Research Robotics Lab |
| Journal |
Proceedings IEEE 6th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, Towson, MD, May 23-25, 2005, 352-357, G. Trajkovski, J. Schlosburg, B. Whitman, G. Vincenti (Towson University).
|
| Description |
This paper overviews the process of adaptation of the Cognitive Agency and Robotics Laboratory (CARoL) at Towson University to host undergraduate research projects, and overviews the ongoing research in the domain of Cognitive and Developmental Robotics. With institution-specific adaptations, based on the student interests and profiles, this lab can be easily replicated on a shoestring.
|
| Faculty |
Goran Trajkovski is an assistant professor of computer and information Sciences and the director of the Cognitive Agency and Robotics Laboratory at Towson University.
|
| Student |
Julius Schlosburg, a sophomore, and Brian Whitman, a senior majoring in computer science, have worked in the lab since its inception within a variety of undergraduate research programs at the College of Science and Mathematics and Towson University in general. Giovanni Vincenti is a doctoral student of Trajkovski. |
| Fund |
Part of this work was funded by the National Academies of the Sciences.
|
|
|
| ( 32 )
|
Recorded at: 9/29/2005
|
| Title |
The Structure of Optimal Partitions of Orthogonal Polygons into Fat Rectangles |
| Journal |
Computational Geometry: Theory and Applications, 28(1) 49-71, 2004, Joseph O'Rourke, Geetika Tewari (Smith College).
|
| Description |
A VLSI masking problem suggested exploring partitions of a polygon into rectangles that maximize the shortest rectangle side. Thus no rectangle is "thin"; all rectangles are "fat." The shortest side corresponds to the width of the etching electron beam. The research resulted in a polynomial-time algorithm to find this optimal partition.
|
| Faculty |
Joseph O'Rourke is professor and chair of computer science at Smith College.
|
| Student |
The work grew out of Geetika Tewari's senior honors thesis of 2002. She is currently a graduate student in computer science at Harvard University. |
| Fund |
The research was supported through an NSF-DTS award.
|
|
|
| ( 33 )
|
Recorded at: 9/29/2005
|
| Title |
Ternary Codes Through Ternary Designs |
| Journal |
Australasian Journal of Combinatorics, 2004, 30, 21–29, Alexander L. Strehl (College of Charleston).
|
| Description |
It is known that under certain conditions the incidence matrix of a balanced incomplete block design (BIBD) with parameters (v, b, r, k, ?) can be used to form a binary error-correcting code of size 2(v +1) with wordlength b. In this paper sufficient conditions are given under which the incidence matrix of a balanced ternary design (BTD) can be used to forma ternary error-correcting code, analogous to the binary codes from BIBD’s. Three examples of single-error-correcting ternary codes are constructed illustrating this principle.
|
| Faculty |
Dinesh G. Sarvate, the faculty mentor for this project, is a professor of mathematics at the College of Charleston.
|
| Student |
Alexander is currently at Rutgers working towards a PhD in Computer Science. This work was done during 2001 and 2002 during academic year and summer and was part of Alexander's undergraduate Bachelor's Essay. |
|
|
| ( 34 )
|
Recorded at: 9/29/2005
|
| Title |
Microsoft .NET and Security Provided by High-Level Internet Protocols |
| Journal |
The 2005 International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA'05), 2005, Tatiana Melnik, Zornitza Prodanoff (University of North Florida).
|
| Description |
