11,251 research outputs found
Turbo-FLASH based arterial spin labeled perfusion MRI at 7 T.
Motivations of arterial spin labeling (ASL) at ultrahigh magnetic fields include prolonged blood T1 and greater signal-to-noise ratio (SNR). However, increased B0 and B1 inhomogeneities and increased specific absorption ratio (SAR) challenge practical ASL implementations. In this study, Turbo-FLASH (Fast Low Angle Shot) based pulsed and pseudo-continuous ASL sequences were performed at 7T, by taking advantage of the relatively low SAR and short TE of Turbo-FLASH that minimizes susceptibility artifacts. Consistent with theoretical predictions, the experimental data showed that Turbo-FLASH based ASL yielded approximately 4 times SNR gain at 7T compared to 3T. High quality perfusion images were obtained with an in-plane spatial resolution of 0.85×1.7 mm(2). A further functional MRI study of motor cortex activation precisely located the primary motor cortex to the precentral gyrus, with the same high spatial resolution. Finally, functional connectivity between left and right motor cortices as well as supplemental motor area were demonstrated using resting state perfusion images. Turbo-FLASH based ASL is a promising approach for perfusion imaging at 7T, which could provide novel approaches to high spatiotemporal resolution fMRI and to investigate the functional connectivity of brain networks at ultrahigh field
A simple and optimal ancestry labeling scheme for trees
We present a ancestry labeling scheme for trees. The
problem was first presented by Kannan et al. [STOC 88'] along with a simple solution. Motivated by applications to XML files, the label size was
improved incrementally over the course of more than 20 years by a series of
papers. The last, due to Fraigniaud and Korman [STOC 10'], presented an
asymptotically optimal labeling scheme using
non-trivial tree-decomposition techniques. By providing a framework
generalizing interval based labeling schemes, we obtain a simple, yet
asymptotically optimal solution to the problem. Furthermore, our labeling
scheme is attained by a small modification of the original solution.Comment: 12 pages, 1 figure. To appear at ICALP'1
Labeling Schemes with Queries
We study the question of ``how robust are the known lower bounds of labeling
schemes when one increases the number of consulted labels''. Let be a
function on pairs of vertices. An -labeling scheme for a family of graphs
\cF labels the vertices of all graphs in \cF such that for every graph
G\in\cF and every two vertices , the value can be inferred
by merely inspecting the labels of and .
This paper introduces a natural generalization: the notion of -labeling
schemes with queries, in which the value can be inferred by inspecting
not only the labels of and but possibly the labels of some additional
vertices. We show that inspecting the label of a single additional vertex (one
{\em query}) enables us to reduce the label size of many labeling schemes
significantly
Analysis of Crowdsourced Sampling Strategies for HodgeRank with Sparse Random Graphs
Crowdsourcing platforms are now extensively used for conducting subjective
pairwise comparison studies. In this setting, a pairwise comparison dataset is
typically gathered via random sampling, either \emph{with} or \emph{without}
replacement. In this paper, we use tools from random graph theory to analyze
these two random sampling methods for the HodgeRank estimator. Using the
Fiedler value of the graph as a measurement for estimator stability
(informativeness), we provide a new estimate of the Fiedler value for these two
random graph models. In the asymptotic limit as the number of vertices tends to
infinity, we prove the validity of the estimate. Based on our findings, for a
small number of items to be compared, we recommend a two-stage sampling
strategy where a greedy sampling method is used initially and random sampling
\emph{without} replacement is used in the second stage. When a large number of
items is to be compared, we recommend random sampling with replacement as this
is computationally inexpensive and trivially parallelizable. Experiments on
synthetic and real-world datasets support our analysis
Repairing Deep Neural Networks: Fix Patterns and Challenges
Significant interest in applying Deep Neural Network (DNN) has fueled the
need to support engineering of software that uses DNNs. Repairing software that
uses DNNs is one such unmistakable SE need where automated tools could be
beneficial; however, we do not fully understand challenges to repairing and
patterns that are utilized when manually repairing DNNs. What challenges should
automated repair tools address? What are the repair patterns whose automation
could help developers? Which repair patterns should be assigned a higher
priority for building automated bug repair tools? This work presents a
comprehensive study of bug fix patterns to address these questions. We have
studied 415 repairs from Stack overflow and 555 repairs from Github for five
popular deep learning libraries Caffe, Keras, Tensorflow, Theano, and Torch to
understand challenges in repairs and bug repair patterns. Our key findings
reveal that DNN bug fix patterns are distinctive compared to traditional bug
fix patterns; the most common bug fix patterns are fixing data dimension and
neural network connectivity; DNN bug fixes have the potential to introduce
adversarial vulnerabilities; DNN bug fixes frequently introduce new bugs; and
DNN bug localization, reuse of trained model, and coping with frequent releases
are major challenges faced by developers when fixing bugs. We also contribute a
benchmark of 667 DNN (bug, repair) instances
Adjacency labeling schemes and induced-universal graphs
We describe a way of assigning labels to the vertices of any undirected graph
on up to vertices, each composed of bits, such that given the
labels of two vertices, and no other information regarding the graph, it is
possible to decide whether or not the vertices are adjacent in the graph. This
is optimal, up to an additive constant, and constitutes the first improvement
in almost 50 years of an bound of Moon. As a consequence, we
obtain an induced-universal graph for -vertex graphs containing only
vertices, which is optimal up to a multiplicative constant,
solving an open problem of Vizing from 1968. We obtain similar tight results
for directed graphs, tournaments and bipartite graphs
- …