1,191 research outputs found
Calculation of hyperfine splitting in mesons using configuration interaction approach
The spin - spin mass splitting of light, heavy and mixed mesons are described
within a good accuracy in the potential model with screened potential. We
conclude that the long - distance part of the potential cannot be pure scalar
and that a vector - scalar mixture is favoured. With the same parameters which
gives correct average mass spectrum excellent spin - spin splittings of heavy
quarkonia is obtained. The results are obtained by going beyond usually used
perturbation method, namely using configuration interaction approach.Comment: 8 pages, LaTe
Assessment of contemporary Arctic river runoff based on observational discharge records
We describe the contemporary hydrography of the panâArctic land area draining into the Arctic Ocean, northern Bering Sea, and Hudson Bay on the basis of observational records of river discharge and computed runoff. The Regional Arctic Hydrographic Network data set, RâArcticNET, is presented, which is based on 3754 recording stations drawn from Russian, Canadian, European, and U.S. archives. RâArcticNET represents the single largest data compendium of observed discharge in the Arctic. Approximately 73% of the nonglaciated area of the panâArctic is monitored by at least one river discharge gage giving a mean gage density of 168 gages per 106 km2. Average annual runoff is 212 mm yrâ1 with approximately 60% of the river discharge occurring from April to July. Gridded runoff surfaces are generated for the gaged portion of the panâArctic region to investigate global change signals. Siberia and Alaska showed increases in winter runoff during the 1980s relative to the 1960s and 1970s during annual and seasonal periods. These changes are consistent with observations of change in the climatology of the region. Western Canada experienced decreased spring and summer runoff
Disease course, frequency of relapses and survival of 73 patients with juvenile or adult dermatomyositis
Objective
Our aim is to present the disease course, frequency of relapses and survival of juvenile and adult dermatomyositis (JDM/DM) patients.
Methods
Analysis was performed using data on 73 patients. The median follow-up for 38 JDM patients was 32 months and 78 months for 35 adult DM patients.
Results
23/38 JDM patients (60%) had monophasic, 12/38 (31.6%) had polycyclic and 3138 (7.9%) had chronic disease. Among children treated only with glucocorticoids, 12/20 (60%) had monophasic and 8/20 (40%) had polycyclic disease. 10/17 (58.8%) children, who required second-line immunosuppressive agents, had monophasic and 4/17 (23.5%) had polycyclic disease. 18/35 DM (51.4%) patients had monophasic, 13/35 (37.1%) had polycyclic, 1/35 (2.9%) had chronic disease and 3135 (8.6%) had fulminant myositis. Among DM patients requiring only glucocorticoids, 12/20 (60%) were monophasic and 8/20 (40%) were polycyclic. In patients requiring second-line immunosuppressive agents, 6/15 patients (40%) had monophasic and 5/15 (33.3%) had polycyclic disease. Among patients with polycyclic disease, the risk of relapse was higher during first year than later in the disease course. None of the JDM patients have died, while 4 disease-specific deaths occurred in adult patients. There was no significant difference between the survival of JDM and DM patients.
Discussion
There was no correlation between relapse-free survival and the initial therapeutic regimen. Many of our patients had polycyclic or chronic disease. As relapses can occur after a prolonged disease-free interval, patients should be followed for at least 2 years. Although we found a favourable survival rate, further investigations are needed to assess functional outcome
Secrecy Results for Compound Wiretap Channels
We derive a lower bound on the secrecy capacity of the compound wiretap
channel with channel state information at the transmitter which matches the
general upper bound on the secrecy capacity of general compound wiretap
channels given by Liang et al. and thus establishing a full coding theorem in
this case. We achieve this with a stronger secrecy criterion and the maximum
error probability criterion, and with a decoder that is robust against the
effect of randomisation in the encoding. This relieves us from the need of
decoding the randomisation parameter which is in general not possible within
this model. Moreover we prove a lower bound on the secrecy capacity of the
compound wiretap channel without channel state information and derive a
multi-letter expression for the capacity in this communication scenario.Comment: 25 pages, 1 figure. Accepted for publication in the journal "Problems
of Information Transmission". Some of the results were presented at the ITW
2011 Paraty [arXiv:1103.0135] and published in the conference paper available
at the IEEE Xplor
Maximizing Maximal Angles for Plane Straight-Line Graphs
Let be a plane straight-line graph on a finite point set
in general position. The incident angles of a vertex
of are the angles between any two edges of that appear consecutively in
the circular order of the edges incident to .
A plane straight-line graph is called -open if each vertex has an
incident angle of size at least . In this paper we study the following
type of question: What is the maximum angle such that for any finite set
of points in general position we can find a graph from a certain
class of graphs on that is -open? In particular, we consider the
classes of triangulations, spanning trees, and paths on and give tight
bounds in most cases.Comment: 15 pages, 14 figures. Apart of minor corrections, some proofs that
were omitted in the previous version are now include
- âŠ