Computer Sciences Commons^™

Jsb Composability And Web Services Interoperability Via Extensible Modeling & Simulation Framework (Xmsf), Model Driven Architecture (Mda), Component Repositories, And Web-Based Visualization, Don Brutzman, Andreas Tolk

Computational Modeling & Simulation Engineering Faculty Publications

"Study Report prepared for the U. S. Air Force, Joint Synthetic Battlespace Analysis of Technical Approaches (ATA) Studies & Prototyping"

Overview: This paper summarizes research work conducted by organizations concerned with interoperable distributed information technology (IT) applications, in particular the Naval Postgraduate School (NPS) and Old Dominion University (ODU). Although the application focus is distributed modeling & simulation (M&S) the results and findings are in general easily applicable to other distributed concepts as well, in particular the support of operations by M&S applications, such as distributed mission operations. The core idea of this work is to show the necessity of …

Discovery Of Functional And Approximate Functional Dependencies In Relational Databases, Ronald S. King, James J. Legendre

Computer Science Faculty Publications and Presentations

This study develops the foundation for a simple, yet efficient method for uncovering functional and approximate functional dependencies in relational databases. The technique is based upon the mathematical theory of partitions defined over a relation's row identifiers. Using a levelwise algorithm the minimal non-trivial functional dependencies can be found using computations conducted on integers. Therefore, the required operations on partitions are both simple and fast. Additionally, the row identifiers provide the added advantage of nominally identifying the exceptions to approximate functional dependencies, which can be used effectively in practical data mining applications.

United States Diplomacy In The Age Of The Internet, Allison S. Greene

Graduate Program in International Studies Theses & Dissertations

The dynamics of international relations are constantly changing, and the origin of an extraordinary amount of that change can be traced to what has been coined the ‘Information Revolution.’ It is a revolution as profound and as significant as Gutenberg's invention of moveable metal type, and may result in social and political consequences of comparable magnitude. One of the most significant and far-reaching implications of this phenomenon is the emergence of the Internet. Since its inception, there have been many claims and assertions about existing and potential repercussions of the Internet within the diplomatic realm.

The purpose of this work …

Adaptive Critic Neural Network-Based Controller For Nonlinear Systems With Input Constraints, Pingan He, Sarangapani Jagannathan

Electrical and Computer Engineering Faculty Research & Creative Works

A novel adaptive critic-Based multilayer neural network (NN) controller in discrete-time is designed to deliver a desired tracking performance for a class of nonlinear systems in the presence of magnitude constraints on the input. Reinforcement learning scheme in discrete time is proposed for the NN controller, where the action generating NN learning is performed based on a certain performance measure, which is supplied from a critic. using the Lyapunov approach and with a novel weight update, the uniform ultimately boundedness (UUB) of the closed loop tracking error and weight estimates are shown. the adaptive critic NN does not require an …

Rate-Based End-To-End Congestion Control Of Multimedia Traffic In Packet Switched Networks, Mingsheng Peng, S. R. Subramanya, Jagannathan Sarangapani

Electrical and Computer Engineering Faculty Research & Creative Works

This paper proposes an explicit rate-based end-to-end congestion control mechanism to alleviate congestion of multimedia traffic in packet switched networks such as the Internet. The congestion is controlled by adjusting the transmission rates of the sources in response to the feedback information from destination such as the buffer occupancy, packet arrival rate and service rate at the outgoing link, so that a desired quality of service (QoS) can be met. The QoS is defined in terms of packet loss ratio, transmission delay, power, and network utilization. Comparison studies demonstrate the effectiveness of the proposed scheme over New-Reno TCP (a variant …

On Query Processing And Optimality Using Spectral Locality-Preserving Mappings, Mohamed F. Mokbel, Walid G. Aref

Department of Computer Science Technical Reports

No abstract provided.

Scheduling For Shared Window Joins Over Data Streams, Moustafa A. Hammad, Michael J. Franklin, Walid G. Aref, Ahmed K. Elmagarmid

Department of Computer Science Technical Reports

No abstract provided.

The Subclassing Anomaly In Compiler Evolution, Atanas Radenski

Mathematics, Physics, and Computer Science Faculty Articles and Research

Subclassing in collections of related classes may require re-implementation of otherwise valid classes just because they utilize outdated parent classes, a phenomenon that is referred to as the subclassing anomaly. The subclassing anomaly is a serious problem since it can void the benefits of code reuse altogether. This paper offers an analysis of the subclassing anomaly in an evolving object-oriented compiler. The paper also outlines a solution for the subclassing anomaly that is based on alternative code reuse mechanism, named class overriding.

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 …

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 …

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

Research Collection School Of Computing and Information Systems

No abstract provided.

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.

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.

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.

A Memory-Based Approach To Cantonese Tone Recognition, Deryle W. Lonsdale, Michael Emonts

Faculty Publications

This paper introduces memory-based learning as a viable approach for Cantonese tone recognition. The memorybased learning algorithm employed here outperforms other documented current approaches for this problem, which is based on neural networks. Various numbers of tones and features are modeled to find the best method for feature selection and extraction. To further optimize this approach, experiments are performed to isolate the best feature weighting method, the best class voting weights method, and the best number of k-values to implement. Results and possible future work are discussed.

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

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 …

Honeyd - A Os Fingerprinting Artifice, Craig Valli

Research outputs pre 2011

The research looks at the efficiency of the honeyd honeypot system to reliably deceive intruders. Honeypots are being used as frontline network intelligence and forensic analysis tools. A honeypots ability to reliably deceive intruders is a key factor in gathering reliable and forensically sound data. Honeyd's primary deceptive mechanism is the use of the NMAP fingerprint database to provide bogus OS fingerprints to would be intruders. Tests conducted by the author on honeyd's ability to provide bogus fingerprints sees 78% of 704 signatures invalidated under heavy probing. However, the tests left 152 viable signatures for producing hardened honeypot designs.

Australian Hackers And Ethics, Matthew Warren, William Hutchinson

Research outputs pre 2011

The aim of the paper is to look at the way hackers act and ways in which society can protect itself. The paper will show the current views and attitudes of hackers in an Australian context. The paper will also include a case study to show how a hacking incident can develop and how technology can be used to protect against hacking.

Security Management Education Online, Peter J. Hosie, Clifton L. Smith, Joseph Luca

Research outputs pre 2011

This paper describes the philosophy and pedagogy informing the design and development of Security Science online units. The Physical Security unit is used to illustrate the development of the online learning strategies and interactive activities. Learning materials developed for this course have unique attributes as they were specifically designed to provide simulations and interactivity in the learning process. Field scenarios have been developed for the activities to make the learning experiences as realistic as possible. Simulations and graphics provide these experiences, together with security site images for actual security barriers, systems and technologies. Features of units in the course include …