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

Martin R. Frank

dblp:24/1213 · DBLP profile ↗
← Back
14ranked-venue papers
8as first author
0since 2021 · last 2004
—ORCID · none

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

Human-computer interaction and ubiquitous computing · 7 · 6 first-authorDatabases, data management, data science and information retrieval · 4 · 1 first-authorSystems, architecture and hardware · 2Artificial intelligence and machine learning · 1 · 1 first-authorApplied, interdisciplinary, general and emerging 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
2 papers
Distributed systems · 100%
Databases, data mining, and information retrieval
1 paper
Graph data management · 50% Distributed and cloud data management · 50%
Artificial intelligence
1 paper
Knowledge representation and reasoning · 100%

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

TopicWeightPapersLastEvidence papers
Distributed systems
peer-to-peer systems
0.122004
RDFPeers: a scalable distributed RDF repository based on a structured peer-to-peer network · WWW 2004
A Peer-to-Peer Replica Location Service Based on a Distributed Hash Table · SC 2004
Distributed and cloud data management
distributed query processing
0.012004
RDFPeers: a scalable distributed RDF repository based on a structured peer-to-peer network · WWW 2004
Graph data management
RDF data management
0.012004
RDFPeers: a scalable distributed RDF repository based on a structured peer-to-peer network · WWW 2004
Distributed systems › peer-to-peer systems
distributed hash table
0.012004
A Peer-to-Peer Replica Location Service Based on a Distributed Hash Table · SC 2004
Distributed systems › replication
replica location service
0.012004
A Peer-to-Peer Replica Location Service Based on a Distributed Hash Table · SC 2004
Distributed systems › distributed coordination
self-organization
0.012004
A Peer-to-Peer Replica Location Service Based on a Distributed Hash Table · SC 2004

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

