Computer Sciences Commons^™

Computer Science: A Guide To Selected Resources On The Internet., Michael Knee

University Libraries Faculty Scholarship

No abstract provided.

Multi -Mission Attitude Determination System For Balloon Flight, Liping Mo

Doctoral Dissertations

MADS (Multi-mission Attitude Determination System) is a new software package used to determine the attitude of instruments on a high-altitude balloon employed for scientific experiments. There is no existing system for the automated determination of the attitude of instruments in balloon experiments, so we have developed MADS to do the data analysis for balloon experiments to find the location of astrophysical sources such as gamma-ray or x-ray sources.

The two areas that required most work were modeling star trackers and modeling the motion of the balloon. Star trackers are used on satellites, but are far too expensive and sophisticated to …

An Investigation Into The Use Of Software Code Metrics In The Industrial Software Development Environment, Tim Littlefair

Theses: Doctorates and Masters

This work describes a project that investigates the use of software metrics based on measurement of source code in industrial software development. Literature is examined relating to considerations of quality in industry; to software engineering; to emergent technologies in the software industry including the object-oriented paradigm and software patterns; to software product and process metrics; and to cultural factors affecting workplaces in the software industry. It then expounds theoretical and practical work aimed at specifying, designing and implementing a source code analyzer for use in a typical industrial project setting. There is an explanation of the design and outcomes of …

A Java Graphical User Interface For Large-Scale Scientific Computations In Distributed Systems, X Shen, George K. Thiruvathukal, Wei-Keng Liao, Alok Choudhary, A Singh

Computer Science: Faculty Publications and Other Works

Large-scale scientific applications present great challenges to computational scientists in terms of obtaining high performance and in managing large datasets. These applications (most of which are simulations) may employ multiple techniques and resources in a heterogeneously distributed environment. Effective working in such an environment is crucial for modern large-scale simulations. In this paper, we present an integrated Java graphical user interface (IJ-GUI) that provides a control platform for managing complex programs and their large datasets easily. As far as performance is concerned, we present and evaluate our initial implementation of two optimization schemes: data replication and data prediction. Data replication …

[Introduction To] Schaum's Outline Programming With C++, John R. Hubbard

Bookshelf

Tough Test Questions? Missed Lectures? Not Enough Time?

Fortunately for you, there's Schaum's Outlines. More than 40 million students have trusted Schaum's to help them succeed in the classroom and on exams. Schaum's is the key to faster learning and higher grades in every subject. Each Outline presents all the essential course information in an easy-to-follow, topic-by-topic format. You also get hundreds of examples, solved problems, and practice exercises to test your skills.

This Schaum's Outline gives you

• Practice problems with full explanations that reinforce knowledge
• Coverage of the most up-to-date developments in your course field
• In-depth review of practices …

An Adaptive Hierarchical Fuzzy Logic System For Modelling And Prediction Of Financial Systems, Mark Kingham

Theses: Doctorates and Masters

In this thesis, an intelligent fuzzy logic system using genetic algorithms for the prediction and modelling of interest rates is developed. The proposed system uses a Hierarchical Fuzzy Logic system in which a genetic algorithm is used as a training method for learning the fuzzy rules knowledge bases. A fuzzy logic system is developed to model and predict three month quarterly interest rate fluctuations. The system is further trained to model and predict interest rates for six month and one year periods. The proposed system is developed with first two, three, then four and finally five hierarchical knowledge bases to …

Scis Networking - Summer-Fall 1998, Nova Southeastern University

CCIS Networking / SCIS Networking magazines

No abstract provided.

Design And Implementation Of Triveni: A Process-Algebraic Api For Threads + Events, Christopher P. Colby, Lalita Jategaonkar Jagaeesan, Radhakrishnan Jagadeesan, Konstantin Laufer, Carlos Puchol

Computer Science: Faculty Publications and Other Works

We describe Triveni, a framework and API for integrating threads and events. The design of Triveni is based on an algebra, including preemption combinators, of processes. Triveni is compatible with existing threads standards, such as Pthreads and Java threads, and with the event models structured on the Observer pattern. We describe the software architecture and algorithms underlying a concrete implementation of Triveni in Java. This environment includes specification based testing of safety properties. The results described in the paper have been used to integrate process-algebraic methods into (concurrent) object orientated programming.

[Introduction To] Schaum's Outlines Fundamentals Of Computing With C++, John R. Hubbard

Bookshelf

This book is intended to be used primarily for self study, preferably in conjunction with a regular course in the fundamentals of computer science using the new ANSI/ISO Standard C++. The book covers topics from the fundamental units of the 1991 A.C.M. computing curricula.

Wide-Area Implementation Of The Message Passing Interface, Ian Foster, Jonathan Geisler, William Gropp, Nicholas Karonis, Ewing Lusk, George K. Thiruvathukal, Steven Tuecke

Computer Science: Faculty Publications and Other Works

