Digital Commons Network^™

Agent Based Intrusion Detection And Response System For Wireless Lans, Mohan K Chirumamilla, Byrav Ramamurthy

School of Computing: Conference and Workshop Papers

Wireless LAN technology, despite the numerous advantages it has over competing technologies, has not seen widespread deployment. A primary reason for markets not adopting this technology is its failure to provide adequate security. Data that is sent over wireless links can be compromised with utmost ease. In this project, we propose a distributed agent based intrusion detection and response system for wireless LANs that can detect unauthorized wireless elements like access points, wireless clients that are in promiscuous mode etc. The system reacts to intrusions by either notifying the concerned personnel, in case of rogue access points and promiscuous nodes, …

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

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.

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 …

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 …

Patterns And Trends Of Soil Climate Regimes And Drought Events In The Northern Great Plains, William J. Waltman, Stephen M. Goddard, S. E. Reichenbach, Mark Svoboda, Michael Hayes, J. S. Peake

School of Computing: Conference and Workshop Papers

Drought is the dominant process of crop loss nationally and within Nebraska. Nearly twothirds of the 18.6 million harvested acres are covered by crop insurance (USDA/RMA, 2003; USDA/NASS, 2003). For the most part, Nebraska’s crop losses range from $50 to 75 million in non-drought years, but the losses approach nearly $200 million in drought years, such as 2000. The past growing season (2002) crop losses are projected to greatly exceed $375 million in Nebraska and more than $4 billion nationally (USDA/RMA, 2003). The analysis and understanding of drought processes in the Great Plains is an important component to developing drought …

A New Efficient Algorithm For Solving The Simple Temporal Problem, Lin Xu, Berthe Y. Choueiry

School of Computing: Conference and Workshop Papers

Motivation for Simple Temporal Problem (STP)

STP - TCSP - DTP

Consistency properties & algorithms

General CSPs

STP

Contributions

Use (improved) PPC for STP

Refine it into ΔSTP

Evaluation on random instances, 3 generators

Summary & new results

A New Efficient Algorithm For Solving The Simple Temporal Problem, Lin Xu, Berthe Y. Choueiry

School of Computing: Conference and Workshop Papers

In this paper we propose a new efficient algorithm, the Δ STP-solver, for computing the minimal network of the Simple Temporal Problem (STP). This algorithm achieves high performance by exploiting a topological property of the constraint graph (i.e., triangulation) and a semantic property of the constraints (i.e., convexity) in light of the results reported by Bliek and Sam-Haroud [1], which were presented for general CSPs and have not yet been applied to temporal networks. Importantly, we design the constraint propagation in Δ STP-solver to operate on triangles instead of operating on edges and implicitly guarantee the decomposition of …

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.

Ethical Issues In Open Source Software, Frances Grodzinsky, Keith W. Miller, Marty J. Wolf

School of Computer Science & Engineering Faculty Publications

In this essay we argue that the current social and ethical structure in the Open Source Software (OSS) Community stem from its roots in academia. The individual developers experience a level of autonomy similar to that of a faculty member. Furthermore, we assert that the Open Source Software Community's social structure demands benevolent leadership. We argue that it is difficult to pass off low quality open source software as high quality software and that the Open Source development model offers strong accountability. Finally, we argue that Open Source Software introduces ethical challenges for universities and the software development community.

On Quantitative Evaluation Of Clustering Systems, Ji He, Ah-Hwee Tan, Chew-Lim Tan, Sam-Yuan Sung

Research Collection School Of Computing and Information Systems

Clustering refers to the task of partitioning unlabelled data into meaningful groups (clusters). It is a useful approach in data mining processes for identifying hidden patterns and revealing underlying knowledge from large data collections. The application areas of clustering, to name a few, include image segmentation, information retrieval, document classification, associate rule mining, web usage tracking, and transaction analysis.

Enterprise-Wide Strategic Information Systems Planning For Shanghai Bell Corporation, Y. Long, Fiona Fui-Hoon Nah, Z. Zhu

Research Collection School Of Computing and Information Systems

In response to increasing competition and technological advancement, Shanghai Bell Co., Ltd., a leading telecommunications enterprise located in Shanghai, China, carried out a major initiative to develop its next generation Information Technology/Information Systems (IT/IS) strategic plan. The initiative was prompted by limitations of its current enterprise application systems where the systems were neither able to keep up with the evolving needs due to organizational change nor satisfy the increasing demands for information sharing and data analysis. This case describes the environmental and organizational context of Shanghai Bell Corporation, and the problems and challenges it encountered in developing an enterprise-wide strategic …

Mobile Communications And Mobile Services, Keng Siau, Z. Shen

Research Collection School Of Computing and Information Systems

As wireless technologies evolve, the coming mobile revolution will bring dramatic and fundamental changes to the world. This revolution has already begun and is gaining momentum. The revolution will impact numerous facets of our daily lives and the way business is conducted. It will provide important data in real time to assist decision makers, exert great influence on communications between businesses and their customers, and transform the way we live our lives. This paper examines issues in providing services via wireless technologies, i.e. mobile services. The paper discusses the challenges facing mobile services, such as changes in business strategies, investment …

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 …

A Performance Analysis Of Distributed Algorithms In Javaspaces, Corba Services And Web Services, Suresh Sunku

UNF Graduate Theses and Dissertations

