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

Gordon Smith

dblp:11/6771 · DBLP profile ↗
← Back
10ranked-venue papers
1as first author
0since 2021 · last 2005
—ORCID · none

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

Artificial intelligence and machine learning · 6 · 1 first-authorSystems, architecture and hardware · 4 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 2Security and privacy · 1Databases, data management, data science and information retrieval · 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.

Artificial intelligence
2 papers
Robot manipulation · 91% Motion planning and robot control · 9%
Theoretical computer science
2 papers
Graph algorithms and graph theory · 54% Computational geometry · 46%
Databases, data mining, and information retrieval
1 paper
Distributed and cloud data management · 77% Database system architecture and tuning · 23%

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

TopicWeightPapersLastEvidence papers
Robotics › Robot manipulation › industrial manipulation
parts feeding
0.012000
The Toppling Graph: Designing Pin Sequences for Part Feeding · ICRA 2000
Graph algorithms and graph theory
graph algorithms
0.012000
The Toppling Graph: Designing Pin Sequences for Part Feeding · ICRA 2000
Robotics › Robot manipulation
grasping
0.011999
Computing Parallel-Jaw Grips · ICRA 1999
Robotics › Robot manipulation › grasping › gripper design
parallel-jaw gripper
0.011999
Computing Parallel-Jaw Grips · ICRA 1999
Computational geometry
polygon algorithms
0.011999
Computing Parallel-Jaw Grips · ICRA 1999
Distributed and cloud data management
data replication
0.011994
Oracle's Symmetric Replication Technology and Implications for Application Design · SIGMOD Conference 1994
Robotics › Motion planning and robot control › motion planning › manipulation planning
sensorless manipulation
0.012000
The Toppling Graph: Designing Pin Sequences for Part Feeding · ICRA 2000
Robotics › Robot manipulation › grasping
gripper design
0.011999
Computing Parallel-Jaw Grips · ICRA 1999

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

