CSIS Technical Reports

Note on Integer Factoring Methods I

Nelson A. Carella — Wed, 28 Feb 2007 13:51:34 PST

This note presents the basic mathematical structure of a new integer factorization method based on systems of linear Diophantine equations. The estimated theoretical running time complexities of the corresponding algorithms are encouraging and improve the current ones. The work is presented as a theoretical contribution to the theory of integer factorization.

Implementation of Graphs Using java.util Part Two: Weighted Graphs, Spanning Trees, and Shortest Paths

Nicholas J. De Lillo — Wed, 28 Feb 2007 13:51:33 PST

This paper continues the discussion of the implementation of graphs using Java 5.0 begun in [1] with special emphasis on weighted graphs, both directed and undirected, as well as the treatment of minimal spanning trees and shortest paths. Again the emphasis will be on implementing a number of the key results in this regard using the predefined List interface and the LinkedList implementation class from the Java Colllections hierarchy.

Implementation of Graphs Using java.util Part One : Preliminary Concepts

Nicholas J. De Lillo — Tue, 24 Oct 2006 11:03:00 PDT

This paper presents an implementation in Java of two abstract data types for graphs: directed and undirected graphs. We view the concrete class of directed graphs as the parent class with undirected graphs as an immediate subclass. Each is designed using facilities available from Java 5.0. This paper describes the use of adjacency lists using the predefined List interface and the LinkedList implementation class from java.util.

Analyzing Shape Context Using the Hamiltonian Cycle

Carl E. Abrams et al. — Tue, 24 Oct 2006 11:02:56 PDT

Shape matching plays important roles in many fields such as object recognition, image retrieval,etc. Belongie, et.al.recently proposed a novel shape matching algorithm utilizing the shape context as a shape descriptor and the magnitude of the aligning two shape contexts as a distance measure. It was claimed to be an information rich descriptor that is invariant to translation, scale and rotation. We examine the limitation of the algorithm using graph theory and present several geometrically different shapes that are considered identical by the shape context algorithm. Theoretical contributions pertain to linking shape context and the Hamiltonian cycle. .

Biometrics and Its Use in Forensics

Jason Bernard Thompson — Tue, 24 Oct 2006 11:02:53 PDT

This paper describes how biometrics is used in Forensics. It first gives a general introduction to biometrics desribing the main biometric technique of fingerprinting. hand geometry, eye/iris scans, and DNA. Then it gives an introduction of forensics with an example criminal case. Finally it discusses how biometrics is used in forensics, including an interesting handwriting example from the Ted Bundy case.

What is Research

Ronald I. Frank — Tue, 24 Oct 2006 11:02:52 PDT

An Overview of Extensible Markup Language

Carol E. Wolf — Tue, 24 Oct 2006 10:58:38 PDT

Intrusion Detection and Response System Generator

Bel G. Raggad — Sun, 16 Oct 2005 14:31:04 PDT

We discuss the design of an intrusion detection and resonse system (idrs) generator. This design involves a belief fuser, a belief tree classifier, and a memoryless fuzzy incident responder. The firm's security policy,its current risk profile,and training data constitute input streams. The system is designed to produce an incident response that security officers feasibly adopt to improve the firm's risk position as indicated in the corporate security policy. We do not present a prototype for the idrs generator but we provide sufficient details on the credal and pignistic schemes for the fuser and the classifier, needed to develop the idrs generator.

Enhancing Binary Feature Vector Similarity Measures

Sung-Hyuk Cha et al. — Fri, 08 Apr 2005 15:18:12 PDT

Similarity and dissimilarity measures play an important role in pattern classification and clustering. For a century, researchers have searched for a good measure. Here, we review, categorize, and evaluate various binary vector similarity/dissimilarity measures. One of the most contentious disputes in the similarity measure selection problem is whether the measure includes or excludes negative matches. While inner-product based similarity measures consider only positive matches, other conventional measures credit both positive and negative matches equally. Hence, we propose an enhanced similarity measure that gives variable credits and show that it is superior to conventional measures in iris biometric authentication and offline handwritten character recognition applications. Finally, the proposed similarity measure can be further boosted by applying weights and we demonstrate that it outperforms the weighted Hamming distance.

Interactive Flag Identification

Eduardo Hart et al. — Fri, 08 Apr 2005 14:59:56 PDT

We propose an interactive system for identifying flags in photos taken from natural scenes. The system is interactive in two respects. First, because segmentation can be a difficult problem, users are asked to crop the flag portion from a photo. Second, the user makes the final decision by selecting one of the top choices obtained from the machine classification system. The proposed system utilizes a color-based image retrieval technique. For experimental purposes a large number of flag images are synthetically generated from a small number of original ones in order to increase the reference image database. A nearest neighbor classifier produces a sorted list of candidate choices. Recognition accuracy of these choices varies from 82% to 93% depending on whether the correct flag is among the first 8 or 18 top choices, respectively, from a set of 186 flags.

A Review of Logic for Computer Professionals

Ronald I. Frank — Fri, 08 Apr 2005 14:59:52 PDT

