Demo Data from EDBT 2026 / reviewers in the wild / expert
John Burns 0003
dblp:42/7138
· DBLP profile ↗
6ranked-venue papers
2as 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 · 2Systems, architecture and hardware · 1 · 1 first-authorSecurity and privacy · 1 · 1 first-authorSoftware engineering, systems software and programming languages · 1Databases, data management, data science and information retrieval · 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.
| Network and information security
1 paper |
Cryptographic primitives and cryptanalysis · 61% Cryptographic protocols and secure computation · 30% Authentication and access control · 9% |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic primitives and cryptanalysis › cryptanalysis
attack analysis |
0.0 | 1 | 1994 | Parameter Selection for Server-Aided RSA Computation Schemes · IEEE Trans. Computers 1994 |
Cryptographic primitives and cryptanalysis › public-key cryptography
RSA |
0.0 | 1 | 1994 | Parameter Selection for Server-Aided RSA Computation Schemes · IEEE Trans. Computers 1994 |
Cryptographic protocols and secure computation
server-aided computation |
0.0 | 1 | 1994 | Parameter Selection for Server-Aided RSA Computation Schemes · IEEE Trans. Computers 1994 |
Authentication and access control
smart card |
0.0 | 1 | 1994 | Parameter Selection for Server-Aided RSA Computation Schemes · IEEE Trans. Computers 1994 |
Methods — techniques the papers use, named apart from their topics
security and complexity analysis · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2005 | Document digitization lifecycle for complex magazine collectionabstractThe conversion of large collections of documents from paper to digital formats that are suitable for electronic archival is a complex multi-phase process. The creation of good quality images from paper documents is just one phase. To extract relevant information that they contain, with an accuracy that fits the purpose of target applications, an automated document analysis system and a manual verification/review process are needed. The automated system needs to perform a variety of analysis and recognition tasks in order to reach an accuracy level that minimizes the manual correction effort downstream.This paper describes the complete process and the associated technologies, tools, and systems needed for the conversion of a large collection of complex documents and deployment for online web access to its information rich content. We used this process to recapture 80 years of Time magazines. The historical collection is scanned, automatically processed by advanced document analysis components to extract articles, manually verified for accuracy, and converted in a form suitable for web access. We discuss the major phases of the conversion lifecycle and the technology developed and tools used for each phase. We also discuss results in terms of recognition accuracy. Sherif M. Yacoub, John Burns 0003, Paolo Faraboschi, Daniel Ortega, José L. Abad Peiro, Vinay Saxena |
ACM Symposium on Document Engineering | 2 |
| 2003 | Recognition of emotions in interactive voice response systemsabstractThis paper reports emotion recognition results from speech signals, with particular focus on extracting emotion features from the short utterances typical of Interactive Voice Response (IVR) applications. We focus on distinguishing anger versus neutral speech, which is salient to call center applications. We report on classification of other types of emotions such as sadness, boredom, happy, and cold anger. We compare results from using neural networks, Support Vector Machines (SVM), K-Nearest Neighbors, and decision trees. We use a database from the Linguistic Data Consortium at University of Pennsylvania, which is recorded by 8 actors expressing 15 emotions. Results indicate that hot anger and neutral utterances can be distinguished with over 90% accuracy. We show results from recognizing other emotions. We also illustrate which emotions can be clustered together using the selected prosodic features. Sherif M. Yacoub, Steven J. Simske, John Burns 0003 |
INTERSPEECH | 4 |
| 2003 | Automating the Analysis of Voting SystemsabstractVoting is a well-known technique to combine the decisions of peer experts. It is used in fault tolerant applications to mask errors from one or more experts using n-modular redundancy (NMR) and n-version programming. Voting strategies include: majority, weighted voting, plurality; instance runoff voting, threshold voting, and the more general weighted k-out-of-n systems. Before selecting a voting schema for a particular application, we have to understand the various tradeoffs and parameters and how they impact the correctness, reliability, and confidence in the final decision made by a voting system. In this paper, we propose an enumerated simulation approach to automate the behavior analysis of voting schemas with application to majority and plurality voting. We conduct synthetic studies using a simulator that we develop to analyze results from each expert, apply a voting mechanism, and analyze the voting results. The simulator builds a decision tree and uses a depth-first traversal algorithm to obtain the system reliability among other factors. We define and study the following behaviors: 1) the probability of reaching a consensus, "Pc"; 2) reliability of the voting system, "R"; 3) certainly index, "T"; and 4) the confidence index, "C". The parameters controlling the analysis are the number of participating experts, the number of possible output symbols that can be produced by an expert, the probability distribution of each expert's output, and the voting schema. The paper presents an enumerated simulation approach for analyzing voting systems which can be used when the use of theoretical models are challenged by dependencies between experts or uncommon probability distributions of the expert's output. Sherif M. Yacoub, Steven J. Simske, John Burns 0003 |
ISSRE | 4 |
| 2003 | Performance analysis of pattern classifier combination by plurality voting
Sherif M. Yacoub, John Burns 0003, Steven J. Simske |
Pattern Recognit. Lett. | 3 |
| 1994 | Parameter Selection for Server-Aided RSA Computation SchemesabstractThe security, complexity, and application of two schemes for using an untrusted auxiliary processor to aid smart card RSA signature computations are reviewed, including detailed analysis of possible methods of attack. Guidance is given on practical, secure use of these schemes.> John Burns 0003, Chris J. Mitchell |
IEEE Trans. Computers | 1 |
| 1990 | A security scheme for resource sharing over a network
John Burns 0003, Chris J. Mitchell |
Comput. Secur. | 1 |