Computer Sciences Commons^™

A Round Trip Time And Timeout Aware Traffic Conditioner For Differentiated Services Networks, Ahsan Habib, Bharat Bhargava, Sonia Fahmy

Department of Computer Science Technical Reports

No abstract provided.

Parameter Synthesis Of Higher Kinematic Planars, Min-Ho Kyung, Elisha Sacks

Department of Computer Science Technical Reports

No abstract provided.

Using Ssm Proxies To Provide Efficient Multiple-Source Multicast Delivery, Daniel Zappala, Aaron Fabbri

Faculty Publications

We consider the possibility that single-source multicast (SSM) will become a universal multicast service, enabling large-scale distribution of content from a few well-known sources to a general audience. Operating under this assumption, we explore the problem of building the traditional IP model of any-source multicast on top of SSM. Toward this end, we design an SSM proxy service that allows any sender to efficiently deliver content to a multicast group. We demonstrate the performance improvements this service offers over standard SSM and describe extensions for access control, dynamic proxy discovery, and multicast proxy distribution.

Ecdis Development Laboratory And Navigation Technology Demonstration Center, Lee Alexander, Maxim F. Van Norden, Charles M. Fralick

Center for Coastal and Ocean Mapping

The U.S. Navy is undergoing a major transition from traditional, paper chart navigation to computer-based electronic charting. The Chief of Naval Operations (CNO) has mandated that all Navy ships will navigate strictly through electronic means by FY07. However, due to some recent groundings, the Navy is now striving to accelerate the full implementation of electronic navigation by FY04. The Naval Oceanographic Office (NAVOCEANO) is making a concerted effort to support this transition with upgrades to state-of-the-art survey ships, instrumentation, and data processing equipment. NAVOCEANO is increasing its capability to rapidly collect and process hydrographic survey data, and to quickly produce …

Hierarchical Text Classification And Evaluation, Aixin Sun, Ee Peng Lim

Research Collection School Of Computing and Information Systems

Hierarchical Classification refers to assigning of one or more suitable categories from a hierarchical category space to a document. While previous work in hierarchical classification focused on virtual category trees where documents are assigned only to the leaf categories, we propose atop-down level-based classification method that can classify documents to both leaf and internal categories. As the standard performance measures assume independence between categories, they have not considered the documents incorrectly classified into categories that are similar or not far from the correct ones in the category tree. We therefore propose the Category-Similarity Measures and Distance-Based Measures to consider the …

Privacy Protection For Transactions Of Digital Goods, Feng Bao, Robert H. Deng

Research Collection School Of Computing and Information Systems

In this paper we study the problem of how to protect users’ privacy in web transactions of digital goods. In particular, we introduce a system which allows a user to disclose his/her identity information (such as user account or credit card number) to a web site in exchange for a digital item, but prevents the web site from learning which specific item the user intends to obtain. The problem concerned here is orthogonal to the problem of anonymous transactions [RSG98], [RR98] but commensurate with the general problem of PIR (private information retrieval) [CGK95]

Computational Geometry Column 42, Joseph S. B. Mitchell, Joseph O'Rourke

Computer Science: Faculty Publications

A compendium of thirty previously published open problems in computational geometry is presented.

Prioritizing Test Cases For Regression Testing, Gregg Rothermel, Roland H. Untch, Chengyun Chu, Mary Jean Harrold

School of Computing: Faculty Publications

Test case prioritization techniques schedule test cases for execution in an order that attempts to increase their effectiveness at meeting some performance goal. Various goals are possible; one involves rate of fault detection - a measure of how quickly faults are detected within the testing process. An improved rate of fault detection during testing can provide faster feedback on the system under test and let software engineers begin correcting faults earlier than might otherwise be possible. One application of prioritization techniques involves regression testing - the retesting of software following modifications; in this context, prioritization techniques can take advantage of …

Reifying Communication At The Application Level, Andrew P. Black, Jie Huang, Jonathan Walpole

Computer Science Faculty Publications and Presentations