Logic is used in programming and circuit design. I introduce the basic definition of Logic and give some concrete examples. By "Logic" I mean the representation and manipulation of variable that can be in one of two states. In programming the variables stand for conditional statements used in looping, that can be "true" or "false". In circuit design the variables stand for voltage "on" or "off" or "current flowing" or "not flowing" . A section exhibits some applications of Logic to computer language "if" and "while" statements. The appendix shows an example of XOR applied to RAID storage, the proof of the sufficiency of Sheffer Stroke (NAND), and some examples from formal circuit theory. They are in the appendix because they require mathematical maturity (and some motivation) to fully follow them. A bibliography points to standard texts for more detailed information. This paper is not meant to substitute for the bibliographic references. It is meant as a quick and broad introduction and as a short pertinent reference for classes using these topics.

Interactive Visual System

Arthur Evans et al. — Fri, 08 Apr 2005 14:20:29 PDT

Mobile computing devices are being endowed with ever-increasing functionality. To demonstrate the augmentation of human cognition in an interactive visual recognition task, we reengineered a PC-based system called CAVIAR (Computer Assisted Visual Interactive System) for a handheld computer with camera system. The resulting Interactive Visual System exploits the pattern recognition capabilities of humans and the computational power of a computer to identify flowers based on features that are interactively extracted from an image and submitted for comparison to a species database. While IVS has similar functionality to that of CAVIAR, because it runs on a handheld computer, it offers complete portability for use in the field. We find that the handheld IVS and PC-based CAVIAR systems outperform humans alone both on speed and accuracy and machines alone on accuracy.

Research Incubator : Combinatorial Optimization

Lixin Tao — Fri, 08 Apr 2005 14:20:28 PDT

A Simple Client-Server Application

Carol E. Wolf — Fri, 08 Apr 2005 14:20:26 PDT

Quadratic Nonresidues and Applications

Nelson A. Carella — Wed, 06 Apr 2005 14:54:07 PDT

Questions from the February 2003 CSIS Programming Competition

CSIS Faculty — Wed, 06 Apr 2005 14:54:05 PDT

Java Servlets, Access Databases, and a Stand Alone Server

Carol E. Wolf — Wed, 06 Apr 2005 12:12:05 PDT

The Performance of Evolutionary Artificial Neural Networks in Unambiguous and Ambiguous Learning Situations

Melissa K. Carroll — Wed, 06 Apr 2005 12:10:53 PDT

Artificial Neural Networks (ANNs), a class of machine learning technology based on the human nervous system, are widely used in such fields as data mining, pattern recognition, and system control. ANNs can theoretically learn any function if designed appropriately, however such design usually requires the skill of human expert. Increasingly, Genetic Algorithms (GAs), a class of optimization tools, are being utilized to automate the construction of effective ANNs. The Wisconsin Card Sorting Test (WCST) is a tool used by psychologists to assess human subjects' planning and reasoning ability. The adaptive learning required in the test's task and its ambiguous nature make it an interesting one to use as a test of the learning properties of ANNs. In this paper, an ANN model is presented that is potentially capable of learning the WCST task. The model was developed based on the division of the WCST task into three sub-tasks. Six GAs and one non-generic search algorithm were used to design two ANNs to learn two of these sub-tasks. Each learned its sub-task to a high degree of accuracy. One of the sub-tasks required a training pattern set with ambiguous input-output mappings. The nature of backpropagation learning on this pattern set was unusual in that it was non-linear. The performance of the search algorithms was compared. The results imply that local search was a more effective operator than global search for this task. A Lamarckian GA outperformed Baldwinian GAs, which in turn outperformed Darwinian GAs. A novel GA referred to as Reverse Baldwinian was also less effective than the Lamarckian GA. The NOn-Genetic algorithm performed comparably to the Lamarckian GA, in addition to being more efficient. GEneral difficulties in using GAs to evolve ANNs that have been noted in previous research may have been responsible for these results. Additionally, the suspected ease of learning both training pattern sets and the effects of the ambiguity of one of the pattern sets may have impacted the algorithm's performance.

Random Graph Process Models for Angiogenesis

Louis V. Quintas et al. — Wed, 06 Apr 2005 10:56:36 PDT

An Efficient Multiway Hypergraph Partitioning Algorithm for VLSI Layout

Lixin Tao — Wed, 06 Apr 2005 10:55:27 PDT

In this paper, we propose an effective multiway hypergraph partitioning algorithm. We introduce the concept of net gain and embed itin the selection of cell moves. Unlike traditional FM-based iterative improvement algorithms in which the selection of the next cell to move is only based on its cell gain,our algorithm selects a cell based on both its cell gain and the sum of all net gains for those nets incidents to the cell. To escape from local optima and to search broader solution space, we propose a new perturbation mechanism. These two strategies significantly enhance the solution quality produced by our algorithm. Based on our experimental justification, we smoothly decrease the numbers of iteration from pass to pass to reduce the computational effort so that our algorithm can partition large benchmark circuits with reasonable run time. Compared with the recent multiway partitioning algorithms proposed by Dasdan and Aykanat [5], our algorithm significantly outperforms theirs in terms of solution quality (cutsize) and run time: the average improvements in terms of average cutsize over their PLM3 and PFM3 are 47.64% and 36.76% with only 37. 17% and 9.66% of their run time respectively.