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 451 - 480 of 823
Full-Text Articles in Computer Sciences
Link Quality Prediction For Wireless Devices With Multiple Radios, Qiuyi Duan, Charles D. Knutson, Lei Wang, Daniel Zappala
Link Quality Prediction For Wireless Devices With Multiple Radios, Qiuyi Duan, Charles D. Knutson, Lei Wang, Daniel Zappala
Faculty Publications
Communication between wireless devices ought to be as simple as possible; they should be able to seamlessly switch between different radios and network stacks on the fly in order to better serve the user. To make this a possibility, we consider the challenging problem of predicting link quality in a changing mobile environment. In this paper we present an algorithm that uses Weighted Least Squares Regression to predict whether a given link can meet application requirements in terms of throughput, delay, and jitter. We use a simulation study to demonstrate that our algorithm is able to predict link quality accurately …
Interactive Part Selection For Mesh And Point Models Using Hierarchical Graph-Cut Partitioning, Steven W. Brown
Interactive Part Selection For Mesh And Point Models Using Hierarchical Graph-Cut Partitioning, Steven W. Brown
Theses and Dissertations
This thesis presents a method for interactive part selection for mesh and point set surface models that combines scribble-based selection methods with hierarchically accelerated graph-cut segmentation. Using graph-cut segmentation to determine optimal intuitive part boundaries enables easy part selection on complex geometries and allows for a simple, scribble-based interface that focuses on selecting within visible parts instead of precisely defining part boundaries that may be in difficult or occluded regions. Hierarchical acceleration is used to maintain interactive speeds with large models and to determine connectivity when extending the technique to point set models.
Or Best Offer: A Privacy Policy Negotiation Protocol, Eric G. Mercer, Kent E. Seamons, Daniel D. Walker
Or Best Offer: A Privacy Policy Negotiation Protocol, Eric G. Mercer, Kent E. Seamons, Daniel D. Walker
Faculty Publications
Privacy policy languages, such as P3P, allow websites to publish their privacy practices and policies in machine readable form. Currently, software agents designed to protect users’ privacy follow a “take it or leave it” approach that is inflexible and gives the server ultimate control. Privacy policy negotiation is one approach to leveling the playing field by allowing a client to negotiate with a server to determine how that server collects and uses the client’s data. We present a privacy policy negotiation protocol, “Or Best Offer”, that includes a formal model for specifying privacy preferences and reasoning about privacy policies. The …
Application And Evaluation Of Spatiotemporal Enhancement Of Live Aerial Video Using Temporally Local Mosaics, Dennis Eggett, Cameron Engh, Damon Gerhardt, Michael A. Goodrich, Bryan S. Morse, Nathan Rasmussen, Daniel Thornton
Application And Evaluation Of Spatiotemporal Enhancement Of Live Aerial Video Using Temporally Local Mosaics, Dennis Eggett, Cameron Engh, Damon Gerhardt, Michael A. Goodrich, Bryan S. Morse, Nathan Rasmussen, Daniel Thornton
Faculty Publications
Camera-equipped mini-UAVs are popular for many applications, including search and surveillance, but video from them is commonly plagued with distracting jittery motions and disorienting rotations that make it difficult for human viewers to detect objects of interest and infer spatial relationships. For time-critical search situations there are also inherent tradeoffs between detection and search speed. These problems make the use of dynamic mosaics to expand the spatiotemporal properties of the video appealing. However, for many applications it may not be necessary to maintain full mosaics of all of the video but to mosaic and retain only a number of recent …
Assessing The Costs Of Sampling Methods In Active Learning For Annotation, James Carroll, Robbie Haertel, Peter Mcclanahan, Eric K. Ringger, Kevin Seppi
Assessing The Costs Of Sampling Methods In Active Learning For Annotation, James Carroll, Robbie Haertel, Peter Mcclanahan, Eric K. Ringger, Kevin Seppi
Faculty Publications
Traditional Active Learning (AL) techniques assume that the annotation of each datum costs the same. This is not the case when annotating sequences; some sequences will take longer than others. We show that the AL technique which performs best depends on how cost is measured. Applying an hourly cost model based on the results of an annotation user study, we approximate the amount of time necessary to annotate a given sentence. This model allows us to evaluate the effectiveness of AL sampling methods in terms of time spent in annotation. We acheive a 77% reduction in hours from a random …
Ranking Search Results For Translated Content, Brian Edwin Hawkins
Ranking Search Results For Translated Content, Brian Edwin Hawkins
Theses and Dissertations
Translation Memory (TM) is a valuable tool that helps human translators in doing their job. TM consists of a collection of previously translated texts, called translation units, that may prove useful in the translation of new text. The main problem faced by translators who wish to take advantage of TM is that, although search tools do exist, there is no standardized way of effectively ranking search results. This thesis proposes a method for ranking TM search results together with a novel approach to efficiently finding common substrings that is used in the ranking process.
Machine Code Verification Using The Bogor Framework, Joseph R. Edelman
Machine Code Verification Using The Bogor Framework, Joseph R. Edelman
Theses and Dissertations
Verification and validation of embedded systems software is tedious and time consuming. Software model checking uses a tool-based approach automating this process. In order to more accurately model software it is necessary to provide hardware support that enables the execution of software as it should run on native hardware. Hardware support often requires the creation of model checking tools specific to the instruction set architecture. The creation of software model checking tools is non-trivial. We present a strategy for using an "off-the-shelf" model checking tool, Bogor, to provide support for multiple instruction set architectures. Our strategy supports key hardware features …
Automating Mini-Ontology Generation From Canonical Tables, Stephen G. Lynn
Automating Mini-Ontology Generation From Canonical Tables, Stephen G. Lynn
Theses and Dissertations
In this thesis work we develop and test MOGO (a Mini-Ontology GeneratOr.) MOGO automates the generation of mini-ontologies from canonicalized tables of data. This will help anyone trying to organize large amounts of existing data into a more searchable and accessible form. By using a number of different heuristic rules for selecting, enhancing, and modifying ontology elements, MOGO allows users to automatically, semi-automatically, or manually generate conceptual mini-ontologies from canonicalized tables of data. Ideally, MOGO operates fully automatically while allowing users to intervene to direct and correct when necessary so that they can always satisfactorily complete the translation of canonicalized …
Improving Spreadsheets For Complex Problems, Brian C. Whitmer
Improving Spreadsheets For Complex Problems, Brian C. Whitmer
Theses and Dissertations
Spreadsheets are one of the most frequently used applications. They are used because they are easy to understand and values can be updated easily. However, many people try to use spreadsheets for problems beyond their intended scope and end up with errors and miscalculations. We present a new spreadsheet system which uses complex-values and equation code reuse to overcome the limitations of spreadsheets for complex problems. We also discuss the features necessary in order to make these enhancements useful and effective.
Generalized Constrained Interpolation, Jacob Porter Merrell
Generalized Constrained Interpolation, Jacob Porter Merrell
Theses and Dissertations
Interpolation is essential in digital image processing, especially magnification. Many different approaches to interpolation specific to magnification have been developed in an effort to overcome the shortcomings of bilinear and bicubic interpolation. One of these approaches, Constraint-Based Interpolation, produces an image that is free of jaggies and has less blurring than bilinear or bicubic interpolation. Although Constraint-Based Interpolation produces a visually pleasing image, there are user-chosen parameters that make the algorithm difficult to use. In this thesis we propose a method for automatic selection of those parameters and an extension of Constraint-Based Interpolation to other forms of image manipulation, such …
Increasing Dogma Scaling Through Clustering, Nathan Hyrum Ekstrom
Increasing Dogma Scaling Through Clustering, Nathan Hyrum Ekstrom
Theses and Dissertations
DOGMA is a distributed computing architecture developed at Brigham Young University. It makes use of idle computers to provide additional computing resources to applications, similar to Seti@home. DOGMA's ability to scale to large numbers of computers is hindered by its strict client-server architecture. Recent research with DOGMA has shown that introducing localized peer-to-peer downloading abilities enhances DOGMA's performance while reducing the amount of network and server usage. This thesis proposes to further extend the peer-to-peer abilities of DOGMA to include peering client server communication by creating dynamic clusters of clients. The client clusters aggregate their communication with only one client …
A Tool To Support Ontology Creation Based On Incremental Mini-Ontology Merging, Zonghui Lian
A Tool To Support Ontology Creation Based On Incremental Mini-Ontology Merging, Zonghui Lian
Theses and Dissertations
This thesis addresses the problem of tool support for semi-automatic ontology mapping and merging. Solving this problem contributes to ontology creation and evolution by relieving users from tedious and time-consuming work. This thesis shows that a tool can be built that will take a “mini-ontology” and a “growing ontology” as input and make it possible to produce manually, semi-automatically, or automatically an extended growing ontology as output. Characteristics of this tool include: (1) a graphical, interactive user interface with features that will allow users to map and merge ontologies, and (2) a framework supporting pluggable, semi-automatic, and automatic mapping and …
Improving Liquid State Machines Through Iterative Refinement Of The Reservoir, R David Norton
Improving Liquid State Machines Through Iterative Refinement Of The Reservoir, R David Norton
Theses and Dissertations
Liquid State Machines (LSMs) exploit the power of recurrent spiking neural networks (SNNs) without training the SNN. Instead, a reservoir, or liquid, is randomly created which acts as a filter for a readout function. We develop three methods for iteratively refining a randomly generated liquid to create a more effective one. First, we apply Hebbian learning to LSMs by building the liquid with spike-time dependant plasticity (STDP) synapses. Second, we create an eligibility based reinforcement learning algorithm for synaptic development. Third, we apply principles of Hebbian learning and reinforcement learning to create a new algorithm called separation driven synaptic modification …
Accelerating Corpus Annotation Through Active Learning, George Busby, Marc Carmen, James Carroll, Robbie Haertel, Deryle W. Lonsdale, Peter Mcclanahan, Eric K. Ringger, Kevin Seppi
Accelerating Corpus Annotation Through Active Learning, George Busby, Marc Carmen, James Carroll, Robbie Haertel, Deryle W. Lonsdale, Peter Mcclanahan, Eric K. Ringger, Kevin Seppi
Faculty Publications
PDF of Powerpoint Presentation on accelerating corpus annotation through active learning. This presentation was given at the Conference of the American Association for Corpus Linguistics in 2008.
Analysis Of Canonical Chinese Antonym Co-Occurrence, Eric K. Ringger, Guohui Liu, Shiping Liu, Xingfu Wang
Analysis Of Canonical Chinese Antonym Co-Occurrence, Eric K. Ringger, Guohui Liu, Shiping Liu, Xingfu Wang
Faculty Publications
PDF of Powerpoint Presentation on canonical Chinese antonym co-occurrence. This presentation was given at the Conference of the American Association for Corpus Linguistics in 2008.
Compiling And Annotating A Syriac Corpus, George Busby, James Carroll, Marc Carmen, Carl Griffin, Robbie Haertel, Kristian Heal, Joshua Heaton, Deryle W. Lonsdale, Peter Mcclanahan, Eric K. Ringger, Kevin Seppi, David Taylor
Compiling And Annotating A Syriac Corpus, George Busby, James Carroll, Marc Carmen, Carl Griffin, Robbie Haertel, Kristian Heal, Joshua Heaton, Deryle W. Lonsdale, Peter Mcclanahan, Eric K. Ringger, Kevin Seppi, David Taylor
Faculty Publications
PDF of Powerpoint Presentation on compiling and annotating a Syriac corpus. This presentation was given at the Conference of the American Association for Corpus Linguistics in 2008.
Approximations With Improving Error Bounds For Makespan Minimization In Batch Manufacturing, Whitney Samuel Weyerman
Approximations With Improving Error Bounds For Makespan Minimization In Batch Manufacturing, Whitney Samuel Weyerman
Theses and Dissertations
Multipurpose batch manufacturing systems allow a suite of job types to be processed with a fixed set of machines. These types of systems are commonly found in chemical processing, as well as in computer systems and the service industry. In this thesis we consider the problem of sequencing jobs entering the manufacturing system in order to minimize makespan, or total time to complete processing of the jobs. We formulate this problem as a dynamic programming problem and illustrate the computational difficulty of solving this problem. We give a method for simulation of the system by representing each machine in the …
Extending Web Application Development To The User-Editable Space, Brian S. Goodrich
Extending Web Application Development To The User-Editable Space, Brian S. Goodrich
Theses and Dissertations
The growth of the web increased dramatically when users were provided with applications that let them use just their browser to post and edit content on the World Wide Web. Offering users the ability to use their browser to create their own web applications, instead of just posting text and images, would cause another Internet evolution. This thesis describes the EXPPO system (Extensible Page Productions and Operations), a web application development environment for both end-users and technical-users. EXPPO leverages the end-user's previous experience with internet browsers by using a page based development experience or a Page Oriented Architecture. Because applications …
Cpg: Closed Pseudonymous Groups, Reed S. Abbott
Cpg: Closed Pseudonymous Groups, Reed S. Abbott
Theses and Dissertations
Internet users generally feel their actions are anonymous, but this is often not the case. Users can be tracked and their actions logged for future analysis, which is not the desire of most users. Software and services exist which offer anonymity on the Internet when used correctly. Anonymity on the Internet is useful for many people including whistleblowers, dissidents, law enforcement, and the security conscious, but it can be abused. A user can act maliciously under the guise of anonymity without the fear of retribution. Thus, a level of administrative control over users is desirable, even in an anonymous system. …
Putting The Web Services Specifications To Rest, Dan R. Olsen
Putting The Web Services Specifications To Rest, Dan R. Olsen
Theses and Dissertations
Web services have become a useful and effective way of sharing information over the World Wide Web. SOAP has become a popular way of providing Web services and has been the focus of the Web Services specifications. The Web Services specifications provide additional capabilities to Web Services such as security and policy exchange. Another popular form of Web services includes light-weight Web or RESTful Web services over HTTP. These light-weight Web services are currently not addressed by the Web Services specifications. In order to provide the same capabilities to RESTful Web services, the Web Services specifications will be used to …
A Bittorrent Proxy, Robert Brent Larsen
A Bittorrent Proxy, Robert Brent Larsen
Theses and Dissertations
BitTorrent is a peer-to-peer protocol useful for distributing large files over the Internet. Many organizations use BitTorrent to distribute their software in order to reduce client download time and reduce the load on their servers. While there is a lot of legitimate content available via BitTorrent, some organizations ban BitTorrent usage due to concerns over copyright infringement and the amount of bandwidth that peers can consume. A BitTorrent proxy will allow organizations to control those risks and allow its members to use the BitTorrent protocol for approved uses. It will allow the organization to control the files that are downloaded …
Sub-Symbolic Re-Representation To Facilitate Learning Transfer, Dan A. Ventura
Sub-Symbolic Re-Representation To Facilitate Learning Transfer, Dan A. Ventura
Faculty Publications
We consider the issue of knowledge (re-)representation in the context of learning transfer and present a subsymbolic approach for effecting such transfer. Given a set of data, manifold learning is used to automatically organize the data into one or more representational transformations, which are then learned with a set of neural networks. The result is a set of neural filters that can be applied to new data as re-representation operators. Encouraging preliminary empirical results elucidate the approach and demonstrate its feasibility, suggesting possible implications for the broader field of creativity.
Simulation And Visualization Of Environments With Multidimensional Time, Luther A. Tychonievich
Simulation And Visualization Of Environments With Multidimensional Time, Luther A. Tychonievich
Theses and Dissertations
This work introduces the notion of computational hypertime, or the simulation and visualization of hypothetical environments possessing multidimensional time. An overview of hypertime is provided,including an intuitive visualization paradigm and a discussion of the failure of common simulation techniques when extended to include multidimensional time. A condition for differential equations describing hypertime motion to be amenable to standard time-iterative simulation techniques is provided,but is not satisfied by any known model of physics. An alternate simulation algorithm involving iterative refinement of entire equations of motion is presented,with an example implementation to solve elastic collisions in hypertime. An artificial intelligence algorithm for …
Wireless Authentication Using Remote Passwords, Andrew S. Harding
Wireless Authentication Using Remote Passwords, Andrew S. Harding
Theses and Dissertations
Current authentication methods for wireless networks are difficult to maintain. They often rely on globally shared secrets or heavyweight public-key infrastructure. Wireless Authentication using Remote Passwords (WARP) mitigates authentication woes by providing usable mechanisms for both administrators and end-users. Administrators grant access by simply adding users' personal messaging identifiers (e.g., email addresses, IM handles, cell phone numbers) to an access control list. There is no need to store passwords or other account information. Users simply prove ownership of their authorized identifier to obtain wireless access.
Adapting Adtrees For High Arity Features, Irene Langkilde-Geary, Robert Van Dam, Dan A. Ventura
Adapting Adtrees For High Arity Features, Irene Langkilde-Geary, Robert Van Dam, Dan A. Ventura
Faculty Publications
ADtrees, a data structure useful for caching sufficient statistics, have been successfully adapted to grow lazily when memory is limited and to update sequentially with an incrementally updated dataset. For low arity symbolic features, ADtrees trade a slight increase in query time for a reduction in overall tree size. Unfortunately, for high arity features, the same technique can often result in a very large increase in query time and a nearly negligible tree size reduction. In the dynamic (lazy) version of the tree, both query time and tree size can increase for some applications. Here we present two modifications to …
Utilizing Phrase-Similarity Measures For Detecting And Clustering Informative Rss News Articles, Yiu-Kai D. Ng, Maria Soledad Pera
Utilizing Phrase-Similarity Measures For Detecting And Clustering Informative Rss News Articles, Yiu-Kai D. Ng, Maria Soledad Pera
Faculty Publications
As the number of RSS news feeds continue to increase over the Internet, it becomes necessary to minimize the workload of the user who is otherwise required to scan through huge numbers of news articles to find related articles of interest, which is a tedious and often an impossible task. In order to solve this problem, we present a novel approach, called InFRSS, which consists of a correlation-based phrase matching (CPM) model and a fuzzy compatibility clustering (FCC) model. CPM can detect RSS news articles containing phrases that are the same as well as semantically alike, and dictate the degrees …
Learning Policies For Embodied Virtual Agents Through Demonstration, Jonathan Dinerstein, Parris K. Egbert, Dan A. Ventura
Learning Policies For Embodied Virtual Agents Through Demonstration, Jonathan Dinerstein, Parris K. Egbert, Dan A. Ventura
Faculty Publications
Although many powerful AI and machine learning techniques exist, it remains difficult to quickly create AI for embodied virtual agents that produces visually lifelike behavior. This is important for applications (e.g., games, simulators, interactive displays) where an agent must behave in a manner that appears human-like. We present a novel technique for learning reactive policies that mimic demonstrated human behavior. The user demonstrates the desired behavior by dictating the agent’s actions during an interactive animation. Later, when the agent is to behave autonomously, the recorded data is generalized to form a continuous state-to-action mapping. Combined with an appropriate animation algorithm …
Sentiment Regression: Using Real-Valued Scores To Summarize Overall Document Sentiment, Adam Drake, Eric K. Ringger, Dan A. Ventura
Sentiment Regression: Using Real-Valued Scores To Summarize Overall Document Sentiment, Adam Drake, Eric K. Ringger, Dan A. Ventura
Faculty Publications
In this paper, we consider a sentiment regression problem: summarizing the overall sentiment of a review with a real-valued score. Empirical results on a set of labeled reviews show that real-valued sentiment modeling is feasible, as several algorithms improve upon baseline performance. We also analyze performance as the granularity of the classification problem moves from two-class (positive vs. negative) towards infinite-class (real-valued).
A Reductio Ad Absurdum Experiment In Sufficiency For Evaluating (Computational) Creative Systems, Dan A. Ventura
A Reductio Ad Absurdum Experiment In Sufficiency For Evaluating (Computational) Creative Systems, Dan A. Ventura
Faculty Publications
We consider a combination of two recent proposals for characterizing computational creativity and explore the sufficiency of the resultant framework. We do this in the form of a gedanken experiment designed to expose the nature of the framework, what it has to say about computational creativity, how it might be improved and what questions this raises.
Automatic Composition Of Themed Mood Pieces, Heather Chan, Dan A. Ventura
Automatic Composition Of Themed Mood Pieces, Heather Chan, Dan A. Ventura
Faculty Publications
Musical harmonization of a given melody is a nontrivial problem; slight variations in instrumentation, voicing, texture, and bass rhythm can lead to significant differences in the mood of the resulting piece. This study explores the possibility of automatic musical composition by using machine learning and statistical natural language processing to tailor a piece to a particular mood using an existing melody.