Physical Sciences and Mathematics Commons^™

The Simple Genetic Algorithm And The Walsh Transform: Part I: Theory, Michael D. Vose, Alden H. Wright

Computer Science Faculty Publications

This paper is the first part of a two-part series. It proves a number of direct relationships between the Fourier transform and the simple genetic algorithm. (For a binary representation, the Walsh transform is the Fourier transform.) The results are of a theoretical nature and are based on the analysis of mutation and crossover. The Fourier transform of the mixing matrix is shown to be sparse. An explicit formula is given for the spectrum of the differential of the mixing transformation. By using the Fourier representation and the fast Fourier transform, one generation of the infinite population simple genetic algorithm …

The Impact Of Technology On Special Education Students, Nathaniel T. Schutta

Honors Theses, 1963-2015

Computers are becoming a part of our everyday life. Every facet of our society, including education, is changing in response. This thesis asks: what impact is technology having on students in one special education classroom? This thesis gives an overview of what technology is present in classrooms, how technology has been used, and examines the handful of studies that have been conducted on the impact of technology on students. I examined a special education classroom focused on the use and maintenance of computers, use of the Internet, and the use of multimedia for presentations. A study was conducted that investigated …

Data Mining In Electronic Media Usage Statistics: A Case Study Of Knowledge Discovery In Databases, Peter J. Lindquist

Honors Theses, 1963-2015

As databases grow larger, analysts are turning to computers to help them analyze the massive amounts of data their computers have collected. As the difference between having data and having useful information becomes more clear, different methods of using computers to analyze data are becoming available. Knowledge Discovery in Databases (KDD) is a general methodology for preparing the data, using software algorithms to discover new patterns or relationships in the data, and integrating the results back into the system. The KDD methodology is explained and hypothetically applied to usage statistics generated by the CSB/SJU Libraries Internet resources. Examples are drawn …

Ber-Based Call Admission In Wavelength-Routed Optical Networks, Debasish Datta, Byrav Ramamurthy, Helena Feng, Jonathan P. Heritage, Biswanath Mukherjee

CSE Conference and Workshop Papers

Consider a wavelength-routed optical network in which nodes, i.e., multiwave length cross-connect switches (XCSs), are connected by fiber to form an arbitrary physical topology. A new call is admitted into the network if an all-optical lightpath can be established between the call’s source and destination nodes. Wavelength converters are assumed absent in this work.

Sorting In Parallel, Ran Libeskind-Hadas

All HMC Faculty Publications and Research

In 1842, L.F. Menabrea anticipated the benefits of parallel computing in an article that appeared in the Swiss Journal Bibliotheque universelle de Geneve:

When a long series of identical computations is to be performed, such as those required for the formation of numerical tables, the machine can be brought into play so as to give several results at the same time, which will greatly abridge the whole amount of the processes.

Although more than a century passed before Menabrea's vision became a reality, today parallel computers with hundreds and even thousands of processors are used in a broad range …

Tree-Based Multicasting In Wormhole-Routed Irregular Topologies, Ran Libeskind-Hadas, Dominic Mazzoni '99, Ranjith Rajagopalan '99

All HMC Faculty Publications and Research

A deadlock-free tree-based multicast routing algorithm is presented for all direct networks, regardless of interconnection topology. The algorithm delivers a message to any number of destinations using only a single startup phase. In contrast to existing tree-based schemes, this algorithm applies to all interconnection topologies, requires only fixed-sized input buffers that are independent of maximum message length, and uses a single asynchronous flit replication mechanism. The theoretical basis of the technique used here is sufficiently general to develop other tree-based multicasting algorithms for regular and irregular topologies. Simulation results demonstrate that this tree-based algorithm provides a very promising means of …

Design And Design Centers In Engineering Education, Clive L. Dym

All HMC Faculty Publications and Research

