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

Richard D. Olinger

dblp:34/2660 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2009
—ORCID · none

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

Artificial intelligence and machine learning · 2Systems, architecture and hardware · 1

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.

Computer graphics and multimedia
1 paper
Visualization and visual analytics · 100%
Computer networks
1 paper
Network measurement and analytics · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
High-performance computing · 100%

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

TopicWeightPapersLastEvidence papers
Visualization and visual analytics
high-dimensional data visualization
0.112005
Network Traffic Analysis With Query Driven Visualization SC 2005 HPC Analytics Results · SC 2005
Visualization and visual analytics › interactive data exploration › visual exploration
query-driven visualization
0.112005
Network Traffic Analysis With Query Driven Visualization SC 2005 HPC Analytics Results · SC 2005
Network measurement and analytics
anomaly detection
0.112005
Network Traffic Analysis With Query Driven Visualization SC 2005 HPC Analytics Results · SC 2005
Network measurement and analytics
traffic analysis
0.112005
Network Traffic Analysis With Query Driven Visualization SC 2005 HPC Analytics Results · SC 2005
High-performance computing › data-intensive computing
large-scale data analytics
0.012005
Network Traffic Analysis With Query Driven Visualization SC 2005 HPC Analytics Results · SC 2005
High-performance computing
scientific computing systems
0.012005
Network Traffic Analysis With Query Driven Visualization SC 2005 HPC Analytics Results · SC 2005

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

novelty detection · 0.2feature extraction · 0.2classification · 0.2
YearPublicationVenuePosition
2009 Applying category theory to improve the performance of a neural architecture
Michael J. Healy, Richard D. Olinger, Robert J. Young, Shawn E. Taylor, Thomas P. Caudell, Kurt W. Larson
Neurocomputing2
2005 Modification of the ART-1 architecture based on category theoretic design principles
abstract
Many studies have addressed the knowledge representation capability of neural networks. A recently-developed mathematical semantic theory explains the relationship between knowledge and its representation in connectionist systems. The theory yields design principles for neural networks whose behavioral repertoire expresses any desired capability that can be expressed logically. In this paper, we show how the design principle of limit formation can he applied to modify the ART-1 architecture, yielding a discrimination capability that goes beyond vigilance. Simulations of this new design illustrate the increased discrimination ability it provides for multi-spectral image analysis.
Michael J. Healy, Richard D. Olinger, Robert J. Young, Thomas P. Caudell, Kurt W. Larson
IJCNN2
2005 Network Traffic Analysis With Query Driven Visualization SC 2005 HPC Analytics Results
abstract
Our analytics task is to identify, characterize, and visualize anomalous subsets of as large of a collection of network connection data as possible. We use a combination of HPC resources, advanced algorithms, and visualization techniques. To effectively and efficiently identify the salient portions of the data, we rely on a multistage workflow that includes data acquisition, summarization (feature extraction), novelty detection, and classification. Once these subsets of interest have been identified and automatically characterized, we use a stateof- the-art high-dimensional query system to extract this data for interactive visualization. Our approach is equally useful for other large-data analysis problems where it is more practical to identify interesting subsets of the data for visualization than it is to render all data elements. By reducing the size of the rendering workload, we enable highly interactive and useful visualizations.
Kurt Stockinger, Kesheng Wu, Scott Campbell, Stephen Lau, Mike Fisk, Eugene M. Gavrilov, Alex Kent, Christopher E. Davis, Richard D. Olinger, Robert J. Young, Jim Prewett, Paul M. Weber, Thomas P. Caudell, E. Wes Bethel
SC9