Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Jun-young Choe"'
Publikováno v:
Journal of the Korea Society of Computer and Information. 15:1-8
In this paper, we propose a scheduling strategy for grid environment that reduces resource cost. This strategy considers resource cost and job failure rate to efficiently allocate local computing resources. The key idea of our strategy is that we use
Autor:
William Charles Ripka, Scott W. Nelson, Kevin M. Short, Michael J. Newman, Richard B. Honzatko, Karl Norvell, Frank U. Axe, Kristen L. Arienti, Deborah H. Slee, Tassie L. Collins, Todd K. Jones, Jun-young Choe, Herbert J. Fromm, Rachel Denise Anne Kimmich, Suzanne J. Romano
Publikováno v:
Journal of Biological Chemistry. 278:51176-51183
A highly constrained pseudo-tetrapeptide (OC252-324) further defines a new allosteric binding site located near the center of fructose-1,6-bisphosphatase. In a crystal structure, pairs of inhibitory molecules bind to opposite faces of the enzyme tetr
Publikováno v:
Metals and Materials. 3:265-271
Ultrasonic agitation was applied during the chemical bath deposition of CdS thin films. Ultrasonication resulted in a dramatic change in the surface morphology, growth rate, and optical properties of CdS films. There were virtually no colloidal parti
Publikováno v:
Carbohydrate Research. 281:203-218
The acid modifications of potato, amylomaize-7, and waxy maize starches were conducted in methanol, ethanol, 2-propanol, and 1-butanol using a wide range of acid concentrations (0.36 to 5.0%, w/v) and temperatures of 5 to 65 °C. It was found that li
Autor:
Jun-Young Choe, Gregory J.1, Nelson, Scott W.1, Arienti, Kristen L.2,3, Axe, Frank U.2,3, Collins, Tassie L.2,4, Jones, Todd K.2,3, Kimmich, Rachel D.A.2,5, Newman, Michael J.2,6, Norvell, Karl2, Ripka, William C.2,6, Romano, Suzanne J.2, Short, Kevin M.2,3, Slee, Deborah H.2, Fromm, Herbert J.1, Honzatko, Richard B.1 honzatko@iastate.edu
Publikováno v:
Journal of Biological Chemistry. 12/19/2003, Vol. 278 Issue 51, p51176-51183. 8p. 6 Diagrams, 4 Charts, 3 Graphs.