Digital Commons Network^™

Level Of Essentialness Of A Node In Flowcharts And Its Application To Program Testing, Osman Kandara

LSU Doctoral Dissertations

Program testing is important to develop bug free software. A common form of program testing involves selecting test cases which execute (cover) a given set W of statements in the program. In regression testing, W typically forms a small subset of the program. It is often possible to find an alternate small set W so that execution of W' implies execution of W. We develop concepts and algorithms for finding W' as small as possible with the condition that the statements in W' are "close" to those in W in terms of program structure. These concepts generalize the notion of …

Two Distributed Algorithms For E-Ticket Validation Protocols For Mobile Clients, H. Mohanty, Sanjay Kumar Madria, T. Suman Kumar Reddy, R. K. Ghosh

Computer Science Faculty Research & Creative Works

The e-ticket (electronic ticket) validation problem has relevance in mobile computing environment because of the multiple submission of a ticket that is possible due to intermittent disconnections and mobility of hosts. Here, we propose protocols that are not only sensitive to disconnection but also to location. One of the proposed protocols is the variant of the distributed protocol proposed by Pedone (2000) for Internet users. This shows that a distributed protocol for static network can be restructured for distributed computation in a mobile computing environment. We have also proposed another protocol that uses a hierarchical location database of mobile hosts …

Crafting A Research Paper, Ronan Fitzpatrick, Kevin O'Donnell

Conference papers

Writing research papers presents numerous different challenges, which vary from how to layout the various pages and format the text to what to include in the different sections that make up the paper. In order to clarify these issues this paper sets out guidelines and best practice approaches and demonstrates their use in the style of this paper.

Sip Message Compression Technique For Efficient Multimedia Services In 3g Wireless Communications, Valerie Kenneally

Theses

The direction of the global cellular industry is primarily determined by two standardisation bodies, the 3rd Generation Partnership Project (3GPP) (in Europe and Asia) and 3GPP2 (in North America). Both of these standardisation bodies are currently specifying a core network to deliver IP based multimedia services over 3G wireless networks. One of the fundamental building blocks of this IP based multimedia core network is the use of SIP (Session Initiation Protocol) as the control protocol. The radio resource, that is the available frequency spectrum, in wireless communication systems remains a limiting factor in terms of the bandwidth available to an …

Sensor Networks: An Overview, Malik Tubaishat, Sanjay Kumar Madria

Computer Science Faculty Research & Creative Works

Advances in hardware and wireless network technologies have created low-cost, low-power, multifunctional miniature sensor devices. These devices make up hundreds or thousands of ad hoc tiny sensor nodes spread across a geographical area. These sensor nodes collaborate among themselves to establish a sensing network. A sensor network can provide access to information anytime, anywhere by collecting, processing, analyzing and disseminating data. Thus, the network actively participates in creating a smart environment.

A Deception Based Framework For The Application Of Deceptive Countermeasures In 802.11b Wireless Networks, Suen Yek

Theses : Honours

The advance of 802.11 b wireless networking has been beset by inherent and in-built security problems. Network security tools that are freely available may intercept network transmissions readily and stealthily, making organisations highly vulnerable to attack. Therefore, it is incumbent upon defending organisations to take initiative and implement proactive defences against common network attacks. Deception is an essential element of effective security that has been widely used in networks to understand attack methods and intrusions. However, little thought has been given to the type and the effectiveness of the deception. Deceptions deployed in nature, the military and in cyberspace were …

Report On The Third Acm/Ieee Joint Conference On Digital Libraries (Jcdl), Michael L. Nelson

Computer Science Faculty Publications

The Third ACM/IEEE Joint Conference on Digital Libraries (JCDL 2003) was held on the campus of Rice University in Houston, Texas, May 27 - 31. Regarding the merging of the ACM and IEEE conference series, in the JCDL 2002 conference report published last year in D-Lib Magazine Edie Rasmussen noted, "Perhaps by next year...no one will remember that it wasn't always so" [1]. Judging by the number of participants I met who did not know that the ACM and IEEE used to hold separate digital library conferences, Rasmussen's prediction has come to pass.

Digitization In An Archival Environment, Sally Mckay

E-JASL: Electronic Journal of Academic and Special Librarianship (1999-2009, Volumes 1-10)

Introduction

Cultural institutions such as museums, libraries, archives, and historical societies house remarkable collections of cultural artifacts. It is the responsibility of the staff working for those institutions to preserve, protect and provide responsible stewardship for the materials, and to the best of their ability, provide continued long-term access (Russell, 2000).

