Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Steven A. Harp

dblp:72/2852 · DBLP profile ↗
← Back
8ranked-venue papers
2as first author
0since 2021 · last 2016
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 4 · 1 first-authorDatabases, data management, data science and information retrieval · 2Computer networks · 1Security and privacy · 1Software engineering, systems software and programming languages · 1Human-computer interaction and ubiquitous computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
2 papers
Data mining · 70% Data integration and cleaning · 30%
Artificial intelligence
1 paper
Optimization for machine learning · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Data mining › dimensionality reduction
feature extraction
0.012000
Textual data mining of service center call records · KDD 2000
Data mining
text mining
0.012000
Textual data mining of service center call records · KDD 2000
Data integration and cleaning › missing data
missing value imputation
0.011996
Imputation of Missing Data Using Machine Learning Techniques · KDD 1996
Data integration and cleaning
heterogeneous data
0.012000
Textual data mining of service center call records · KDD 2000
Machine learning › Optimization for machine learning › evolutionary computation
genetic algorithms
0.011989
Designing Application-Specific Neural Networks Using the Genetic Algorithm · NIPS 1989

Methods — techniques the papers use, named apart from their topics

clustering · 0.0classification · 0.0machine learning · 0.0genetic algorithm · 0.0
YearPublicationVenuePosition
2016 Frankencode: Creating Diverse Programs Using Code Clones
abstract
In this paper, we present an approach to detecting novel cyber attacks though a form of program diversification, similar to the use of n-version programming for fault tolerant systems. Building on extensive previous and ongoing work by others on the use of code clones in a wide variety of areas, our Functionally Equivalent Variants using Information Synchronization (FEVIS) system automatically generates program variants to berun in parallel, seeking to detect attacks through divergence in behavior. Unlike approaches to diversification that only change program memory layout and behavior, FEVIS can detect attacks exploiting vulnerabilities in execution timing, string processing, and other logic errors. We are in the early stages of research and development for this approach, but have made sufficient progress to provide a proof of concept and some lessons learned. In this paper we describe FEVIS and its application to diversifying an open-source webserver, with results on several different example classes of attack which FEVIS will detect.
Hayley Borck, Mark S. Boddy, Ian J. De Silva, Steven A. Harp, Ken Hoyme, Steven Johnston, August Schwerdfeger, Mary Southern
SANER4
2009 An architecture for scalable network defense
abstract
We describe a novel architecture for network defense designed for scaling to very high data rates (100 Gb/s) and very large user populations. Scaling requires both efficient attack detection algorithms as well as appropriate an execution environment. Our architecture considers the time budget of traffic data extraction and algorithmic processing, provides a suite of detection algorithms - each designed to present different and complementary views of the data-that generate many ¿traffic events,¿ and reduces false positives by correlating these traffic events into benign or malicious hypotheses.
W. Timothy Strayer, Walter C. Milliken, Ronald J. Watro, Walt Heimerdinger, Steven A. Harp, Robert P. Goldman, Dustin Spicuzza, Beverly Schwartz, David Mankins, Derrick Kong, Pieter Mudge Zatko
LCN5
2005 Generating Policies for Defense in Depth
abstract
Coordinating multiple overlapping defense mechanisms, at differing levels of abstraction, is fraught with the potential for misconfiguration, so there is strong motivation to generate policies for those mechanisms from a single specification in order to avoid that risk. This paper presents our experience and the lessons learned as we developed, validated and coordinated network communication security policies for a defense-in-depth enabled system that withstood sustained red team attack. Network communication was mediated by host-based firewalls, process domain mechanisms and application-level security policies enforced by the Java virtual machine. We coordinated the policies across the layers using a variety of tools, but we discovered that, at least for defense-in-depth enabled systems, constructing a single specification from which to derive all policies is probably neither practical nor even desirable
Paul Rubel, Michael Ihde, Steven A. Harp, Charles N. Payne
ACSAC3
2000 Textual data mining of service center call records
abstract
In this project, w e dev eloped a technique for extracting useful information from databases that contain both xedformat and free-text elds.The present state of the art in data mining is a schism betw een tec hniques that handle only xed-format data (pattern recognition, classi cation algorithms from machine learning), and techniques designed for free-form text (information retrieval).Advanced knowledge disco very tec hnologies ha ve been developed in both research areas, but systems that can categorize or cluster records containing both kinds of data are still lacking.Speci cally, w e examined database records from a Honeywell service cen ter to extract information about the expected cost of dierent kinds of service requests.Our goal was to test the h ypothesis that incorporating information from free-text elds would provide a better categorization of these records; in this case, better predictions of the cost of the service call.In our w ork, we h a ve i n tegrated feature extraction and clustering techniques from information retrieval with classi cation algorithms from machine learning in order to categorize the hybrid elds.Our preliminary results suggested that incorporating free-form text could potentially induce better classi cation models.
Pang-Ning Tan, Hannah Blau, Steven A. Harp, Robert P. Goldman
KDD3
1999 Imputation of Missing Data in Industrial Databases
Kamakshi Lakshminarayan, Steven A. Harp, Tariq Samad
Appl. Intell.2
1996 Imputation of Missing Data Using Machine Learning Techniques
Kamakshi Lakshminarayan, Steven A. Harp, Robert P. Goldman, Tariq Samad
KDD2
1995 Modeling student knowledge with self-organizing feature maps
abstract
The paper describes a novel application of neural networks to model the behavior of students in the context of an intelligent tutoring system. Self-organizing feature maps are used to capture the possible states of student knowledge from an existing test database. The trained network implements a universal student knowledge model that is compatible with knowledge space theory approaches to student assessment and computer aided instruction. The student model can be applied to rapidly assess the knowledge of any given student, and chart a path from lower to higher states of expertise. The authors illustrate the concept on an aircraft fuel management domain, demonstrating its noise-tolerance and insensitivity to feature map parameter values. An approach to determining the correct feature map size is also described.>
Steven A. Harp, Tariq Samad, Michael Villano
IEEE Trans. Syst. Man Cybern.1
1989 Designing Application-Specific Neural Networks Using the Genetic Algorithm
Steven A. Harp, Tariq Samad, Aloke Guha
NIPS1