Physical Sciences and Mathematics Commons^™

A Generator For Random Non-Binary Finite Constraint Satisfaction Problems, Hui Zou, Berthe Y. Choueiry, Amy M. Davis

CSE Technical Reports

The paper describes an implementation of a generator of random instances of non-binary constraint satisfaction problems that meets a given set of specifications. This is a continuation of the work we started in Hui Zou, Amy M. Beckwith, and Berthe Y. Choueiry. A Generator of Random Instances of Binary Finite Constraint Satisfaction Problems with Controllable Levels of Interchangeability. Working note, Department of Computer Science and Engineering, University of Nebraska-Lincoln, 2001. July, 2001.

The program is designed to generate random instances of Constraint Satisfaction Problems (CSPs) that meet a set of specified parameters, such as the number of variables, domain size, …

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

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

Techniques For Bundling The Solution Space Of Finite Constraint Satisfaction Problems, Berthe Y. Choueiry, Amy Beckwith

CSE Technical Reports

We study the backtrack-search procedure with forward checking (FCBT) for finding all solutions to a finite Constraint Satisfaction Problem (CSP). We describe how to use dynamic interchangeability to enhance the performance of search and represent the solution space in a compact manner. We evaluate this strategy (FC-DNPI) in terms of the numbers of nodes visited, constraints checked, and solution bundles generated by comparing it, theoretically and empirically, to other search strategies. We show that FC-DNPI is equivalent to search with the Cross Product Representation (FC-CPR) of [Hubbe and Freuder 1992] in terms of the numbers of solution bundles and constraint …

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

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

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

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

Negotiation-Based Coalition Formation Model For Agents With Incomplete Information And Time Constraints, Leen-Kiat Soh

CSE Technical Reports

In this paper we describe a coalition formation model for a cooperative multiagent system in which each agent has incomplete information about its dynamic and uncertain world and must respond to sensed events within time constraints. With incomplete information and uncertain world parameters while lacking time, an agent cannot afford organizing a rationally optimal coalition formation. Instead, our agents use a two-stage methodology. When an agent detects an event in the world, it first compiles a list of coalition candidates that it thinks would be useful, and then negotiates with the candidates. A negotiation is an exchange of information and …

Arktos: An Intelligent System For Satellite Sea Ice Image Analysis, Leen-Kiat Soh

CSE Technical Reports

We present an intelligent system for satellite sea ice image analysis named ARKTOS (Advanced Reasoning using Knowledge for Typing Of Sea ice). The underlying methodology of ARKTOS is to perform fully automated analysis of sea ice images by mimicking the reasoning process of sea ice experts and photo-interpreters. Hence, our approach is feature-based, rule-based classification supported by multisource data fusion and knowledge bases. A feature can be an ice floe, for example. ARKTOS computes a host of descriptors for that feature and then applies expert rules to classify the floe into one of several ice classes. ARKTOS also incorporates information …