4 resultados para Cooperative agreement
em Massachusetts Institute of Technology
Resumo:
This volume of the final report documents the technical work performed from December 1998 through December 2002 under Cooperative Agreement F33615-97-2-5153 executed between the U.S. Air Force, Air Force Research Laboratory, Materials and Manufacturing Directorate, Manufacturing Technology Division (AFRL/MLM) and the McDonnell Douglas Corporation, a wholly-owned subsidiary of The Boeing Company. The work was accomplished by The Boeing Company, Phantom Works, Huntington Beach, St. Louis, and Seattle; Ford Motor Company; Integral Inc.; Sloan School of Management in the Massachusetts Institute of Technology; Pratt & Whitney; and Central State University in Xenia, Ohio and in association with Raytheon Corporation. The LeanTEC program manager for AFRL is John Crabill of AFRL / MLMP and The Boeing Company program manager is Ed Shroyer of Boeing Phantom Works in Huntington Beach, CA. Financial performance under this contract is documented in the Financial Volume of the final report.
Resumo:
Lean Transition of Emerging Industrial Capability (LeanTEC) program was a cooperative agreement between the Boeing Company and AFRL conducted from January 1998 to January 2002. The results of this program are documented in the Manual for Effective Technology Transition Processes included as an attachment to this report. This manual provides processes, procedures, and tools for greatly improving technology transition in the aerospace industry. Methodology for the implementation of these improvements is given along with methods for customizing the various processes, procedures, and tools for a given company or business unit. The indicated methodology was tested by the LeanTEC team and results are documented in the report.
Resumo:
The computer science technique of computational complexity analysis can provide powerful insights into the algorithm-neutral analysis of information processing tasks. Here we show that a simple, theory-neutral linguistic model of syntactic agreement and ambiguity demonstrates that natural language parsing may be computationally intractable. Significantly, we show that it may be syntactic features rather than rules that can cause this difficulty. Informally, human languages and the computationally intractable Satisfiability (SAT) problem share two costly computional mechanisms: both enforce agreement among symbols across unbounded distances (Subject-Verb agreement) and both allow ambiguity (is a word a Noun or a Verb?).
Resumo:
We have simulated the behavior of several artificial flies, interacting visually with each other. Each fly is described by a simple tracking system (Poggio and Reichardt, 1973; Land and Collett, 1974) which summarizes behavioral experiments in which individual flies fixate a target. Our main finding is that the interaction of theses implemodules gives rise to a variety of relatively complex behaviors. In particular, we observe a swarm-like behavior of a group of many artificial flies for certain reasonable ranges of our tracking system parameters.