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
••
01 Oct 2018
TL;DR: A brief introduction to Named Data Networking's basic concepts and operations is offered, together with an extensive reference list for the design and development of NDN for readers interested in further exploration of the subject.
Abstract: As a proposed Internet architecture, Named Data Networking (NDN) is designed to network the world of computing devices by naming data instead of naming data containers as IP does today. With this change, NDN brings a number of benefits to network communication, including built-in multicast, in-network caching, multipath forwarding, and securing data directly. NDN also enables resilient communication in intermittently connected and mobile ad hoc environments, which is difficult to achieve by today's TCP/IP architecture. This paper offers a brief introduction to NDN's basic concepts and operations, together with an extensive reference list for the design and development of NDN for readers interested in further exploration of the subject.
90 citations
••
Cornell University1, University of California, Los Angeles2, George Mason University3, University of Washington4, Harvard University5, University of Texas Health Science Center at San Antonio6, New York University7, Los Alamos National Laboratory8, University of Edinburgh9, Georgia Regents University10, Johns Hopkins University11, Yale University12, Montana State University13, California Institute of Technology14, University of California, Davis15, University of Pennsylvania16, Boston University17, Stanford University18, University of Minnesota19, University of Illinois at Chicago20, Mitre Corporation21, Newcastle University22, Washington University in St. Louis23, University of Tennessee Health Science Center24, University of California, San Francisco25
TL;DR: The current policy requires only high-direct-cost (>US$500,000/yr) grantees to share research data, starting 1 October 2003.
Abstract: Recently issued NIH policy statement and implementation guidelines (National Institutes of Health, 2003) promote the sharing of research data. While urging that “all data should be considered for data sharing” and “data should be made as widely and freely available as possible” the current policy requires only high-direct-cost (>US$500,000/yr) grantees to share research data, starting 1 October 2003. Data sharing is central to science, and we agree that data should be made available.
90 citations
••
21 Aug 2011TL;DR: By combining simple but effective indexing and disk block accessing techniques, a sequential algorithm iOrca is developed that is up to an order- of-magnitude faster than the state-of-the-art.
Abstract: The problem of distance-based outlier detection is difficult to solve efficiently in very large datasets because of potential quadratic time complexity. We address this problem and develop sequential and distributed algorithms that are significantly more efficient than state-of-the-art methods while still guaranteeing the same outliers. By combining simple but effective indexing and disk block accessing techniques, we have developed a sequential algorithm iOrca that is up to an order-of-magnitude faster than the state-of-the-art. The indexing scheme is based on sorting the data points in order of increasing distance from a fixed reference point and then accessing those points based on this sorted order. To speed up the basic outlier detection technique, we develop two distributed algorithms (DOoR and iDOoR) for modern distributed multi-core clusters of machines, connected on a ring topology. The first algorithm passes data blocks from each machine around the ring, incrementally updating the nearest neighbors of the points passed. By maintaining a cutoff threshold, it is able to prune a large number of points in a distributed fashion. The second distributed algorithm extends this basic idea with the indexing scheme discussed earlier. In our experiments, both distributed algorithms exhibit significant improvements compared to the state-of-the-art distributed method [13].
89 citations
••
TL;DR: There are many different types of multimedia videos found in the world today—consider home videos, surveillance camera videos, television broadcasts as general categories; commercial users, government personnel, and home consumers all have specific requirements to search these videos for topics and/or events.
Abstract: There are many different types of multimedia videos found in the world today—consider home videos, surveillance camera videos, television broadcasts as general categories. Commercial users, government personnel, and home consumers all have specific requirements to search these videos for topics and/or events. In order to support user query for these elements of interest , multimedia systems must segment and retrieve relevant segments of information. With advances in video digitization, annotation and extraction, automated multimedia processing systems are being created for many of the various video types. In these systems, event segmentation occurs manually, semiautomatically, or automatically. Each type of multimedia video has varying levels of structure. For example, a home video may contain stories of a vacation, child's birthday party, and Christmas morning. The birthday party story may contain events of a child blowing out the candles, opening gifts, and playing games. In some stories , there may only be one event per story. The event pertaining to the child blowing out the candles may contain shots of the child's excitement of the oncoming cake, the friends singing, and the News on Demand FOR OF Deconstructing broadcast news using all sources of input from the multimedia stream.
89 citations
22 Sep 2000
TL;DR: The Wide Area Augmentation System (WAAS) as mentioned in this paper provides real-time differential GPS corrections and integrity information for aircraft navigation use, where the system guides the aircraft to within a few hundred feet of the ground.
Abstract: The Wide Area Augmentation System (WAAS) will
provide real-time differential GPS corrections and integrity
information for aircraft navigation use. The most
stringent application of this system will be precision
approach, where the system guides the aircraft to within a
few hundred feet of the ground. Precision approach
operations require the use of differential ionospheric
corrections. WAAS must incorporate information from
reference stations to create a correction map of the
ionosphere. More importantly, this map must contain
confidence bounds describing the integrity of the
corrections. The confidence bounds must be large enough
to describe the error in the correction, but tight enough to
allow the operation to proceed. The difficulty in
generating these corrections is that the reference station
measurements are not co-located with the aviation user
measurements. For an undisturbed ionosphere over the
Conterminous United States (CONUS), this is not a
problem as the ionosphere is nominally well behaved.
However, a concern is that irregularities in the ionosphere
will decrease the correlation between the ionosphere
observed by the reference stations and that seen by the
user. Therefore, it is essential to detect when such
irregularities may be present and adjust the confidence
bounds accordingly.
The approach outlined in this paper conservatively bounds
the ionospheric errors even for the worst observed
ionospheric conditions to date, using data sets taken from
the operational receivers in the WAAS reference station
network. As we progress through the current solar cycle
and gather more data on the behavior of the ionosphere,
many of our pessimistic assumptions will be relaxed.
This will result in higher availability while maintaining
full integrity.
88 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 |