Computer Sciences Commons^™

Classroom Exercises For Grid Services, Amy Apon, Jens Mache, Yuriko Yara, Kurt Landrus

Presentations

No abstract provided.

View Direction, Surface Orientation And Texture Orientation For Perception Of Surface Shape, Colin Ware, Graeme Sweet

Center for Coastal and Ocean Mapping

Textures are commonly used to enhance the representation of shape in non-photorealistic rendering applications such as medical drawings. Textures that have elongated linear elements appear to be superior to random textures in that they can, by the way they conform to the surface, reveal the surface shape. We observe that shape following hache marks commonly used in cartography and copper-plate illustration are locally similar to the effect of the lines that can be generated by the intersection of a set of parallel planes with a surface. We use this as a basis for investigating the relationships between view direction, texture …

Indexing Genomic Databases, Gina Cooper, Michael L. Raymer, Travis E. Doom, Dan E. Krane, Natsuhiko Futamura

Kno.e.sis Publications

Current biological sequence comparison tools utilize full database searches to find approximate matches between a database and a query. A new approach to sequence comparisons can be performed by indexing the database using a novel indexing scheme. An indexed scheme can immediately eliminate highly mismatched sequences thereby improving performance and accuracy. iBlast is proposed as an indexed version of BLAST. In its initial implementation, iBlast uses a sequence-based index to catalog genomic databases in an NCR Teradata RDBMS. Several types of indexes and querying methods are explored to determine the most efficient solution utilizing the parallel nature of the Teradata …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 20, Number 7, May 2004, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

An eight page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

A Holesome File System, Darren Erik Vengroff, David Kotz

Computer Science Technical Reports

We present a novel approach to fully dynamic management of physical disk blocks in Unix file systems. By adding a single system call, zero, to an existing file system, we permit applications to create holes, that is, regions of files to which no physical disk blocks are allocated, far more flexibly than previously possible. zero can create holes in the middle of existing files. Using zero, it is possible to efficiently implement applications including a variety of databases and I/O-efficient computation systems on top of the Unix file system. zero can also be used to implement an efficient file-system-based paging …

Dependency Management In Distributed Settings (Poster Abstract), Guanling Chen, David Kotz

Dartmouth Scholarship

Ubiquitous-computing environments are heterogeneous and volatile in nature. Systems that support ubicomp applications must be self-managed, to reduce human intervention. In this paper, we present a general service that helps distributed software components to manage their dependencies. Our service proactively monitors the liveness of components and recovers them according to supplied policies. Our service also tracks the state of components, on behalf of their dependents, and may automatically select components for the dependent to use based on evaluations of customized functions. We believe that our approach is flexible and abstracts away many of the complexities encountered in ubicomp environments. In …

Fusion And Perspective Correction Of Multiple Networked Video Sensors, Christopher E. Neely, John W. Lookwood

All Computer Science and Engineering Research

A network of adaptive processing elements has been developed that transforms and fuses video captured from multiple sensors. Unlike systems that rely on end-systems to process data, this system distributes the computation throughout the network in order to reduce overall network bandwidth. The network architecture is scalable because it uses a hierarchy of processing engines to perform signal processing. Nodes within the network can be dynamically reprogrammed in order to compose video from multiple sources, digitally transform camera perspectives, and adapt the video format to meet the needs of specific applications. A prototype has been developed using reconfigurable hardware that …

Mool: An Object-Oriented Programming Language With Generics And Modules., María Lucía Barrón Estrada

Theses and Dissertations

Modern object-oriented languages like Java and C# do not support parametric polymorphism and do not have a traditional module system to allow the development of large systems. They overload the class mechanism with several tasks and they use packages and namespaces to organize clusters of classes providing weak control for accessing members. Other languages that support generic programming and objects do not have a simple object model to support object-oriented features. In this thesis the language MOOL is presented. MOOL is a class-based object-oriented language that supports modular programming and genericity. The main goal in the design of MOOL was …

A Vulnerability Assessment Of The East Tennessee State University Administrative Computer Network., James Patrick Ashe

Electronic Theses and Dissertations