This paper is intended to be the opening salvo of the workshop, Computing Futures in Engineering Design (Dym, 1997). Thus, I want to take this privileged moment to ask you to think with me about the role of design in engineering. In particular, I want to reflect upon how design is articulated and how design is taught; about the role of design in engineering education and in the practice of engineering; and about the role that could be played locally and, perhaps, nationally by a center devoted to design education. Because I teach here at Harvey Mudd College (HMC), …

Optimal Contention-Free Unicast-Based Multicasting In Switch-Based Networks Of Workstations, Ran Libeskind-Hadas, Dominic Mazzoni '99, Ranjith Rajagopalan '99

All HMC Faculty Publications and Research

A unicast-based multicasting algorithm is presented for arbitrary interconnection networks arising in switch-based networks of workstations. The algorithm is optimal with respect tot he number of startups incurred and is provably free from depth contention. Specifically, no two constituent unicasts for the same multicast contend for a common channel, even if some unicasts are delayed due to unpredictable variations in latencies. The algorithm uses an underlying partially adaptive deadlock-free unicast routing algorithm. Simulation results indicate that the algorithm behaves as predicted by its theoretical properties and provides a promising approach to unicast-based multicasting.

Performance Of Prefiltered Model-Based Frequency Estimators, Mustafa A. Altınkaya, Bülent Sankur, Emin Anarım

Turkish Journal of Electrical Engineering and Computer Sciences

In this work, the performance improvement due to prefiltering of inputs in model-based frequency estimators is investigated based on simulation experiments. Initial estimates on the tone frequency locations, which are obtained via DFT peak picking type preanalysis, are used to design a prefilter to remove noise and interference. The simulations indicate that prefiltering can improve the accuracy of Pisarenko and AR frequency estimators and MUSIC and KT frequency estimators with low subspace order significantly. The SNR thresholds of model-based frequency estimators are lowered by prefiltering. Additionally, interesting trade-offs between prefiltering gain and the gain due to subspace noise filtering have …

Average-Case Lower Bounds For Noisy Boolean Decision Trees, William Evans, Nicholas Pippenger

All HMC Faculty Publications and Research

We present a new method for deriving lower bounds to the expected number of queries made by noisy decision trees computing Boolean functions. The new method has the feature that expectations are taken with respect to a uniformly distributed random input, as well as with respect to the random noise, thus yielding stronger lower bounds. It also applies to many more functions than do previous results. The method yields a simple proof of the result (previously established by Reischuk and Schmeltz) that almost all Boolean functions of n arguments require $\Me(n \log n)$ queries, and strengthens this bound from the …

Interestingness Of Discovered Association Rules In Terms Of Neighborhood-Based Unexpectedness, Guozhu Dong, Jinyan Li

Kno.e.sis Publications

One of the central problems in knowledge discovery is the development of good measures of interestingness of discovered patterns. With such measures, a user needs to manually examine only the more interesting rules, instead of each of a large number of mined rules. Previous proposals of such measures include rule templates, minimal rule cover, actionability, and unexpectedness in the statistical sense or against user beliefs.

In this paper we will introduce neighborhood-based interestingness by considering unexpectedness in terms of neighborhood-based parameters. We first present some novel notions of distance between rules and of neighborhood of rules. The neighborhood-based interestingness of …

Systolic Algorithm For Processing Rle Images, Hao Feng, Fikret Erçal, Filiz Bunyak

Computer Science Faculty Research & Creative Works

Image difference operation is commonly used in on-line automated printed circuit board (PCB) inspection systems as well as many other image processing applications. In this paper, we describe a new systolic algorithm and its system architecture which computes image differences in run-length encoded (RLE) format. The efficiency of this operation greatly affects the overall performance of the inspection system. It is shown that, for images with a high similarity measure, the time complexity of the systolic algorithm is a small constant. A formal proof of correctness for the algorithm is also given in the paper.

Java, Java, Java, Chaman Sabharwal

Computer Science Faculty Research & Creative Works

