Explore the vast range of titles available.

In this study, we utilized published carrot sequences as well as heterologous PCR approaches with primers derived from sequence information of other plant species to isolate 24 putative genes coding for carotenoid bio-synthesis enzymes in carrot. Twenty-two of these genes were placed on the carrot genetic linkage map developed from a cross between orange-rooted and white- rooted carrot. The carotenoid genes were distributed in eight of the nine linkage groups in the carrot genome recommending their use for merging maps. Two genes co-localized with a genomic region spanning one of the most significant quantitative trait loci (QTL) for carotenoid accumulation.

Monocytes are amongst the first cells recruited into the brain after traumatic brain injury (TBI). We have shown monocyte depletion 24 hours prior to TBI reduces brain edema, decreases neutrophil infiltration and improves behavioral outcomes. Additionally, both lesion and ventricle size correlate with poor neurologic outcome after TBI. Therefore, we aimed to determine the association between monocyte infiltration, lesion size, and ventricle volume. We hypothesized that monocyte depletion would attenuate lesion size, decrease ventricle enlargement, and preserve white matter in mice after TBI. C57BL/6 mice underwent pan monocyte depletion via intravenous injection of liposome-encapsulated clodronate. Control mice were injected with liposome-encapsulated PBS. TBI was induced via an open-head, controlled cortical impact. Mice were imaged using magnetic resonance imaging (MRI) at 1, 7, and 14 days post-injury to evaluate progression of lesion and to detect morphological changes associated with injury (3D T1-weighted MRI) including regional alterations in white matter patterns (multi-direction diffusion MRI). Lesion size and ventricle volume were measured using semi-automatic segmentation and active contour methods with the software program ITK-SNAP. Data was analyzed with the statistical software program PRISM. No significant effect of monocyte depletion on lesion size was detected using MRI following TBI (p = 0.4). However, progressive ventricle enlargement following TBI was observed to be attenuated in the monocyte-depleted cohort (5.3 ± 0.9mm3) as compared to the sham-depleted cohort (13.2 ± 3.1mm3; p = 0.02). Global white matter integrity and regional patterns were evaluated and quantified for each mouse after extracting fractional anisotropy maps from the multi-direction diffusion-MRI data using Siemens Syngo DTI analysis package. Fractional anisotropy (FA) values were preserved in the monocyte-depleted cohort (123.0 ± 4.4mm3) as compared to sham-depleted mice (94.9 ± 4.6mm3; p = 0.025) by 14 days post-TBI. All TBI mice exhibited FA values lower than those from a representative naïve control group with intact white matter tracts and FA~200 mm3). The MRI derived assessment of injury progression suggests that monocyte depletion at the time of injury may be a novel therapeutic strategy in the treatment of TBI. Furthermore, non-invasive longitudinal imaging allows for the evaluation of both TBI progression as well as therapeutic response over the course of injury.

In this article we state and prove a corrected version of Theorem 3.5 in [SIAM J. Comput., 18 (1989), pp. 859--881]. [PUBLICATION ABSTRACT]

Objectives Due to the scarce amount of data available, a retrospective analysis of patients treated with removable dental prostheses (RDPs) was performed. The aim of the trial was to evaluate the rate of repairs and failures of attachment-retained RDPs (AR-RDPs) compared to clasp-retained RDPs (CR-RDPs) with respect to cofactors (e.g., type of loading). In this respect, two hypotheses were proposed: AR-RDPs are more prone to repairs than CR-RDPs, and AR-RDPs are more prone to fail than CR-RDPs. Materials and method Two hundred three patients treated with 135 AR-RDPs and 68 CR-RDPs between 1994 and 2006 were evaluated in this trial. The dental treatment was carried out in the clinical training course of senior students. Kaplan–Meier estimates were calculated for the primary end point (repairs) and for the secondary end point (failures). Results The survival of CR-RDPs and AR-RDPs did show significant differences regarding repairs ( p  = 0.034) but not with regard to failures ( p  = 0.169). Prostheses of the non-axially loaded group showed no significant differences in the frequency of repairs and failures. Conclusions Technical complications occurred more frequently in the CR-RDP group. Taking the higher observation time in the AR-RDP group into account, CR-RDPs are more prone to repairs, especially to those with technical background (e.g., fracture of the metal framework). Clinical relevance The use of crowns with rod attachments on tilted teeth seems to be an appropriate treatment approach in order to simplify removable dental prosthesis design.