A three phase audit of East Tennessee State University's administrative computer network was conducted during Fall 2001, Spring 2002, and January 2004. Nmap and Nessus were used to collect the vulnerability data. Analysis discovered an average of 3.065 critical vulnerabilities per host with a low of 2.377 in Spring 2001 to a high of 3.694 in Fall 2001. The number of unpatched Windows operating system vulnerabilities, which accounted for over 75% of these critical vulnerabilities, strongly argues for the need of an automated patch deployment system for the approximately 3,000 Windows-based systems at ETSU.

The Structure Of Optimal Partitions Of Orthogonal Polygons Into Fat Rectangles, Joseph O'Rourke, Geetika Tewari

Computer Science: Faculty Publications

Motivated by a VLSI masking problem, we explore partitions of an orthogonal polygon of n vertices into isothetic rectangles that maximize the shortest rectangle side over all rectangles. Thus no rectangle is "thin"; all rectangles are "fat". We show that such partitions have a rich structure, more complex than what one might at first expect. For example, for partitions all "cuts" of which are anchored on the boundary, sometimes cuts are needed 1/2 or 1/3 of the distance between two polygon edges, but they are never needed at fractions with a larger denominator. Partitions using cuts without any restrictions seem …

Worm Meets Beehive, Xuxian Jiang, Dongyan Xu, Shan Lei, Paul Ruth, Jianzhong Sun

Department of Computer Science Technical Reports

No abstract provided.

Towards The Design Of Robust Peer-To- Peer Communities, Ioannis Ioannidis, Ananth Y. Grama

Department of Computer Science Technical Reports

No abstract provided.

Itguru - A Powerful Network Simulation Environment For Teaching And Research, Victor A. Clincy

Faculty Articles

ITGuru is a powerful simulation environment developed by OpNET Corporation. ITGuru is unique because of its ability to model the entire network, including its routers, switches, protocols, servers, and the individual applications they support. ITGuru improves network designers and instructors the ability to identify and solve problems throughout their network. ITGuru assesses application impact, automates diagnostic testing, expedites server capacity planning and consolidation, analyzes failure impact, and enables network growth planning

Performance Planning, Quality-Of-Service, And Pricing Under Competition, Corinne Touati, Parijat Dube, Laura Wynter

Research Collection School Of Computing and Information Systems

In this work we model the relationship between the capacity and the Quality of Service (QoS) offered by the firm in a competitive scenario of two firm’s working to maximize their profits. Using simple queueing theoretic models we study the sensitivity of a firm’s market share to price, capacity and market size. Our preliminary studies yield important properties of the equilibrium solution which may further provide important “engineering” guidelines for performance planning and pricing strategies.

Introduction To The Special Issue On Human–Robot Interaction, Robin R. Murphy, Erika Rogers

Computer Science and Software Engineering

No abstract provided.

Simulation Validation Using Direct Execution Of Wireless Ad-Hoc Routing Protocols, Jason Liu, Yougu Yuan, David M. Nicol, Robert S. Gray, Calvin C. Newport, David Kotz, Luiz Felipe Perrone

Dartmouth Scholarship

Computer simulation is the most common approach to studying wireless ad-hoc routing algorithms. The results, however, are only as good as the models the simulation uses. One should not underestimate the importance of \em validation, as inaccurate models can lead to wrong conclusions. In this paper, we use direct-execution simulation to validate radio models used by ad-hoc routing protocols, against real-world experiments. This paper documents a common testbed that supports direct execution of a set of ad-hoc routing protocol implementations in a wireless network simulator. The testbed reads traces generated from real experiments, and uses them to drive direct-execution implementations …

Run-Time Modification Of The Class Hierachy In A Live Java Development Environment, Joel R. Brandt

All Computer Science and Engineering Research

Class hierarchy design is central to object-oriented software development. How-ever, it is sometimes difficult for developers to anticipate all the implications of a design until implementation is underway. To support experimentation with different designs, we extend prior work on live development environments to allow run-time modification of the class hierarchy. The result is a more fluid object-oriented development process, in which immediate feedback from the executing program can be used to guide hierarchy design. This thesis presents a framework and developer support for run-time modification of class inheritance relations in JPie, a live visual programming environment for Java. Most notably, …