multi-attribute addressable network · 0.1consistent hashing · 0.1pre- and postconditions · 0.0pure reasoning engine · 0.0
YearPublicationVenuePosition
2004 A Peer-to-Peer Replica Location Service Based on a Distributed Hash Table
abstract
A Replica Location Service (RLS) allows registration and discovery of data replicas. In earlier work, we proposed an RLS framework and described the performance and scalability of an RLS implementation in Globus Toolkit Version 3.0. In this paper, we present a Peer-to-Peer Replica Location Service (P-RLS) with properties of self-organization, fault-tolerance and improved scalability. P-RLS uses the Chord algorithm to self-organize PRLS servers and exploits the Chord overlay network to replicate P-RLS mappings adaptively. Our performance measurements demonstrate that update and query latencies increase at a logarithmic rate with the size of the P-RLS network, while the overhead of maintaining the P-RLS network is reasonable. Our simulation results for adaptive replication demonstrate that as the number of replicas per mapping increases, the mappings are more evenly distributed among P-RLS nodes. We introduce a predecessor replication scheme and show it reduces query hotspots of popular mappings by distributing queries among nodes.
Min Cai, Ann L. Chervenak, Martin R. Frank
SC3
2004 RDFPeers: a scalable distributed RDF repository based on a structured peer-to-peer network
abstract
Centralized Resource Description Framework (RDF) repositories have limitations both in their failure tolerance and in their scalability. Existing Peer-to-Peer (P2P) RDF repositories either cannot guarantee to find query results, even if these results exist in the network, or require up-front definition of RDF schemas and designation of super peers. We present a scalable distributed RDF repository (RDFPeers) that stores each triple at three places in a multi-attribute addressable network by applying globally known hash functions to its subject predicate and object. Thus all nodes know which node is responsible for storing triple values they are looking for and both exact-match and range queries can be efficiently routed to those nodes. RDFPeers has no single point of failure nor elevated peers and does not require the prior definition of RDF schemas. Queries are guaranteed to find matched triples in the network if the triples exist. In RDFPeers both the number of neighbors per node and the number of routing hops for inserting RDF triples and for resolving most queries are logarithmic to the number of nodes in the network. We further performed experiments that show that the triple-storing load in RDFPeers differs by less than an order of magnitude between the most and the least loaded nodes for real-world RDF data.
Min Cai, Martin R. Frank
WWW2
2004 MAAN: A Multi-Attribute Addressable Network for Grid Information Services
Min Cai, Martin R. Frank, Pedro A. Szekely
J. Grid Comput.2
2004 A subscribable peer-to-peer RDF repository for distributed metadata management
Min Cai, Martin R. Frank, Baoshi Yan, Robert M. MacGregor
J. Web Semant.2
2003 WebScripter: Grass-Roots Ontology Alignment via End-User Report Creation
Baoshi Yan, Martin R. Frank, Pedro A. Szekely, Robert Neches, Juan Lopez
ISWC2
2001 Interfaces for understanding multi-agent behavior
abstract
>Synchronized punch-card displaysare an interface technique to visualize tens of thousands of variables by encoding their values as color chips in a rectangular array. Our technique ties multiple such displays to a timeline of events enabling the punch-card displays to show animations of the behavior of complex systems. Punch-card displays not only make it easy to understand the high-level behavior of systems, but also enable users to quickly focus on individual variables and on fine-grained time intervals. This paper describes synchronized punch-card displays and shows how this technique is extremely powerful for understanding the behavior of complex multi-agent systems.
Pedro A. Szekely, Craig Milo Rogers, Martin R. Frank
IUI3
1999 Collapsible User Interfaces for Information Retrieval Agents
abstract
This paper presents an architecture for information retrieval agents in which each agent declaratively describes its domain, input, output, and user interface.A mediating piece of software can then assemble software agents for a given information retrieval task, and produce a single, unified user interface for that task from the individual agents' descriptions.
Martin R. Frank, Pedro A. Szekely
IUI1
1998 Adaptive Forms: An Interaction Paradigm for Entering Structured Data
abstract
Article Free Access Share on Adaptive forms: an interaction paradigm for entering structured data Authors: Martin R. Frank University of Southern California - Information Sciences Institute, 4676 Admiralty Way, Marina del Rey, California University of Southern California - Information Sciences Institute, 4676 Admiralty Way, Marina del Rey, CaliforniaView Profile , Pedro Szekely University of Southern California - Information Sciences Institute, 4676 Admiralty Way, Marina del Rey, California University of Southern California - Information Sciences Institute, 4676 Admiralty Way, Marina del Rey, CaliforniaView Profile Authors Info & Claims IUI '98: Proceedings of the 3rd international conference on Intelligent user interfacesJanuary 1998 Pages 153–160https://doi.org/10.1145/268389.268418Online:01 January 1998Publication History 11citation475DownloadsMetricsTotal Citations11Total Downloads475Last 12 Months4Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
Martin R. Frank, Pedro A. Szekely
IUI1
1998 Adaptive Forms: an interaction technique for entering structured data
Martin R. Frank, Pedro A. Szekely
Knowl. Based Syst.1
1995 Grizzly Bear: A Demonstrational Learning Tool for a User Interface Specification Language
abstract
No abstract available.
Martin R. Frank
ACM Symposium on User Interface Software and Technology1
1994 A Pure Reasoning Engine for Programming by Demonstration
abstract
We present an inference engine that can be used for creating Programming By Demonstration systems. The class of systems addressed are those which infer a state change description from examples of state [9, 11].
Martin R. Frank, James D. Foley
ACM Symposium on User Interface Software and Technology1
1993 Model-based User Interface Design by Example and by Interview
abstract
Model-based user interface design is centered around a description of application objects and operations at a level of abstraction higher than that of code, A good model can be used to support multiple interfaces, help separate interface and application, describe input sequencing in a simple way, check consistency and completeness of the interface, evaluate the interface's speed-of-use, generate context-specific help and assist in designing the interface.However, designers mrely use computer-supported application modelling today and prefer less formal approaches such as story boards of user interface prototypes.One reason is that available tools often use cryptic languages for the model specification.Another reason is that these tools force the designers to specify the application model before they can start working on the visual interface, which is their main area of expertise.We present the Interactive User Interface Design Environment (Interactive UIDE), a novel framework for concurrent development of the application model and the user interface which combines story-boarding and model-based interface design.We also present Albert.an intelligent component within this framework, which is able to infer an application model from a user interface and from an interview process with the designer, KEYWORDS User Interface Management Systems.Modelbased User Interface Design.
Martin R. Frank, James D. Foley
ACM Symposium on User Interface Software and Technology1
1992 Building User Interfaces Interactively Using Pre- and Postconditions
abstract
A tool is presented which allows graphic layout of a user interface integrated with specification of behavior using pre- and postconditions.
Martin R. Frank, J. J. de Graaff, Daniel F. Gieskens, James D. Foley
CHI1
1992 Adaptive and Automated Index Selection in RDBMS
Martin R. Frank, Edward Omiecinski, Shamkant B. Navathe
EDBT1