This paper considers variants and generalizations of the following computational problem. Given a real input ${\\bf x} \\in \\mathbb{R}^n $, find a small integer relation ${\\bf m}$ for $x$ that is a nonzero vector $m \\in \\mathbb{Z}^n $ orthogonal to ${\\bf x}$, or prove that no integer relation ${\\bf m}$ exists with $\\|{\\bf m}\\| \\leqq 2^\\lambda $. An algorithm is presented that solves this problem in $O(n^3 (k + n))$ arithmetic operations over real numbers. The algorithm is a variation of the multidimensional Euclidean algorithm proposed by Ferguson and Forcade [Bull. Amer. Math. Soc., 1(1979), pp. 912-914] and Bergman [Notes on Ferguson and Forcade's Generalized Euclidean Algorithm, University of California, Berkeley, CA, 1980]. A connection between such multidimensional Euclidean algorithms and the Lattice Basis Reduction Algorithm of Lenstra, Lenstra Jr., and Lovász [Math. Ann., 21 (1982), pp. 515-534] is shown. Polynomial time solutions are also established for finding linearly independent sets of small integer relations and for finding small simultaneous integer relations for several real vectors, using real input vectors and counting arithmetic operations over real numbers at unit cost. For integer input vectors ${\\bf x}$ a different algorithm is given for finding integer relations (that always exist) that uses at most $O(n^3 \\log \\|x\\|)$ arithmetic operations on $O(n + \\log \\|{\\bf x}\\|)$ bit integers.

In this article we state and prove a corrected version of Theorem 3.5 in [SIAM J. Comput., 18 ( 1989), pp. 859-881].

This randomized clinical study examined the influence of the gingival condition—healthy versus mild inflammation—on sulcus representation and possible gingival recession for two gingival displacement procedures prior to conventional impression making. The interventions double cord technique or a kaolin paste containing aluminum chloride were applied to 40 probands. The opposite quadrant served as intrapersonal reference (split-mouth design). Precision impressions were then made. Extraoral digitization of the plaster models resulting from the reference impression prior to gingival displacement, the intervention impression and control impressions were the basis for the computer-aided three-dimensional analysis. After six months, a mild artificial gingivitis was induced, and the contralateral quadrant (cross-over design) was examined for the intervention. The gingivitis deteriorated the sulcus representation for the double cord technique group but did not affect the paste technique group. The gingival condition had no influence on the marginal gingiva height changes. The minor extent of those changes, which were measured up to six months after intervention at the palatal study site, were not considered to be in the clinically relevant range for gingival recession. For healthy gingiva, the cord technique showed superior sulcus representation compared to the paste technique. This advantage was lost to a great extent under the conditions of mild gingivitis.

Monocytes are amongst the first cells recruited into the brain after traumatic brain injury (TBI). We have shown monocyte depletion 24 hours prior to TBI reduces brain edema, decreases neutrophil infiltration and improves behavioral outcomes. Additionally, both lesion and ventricle size correlate with poor neurologic outcome after TBI. Therefore, we aimed to determine the association between monocyte infiltration, lesion size, and ventricle volume. We hypothesized that monocyte depletion would attenuate lesion size, decrease ventricle enlargement, and preserve white matter in mice after TBI. C57BL/6 mice underwent pan monocyte depletion via intravenous injection of liposome-encapsulated clodronate. Control mice were injected with liposome-encapsulated PBS. TBI was induced via an open-head, controlled cortical impact. Mice were imaged using magnetic resonance imaging (MRI) at 1, 7, and 14 days post-injury to evaluate progression of lesion and to detect morphological changes associated with injury (3D T1-weighted MRI) including regional alterations in white matter patterns (multi-direction diffusion MRI). Lesion size and ventricle volume were measured using semi-automatic segmentation and active contour methods with the software program ITK-SNAP. Data was analyzed with the statistical software program PRISM. No significant effect of monocyte depletion on lesion size was detected using MRI following TBI (p=0.4). However, progressive ventricle enlargement following TBI was observed to be attenuated in the monocyte-depleted cohort (5.3 0.9mm3) as compared to the sham-depleted cohort (13.2 3.1mm3; p=0.02). Global white matter integrity and regional patterns were evaluated and quantified for each mouse after extracting fractional anisotropy maps from the multi-direction diffusion-MRI data using Siemens Syngo DTI analysis package. Fractional anisotropy values were preserved in the monocyte-depleted cohort (123.0 4.4mm3) as compared to sham-depleted mice (94.9 4.6mm3; p=0.025) by 14 days post-TBI. The MRI derived data suggests that monocyte depletion at the time of injury may be a novel therapeutic strategy in the treatment of TBI. Furthermore, non-invasive longitudinal imaging allows for the evaluation of both TBI progression as well as therapeutic response over the course of injury.

This paper presents for the first time a higher-dimensional continued fraction algorithm (abbreviated \"cfa\") that produces diophantine approximations of more than linear goodness. On input $x_1 , \\cdots ,x_{n - 1} \\in {\\bf R}$, it produces vectors $(p_1^{(k)} , \\cdots p_{n - 1}^{(k)} ,q^{(k)} ) \\in {\\bf Z}^n ,k = 1,2, \\cdots $, such that \\[ \\max\\limits_{1 \\leq i \\leq n - 1} \\left| x_i - \\frac{p_i^{(k)}}{q^{(k)} } \\right| \\leq \\frac{||x|| \\cdot {\\text{const}}(n)}{| q^{(k)} |^{1 + 1/(2n(n - 1))}}. \\] By a theorem of Dirichlet, there is no algorithm that replaces the term $1/(2n(n - 1))$ by a term bigger than $1/(n - 1)$. The higher-dimensional cfa's analyzed so far do not achieve better than $\\max_{1 \\leq i \\leq n - 1} |x_i - p_i^{(k)} /q^{(k)} |\\leq o(1)/|q^{(k)} |$. The $o(1)$ term decreases with $k$ but is not known to be related with $q^{(k)} $. Other properties of the cfa are also generalized by the algorithm. On input $x_1 , \\cdots ,x_{n - 1} $ it starts with the standard basis of ${\\bf Z}^n $ and then constructs by performing elementary basis transformations a sequence $(\\mathcal{B}^{(k)} )_{k} $ of bases of ${\\bf Z}^n $. The sequence $(\\mathcal{B}^{(k)} )_{k} $ is finite if and only if the numbers $x_1 , \\cdots ,x_{n - 1} $, 1 are ${\\bf Z}$-linearly dependent; a linear dependence is found in case of existence. The maximal distance between the vectors of $\\mathcal{B}^{(k)} $ and the straight line $(x_1 , \\cdots, x_{n - 1} ,1)$${\\bf R}$, tends to zero exponentially fast in $k$. For each $k$, the above-mentioned vector $(p_1^{(k)} , \\cdots ,p_{n - 1}^{(k)} ,q^{(k)} )$ is the first vector of basis $\\mathcal{B}^{(k)} $. The algorithm is a variant of an algorithm for the integer relation problem presented in [G. Bergman, Notes on Ferguson and Forcade's Generalized Euclidean Algorithm, preprint, Univ. California, Berkeley, 1980] and analyzed in [J. Hastad, B. Just, J. Lagarias, and C. P Schnorr, SIAM J. Comput.,18 (1989), pp. 859-881]. The bound on the goodness of the diophantine approximations is proven with a \"parallel induction\" technique.