Computer Sciences Commons^™

Managing Semantic Content For The Web, Amit P. Sheth, Clemens Bertram, David Avant, Brian Hammond, Krzysztof Kochut, Yashodhan Warke

Kno.e.sis Publications

By associating meaning with content, the Semantic Web will facilitate search, interoperability, and the composition of complex applications. A recent Scientific American article described the Semantic Web as 'an extension of the current Web in which information is given well-defined meaning, better enabling computers and people to work in cooperation.' Not long ago, researchers at a Stanford University symposium predicted that this second phase of the Web would be as revolutionary as the Web itself.

Predicting Oral Reading Miscues, Jack Mostow, Joseph Beck, S. Vanessa Winter, Shaojun Wang

Kno.e.sis Publications

This paper explores the problem of predicting specific reading mistakes, called miscues, on a given word. Characterizing likely miscues tells an automated reading tutor what to anticipate, detect, and remediate. As training and test data, we use a database of over 100,000 miscues transcribed by University of Colorado researchers. We explore approaches that exploit different sources of predictive power: the uneven distribution of words in text, and the fact that most miscues are real words. We compare the approaches’ ability to predict miscues of other readers on other text. A simple rote method does best on the most frequent 100 …

Workflow Quality Of Service, Jorge Cardoso, Amit P. Sheth, John A. Miller

Kno.e.sis Publications

Workflow management systems (WfMSs) have been used to support various types of business processes for more than a decade now. In ecommerce processes, suppliers and customers define a binding agreement or contract between the two parties, specifying quality of service (QoS) items such as products or services to be delivered, deadlines, quality of products, and cost of service. Management of such QoS directly impacts success of organizations participating in e-commerce. Organizations operating in modern markets require an excellent degree of quality of service management. Products and services must be available to customers with well-defined specifications. A good management of quality …

Controlling Web Query Execution In A Web Warehouse, Sanjay Kumar Madria, Sourav S. Bhowmick

Computer Science Faculty Research & Creative Works

Most of the contemporary Web query systems have limited capabilities in controlling Web query execution. Such query facility is important as it gives us an opportunity to optimize the evaluation of a Web query. We address this issue in the context of our Web warehousing system called WHOWEDA (Warehouse Of Web Data). Specifically, we investigate different types of constraints (related to query execution) which may be imposed on a Web query such as number of query results, time of execution, restrict the evaluation of a query to specified set of Web sites, etc. An important feature of our approach is …

Ilp Operators For Propositional Connectionist Networks, Miguel Angel Gutierrez-Naranjo, Pascal Hitzler

Computer Science and Engineering Faculty Publications

No abstract provided.

Group Properties Of Crossover And Mutation, Jonathan E. Rowe, Michael D. Vose, Alden H. Wright

Computer Science Faculty Publications

It is supposed that the finite search space Ω has certain symmetries that can be described in terms of a group of permutations acting upon it. If crossover and mutation respect these symmetries, then these operators can be described in terms of a mixing matrix and a group of permutation matrices. Conditions under which certain subsets of Ω are invariant under crossover are investigated, leading to a generalization of the term schema. Finally, it is sometimes possible for the group acting on Ω to induce a group structure on Ω itself.

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

School of Computing: 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 …

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

School of Computing: 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 …

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

School of Computing: 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 …

A Comparison Of Evolutionary And Coevolutionary Search, Ludo Pagie, Melanie Mitchell

Computer Science Faculty Publications and Presentations

Previous work on coevolutionary search has demonstrated both successful and unsuccessful applications. As a step in explaining what factors lead to success or failure, we present a comparative study of an evolutionary and a coevolutionary search model. In the latter model, strategies for solving a problem coevolve with training cases. We find that the coevolutionary model has a relatively large efficacy: 86 out of 100 (86%) of the simulations produce high quality strategies. In contrast, the evolutionary model has a very low efficacy: a high quality strategy is found in only two out of 100 runs (2%). We show that …

A Survey Of Various Frequency Domain Integral Equations For The Analysis Of Scattering From Three-Dimensional Dielectric Objects, Baek Ho Jung, T. K. Sarkar, Y.-S. Chung