Everyone is talking about Java. The driving force for this chatter is Java''s simplicity and potential power. Java is programming language, and a language for the intranet and the World Wide Web (WWW). Java is a Write On one platform and Run on Many platforms (WORM) language. For network-friendly, platform-independent applications, Java (originally Oak) is an object oriented programming language. Java source code is compiled into a virtual machine code or bytecode. This makes the Java platform independent. It can be placed on a Web site, and executed on the client side on a PC-Intel, Mac, Motorola or UNIX-Solaris machine …

Generalized Ultrametrics, Domains And An Application To Computational Logic, Anthony K. Seda, Pascal Hitzler

Computer Science and Engineering Faculty Publications

Fixed points of functions and operators are of fundamental importance in programming language semantics in giving meaning to recursive definitions and to constructs which involve self-reference. It follows therefore that fixed-point theorems are also of fundamental importance in theoretical computer science. Often, order-theoretic arguments are available in which case the well-known Knaster-Tarski theorem can be used to obtain fixed-points. Sometimes, however, analytical arguments are needed involving the Banach contraction mapping theorem as is the case for example in studying concurrency and communicating systems. Situations arise also in computational logic in the presence of negation which force non-monotonicity of the operators …

Virtual Reality Modelling Of A Cnc Machine, Damian O'Sullivan

Theses

The increasing importance of training and upgrading skills has led to the use of new interactive technologies in the development of more effective training tools. Previous techniques for training Computer Numerical Control (CNC) machine operators, while excellent for their time, varied from brief inexpensive tutorials to expensive on the job training. A CNC machine uses a computer to perform the functions of the machine using a part program stored in the memory of the computer. This thesis describes a Virtual Reality (VR) model of a CNC milling machine, implemented within a VR environment representing a CNC workshop. Its development and …

Development And Utilization Of Parallel Generic Algorithms For Scientific Computations, Atanas Radenski, Andrew Vann, Boyana Norris

Mathematics, Physics, and Computer Science Faculty Books and Book Chapters

We develop generic parallel algorithms as extensible modules that encapsulate related classes and parallel methods. Extensible modules define common parallel structures, such as meshes, pipelines, or master-server networks in problem-independent manner. Such modules can be extended with sequential domain-specific code in order to derive particular parallel applications. In this paper, we first outline the essence of extensible modules. Then, we focus on a case study of the cellular automaton, a message-parallel generic algorithm from which we derive diverse parallel scientific applications.

Object-Oriented Programming And Parallelism, Atanas Radenski

Mathematics, Physics, and Computer Science Faculty Articles and Research

Initially, object-orientation and parallelism originated and developed as separate and relatively independent areas. During the last decade, however, more and more researchers were attracted by the benefits from a potential marriage of the two powerful paradigms. Numerous research projects and an increasing number of practical applications were aimed at different forms of amalgamation of parallelism with object-orientation. It has been realized that parallelism is a inherently needed enhancement for the traditional object-oriented programming (OOP) paradigm, and that object orientation can add significant flexibility to the parallel programming paradigm.

Considerations In Hpjava Language Design And Implementation, Guansong Zhang, Bryan Carpenter, Geoffrey C. Fox, Xinying Li, Yuhong Wen

Northeast Parallel Architecture Center

This paper discusses some design and implementation issues in the HPJava language. The language is briefly reviewed, then the class library that forms the foundation of the translation scheme is described. Through example codes, we illustrate how HPJava source codes can be translated straightforwardly to ordinary SPMD Java programs calling this library. This is followed by a discussion of the rationale for introducing the language in the first place, and of how various language features have been designed to facilitate efficient implementation.

Darp: Java-Based Data Analysis And Rapid Prototyping Environment For Distributed High Performance Computations, Erol Akarsu, Geoffrey C. Fox, Tomasz Haupt

Northeast Parallel Architecture Center

The integration of a compiled and interpreted HPF gives us an opportunity to design a powerful application development environment targeted for high performance parallel and distributed systems. This Web based system follows a three-tier model. The Java front-end holds proxy objects which can be manipulated with an interpreted Web client (a Java applet) interacting dynamically with compiled code through a tier-2 server. Although targeted for HPF back-end, the system’s architecture is independent of the back-end language, and can be extended to support other high performance languages.