Advances in technology allow institutions to provide expanded access and education; however, there are important priorities that must be addressed prior to embarking on a digital conversion project.

Digitization in an archival environment includes taking a physical object or analog item, such as an art object, a tape recording, …

Teaching A Multiagent Systems Class With Game Days: Designs And Lessons Learned, Leen-Kiat Soh

School of Computing: Technical Reports

In the Fall semester of 2002, I introduced and taught a class in Multiagent Systems. The class was aimed for seniors (with special permission) and graduate students in Computer Science, covering some breadth and depth of issues in multiagent systems. One of the requirements was participation in four Game Days. On each Game Day, student teams competed against each other in games related to issues such as auction, task allocation, coalition formation, and negotiation. This article documents my designs of and lessons learned from these Game Days. The Game Days were very successful. Through role-playing, the students were motivated and …

Inter-Domain Dynamic Routing In Multi-Layer Optical Transport Networks, Xi Yang, Byrav Ramamurthy

School of Computing: Conference and Workshop Papers

Next-generation optical transport networks will automatically and dynamically provision end-to-end connections. In this paper, we study the problem of inter-domain dynamic routing under a multi-layer multi-domain network model, which allows the end-to-end connections to be set up not only across multiple routing domains but also through two transport layers: the optical layer and the digital layer. In this model, a connection can traverse the domain boundary either through optical bypass or through optical-electrical-optical (O/E/O) processing. We propose an inter-domain dynamic routing scheme with modest time complexity to address the problem from an algorithmic perspective.

A Novel Fiber Delay Line Buffering Architecture For Optical Packet Switching, Lin Li, Stephen Scott, Jitender S. Deogun

School of Computing: Conference and Workshop Papers

Due to the lack of optical random access memory, optical fiber delay line (FDL) is currently the only way to implement optical buffering. Feed-forward and feedback are two kinds of FDL structures in optical buffering. Both have advantages and disadvantages. In this paper, we propose a more effective hybrid FDL architecture that combines the merits of both schemes. The core of this switch is the arrayed waveguide grating (AWG) and the tunable wavelength converter (TWC). It requires smaller optical device sizes and fewer wavelengths and has less noise than feedback architecture. At the same time, it can facilitate preemptive priority …

On Approximating Weighted Sums With Exponentially Many Terms, Deepak Chawla, Lin Li, Stephen Scott

School of Computing: Technical Reports

Multiplicative weight-update algorithms such as Winnow and Weighted Majority have been studied extensively due to their on-line mistake bounds’ logarithmic dependence on N, the total number of inputs, which allows them to be applied to problems where N is exponential. However, a large N requires techniques to efficiently compute the weighted sums of inputs to these algorithms. In special cases, the weighted sum can be exactly computed efficiently, but for numerous problems such an approach seems infeasible. Thus we explore applications of Markov chain Monte Carlo (MCMC) methods to estimate the total weight. Our methods are very general and …

Indirect Symbolic Correlation Approach To Unsegmented Text Recognition, George Nagy, Sharad C. Seth, Y. Lin, Shashank K. Mehta

School of Computing: Conference and Workshop Papers

The new non-parametric approach to unsegmented text recognition builds two bipartite graphs that result from the feature-level and lexical comparisons of the same word against a reference string which need not include the query word. The lexical graph preserves the relative order of edges in the feature graph corresponding to correctly recognized features. This observation leads to a subgraph-matching formulation of the recognition problem. An initial implementation proves the robustness of the approach for up-to 20% noise introduced in the feature-level graph.

A Literature Review On Learner Control Strategies In Software Tutoring Systems, Xin Li, Leen-Kiat Soh

School of Computing: Technical Reports

This paper is a comprehensive research review on the learner control strategies in software tutoring systems. With the application of more computer techniques in education and the involvement of more adults in software tutoring systems, the learner control strategy has become more appreciated than tutor control or program control. In this paper, the efficiency and necessity of learner control in software tutoring systems is discussed through the description of learning mechanism. Some typical applications of learner control strategies in software tutoring systems are presented. The available learner control strategies are classified from two perspectives: educational theory, and software mechanism. Finally, …

On Generalized Multiple-Instance Learning, Stephen Scott, Jun Zhang, Joshua Brown

School of Computing: Technical Reports

We describe a generalization of the multiple-instance learning model in which a bag’s label is not based on a single instance’s proximity to a single target point. Rather, a bag is positive if and only if it contains a collection of instances, each near one of a set of target points. We list potential applications of this model (robot vision, content-based image retrieval, protein sequence identification, and drug discovery) and describe target concepts for these applications that cannot be represented in the conventional multiple-instance learning model. We then adapt a learning-theoretic algorithm for learning in this model and present empirical …

