Mitre Corporation

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.

Service-oriented computing : agents, semantics, and engineering : AAMAS 2007 International Workshop, SOCASE 2007, Honolulu, HI, USA, May 14, 2007 : proceedings

Abstract: Executing Semantic Web Services with a Context-Aware Service Execution Agent.- An Effective Strategy for the Flexible Provisioning of Service Workflows.- Using Goals for Flexible Service Orchestration.- An Agent-Based Approach to User-Initiated Semantic Service Interconnection.- A Lightweight Agent Fabric for Service Autonomy.- Semantic Service Composition in Service-Oriented Multiagent Systems: A Filtering Approach.- Towards a Mapping from BPMN to Agents.- Associated Topic Extraction for Consumer Generated Media Analysis.- An MAS Infrastructure for Implementing SWSA Based Semantic Services.- A Role-Based Support Mechanism for Service Description and Discovery.- WS2JADE: Integrating Web Service with Jade Agents.- Z-Based Agents for Service Oriented Computing.

Utility Accrual Scheduling under Arbitrary Time/Utility Functions and Multi-unit Resource Constraints

Abstract: We present a uni-processor real-time scheduling algorithm called Resource-contrainted Utility Accrual algorithm (or RUA) RUA considers an application model, where activities can be subject to arbitrarily-shaped time/utility function (TUF) time constraints and resource constraints including mutual exclusion under a multi-unit resource request model For such a model, we consider the scheduling objective of maximizing the total utility accrued by all activities This problem was previously open Since the problem is NP-hard, RUA heuristically computes schedules with a polynomial-time cost We analytically establish several timeliness and non-timeliness properties of the algorithm, including upper bound on blocking time (under multi-unit request model) and deadlock-freedom We also implement RUA on a POSIX RTOS and conduct experimental comparisons with other TUF scheduling algorithms that address a subset of RUA’s model Our implementation measurements show that RUA performs generally better than, or as good as, other TUF algorithms for the applicable cases

Guidelines for annotating temporal information

Abstract: This paper introduces a set of guidelines for annotating time expressions with a canonicalized representation of the times they refer to. Applications that can benefit from such an annotated corpus include information extraction (e.g., normalizing temporal references for database entry), question answering (answering "when" questions), summarization (temporally ordering information), machine translation (translating and normalizing temporal references), and information visualization (viewing event chronologies).

Some limitations on the effectiveness of airborne adaptive radar

Abstract: It is shown that internal clutter motion, aircraft crabbing, scattering from near-field obstacles, and channel mismatch can limit the effectiveness of space-time processing in eliminating airborne clutter. An analytical expression is developed to show how each of these effects produces a deterioration in the signal-to-clutter-plus-noise ratio achievable. By studying the spectral decomposition of the covariance matrix, it is found that the effects of both internal clutter motion and crabbing can either be compensated by artificially adding noise or by processing more pulses. A near-field obstacle produces a spread of the clutter into all of sine azimuth-Doppler space. It is shown that the space-time processor attempts to compensate for this effect by placing a near-field null on the obstacle. Thus, adding more elements is much more effective in eliminating this effect than is processing more pulses. Channel mismatch can be alleviated by controlling the dispersive errors more tightly and by increasing the number of receive elements. >