Electrical Engineering and Computer Science - All Scholarship

In this paper, we present four different formulations for the analysis of electromagnetic scattering from arbitrarily shaped three-dimensional (3-D) homogeneous dielectric body in the frequency domain. The four integral equations treated here are the electric field integral equation (EFIE), the magnetic field integral equation (MFIE), the combined field integral equation (CFIE), and the PMCHW (Poggio, Miller, Chang, Harrington, and Wu) formulation. For the CFIE case, we propose eight separate formulations with different combinations of expansion and testing functions that result in sixteen different formulations of CFIE. One of the objectives of this paper is to illustrate that not all CFIE …

Towards Nonmonotonic Reasoning On Hierarchical Knowledge, Pascal Hitzler

Computer Science and Engineering Faculty Publications

W.C. Rounds and G.Q. Zhang have recently proposed to study a form of disjunctive logic programming generalized to algebraic domains [RZ01]. This system allows reasoning with information which is hierarchically structured and forms a (suitable) domain. We extend this framework to include reasoning with negative information, i.e. the implicit or explicit absence of bits of information. These investigations will naturally lead to a form of default reasoning which is strongly related to programming with answer sets to stable models, which has recently created much interest amongst artificial intelligence researchers concerned with knowledge representation and reasoning.

Quantitative Analysis Of Transmission Power Control In Wireless Ad-Hoc Networks, Seung Jong Park, R. Sivakumar

Computer Science Faculty Research & Creative Works

In this paper, we address the issue of transmission power control in wireless ad-hoc networks. In general, it is assumed that the minimum transmission power required to keep the network connected achieves the optimal throughput performance in an ad-hoc network. In contrast, we show that using the minimal transmission range might not always result in optimal throughput performance. Using both throughput and throughput per unit energy as the optimization criteria, we demonstrate that the optimal transmission power is generically a function of the number of stations, the network size, and the traffic load. In particular, we observe that the optimal …

Interlocked Open Linkages With Few Joints, Erik D. Demaine, Stefan Langerman, Joseph O'Rourke, Jack Snoeyink

Computer Science: Faculty Publications

We advance the study of collections of open linkages in 3-space that may be interlocked in the sense that the linkages cannot be separated without one bar crossing through another. We consider chains of bars connected with rigid joints, revolute joints, or universal joints and explore the smallest number of chains and bars needed to achieve interlock. Whereas previous work used topological invariants that applied to single or to closed chains, this work relies on geometric invariants and concentrates on open chains.

Adaptive Information Filtering: Concepts And Algorithms, Daniel R. Tauritz

Computer Science Faculty Research & Creative Works

Adaptive information filtering is concerned with filtering information streams in dynamic (changing) environments. The changes may occur both on the transmission side — the nature of the streams can change — and on the reception side — the interests of the user (or group of users) can change. While information filtering and information retrieval have a lot in common, this dissertation’s primary concern is with the differences. The temporal nature of information filtering necessitates more flexible document representation methods than does information retrieval where all the occurring terms are known in advance. Also, information filtering typically maintains user interest profiles …

A Proposed Undergraduate Bioinformatics Curriculum For Computer Scientists, Travis E. Doom, Michael L. Raymer, Dan E. Krane, Oscar Garcia

Kno.e.sis Publications

Bioinformatics is a new and rapidly evolving discipline that has emerged from the fields of experimental molecular biology and biochemistry, and from the the artificial intelligence, database, and algorithms disciplines of computer science. Largely because of the inherently interdisciplinary nature of bioinformatics research, academia has been slow to respond to strong industry and government demands for trained scientists to develop and apply novel bioinformatics techniques to the rapidly-growing, freely-available repositories of genetic and proteomic data. While some institutions are responding to this demand by establishing graduate programs in bioinformatics, the entrance barriers for these programs are high, largely due to …

Multi-Dimensional Regression Analysis Of Time-Series Data Streams, Yixin Chen, Guozhu Dong, Jiawei Han, Benjamin W. Wah, Jianyong Wang

Kno.e.sis Publications

