Computer Sciences Commons^™

Redesign Of A Spatial Gear Pair Using Configuration Spaces, Elisha Sacks, Leo Joskowicz, Ralf Schulthesis, Uwe Hinze

Department of Computer Science Technical Reports

No abstract provided.

Nonlinear Kinematic Tolerance Analysis Of Planar Mechanical Systems, Min-Ho Kyung, Elisha Sacks

Department of Computer Science Technical Reports

No abstract provided.

Kinematic Analysis Of Spatial Fixed-Axis Higher Pairs Using Configuration Spaces, Ku-Jin Kim, Elisha P. Sacks, Leo Joskowicz

Department of Computer Science Technical Reports

No abstract provided.

Peppering Knowledge Sources With Salt: Boosting Conceptual Content For Ontology Generation, Deryle W. Lonsdale, Yihong Ding, David W. Embley, Alan Melby

Faculty Publications

This paper describes work done to explore the common ground between two different ongoing research projects: the standardization of lexical and terminological resources, and the use of conceptual ontologies for information extraction and data integration. Specifically, this paper explores improving the generation of extraction ontologies through use of a comprehensive terminology database that has been represented in a standardized format for easy tool-based implementation. We show how, via the successful integration of these two distinct efforts, it is possible to leverage large-scale terminological and conceptual information having relationship-rich semantic resources in order to reformulate, match, and merge retrieved information of …

The Algebra And Geometry Of Curve And Surface Inversion, Thomas W. Sederberg, Eng-Wee Chionh, Kent Ridge

Faculty Publications

An inversion equation takes the Cartesian coordinates of a point on a parametric curve or surface and returns the parameter value(s) of that point. A 2-D curve inversion equation has the form t = f(x,y)/g(x,y). This paper shows that practical insight into inversion can be obtained by studying the geometry of the implicit curves f(x,y) = 0 and g(x,y) = 0. For example, the relationship between the singular locus of the parametric curve and the lowest possible degree of an inversion equation can be understood in this way. Also, insight is given into what parameter value will be returned if …

Anatomy Of A Coupling Query In A Web Warehouse, Sourav S. Bhowmick, Sanjay Kumar Madria, Wee-Keong Ng, Ee Peng Lim

Research Collection School Of Computing and Information Systems

To populate a data warehouse specifically designed for Web data, i.e. web warehouse, it is imperative to harness relevant documents from the Web. In this paper, we describe a query mechanism called coupling query to glean relevant Web data in the context of our web warehousing system called Warehouse Of Web Data (WHOWEDA). Coupling query may be used for querying both HTML and XML documents. Some of the important features of our query mechanism are ability to query metadata, content, internal and external (hyperlink) structure of Web documents based on partial knowledge, ability to express constraints on tag attributes and …

Enhancing Profiles For Anomaly Detection Using Time Granularities, Yingjiu Li, Ningning Wu, X. Sean Wang, Sushil Jajodia

Research Collection School Of Computing and Information Systems

Recently, association rules have been used to generate profiles of normal behavior for anomaly detection. However, the time factor (especially in terms of multiple time granularities) has not been utilized extensively in generation of these profiles. In reality, user behavior during different time intervals may be very different. For example, the normal number and duration of FTP connections may vary from working hours to midnight, from business day to weekend or holiday. Furthermore, these variations may depend on the day of the month or the week. This paper proposes to build profiles using temporal association rules in terms of multiple …

Automated Ontology Learning For A Semantic Web, Christopher N. Hammack, Qingfeng Lin, Hai Huang, Stephen Scott, Sharad C. Seth

School of Computing: Technical Reports

By expressing web page content in a format that machines can understand, the semantic web provides huge possibilities for the Internet and for machine reasoning. Unfortunately, there is a considerable distance between the present-day World Wide Web and the semantic web of the future. The process of annotating the Web to make it semantic web-ready is quite long and not without resistance. In this paper one mechanism for semanticizing the Web is presented. This system is known as AutoSHOE, and it is capable of categorizing pages according to one of the present HTML semantic representations (Simple HTML Ontology Extensions) by …