A Stage Model For E-Government Implementation, Keng Siau, Y. Long

Research Collection School Of Computing and Information Systems

With the advancement of wired and wireless technologies in recent years, the concept of an e-government has attracted increasing interests from both researchers and practitioners. The E-Government Act of 2002 was signed into law by President Bush to encourage government agencies to efficiently and effectively serve their customers over the Web. E-government presents a way for government agencies to use new technologies, such as the Internet, to provide citizens, businesses, and other governments with a more convenient access to government information and services, to improve the quality of services, and to provide greater opportunities for citizens to participate in democratic …

Multi-Period Multi-Dimensional Knapsack Problem And Its Application To Available-To-Promise, Hoong Chuin Lau, M. K. Lim

Research Collection School Of Computing and Information Systems

This paper is motivated by a recent trend in logistics scheduling, called Available-to-Promise. We model this problem as the multi-period multi-dimensional knapsack problem. We provide some properties for a special case of a single-dimensional problem. Based on insights obtained from these properties, we propose a two-phase heuristics for solving the multi-dimensional problem. We also propose a novel time-based ant colony optimization algorithm. The quality of the solutions generated is verified through experiments, where we demonstrate that the computational time is superior compared with integer programming to achieve solutions that are within a small percentage of the upper bounds.

Web Image Learning For Searching Semantic Concepts In Image Databases, Steven Hoi, Michael R. Lyu

Research Collection School Of Computing and Information Systems

Without textual descriptions or label information of images, searching semantic concepts in image databases is still a very challenging task. While automatic annotation techniques are yet a long way off, we can seek other alternative techniques to solve this difficult issue. In this paper, we propose to learn Web images for searching the semantic concepts in large image databases. To formulate effective algorithms, we suggest to engage the support vector machines for attacking the problem. We evaluate our algorithm in a large image database and demonstrate the preliminary yet promising results.

Solving Combinatorial Optimization Problems Using A New Algorithm Based On Gravitational Attraction, Barry Lynn Webster

Theses and Dissertations

This dissertation represents the culmination of research into the development of a new algorithm for locating optimal solutions to difficult problems. This new algorithm is founded upon one of the most basic concepts in nature - so basic that it is in fact one of the four primary forces in physics: gravity. It is called the Gravitational Emulation Local Search algorithm, or GELS. Four variants of the algorithm were developed, representing combinations of two basic methods of operation and two modes of search space exploration. Following development, a series of experiments were conducted to assess the capabilities of this new …

Modified Art 2a Growing Network Capable Of Generating A Fixed Number Of Nodes, Ji He, Ah-Hwee Tan, Chew-Lim Tan

Research Collection School Of Computing and Information Systems

This paper introduces the Adaptive Resonance Theory under Constraint (ART-C 2A) learning paradigm based on ART 2A, which is capable of generating a user-defined number of recognition nodes through online estimation of an appropriate vigilance threshold. Empirical experiments compare the cluster validity and the learning efficiency of ART-C 2A with those of ART 2A, as well as three closely related clustering methods, namely online K-Means, batch K-Means, and SOM, in a quantitative manner. Besides retaining the online cluster creation capability of ART 2A, ART-C 2A gives the alternative clustering solution, which allows a direct control on the number of output …

Power Adaptation Based Optimization For Energy Efficient Reliable Wireless Paths, Suman Banerjee, Archan Misra

Research Collection School Of Computing and Information Systems

We define a transmission power adaptation-based routing technique that finds optimal paths for minimum energy reliable data transfer in multi-hop wireless networks. This optimal choice of the transmission power depends on the link distance between the two nodes and the channel characteristics. Typical energy efficient routing techniques use a transmission power such that the received signal power at the destination minimally exceeds a desired threshold signal strength level. In this paper we argue that such a choice of the transmission power does not always lead to optimal energy routes, since it does not consider differences in the receiver noise levels.We …

Toolglasses, Marking Menus, And Hotkeys: A Comparison Of One And Two-Handed Command Selection Techniques, Daniel L. Odell, Richard C. Davis, Andrew Smith, Paul K. Wright

