Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 9 of 9
Full-Text Articles in Physical Sciences and Mathematics
Analysis Of Hostile Network Reconnaissance To Anticipate And Mitigate Network Attacks, Luis Angel Rivera
Analysis Of Hostile Network Reconnaissance To Anticipate And Mitigate Network Attacks, Luis Angel Rivera
Theses and Dissertations
Network security systems today such as current intrusion detection systems, intrusion prevention systems and firewalls are good at reacting to attacks as they occur or shortly after they occur. Current security systems lack the ability to identify and detect the activity that usually precedes an attack. This activity is known as network reconnaissance. In this thesis we have developed a technique that can assist current security systems to detect hostile network reconnaissance to anticipate and mitigate network attacks.
Modeling The Spread And Prevention Of Malicious Mobile Code Via Simulation Cs-2004-15, Christopher Brian Shirey
Modeling The Spread And Prevention Of Malicious Mobile Code Via Simulation Cs-2004-15, Christopher Brian Shirey
Theses and Dissertations
Malicious mobile code causes billions of dollars every year in damages, and that cost keeps increasing. Traditional signature-based anti-virus software is a reactive solution that can not detect fast spreading malicious code quickly enough to prevent widespread infection. If we hope to prevent widespread infection of future malicious mobile code, new prevention techniques must be developed that either stop a new infection completely, or at least limit the spread until signature-based anti-virus software can be updated. Simulators exist that model the spread of malicious mobile code, but none currently exists that can efficiently model host-based and network-based spread prevention techniques …
On The Use Of Randomness In Computing To Perform Intelligent Tasks, Ryan Scott Regensburger
On The Use Of Randomness In Computing To Perform Intelligent Tasks, Ryan Scott Regensburger
Theses and Dissertations
The study of Artificial Intelligence attempts to simulate the processes of human intelligence in a set of computable algorithms. The purpose of Random Algorithms in this field is to provide a best-guess approach at identifying the unknown. In this thesis, research shows that random algorithms are able to break down many intelligent processes into a set of solvable problems. For example, solving puzzles and playing games involve the same estimating ability shown in standard problems such as the Coupon Collector problem or the Monty Hall problem. This thesis shows Random Algorithmic applications in two overlapping categories of intelligent behavior: Pattern …
Reduced Index Sparse Representation In A Parallel Environment, Pedro Alfonso Escallon
Reduced Index Sparse Representation In A Parallel Environment, Pedro Alfonso Escallon
Theses and Dissertations
Sparse-matrix/dense-vector multiplication algorithms are not as highly developed as algorithms for dense matrices. Dense matrix multiplication algorithms have been made efficient by exploiting data locality, parallelism, pipelining, and other types of optimization. Sparse matrix algorithms, on the other hand, encounter low or no data locality, indirect addressing, and no easy way to exploit parallelism. In an effort to achieve savings in storage and computational time, the topic of sparse matrix representation is often revisited. The first contribution of this thesis is the introduction of a new representation for sparse matrices. This representation is called here the Reduced Index Sparse (RIS) …
Quantifying Software Maintainability On Re-Engineered Translation Of Fortran To C++ Code, Zane Grey Tomlinson Jr.
Quantifying Software Maintainability On Re-Engineered Translation Of Fortran To C++ Code, Zane Grey Tomlinson Jr.
Theses and Dissertations
Due to the expanding existence of old software, legacy systems, and obsolete platforms with many industries, software re-engineering has become a widespread methodology that assists engineers and software practitioners with translating inflexible, unsupportable legacy software into maintainable software. Many companies today are investing in a variety of re-engineering techniques such as translation of source code to new code structures and target platforms to ensure future software maintenance can be performed in an efficient and effective manner. With sound re-engineering principles, the application of these techniques leverage the knowledge and previous engineering endeavors to mitigate risks and provide adequate performance to …
Mool: An Object-Oriented Programming Language With Generics And Modules., María Lucía Barrón Estrada
Mool: An Object-Oriented Programming Language With Generics And Modules., María Lucía Barrón Estrada
Theses and Dissertations
Modern object-oriented languages like Java and C# do not support parametric polymorphism and do not have a traditional module system to allow the development of large systems. They overload the class mechanism with several tasks and they use packages and namespaces to organize clusters of classes providing weak control for accessing members. Other languages that support generic programming and objects do not have a simple object model to support object-oriented features. In this thesis the language MOOL is presented. MOOL is a class-based object-oriented language that supports modular programming and genericity. The main goal in the design of MOOL was …
Web-Based Trend Analysis Of Rocket Data Using Xml, Mark Randall Gibson
Web-Based Trend Analysis Of Rocket Data Using Xml, Mark Randall Gibson
Theses and Dissertations
This paper will discuss and prove the feasibility of using XML to transfer, compare, and view data created during automated testing of black boxes; stored both in simple text format and relational database format. This system arises from the need for the reliability department to review the test data from the flight hardware at all testing locations. For the purposes of this paper we will refer to this system as the "Test Data Retrieval System" (TDRS). This data review is being done to determine if there are any negative trends in the hardware that may be surfacing. This data resides …
Solving Combinatorial Optimization Problems Using A New Algorithm Based On Gravitational Attraction, Barry Lynn Webster
Solving Combinatorial Optimization Problems Using A New Algorithm Based On Gravitational Attraction, Barry Lynn Webster
Theses and Dissertations
This dissertation represents the culmination of research into the development of a new algorithm for locating optimal solutions to difficult problems. This new algorithm is founded upon one of the most basic concepts in nature - so basic that it is in fact one of the four primary forces in physics: gravity. It is called the Gravitational Emulation Local Search algorithm, or GELS. Four variants of the algorithm were developed, representing combinations of two basic methods of operation and two modes of search space exploration. Following development, a series of experiments were conducted to assess the capabilities of this new …
Learning States For Detecting Anomalies In Time Series, Stan Weidner Salvador
Learning States For Detecting Anomalies In Time Series, Stan Weidner Salvador
Theses and Dissertations
The normal operation of a device can be characterized in different operational states. To identify these states, we introduce a segmentation algorithm called Gecko that can determine a reasonable number of segments using our proposed L method. We then use the RIPPER classification algorithm to describe these states in logical rules. Finally, transitional logic between the states is added to create a finite state automation. Multiple time series data may be used for training, by merging several time series into a single representative time series using dynamic time warping. Our empirical results, on data obtained from the NASA shuttle program, …