The Message Passing Interface (MPI) can be used as a portable, high-performance programming model for wide-area computing systems. The wide-area environment introduces challenging problems for the MPI implementor, due to the heterogeneity of both the underlying physical infrastructure and the software environment at different sites. In this article, we describe an MPI implementation that incorporates solutions to these problems. This implementation has beenconstructed by extending the Argonne MPICH implementation of MPI to use communicationservices provided by the Nexus communication library and authentication, resource allocation, process creation/management, and information services provided by the I-Soft system (initially) and the Globus metacomputing toolkit …

A Methodology For The Selection Of A Paradigm Of Reasoning Under Uncertainty In Expert System Development, Vivian Campbell

Theses: Doctorates and Masters

The aim of this thesis is to develop a methodology for the selection of a paradigm of reasoning under uncertainty for the expert system developer. This is important since practical information on how to select a paradigm of reasoning under uncertainty is not generally available. The thesis explores the role of uncertainty in an expert system and considers the process of reasoning under uncertainty. The possible sources of uncertainty are investigated and prove to be crucial to some aspects of the methodology. A variety of Uncertainty Management Techniques (UMTs) are considered, including numeric, symbolic and hybrid methods. Considerably more information …

Technologies For Ubiquitous Supercomputing: A Java Interface To The Nexus Communication System, Ian Foster, George K. Thiruvathukal, Steven Tuecke

Computer Science: Faculty Publications and Other Works

We use the term ubiquitous supercomputing to refer to systems that integrate low- and mid-range computing systems, advanced networks and remote high-end computers with the goal of enhancing the computational power accessible from local environments. Such systems promise to enable new applications in areas as diverse as smart instruments and collaborative environments. However, they also demand tools for transporting code between computers and for establishing flexible, dynamic communication structures. In this article, we propose that these requirements be satisfied by introducing Java classes that implement the global pointer and remote service request mechanisms defined by a communication library called Nexus. …

Just Which Reality Do You Mean? Users' Experiences Of Virtual Spaces, Woodrow Heath Pollack

Senior Scholar Papers

Virtual Reality is a relatively new technology in the relatively young field of computer science. The design of Virtual Reality has only recently come into discussion, as well as the implications for this sort of design. I hope to determine how a user can work most efficiently and accurately in a Virtual World. By studying this, I hope to help in the standardization of Virtual Reality design.

Scis Networking - January 1997, Nova Southeastern University

CCIS Networking / SCIS Networking magazines

No abstract provided.

An Approach To Display Layout Of Dynamic Windows, Nihar Trivedi

Theses: Doctorates and Masters

