scispace - formally typeset
Search or ask a question
Institution

Mitre Corporation

CompanyBedford, 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
More filters
Journal ArticleDOI
13 Nov 2014-PLOS ONE
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

Journal ArticleDOI
01 Jan 2002
TL;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

Journal ArticleDOI
01 Sep 2008
TL;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

Proceedings ArticleDOI
01 Dec 1999
TL;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

NameH-indexPapersCitations
Sushil Jajodia10166435556
Myles R. Allen8229532668
Barbara Liskov7620425026
Alfred D. Steinberg7429520974
Peter T. Cummings6952118942
Vincent H. Crespi6328720347
Michael J. Pazzani6218328036
David Goldhaber-Gordon5819215709
Yeshaiahu Fainman5764814661
Jonathan Anderson5719510349
Limsoon Wong5536713524
Chris Clifton5416011501
Paul Ward5240812400
Richard M. Fujimoto5229013584
Bhavani Thuraisingham5256310562
Network Information
Related Institutions (5)
IBM
253.9K papers, 7.4M citations

83% related

Hewlett-Packard
59.8K papers, 1.4M citations

83% related

Carnegie Mellon University
104.3K papers, 5.9M citations

83% related

George Mason University
39.9K papers, 1.3M citations

83% related

Georgia Institute of Technology
119K papers, 4.6M citations

82% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
20234
202210
202195
2020139
2019145
2018132