Instance Based Attribute Identification In Database Integration, Ee Peng Lim, Cecil Chua, Roger Hsiang-Li Chiang

Research Collection School Of Computing and Information Systems

Most research on attribute identification in database integration has focused on integrating attributes using schema and summary information derived from the attribute values. No research has attempted to fully explore the use of attribute values to perform attribute identification. We propose an attribute identification method that employs schema and summary instance information as well as properties of attributes derived from their instances. Unlike other attribute identification methods that match only single attributes, our method matches attribute groups for integration. Because our attribute identification method fully explores data instances, it can identify corresponding attributes to be integrated even when schema information …

Representation Of Web Data In A Web Warehouse, Sourav S. Bhowmick, Sanjay Madria, Wee Keong Ng

Computer Science Faculty Research & Creative Works

We believe that, to manage Web data effectively, there is a need to build a data warehouse of Web data, i.e. a Web warehouse. in this paper, we focus on how to represent and store relevant hyperlinked Web documents effectively in a Web warehouse called WHOWEDA (WareHouse of WEb DAta) for further querying and manipulation. We present a simple and general model for representing metadata, structure and content of Web documents and hyperlinks in WHOWEDA. We discuss node and link objects which are used to represent Web documents and hyperlinks respectively in WHOWEDA. These objects are first class objects in …

Comparison Of Javaspace And Corba Technologies, Anjani Kumar Jha

UNF Graduate Theses and Dissertations

With computer industry increasingly moving towards network-centric systems, particularly the Internet, competing technologies that help design and develop such systems are fast emerging in the marketplace. The fundamental characteristics of a networked environment are heterogeneity, partial failure, latency and difficulty of "gluing together" multiple, independent processes into a robust, scalable application. JavaSpaces, a shared memory paradigm, provides high-level coordination mechanism for Java easing the burden of creating distributed systems. Large class of distributed problems can be approached using Javaspaces' simple framework. JavaSpaces allows processes to communicate even if each was wholly ignorant of the others. CORBA on the other hand …

On The Development Of The Intersection Of A Plane With A Polytope, Joseph O'Rourke

Computer Science: Faculty Publications

Define a “slice” curve as the intersection of a plane with the surface of a polytope, i.e., a convex polyhedron in three dimensions. We prove that a slice curve develops on a plane without self-intersection. The key tool used is a generalization of Cauchy's arm lemma to permit nonconvex “openings” of a planar convex chain.

Analyzing Erp Implementation At A Public University Using The Innovation Strategy Model, Keng Siau, J. Messersmith

Research Collection School Of Computing and Information Systems

Enterprise Resource Planning (ERP) systems have revolutionized the way companies are using information technology in their businesses. ERP was created in an effort to streamline business processes and has proven to be successful in many operations. Unfortunately, not all ERP implementations have met expectations. One way that businesses may be able to increase success rates is to embrace creativity and innovation in their ERP implementations. For businesses to do this, they must first understand how creativity originates and how that creativity can be integrated into business solutions. This article presents a case study that examines the ERP implementation at a …

Advances In Mobile Commerce Technologies, Ee Peng Lim, Keng Siau

Research Collection School Of Computing and Information Systems

No abstract provided.

Trading Agents Competing: Performance, Progress And Market Effectiveness, Michael P. Wellman, Shih-Fen Cheng, Daniel M. Reeves, Kevin M. Lochner

Research Collection School Of Computing and Information Systems

The annual trading agent competition offers agent designers a forum for evaluating programmed trading techniques in a challenging market scenario. TAC aims to spur research by enabling researchers to compare techniques on a common problem and build on each other's ideas. A fixed set of assumptions and environment settings facilitates communication of methods and results. As a multiyear event, TAC lets researchers observe trading agents' progress over time, in effect accelerating the evolution of an adapted population of traders. Given all the participant effort invested, it is incumbent on us to learn as much from the experience as possible. After …

Performance Measurement Framework For Hierarchical Text Classification, Ee Peng Lim, Aixin Sun, Wee-Keong Ng

Research Collection School Of Computing and Information Systems

Hierarchical text classification or simply hierarchical classification refers to assigning a document to one or more suitable categories from a hierarchical category space. In our literature survey, we have found that the existing hierarchical classification experiments used a variety of measures to evaluate performance. These performance measures often assume independence between categories and do not consider documents misclassified into categories that are similar or not far from the correct categories in the category tree. In this paper, we therefore propose new performance measures for hierarchical classification. The proposed performance measures consist of category similarity measures and distance-based measures that consider …