Real-time production systems and other dynamic environments often generate tremendous (potentially infinite) amount of stream data; the volume of data is too huge to be stored on disks or scanned multiple times. Can we perform on-line, multi-dimensional analysis and data mining of such data to alert people about dramatic changes of situations and to initiate timely, high-quality responses? This is a challenging task.

In this paper, we investigate methods for online, multi-dimensional regression analysis of time-series stream data, with the following contributions: (1) our analysis shows that only a small number of compressed regression measures instead of the complete stream …

An Analysis Of A Private-Key Cryptosystem, Wei-Wey Tan

Student Works (2000-2009)

In this dissertation, we have presented a new block cipher. The proposed block cipher is a Substitution-Permutation network cryptosystem with a block length of 128 bits and key length of 256 bits. With the increased key length and block size, the proposed block cipher has greater security over DES. A modular design approach was applied. The cipher has three major building blocks and their interaction has been carefully chosen to achieve better security and performance. Algorithmic S­-Boxes are used to provide confusion and nonlinearity in the cipher. The proposed cipher uses a highly diffusive diffusion layer, which is a combination …

A Genetic Algorithm Solution To The Shortest Path Problem In Ospf And Mpls, Wee Jing Tee Wee Jing

Student Works (2000-2009)

This project studies and explores the potential of using genetic algorithm to solve the shortest path problem in Open Shortest Path First (OSPF) and Multiprotocol Label Switching (MPLS). The most critical task for developing a genetic algorithm to the shortest path problem is to how to encode a path in a network. In this project, two genetic algorithm solutions arc developed for the above two problem domains, i.e. Previous-node-based Encoding to solve the shortest path problem in OSPF and Priority-based Encoding to solve the shortest path problem in MPLS. For each of the shortest path problem domains, the proposed solution …

A Case Tool For Code Inspection, Siti Hajar Alias

Student Works (2000-2009)

Generally, quality and productivity play important roles in every software development life cycle. However, when discussing about quality and productivity, another function that synonym to distinguish these features is software inspection. Software inspection is generally accepted as a useful technique for finding errors in both documents and codes. There are several phases in software inspection and one of it is defect detection phase. This dissertation is to review the role of defect detection phases involved in the software inspection process. Thus, for this project, it focuses on the development of a prototype CASE tool for code inspection called CodeIns. CodeIns …

Level Set Segmentation Of Mr Images For Extraction Of Femur Bone And Tissues, Christina Shanti Nayagam

Student Works (2000-2009)

This research explores a potentially useful segmentation algorithm, known as the level set method. It is suitable for images obtained from the Magnetic Resonance Imaging (MRJ) modality, despite the fact that MR images have low contrast between bone and tissue. The level set method is a numerical technique designed to track the evolution of an interface. The fast marching version of the method is implemented for two-dimensional (2-D) and three-dimensional (3-D) segmentation in this research. Femur segmentation is the main thrust of this thesis, however brain and heart images are also presented. Pre-processing steps are first performed for the 2-0 …

Issues In Implementing Ipv6 In The X-Kernel Simulator, Raja Singam Thillainathan

Student Works (2000-2009)

The new Internet Protocol Version 6(IPv6) or Internet Protocol Next Generation (TPNG) is bound to replace the existing Internet Protocol Version 4(TPv4). This new protocol is to address and resolve the limitations of the existing Internet Protocols. At the moment the new protocol is still in its infancy stage, and it is being implemented by both the research society and the private sector. The x-kernel being a research project done by University of Arizona is freely available on the Internet. This x-kemel is a networking software almost similar to the Berkeley version (BSD) and it is bundled together with a …

Internet Information Server Scanner : Scanning On Url Vulnerabilities, Yu Jin Tan

Student Works (2000-2009)

This dissertation analyzes weaknesses on web servers, focusing on Microsoft's Internet Information Server (HS). As part of the research, an HS scanner (HS-SCAN) has been implemented to probe only on URL vulnerabilities. The need for a vulnerability scanner stems from the alarming number of successful attacks on computer systems that are connected to the Internet. The security flaws threatening e-businesses and the Internet community has prompted bona fide defense measures. Internet firewalls - gateways controlling access between one network and all the others - became a must-have for any organization connecting to the Net. If the firewall is considered the …

