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.
Topics: Air traffic control, National Airspace System, Information system, Air traffic management, Communications system
Papers published on a yearly basis
Papers
More filters
••
TL;DR: This work proposes that an optimizable solution does not equal a generalizable solution, and introduces a new machine learning-based Polarity Module for detecting negation in clinical text, and extensively compare its performance across domains.
Abstract: A review of published work in clinical natural language processing (NLP) may suggest that the negation detection task has been “solved.” This work proposes that an optimizable solution does not equal a generalizable solution. We introduce a new machine learning-based Polarity Module for detecting negation in clinical text, and extensively compare its performance across domains. Using four manually annotated corpora of clinical text, we show that negation detection performance suffers when there is no in-domain development (for manual methods) or training data (for machine learning-based methods). Various factors (e.g., annotation guidelines, named entity characteristics, the amount of data, and lexical and syntactic context) play a role in making generalizability difficult, but none completely explains the phenomenon. Furthermore, generalizability remains challenging because it is unclear whether to use a single source for accurate data, combine all sources into a single model, or apply domain adaptation methods. The most reliable means to improve negation detection is to manually annotate in-domain training data (or, perhaps, manually modify rules); this is a strategy for optimizing performance, rather than generalizing it. These results suggest a direction for future work in domain-adaptive and task-adaptive methods for clinical NLP.
100 citations
•
01 May 1971
100 citations
••
01 Jan 2002TL;DR: This paper conducts an extensive computational study of 11 annealing-based heuristics for the traveling salesman problem, applying each heuristic to 29 traveling salesman problems taken from a well-known online library, and comparing the results with respect to accuracy and running time.
Abstract: Recently, several general optimization algorithms based on the demon algorithm from statistical physics have been developed and tested on a few traveling salesman problems with encouraging results. In this paper, we conduct an extensive computational study of 11 annealing-based heuristics for the traveling salesman problem. We code versions of simulated annealing, threshold accepting, record-to-record travel and eight heuristics based on the demon algorithm. We apply each heuristic to 29 traveling salesman problems taken from a well-known online library, compare the results with respect to accuracy and running time and provide insights and suggestions for future work.
99 citations
••
01 Sep 2008TL;DR: The structure of the Windows registry as it is stored in physical memory is described and a compelling attack that modifies the cached version of the registry without altering the on-disk version is described.
Abstract: This paper describes the structure of the Windows registry as it is stored in physical memory. We present tools and techniques that can be used to extract this data directly from memory dumps. We also provide guidelines to aid investigators and experimentally demonstrate the value of our techniques. Finally, we describe a compelling attack that modifies the cached version of the registry without altering the on-disk version. While this attack would be undetectable with conventional on-disk registry analysis techniques, we demonstrate that such malicious modifications are easily detectable by examining memory.
99 citations
••
01 Dec 1999TL;DR: This work considers the issue of composability as a design principle for simulation and describes a few of the complexities introduced through composability that might tend to offset the benefits of component based modeling on a large scale.
Abstract: We consider the issue of composability as a design principle for simulation. While component based modeling is believed to potentially reduce the complexities of the modeling task, we describe a few of the complexities introduced through composability. We observe that these complexities might tend to offset the benefits of component based modeling on a large scale.
99 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 |