Centralized Vs. Distributed Connection Management Schemes Under Different Traffic Patterns In Wavelength-Convertible Optical Networks, Lu Shen, Byrav Ramamurthy

School of Computing: Conference and Workshop Papers

Centralized and Distributed methods are two connection management schemes in wavelength convertible optical networks. In the earlier work, the centralized scheme is said to have lower network blocking probability than the distributed one. Hence, much of the previous work in connection management has focused on the comparison of different algorithms in only distributed scheme or in only centralized scheme. However, we believe that the network blocking probability of these two connection management schemes depends, to a great extent, on the network traffic patterns and reservation times. Our simulation results reveal that the performance improvement (in terms of blocking probability) of …

An Analytical Model For Virtual Topology Reconfiguration In Optical Networks And A Case Study, Xi Yang, Byrav Ramamurthy

School of Computing: Conference and Workshop Papers

An analytical model for Virtual Topology Reconfiguration (VTR) in optical networks is developed. It aims at the optical networks with a circuit-based data plane and an IPlike control plane. By identifying and analyzing the important factors impacting the network performance due to VTR operations on both planes, we can compare the benefits and penalties of different VTR algorithms and policies. The best VTR scenario can be adaptively chosen from a set of such algorithms and policies according to the real-time network situations. For this purpose, a cost model integrating all these factors is created to provide a comparison criterion independent …

Two Algorithms For Shaped-Based Porosity Measures, Leen-Kiat Soh

School of Computing: Technical Reports

In this paper, we present two algorithms for shape-based porosity measures. Specifically, we describe two innovative attributes called perimeter porosity and area porosity as feature descriptors. Perimeter porosity refers to how “porous” or “weak” an image object is, while area porosity determines the degree of “branchiness” of an object. We show the applicability of the two measures through a SAR sea ice image classification example.

Dynamic Routing In Translucent Wdm Optical Networks, Xi Yang, Byrav Ramamurthy

School of Computing: Conference and Workshop Papers

Translucent WDM optical networks use sparse placement of regenerators to overcome the impairments and wavelength contention introduced by fully transparent networks, and achieve a performance close to fully opaque networks with much less cost. Our previous study proved the feasibility of translucent networks using sparse regeneration technique. We addressed the placement of regenerators based on static schemes allowing only fixed number of regenerators at fixed locations. This paper furthers the study by proposing a suite of dynamical routing schemes. Dynamic allocation, advertisement and discovery of regeneration resources are proposed to support sharing transmitters and receivers between regeneration and access functions. …

A Set Of New Sea Ice Feature Descriptors For Sar Images, Leen-Kiat Soh

School of Computing: Technical Reports

In this paper, we present a set of algorithms for describing sea ice features in SAR images. These algorithms we have implemented and incorporated in the ARKTOS software package, an intelligent sea ice classification. These algorithms have unique characteristics. Some are extensions or adaptations of existing image processing techniques to the specific problem domain of satellite sea ice classification, while some are innovative designs, inspired by the aforementioned problem domain. These feature descriptors may be generalized to other remote sensing applications.

Dynamic Traffic Grooming Algorithms For Reconfigurable Sonet Over Wdm Networks, Shu Zhang, Byrav Ramamurthy

School of Computing: Conference and Workshop Papers

The emergence of Wavelength Division Multiplexing (WDM) technology provides the capability for increasing the bandwidth of Synchronous Optical Network (SONET) rings by grooming low-speed traffic streams onto different high-speed wavelength channels. Since the cost of SONET add-drop multiplexers (SADM) at each node dominates the total cost of these networks, how to assign the wavelength, groom in the traffic and bypass the traffic through the intermediate nodes has received a lot of attention from researchers recently.

Constraint Modeling And Reformulation In The Context Of Academic Task Assignment, Robert Glaubius, Berthe Y. Choueiry

School of Computing: Conference and Workshop Papers

We discuss the modeling and reformulation of a resource allocation problem, the assignment of graduate teaching assistants (GTAs) to courses. Our research contributes the following:

• Formulation of the GTA assignment problem as a nonbinary CSP.

• Design of a new convention for consistency checking to deal with over-constrained problem.

