Search NASA⌕ Search

Engineering topics

Manic, Milos

Publications and source records attributed to Manic, Milos.

44 records · Page 3

Evolutionary Adaptive Discovery of Phased Array Sensor Signal Identification

Tomography, used to create images of the internal properties and features of an object, from phased array ultasonics is improved through many sophisiticated methonds of post processing of data. One approach used to improve tomographic results is to prescribe the collection of more data, from different points of few so that data fusion might have a richer data set to work from. This approach can lead to rapid increase in the data needed to be stored and processed. It also does not necessarily lead to have the needed data. This article describes a novel approach to utilizing the data aquired as a basis for adapting the sensors focusing parameters to locate more precisely the features in the material: specifically, two evolutionary methods of autofocusing on a returned signal are coupled with the derivations of the forumulas for spatially locating the feature are given. Test results of the two novel methods of evolutionary based focusing (EBF) illustrate the improved signal strength and correction of the position of feature using the optimized focal timing parameters, called Focused Delay Identification (FoDI).

97 MATHEMATICS AND COMPUTING↗

Autonomous Rule Creation for Intrusion Detection

Many computational intelligence techniques for anomaly based network intrusion detection can be found in literature. Translating a newly discovered intrusion recognition criteria into a distributable rule can be a human intensive effort. This paper explores a multi-modal genetic algorithm solution for autonomous rule creation. This algorithm focuses on the process of creating rules once an intrusion has been identified, rather than the evolution of rules to provide a solution for intrusion detection. The algorithm was demonstrated on anomalous ICMP network packets (input) and Snort rules (output of the algorithm). Output rules were sorted according to a fitness value and any duplicates were removed. The experimental results on ten test cases demonstrated a 100 percent rule alert rate. Out of 33,804 test packets 3 produced false positives. Each test case produced a minimum of three rule variations that could be used as candidates for a production system.

97 MATHEMATICS AND COMPUTING↗

Fuzzy Logic Based Anomaly Detection for Embedded Network Security Cyber Sensor

Resiliency and security in critical infrastructure control systems in the modern world of cyber terrorism constitute a relevant concern. Developing a network security system specifically tailored to the requirements of such critical assets is of a primary importance. This paper proposes a novel learning algorithm for anomaly based network security cyber sensor together with its hardware implementation. The presented learning algorithm constructs a fuzzy logic rule based model of normal network behavior. Individual fuzzy rules are extracted directly from the stream of incoming packets using an online clustering algorithm. This learning algorithm was specifically developed to comply with the constrained computational requirements of low-cost embedded network security cyber sensors. The performance of the system was evaluated on a set of network data recorded from an experimental test-bed mimicking the environment of a critical infrastructure control system.

97 MATHEMATICS AND COMPUTING↗

A Distance Measure Comparison to Improve Crowding in Multi-Modal Problems.

Solving multi-modal optimization problems are of interest to researchers solving real world problems in areas such as control systems and power engineering tasks. Extensions of simple Genetic Algorithms, particularly types of crowding, have been developed to help solve these types of problems. This paper examines the performance of two distance measures, Mahalanobis and Euclidean, exercised in the processing of two different crowding type implementations against five minimization functions. Within the context of the experiments, empirical evidence shows that the statistical based Mahalanobis distance measure when used in Deterministic Crowding produces equivalent results to a Euclidean measure. In the case of Restricted Tournament selection, use of Mahalanobis found on average 40% more of the global optimum, maintained a 35% higher peak count and produced an average final best fitness value that is 3 times better.

97 MATHEMATICS AND COMPUTING↗

The Analysis of Dimensionality Reduction Techniques in Cryptographic Object Code Classification

This paper compares the application of three different dimension reduction techniques to the problem of locating cryptography in compiled object code. A simple classi?er is used to compare dimension reduction via sorted covariance, principal component analysis, and correlation-based feature subset selection. The analysis concentrates on the classi?cation accuracy as the number of dimensions is increased.

97 MATHEMATICS AND COMPUTING↗

Neural Network Approach to Locating Cryptography in Object Code

Finding and identifying cryptography is a growing concern in the malware analysis community. In this paper, artificial neural networks are used to classify functional blocks from a disassembled program as being either cryptography related or not. The resulting system, referred to as NNLC (Neural Net for Locating Cryptography) is presented and results of applying this system to various libraries are described.

97 MATHEMATICS AND COMPUTING↗

Computationally Efficient Neural Network Intrusion Security Awareness

An enhanced version of an algorithm to provide anomaly based intrusion detection alerts for cyber security state awareness is detailed. A unique aspect is the training of an error back-propagation neural network with intrusion detection rule features to provide a recognition basis. Network packet details are subsequently provided to the trained network to produce a classification. This leverages rule knowledge sets to produce classifications for anomaly based systems. Several test cases executed on ICMP protocol revealed a 60% identification rate of true positives. This rate matched the previous work, but 70% less memory was used and the run time was reduced to less than 1 second from 37 seconds.

97 MATHEMATICS AND COMPUTING↗

Time Synchronization in Hierarchical TESLA Wireless Sensor Networks

Time synchronization and event time correlation are important in wireless sensor networks. In particular, time is used to create a sequence events or time line to answer questions of cause and effect. Time is also used as a basis for determining the freshness of received packets and the validity of cryptographic certificates. This paper presents secure method of time synchronization and event time correlation for TESLA-based hierarchical wireless sensor networks. The method demonstrates that events in a TESLA network can be accurately timestamped by adding only a few pieces of data to the existing protocol.

97 MATHEMATICS AND COMPUTING↗