Institution
Mitre Corporation
Company•Bedford, Massachusetts, United States•
About: Mitre Corporation is a company organization based out in Bedford, Massachusetts, United States. It is known for research contribution in the topics: Air traffic control & National Airspace System. The organization has 4884 authors who have published 6053 publications receiving 124808 citations. The organization is also known as: Mitre & MITRE.
Papers published on a yearly basis
Papers
More filters
••
03 May 1998TL;DR: This paper applies the strand space formalism to prove the correctness of the Needham-Schroeder-Lowe protocol and proves a generally useful lemma, as a sample result giving a general bound on the abilities of the penetrator in any protocol.
Abstract: A strand is a sequence of events; it represents either the execution of an action by a legitimate party in a security protocol or else a sequence of actions by a penetrator. A strand space is a collection of strands, equipped with a graph structure generated by causal interaction. In this framework, protocol correctness claims may be expressed in terms of the connections between strands of different kinds. In this paper, we develop the notion of a strand space. We then prove a generally useful lemma, as a sample result giving a general bound on the abilities of the penetrator in any protocol. We apply the strand space formalism to prove the correctness of the Needham-Schroeder-Lowe protocol (G. Lowe, 1995, 1996). Our approach gives a detailed view of the conditions under which the protocol achieves authentication and protects the secrecy of the values exchanged. We also use our proof methods to explain why the original Needham-Schroeder (1978) protocol fails. We believe that our approach is distinguished from other work on protocol verification by the simplicity of the model and the ease of producing intelligible and reliable proofs of protocol correctness even without automated support.
451 citations
••
TL;DR: It is shown that Synchrosqueezing is robust to bounded perturbations of the signal and to Gaussian white noise, which justifies its applicability to noisy or nonuniformly sampled data that is ubiquitous in engineering and the natural sciences.
444 citations
••
TL;DR: The best systems are now able to answer more than two thirds of factual questions in this evaluation, with recent successes reported in a series of question-answering evaluations.
Abstract: As users struggle to navigate the wealth of on-line information now available, the need for automated question answering systems becomes more urgent. We need systems that allow a user to ask a question in everyday language and receive an answer quickly and succinctly, with sufficient context to validate the answer. Current search engines can return ranked lists of documents, but they do not deliver answers to the user.Question answering systems address this problem. Recent successes have been reported in a series of question-answering evaluations that started in 1999 as part of the Text Retrieval Conference (TREC). The best systems are now able to answer more than two thirds of factual questions in this evaluation.
436 citations
••
31 Jul 2000TL;DR: It is found in a set of experiments that many commonly used tests often underestimate the significance and so are less likely to detect differences that exist between different techniques, including computationally-intensive randomization tests.
Abstract: Statistical significance testing of differences in values of metrics like recall, precision and balanced F-score is a necessary part of empirical natural language processing. Unfortunately, we find in a set of experiments that many commonly used tests often underestimate the significance and so are less likely to detect differences that exist between different techniques. This underestimation comes from an independence assumption that is often violated. We point out some useful tests that do not make this assumption, including computationally-intensive randomization tests.
436 citations
••
01 Apr 2000TL;DR: Theoretical background and implementation details of SEMINT are provided and experimental results from large and complex real databases are presented.
Abstract: One step in interoperating among heterogeneous databases is semantic integration: Identifying relationships between attributes or classes in diAerent database schemas. SEMantic INTegrator (SEMINT) is a tool based on neural networks to assist in identifying attribute correspondences in heterogeneous databases. SEMINT supports access to a variety of database systems and utilizes both schema information and data contents to produce rules for matching corresponding attributes automatically. This paper provides theoretical background and implementation details of SEMINT. Experimental results from large and complex real databases are presented. We discuss the eAectiveness of SEMINT and our experiences with attribute correspondence identification in various environments. ” 2000 Elsevier Science B.V. All rights reserved.
428 citations
Authors
Showing all 4896 results
Name | H-index | Papers | Citations |
---|---|---|---|
Sushil Jajodia | 101 | 664 | 35556 |
Myles R. Allen | 82 | 295 | 32668 |
Barbara Liskov | 76 | 204 | 25026 |
Alfred D. Steinberg | 74 | 295 | 20974 |
Peter T. Cummings | 69 | 521 | 18942 |
Vincent H. Crespi | 63 | 287 | 20347 |
Michael J. Pazzani | 62 | 183 | 28036 |
David Goldhaber-Gordon | 58 | 192 | 15709 |
Yeshaiahu Fainman | 57 | 648 | 14661 |
Jonathan Anderson | 57 | 195 | 10349 |
Limsoon Wong | 55 | 367 | 13524 |
Chris Clifton | 54 | 160 | 11501 |
Paul Ward | 52 | 408 | 12400 |
Richard M. Fujimoto | 52 | 290 | 13584 |
Bhavani Thuraisingham | 52 | 563 | 10562 |