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
TL;DR: Small memory codes are found which are optimized in the free-distance sense on the Gaussian channel which provide up to 4.8 dB of coding gain with 32 states over uncoded 8-PSK, a scheme having the same spectral efficiency as the codes described.
Abstract: Convolutional coding coupled with 16-PSK modulation is investigated for bandwidth efficient transmission. Rate 3/4, small memory codes are found which are optimized in the free-distance sense on the Gaussian channel. These codes provide up to 4.8 dB of coding gain with 32 states over uncoded 8-PSK, a scheme having the same spectral efficiency as the codes described. The performance is compared with earlier findings of Ungerboeck and some recent results on R = 2/3 coded 8-PSK. In addition, we present results of a channel transmission study to assess the performance of the four-state code on the band-limited nonlinear channel, and find that performance of the coded scheme degrades comparably with uncoded 8-PSK, i.e., coding gain is roughly preserved.

54 citations

Journal ArticleDOI
TL;DR: A general construction of the pagenumber t(G) is presented, showing t(Km,n) ⩽ ⌈(m + 2n)/4⌉, which is conjecture optimal, and a result suggesting this is optimal for m ⩾ 2n − 3.
Abstract: Given an ordering of the vertices of a graph around a circle, a page is a collection of edges forming noncrossing chords. A book embedding is a circular permutation of the vertices together with a partition of the edges into pages. The pagenumber t(G) (also called book thickness) is the minimum number of pages in a book embedding of G. We present a general construction showing t(Km,n) ⩽ ⌈(m + 2n)/4⌉, which we conjecture optimal. We prove a result suggesting this is optimal for m ⩾ 2n − 3. For the most difficult case m = n, we consider vertex permutations that are regular, i.e., place vertices from each partite set into runs of equal size. Book embeddings with such orderings require ⌈(7n − 2)/9⌉ pages, which is achievable. The general construction uses fewer pages, but with an irregular ordering.

54 citations

Proceedings ArticleDOI
10 Jun 2002
TL;DR: A means of specifying and evaluating awareness needs in synchronous collaborative systems based on the framework presented in the paper is developed and it is felt this framework can be used by other researchers, as well, to develop methods of specifies and evaluating the ability of collaborative applications to support awareness.
Abstract: The contribution of the paper is a framework for specifying and evaluating awareness-related features of synchronous collaborative computing applications. While previous work acknowledges that roles are important to understanding awareness needs, no method has yet been developed to provide a fine-grained, role-based approach to both specifying the awareness-related characteristics of collaborative computing applications and evaluating whether the application meets the awareness requirements. We have been developing a means of specifying and evaluating awareness needs in synchronous collaborative systems based on the framework presented in the paper. We feel this framework can be used by other researchers, as well, to develop methods of specifying and evaluating the ability of collaborative applications to support awareness.

53 citations

01 Jan 1997
TL;DR: The development of a broadcast news video corpora and novel techniques to automatically segment stories, extract proper names, and visualize associated metadata are reported, measuring the precision and recall performance of the techniques.
Abstract: This paper reports the development of a broadcast news video corpora and novel techniques to automatically segment stories, extract proper names, and visualize associated metadata We report story segmentation and proper name extraction results using an information retrieval inspired evaluation methodology, measuring the precision and recall performance of our techniques We briefly describe our implementation of a Broadcast News Analysis (BNA ’~) system and an associated viewer, Broadcast News Navigator (BNNTM) We point to current efforts toward more robust processing using multistream analysis on imagery, audio, and closed-caption streams and future efforts in automatic video summarization and user-tailored presentation generation

53 citations

Proceedings ArticleDOI
11 Dec 1994
TL;DR: The evolution of the AIS from the initial prototype to the present is described, emphasizing the discovery of new requirements and how they were accommodated.
Abstract: The aggregate level simulation protocol (ALSP) concept was initiated by ARPA in January 1990, the first laboratory demonstration took place in January 1991, and the first fielding in support of a major military exercise took place in July 1992. Since then, the ALSP confederation of models has grown from the original two members to six. In support of this growing confederation, the ALSP Infrastructure Software (AIS) has evolved from its fundamental functionality to the current focus on improved confederation management and performance. This paper describes the evolution of the AIS from the initial prototype to the present, emphasizing the discovery of new requirements and how they were accommodated.

53 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