• Definition of a new network-decomposable nonbinary confinement constraint.

• Evaluation of the reformulation of confinement and equality constraints on 3 real-world data sets.

Constraint Modeling And Reformulation In The Context Of Academic Task Assignment, Robert Glaubius, Berthe Y. Choueiry

School of Computing: Conference and Workshop Papers

We discuss the modeling and reformulation of a resource allocation problem, the assignment of Graduate Teaching Assistants to courses in the University of Nebraska-Lincoln Computer Science Department. We formulate this problem as a non-binary Constraint Satisfaction Problem (CSP) and provide a new convention for consistency checking to deal with the over-constraindness of the problem and the practical requirement of our application. We introduce a new decomposable non-binary constraint, which we call confinement constraint, and describe its relevance in practical requirements of our application. We introduce an new decomposable non-binary constraint, which we call confinement constraint, and describe its relevance in …

A Novel Method To Improve The Test Efficiency Of Vlsi Tests, Hailong Cui, Sharad C. Seth, Shashank K. Mehta

School of Computing: Conference and Workshop Papers

This paper considers reducing the cost of test application by permuting test vectors to improve their defect coverage. Algorithms for test reordering are developed with the goal of minimizing the test cost. Best and worst case bounds are established for the performance of a reordered sequence compared to the original sequence of test application. SEMATECH test data and simulation results are used throughout to illustrate the ideas.

Pair Attribute Learning: Network Construction Using Pair Features, Tony R. Martinez, Eric K. Henderson

Faculty Publications

We present the Pair Attribute Learning (PAL) algorithm for the selection of relevant inputs and network topology. Correlations on training instance pairs are used to drive network construction of a single-hidden layer MLP. Results on nine learning problems demonstrate 70% less complexity, on average, without a significant loss of accuracy.

Querying Geographically Dispersed, Heterogeneous Data Stores: The Pperfxchange Approach, Matthew Edward Colgrove

Dissertations and Theses

This thesis details PPerfXchange’s approach for querying geographically dispersed heterogeneous data stores. While elements of PPerfXchange’s method have been implemented for other application areas, PPerfXchange shows how these elements can be applied to parallel performance analysis. The accomplishments of this thesis are:

• The design of an architecture for PPerfXchange, giving a uniform method to query heterogeneous data stores;
• A proof of concept prototype implementation of PPerfXchange including a partial implementation of an XQuery processor and a relational database virtual XML document; and
• Evaluation of PPerfXchange using example parallel performance analysis data.

Modal Predicates And Coequations, Alexander Kurz, Jiří Rosický

Engineering Faculty Articles and Research

We show how coalgebras can be presented by operations and equations. This is a special case of Linton’s approach to algebras over a general base category X, namely where X is taken as the dual of sets. Since the resulting equations generalise coalgebraic coequations to situations without cofree coalgebras, we call them coequations. We prove a general co-Birkhoff theorem describing covarieties of coalgebras by means of coequations. We argue that the resulting coequational logic generalises modal logic.

Node Splitting Algorithms In Tree-Structured High-Dimensional Indexes For Similarity Search, Yongjian Fu, Jui Che Teng, S. R. Subramanya

Computer Science Faculty Research & Creative Works

Content-based searches and retrievals in multimedia and image databases use high-dimensional indexing structures for organizing the features of the objects. Most of those index structures are tree-structured whose nodes have a limit on the number of entries describing the subtrees rooted at those nodes. When index trees are built by repeated insertion of entries, nodes need to be split and the tree balanced accordingly. Node-splitting algorithms eventually determine the final structure of the tree which will have a profound effect on the search performance. This paper presents a comparative study of several node splitting algorithms for a typical high-dimensional indexing …

Protecting The Infrastructure: 3rd Australian Information Warfare & Security Conference 2002, William Hutchinson (Ed.)

Research outputs pre 2011

The conference is hosted by the We-B Centre (working with a-business) in the School of Management Information System, the School of Computer & Information Sciences at Edith Cowan University. This year's conference is being held at the Sheraton Perth Hotel in Adelaide Terrace, Perth. Papers for this conference have been written by a wide range of academics and industry specialists. We have attracted participation from both national and international authors and organisations.

