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

George S. Davidson

dblp:89/113 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
0since 2021 · last 2002
—ORCID · none

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

Databases, data management, data science and information retrieval · 2 · 1 first-authorSystems, architecture and hardware · 1Software engineering, systems software and programming languages · 1Human-computer interaction and ubiquitous computing · 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 architecture, parallel and distributed computing, and storage systems
1 paper
Processor architecture and microarchitecture · 56% Parallel and multicore computing · 44%

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

TopicWeightPapersLastEvidence papers
Processor architecture and microarchitecture
dataflow architecture
0.011989
The Epsilon Dataflow Processor · ISCA 1989
Parallel and multicore computing › multiprocessor system
dataflow multiprocessor
0.011989
The Epsilon Dataflow Processor · ISCA 1989
Processor architecture and microarchitecture
instruction-level parallelism
0.011989
The Epsilon Dataflow Processor · ISCA 1989

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

benchmark measurement · 0.0
YearPublicationVenuePosition
2002 Domain visualization using VxInsight® for science and technology management
abstract
Abstract We present the application of our knowledge visualization tool, VxInsight®, to enable domain analysis for science and technology management within the enterprise. Data mining from sources of bibliographic information is used to define subsets of information relevant to a technology domain. Relationships between the individual objects (e.g., articles) are identified using citations, descriptive terms, or textual similarities. Objects are then clustered using a force‐directed placement algorithm to produce a terrain view of the many thousands of objects. A variety of features that allow exploration and manipulation of the landscapes and that give detail on demand, enable quick and powerful analysis of the resulting landscapes. Examples of domain analyses used in S&T management at Sandia are given.
Kevin W. Boyack, Brian N. Wylie, George S. Davidson
J. Assoc. Inf. Sci. Technol.3
1998 Knowledge Mining With VxInsight: Discovery Through Interaction
George S. Davidson, Bruce Hendrickson, Charles E. Meyers, Brian N. Wylie
J. Intell. Inf. Syst.1
1996 Three Dimensional Visualization of Proteins in Cellular Interactions
abstract
In researching the communication mechanisms between cells of the immune system, visualization of proteins in three dimensions can be used to determine which proteins are capable of interacting with one another at a given time by showing their spatial colocality. Volume data sets are created using digital confocal immunofluorescence microscopy. A variety of visualization approaches are then used to examine the interactions. These include volume rendering, isosurface extraction, and virtual reality. Based on our experiences, we have concluded that no single one of these approaches provides a complete solution for visualizing biological data. However, in combination, their respective strengths complement one another to provide an understanding of the data.
Colin R. F. Monks, Patricia Crossno, George S. Davidson, Constantine J. Pavlakos, Abraham Kupfer, Cláudio T. Silva, Brian N. Wylie
IEEE Visualization3
1989 The Epsilon Dataflow Processor
abstract
The εpsilon dataflow architecture is designed for high speed uniprocessor execution as well as for parallel operation in a multiprocessor system. The εpsilon architecture directly matches ready operands, thus eliminating the need for associative matching stores. εpsilon also supports low cost data fan out and critical sections. A 10 MFLOPS CMOS/TTL processor prototype is running and its performance has been measured with several benchmarks. The prototype processor has demonstrated sustained performance exceeding that of comparable control flow processors running at higher clock rates (three times faster than a 20 Mhz transputer and 24 times faster than a Sun on a suite of arithmetic tests, for example).
V. Gerald Grafe, George S. Davidson, Jamie E. Hoch, V. P. Holmes
ISCA2