PURPOSE Poorly characterized macromolecular (MM) and baseline artefacts are known to reduce metabolite quantitation accuracy in 1 H MR spectroscopic imaging (MRSI). Increasing echo time (TE) and improvements in MM analysis schemes have both been proposed as strategies to improve metabolite measurement reliability. In this study, the influence of TE and two MM analysis schemes on MRSI reproducib...

The k-th semi total point graph of a graph G, , ‎is a graph‎ obtained from G by adding k vertices corresponding to each edge and‎ connecting them to the endpoints of edge considered‎. ‎In this paper‎, a formula for Laplacian polynomial of in terms of‎ characteristic and Laplacian polynomials of G is computed‎, ‎where is a connected regular graph‎.The Kirchhoff index of is also computed‎.

Under certain circumstances, transposable elements (TE) can create or reverse mutations and alter the genome size of a cell. Sorghum (Sorghum bicolor L.) is promising for plant transposon tagging due to its small genome size and its low content of repetitive DNA. We developed a marker system based on targeted region amplification polymorphisms (TE-TRAP) that uses the terminal inverted repeats (...

A new process for concurrent trim and structural optimization of Active Aeroelastic Wing technology is presented. The new process treats trim optimization and structural optimization as integrated problems in the same mathematical formulation, in which control surface gear ratios are added as design variables to a standard structural optimization algorithm. This new approach is in contrast to m...

Background: Transient elastography (TE) is a new modality for the diagnosis of liver fibrosis caused by various etiologies. This study was conducted to determine the accuracy of TE in detecting the different stages of liver fibrosis in non-alcoholic fatty liver disease (NAFLD) patients. Methods: MEDLINE/PubMed, Embase, Ovid, Cochrane Library, American College of Physicians (ACP) Journal Club...

A total edge-irregular k-labelling ξ : V (G) ∪ E(G) → {1, 2, . . . , k} of a graph G is a labelling of vertices and edges of G in such a way that for any different edges e and f their weights wt(e) and wt(f) are distinct. The weight wt(e) of an edge e = xy is the sum of the labels of vertices x and y and the label of the edge e. The minimum k for which a graph G has a total edge-irregular k-lab...