Jworb - Java Web Object Request Broker For Commodity Software Based Visual Data Ow Metacomputing Programming Environment, Geoffrey C. Fox, Wojtek Furmanski, Hasan T. Ozdemir

Northeast Parallel Architecture Center

Programming environments and tools that are simultaneously sustainable, highly functional, robust and easy to use have been hard to come by in the HPDC area. This is partially due to the difficulty in developing sophisticated customized systems for what is relatively small part of the worldwide computing enterprise. As the commodity software becomes naturally distributed with the onset of Web and Intranets, we observe now a new trend in HPDC community [1, 8, 12] to base high performance computing on the modern enterprise computing technologies. .. JWORB is a multi-protocol Java server under development at NPAC, currently capable of handling …

Java/Corba Based Real-Time Infrastructure To Integrate Event-Driven Simulations, Collaboration And Distributed Object/Componentware Computing, Geoffrey C. Fox, Wojtek Furmanski, Hasan T. Ozdemir

Northeast Parallel Architecture Center

We are discussing the four major standard candidates for distributed object/componentware computing: Java, CORBA, COM and WOM within our proposed coordination framework we call Pragmatic Object Web (POW). We describe our integration approach based on multi-protocol middleware server JWORB (Java Web Object Request Broker) that currently integrates HTTP and IIOP and which we now further develop to also support COM and WOM core functionalities. We are also experimenting with visual data ow authoring front-ends using NPAC WebFlow system on top of JWORB based software bus. Finally, we illustrate our technologies in one major application domain- DoD Modeling and Simulation- where …

Language Bindings For A Data-Parallel Runtime, Bryan Carpenter, Geoffrey C. Fox, Donald Leskiw, Xinying Li, Yuhong Wen

Northeast Parallel Architecture Center

The NPAC kernel runtime, developed in the PCRC (Parallel Compiler Runtime Consortium) project, is a runtime library with special support for the High Performance Fortran data model. It provides array descriptors for a generalized class of HPF-like distributed arrays, support for parallel access to their elements, and a rich library of collective communication and arithmetic operations for manipulating these arrays. The library has been successfully used as a component in experimental HPF translation systems. With prospects for early appearance of fully-featured, efficient HPF compilers looking questionable, we discuss a class of more easily implementable data-parallel language extensions that preserve many …

Common Runtime Support For High Performance Languages, Geoffrey C. Fox

Northeast Parallel Architecture Center

Widespread adoption of parallel computing depends on the availability of improved software environments. An essential component of these environments will be high-level languages. Several languages for exploiting data-parallelism (or task-parallelism) have been developed, or are under development. The stated goal of this project has been to provide a public domain infrastructure for runtime support of these high-level languages. The targeted languages include parallel versions of Fortran and C++, but our intention has been to provide uniform runtime support for many source languages.

Object Web (Java/Corba) Based Rti To Support Metacomputing M&S, Geoffrey C. Fox, Wojtek Furmanski, Hasan T. Ozdemir

Northeast Parallel Architecture Center

We present here our Pragmatic Object Web based approach to High Performance Modeling and Simulation and we describe the associated middleware software recently prototyped at NPAC: JWORB (Java Web Object Request Broker) which integrates HTTP and IIOP protocols, and Object Web RTI which implements DMSO RTI 1.3 on top of the JWORB based CORBA / Java software bus. We explain how JWORB and OW RTI are used to build WebHLA – an interactive FMS training environment and we outline our plan towards WebHLA based Virtual Prototyping Environments for Testing, Evaluation and Simulation Based Acquisition.

Towards A Java Environment For Spmd Programming, Bryan Carpenter, Guansong Zhang, Geoffrey C. Fox, Xiaoming Li

Northeast Parallel Architecture Center

