This article is concerned with how computer science, and more exactly computational complexity theory, can inform cognitive science. In particular, we suggest factors to be taken into account when investigating how people deal with computational hardness. This discussion will address the two upper levels of Marr's Level Theory: the computational…

This thesis investigates and develops a few acceleration techniques for the search engine algorithms used in PageRank and HITS computations. PageRank and HITS methods are two highly successful applications of modern Linear Algebra in computer science and engineering. They constitute the essential technologies accounted for the immense growth and…

Combinatorial scientific computing plays an important enabling role in computational science, particularly in high performance scientific computing. In this thesis, we will describe our work on optimizing matrix-vector multiplication using combinatorial techniques. Our research has focused on two different problems in combinatorial scientific…

This article describes the sequence alignment problem in bioinformatics. Through examples, we formulate sequence alignment as an optimization problem and show how to compute the optimal alignment with dynamic programming. The examples and sample exercises have been used by the author in a specialized course in bioinformatics, but could be adapted…

This article gives an overview of the new field of complexity theory which links computer science to mathematics, and ultimately to the solution of theoretical as well as practical problems in society and technology. (Author/MK)

The third of three volumes of a mathematics training course for Navy personnel, this text emphasizes topics needed in understanding digital computers and computer programing. The text begins with sequences and series, induction and the binomial theorem, and continues with two chapters on statistics. Arithmetic operations in number systems other…

A methodology for forecasting enrollments at the individual unit level is presented. It can be used to produce detailed enrollment projections (e.g., by class level by semester by year) or more aggregate information (e.g., academic or fiscal year total enrollment), and it does not require the typical institution to obtain new data. (LBH)

Several computer programs were developed to solve various versions of the quadratic capacitated facilities location problem. Matrices, which represent various business costs, are defined for the factors of sites, facilities, customers, commodities, and production units. The objective of the program is to find an optimization matrix for the lowest…

Presented is a scheduling algorithm that uses all the busses at each step for any rectangular array. Included are two lemmas, proofs, a theorem, the solution, and variations on this problem. (KR)