Middleware, from the earliest RPC systems to recent Object-Oriented Remote Message Sending (RMS) systems such as Java RMI and CORBA, claims transparency as one of its main attributes. Coulouris et al. define transparency as “the concealment from the … application programmer of the separation of components in a distributed system.” They go on to identify eight different kinds of transparency.

We considered titling this paper “Transparency Considered Harmful”, but that title is misleading because it implies that all kinds of transparency are bad. This is not our view. Rather, we believe that the choice of which transparencies should be offered …

Convergence Classes And Spaces Of Partial Functions, Anthony K. Seda, Roland Heinze, Pascal Hitzler

Computer Science and Engineering Faculty Publications

We study the relationship between convergence spaces and convergence classes given by means of both nets and filters, we consider the duality between them and we identify in convergence terms when a convergence space coincides with a convergence class. We examine the basic operators in the Vienna Development Method of formal systems development, namely, extension, glueing, restriction, removal and override, from the perspective of the Logic for Computable Functions. Thus, we examine in detail the Scott continuity, or otherwise, of these operators when viewed as operators on the domain (X → Y) of partial functions mapping X into …

Sensor-Assisted Video Mosaicing For Seafloor Mapping, Yuri Rzhanov, Randy G. Cutter Jr., Lloyd C. Huff

Center for Coastal and Ocean Mapping

This paper discusses a proposed processing technique for combining video imagery with auxiliary sensor information. The latter greatly simplifies image processing by reducing complexity of the transformation model. The mosaics produced by this technique are adequate for many applications, in particular habitat mapping. The algorithm is demonstrated through simulations and hardware configuration is described.

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 18, Number 2, October 2001, 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.

An Object-Oriented Resource Pool Model In Support Of Discrete Event Simulations, Srinivas Gullapalli

Electrical & Computer Engineering Theses & Dissertations

The proper distribution of resources is a key factor in simulation. Resources provide the supporting facilities, equipment, and personnel for carrying out activities. The number of resources has a direct impact on the overall effectiveness of the simulation as it does in real life. If the number is insufficient, it generally takes more time for the process to complete. On the other hand, if the number is too high, the cost incurred on the resources will be unnecessarily large. Therefore, the count should be a compromise between the two extremes.

In this thesis, an attempt is made to generalize the …

Application Performance On The Cross/ Linux Software Programmable Router, Prem Gopalan, Seung Chul Han, David K.Y. Yau, Xuxian Jiang, Puneet Zaroo

Department of Computer Science Technical Reports

No abstract provided.

Minimizing Latency And Jitter For Large Scale Multimedia Repositories Through Prefix Caching, Sunil Prabhakar, Rahul Chari

Department of Computer Science Technical Reports

No abstract provided.

A Review Of Data Mining Techniques, Sang Jun Lee, Keng Siau

Research Collection School Of Computing and Information Systems

Terabytes of data are generated everyday in many organizations. To extract hidden predictive information from large volumes of data, data mining (DM) techniques are needed. Organizations are starting to realize the importance of data mining in their strategic planning and successful application of DM techniques can be an enormous payoff for the organizations. This paper discusses the requirements and challenges of DM, and describes major DM techniques such as statistics, artificial intelligence, decision tree approach, genetic algorithm, and visualization.

On Clustering And Retrieval Of Video Shots, Chong-Wah Ngo, Ting-Chuen Pong, Hong-Jiang Zhang

Research Collection School Of Computing and Information Systems

Clustering of video data is an important issue in video abstraction, browsing and retrieval. In this paper, we propose a two-level hierarchical clustering approach by aggregating shots with similar motion and color features. Motion features are computed directly from 20 tensor histograms, while color features are represented by 30 color histograms. Cluster validity analysis is further applied to automatically determine the number of clusters at each level. Video retrieval can then be done directly based on the result of clustering. The proposed approach is found to be useful particularly for sports games, where motion and color are important visual cues …

Solar: Towards A Flexible And Scalable Data-Fusion Infrastructure For Ubiquitous Computing, Guanling Chen, David Kotz

Dartmouth Scholarship