A Vhdl Implementation Of Bist Technique In Uart Design, Mohd. Yamani Idna Idris

Student Works (2000-2009)

No abstract provided.

An Investigation Into The Concepts And Applicability Of Agent Technologies, Anne White

Theses

The software world is one of great richness and diversity

Even though the concept of software agents date back to the days of AI (Artificial Intelligence) work (1970’s) the word “Agent” is currently in vogue in the computing press and computer science communities.

This thesis presents a review of the ongoing evolution of software agents, places agents in context within today’s software domain, and takes a closer look at the ongoing debate of what really constitutes an '"Agenf\ The numerous dimensions of classification are studied and an opinion of the attributes that an agent should encompass is put forward. Leading …

Design And Analysis Of Radio Frequency Deployment Algorithms For Gsm, Mónica Pérez-Carbonell

Theses

Due to the growth of the subscriber base and the introduction of new services, mobile communications networks’ demand for wireless resources is increasing. This has resulted in an increasing need to change the frequency allocation of a network in order to adapt the cellular network to new frequency demands.

Currently, a planning tool generates a new frequency plan, which is. then deployed to cell sites. The deployment should ideally be carried out with minimum disruption to network operation, which makes this deployment process a critical undertaking as any errors during or after the deployment can leave the network with poor …

The Evolution Of Cell Colonies In Volvocacean Algae : Investigation By Theoretical Analysis And Computer Simulation., Frank Noe

Theses

This thesis presents a mathematical analysis and computational simulation which is used to investigate the evolution of cell colonies. The evolutionary transition from unicellular to cell colony form is a prerequesite for multicellular life as it exists abundantly on earth. This transition has occured numerous times independently so that we expect a high selective advantage to be associated with it. The photosynthetic green algae order Volvocaceae is an appropriate set of model organisms for the study of the evolution of cell colonies since it comprises living unicellular organisms, cell colonies, and multicellular organisms of different shapes, sizes and levels of …

Distributed Power Control In Wireless Communication Systems, Sarangapani Jagannathan, A. T. Chronopoulos, S. Ponipireddy

Electrical and Computer Engineering Faculty Research & Creative Works

Energy efficiency is a measure of performance in wireless networks. Therefore, controlling the transmitter power at a given node increases not only battery operating life, but also overall system capacity by successfully admitting new links. It is essential to find effective means of power control in point-to-point, broadcasting and multicasting scenarios. Wireless networking presents formidable challenges, and we consider the problem of unicast or point-to-point (peer-to-peer) communication in wireless networks in the presence of other nodes. We study the feasibility of admitting new links in an wireless network operating area while maintaining quality of service (QoS), in terms of signal-to-interference …

Study Of Relative Effectiveness Of Features In Content-Based Image Retrieval, S. R. Subramanya, Jui Che Teng, Yongjian Fu

Electrical and Computer Engineering Faculty Research & Creative Works

Content-based retrieval in image databases requires appropriate features of images to be derived and used in the indexing and searching process. Fast and accurate retrieval is crucial from a user point of view. The kinds of features used, their organization in suitable data structures, and the similarity search scheme, directly affect the speed and quality of content-based retrieval. In this paper, we evaluate the relative significance of three different image features - geometry, moments, and Fourier descriptors in the context of content-based retrieval, and present experimental results. The evaluation metrics are retrieval quality and search time. These could be used …

A Hybrid System Theoretic Approach For Admission Controller Design In Multimedia Networks, Sarangapani Jagannathan

Electrical and Computer Engineering Faculty Research & Creative Works

A novel real-time discrete-event admission control (AC) scheme for high-speed networks is proposed with the aim of attaining a desired quality of service (QoS) and high network utilization. The AC uses the available capacity from a novel adaptive bandwidth estimation scheme, a congestion indicator derived from a congestion controller, peak bit/cell rate (PBR/PCR) estimate from new sources, along with the desired QoS metrics, and makes decisions whether to 'admit' or 'reject' new sources. The novel aspect of the proposed approach is the application of hybrid system theory to prove the performance of the admission controller, stability and the development of …