The papers cover many topics, all within the field of information warfare and its applications, now and into the future.

The papers have been grouped into six streams: …

The Mediated Integration Arcitecture For Heterogeneous Data Integration, Chaiyaporn Chirathamjaree, Suvimol Mukviboonchai

Research outputs pre 2011

To interoperate data sources which differ structurally and semantically, particular problems occur, for example, problems of changing schemas in data sources will affect the integrated schema. In this paper, we propose the mediated integration architecture (MedInt), which employs mediation and wrapping techniques as the main components for the integration of heterogeneous systems. With MedInt, a mediator acts as an intermediate medium transforming queries to sub-queries, integrating result data and resolving conflicts. Wrappers then transform sub-queries to specific local queries so that each local system is able to understand the queries.

Evolving Crushers, Philip Hingston, Luigi Barone, Ronald While

Research outputs pre 2011

This paper describes the use of an evolutionary algorithm to solve an engineering design problem. The problem involves determining the geometry and operating settings for a crusher in a comminution circuit for ore processing. The intention is to provide a tool for consulting engineers that can be used to explore candidate designs for various scenarios. The algorithm has proved capable of deriving designs that are clearly superior to existing designs, promising significant financial benefits

If You Go Down The Internet Today - Deceptive Honeypots, Craig Valli, Suen Yek

Research outputs pre 2011

This is preliminary research into the effectiveness of deceptive defensive measures in particular honeypots that use deceit as a primary defensive and offensive mechanism. Initial research has been conducted using the Deception Tool Kit and its ability to fool commonly available network scanning tools such as Nessus and Nmap The preliminary research indicates that these deceptive tools have a place in modern network defence architecture.

With Speed The Hacker Cometh, Craig Valli

Research outputs pre 2011

This paper is an examination of six months of IDS reports and firewall logs for a small enterprise that has a new broadband ADSL connection. The paper examines the information contained in the logfiles and the implications of detected activities by would be attackers. An examination of the issues that the deployment of broadband has for home and small business users is also undertaken.

Firewall Or Folly - An Initial Investigation Into The Effectiveness Of Personal Firewalls In Securing Personal Computers From Attack, Jeshua Yee

Research outputs pre 2011

With the increase in the use of Personal Computer (PC) firewall, this study looks at the security features provided by eight PC firewall; they are BlackICE, Deerfield, Kirio, MacAfee, Outpost, Sygate, Tiny and Zonealarm. The Nessus network scanner was used to probe these systems in a variety of configurations. The paper discusses the results and their implications for users of this new range of software.

Cutting Hacking: Breaking From Tradition, Rick Duley, Stanislaw P. Maj

Research outputs pre 2011

Code construction is the one inescapable phase of the software development cycle yet educators seem unable to escape the mind-set which equates programming with syntax and semantics. Accumulated coding wisdom of more than four decades, now being codified in the SWEBOK, should smooth the process of learning to develop software if presented early in the student's career. Typically, however, it continues to be presented in advanced programming units rather than as fundamental understanding. As a consequence, code hacking is the norm in undergraduate years. This paper examines current practice and presents the view that what is needed is not a …

Performance Evaluation And Comparison Of Corba Implementations For The Java Platform, Irina K. Grant

UNF Graduate Theses and Dissertations

Middleware is a software layer between the applications, services and the operating system that provides an abstraction to the application programmer. It masks the heterogeneous nature of the network and provides such services as remote calls, naming service, transaction process abilities, and security services. Common Object Request Broker Architecture (CORBA) is a middleware design that is implemented through the use of Object Request Broker (ORB), which is a software component that,allows communication between the remote objects and applications that use them in a distributed environment. CORBA applications can run on almost any platform, operating system, and support different languages. There …

Java At Middle Age: Enabling Java For Computational Science, George K. Thiruvathukal

Computer Science: Faculty Publications and Other Works

Not long after the Mosaic Web browser appeared and Netscape communications formed, Sun Microsystems launched Java in a way that will be forever known as a marketing success story. All across the US, there were many Java Day events. I still have my t-shirts as proof of having been there.