As we embed more computers into our daily environment, ubiquitous computing promises to make them less noticeable and to avoid information overload. We see, however, few ubiquitous applications that are able to adapt to the dynamics of user, physical, and computational context. The challenge is to allow applications flexible access to these sources, and yet scale to thousands of devices and sensors. In this paper we introduce our proposed infrastructure, Solar. In Solar, information sources produce events. Applications may subscribe to interesting sources directly, or they may instantiate and subscribe to a tree of operators that filter, transform, merge and …

Modeling Irda Performance: The Effect Of Irlap Negotiation Parameters On Throughput, Scott V. Hansen, Charles D. Knutson, Michael G. Robertson, Franklin E. Sorenson

Faculty Publications

The Infrared Data Association's (IrDA) infrared data transmission protocol is a widely used mechanism for short-range wireless data communications. In order to provide flexibility for connections between devices of potentially disparate capabilities, IrDA devices negotiate the values of several transmission parameters based on the capabilities of the devices establishing the connection. This paper describes the design and implementation of a software tool, Irdaperf, to model IrDA performance based on negotiated transmission parameters. Using Irdaperf, we demonstrate that for fast data rates, maximizing window size and data size are key factors for overcoming the negative effects of a relatively long link …

Modeling And Simulation Of Steady State And Transient Behaviors For Emergent Socs, Joann M. Paul, Arne Suppe, Donald E. Thomas

Research Collection School Of Computing and Information Systems

We introduce a formal basis for viewing computer systems as mixed steady state and non-steady state (transient) behaviors to motivate novel design strategies resulting from simultaneous consideration of function, scheduling and architecture. We relate three design styles: Hierarchical decomposition, static mapping and directed platform that have traditionally been separate. By considering them together, we reason that once a steady state system is mapped to an architecture, the unused processing and communication power may be viewed as a platform for a transient system, ultimately resulting in more effective design approaches that ease the static mapping problem while still allowing for effective …

Integrating Color And Spatial Features For Content-Based Video Retrieval, Tong Lin, Chong-Wah Ngo, Hong-Jiang Zhang, Qing-Yun Shi

Research Collection School Of Computing and Information Systems

In this paper, we present a novel and efficient scheme for extracting, indexing and retrieving color images. Our motivation was to reduce the space overhead of partition-based approaches taking advantage of the fact that only a relatively low number of distinct values of a particular visual feature is present in most images. To extract color feature and build indices into our image database we take into consideration factors such as human color perception and perceptual range, and the image is partitioned into a set of regions by using a simple classifying scheme. The compact color feature vector and the spatial …

Mining Multi-Level Rules With Recurrent Items Using Fp'-Tree, Kok-Leong Ong, Wee-Keong Ng, Ee Peng Lim

Research Collection School Of Computing and Information Systems

Association rule mining has received broad research in the academic and wide application in the real world. As a result, many variations exist and one such variant is the mining of multi-level rules. The mining of multi-level rules has proved to be useful in discovering important knowledge that conventional algorithms such as Apriori, SETM, DIC etc., miss. However, existing techniques for mining multi-level rules have failed to take into account the recurrence relationship that can occur in a transaction during the translation of an atomic item to a higher level representation. As a result, rules containing recurrent items go unnoticed. …

Jointly Coordinating Ecn And Tcp For Rapid Adaptation To Varying Bandwidth, Archan Misra, Teunis Ott

Research Collection School Of Computing and Information Systems

The introduction of service differentiation in the Internet implies that the residual bandwidth available to best-effort traffic becomes highly variable. We explore the design of a rapidly-reactive congestion control framework, where the ECN-aware best-effort flows aggressively go after any unused capacity. By making routers mark packets in a much more aggressive manner, we are able to achieve fast backoff in the network without resorting to the TCP's current drastic step of halving the congestion window. Simulations indicate that our ECN-mod protocol is better than ECN-NewReno in exploiting rapid variations in the available bandwidth. Moreover, the milder backoff policy of ECN-mod …

