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

John Hartman

dblp:43/702 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
1since 2021 · last 2023
0000-0002-8667-107XORCID · reported

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

Software engineering, systems software and programming languages · 2 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 2 · 1 since 2021Computer networks · 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.

Software engineering, system software, and programming languages
2 papers
Operating systems · 67% Software maintenance and evolution · 17% Requirements engineering and software design · 17%
Computer networks
1 paper
Internet architecture and protocols · 100%

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

TopicWeightPapersLastEvidence papers
Internet architecture and protocols › future internet architecture
active networks
0.012001
An OS interface for active routers · IEEE J. Sel. Areas Commun. 2001
Software maintenance and evolution
program comprehension
0.011991
Understanding Natural Programs Using Proper Decomposition · ICSE 1991
Requirements engineering and software design › modularity
program decomposition
0.011991
Understanding Natural Programs Using Proper Decomposition · ICSE 1991
YearPublicationVenuePosition
2023 Automated Spot Counting in Microbiology
abstract
Biological samples are routinely analyzed for microbe concentration. The samples are diluted, loaded onto established host cell cultures, and incubated. If infectious agents are present in the samples, they form circular spots that do not contain the host cells. Each spot is assumed to be originated from a single microbial unit such as a bacterial colony forming unit or viral plaque forming unit. The undiluted sample concentration is estimated by counting the spots and back-calculating. Counting the number of spots by trained technicians is currently the gold standard but it is laborious, subjective, and hard to scale. This paper presents a new automated algorithm for spot counting, Localized and Sequential Thresholding (LoST). Validation studies showed that LoST performance was comparable with manual counting and outperformed several existing tools on images with overlapping spots. The LoST algorithm employs sequential thresholding through a two-stage segmentation and borrows information across all images from the same dilution series to fine-tune the count and identify right censoring. The algorithm increases the efficiency of the spot counting and the quality of the downstream analysis, especially when coupled with an appropriate statistical serial dilution model to enhance the undiluted sample concentration estimation procedure.
Chun Pang Lin, Yajie Duan, Davit Sargsyan, Javier Cabrera, Christine M. Livingston, Robert Vogel, John Hartman, Mayukh Das, Willem Talloen, Helena Geys, Evangelos D. Kanoulas, Surya Mohanty
IEEE ACM Trans. Comput. Biol. Bioinform.7
2001 An OS interface for active routers
abstract
This paper describes an operating system (OS) interface for active routers. This interface allows code loaded into active routers to access the router's memory, communication, and computational resources on behalf of different packet flows. In addition to motivating and describing the interface, the paper also reports our experiences implementing the interface in three different OS environments: Scout, the OSKit, and the esokernel.
Larry Peterson, Yitzchak Gottlieb, Mike Hibler, Patrick Tullmann, Jay Lepreau, Stephen Schwab, Hrishikesh Dandekar, Andrew Purtell, John Hartman
IEEE J. Sel. Areas Commun.9
1991 Understanding Natural Programs Using Proper Decomposition
John Hartman
ICSE1
1990 Industrial experience in automating software re-engineering
abstract
The special problems of software re-engineering and technologies and approaches that specifically address these re-engineering problems are considered. Particular attention is given to approaches for analyzing and abstracting the functionality of old code, converting software to work with new languages or dialects, translating large systems, defining appropriate roles for the user of highly automated tools, and identifying the automatable steps in a large-scale project to re-engineer assembly language code. An attempt is made to indicate on the basis of actual experience what aspects of the re-engineering process seem to be most amenable to automation and what productivity gains can be expected.>
Lawrence Markosian, Thomas Driscoll, Ron Hunter-Duvar, John Hartman, Wojtek Kozaczynski, Jim Q. Ning, Mark Seipler
COMPSAC4