A Multi-Platform Application Suite For Enhancing South Asian Language Pedagogy, Tao Bai, Christopher K. Chung, Konstantin Läufer, Daisy Rockwell, George K. Thiruvathukal

Computer Science: Faculty Publications and Other Works

This interdisciplinary project explores the potential for handheld/wireless (H/W) technology in the context of language education within and beyond the classroom. Specifically, we have designed and implemented a suite of multi-platform (desktop/laptop, handheld, and browser) applications to enhance the teaching of South Asian languages such as Hindi-Urdu. Such languages are very difficult to learn, let alone write, and H/W devices (with their handwriting/drawing capabilities) can play a significant role in overcoming the learning curve. The initial application suite includes a character/word tracer, a word splitter/joiner, a smart flashcard with audio, contextual augmented stories for reading comprehension, and a poetic metronome. …

Scalable Implementations Of Mpi Atomicity For Concurrent Overlapping I/O, Wei-Keng Liao, Alok Choudhary, Kenin Coloma, George K. Thiruvathukal, Lee Ward, Eric Russell, Neil Pundit

Computer Science: Faculty Publications and Other Works

For concurrent I/O operations, atomicity defines the results in the overlapping file regions simultaneously read/written by requesting processes. Atomicity has been well studied at the file system level, such as POSIX standard. In this paper, we investigate the problems arising from the implementation of MPI atomicity for concurrent overlapping write access and provide a few programming solutions. Since the MPI definition of atomicity differs from the POSIX one, an implementation that simply relies on the POSIX file systems does not guarantee correct MPI semantics. To have a correct implementation of atomic I/O in MPI, we examine the efficiency of three …

Metrics For Evaluating Human-Robot Interactions, Michael A. Goodrich, Dan R. Olsen Jr.

Faculty Publications

Metrics for evaluating the quality of a human-robot interface are introduced. The autonomy of a robot is measured by its neglect time. The robot attention demand metric measures how much of the user’s attention is involved with instructing a robot. The free-time and fan-out metrics are two ways to measure this demand. Each of them leads to estimates of the interaction effort. Reducing interaction effort without diminishing task effectiveness is the goal of human-robot interaction design.

Level Oriented Formal Model For Asynchronous Circuit Verification And Its Efficient Analysis Method, Eric G. Mercer, Tomoya Kitai, Chris Myers, Yusuke Oguro, Tomohiro Yoneda

Faculty Publications

Using a level-oriented model for verification of asynchronous circuits helps users to easily construct formal models with high readability or to naturally model datapath circuits. On the other hand, in order to use such a model on large circuits, techniques to avoid the state explosion problem must be developed. This paper first introduces a level-oriented formal model based on time Petri nets, and then proposes its partial order reduction algorithm that prunes unnecessary state generation while guaranteeing the correctness of the verification.

Web Service Technologies And Their Synergy With Simulation, Senthilanand Chandrasekaran, Gregory S. Silver, John A. Miller, Jorge Cardoso, Amit P. Sheth

Kno.e.sis Publications

The World Wide Web has had a huge influence on the computing field in general as well as simulation in particular (e.g., Web-Based Simulation). A new wave of development based upon XML has started. Two of the most interesting aspects of this development are the Semantic Web and Web Services. This paper examines the synergy between Web service technology and simulation. In one direction, Web service processes can be simulated for the purpose of correcting/improving the design. In the other direction, simulation models/components can be built out of Web services. Work on seamlessly using simulation as a part of Web …

On Computing Condensed Frequent Pattern Bases, Jian Pei, Guozhu Dong, Wei Zou, Jiawei Han

Kno.e.sis Publications

Frequent pattern mining has been studied extensively. However, the effectiveness and efficiency of this mining is often limited, since the number of frequent patterns generated is often too large. In many applications it is sufficient to generate and examine only frequent patterns with support frequency in close-enough approximation instead of in full precision. Such a compact but close-enough frequent pattern base is called a condensed frequent patterns-base.

In this paper, we propose and examine several alternatives at the design, representation, and implementation of such condensed frequent pattern-bases. A few algorithms for computing such pattern-bases are proposed. Their effectiveness at pattern …

An Efficient Burst-Arrival And Batch- Departure Algoriths For Round-Robin Service, Jorge R. Ramos, Janche Sang

Department of Computer Science Technical Reports

No abstract provided.