NDLTD Global ETD Search
  • Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • Tagged with
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.

Search results

Showing 1 to 2 of 2 (0.044 seconds)

Spelling suggestions: "subject:"bathing"" "subject:"loathing""

1

THE PROGRAM PATHING TRUST MODEL FOR CRITICAL SYSTEM PROCESS AUTHORIZATION

Dahlberg, Robert 27 April 2011 (has links)
Since computers are relied upon to run critical infrastructures – from nuclear power plants to electronic battlefield simulations – the concept of a “trusted” or tamperproof system has become even more important. Some applications have become so critical that it is imperative that they run as intended, without interference. The consequences of these systems not running as intended could be catastrophic. This research offers a solution for a key element for protecting these critical servers – validating process invocation sequences. The purpose of this research is to increase operating system security by detecting, validating, and enforcing process invocation sequences within a critical system. If the processes on a critical system are not those that are intended to run or support the critical system, or if a system is able to run processes in an unauthorized sequence, then the system is compromised and cannot be trusted. This research uses a computational theory approach to create a framework for a solution for the process invocation sequence problem. Using the Program Pathing Trust Model, a solution capable of identifying both valid and invalid process invocation sequences is developed.
Security
Authorization
Program Pathing
Process invocation
Invocation sequence
Engineering
2

Visualization of Ant Pheromone Based Path Following

Sutherland, Benjamin T. 2009 December 1900 (has links)
This thesis develops a simulation and visualization of a path finding algorithm based on ant pheromone paths created in 3D space. The simulation is useful as a demonstration of a heuristic approach to NP-complete problems and as an educational tool for demonstrating how ant colonies gather food. An interactive real time 3D visualization is built on top of the simulation. A graphical user interface layer allows user interaction with the simulation and visualization.
ants
ant pathing
pathing
visualization
AI
artificial intelligence
emergent behavior
stereoscopy
stereoscopic
Qt
interactive
NP-complete
simulation
education
path finding
real-time

Page generated in 0.047 seconds