PURPOSE To assess the feasibility of TRacking Only Navigator echo (TRON) for diffusion-weighted magnetic resonance imaging (DWI) of the liver at 3.0T. MATERIALS AND METHODS Ten volunteers underwent TRON, respiratory triggered, and free breathing DWI of the liver at 3.0 Tesla (T). Scan times were measured. Image sharpness, degree of stair-step and stripe artifacts for the three methods were as...

The file protection mechanism provided in UNIX is insufficient for current computing environments. While the UNIX file protection system attempts to protect users from attacks by other users, it does not directly address the agents of destruction— executing processes. As computing environments become more interconnected and interdependent, there is increasing pressure and opportunity for users ...

With the emergence of big data, there has been a growing interest in optimization routines that lead to faster convergence of Logistic Regression (LR). Among many optimization methods such as Gradient Descent, Quasi-Newton, Conjugate Gradient, etc., the Trust-region based truncated Newton method (TRON) algorithm has been shown to converge the fastest. The TRON algorithm also forms an important ...

Introduction Diffusion-weighted MR imaging (DWI) is an emerging technique for the detection and characterization of liver lesions [1]. Two types of non-breathhold DWI are used in clinical practice: respiratory triggering (RT) and free breathing (FB). However, RT DWI suffers from a prolonged examination time, while FB DWI may suffer from image blurring [1]. Recently, the limitations of both RT a...

We consider the weighted version of the Tron game on graphs where two players, Alice and Bob, each build their own path by claiming one vertex at a time, starting with Alice. The vertices carry non-negative weights that sum up to 1 and either player tries to claim a path with larger total weight than the opponent. We show that if the graph is a tree then Alice can always ensure to get at most 1...

We study the combinatorial two-player game Tron. We answer the extremal question on general graphs and also consider smaller graph classes. Bodlaender and Kloks conjectured in [2] PSPACEcompleteness. We proof this conjecture.

This document presents some materials not included in the paper. In Section II, we illustrate the direct method for computing l i (w), l − i (w), α + i (w,v) and α − i (w), as well as the approach in Joachims (2006) that is similar to this method. Section III gives a comparison on relative function value, pairwise accuracy and NDCG with respect to the number of (CG) iterations between TRON and ...