Research Collection School Of Computing and Information Systems

This paper introduces a new input technique, bimanual marking menus, and compares its performance with five other techniques: static toolbars, hotkeys, grouped hotkeys, marking menus, and toolglasses. The study builds on previous work by setting the comparison in a commonly encountered task, shape drawing. In this context, grouped hotkeys and bimanual marking menus were found to be the fastest. Subjectively, the most pre-ferred input method was bimanual marking menus. Toolglass performance was unexpectedly slow, which hints at the importance of low-level toolglass imple-mentation choices.

Web-Based Trend Analysis Of Rocket Data Using Xml, Mark Randall Gibson

Theses and Dissertations

This paper will discuss and prove the feasibility of using XML to transfer, compare, and view data created during automated testing of black boxes; stored both in simple text format and relational database format. This system arises from the need for the reliability department to review the test data from the flight hardware at all testing locations. For the purposes of this paper we will refer to this system as the "Test Data Retrieval System" (TDRS). This data review is being done to determine if there are any negative trends in the hardware that may be surfacing. This data resides …

Learning States For Detecting Anomalies In Time Series, Stan Weidner Salvador

Theses and Dissertations

The normal operation of a device can be characterized in different operational states. To identify these states, we introduce a segmentation algorithm called Gecko that can determine a reasonable number of segments using our proposed L method. We then use the RIPPER classification algorithm to describe these states in logical rules. Finally, transitional logic between the states is added to create a finite state automation. Multiple time series data may be used for training, by merging several time series into a single representative time series using dynamic time warping. Our empirical results, on data obtained from the NASA shuttle program, …

Automatic Determination Of Factors For Real-Time Garbage Collection, Tobias Mann, Ron K. Cytron

All Computer Science and Engineering Research

Several approaches to hard, real-time garbage collection have been recently proposed. All of these approaches require knowing certain statistical properties about a program's execution, such as the maximum extent of live storage, the rate of storage allocation, and the number of non-null object references. While these new approaches offer the possibility of guaranteed, reasonably bounded behavior for garbage collection, the determination of the required information may not be straight forward for the application programmer. In this paper we present evidence suggesting that the necessary factors can vary widely over the program's execution, indicating that an automatic, phased approach may be …

Development Of Integrated Process Simulation System Model For Spent Fuel Treatment Facility (Sftf) Design, Yitung Chen, Sean Hsieh

Separations Campaign (TRP)

The Advanced Fuel Cycle Initiative (AFCI) and Transmutation Research Program-University Participation Program (TRP-UPP) supported by Department of Energy of the United States have been developing many important technologies for the transmutation of nuclear waste to address long-term disposal issues. While successfully embedding AMUSE module into a dedicated System Engineering Model (TRPSEMPro), developed by the Nevada Center for Advanced Computational Methods (NCACM) at the University of Nevada-Las Vegas collaborating with Argonne National Laboratory (ANL), ANL is interested in further simulating the Light Water Reactor (LWR) Spent Fuel Treatment Facility (SFTF) combining commercial process simulation and analysis packages and core calculation of …

Factorization Of Polynomials And Real Analytic Function, Radoslaw L. Stefanski

Honors Theses

In this project, we address the question: When can a polynomial p(x, y) of two variables be factored as p(x, y) = f(x)g(y), where f and g are polynomials of one variable. We answer this question, using linear algebra, and create a Mathematica program which carries out this factorization. For example,

3+3x-5x^3+y+xy-5/3x^3y+y^2+xy^2-5/3x^3y^2 = (1+x-5/3x^3)(3+y+y^2)

We then generalize this concept and ask: When can p(x,y) can be written as

p(x,y) = f1(x)g2(y)+f2(x)g2(y)+...+fr(x)gr(y)

where fj,gj are polynomials. This can certainly be done (for large enough r). Which is the minimum such r? Again, we have a Mathematica program which carries out this …

Detection Of Closed Hyperstreamlines, Thomas Wischgoll

Computer Science and Engineering Faculty Publications

No abstract provided.