Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Keyword
-
- Deep learning (9)
- #antcenter (7)
- Machine learning (7)
- Robotics (7)
- Behavior-Based (5)
-
- Formal Verification (5)
- UAV (5)
- Validation (5)
- Convolutional neural network (4)
- Feature extraction (4)
- Unmanned aircraft (4)
- Big data (3)
- Internet of Underground Things (3)
- Learning (3)
- Underground Communications (3)
- Wireless Underground Channel (3)
- Activity tracking (2)
- Ant colony optimization (2)
- Artificial neural networks (2)
- Computer Vision (2)
- Convolutional neural networks (2)
- DDS (2)
- DNA-binding proteins prediction (2)
- Evolutionary biology (2)
- Evolutionary genetics (2)
- Fuzzy kernel ridge regression (2)
- GNSS (2)
- Image classification (2)
- JDMS (2)
- Kerberos (2)
Articles 91 - 111 of 111
Full-Text Articles in Engineering
Getting It Right The First Time: Robot Mission Guarantees In The Presence Of Uncertainty, Damian Lyons, Ron Arkin, Paramesh Nirmal, Shu Jiang, Tsung-Ming Liu, Julia Deeb
Getting It Right The First Time: Robot Mission Guarantees In The Presence Of Uncertainty, Damian Lyons, Ron Arkin, Paramesh Nirmal, Shu Jiang, Tsung-Ming Liu, Julia Deeb
Faculty Publications
Abstract—Certain robot missions need to perform predictably in a physical environment that may only be poorly characterized in advance. We have previously developed an approach to establishing performance guarantees for behavior-based controllers in a process-algebra framework. We extend that work here to include random variables, and we show how our prior results can be used to generate a Dynamic Bayesian Network for the coupled system of program and environment model. Verification is reduced to a filtering problem for this network. Finally, we present validation results that demonstrate the effectiveness of the verification of a multiple waypoint robot mission using this …
A Forward-Secure Certificate-Based Signature Scheme, Jiguo Li, Huiyun Teng, Xinyu Huang, Yichen Zhang, Jianying Zhou
A Forward-Secure Certificate-Based Signature Scheme, Jiguo Li, Huiyun Teng, Xinyu Huang, Yichen Zhang, Jianying Zhou
Faculty Publications
Cryptographic computations are often carried out on insecure devices for which the threat of key exposure raises a serious concern. In an effort to address the key exposure problem, the notion of forward security was first presented by Günther in 1990. In a forward-secure scheme, secret keys are updated at regular periods of time; exposure of the secret key corresponding to a given time period does not enable an adversary to ‘break’ the scheme for any prior time period. In this paper, we first introduce forward security into certificate-based cryptography and define the security model of forward-secure certificate-based signatures (CBSs). …
Using Modeling And Simulation To Examine The Benefits Of A Network Tasking Order, Matthew D. Compton, Kenneth M. Hopkinson, Gilbert L. Peterson, James T. Moore
Using Modeling And Simulation To Examine The Benefits Of A Network Tasking Order, Matthew D. Compton, Kenneth M. Hopkinson, Gilbert L. Peterson, James T. Moore
Faculty Publications
The Global Information Grid (GIG) is the military’s computer and communications network which supports the myriad of military missions. Military missions are highly planned, passing through many hands in the strategy-to-task methodology to ensure completeness, accuracy, coordination, cohesion, and appropriateness. A benefit of this planning is the possibility to collect knowledge of future conditions that could be of use to network designers whose goals include optimizing and protecting the GIG. This advanced knowledge includes which networked military equipment will be involved, what their capabilities are, where they will be, when they will be there, and particulars on the required data …
Design And Analysis Of A Dynamically Configured Log-Based Distributed Security Event Detection Methodology, Michael R. Grimaila, Justin Myers, Robert F. Mills, Gilbert L. Peterson
Design And Analysis Of A Dynamically Configured Log-Based Distributed Security Event Detection Methodology, Michael R. Grimaila, Justin Myers, Robert F. Mills, Gilbert L. Peterson
Faculty Publications
Military and defense organizations rely upon the security of data stored in, and communicated through, their cyber infrastructure to fulfill their mission objectives. It is essential to identify threats to the cyber infrastructure in a timely manner, so that mission risks can be recognized and mitigated. Centralized event logging and correlation is a proven method for identifying threats to cyber resources. However, centralized event logging is inflexible and does not scale well, because it consumes excessive network bandwidth and imposes significant storage and processing requirements on the central event log server. In this paper, we present a flexible, distributed event …
Wolf Ant, Gilbert L. Peterson, Christopher M. Mayer, Kevin Cousin
Wolf Ant, Gilbert L. Peterson, Christopher M. Mayer, Kevin Cousin
Faculty Publications
Ant colony optimization (ACO) algorithms can generate quality solutions to combinatorial optimization problems. However, like many stochastic algorithms, the quality of solutions worsen as problem sizes grow. In an effort to increase performance, we added the variable step size off-policy hill-climbing algorithm called PDWoLF (Policy Dynamics Win or Learn Fast) to several ant colony algorithms: Ant System, Ant Colony System, Elitist-Ant System, Rank-based Ant System, and Max-Min Ant System. Easily integrated into each ACO algorithm, the PDWoLF component maintains a set of policies separate from the ant colony's pheromone. Similar to pheromone but with different update rules, the PDWoLF policies …
Sql Querie Recommendations: A Query Fragment-Based Approach, Jayad Akbarnejad, Magdalini Eirinaki, Suju Koshy, Duc On, Neoklis Polyzotis
Sql Querie Recommendations: A Query Fragment-Based Approach, Jayad Akbarnejad, Magdalini Eirinaki, Suju Koshy, Duc On, Neoklis Polyzotis
Faculty Publications
Relational database systems are becoming increasingly popular in the scientific community to support the interactive exploration of large volumes of data. In this scenario, users employ a query interface (typically, a web-based client) to issue a series of SQL queries that aim to analyze the data and mine it for interesting information. First-time users, however, may not have the necessary knowledge to know where to start their exploration. Other times, users may simply overlook queries that retrieve important information. In this work we describe a framework to assist non-expert users by providing personalized query recommendations. The querying behavior of the …
Personal Vs. Social, Magdalini Eirinaki
Personal Vs. Social, Magdalini Eirinaki
Faculty Publications
The last few years we witnessed an impressive growth in social networks and in applications that add value to their amassed information. At the same time, the continuing expansion of mobile platforms and applications (e.g. iPhone), combined with the overwhelming supply of information and services, makes effective personalization and context-awareness much required features. One may consider "personal" and "social" data management as comprising two distinct directions with conflicting characteristics. However, it can be argued that they complement each other and that in future applications they will ultimately converge. This "personal vs. social" predicament presents a number of interesting topics that …
An Fpga-Based System For Tracking Digital Information Transmitted Via Peer-To-Peer Protocols, Karl R. Schrader, Barry E. Mullins, Gilbert L. Peterson, Robert F. Mills
An Fpga-Based System For Tracking Digital Information Transmitted Via Peer-To-Peer Protocols, Karl R. Schrader, Barry E. Mullins, Gilbert L. Peterson, Robert F. Mills
Faculty Publications
This paper presents a Field Programmable Gate Array (FPGA)-based tool designed to process file transfers using the BitTorrent Peer-to-Peer (P2P) protocol and VoIP phone calls made using the Session Initiation Protocol (SIP). The tool searches selected control messages in real time and compares the unique identifier of the shared file or phone number against a list of known contraband files or phone numbers. Results show the FPGA tool processes P2P packets of interest 92% faster than a software-only configuration and is 97.6% accurate at capturing and processing messages at a traffic load of 89.6 Mbps.
Structured P2p Technologies For Distributed Command And Control, Daniel R. Karrels, Gilbert L. Peterson, Barry E. Mullins
Structured P2p Technologies For Distributed Command And Control, Daniel R. Karrels, Gilbert L. Peterson, Barry E. Mullins
Faculty Publications
The utility of Peer-to-Peer (P2P) systems extends far beyond traditional file sharing. This paper provides an overview of how P2P systems are capable of providing robust command and control for Distributed Multi-Agent Systems (DMASs). Specifically, this article presents the evolution of P2P architectures to date by discussing supporting technologies and applicability of each generation of P2P systems. It provides a detailed survey of fundamental design approaches found in modern large-scale P2P systems highlighting design considerations for building and deploying scalable P2P applications. The survey includes unstructured P2P systems, content retrieval systems, communications structured P2P systems, flat structured P2P systems and …
Multi-Class Classification Fusion Using Boosting For Identifying Steganography Methods, Benjamin M. Rodriguez, Gilbert L. Peterson
Multi-Class Classification Fusion Using Boosting For Identifying Steganography Methods, Benjamin M. Rodriguez, Gilbert L. Peterson
Faculty Publications
No abstract provided.
Network Formation Using Ant Colony Optimization -- A Systematic Review, Steven C. Oimoen, Gilbert L. Peterson, Kenneth M. Hopkinson
Network Formation Using Ant Colony Optimization -- A Systematic Review, Steven C. Oimoen, Gilbert L. Peterson, Kenneth M. Hopkinson
Faculty Publications
A significant area of research in the field of hybrid communications is the Network Design Problem (NDP) [1]. The NDP is an NP complete problem [1] that focuses on identifying the optimal network topology for transmitting commodities between nodes, under constraints such as bandwidth, limited compatible directed channels, and link and commodity costs. The NDP focuses on designing a flexible network while trying to achieve optimal flow or routing. If a link (or arc) is used, then an associated fixed cost of the edge is incurred. In addition, there is a cost for using the arc depending on the flow. …
Probabilistic Searching Using A Small Unmanned Aerial Vehicle, Steven R. Hansen, Timothy W. Mclain, Michael A. Goodrich
Probabilistic Searching Using A Small Unmanned Aerial Vehicle, Steven R. Hansen, Timothy W. Mclain, Michael A. Goodrich
Faculty Publications
Ground breaking concepts in optimal search theory were developed during World War II by the U.S. Navy. These concepts use an assumed detection model to calculate a detection probability rate and an optimal search allocation. Although this theory is useful in determining when and where search effort should be applied, it offers little guidance for the planning of search paths. This paper explains how search theory can be applied to path planning for an SUAV with a fixed CCD camera. Three search strategies are developed: greedy search, contour search, and composite search. In addition, the concepts of search efficiency and …
Steganalysis Feature Improvement Using Expectation Maximization, Benjamin M. Rodriguez, Gilbert L. Peterson, Sos S. Agaian
Steganalysis Feature Improvement Using Expectation Maximization, Benjamin M. Rodriguez, Gilbert L. Peterson, Sos S. Agaian
Faculty Publications
No abstract provided.
A Cognitive Robotics Approach To Comprehending Human Language And Behaviors, Deryle W. Lonsdale, D. Paul Benjamin, Damian Lyons
A Cognitive Robotics Approach To Comprehending Human Language And Behaviors, Deryle W. Lonsdale, D. Paul Benjamin, Damian Lyons
Faculty Publications
The ADAPT project is a collaboration of researchers in linguistics, robotics and artificial intelligence at three universities. We are building a complete robotic cognitive architecture for a mobile robot designed to interact with humans in a range of environments, and which uses natural language and models human behavior. This paper concentrates on the HRI aspects of ADAPT, and especially on how ADAPT models and interacts with humans.
Multiple Masks-Based Pixel Comparison Steganalysis Method For Mobile Imaging, Sos S. Agaian, Gilbert L. Peterson, Benjamin M. Rodriguez
Multiple Masks-Based Pixel Comparison Steganalysis Method For Mobile Imaging, Sos S. Agaian, Gilbert L. Peterson, Benjamin M. Rodriguez
Faculty Publications
No abstract provided.
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 …
Loss Aware Rate Allocations In H.263 Coded Video Transmissions, Xiao Su, Benjamin Wah
Loss Aware Rate Allocations In H.263 Coded Video Transmissions, Xiao Su, Benjamin Wah
Faculty Publications
For packet video, information loss and bandwidth limitation are two factors that affect video playback quality. Traditional rate allocation approaches have focused on optimizing video quality under bandwidth constraint alone. However, in the best-effort Internet, packets carrying video data are susceptible to losses, which need to be reconstructed at the receiver side. In this paper, we propose loss aware rate allocations in both group-of-block (GOB) level and macroblock level, given that certain packets are lost during transmissions and reconstructed using simple interpolation methods at the receiver side. Experimental results show that our proposed algorithms can produce videos of higher quality …
Ontologies In Web Personalization, Magdalini Eirinaki, Michalis Vazirgiannis
Ontologies In Web Personalization, Magdalini Eirinaki, Michalis Vazirgiannis
Faculty Publications
No abstract provided.
Autonomous Vehicle Technologies For Small Fixed-Wing Uavs, Randal Beard, Derek Kingston, Morgan Quigley, Deryl Snyder, Reed Christiansen, Walt Johnson, Timothy Mclain, Michael A. Goodrich
Autonomous Vehicle Technologies For Small Fixed-Wing Uavs, Randal Beard, Derek Kingston, Morgan Quigley, Deryl Snyder, Reed Christiansen, Walt Johnson, Timothy Mclain, Michael A. Goodrich
Faculty Publications
The objective of this paper is to describe the design and implementation of a small semi-autonomous fixed-wing unmanned air vehicle. In particular we describe the hardware and software architectures used in the design. We also describe a low weight, low cost autopilot developed at Brigham Young University and the algorithms associated with the autopilot. Novel PDA and voice interfaces to the UAV are described. In addition, we overview our approach to real-time path planning, trajectory generation, and trajectory tracking. The paper is augmented with movie files that demonstrate the functionality of the UAV and its control software.
Learning Real-Time A* Path Planner For Sensing Closely-Spaced Targets From An Aircraft, Jason K. Howlett, Michael A. Goodrich, Timothy W. Mclain
Learning Real-Time A* Path Planner For Sensing Closely-Spaced Targets From An Aircraft, Jason K. Howlett, Michael A. Goodrich, Timothy W. Mclain
Faculty Publications
This work develops an any-time path planner, based on the learning real-time A* (LRTA*) search, for generating flyable paths that allow an aircraft with a specified sensor footprint to sense a group of closely-spaced targets. The LRTA* algorithm searches a tree of flyable paths for the branch that accomplishes the desired objectives in the shortest distance. The tree of paths is created by assembling primitive turn and straight sections of a specified step size. The operating parameters for the LRTA* search directly influence the running time and path-length performance of the search. A modified LRTA* search is presented that terminates …
3d Outside Cell Interference Factor For An Air-Ground Cdma ‘Cellular’ System, David W. Matolak
3d Outside Cell Interference Factor For An Air-Ground Cdma ‘Cellular’ System, David W. Matolak
Faculty Publications
We compute the outside-cell interference factor of a code-division multiple-access (CDMA) system for a three-dimensional (3-D) air-to-ground (AG) "cellular-like" network consisting of a set of uniformly distributed ground base stations and airborne mobile users. The CDMA capacity is roughly inversely proportional to the outside-cell interference factor. It is shown that for the nearly free-space propagation environment of these systems, the outside-cell interference factor can be larger than that for terrestrial propagation models (as expected) and depends approximately logarithmically upon both the cell height and cell radius.