304 3.5. Namboodiri. kl. A. A,. Nakai. C‘. k Klein, 1). C. (1070) J. Ncurochem. 33. 807-810 30. Klein. 1). C’. k Namboodiri, M. A. A. (1082) Trends Biochem. Sci. 7, OXI02 37. Namboodiri, M. A. A,, Weller, J. I , . Kc Klein, I). C’. (1080) J. l k l . Cheni. 255. 6032-0035 38. Namboodiri, M. A. A,. Weller, J. I, . K: Klein, I). C’. ( 1080) Hiochem. Hiophys. Kes. C’ommun. 96, 1 8%1 05 30 . Niimboo...

Multiplicative preconditioning is a popular tool for handling linear systems of equations provided the relevant information about the associated singular values is available. We propose using additive preconditioners, which are readily available for both general and structured ill conditioned input matrices and which preserve matrix structure. We introduce primal and dual additive preconditioni...

The effective management of knowledge resources is a key imperative for firms that want to leverage their knowledge assets for competitive advantage and improved performance. However, most firms do not attain the required performance levels even when programs are in place for managing knowledge resources. Research suggests this shortcoming can be addressed by linking knowledge management to bus...

References 1. Dick GW, Kitchen SF, Haddow AJ. Zika virus. I. Isolations and serological specificity. Trans R Soc Trop Med Hyg. 1952;46:509– 20. http://dx.doi.org/10.1016/0035-9203(52)90042-4 2. Haddow AD, Schuh AJ, Yasuda CY, Kasper MR, Heang V, Huy R, et al. Genetic characterization of Zika virus strains: geographic expansion of the Asian lineage. PLoS Negl Trop Dis. 2012; 6:e1477. http://dx.d...

We present a new complexity theoretic approach to incremental computation. We de ne complexity classes that capture the intuitive notion of incremental e ciency and study their relation to existing complexity classes. We show that problems that have small sequential space complexity also have small incremental time complexity. We show that all common LOGSPACE-complete problems for P are also in...

A graph property is any isomorphism closed class of simple graphs. For a simple finite graph H , let → H denote the class of all simple countable graphs that admit homomorphisms to H , such classes of graphs are called hom-properties. Given a graph property P , a graph This research was supported in part by Slovak VEGA grant 2/7141/27. The research of the author was supported in part by VEGA Gr...

Objective: This study evaluated the self-timed trial training for laparoscopic suturing. Methods: The set task involved grasping the suture, aligning the needle with a needle holder, passing the suture, making 3 knots, holding the 2 tails of the suture with one grasper, and cutting them. Trainees were given an instruction for suturing and reducing their suturing time. The same instruction was g...