31,971 research outputs found
Cluster vs Single-Spin Algorithms -- Which are More Efficient?
A comparison between single-cluster and single-spin algorithms is made for
the Ising model in 2 and 3 dimensions. We compare the amount of computer time
needed to achieve a given level of statistical accuracy, rather than the speed
in terms of site updates per second or the dynamical critical exponents. Our
main result is that the cluster algorithms become more efficient when the
system size, , exceeds, -- for and --
for . The exact value of the crossover is dependent upon the computer
being used. The lower end of the crossover range is typical of workstations
while the higher end is typical of vector computers. Hence, even for
workstations, the system sizes needed for efficient use of the cluster
algorithm is relatively large.Comment: 13pages, postscript file, HLRZ 21/9
Momentum-Dependent Hybridization Gap and dispersive in-gap state of The Kondo Semiconductor SmB6
We report the temperature-dependent three-dimensional angle-resolved
photoemission spectra of the Kondo semiconductor SmB. We found a difference
in the temperature dependence of the peaks at the X and points, due to
hybridization between the Sm 5d conduction band and the nearly localized Sm 4f
state. The peak intensity at the X point has the same temperature dependence as
the valence transition below 120 K, while that at the point is
consistent with the magnetic excitation at Q=(0.5,0.5,0.5) below 30 K. This
suggests that the hybridization with the valence transition mainly occurs at
the X point, and the initial state of the magnetic excitation is located at the
point.Comment: 5 pages, 3 figure
Exact Parametrization of Majorana Neutrino Mass Matrix with Large Mixing
Under the assumption that the neutrinos are Majorana particles we study how
the lepton mass matrices can be transformed into the simple form which has the
same physical quantities by removing redundant parameters. We propose the exact
parametrization of the lepton mass matrices which reflects the small nu_e-nu_mu
mixing and the large nu_mu-nu_tau mixing. The relations between the twelve
parameters and the physical quantities are shown. Furthermore we calculate the
MNS matrix by applying the assumptions used in the quark sector. Finally we
also check the validity of these assumptions from the experimental values.Comment: 11 pages, LaTeX, no figure
Electromagnetic Hadronic Form-Factors
We present a calculation of the nucleon electromagnetic form-factors as well
as the pion and rho to pion transition form-factors in a hybrid calculation
with domain wall valence quarks and improved staggered (Asqtad) sea quarks.Comment: 3 pages, 5 figures, Lattice2004(spectrum
Reconfiguration of Dominating Sets
We explore a reconfiguration version of the dominating set problem, where a
dominating set in a graph is a set of vertices such that each vertex is
either in or has a neighbour in . In a reconfiguration problem, the goal
is to determine whether there exists a sequence of feasible solutions
connecting given feasible solutions and such that each pair of
consecutive solutions is adjacent according to a specified adjacency relation.
Two dominating sets are adjacent if one can be formed from the other by the
addition or deletion of a single vertex.
For various values of , we consider properties of , the graph
consisting of a vertex for each dominating set of size at most and edges
specified by the adjacency relation. Addressing an open question posed by Haas
and Seyffarth, we demonstrate that is not necessarily
connected, for the maximum cardinality of a minimal dominating set
in . The result holds even when graphs are constrained to be planar, of
bounded tree-width, or -partite for . Moreover, we construct an
infinite family of graphs such that has exponential
diameter, for the minimum size of a dominating set. On the positive
side, we show that is connected and of linear diameter for any
graph on vertices having at least independent edges.Comment: 12 pages, 4 figure
Reconfiguration on sparse graphs
A vertex-subset graph problem Q defines which subsets of the vertices of an
input graph are feasible solutions. A reconfiguration variant of a
vertex-subset problem asks, given two feasible solutions S and T of size k,
whether it is possible to transform S into T by a sequence of vertex additions
and deletions such that each intermediate set is also a feasible solution of
size bounded by k. We study reconfiguration variants of two classical
vertex-subset problems, namely Independent Set and Dominating Set. We denote
the former by ISR and the latter by DSR. Both ISR and DSR are PSPACE-complete
on graphs of bounded bandwidth and W[1]-hard parameterized by k on general
graphs. We show that ISR is fixed-parameter tractable parameterized by k when
the input graph is of bounded degeneracy or nowhere-dense. As a corollary, we
answer positively an open question concerning the parameterized complexity of
the problem on graphs of bounded treewidth. Moreover, our techniques generalize
recent results showing that ISR is fixed-parameter tractable on planar graphs
and graphs of bounded degree. For DSR, we show the problem fixed-parameter
tractable parameterized by k when the input graph does not contain large
bicliques, a class of graphs which includes graphs of bounded degeneracy and
nowhere-dense graphs
The structure and possible origins of stacking faults in gamma-yttrium disilicate
Parallel stacking faults on (010) planes are frequently observed in hot-pressed Y2Si2O7. A combination of conventional dark-field imaging and high-resolution transmission electron microscopy was used to investigate the structure of these faults and it was found that they consist of the repeat of one layer of the two layer γ-Y2Si2O7 structure with an associated in-plane rigid body displacement. The resulting structure was confirmed by image simulation of high-resolution images from two perpendicular projections. A model for the formation of the stacking faults is proposed as a consequence of a transformation from β-Y2Si2O7 to γ-Y2Si2O7 in the hot pressing
The conditional process model of mindfulness and emotion regulation: An empirical test
BACKGROUND: The conditional process model (CPM) of mindfulness and emotion regulation posits that specific mediators and moderators link these constructs to mental health outcomes. The current study empirically examined the central tenets of the CPM, which posit that nonreactivity moderates the indirect effect of observation on symptoms of emotional disorders through cognitive emotion regulation strategies. METHODS: A clinical sample (n=1667) of individuals from Japan completed a battery of self-report instruments. Several path analyses were conducted to determine whether cognitive emotion regulation strategies mediate the relationship between observation and symptoms of individual emotional disorders, and to determine whether nonreactivity moderated these indirect effects. RESULTS: Results provided support the CPM. Specifically, nonreactivity moderated the indirect effect of observation on symptoms through reappraisal, but it did not moderate the indirect effect of observation on symptoms through suppression. LIMITATIONS: Causal interpretations are limited, and cultural considerations must be acknowledged given the Japanese sample CONCLUSIONS: These results underscore the potential importance of nonreactivity and emotion regulation as targets for interventions.R01 AT007257 - NCCIH NIH HHS; R34 MH099311 - NIMH NIH HH
The origin of planetary impactors in the inner solar system
New insights into the history of the inner solar system are derived from the
impact cratering record of the Moon, Mars, Venus and Mercury, and from the size
distributions of asteroid populations. Old craters from a unique period of
heavy bombardment that ended 3.8 billion years ago were made by asteroids
that were dynamically ejected from the main asteroid belt, possibly due to the
orbital migration of the giant planets. The impactors of the past 3.8
billion years have a size distribution quite different from the main belt
asteroids, but very similar to the population of near-Earth asteroids.Comment: 12 pages (including 4 figures
- …