Physical Sciences and Mathematics Commons^™

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 …

Component-Based Software Development, Luiz Fernando Capretz, Miriam Capretz, Dahai Li

Electrical and Computer Engineering Publications

Component-based software development (CBSD) strives to achieve a set of pre-built, standardized software components available to fit a specific architectural style for some application domain; the application is then assembled using these components. Component-based software reusability will be at the forefront of software development technology in the next few years. This paper describes a software life cycle that supports component-based development under an object-oriented framework. Development time versus software life cycle phases, which is an important assessment of the component-based development model put forward, is also mentioned.

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]

Pickup And Delivery Problem With Time Windows: Algorithms And Test Case Generation, Hoong Chuin Lau, Zhe Liang

Research Collection School Of Computing and Information Systems

In the pickup and delivery problem with time windows (PDPTW), vehicles have to transport loads from origins to destinations respecting capacity and time constraints. In this paper, we present a two-phase method to solve the PDPTW. In the first phase, we apply a novel construction heuristics to generate an initial solution. In the second phase, a tabu search method is proposed to improve the solution. Another contribution of this paper is a strategy to generate good problem instances and benchmarking solutions for PDPTW, based on Solomon's benchmark test cases for VRPTW. Experimental results show that our approach yields very good …

Polygonal Chains Cannot Lock In 4d, Roxana Cocan, Joseph O'Rourke

Computer Science: Faculty Publications

We prove that, in all dimensions d ≥ 4, every simple open polygonal chain and every tree may be straightened, and every simple closed polygonal chain may be convexified. These reconfigurations can be achieved by algorithms that use polynomial time in the number of vertices, and result in a polynomial number of “moves.” These results contrast to those known for d = 2, where trees can “lock,” and for d = 3, where open and closed chains can lock.

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 …

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.

Packaging Predictable Assembly With Prediction-Enabled Component Technology, Scott A. Hissam, Gabriel A. Moreno, Judith Stafford, Kurt C. Wallnau

Gabriel A. Moreno

Oral History Interview With Donald D. Chamberlin, Philip L. Frana

Philip L Frana

Don Chamberlin is a research staff member at IBM Almaden Research Center in San Jose, California. In this oral history Chamberlin recounts his early life, his education at Harvey Mudd College and Stanford University, and his work on relational database technology. Chamberlin was a member of the System R research team and, with Ray Boyce, developed the SQL database language. Chamberlin also briefly discusses his more recent research on XML query languages.

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.

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.

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 …

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.

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.

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. …

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 …

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.

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 …

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.

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 …

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 …

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 …

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 …

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 …

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 …

Formalization Of Computer Supported Cooperative Work Applications, Carl Chang, Jia Zhang, Tsang Ming Jiang

Jia Zhang

No abstract provided.

Applicability Of General Scenarios To The Architecture Tradeoff Analysis Method, Len Bass, Mark H. Klein, Gabriel A. Moreno

Gabriel A. Moreno

A Formal Architectural Specification Of The Automatic Validation Of The Everglades National Park Hydrology System, William S. Caldwell Ii

FIU Electronic Theses and Dissertations

This thesis is focused on creating a formal architectural specification of a software system. I have used the computer system at the Everglades National Park (ENP) to conduct a case study. The formal method used is called Z ("zeta"). The case study used was performed on some of the software on the ENP computing system. The software is the Hydrology System and consists of a relational database called Data For Ever and several subsystems that support it. The Data For Ever system is a relational database that stores hydrology data from the Everglades. The supporting software tools are the programs …

Oral History Interview With Mark P. Mccahill, Philip L. Frana

Philip L Frana

In this oral history Mark P. McCahill, Assistant Director of Academic and Distributed Computing Services at the University of Minnesota, recounts his role as leader of the team that created the popular client/server software for organizing and sharing information on the Internet. McCahill also describes his work in the development of Pop Mail, Gopher VR, Forms Nirvana, the Electronic Grants Management System, and the University of Minnesota Portal.