8,169 research outputs found

    Semi-analytic results for quasi-normal frequencies

    Full text link
    The last decade has seen considerable interest in the quasi-normal frequencies [QNFs] of black holes (and even wormholes), both asymptotically flat and with cosmological horizons. There is wide agreement that the QNFs are often of the form omega_n = (offset) + i n (gap), though some authors have encountered situations where this behaviour seems to fail. To get a better understanding of the general situation we consider a semi-analytic model based on a piecewise Eckart (Poeschl-Teller) potential, allowing for different heights and different rates of exponential falloff in the two asymptotic directions. This model is sufficiently general to capture and display key features of the black hole QNFs while simultaneously being analytically tractable, at least for asymptotically large imaginary parts of the QNFs. We shall derive an appropriate "quantization condition" for the asymptotic QNFs, and extract as much analytic information as possible. In particular, we shall explicitly verify that the (offset)+ i n (gap) behaviour is common but not universal, with this behaviour failing unless the ratio of rates of exponential falloff on the two sides of the potential is a rational number. (This is "common but not universal" in the sense that the rational numbers are dense in the reals.) We argue that this behaviour is likely to persist for black holes with cosmological horizons.Comment: V1: 28 pages, no figures. V2: 3 references added, no physics changes. V3: 29 pages, 9 references added, no physics changes; V4: reformatted, now 27 pages. Some clarifications, comparison with results obtained by monodromy techniques. This version accepted for publication in JHEP. V5: Minor typos fixed. Compatible with published versio

    Vertex importance extension of betweenness centrality algorithm

    Get PDF
    Variety of real-life structures can be simplified by a graph. Such simplification emphasizes the structure represented by vertices connected via edges. A common method for the analysis of the vertices importance in a network is betweenness centrality. The centrality is computed using the information about the shortest paths that exist in a graph. This approach puts the importance on the edges that connect the vertices. However, not all vertices are equal. Some of them might be more important than others or have more significant influence on the behavior of the network. Therefore, we introduce the modification of the betweenness centrality algorithm that takes into account the vertex importance. This approach allows the further refinement of the betweenness centrality score to fulfill the needs of the network better. We show this idea on an example of the real traffic network. We test the performance of the algorithm on the traffic network data from the city of Bratislava, Slovakia to prove that the inclusion of the modification does not hinder the original algorithm much. We also provide a visualization of the traffic network of the city of Ostrava, the Czech Republic to show the effect of the vertex importance adjustment. The algorithm was parallelized by MPI (http://www.mpi-forum.org/) and was tested on the supercomputer Salomon (https://docs.it4i.cz/) at IT4Innovations National Supercomputing Center, the Czech Republic.808726

    DNA repair biomarkers XPF and phospho-MAPKAP kinase 2 correlate with clinical outcome in advanced head and neck cancer.

    Get PDF
    BackgroundInduction chemotherapy is a common therapeutic option for patients with locoregionally-advanced head and neck cancer (HNC), but it remains unclear which patients will benefit. In this study, we searched for biomarkers predicting the response of patients with locoregionally-advanced HNC to induction chemotherapy by evaluating the expression pattern of DNA repair proteins.MethodsExpression of a panel of DNA-repair proteins in formalin-fixed paraffin embedded specimens from a cohort of 37 HNC patients undergoing platinum-based induction chemotherapy prior to definitive chemoradiation were analyzed using quantitative immunohistochemistry.ResultsWe found that XPF (an ERCC1 binding partner) and phospho-MAPKAP Kinase 2 (pMK2) are novel biomarkers for HNSCC patients undergoing platinum-based induction chemotherapy. Low XPF expression in HNSCC patients is associated with better response to induction chemoradiotherapy, while high XPF expression correlates with a worse response (p = 0.02). Furthermore, low pMK2 expression was found to correlate significantly with overall survival after induction plus chemoradiation therapy (p = 0.01), suggesting that pMK2 may relate to chemoradiation therapy.ConclusionsWe identified XPF and pMK2 as novel DNA-repair biomarkers for locoregionally-advanced HNC patients undergoing platinum-based induction chemotherapy prior to definitive chemoradiation. Our study provides insights for the use of DNA repair biomarkers in personalized diagnostics strategies. Further validation in a larger cohort is indicated

    Weakly supervised segmentation from extreme points

    Full text link
    Annotation of medical images has been a major bottleneck for the development of accurate and robust machine learning models. Annotation is costly and time-consuming and typically requires expert knowledge, especially in the medical domain. Here, we propose to use minimal user interaction in the form of extreme point clicks in order to train a segmentation model that can, in turn, be used to speed up the annotation of medical images. We use extreme points in each dimension of a 3D medical image to constrain an initial segmentation based on the random walker algorithm. This segmentation is then used as a weak supervisory signal to train a fully convolutional network that can segment the organ of interest based on the provided user clicks. We show that the network's predictions can be refined through several iterations of training and prediction using the same weakly annotated data. Ultimately, our method has the potential to speed up the generation process of new training datasets for the development of new machine learning and deep learning-based models for, but not exclusively, medical image analysis.Comment: Accepted at the MICCAI Workshop for Large-scale Annotation of Biomedical data and Expert Label Synthesis, Shenzen, China, 201

    Semiparametric Multivariate Accelerated Failure Time Model with Generalized Estimating Equations

    Full text link
    The semiparametric accelerated failure time model is not as widely used as the Cox relative risk model mainly due to computational difficulties. Recent developments in least squares estimation and induced smoothing estimating equations provide promising tools to make the accelerate failure time models more attractive in practice. For semiparametric multivariate accelerated failure time models, we propose a generalized estimating equation approach to account for the multivariate dependence through working correlation structures. The marginal error distributions can be either identical as in sequential event settings or different as in parallel event settings. Some regression coefficients can be shared across margins as needed. The initial estimator is a rank-based estimator with Gehan's weight, but obtained from an induced smoothing approach with computation ease. The resulting estimator is consistent and asymptotically normal, with a variance estimated through a multiplier resampling method. In a simulation study, our estimator was up to three times as efficient as the initial estimator, especially with stronger multivariate dependence and heavier censoring percentage. Two real examples demonstrate the utility of the proposed method
    • …
    corecore