نتایج جستجو برای: phase iii isaac study

تعداد نتایج: 4565268  

1996
F. Ruth Gee

The primary goal of TIPSTER Phase III is to promote advancements in text processing technologies. To accomplish this goal, the TIPSTER Program will continue to encourage the cooperation of researchers and developers in government, industry and academia to achieve a balanced overall program. The Phase III framework is modeled on that of Phase II and will consist of four basic components: (1) Adv...

1998
F. Ruth Gee

The overall purpose was to field a system for use within the operational elements of the Intelligence community and other Government agencies. Phase III Government participants included the Defense Advanced Research Projects Agency (DARPA), the Central Intelligence Agency (CIA), the National Security Agency (NSA), the National Institute of Standards and Technology (NIST), the Naval Research Lab...

2017
Isaac Butt Sylvain X. Marsillac

MODIFICATION OF DEPOSITION PROCESS PARAMETERS FOR UNIFORM INDIUM LAYER DEPOSITION Isaac Butt Old Dominion University, 2017 Director: Dr. Sylvain X. Marsillac The need for more efficient light to energy converting cells has long been a subject of research and development. With abundant availability of solar energy that the earth receives, the photovoltaic industry has sought materials that could...

Journal: :The Lancet 1919

Journal: :Journal of Perinatal Medicine 2020

Journal: :Annals of Surgery 1937

Journal: :Koers - Bulletin for Christian Scholarship 1964

Journal: :Journal of the Royal Asiatic Society of Great Britain & Ireland 1965

2010
Isaac Gorelic István Juhász

We define a compactum X to be AB-compact if the cofinality of the character χ(x, Y ) is countable whenever x ∈ Y and Y ⊂ X. It is a natural open question if every AB-compactum is necessarily first countable. We strengthen several results from [Arhangel’skii and Buzyakova, Convergence in compacta and linear Lindelöfness, Comment. Math. Univ. Carolin. 39 (1998), no. 1, 159–166] by proving the fol...

The aim of this study is to propose a comprehensive approach for handling the crew scheduling problem in the railway systems. In this approach, the information of different railway trips are considered as input and the problem is divided to three separated phases. In phase I, we generate all feasible sequences of the trips, which are named as the pairings. A depth-first search algorithm is deve...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید