Digital Commons Network^™

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 …

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.

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.

Modeling A Real-Time Economics Simulation With User-Coded Agents In An Object-Oriented Database, Kevin Simons

Honors Theses

A simulation tbat models the stock market with real-time stock quotes was created. Users can translate their own theories about investing into Java code, which is then used to create an intelligent agent. The agent is inserted into the simulation, which allows the agent to gather data from the model. Based on this data, the agent uses the algorithm the user wrote to buy and sell stocks. Such as model provides a means of testing investment theories before investing.

A Web Content Management And Personalization Model Using One-To-One Strategy For Higher Educational Institutions, Yee Pong Ng

Masters Theses

This research explored a Web content management and personalization model for higher educational institutions. Through a review of literature and data collected from users, it formulated a conceptual model for Web content management and personalization. The study used the Web site of School of Technology at Eastern Illinois University as a typical case from which to develop the model for higher educational institutions. Understanding the factors influencing user attitudes about the adoption of new Web technologies is extremely important. Such an understanding can help Web developers develop a theoretical framework for a Web model as well as identify its components. …

Decentralized Control For Coordinated Flow Of Multi-Agent Systems, Valentino Crespi, George Cybenko, Daniela Rus, Massimo Santini

Computer Science Technical Reports

This paper describes a distributed algorithm for coordinating the flow of a mass of vehicles approaching a highway exit or a tollbooth. We provide the problem formulation, a general methodology for distributed control and an instantiation of this methodology to the coordinated flow problem. We analyze our algorithm and provide experimental data.

Sar Simulations In Wireless Communication And Safety Discussions In The Society, M. O. Özyalçin, Funda Akleman, Levent Sevgi̇

Turkish Journal of Electrical Engineering and Computer Sciences

Numerical simulation in cellular phone - human tissue interaction is discussed in this paper. The powerful time domain (TD) techniques, the transmission line matrix (TLM) and the finite-difference time-domain (FDTD) methods, are used to model mutual effects. The purpose is to calculate specific absorption rate (SAR; defined as the power absorbed by the unit mass of the tissue), validate the codes and verify the results. Also, effectiveness of the SAR parameter in determination of the exposure limits for human health and environmental pollution is discussed.

Preface, Alexander Kurz

Engineering Faculty Articles and Research

No abstract provided.

Definability, Canonical Models, And Compactness For Finitary Coalgebraic Modal Logic, Alexander Kurz, Dirk Pattinson

Engineering Faculty Articles and Research

This paper studies coalgebras from the perspective of the finitary observations that can be made of their behaviours. Based on the terminal sequence, notions of finitary behaviours and finitary predicates are introduced. A category Behω(T) of coalgebras with morphisms preserving finitary behaviours is defined. We then investigate definability and compactness for finitary coalgebraic modal logic, show that the final object in Behω(T) generalises the notion of a canonical model in modal logic, and study the topology induced on a coalgebra by the finitary part of the terminal sequence.

Pricing And Product Mix Optimization In Freight Transportation, Michael F. Gorman

MIS/OM/DS Faculty Publications

We propose improved pricing and market mix can improve the profitability of the freight transportation provider through the reduction of equipment repositioning costs. We hypothesize that because of complexities surrounding pricing and equipment repositioning costing, existing pricing strategies in freight transportation fail to fully consider these costs. We test this hypothesis in an applied setting in which Monte Carlo simulation captures the stochasticity of market conditions inherent in the problem. We use a heuristic to improve the nondifferentiable, discontinuous objective function.

Our results from test cases show with high confidence that current prices are not optimal, as indicated by a …

A Developmental Approach To Anchoring, Doug Blank, Deepak Kumar, Lisa Meeden

Computer Science Faculty Research and Scholarship

No abstract provided.

A Developmental Approach To Intelligence, Doug Blank, Deepak Kumar, Lisa Meeden

Computer Science Faculty Research and Scholarship

In this paper we present a developmental approach to- ward creating intelligent systems. Although embracing an emergent paradigm, we also propose an architecture such that symbols have their proper place. To explore this methodology, we are developing our system on real robots. Robotic approaches usually invoke the so-called “symbol grounding problem” (Harnad 1990). However, our developmental approach bypasses the problem by generating the symbols. Thus, in a sense, the symbols are inherently grounded to the physical objects they des- ignate. We argue that a general theory of intelligence that takes a top-down perspective will be inherently in- complete.

Scale And Orientation-Invariant Scene Similarity Metrics For Image Queries, James Carswell

Articles

In this paper we extend our previous work on shape-based queries to support queries on configurations of image objects. Here we consider spatial reasoning, especially directional and metric object relationships. Existing models for spatial reasoning tend to rely on pre-identified cardinal directions and minimal scale variations, assumption that cannot be considered as given in our image applications, where orientations and scale may vary substantially, and are often unknown. Accordingly, we have developed the method of varying baselines to identify similarities in direction and distance relations. Our method allows us to evaluate directional similarities without a priori knowledge of cardinal directions, …

The Geometric Mean As A Generator Of Truth-Value In Heuristic Expert Systems: An Improvement Over The Fuzzy Weighted Arithmetic Mean, Walter L. Dixon

CCAC Theses and Dissertations

Many earlier expert systems that were modeled after MYCIN, the first expert system, employed truth-value factors for their rule antecedents (premises) and consequents (conclusions). These crisp truth-value factors were usually called certainty factors and attempted to provide a measure of confidence and computational capability to the analysis of rule uncertainty (Shortliffe, 1977; Kandel, 1994). However, in the literature criticism has been often expressed concerning the lack of precision a crisp truth/certainty factor value conveys (Zadeh, 1983; Turban, 1993). Zadeh (1973) and Xingui (1988) utilized the weighted fuzzy average algorithm to improve the precision of truth/certainty factor values. Kandel (1994) further …