Hierarchical Mobility Management For Voip Traffic, Archan Misra, Subir Das, Anthony J. Mcauley

Research Collection School Of Computing and Information Systems

A hierarchical IP-based mobility management mechanism is proposed for VoIP applications. The suggested mechanism uses the DMA (dynamic mobility agent) architecture, based on IDMP (intra-domain mobility management protocol), for managing intra-domain mobility and the dynamic binding mechanism of SIP (session initiation protocol) for managing global mobility. This combination of network and application layer mobility management reduces the global signaling load, provides fast handoff for ongoing conversations, enables efficient global transport and supports IP-layer paging.

Electronic Library Information System (Elis), Sooi Ping Cheah

Student Works (2000-2009)

Electronic Library Information System (ELIS) is a computer-based (automation) library system for a secondary school. ELIS consists of a number of smaller systems called subsystems. The modules are acquisition, which enable the System Administrator and Librarians to do ordering and receiving operations: cataloging which enable the creation of a bibliographic database; online cataloging (OPAC) which enables information to be retrieved from the database; circulation which manages the borrowing, returning, renewing, reserving, fine for missing of items· bulletin & feedback which enable the patron to input the feedback regarding the service provided by ELIS and to view the most current bulletin …

Computing Cyclomatic Complexity With Cubic Flowgraphs, Yongming Tang, Ali H. Dogru, Franz J. Kurfess, Murat M. Tanik

Computer Science and Software Engineering

Two new methods for the computation of cyclomatic complexity especially for decomposable representations are introduced. Building software by integration is a developing paradigm, especially enabled by the emerging component technologies. Decomposition of the design for a top-down approach is a prerequisite for this paradigm. Cubic flowgraphs are instrumental in providing formalisms for decomposition and integration. Cyclomatic complexity analysis of a design representation that is decomposable is the goal of this research. In addition to introducing cyclomatic complexity computation using cubic flowgraphs, preservation of cyclomatic complexity in the decomposition of the cubic flowgraph is also presented.

A Transaction Model To Improve Data Availability In Mobile Computing, Sanjay Kumar Madria, Bharat Bhargava

Computer Science Faculty Research & Creative Works

We incorporate a prewrite operation before a write operation in a mobile transaction to improve data availability. A prewrite operation does not update the state of a data object but only makes visible the future value that the data object will have after the final commit of the transaction. Once a transaction reads all the values and declares all the prewrites, it can pre-commit at mobile host (MH) (computer connected to unreliable mobile communication network). The remaining transaction's execution (writes on database) is shifted to the mobile service station (MSS) (computer connected to the reliable fixed network). Writes on database …

The Impact Of Test Suite Granularity On The Costeffectiveness Of Regression Testing, Gregg Rothermel, Sebastian Elbaum, Alexey Malishevsky, Praveen Kallakuri, Brian Davia

School of Computing: Technical Reports

Regression testing is an expensive testing process used to validate software following modifications. The cost-effectiveness of regression testing techniques varies with characteristics of test suites. One such characteristic, test suite granularity, involves the way in which test inputs are grouped into test cases within a test suite. Various cost-benefits tradeoffs have been attributed to choices of test suite granularity, but almost no research has formally examined these tradeoffs. To address this lack, we conducted several controlled experiments, examining the effects of test suite granularity on the costs and benefits of several controlled experiments, examining the effects of test suite granularity …

Improving Cluster Utilization Through Set Based Allocation Policies, Quinn O. Snell, Julio C. Facelli, Brian D. Haymore, David B. Jackson

Faculty Publications

While clusters have already proven themselves in the world of high performance computing, some clusters are beginning to exhibit resource inefficiencies due to increasing hardware diversity. Much of the success of clusters lies in the use of commodity components built to meet various hardware standards. These standards have allowed a great level of hardware backwards compatibility that is now resulting in a condition referred to as hardware 'drift' or heterogeneity. The hardware heterogeneity introduces problems when diverse compute nodes are allocated to a parallel job, as most parallel jobs are not self-balancing. This paper presents a new method that allows …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 18, Number 1, September 2001, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

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