Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Engineering (16)
- Databases and Information Systems (14)
- Social and Behavioral Sciences (14)
- Artificial Intelligence and Robotics (11)
- Business (10)
-
- Accounting (8)
- Life Sciences (7)
- Medicine and Health Sciences (7)
- Programming Languages and Compilers (7)
- Education (6)
- Information Security (6)
- Linguistics (6)
- Mechanical Engineering (6)
- Bioinformatics (5)
- Civil and Environmental Engineering (5)
- Library and Information Science (5)
- Construction Engineering and Management (4)
- Medical Sciences (4)
- Software Engineering (4)
- Technology and Innovation (4)
- Arts and Humanities (3)
- Computational Biology (3)
- Data Science (3)
- Genetics and Genomics (3)
- Medical Pathology (3)
- Biochemistry, Biophysics, and Structural Biology (2)
- Biology (2)
- Biomedical Engineering and Bioengineering (2)
- Keyword
-
- Machine learning (45)
- Computer (21)
- Security (20)
- Model checking (13)
- Particle swarm optimization (12)
-
- Reinforcement learning (12)
- UAV (12)
- Generalization (11)
- Authentication (10)
- Clustering (10)
- Computer science (10)
- Database (10)
- Neural networks (10)
- Trust negotiation (10)
- Annotation (9)
- Computer graphics (9)
- Neural network (9)
- Privacy (9)
- Algorithm (8)
- Genealogy (8)
- Information retrieval (8)
- Interpolation (8)
- Ontology (8)
- Optimization (8)
- Simulation (8)
- DNA sequencing (7)
- Data extraction (7)
- Multicast (7)
- Robotics (7)
- Verification (7)
- Publication Year
- Publication
- Publication Type
Articles 571 - 600 of 823
Full-Text Articles in Computer Sciences
Spatiotemporal Pattern Recognition Via Liquid State Machines, Eric Goodman, Dan A. Ventura
Spatiotemporal Pattern Recognition Via Liquid State Machines, Eric Goodman, Dan A. Ventura
Faculty Publications
The applicability of complex networks of spiking neurons as a general purpose machine learning technique remains open. Building on previous work using macroscopic exploration of the parameter space of an (artificial) neural microcircuit, we investigate the possibility of using a liquid state machine to solve two real-world problems: stockpile surveillance signal alignment and spoken phoneme recognition.
Learning Quantum Operators From Quantum State Pairs, Neil Toronto, Dan A. Ventura
Learning Quantum Operators From Quantum State Pairs, Neil Toronto, Dan A. Ventura
Faculty Publications
Developing quantum algorithms has proven to be very difficult. In this paper, the concept of using classical machine learning techniques to derive quantum operators from examples is presented. A gradient descent algorithm for learning unitary operators from quantum state pairs is developed as a starting point to aid in developing quantum algorithms. The algorithm is used to learn the quantum Fourier transform, an underconstrained two-bit function, and Grover’s iterate.
Brand X, A Cross-Layer Architecture For Quality Of Transport (Qot), Gregory Arthur De Hart
Brand X, A Cross-Layer Architecture For Quality Of Transport (Qot), Gregory Arthur De Hart
Theses and Dissertations
Computing devices are commonly equipped with multiple transport technologies such as IrDA, Bluetooth and WiFi. Transport switching technologies, such as Quality of Transport (QoT), take advantage of this heterogeneity to keep network sessions active as users move in and out of range of various transports or as the networking environment changes. Autonomous transport switching technologies rely on information regarding current network status and the ambient wireless environment in order to make intelligent decisions. This thesis proposes Brand X, a cross-layer architecture designed for a QoT environment to provide timely and accurate environment information in order to facilitate autonomous transport switching. …
A Dynamic Attribute-Based Load Shedding And Data Recovery Scheme For Data Stream Management Systems, Amit Ahuja
A Dynamic Attribute-Based Load Shedding And Data Recovery Scheme For Data Stream Management Systems, Amit Ahuja
Theses and Dissertations
Data streams being transmitted over a network channel with capacity less than the data rate of the data streams is very common when using network channels such as dial-up, low bandwidth wireless links. Not only does this lower capacity creates delays but also causes sequential network problems such as packet losses, network congestion, errors in data packets giving rise to other problems and creating a cycle of problems hard to break out from. In this thesis, we present a new approach for shedding the less informative attribute data from a data stream with a fixed schema to maintain a data …
Guided Interactive Machine Learning, Aaron J. Pace
Guided Interactive Machine Learning, Aaron J. Pace
Theses and Dissertations
This thesis describes a combination of two current areas of research: the Crayons image classifier system and active learning. Currently Crayons provides no guidance to the user in what pixels should be labeled or when the task is complete. This work focuses on two main areas: 1) active learning for user guidance, and 2) accuracy estimation as a measure of completion. First, I provide a study through simulation and user experiments of seven active learning techniques as they relate to Crayons. Three of these techniques were specifically designed for use in Crayons. These three perform comparably to the others and …
Ontology-Based Free-Form Query Processing For The Semantic Web, Mark S. Vickers
Ontology-Based Free-Form Query Processing For The Semantic Web, Mark S. Vickers
Theses and Dissertations
With the onset of the semantic web, the problem of making semantic content effectively searchable for the general public emerges. Demanding an understanding of ontologies or familiarity with a new query language would likely frustrate semantic web users and prevent widespread success. Given this need, this thesis describes AskOntos, which is a system that uses extraction ontologies to convert conjunctive, free-form queries into structured queries for semantically annotated web pages. AskOntos then executes these structured queries and provides answers as tables of extracted values. In experiments conducted AskOntos was able to translate queries with a precision of 88% and a …
Histogram Matching For Camera Pose Neighbor Selection, Parris K. Egbert, Bryan S. Morse, Kevin L. Steele
Histogram Matching For Camera Pose Neighbor Selection, Parris K. Egbert, Bryan S. Morse, Kevin L. Steele
Faculty Publications
A prerequisite to calibrated camera pose estimation is the construction of a camera neighborhood adjacency graph, a connected graph defining the pose neighbors of the camera set. Pose neighbors to a camera C are images containing sufficient overlap in image content with the image from C that they can be used to correctly estimate the pose of C using structure-from-motion techniques. In a video stream, the camera neighborhood adjacency graph is often a simple connected path; frame poses are only estimated relative to their immediate neighbors. We propose a novel method to build more complex camera adjacency graphs that are …
Minimum Spanning Tree Pose Estimation, Parris K. Egbert, Kevin L. Steele
Minimum Spanning Tree Pose Estimation, Parris K. Egbert, Kevin L. Steele
Faculty Publications
The extrinsic camera parameters from video stream images can be accurately estimated by tracking features through the image sequence and using these features to compute parameter estimates. The poses for long video sequences have been estimated in this manner. However, the poses of large sets of still images cannot be estimated using the same strategy because wide-baseline correspondences are not as robust as narrow-baseline feature tracks. Moreover, video pose estimation requires a linear or hierarchically-linear ordering on the images to be calibrated, reducing the image matches to the neighboring video frames. We propose a novel generalization to the linear ordering …
Image Vectorization, Brian L. Price
Image Vectorization, Brian L. Price
Theses and Dissertations
We present a new technique for creating an editable vector graphic from an object in a raster image. Object selection is performed interactively in subsecond time by calling graph cut with each mouse movement. A renderable mesh is then computed automatically for the selected object and each of its (sub)objects by (1) generating a coarse object mesh; (2) performing recursive graph cut segmentation and hierarchical ordering of subobjects; (3) applying error-driven mesh refinement to each (sub)object. The result is a fully layered object hierarchy that facilitates object-level editing without leaving holes. Object-based vectorization compares favorably with current approaches in the …
Temporal Data Mining In A Dynamic Feature Space, Brent K. Wenerstrom
Temporal Data Mining In A Dynamic Feature Space, Brent K. Wenerstrom
Theses and Dissertations
Many interesting real-world applications for temporal data mining are hindered by concept drift. One particular form of concept drift is characterized by changes to the underlying feature space. Seemingly little has been done to address this issue. This thesis presents FAE, an incremental ensemble approach to mining data subject to concept drift. FAE achieves better accuracies over four large datasets when compared with a similar incremental learning algorithm.
Trust Negotiation For Open Database Access Control, Paul A. Porter
Trust Negotiation For Open Database Access Control, Paul A. Porter
Theses and Dissertations
Hippocratic databases are designed to protect the privacy of the individuals whose personal information they contain. This thesis presents a model for providing and enforcing access control in an open Hippocratic database system. Previously unknown individuals can gain access to information in the database by authenticating to roles through trust negotiation. Allowing qualified strangers to access the database increases the usefulness of the system without compromising privacy. This thesis presents the design and implementation of two methods for filtering information from database queries. First, we extend a query modification method for use in an open database system. Second, we introduce …
No Free Lunch, Bayesian Inference, And Utility: A Decision-Theoretic Approach To Optimization, Christopher Kenneth Monson
No Free Lunch, Bayesian Inference, And Utility: A Decision-Theoretic Approach To Optimization, Christopher Kenneth Monson
Theses and Dissertations
Existing approaches to continuous optimization are essentially mechanisms for deciding which locations should be sampled in order to obtain information about a target function's global optimum. These methods, while often effective in particular domains, generally base their decisions on heuristics developed in consideration of ill-defined desiderata rather than on explicitly defined goals or models of the available information that may be used to achieve them. The problem of numerical optimization is essentially one of deciding what information to gather, then using that information to infer the location of the global optimum. That being the case, it makes sense to model …
Clustering Of Database Query Results, Kristine Jean Daniels
Clustering Of Database Query Results, Kristine Jean Daniels
Theses and Dissertations
Increasingly more users are accessing database systems for interactive and exploratory data retrieval. While performing searches on these systems, users are required to use broad queries to get their desired results. Broad queries often result in too many items forcing the user to spend unnecessary time sifting through these items to find the relevant results. This problem, of finding a desired data item within many items, is referred to as "information overload". Most users experience information overload when viewing these database query results. This thesis shows that users information overload can be reduced by clustering database query results. …
Axiomatic Multi-Transport Bargaining: A Quantitative Method For Dynamic Transport Selection In Heterogeneous Multi-Transport Wireless Environments, Qiuyi Duan, Michael A. Goodrich, Charles D. Knutson, Lei Wang
Axiomatic Multi-Transport Bargaining: A Quantitative Method For Dynamic Transport Selection In Heterogeneous Multi-Transport Wireless Environments, Qiuyi Duan, Michael A. Goodrich, Charles D. Knutson, Lei Wang
Faculty Publications
Transport selection mechanisms are designed to facilitate seamless connectivity in heterogeneous multi-transport environments, allowing access to the “best” available transport according to user requirements. Evaluating transport configurations dynamically according to the user’s preferences and Quality of Service (QoS) requirements is a challenging task. This paper describes a quantitative approach that applies the Utility Theorem and Nash’s Bargaining solution to heterogeneous wireless environments. The mathematical model presented generates and adjusts the transport preference list dynamically depending on the degree to which a transport satisfies user preferences and the application’s QoS requirements. We incorporate a negotiation engine using the Axiomatic Multi-Transport Bargaining …
Separating Lines Of Text In Free-Form Handwritten Historical Documents, William A. Barrett, Douglas J. Kennard
Separating Lines Of Text In Free-Form Handwritten Historical Documents, William A. Barrett, Douglas J. Kennard
Faculty Publications
We present an approach to finding (and separating) lines of text in free-form handwritten historical document images. After preprocessing, our method uses the count of foreground/background transitions in a binarized image to determine areas of the document that are likely to be text lines. Alternatively, an Adaptive Local Connectivity Map (ALCM) found in the literature can be used for this step of the process. We then use a min-cut/max-flow graph cut algorithm to split up text areas that appear to encompass more than one line of text. After removing text lines containing relatively little text information (or merging them with …
Dial 2004 Working Group Report On Acquisition Quality Control, William A. Barrett, Henry Baird, Frank Le Bourgeois, Xiaofan Lin, George Nagy, Steve Simske, Elisa H. Barney Smith
Dial 2004 Working Group Report On Acquisition Quality Control, William A. Barrett, Henry Baird, Frank Le Bourgeois, Xiaofan Lin, George Nagy, Steve Simske, Elisa H. Barney Smith
Faculty Publications
This report summarizes the discussions of the Working Group on Acquisition Quality at the International Workshop on Document Image Analysis for Libraries, Palo Alto, CA, 23-24 January 2004. Acquisition of the image is one of the most time intensive components of forming a digital library, and the quality of the acquisition will affect all later stages of the digital library project. The current state of the art in acquisition is analyzed. Problems and suggested improvements for image acquisition and storage formats and the special problems associated with acquisition from microfilm follows. A list of general suggestions was developed which was …
A Selective Approach To Bandwidth Overbooking, Feng Huang
A Selective Approach To Bandwidth Overbooking, Feng Huang
Theses and Dissertations
Overbooking is a technique used by network providers to increase bandwidth utilization. If the overbooking factor is chosen appropriately, additional virtual circuits can be admitted without degrading quality of service for existing customers. Most existing implementations use a single factor to accept a linear fraction of traffic requests. High values of this factor may cause the degradation of quality of service whereas low overbooking factors will result in underutilization of bandwidth. Network providers often select overbooking factors based only on aggregate average virtual circuit utilization. This paper proposes a selective overbooking scheme based on trunk size and usage profile. Experiments …
User Datagram Protocol With Congestion Control, Spencer L. Cox
User Datagram Protocol With Congestion Control, Spencer L. Cox
Theses and Dissertations
Communication through the Internet is one of the dominant methods of exchanging information. Whether at an individual or large corporate level the Internet has become essential to gathering and disseminating information. TCP and UDP are the transport layer protocols responsible for transit of nearly all Internet communications. Due to the growth of real-time audio and video applications, UDP is being used more frequently as a transport protocol. As UDP traffic increases potential problems arise. Unlike TCP, UDP has no mechanism for congestion control leading to wasted bandwidth and poor performance for other competing protocols. This thesis defines a congestion control …
Learning Real-World Problems By Finding Correlated Basis Functions, Adam C. Drake
Learning Real-World Problems By Finding Correlated Basis Functions, Adam C. Drake
Theses and Dissertations
Learning algorithms based on the Fourier transform attempt to learn functions by approximating the largest coefficients of their Fourier representations. Nearly all previous work in Fourier-based learning has been in the theoretical realm, where properties of the transform have made it possible to prove many interesting learnability results. The real-world usefulness of Fourier-based methods, however, has not been thoroughly explored. This thesis explores methods for the practical application of Fourier-based learning. The primary contribution of this thesis is a new search algorithm for finding the largest coefficients of a function's Fourier representation. Although the search space is exponentially large, empirical …
Browser-Based Trust Negotiation, Cameron Morris
Browser-Based Trust Negotiation, Cameron Morris
Theses and Dissertations
Trust negotiation allows two parties on the Internet to establish trust in each other according to the digital credentials thateach other possesses. Traditionally, trust negotiation uses certificates as digital credentials. However, certificates make trust negotiation difficult to use since people rarely have certificates available to them, and they must physically possess and secure all needed certificates in order to negotiate. To avoid these problems, this thesis proposes that credential authorities negotiate on behalf of the user. This thesis defines BrowserBased Trust Negotiation (BBTN) as a method for negotiating with credential authorities using the Secure Assertion Markup Language (SAML).
Encryption Of Computer Peripheral Devices, Kelly Robert Norman
Encryption Of Computer Peripheral Devices, Kelly Robert Norman
Theses and Dissertations
Computer peripherals, such as keyboards, scanners, printers, cameras, and Personal Data Assistants (PDAs) typically communicate with a host PC via an unencrypted protocol, leaving them vulnerable to eavesdropping techniques, such as keyloggers. An encryption system was developed that is simple enough to be used in peripherals that do not have large amounts of processing power and memory. A software driver loaded in the operating system of the host computer communicates with a simple 8-bit microcontroller in the peripheral device. The driver handles key generation, key exchange, and provides decrypted data to the operating system. A key exchange protocol allows the …
Surface Realization Using A Featurized Syntactic Statistical Language Model, Thomas L. Packer
Surface Realization Using A Featurized Syntactic Statistical Language Model, Thomas L. Packer
Theses and Dissertations
An important challenge in natural language surface realization is the generation of grammatical sentences from incomplete sentence plans. Realization can be broken into a two-stage process consisting of an over-generating rule-based module followed by a ranker that outputs the most probable candidate sentence based on a statistical language model. Thus far, an n-gram language model has been evaluated in this context. More sophisticated syntactic knowledge is expected to improve such a ranker. In this thesis, a new language model based on featurized functional dependency syntax was developed and evaluated. Generation accuracies and cross-entropy for the new language model did not …
Design And Measurement Of A Real-Time Peer-To-Peer Game, Michael D. Simonsen
Design And Measurement Of A Real-Time Peer-To-Peer Game, Michael D. Simonsen
Theses and Dissertations
Currently, multiplayer online games use the client-server architecture which is very resource intensive, expensive, and time consuming. Peer-to-peer protocols are a less resource intensive alternative to the client-server model. We implement a peer-to-peer protocol called NEO in a multiplayer game and run experiments in a lab setting and over the Internet. These experiments show us that NEO is able to run a smooth playable game, with low unused updates and low location error. This happens as long as the arrival delay is long enough to allow updates to arrive in the given time limit and the round length is short …
Learning Real-Time A* Path Planner For Unmanned Air Vehicle Target Sensing, Jason K. Howlett, Timothy W. Mclain, Michael A. Goodrich
Learning Real-Time A* Path Planner For Unmanned Air Vehicle Target Sensing, Jason K. Howlett, Timothy W. Mclain, Michael A. Goodrich
Faculty Publications
This paper presents a path planner for sensing closely-spaced targets from a fixed-wing unmanned air vehicle (UAV) having a specified sensor footprint. The planner is based on the learning real-time A* (LRTA*) search algorithm and produces dynamically feasible paths that accomplish the sensing objectives in the shortest possible distance. A tree of candidate paths that span the area of interest is created by assembling primitive turn and straight sections of a specified step size in a sequential fashion from the starting position of the UAV. An LRTA* search of the tree produces feasible paths any time during its execution and …
Using Augmented Virtuality To Improve Human-Robot Interactions, Curtis W. Nielsen
Using Augmented Virtuality To Improve Human-Robot Interactions, Curtis W. Nielsen
Theses and Dissertations
Mobile robots can be used in situations and environments that are distant from an operator. In order for an operator to control a robot effectively he or she requires an understanding of the environment and situation around the robot. Since the robot is at a remote distant from the operator and cannot be directly observed, the information necessary for an operator to develop an understanding or awareness of the robot's situation comes from the user interface. The usefulness of the interface depends on the manner in which the information from the remote environment is presented. Conventional interfaces for interacting with …
A User-Centric Tabular Multi-Column Sorting Interface For Intact Transposition Of Columnar Data, David B. L. Miles
A User-Centric Tabular Multi-Column Sorting Interface For Intact Transposition Of Columnar Data, David B. L. Miles
Theses and Dissertations
Many usability features designed in software applications are not procedurally intuitive for software users. A good example of software usability involves tabular sorting in a spreadsheet. Single-column sorting, activated with a mouse click to a column header or toolbar button, often produces rearranged listings that reduce cognitive organization beyond the sorted column. Multi-column sorting, generated through menu-driven processes, provides derived organization, however, locating feature options through menu-based systems can be confusing. A means to overcome this confusion is prioritized selection of database arrays issued to columnar displays for the purpose of intact transposition of data. This is a unique process …
Learning Successful Strategies In Repeated General-Sum Games, Jacob W. Crandall
Learning Successful Strategies In Repeated General-Sum Games, Jacob W. Crandall
Theses and Dissertations
Many environments in which an agent can use reinforcement learning techniques to learn profitable strategies are affected by other learning agents. These situations can be modeled as general-sum games. When playing repeated general-sum games with other learning agents, the goal of a self-interested learning agent is to maximize its own payoffs over time. Traditional reinforcement learning algorithms learn myopic strategies in these games. As a result, they learn strategies that produce undesirable results in many games. In this dissertation, we develop and analyze algorithms that learn non-myopic strategies when playing many important infinitely repeated general-sum games. We show that, in …
Trust Broker: A Defense Against Identity Theft From Online Transactions, Michael George Edvalson
Trust Broker: A Defense Against Identity Theft From Online Transactions, Michael George Edvalson
Theses and Dissertations
The proliferation of online services over the years has encouraged more and more people to participate in Internet activities. Many web sites request personal and sensitive information needed to deliver the desired service. Unfortunately, it is difficult to distinguish the sites that can be trusted to protect such information from those that cannot. Many attempts to make the Internet easier to use introduce new security and privacy problems. On the other hand, most attempts at creating a safe online environment produce systems that are cryptic and hard to use. The TrustBroker system is based on a specialized online repository that …
Industrial Technology Education Teachers Perceptions Of National Standards For Technological Literacy In The State Of Arizona, Allan R. Mcrae
Industrial Technology Education Teachers Perceptions Of National Standards For Technological Literacy In The State Of Arizona, Allan R. Mcrae
Theses and Dissertations
Today, it is becoming increasingly clear that there is a growing interest, concern, and need for technological literacy. To this end, the International Technology Education Association (ITEA) through the Technology for All Americans Project, has developed and promulgated the Standards for Technological Literacy: Content for the Study of Technology. This effort is part of the ongoing initiative to develop technology standards on a national level, and to focus on what every student in grades K-12 should know and be able to do in order to achieve technological literacy (ITEA, 2000). The purpose of this study was to investigate the perceived …
Generating Data-Extraction Ontologies By Example, Yuanqiu Zhou
Generating Data-Extraction Ontologies By Example, Yuanqiu Zhou
Theses and Dissertations
Ontology-based data-extraction is a resilient web data-extraction approach. A major limitation of this approach is that ontology experts must manually develop and maintain data-extraction ontologies. The limitation prevents ordinary users who have little knowledge of conceptual models from making use of this resilient approach. In this thesis we have designed and implemented a general framework, OntoByE, to generate data-extraction ontologies semi-automatically through a small set of examples collected by users. With the assistance of a limited amount of prior knowledge, experimental evidence shows that OntoByE is capable of interacting with users to generate data-extraction ontologies for domains of interest to …