656 research outputs found

    Theoretical Sensitivity Analysis for Quantitative Operational Risk Management

    Full text link
    We study the asymptotic behavior of the difference between the values at risk VaR(L) and VaR(L+S) for heavy tailed random variables L and S for application in sensitivity analysis of quantitative operational risk management within the framework of the advanced measurement approach of Basel II (and III). Here L describes the loss amount of the present risk profile and S describes the loss amount caused by an additional loss factor. We obtain different types of results according to the relative magnitudes of the thicknesses of the tails of L and S. In particular, if the tail of S is sufficiently thinner than the tail of L, then the difference between prior and posterior risk amounts VaR(L+S) - VaR(L) is asymptotically equivalent to the expectation (expected loss) of S.Comment: 21 pages, 1 figure, 4 tables, forthcoming in International Journal of Theoretical and Applied Finance (IJTAF

    On Symbolic Ultrametrics, Cotree Representations, and Cograph Edge Decompositions and Partitions

    Full text link
    Symbolic ultrametrics define edge-colored complete graphs K_n and yield a simple tree representation of K_n. We discuss, under which conditions this idea can be generalized to find a symbolic ultrametric that, in addition, distinguishes between edges and non-edges of arbitrary graphs G=(V,E) and thus, yielding a simple tree representation of G. We prove that such a symbolic ultrametric can only be defined for G if and only if G is a so-called cograph. A cograph is uniquely determined by a so-called cotree. As not all graphs are cographs, we ask, furthermore, what is the minimum number of cotrees needed to represent the topology of G. The latter problem is equivalent to find an optimal cograph edge k-decomposition {E_1,...,E_k} of E so that each subgraph (V,E_i) of G is a cograph. An upper bound for the integer k is derived and it is shown that determining whether a graph has a cograph 2-decomposition, resp., 2-partition is NP-complete

    Ultrametric spaces of branches on arborescent singularities

    Get PDF
    Let SS be a normal complex analytic surface singularity. We say that SS is arborescent if the dual graph of any resolution of it is a tree. Whenever A,BA,B are distinct branches on SS, we denote by ABA \cdot B their intersection number in the sense of Mumford. If LL is a fixed branch, we define UL(A,B)=(LA)(LB)(AB)1U_L(A,B)= (L \cdot A)(L \cdot B)(A \cdot B)^{-1} when ABA \neq B and UL(A,A)=0U_L(A,A) =0 otherwise. We generalize a theorem of P{\l}oski concerning smooth germs of surfaces, by proving that whenever SS is arborescent, then ULU_L is an ultrametric on the set of branches of SS different from LL. We compute the maximum of ULU_L, which gives an analog of a theorem of Teissier. We show that ULU_L encodes topological information about the structure of the embedded resolutions of any finite set of branches. This generalizes a theorem of Favre and Jonsson concerning the case when both SS and LL are smooth. We generalize also from smooth germs to arbitrary arborescent ones their valuative interpretation of the dual trees of the resolutions of SS. Our proofs are based in an essential way on a determinantal identity of Eisenbud and Neumann.Comment: 37 pages, 16 figures. Compared to the first version on Arxiv, il has a new section 4.3, accompanied by 2 new figures. Several passages were clarified and the typos discovered in the meantime were correcte

    Open and Hidden Charm Production in 920 GeV Proton-Nucleus Collisions

    Full text link
    The HERA-B collaboration has studied the production of charmonium and open charm states in collisions of 920 GeV protons with wire targets of different materials. The acceptance of the HERA-B spectrometer covers negative values of xF up to xF=-0.3 and a broad range in transverse momentum from 0.0 to 4.8 GeV/c. The studies presented in this paper include J/psi differential distributions and the suppression of J/psi production in nuclear media. Furthermore, production cross sections and cross section ratios for open charm mesons are discussed.Comment: 5 pages, 9 figures, to be published in the proceedings of the 6th International Conference on Hyperons, Charm & Beauty Hadrons (BEACH04), Chicago, IL, June 27 - July 3, 200

    Randomized, double blind study of non-excitatory, cardiac contractility modulation electrical impulses fr symptomatic heart failure

    Get PDF
    AIMS: We performed a randomized, double blind, crossover study of cardiac contractility modulation (CCM) signals in heart failure patients. METHODS AND RESULTS: One hundred and sixty-four subjects with ejection fraction (EF) < 35% and NYHA Class II (24%) or III (76%) symptoms received a CCM pulse generator. Patients were randomly assigned to Group 1 (n = 80, CCM treatment 3 months, sham treatment second 3 months) or Group 2 (n = 84, sham treatment 3 months, CCM treatment second 3 months). The co-primary endpoints were changes in peak oxygen consumption (VO2,peak) and Minnesota Living with Heart Failure Questionnaire (MLWHFQ). Baseline EF (29.3 +/- 6.7% vs. 29.8 +/- 7.8%), VO2,peak (14.1 +/- 3.0 vs. 13.6 +/- 2.7 mL/kg/min), and MLWHFQ (38.9 +/- 27.4 vs. 36.5 +/- 27.1) were similar between the groups. VO2,peak increased similarly in both groups during the first 3 months (0.40 +/- 3.0 vs. 0.37 +/- 3.3 mL/kg/min, placebo effect). During the next 3 months, VO2,peak decreased in the group switched to sham (-0.86 +/- 3.06 mL/kg/min) and increased in patients switched to active treatment (0.16 +/- 2.50 mL/kg/min). MLWHFQ trended better with treatment (-12.06 +/- 15.33 vs. -9.70 +/- 16.71) during the first 3 months, increased during the second 3 months in the group switched to sham (+4.70 +/- 16.57), and decreased further in patients switched to active treatment (-0.70 +/- 15.13). A comparison of values at the end of active treatment periods vs. end of sham treatment periods indicates statistically significantly improved VO2,peak and MLWHFQ (P = 0.03 for each parameter). CONCLUSION: In patients with heart failure and left ventricular dysfunction, CCM signals appear safe; exercise tolerance and quality of life (MLWHFQ) were significantly better while patients were receiving active treatment with CCM for a 3-month period

    Making Space, Making Place: Digital Togetherness and the Redefinition of Migrant Identities Online

    Get PDF
    Immigrants have played a fundamental role in shaping the life and form of urban public spaces for generations. Their efforts, as many scholars have observed, mostly aimed at creating places of comfort in new and sometimes hostile receiving countries. In recent years, the combined contribution of the built environment and screen-based experiences have shaped migrants’ sense of community and belonging, thus making the concept of online community central to ideas about space and public life. Drawing upon a 3-year online ethnography, the article discusses to what extent new media constitute spaces of digital togetherness, where diasporic experiences and transnational identities are constructed and negotiated. It presents a transnational model of creative media consumption, which helps give insight as to how diasporas and ethnic minorities contribute to the transformation of public space in the Digital Age

    Beyond representing orthology relations by trees

    Get PDF
    Reconstructing the evolutionary past of a family of genes is an important aspect of many genomic studies. To help with this, simple relations on a set of sequences called orthology relations may be employed. In addition to being interesting from a practical point of view they are also attractive from a theoretical perspective in that e.\,g.\,a characterization is known for when such a relation is representable by a certain type of phylogenetic tree. For an orthology relation inferred from real biological data it is however generally too much to hope for that it satisfies that characterization. Rather than trying to correct the data in some way or another which has its own drawbacks, as an alternative, we propose to represent an orthology relation δ\delta in terms of a structure more general than a phylogenetic tree called a phylogenetic network. To compute such a network in the form of a level-1 representation for δ\delta, we formalize an orthology relation in terms of the novel concept of a symbolic 3- dissimilarity which is motivated by the biological concept of a ``cluster of orthologous groups'', or COG for short. For such maps which assign symbols rather that real values to elements, we introduce the novel {\sc Network-Popping} algorithm which has several attractive properties. In addition, we characterize an orthology relation δ\delta on some set XX that has a level-1 representation in terms of eight natural properties for δ\delta as well as in terms of level-1 representations of orthology relations on certain subsets of XX

    Three-way symbolic tree-maps and ultrametrics

    Get PDF
    Three-way dissimilarities are a generalization of (two-way) dissimilarities which can be used to indicate the lack of homogeneity or resemblance between any three objects. Such maps have applications in cluster analysis and have been used in areas such as psychology and phylogenetics, where three-way data tables can arise. Special examples of such dissimilarities are three-way tree-metrics and ultrametrics, which arise from leaf-labelled trees with edges labelled by positive real numbers. Here we consider three-way maps which arise from leaf-labelled trees where instead the interior vertices are labelled by an arbitrary set of values. For unrooted trees, we call such maps three-way symbolic tree-maps; for rooted trees, we call them three-way symbolic ultrametrics since they can be considered as a generalization of the (two-way) symbolic ultrametrics of Bocker and Dress. We show that, as with two- and three-way tree-metrics and ultrametrics, three-way symbolic tree-maps and ultrametrics can be characterized via certain k-point conditions. In the unrooted case, our characterization is mathematically equivalent to one presented by Gurvich for a certain class of edge-labelled hypergraphs. We also show that it can be decided whether or not an arbitrary three-way symbolic map is a tree-map or a symbolic ultrametric using a triplet-based approach that relies on the so-called BUILD algorithm for deciding when a set of 3-leaved trees or triplets can be displayed by a single tree. We envisage that our results will be useful in developing new approaches and algorithms for understanding 3-way data, especially within the area of phylogenetics
    corecore