By the reaction of furan-2-carboxylic acids and furfural with diazonium salts 1a-j arylfuran-2-carboxylic 4a-e 5-arylfuran-2-carbaldehydes 5a-f were synthesized. Acids transformed into appropriated acylchlorides 6a-e used for preparation 4-(5-aryl-2-furoyl)morpholines 7a-e . 4-[(5-Aryl-2-furyl)carbonothioyl]morpholines 8a-f prepared from aldehydes by using Willgerodt-Kindler reaction. The struc...

1027. 31. Davis ID, Wiseman GA, Lee FT, Gansen DN, Hopkins W, Papenfuss AT, Liu Z, Moynihan TJ, Croghan GA, Adjei AA, Hoffman EW, Ingle JN, Old LJ, Scott AM. A phase I multiple dose, dose esca-lation study of cG250 monoclonal antibody in patients withadvanced renal cell carcinoma. Cancer Immun 2007; 7: 13. URL: http://www.cancerimmunity.org/v7p13/070713.htm 32. Bevan P, Mala C, Kindler ...

MGS is an uncommon congenital optic disc anomaly, which was first described by Kindler [1]. It is characterized by an enlarged funnel-shaped dysplastic disc with glial tissue. The retinal vessels are increased in number, appear to arise from the disc edge and run an abnormally straight course over the peripapillary retina [2,3]. Retinal detachment may occur in about one-third of cases of MGS [4...

S. Hofmann ∗1,2, D. Ackermann 1, S. Antalic 3, H.G. Burkhard1, V.F. Comas 4, R. Dressler 5, Z. Gan 6, S. Heinz 1, J.A. Heredia 4, F.P. Heßberger 1, J. Khuyagbaatar 1, B. Kindler 1, I. Kojouharov 1, P. Kuusiniemi 7, M. Leino 8, B. Lommel 1, R. Mann 1, G. Münzenberg † 1, K. Nishio 9, A.G. Popeko 10, S. Saro 3, H.J. Schött 1, B. Streicher 3, B. Sulignano 1, J. Uusitalo 8, M. Venhart 3, and A.V. Ye...

Let (Cd m)∞ denote the graph whose set of vertices is Zd m in which two distinct vertices are adjacent iff in each coordinate either they are equal or they differ, modulo m, by at most 1. Bollobás, Kindler, Leader, and O’Donnell proved that the minimum possible cardinality of a set of vertices of (Cd m)∞ whose deletion destroys all topologically nontrivial cycles is md − (m− 1)d. We present a s...

We consider the problem of testing functions for the property of being a k-junta (i.e., of depending on at most k variables). Fischer, Kindler, Ron, Safra, and Samorodnitsky (J. Comput. Sys. Sci., 2004 ) showed that Õ(k)/ queries are sufficient to test k-juntas, and conjectured that this bound is optimal for non-adaptive testing algorithms. Our main result is a non-adaptive algorithm for testin...

Semidefinite programming relaxations of combinatorial problems date back to the work of Lovász [17] from 1979, who proposed a semidefinite programming relaxation for the maximum stable set problem which now is known as the Lovász theta number. More recently, Goemans and Williamson [9] showed how to use semidefinite programming to provide an approximation algorithm for the maximum-cut problem; t...