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.

Multivariate Probabilistic Collocation Method for Effective Uncertainty Evaluation With Application to Air Traffic Flow Management

Abstract: Modern large-scale infrastructure systems have typical complicated structure and dynamics, and extensive simulations are required to evaluate their performance. The probabilistic collocation method (PCM) has been developed to effectively simulate a system's performance under parametric uncertainty. In particular, it allows reduced-order representation of the mapping between uncertain parameters and system performance measures/outputs, using only a limited number of simulations; the resultant representation of the original system is provably accurate over the likely range of parameter values. In this paper, we extend the formal analysis of single-variable PCM to the multivariate case, where multiple uncertain parameters may or may not be independent. Specifically, we provide conditions that permit multivariate PCM to precisely predict the mean of original system output. We also explore additional capabilities of the multivariate PCM, in terms of cross-statistics prediction, relation to the minimum mean-square estimator, computational feasibility for large dimensional parameter sets, and sample-based approximation of the solution. At the end of the paper, we demonstrate the application of multivariate PCM in evaluating air traffic system performance under weather uncertainties.

Cryptographic Protocol Composition via the Authentication Tests

Abstract: Although cryptographic protocols are typically analyzed in isolation, they are used in combinations. If a protocol *** 1 , when analyzed alone, was shown to meet some security goals, will it still meet those goals when executed together with a second protocol *** 2 ? Not necessarily: for every *** 1 , some *** 2 s undermine its goals. We use the strand space "authentication test" principles to suggest a criterion to ensure a *** 2 preserves *** 1 's goals; this criterion strengthens previous proposals. Security goals for *** 1 are expressed in a language $\mathcal{L}$(*** 1 ) in classical logic. Strand spaces provide the models for $\mathcal{L}$(*** 1 ). Certain homomorphisms among models for $\mathcal{L}$(*** ) preserve the truth of the security goals. This gives a way to extract--from a counterexample to a goal that uses both protocols--a counterexample using only the first protocol. This model-theoretic technique, using homomorphisms among models to prove results about a syntactically defined set of formulas, appears to be novel for protocol analysis.

Quantifying software reliability and readiness

Abstract: As the industry moves to more mature software processes (e.g., CMMI) there is increased need to adopt more rigorous, sophisticated (i.e., quantitative) metrics. While quantitative product readiness criteria are often used for business cases and related areas, software readiness is often assessed more subjectively & qualitatively. Quite often there is no explicit linkage to original performance and reliability requirements for the software. The criteria are primarily process-oriented (versus product oriented) and/or subjective. Such an approach to deciding software readiness increases the risk of poor field performance and unhappy customers. Unfortunately, creating meaningful and useful quantitative in-process metrics for software development has been notoriously difficult.

Evaluation of an Opportunistic Replacement Policy for a 2-Unit System

Abstract: A probabilistic model represents a robust maintenance circumstance: a scheduled activity and a randomly-occurring activity with cost savings if they are combined. The activities are combined if the elapsed time for either activity exceeds a control limit, called a screen. The long-run rates of single and joint replacements are evaluated when the randomly-occurring activity is uniformly distributed.

Translating OWL and Semantic Web Rules into Prolog: Moving Toward Description Logic Programs

Abstract: To appear in Theory and Practice of Logic Programming (TPLP), 2008. We are researching the interaction between the rule and the ontology layers of the Semantic Web, by comparing two options: 1) using OWL and its rule extension SWRL to develop an integrated ontology/rule language, and 2) layering rules on top of an ontology with RuleML and OWL. Toward this end, we are developing the SWORIER system, which enables efficient automated reasoning on ontologies and rules, by translating all of them into Prolog and adding a set of general rules that properly capture the semantics of OWL. We have also enabled the user to make dynamic changes on the fly, at run time. This work addresses several of the concerns expressed in previous work, such as negation, complementary classes, disjunctive heads, and cardinality, and it discusses alternative approaches for dealing with inconsistencies in the knowledge base. In addition, for efficiency, we implemented techniques called extensionalization, avoiding reanalysis, and code minimization.