As a relatively straightforward object-oriented language, Java is a plausible basis for a scientific parallel programming language. We outline a conservative set of language extensions to support this kind of programming. The programming style advocated is Single Program Multiple Data (SPMD), with parallel arrays added as language primitives. Communications involving distributed arrays are handled through a standard library of collective operations. Because the underlying programming model is SPMD programming, direct calls to other communication packages are also possible from this language.

Techniques For Empirical Testing Of Parallel Random Number Generators, Paul D. Coddington, Sung-Hoon Ko

Northeast Parallel Architecture Center

Parallel computers are now commonly used for computational science and engineering, and many applications in these areas use random number generators. For some applications, such as large-scale Monte Carlo simulations, it is crucial that the random number generator have good randomness properties. Many programs are available for testing the quality of sequential random number generators, but very little work has been done on testing parallel random number generators. We present some techniques for empirical testing of random number generators on parallel computers, using tests based on computational science applications as examples. In particular, we focus on tests based on parallel …

A High Level Spmd Programming Model: Hpspmd And Its Java Language Binding, Guansong Zhang, Bryan Carpenter, Geoffrey C. Fox, Xinying Li

Northeast Parallel Architecture Center

This report introduces a new language, HPJava, for parallel programming on message passing systems. The language provides a high level SPMD programming model. Through examples and performance results, the features of the new programming style, and its implementation, are illustrated.

Parallel Probabilistic Computations On A Cluster Of Workstations, Atanas Radenski, Andrew Vann, Boyana Norris

Mathematics, Physics, and Computer Science Faculty Books and Book Chapters

Probabilistic algorithms are computationally intensive approximate methods for solving intractable problems. Probabilistic algorithms are excellent candidates for cluster computations because they require little communication and synchronization. It is possible to specify a common parallel control structure as a generic algorithm for probabilistic cluster computations. Such a generic parallel algorithm can be glued together with domain-specific sequential algorithms in order to derive approximate parallel solutions for different intractable problems.

In this paper we propose a generic algorithm for probabilistic computations on a cluster of workstations. We use this generic algorithm to derive specific parallel algorithms for two discrete optimization problems: the …

Use Of The Magnetic Field Generated By The Internal Distribution Of Injected Currents For Electrical Impedance Tomography (Mr-Eit), Y. Zi̇ya İder, Özlem Bi̇rgül

Turkish Journal of Electrical Engineering and Computer Sciences

In two dimensional conventional Electrical Impedance Tomography (EIT), volume conductor is probed by means of injected currents, and peripheral voltage measurements are used as input to the reconstruction algorithm. The current that flows in the 2D object creates magnetic fields that are perpendicular to the plane of imaging. Such magnetic fields can be measured using magnetic resonance tomography. In this study, use of this magnetic field generated by the injected currents, for the purpose of reconstructing the conductivity distribution, is studied. Sensitivity matrix relating the magnetic field to the element conductivities is calculated using the Finite Element Method and Biot-Savart …

Observation Of Doubly-Charmed B Decays At Lep, R. Barate, M. Thulasidas

Research Collection School Of Computing and Information Systems

A search for doubly-charmed B decays with both charmed mesons reconstructed is performed, using about 3.8 million hadronic Z decays recorded with the ALEPH detector at LEP. A clear signal is observed in the channels B→DsD¯(X)B→DsD¯(X) and B→DD¯(X)B→DD¯(X) (where D can be either a D00, a D++ or a D∗+∗+), providing the first direct evidence for doubly-charmed B decays involving no DsDs production. Evidence for associated K0SKS0 and K±K± production in the decays B→DD¯(X)B→DD¯(X) is also presented and some candidates for completely reconstructed decays B→DsD¯(nπ)B→DsD¯(nπ), B→DD¯K0SB→DD¯KS0 and B→DD¯K±B→DD¯K± are observed. Furthermore, candidates for the two-body Cabibbo suppressed decays B0→D∗−D∗+B0→D∗−D∗+ and …