Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Keyword
-
- Small Spacecraft (4)
- Adaptive algorithms (3)
- Artificial Intelligence & Robotic Control (3)
- Coverage control problems (3)
- CubeSat (3)
-
- Dynamic vehicle routing problems (3)
- Open Orbiter Project (3)
- Partitioning algorithms (3)
- Robotics (3)
- Stochastic gradient algorithms (3)
- Image Processing (2)
- Image processing (2)
- Mosaicking (2)
- AI Decision Making (1)
- Adaboost (1)
- Area-universal networks (1)
- Area-universality (1)
- Artificial Intelligence and Cognitive Theory (1)
- Butterfly fat-tree (1)
- Control of heterogeneous craft (1)
- Edge server (1)
- IWD (1)
- Integers (1)
- Intelligent water drop (1)
- Interconnection network (1)
- Internet of Things (1)
- Latency (1)
- Mars mission (1)
- Message routing algorithms (1)
- Mobile intelligent terminal (1)
Articles 1 - 13 of 13
Full-Text Articles in Computer Engineering
Adaboost‑Based Security Level Classifcation Of Mobile Intelligent Terminals, Feng Wang, Houbing Song, Dingde Jiang, Hong Wen
Adaboost‑Based Security Level Classifcation Of Mobile Intelligent Terminals, Feng Wang, Houbing Song, Dingde Jiang, Hong Wen
Houbing Song
With the rapid development of Internet of Things, massive mobile intelligent terminals are ready to access edge servers for real-time data calculation and interaction. However, the risk of private data leakage follows simultaneously. As the administrator of all intelligent terminals in a region, the edge server needs to clarify the ability of the managed intelligent terminals to defend against malicious attacks. Therefore, the security level classification for mobile intelligent terminals before accessing the network is indispensable. In this paper, we firstly propose a safety assessment method to detect the weakness of mobile intelligent terminals. Secondly, we match the evaluation results …
Randomized Routing On Fat-Trees, Ronald I. Greenberg
Randomized Routing On Fat-Trees, Ronald I. Greenberg
Ronald Greenberg
Fat-trees are a class of routing networks for hardware-efficient parallel computation. This paper presents a randomized algorithm for routing messages on a fat-tree. The quality of the algorithm is measured in terms of the load factor of a set of messages to be routed, which is a lower bound on the time required to deliver the messages. We show that if a set of messages has load factor lambda on a fat-tree with n processors, the number of delivery cycles (routing attempts) that the algorithm requires is O(lambda+lgnlglgn) with probability 1-O(1/ …
An Improved Analytical Model For Wormhole Routed Networks With Application To Butterfly Fat-Trees, Ronald I. Greenberg, Lee Guan
An Improved Analytical Model For Wormhole Routed Networks With Application To Butterfly Fat-Trees, Ronald I. Greenberg, Lee Guan
Ronald Greenberg
A performance model for wormhole routed interconnection networks is presented and applied to the butterfly fat-tree network. Experimental results agree very closely over a wide range of load rate. Novel aspects of the model, leading to accurate and simple performance predictions, include (1) use of multiple-server queues, and (2) a general method of correcting queuing results based on Poisson arrivals to apply to wormhole routing. These ideas can also be applied to other networks.
Nanosatellite Scheduling Using A Dictionary Module And A ‘Useful Trick’ With Coded Unsigned Integers, Monilito Castro, Jeremy Straub
Nanosatellite Scheduling Using A Dictionary Module And A ‘Useful Trick’ With Coded Unsigned Integers, Monilito Castro, Jeremy Straub
Jeremy Straub
Schedulers for small spacecraft must satisfy the dual requirement of generating very efficient schedules while concurrently minimizing the resources required to create the schedule. This paper proposes a technique for searching for tasks that can be utilized to fill particular schedule locations. This approach is based on a modular system for storing important variables. This modular system has three important variables: t0, x0 and y0. The variable y is latitude and x is longitude. Time variable t is an integer and each unit represents a time quantum. They are related to each other by three functions Ft, Fx, and Fy. …
Payload Software Design And Development For A Remote Sensing Small Spacecraft, Kyle Goehner, Christoffer Korvald, Jeremy Straub, Ronald Marsh
Payload Software Design And Development For A Remote Sensing Small Spacecraft, Kyle Goehner, Christoffer Korvald, Jeremy Straub, Ronald Marsh
Jeremy Straub
Scheduling for a Small Satellite for Remote Sensed Data Collection
Characterization Of Extended And Simplified Intelligent Water Drop (Siwd) Approaches And Their Comparison To The Intelligent Water Drop (Iwd) Approach, Jeremy Straub, Eunjin Kim
Characterization Of Extended And Simplified Intelligent Water Drop (Siwd) Approaches And Their Comparison To The Intelligent Water Drop (Iwd) Approach, Jeremy Straub, Eunjin Kim
Jeremy Straub
This paper presents a simplified approach to performing the Intelligent Water Drops (IWD) process. This approach is designed to be comparatively lightweight while approximating the results of the full IWD process. The Simplified Intelligent Water Drops (SIWD) approach is specifically designed for applications where IWD must be run in a computationally limited environment (such as on a robot, UAV or small spacecraft) or where performance speed must be maximized for time sensitive applications. The SWID approach is described and compared and contracted to the base IWD approach.
The Development Of Payload Software For A Small Spacecraft, Kyle Goehner, Christoffer Korvald, Jeremy Straub, Ronald Marsh
The Development Of Payload Software For A Small Spacecraft, Kyle Goehner, Christoffer Korvald, Jeremy Straub, Ronald Marsh
Jeremy Straub
The OpenOrbiter project is a multi-department effort to design and build a small spacecraft which will demonstrate the feasibility of the Open Prototype for Educational NanoSats (OPEN) framework. This framework will reduce cost of small spacecraft creation by providing design plans for free. The focus of the payload software group is to design and implement an onboard task processing and image processing service. Currently the project is in the development phase and most large design decisions have been made. This poster presents the major design decisions that have been made for the payload software and how they will affect the …
Model-Based Software Engineering For An Imaging Cubesat And Its Extrapolation To Other Missions, Atif Mohammad, Jeremy Straub, Christoffer Korvald, Emanuel Grant
Model-Based Software Engineering For An Imaging Cubesat And Its Extrapolation To Other Missions, Atif Mohammad, Jeremy Straub, Christoffer Korvald, Emanuel Grant
Jeremy Straub
Small satellites with their limited computational capabilities require that software engineering techniques promote efficient use of spacecraft resources. A model-driven approach to software engineering is an excellent solution to this resource maximization challenge as it facilitates visualization of the key solution processes and data elements.
The software engineering process utilized for the OpenOrbiter spacecraft, which is a remote sensing technology demonstrator, is presented. Key challenges presented by the Open Orbiter project included concurrent operation and tasking of five computer-on-module (COM) units and a flight computer and the associated data marshaling between local and general storage. The payload processing system (consisting …
Multi-Tier Exploration Concept Demonstration Mission, Jeremy Straub
Multi-Tier Exploration Concept Demonstration Mission, Jeremy Straub
Jeremy Straub
A multi-tier, multi-craft mission architecture has been proposed but, despite its apparent promise, limited use and testing of the architecture has been conducted. This paper proposes and details a mission concept and its implementation for testing this architecture in the terrestrial environment. It is expected that this testing will allow significant refinement of the proposed architecture as well as providing data on its suitability for use in both terrestrial and extra-terrestrial applications. Logistical and technical challenges with this testing are discussed.
Adaptive Algorithms For Coverage Control And Space Partitioning In Mobile Robotic Networks, Jerome Le Ny, George J. Pappas
Adaptive Algorithms For Coverage Control And Space Partitioning In Mobile Robotic Networks, Jerome Le Ny, George J. Pappas
George J. Pappas
We consider deployment problems where a mobile robotic network must optimize its configuration in a distributed way in order to minimize a steady-state cost function that depends on the spatial distribution of certain probabilistic events of interest. Three classes of problems are discussed in detail: coverage control problems, spatial partitioning problems, and dynamic vehicle routing problems. Moreover, we assume that the event distribution is a priori unknown, and can only be progressively inferred from the observation of the location of the actual event occurrences. For each problem we present distributed stochastic gradient algorithms that optimize the performance objective. The stochastic …
Adaptive Algorithms For Coverage Control And Space Partitioning In Mobile Robotic Networks, Jerome Le Ny, George J. Pappas
Adaptive Algorithms For Coverage Control And Space Partitioning In Mobile Robotic Networks, Jerome Le Ny, George J. Pappas
George J. Pappas
We consider deployment problems where a mobile robotic network must optimize its configuration in a distributed way in order to minimize a steady-state cost function that depends on the spatial distribution of certain probabilistic events of interest. Three classes of problems are discussed in detail: coverage control problems, spatial partitioning problems, and dynamic vehicle routing problems. Moreover, we assume that the event distribution is a priori unknown, and can only be progressively inferred from the observation of the location of the actual event occurrences. For each problem we present distributed stochastic gradient algorithms that optimize the performance objective. The stochastic …
Adaptive Algorithms For Coverage Control And Space Partitioning In Mobile Robotic Networks, Jerome Le Ny, George J. Pappas
Adaptive Algorithms For Coverage Control And Space Partitioning In Mobile Robotic Networks, Jerome Le Ny, George J. Pappas
George J. Pappas
We consider deployment problems where a mobile robotic network must optimize its configuration in a distributed way in order to minimize a steady-state cost function that depends on the spatial distribution of certain probabilistic events of interest. Three classes of problems are discussed in detail: coverage control problems, spatial partitioning problems, and dynamic vehicle routing problems. Moreover, we assume that the event distribution is a priori unknown, and can only be progressively inferred from the observation of the location of the actual event occurrences. For each problem we present distributed stochastic gradient algorithms that optimize the performance objective. The stochastic …
Book Review: Reasoning Agents In A Dynamic World: The Frame Problem. Kenneth M. Ford And Patrick J. Hayes, Eds.,, Jozsef A. Toth
Book Review: Reasoning Agents In A Dynamic World: The Frame Problem. Kenneth M. Ford And Patrick J. Hayes, Eds.,, Jozsef A. Toth
Jozsef A Toth Ph.D.
No abstract provided.