Implementation of distributed parallel algorithms on networked computers has always been very difficult until the introduction of service-oriented architectures (SOA) like JavaSpaces service, CORBA services and Web Services. Algorithms of the type Master/Worker pattern are implemented with relative ease using the SOAs. This project analyzes the performance of such algorithms on three contemporary SOAs namely JavaSpaces service, CORBA services and Web Services. These architectures make the implementations of distributed algorithms reasonably fault tolerant and highly and dynamically scalable. Also, the systems built on these architectures are generally loosely coupled and operate asynchronously.

In this project we measure and analyze the …

Finding Unexpected Events In Staring Continuous-Dwell Sensor Data Streams Via Adaptive Prediction, Peter G. Raeth

CCAC Theses and Dissertations

This research produced a Predictive Anomaly Detector (PAD). It is an adaptive prediction-based approach to detecting unexpected events in data streams drawn from staring continuous-dwell sensors. The underlying technology is spectrum independent and does not depend on correlated data (neither temporal nor spatial) to achieve improved detection and extraction in highly robust environments. ("robust environment" refers to the data stream's control law being variable and the spectral content covering a wide range of wavelengths.)

The resulting approach uses a network of simple building-block equations (basis functions) to predict the non-event data and thereby present subtle sub-streams to a detection model …

Network Traffic Properties Of Bimodal Multicast Protocol, Öznur Özkasap, Mi̇ne Çağlar

Turkish Journal of Electrical Engineering and Computer Sciences

The popularity of large-scale distributed applications, such as videoconferencing, multimedia dissemination, electronic stock exchange and distributed cooperative work, has grown with the availability of high-speed networks and the expansion of the Internet. The key property of this type of applications is the need to distribute data among multiple participants together with an application-specific quality of service needs. This fact makes scalable multicast protocols an essential underlying communication structure. Although there exist several studies investigating the traffic characteristics of unicast communication, multicast traffic has not been examined extensively in previous studies. It is well known that the aggregate traffic properties of …

Zero-Crossing Based Demodulation Of Minimum Shift Keying, Mi̇ne Kalkan, Feza Keresteci̇oğlu

Turkish Journal of Electrical Engineering and Computer Sciences

Minimum shift keying (MSK) modulation has features such as constant envelope, compact spectrum and good error performance, which are all desirable in many digital applications including mobile radio. Numerous receiver structures to demodulate MSK have been suggested, such as correlation receivers, differential detectors and frequency discriminators. MSK is a form of biphase keying and can be detected by a zero-crossing based phase demodulator which gives near optimum performance. In this paper, the bit error performance of a zero-crossing based coherent MSK demodulator is theoretically investigated and a closed-form expression for the bit error rate is derived. The results indicate that …

Music, Cbf And Differential Algebraic Constant Modulus Algorithms For Direction Of Arrival Estimation In Passive Coherent Locators, Ahmet Özçeti̇n

Turkish Journal of Electrical Engineering and Computer Sciences

In passive coherent locators (PCL) systems, noise and the precision of direction of arrival (DOA) estimation are key issues. This paper addresses the implementation of high-resolution DOA estimation methods, in particular the multiple signal classification (MUSIC) algorithm, the conventional beam forming (CBF) algorithm, and the algebraic constant modulus algorithm (ACMA). The goal is to compare the ACMA to the MUSIC and CBF algorithms for application to PCL. The results and analysis presented here support the use of constant modulus information, where available, as an important addition to DOA estimation. The ACMA offers many simple solutions to noise and separation related …

Stone Coalgebras, Clemens Kupke, Alexander Kurz, Yde Venema

Engineering Faculty Articles and Research

In this paper we argue that the category of Stone spaces forms an interesting base category for coalgebras, in particular, if one considers the Vietoris functor as an analogue to the power set functor. We prove that the so-called descriptive general frames, which play a fundamental role in the semantics of modal logics, can be seen as Stone coalgebras in a natural way. This yields a duality between the category of modal algebras and that of coalgebras over the Vietoris functor. Building on this idea, we introduce the notion of a Vietoris polynomial functor over the category of Stone spaces. …

Qr Factorization With Morton-Ordered Quadtree Matrices For Memory Re-Use And Parallelism, Jeremy D. Frens, David S. Wise

University Faculty Publications and Creative Works

Quadtree matrices using Morton-order storage provide natural blocking on every level of a memory hierarchy. Writing the natural recursive algorithms to take advantage of this blocking results in code that honors the memory hierarchy without the need for transforming the code. Furthermore, the divide-and-conquer algorithm breaks problems down into independent computations. These independent computations can be dispatched in parallel for straight-forward parallel processing. Proof-of-concept is given by an algorithm for QR factorization based on Givens rotations for quadtree matrices in Morton-order storage. The algorithms deliver positive results, competing with and even beating the LAPACK equivalent.

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

The Extreme Software Development Series: An Open Curricular Framework For Applied Capstone Courses, Konstantin Läufer, George K. Thiruvathukal

Computer Science: Faculty Publications and Other Works

We describe an open, flexible curricular framework for offering a collection of advanced undergraduate and graduate courses in software development. The courses offered within this framework are further unified by combining solid foundations with current technology and play the role of capstone courses in a modern software development track. Our initiative has been very successful with all stakeholders involved.

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.

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.

Agent Chameleons: Agent Minds And Bodies, Brian Duffy, Gregory O'Hare, Alan Martin, John Bradley, Bianca Schoen-Phelan

Conference papers

Agent design has to date concerned itself with the issues pertaining to a single body embedded in a single environment, whether virtual or real. This paper discusses the notion of an agent capable of migrating between information spaces (physical worlds, virtual reality, and digital information spaces). An architecture is presented that facilitates agent migration and mutation within such environments. This will in turn support agent

evolution the ultimate in agent adaptivity

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 …