o(n^3n) algorithm · 0.1o(n^2) algorithm · 0.1geometric algorithms · 0.0geometric algorithm · 0.0
YearPublicationVenuePosition
2005 Benchmarking and implementation of probability-based simulations on programmable graphics cards
Stanimire Tomov, Michael D. McGuigan, Robert Bennett, Gordon Smith, John Spiletic
Comput. Graph.4
2004 Application of interactive parallel visualization for commodity-based clusters using visualization APIs
Stanimire Tomov, Robert Bennett, Michael D. McGuigan, Arnold M. Peskin, Gordon Smith, John Spiletic
Comput. Graph.5
2000 Collaborative Teleoperation via the Internet
abstract
We describe a system that allows a distributed group of users to simultaneously teleoperate an industrial robot arm via the Internet. A Java applet at each client streams mouse motion vectors from up to 3D users; a sewer aggregates these inputs to produce a single control stream for the robot. Users receive visual feedback from a digital camera mounted above the robot arm. To our knowledge, this is the first collaboratively controlled robot on the Internet.
Kenneth Y. Goldberg, Billy Chen, Rory Solomon, Steve Bui, Bobak Farzin, Jacob Heitler, Derek Poon, Gordon Smith
ICRA8
2000 The Toppling Graph: Designing Pin Sequences for Part Feeding
abstract
We consider a sensorless approach to feeding parts on a conveyor belt using pins (rigid barriers) to topple parts into desired orientations. Given the 2D projection of an n-sided convex polyhedral part, its center of mass, and coefficients of friction, we give an O(n/sup 2/) algorithm to compute the "toppling graph", a new data structure that represents the mechanics of toppling, including rolling and jamming. The toppling graph can be used to identify critical pin heights that permit toppling. We compare pin heights predicted by the graph with physical experiments, and give a complete O(n/sup 3n/) algorithm for designing pin sequences.
Mike Tao Zhang, Gordon Smith, Robert-Paul Berretty, Mark H. Overmars, Kenneth Y. Goldberg
ICRA2
1999 Trap Design for Vibratory Bowl Feeders
abstract
The vibratory bowl feeder is the oldest and still most common approach to the automated feeding (orienting) of industrial parts. We consider a class of vibratory bowl filters that can be described by removing polygonal sections from the track; we refer to this class of filters as traps. For an n-sided convex polygonal part and m-sided convex polygonal trap, we give an O((n+m)log(n+m)) algorithm to decide if the part will be rejected by the trap, and an O((nm(n+m))/sup 1+/spl epsiv//) algorithm which deals with non-convex parts and traps. We then consider the problem of designing traps for a given part, and consider two rectilinear subclasses, balconies and gaps. We give linear and O(n/sup 2/) algorithms for designing feeders and have tested the results with physical experiments using a commercial inline vibratory feeder.
Robert-Paul Berretty, Kenneth Y. Goldberg, Lawrence Cheung, Mark H. Overmars, Gordon Smith, A. Frank van der Stappen
ICRA5
1999 Computing Parallel-Jaw Grips
abstract
We propose a new model for gripping parts with an industrial parallel-jaw gripper. In contrast to many previous models, we use two grip points and define candidate grips that are resistant to slipping and torque about the part's center of mass. These grips must also be accessible and robust to perturbations in part position. We give an O(n/sup 3/) algorithm for computing and ranking O(n/sup 2/) such grips on an n-sided polygonal slice through the part. The algorithm will be part of a design and simulation system that can rapidly provide feedback to designers; thus it must run quickly and reliably. We have also implemented the algorithm in a Java applet with a graphical user interface that allows Internet users to define a part; the applet computes, ranks, and displays the set of computed grips.
Gordon Smith, Kenneth Y. Goldberg, Karl-Friedrich Böhringer, John Craig
ICRA1
1999 The application of neural networks to the papermaking industry
abstract
This paper describes the application of neural network techniques to the papermaking industry, particularly for the prediction of paper "curl." Paper curl is an important quality measure that can only be measured reliably off-line after manufacture, making it difficult to control. Here we predict, before paper manufacture from characteristics of the current reel, whether the paper curl will be acceptable and the level of curl. For both the case of predicting the probability that paper will be "out-of-specification" and that of predicting the level of curl, we include confidence intervals indicating to the machine operator whether the predictions should be trusted. The results and the associated discussion describe a successful application of neural networks to a difficult, but important, real-world task taken from the papermaking industry. In addition the techniques described are widely applicable to industry where direct prediction of a quality measure and its acceptability are desirable, with a clear indication of prediction confidence.
Peter J. Edwards, Alan F. Murray, Georgios Papadopoulos 0001, A. Robin Wallace, John Barnard, Gordon Smith
IEEE Trans. Neural Networks6
1997 Estimating MLP Generalisation Ability without a Test Set using Fast, Approximate Leave-one-out Cross-validation
Andrew J. Myles, Alan F. Murray, A. Robin Wallace, John Barnard, Gordon Smith
Neural Comput. Appl.5
1994 Oracle's Symmetric Replication Technology and Implications for Application Design
abstract
No abstract available.
Dean Daniels, Lip Boon Doo, Alan Downing, Curtis Elsbernd, Gary Hallmark, Sandeep Jain, Bob Jenkins, Peter Lim, Gordon Smith, Benny Souder, Jim Stamos
SIGMOD Conference9
1989 TCB subsets: the next step
abstract
The advantages of TCB (trusted computing base) subsetting for building multilevel database systems are discussed, and the architectural impact on the database system when the TCB subsetting approach is used in a real implementation is described. Particular attention is given to such areas of difficulty as concurrency controls, recovery management, and buffer management. In discussing implications for the architecture of the database system, it is noted that the standard ORACLE database system already supports those architectural features that are required, and ORACLE is proceeding with product development and product evaluation projects to extend the promise of TCB subsetting to commercially available ORACLE RDBMS (relational database management system) products on a wide variety of platforms. The SeaView prototype takes advantage of the architectural features of ORACLE with a TCB subsetting approach to achieve a class A1 system that reuses existing TCB and database technology.>
Linda L. Vetter, Gordon Smith, Teresa F. Lunt
ACSAC2