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

Jonathan Turner

dblp:78/2489 · DBLP profile ↗
← Back
7ranked-venue papers
1as first author
2since 2021 · last 2024
0000-0001-9991-3130ORCID · reported

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

Artificial intelligence and machine learning · 3Applied, interdisciplinary, general and emerging computing · 3 · 2 since 2021Systems, architecture and hardware · 1Computer networks · 1 · 1 first-authorSoftware engineering, systems software and programming languages · 1Graphics, computer vision, multimedia, augmented reality and games · 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 networks
1 paper
Routing and switching · 75% Internet architecture and protocols · 25%
Human-computer interaction and pervasive computing
1 paper
Human-robot interaction · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Performance modeling and evaluation · 100%

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

TopicWeightPapersLastEvidence papers
Routing and switching › switch architecture
crossbar switch
0.112006
Strong Performance Guarantees for Asynchronous Crossbar Schedulers · INFOCOM 2006
Routing and switching › switch scheduling
input-queued switch scheduling
0.112006
Strong Performance Guarantees for Asynchronous Crossbar Schedulers · INFOCOM 2006
Internet architecture and protocols › quality of service
performance guarantees
0.112006
Strong Performance Guarantees for Asynchronous Crossbar Schedulers · INFOCOM 2006
Routing and switching
switch scheduling
0.112006
Strong Performance Guarantees for Asynchronous Crossbar Schedulers · INFOCOM 2006
Human-robot interaction › multi-robot systems
multi-robot control
0.012004
Metrics for Human Driving of Multiple Robots · ICRA 2004
Performance modeling and evaluation
queueing analysis
0.012006
Strong Performance Guarantees for Asynchronous Crossbar Schedulers · INFOCOM 2006

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

segment-based switching · 0.1least occupied output first · 0.1GVOQ scheduler · 0.1user study · 0.0robot simulation · 0.0
YearPublicationVenuePosition
2024 Designing Self-management for and with Persons Living with Dementia
Dympna O'Sullivan, Damon Berry, Orla Moran, Siobhan O'Neill, Ciarán Nugent, Jonathan Turner, Julie Doyle
ICCHP (2)7
2022 The Smart Dementia Care Project
Dympna O'Sullivan, Jonathan Turner, Ciarán Nugent, Damon Berry, Julie Doyle
AMIA2
2015 Parameter Control in Search-Based Generation of Unit Test Suites
David Paterson, Jonathan Turner, Thomas D. White, Gordon Fraser 0001
SSBSE2
2006 Strong Performance Guarantees for Asynchronous Crossbar Schedulers
abstract
Abstract – Crossbar-based switches are commonly used to implement routers with throughputs up to about 1 Tb/s. The advent of crossbar scheduling algorithms that provide strong performance guarantees now makes it possible to engineer systems that perform well, even under extreme traffic conditions. Up to now, such performance guarantees have only been developed for crossbars that switch cells rather than variable length packets. Cell-based schedulers may fail to deliver the expected performance guarantees when used in routers that forward packets of variable length. We show how to obtain performance guarantees for asynchronous crossbars that are directly comparable to the performance guarantees previously available only for synchronous, cell-based crossbars. In particular we define derivatives of the Group by Virtual Output Queue (GVOQ) scheduler of Chuang et. al. and the Least Occupied Output First Scheduler of Krishna et. al. and show that both can provide strong performance guarantees in systems with speedups ≥2. We also introduce a new class of segment-based switches that can deliver strong performance guarantees with small buffer requirements and no bandwidth fragmentation. 1.
Jonathan Turner
INFOCOM1
2005 Fault Surface Detection in 3-D Seismic Data
abstract
A novel approach to the automatic extraction of geological faults from three-dimensional (3-D) seismic data is described, and qualitative and quantitative comparisons of manually and automatically picked fault geometries interpreted from both high and medium quality 3-D seismic datasets are presented. An algorithm has been developed that allows semiautomated identification, extraction, and modeling of fault surfaces imaged in 3-D seismic datasets. Based on a multistage approach, the algorithm operates initially at a small spatial scale, identifying local discontinuities in the seismic horizons, and then gradually considers larger and larger segments of fault surfaces until a set of complete fault surfaces are identified. A large portion of the work involves merging of segments of fault surfaces, performed using a highest confidence first (HCF) stratagem, taking into consideration the context of the resultant fault geometry. We show that results from the automated fault picker compare favorably with a manually labeled set of faults surfaces interpreted from a high-quality dataset. Last, we present an estimate of the savings in human operator time that can be made by using the automated approach, indicating savings of multiple person-days for the multigigabyte datasets that typify the petroleum industry.
David Gibson, Michael Spann, Jonathan Turner, Timothy Wright
IEEE Trans. Geosci. Remote. Sens.3
2004 Metrics for Human Driving of Multiple Robots
abstract
A goal of human-robot interaction is to expand the capability of human beings so that they can control multiple robots simultaneously. This provides leverage for human attention beyond single robot interaction. The number of such robots that can be operated is called the fan-out of a human-robot team. We define the concepts of neglect-tolerance as a measure of autonomy and interaction-effort as a measure of required human attention. A model for fan-out is presented that predicts a human's ability to control multiple robots. We validate this model using robot simulations and user studies. Using the validated model we demonstrate enhanced task performance on physical robots as predicted by the model.
Dan R. Olsen, Stephen Bart Wood, Jonathan Turner
ICRA3
1998 Using RBF Networks to Map GWT Ridge Images to Pose
Alexandra Psarrou, Jonathan Turner
ACCV (1)2