1,975 research outputs found

    Wave functions and annihilation widths of heavy quarkonia

    Full text link
    Within the framework of nonrelativistic quark-antiquark Cornell potential model formalism, we study the annihilation of heavy quarkonia. We determine their annihilation widths resulting into γγ\gamma\gamma, gggg, 3γ3\gamma, 3g3g and γgg\gamma gg and compare our findings with the available theoretical results and experimental data. We also provide the charge radii and absolute square of radial Schr\"odinger wave function at zero quark-antiquark separation.Comment: 2 figures, 6 table

    Patient-reported outcome measure for children and young people with amelogenesis imperfecta

    Get PDF
    Background: Amelogenesis imperfecta (AI) is a genetic enamel defect that can affect both the primary and permanent dentition. It has a range of clinical phenotypes, and children and young people often present with challenging oral health needs. Patient-reported outcome measures (PROMs) can identify key patient concerns. Methods: This was a multi-centre service evaluation across several specialist paediatric dentistry services in the UK. A PROM questionnaire was created with clinician and patient input, through peer review with the national AI Clinical Excellence Network, as well as piloting the PROM with ten children and young people with AI. The final PROM questionnaire was distributed to all patients with AI attending each unit between January and March 2020. Results: Sixty children and young people (aged 5-17 years) across four specialist units participated, with 72% reporting that they 'often' or 'sometimes' experienced pain or sensitivity and 76% reporting that they 'often' or 'sometimes' felt unhappy with the way their teeth look. Of the patients who were post-treatment, 81% indicated that they were happy with their teeth, compared to just 41% of patients who were mid-treatment and 33% of patients who were pre-treatment. Conclusion: Children and young people with AI experience a range of issues related to their function and psychosocial wellbeing. This simple PROM demonstrates the range of issues this group of patients face, and could be used to monitor an individual's progress to ensure that treatment is planned to address the patient's individual concerns and needs

    Covering problems in edge- and node-weighted graphs

    Full text link
    This paper discusses the graph covering problem in which a set of edges in an edge- and node-weighted graph is chosen to satisfy some covering constraints while minimizing the sum of the weights. In this problem, because of the large integrality gap of a natural linear programming (LP) relaxation, LP rounding algorithms based on the relaxation yield poor performance. Here we propose a stronger LP relaxation for the graph covering problem. The proposed relaxation is applied to designing primal-dual algorithms for two fundamental graph covering problems: the prize-collecting edge dominating set problem and the multicut problem in trees. Our algorithms are an exact polynomial-time algorithm for the former problem, and a 2-approximation algorithm for the latter problem, respectively. These results match the currently known best results for purely edge-weighted graphs.Comment: To appear in SWAT 201

    Parameter estimation in spatially extended systems: The Karhunen-Loeve and Galerkin multiple shooting approach

    Get PDF
    Parameter estimation for spatiotemporal dynamics for coupled map lattices and continuous time domain systems is shown using a combination of multiple shooting, Karhunen-Loeve decomposition and Galerkin's projection methodologies. The resulting advantages in estimating parameters have been studied and discussed for chaotic and turbulent dynamics using small amounts of data from subsystems, availability of only scalar and noisy time series data, effects of space-time parameter variations, and in the presence of multiple time-scales.Comment: 11 pages, 5 figures, 4 Tables Corresponding Author - V. Ravi Kumar, e-mail address: [email protected]
    corecore