The development of windows based user interface has introduced a new dimension to the field of human computer interaction. Now a user is able to perform multiple tasks at a time, often switching from one task to another. However windows environment also imposes the burden of manual windows management on the user. Several studies have suggested that manual window management is an unproductive chore often resulting in clutter and confusion on the display screen. Therefore we need a automatic windows layout generator to free the user to perform other useful tasks. This thesis introduces SPORDAC {Shadow Propagation for Overlap Removal …

Teaching Ethical Issues In Computer Science: What Worked And What Didn't, Kay G. Schulze, Frances Grodzinsky

School of Computer Science & Engineering Faculty Publications

It is the role of computer science educators to ensure that students have a firm foundation in the social and ethical issues of the discipline.

Putting Type Annotations To Work, Martin Odersky, Konstantin Laufer

Computer Science: Faculty Publications and Other Works

We study an extension of the Hindley/Milner system with explicit type scheme annotations and type declarations. The system can express polymorphic function arguments, user-defined data types with abstract components, and structure types with polymorphic fields. More generally, all programs of the polymorphic lambda calculus can be encoded by a translation between typing derivations. We show that type reconstruction in this system can be reduced to the decidable problem of first-order unification under a mixed prefix.

A Search Tool To Enhance The Selection And Utilisation Of Reusable Software Modules Within The Object-Oriented Paradigm, Robert H. Cross

Theses: Doctorates and Masters

The affinity for reuse within the object-oriented paradigm may enable high levels of productivity; however, gains will become realisable only if a systems developer has access to tools which aid in the selection of classes. A method for object-oriented analysis and design is detailed and its process is assisted by an object-oriented search tool based on reference and corporate library technology. The search tool contributes to the determination of suitable existing inheritable classes and an explanation of its construction and use is included. A practical demonstration of the method, using the search tool, is elaborated. The thesis demonstrates that text …

Time- And Cost-Optimal Parallel Algorithms For The Dominance And Visibility Graphs, D. Bhagavathi, H. Gurla, S. Olariu, J. L. Schwing, J. Zhang

Computer Science Faculty Publications

The compaction step of integrated circuit design motivates associating several kinds of graphs with a collection of non-overlapping rectangles in the plane. These graphs are intended to capture various visibility relations amongst the rectangles in the collection. The contribution of this paper is to propose time- and cost-optimal algorithms to construct two such graphs, namely, the dominance graph (DG, for short) and the visibility graph (VG, for short). Specifically, we show that with a collection of n non-overlapping rectangles as input, both these structures can be constructed in θ (log n) time using n processors in the CREW model.

Packet Routing In Networks With Long Wires, Ronald I. Greenberg, Hyeong-Cheol Oh

Computer Science: Faculty Publications and Other Works

In this paper, we examine the packet routing problem for networks with wires of differing length. We consider this problem in a network independent context, in which routing time is expressed in terms of "congestion" and "dilation" measures for a set of packet paths. We give, for any constant ϵ > 0, a randomized on-line algorithm for routing any set of Npackets in O((C lg^ϵ(Nd) + D lg(Nd))/lg lg(Nd)) time, where C is the maximum congestion and D is the length of the longest path, both taking wire delays into …

Scis Networking - July 1995, Nova Southeastern University

CCIS Networking / SCIS Networking magazines

No abstract provided.

Tact Volume 4 Issue 1, Touro College Department Of Academic Computing

Yearbooks and Newsletters

"Touro Academic Computing Technologies: The Newsletter of Academic Computing at Touro College"

Scis Networking - January 1995, Nova Southeastern University - Shepard Broad College Of Law

CCIS Networking / SCIS Networking magazines

No abstract provided.

Finding Connected Components On A Scan Line Array Processor, Ronald I. Greenberg

Computer Science: Faculty Publications and Other Works

This paper provides a new approach to labeling the connected components of an n x n image on a scan line array processor (comprised of n processing elements). Variations of this approach yield an algorithm guaranteed to complete in o(n lg n) time as well as algorithms likely to approach O(n) time for all or most images. The best previous solutions require using a more complicated architecture or require Omega(n lg n) time. We also show that on a restricted version of the architecture, any algorithm requires Omega(n lg n) time in the worst case.

The Fat-Pyramid And Universal Parallel Computation Independent Of Wire Delay, Ronald I. Greenberg

Computer Science: Faculty Publications and Other Works

This paper shows that a fat-pyramid of area Θ(A) requires only O(log A) slowdown to simulate any competing network of area A under very general conditions. The result holds regardless of the processor size (amount of attached memory) and number of processors in the competing networks as long as the limitation on total area is met. Furthermore, the result is valid regardless of the relationship between wire length and wire delay. We especially focus on elimination of the common simplifying assumption that unit time suffices to traverse a wire regardless of its length, since the assumption becomes more and more …

A Macro Extension For The Woody Assembly Language, Lewis Barnett Iii

Department of Math & Statistics Technical Report Series

We discuss an extension to the Woody Assembly Language [Cha94] which allows new instructions to be defined. The mechanism is similar to the C language's #define macros, allowing a name to be supplied for a piece of code which will be expanded in line. Provisions are made for writing new non-destructive branching instructions as well as instructions which are simply new names for commonly used bits of code.

An Algorithmic Palette Tool, Gary R. Greenfield

Department of Math & Statistics Technical Report Series

Our algorithmic tool follows the model of RGB percentage curves, but now the control of these curves is though algorithms that indirectly, and more abstractly, create, evolve, and modify such curves. To fully explain our methods we must first introduce the topic "mutating expressions." This is done in Section Two. In Section Three we document the user-interface problems we dealt with, and finally in Section Four discuss conclusions and suggest ideas for future exploration. Before commencing with the technical details however, we wish to emphasize the nature of the "colorization" problem that led to the conception and development of our …

Fast Accurate Simulation Of Large Shared Memory Multiprocessors, Bob Boothe Phd

Faculty Publications

Fast computer simulation is an essential tool in the design of large parallel computers. We discuss the design and performance of our Fast Accurate Simulation Tool, FAST. We start by summarizing the tradeoffs made in the designs of this and other simulators. The key ideas used in this simulator involve execution driven simulation techniques that modify the object code of the application program being studied. This produces an augmented version of the code that is directly executed and performs much of the work of the simulation. We extend the previous work in execution driven simulation by introducing several new uses …

Merlin's Magic Square Enhanced, Gary R. Greenfield

Department of Math & Statistics Technical Report Series

This paper first considers questions about games related to Merlin's Magic Square from the point of view of group actions. At this juncture, little beyond the formal model is new, but the exposition sets the stage for considering certain "enhanced" versions of these games. The analysis of enhanced games, with the aid of semigroup actions, is carried out in complete detail for an ostensibly simpler (k = 3) game before turning to a Merlin ( k = 4) game. Concluding sections discuss various ways to generalize our games.

To review the solution to Merlin's Magic Square, we begin by introducing …

Distributed Memo: A Heterogeneously Distributed And Parallel Software Development Environment, William T. O'Connell, George K. Thiruvathukal, Thomas W. Christopher

Computer Science: Faculty Publications and Other Works

Heterogeneously distributed and parallel computing environments are highly dependent on hardware, data migration, and protocols. The result is significant difficulty in software reuse, portability across platforms, and an increased overall development effort. The appearance of a shared directory of unordered queues can be provided by integrating heterogeneous computers transparently. This integration provides a conducive environment for parallel and distributed application development, by abstracting the issues of hardware and communication. Object oriented technology is exploited to provide this seamless environment.