检索结果-内蒙古大学图书馆

Music, Computing, and Health: A Roadmap for the Current and Future Roles of Music Technology for Health Care and Well-Being

引用

Music and science 2021年 4卷

作者： Agres, Kat R. Schaefer, Rebecca S. Volk, Anja van Hooren, Susan Holzapfel, Andre Dalla Bella, Simone Müller, Meinard de Witte, Martina Herremans, Dorien Ramirez Melendez, Rafael Neerincx, Mark Ruiz, Sebastian Meredith, David Dimitriadis, Theo Magee, Wendy L. Yong Siew Toh Conservatory of Music National University of Singapore Singapore Social and Cognitive Computing Department Institute of High Performance Computing A*STAR Singapore Institute for Psychology Health Medical Neuropsychology Unit Leiden University Leiden Netherlands Leiden Institute for Brain and Cognition Leiden University Leiden Netherlands Academy of Creative and Performing Arts Leiden University Leiden Netherlands Department of Information and Computing Sciences Utrecht University Utrecht Netherlands Faculty of Health care Department of Arts Therapies Zuyd University of Applied Sciences Heerlen Netherlands KenVaK Research Centre for the Arts Therapies and Psychomotricity Heerlen Netherlands Faculty of Psychology Open University of The Netherlands Heerlen Netherlands Division of Media Technology and Interaction Design KTH Royal Institute of Technology Stockholm Sweden International Laboratory for Brain Music and Sound Research (BRAMS) Outremont QC Canada Department of Psychology University of Montreal Montreal QC Canada Centre for Research on Brain Language and Music (CRBLM) Montreal QC Canada University of Economics and Human Sciences in Warsaw Warsaw Poland International Audio Laboratories Erlangen Friedrich-Alexander Universität Erlangen-Nürnberg Erlangen Germany HAN University of Applied Sciences Department of Arts Therapies and Psychological Studies Nijmegen Netherlands University of Amsterdam Research Institute of Child Development and Education Amsterdam Netherlands Treatment Centre for People with Mild Intellectual Disabilities and Psychiatric and Behavioral Disorders Gennep Netherlands Information Systems Technology and Design Singapore University of Technology and Design Singapore Music and Machine Learning Lab Music Technology Group Universitat Pompeu Fabra Barcelona Spain Faculty of EEMCS Interactive Intelligence Group Delft University of Technology Delft Netherlands Centre for Digital Music School of Electronic Engineerin

The fields of music, health, and technology have seen significant interactions in recent years in developing music technology for health care and well-being. In an effort to strengthen the collaboration between the involved disciplines, the workshop “Music, Computing, and Health” was held to discuss best practices and state-of-the-art at the intersection of these areas with researchers from music psychology and neuroscience, music therapy, music information retrieval, music technology, medical technology (medtech), and robotics. Following the discussions at the workshop, this article provides an overview of the different methods of the involved disciplines and their potential contributions to developing music technology for health and well-being. Furthermore, the article summarizes the state of the art in music technology that can be applied in various health scenarios and provides a perspective on challenges and opportunities for developing music technology that (1) supports person-centered care and evidence-based treatments, and (2) contributes to developing standardized, large-scale research on music-based interventions in an interdisciplinary manner. The article provides a resource for those seeking to engage in interdisciplinary research using music-based computational methods to develop technology for health care, and aims to inspire future research directions by evaluating the state of the art with respect to the challenges facing each field. © The Author(s) 2021.

关键词： health care interdisciplinarity MedTech music information retrieval (MIR) music neuroscience Music psychology music technology music therapy well-being

来源：评论

学校读者我要写书评

暂无评论

Using English as pivot to extract Persian-Italian parallel sentences from non-parallel corpora

arXiv

引用

arXiv 2017年

作者： Ansari, Ebrahim Sadreddini, M.H. Sheikhalishahi, Mostafa Wallace, Richard Alimardani, Fatemeh Zanjan Iran Department of Computer Science and Engineering Shiraz University Shiraz Iran Department of Mathematics and Informatics University of Calabria Rende Italy Distributed Systems Architecture Research Group Complutense University Madrid Spain

The effectiveness of a statistical machine translation system (SMT) is very dependent upon the amount of parallel corpus used in the training phase. For low-resource language pairs there are not enough parallel corpora to build an accurate SMT. In this paper, a novel approach is presented to extract bilingual Persian-Italian parallel sentences from a non-parallel (comparable) corpus. In this study, English is used as the pivot language to compute the matching scores between source and target sentences and candidate selection phase. Additionally, a new monolingual sentence similarity metric, Normalized Google Distance (NGD) is proposed to improve the matching process. Moreover, some extensions of the baseline system are applied to improve the quality of extracted sentences measured with BLEU. Experimental results show that using the new pivot based extraction can increase the quality of bilingual corpus significantly and consequently improves the performance of the Persian-Italian SMT system. Copyright © 2017, The Authors. All rights reserved.

关键词： computer aided language translation

来源：评论

学校读者我要写书评

暂无评论

Forbidden time travel: Characterization of time-consistent tree reconciliation maps

arXiv

引用

arXiv 2017年

作者： Nøjgaard, Nikolai Geiß, Manuela Stadler, Peter F. Merkle, Daniel Wieseke, Nicolas Hellmuth, Marc Dpt. of Mathematics and Computer Science University of Greifswald Walther- Rathenau-Strasse 47 GreifswaldD-17487 Saarland University Center for Bioinformatics Building e 2.1 P.O. Box 151150 SaarbrückenD-66041 Bioinformatics Group Department of Computer Science Interdisciplinary Center of Bioinformatics University of Leipzig Härtelstraße 16-18 LeipzigD-04107 Germany Department of Mathematics and Computer Science University of Southern Denmark Max-Planck-Institute for Mathematics in the Sciences Inselstraße 22 LeipzigD-04103 Germany Inst. F. Theoretical Chemistry University of Vienna Währingerstraße 17 WienA-1090 Austria Santa Fe Institute 1399 Hyde Park Rd. Santa Fe United States Parallel Computing and Complex Systems Group Department of Computer Science Leipzig University Augustusplatz 10 Leipzig04109 Germany

Motivation: In the absence of horizontal gene transfer it is possible to reconstruct the history of gene families from empirically determined orthology relations, which are equivalent to eventlabeled gene trees. Knowledge of the event labels considerably simplifies the problem of reconciling a gene tree T with a species trees S, relative to the reconciliation problem without prior knowledge of the event types. It is well-known that optimal reconciliations in the unlabeled case may violate time-consistency and thus are not biologically feasible. Here we investigate the mathematical structure of the event labeled reconciliation problem with horizontal transfer. Results: We investigate the issue of time-consistency for the event-labeled version of the reconciliation problem, provide a convenient axiomatic framework, and derive a complete characterization of time-consistent reconciliations. This characterization depends on certain weak conditions on the event-labeled gene trees that reflect conditions under which evolutionary events are observable at least in principle. We give an O(|V(T)|log(|V (S)|))-time algorithm to decide whether a time-consistent reconciliation map exists. It does not require the construction of explicit timing maps, but relies entirely on the comparably easy task of checking whether a small auxiliary graph is acyclic. Significance: The combinatorial characterization of time consistency and thus biologically feasible reconciliation is an important step towards the inference of gene family histories with horizontal transfer from orthology data, i.e., without presupposed gene and species trees. The fast algorithm to decide time consistency is useful in a broader context because it constitutes an attractive component for all tools that address tree reconciliation problems. Copyright © 2017, The Authors. All rights reserved.

关键词： Genes

来源：评论

学校读者我要写书评

暂无评论

BioTIME 2.0: Expanding and Improving a Database of Biodiversity Time Series

引用

Global Ecology and Biogeography 2025年第5期34卷

作者： Maria Dornelas Laura H. Antão Amanda E. Bates Viviana Brambilla Jonathan M. Chase Cher F. Y. Chow Ada Fontrodona-Eslava Anne E. Magurran Inês S. Martins Faye Moyes Alban Sagouis Samuel Adu-Acheampong Daniel Acquah-Lamptey Dušan Adam Penelope A. Ajani Aitor Albaina Pablo Almaraz Jeongseop An Roger Sigismund Anderson Madelaine Jean Robertson Anderson Alexsander Z. Antunes Ivan Arismendi Linda Armbrecht Pedro Aros-Mardones Sreejith Kalpuzha Ashtamoorthy Narayanan Ayyappan Gal Badihi Joseph J. Bailey Andrew H. Baird Mark Edward Baird Sreekumar Vadakkethil Balakrishnan José António L. Barão-Nóbrega Adi Barash Miguel Barbosa Jos Barlow Claus Bässler Matthieu Beaumont Natalie Beenaerts Tiago Octavio Begot Wallace Beiroz Ricardo Beldade David M. Bell Alecia Bellgrove Jonathan Belmaker Lisandro Benedetti-Cecchi Cassandra E. Benkwitt Pamela Medina-van Berkum Brandon T. Bestelmeyer Matthew G. Betts Maxwell Kelvin Billah Anne D. Bjorkman Magdalena Błażewicz Christopher P. Bloch Shane A. Blowes Antonio Bode Juliano A. Bogoni Thomas Bolger Timothy C. Bonebrake Erik Bonsdorff Roberta Bottarin Luke N. Brokensha Rob W. Brooker Andrew J. Brooks Helge Bruelheide Thiago Almeida Bueno Claire Laguionie Mariana Lopes Campagnoli James Cant Erica Pellegrini Caramaschi Alexandre Caron Tadhg Carroll Tancredi Caruso Juan Carvajal-Quintero Giuseppe Castaldelli Edward Castañeda-Moya Pedro V. Castilho Sonia Zanini Cechin Shahar Chaikin Uchangi Manjunatha Chandrashekara Tory J. Chase Chaolun Allen Chen Jorge José Cherem Sei-Woong Choi Erica M. Christensen Alexander V. Christianini Jackson Wing Four Chu Peter Coad Carl Van Colen Lise Comte Elisabeth J. Cooper J. Hans C. Cornelissen Eddy Cosson Unai Cotano Luc Crevecoeur Shannan Kyle Crow Graeme S. Cumming Vanessa S. Daga Gabriella Damasceno Gergana N. Daskalova Claire H. Davies Robert A. Davis Frank P. Day Sussy De-La-Zerda Amy Elizabeth Deacon Indradatta de Castro-Arrazola Steven Degraer Kharran Deonarinesingh Juan C. Diaz-Ricaurte Christopher R. Dickman Tara Dirilgen Ciaran John Dolan J. Emmet Centre for Biological Diversity School of Biology University of St Andrews Fife UK MARE—Centro de Ciências do Mar e do Ambiente Faculdade de Ciências Universidade de Lisboa Lisboa Portugal Research Centre for Ecological Change Organismal and Evolutionary Biology Research Programme Faculty of Biological and Environmental Sciences University of Helsinki Helsinki Finland Department of Biology University of Victoria Victoria British Columbia Canada German Centre for Integrative Biodiversity Research (iDiv) Halle-Jena-Leipzig Leipzig Germany Department of Computer Science Martin Luther University Halle-Wittenberg Halle (Saale) Germany Leverhulme Centre for Anthropocene Biodiversity Department of Biology University of York York UK Department of Animal Biology and Conservation Science University of Ghana Accra Ghana Philipps Universität Marburg Marburg Germany Department of Forest Ecology Silva Tarouca Research Institute Brno Czech Republic School of Life Sciences University of Technology Sydney Sydney New South Wales Australia Zoology and Animal Cell Biology Department University of the Basque Country (UPV/EHU) Leioa Spain Grupo de Oceanografía de Ecosistemas Instituto de Ciencias Marinas de Andalucía CSIC Campus Universitario de Puerto Real Puerto Real Spain National Institute of Ecology Seocheon Republic of Korea African Regional Postgraduate Programme in Insect Science University of Ghana Accra Ghana Département de Biologie Université de Sherbrooke Sherbrooke Quebec Canada Núcleo de Conservação da Biodiversidade Instituto de Pesquisas Ambientais Secretaria de Meio Ambiente Infraestrutura e Logística do Estado de São Paulo São Paulo Brazil Department of Fisheries Wildlife and Conservation Sciences Oregon State University Corvallis Oregon USA Institute for Marine and Antarctic Studies Ecology & Biodiversity Centre University of Tasmania Hobart Tasmania Australia Graduate Program in Oceanography Department of Oceanography Faculty of Natural Scienc

Motivation Here, we make available a second version of the BioTIME database, which compiles records of abundance estimates for species in sample events of ecological assemblages through time. The updated version expands version 1.0 of the database by doubling the number of studies and includes substantial additional curation to the taxonomic accuracy of the records, as well as the metadata. Moreover, we now provide an R package (BioTIMEr) to facilitate use of the database. Main Types of Variables Included The database is composed of one main data table containing the abundance records and 11 metadata tables. The data are organised in a hierarchy of scales where 11,989,233 records are nested in 1,603,067 sample events, from 553,253 sampling locations, which are nested in 708 studies. A study is defined as a sampling methodology applied to an assemblage for a minimum of 2 years. Spatial Location and Grain Sampling locations in BioTIME are distributed across the planet, including marine, terrestrial and freshwater realms. Spatial grain size and extent vary across studies depending on sampling methodology. We recommend gridding of sampling locations into areas of consistent size. Time Period and Grain The earliest time series in BioTIME start in 1874, and the most recent records are from 2023. Temporal grain and duration vary across studies. We recommend doing sample-level rarefaction to ensure consistent sampling effort through time before calculating any diversity metric. Major Taxa and Level of Measurement The database includes any eukaryotic taxa, with a combined total of 56,400 taxa. Software Format csv and. SQL.

关键词： assemblage biodiversity community database ecoinformatics species taxa time

来源：评论

学校读者我要写书评

暂无评论

Reconstructing gene trees from Fitch's xenology relation

arXiv

引用

arXiv 2017年

作者： Geiß, Manuela Anders, John Stadler, Peter F. Wieseke, Nicolas Hellmuth, Marc Bioinformatics Group Department of Computer Science Interdisciplinary Center of Bioinformatics University of Leipzig Härtelstraße 16-18 LeipzigD-04107 Germany Dpt. of Mathematics and Computer Science University of Greifswald Walther- Rathenau-Strasse 47 GreifswaldD-17487 Germany Saarland University Center for Bioinformatics Building E 2.1 P.O. Box 151150 SaarbrückenD-66041 Germany Max-Planck-Institute for Mathematics in the Sciences Inselstraße 22 LeipzigD-04103 Germany Inst. f. Theoretical Chemistry University of Vienna Währingerstraße 17 WienA-1090 Austria Santa Fe Institute 1399 Hyde Park Rd. Santa Fe United States Parallel Computing and Complex Systems Group Department of Computer Science Leipzig University Augustusplatz 10 Leipzig04109 Germany

Two genes are xenologs in the sense of Fitch if they are separated by at least one horizontal gene transfer event. Horizonal gene transfer is asymmetric in the sense that the transferred copy is distinguished from the one that remains within the ancestral lineage. Hence xenology is more precisely thought of as a non-symmetric relation: y is xenologous to x if y has been horizontally transferred at least once since it diverged from the least common ancestor of x and y. We show that xenology relations are characterized by a small set of forbidden induced subgraphs on three vertices. Furthermore, each xenology relation can be derived from a unique least-resolved edge-labeled phylogenetic tree. We provide a linear-time algorithm for the recognition of xenology relations and for the construction of its least-resolved edge-labeled phylogenetic tree. The fact that being a xenology relation is a heritable graph property, finally has far-reaching consequences on approximation problems associated with xenology relations. Copyright © 2017, The Authors. All rights reserved.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

From event labeled gene trees to species trees

arXiv

引用

arXiv 2017年

作者： Hernandez-Rosales, Maribel Hellmuth, Marc Wieseke, Nicolas Huber, Katharina T. Moulton, Vincent Stadler, Peter F. Dpt. of Mathematics and Computer Science University of Greifswald Walther- Rathenau-Strasse 47 GreifswaldD-17487 Saarland University Center for Bioinformatics Building e 2.1 P.O. Box 151150 SaarbrückenD-66041 Bioinformatics Group Department of Computer Science Interdisciplinary Center of Bioinformatics University of Leipzig Härtelstraße 16-18 LeipzigD-04107 Germany School of Computing Sciences University of East Anglia NorwichNR4 7TJ United Kingdom Max-Planck-Institute for Mathematics in the Sciences Inselstraße 22 LeipzigD-04103 Germany Inst. F. Theoretical Chemistry University of Vienna Währingerstraße 17 WienA-1090 Austria Santa Fe Institute 1399 Hyde Park Rd. Santa Fe United States Parallel Computing and Complex Systems Group Department of Computer Science Leipzig University Augustusplatz 10 Leipzig04109 Germany

Background: Tree reconciliation problems have long been studied in phylogenetics. A particular variant of the reconciliation problem for a gene tree T and a species tree S assumes that for each interior vertex x of T it is known whether x represents a speciation or a duplication. This problem appears in the context of analyzing orthology data. Results: We show that S is a species tree for T if and only if S displays all rooted triples of T that have three distinct species as their leaves and are rooted in a speciation vertex. A valid reconciliation map can then be found in polynomial time. Simulated data shows that the event-labeled gene trees convey a large amount of information on underlying species trees, even for a large percentage of losses. Conclusions: The knowledge of event labels in a gene tree strongly constrains the possible species tree and, for a given species tree, also the possible reconciliation maps. Nevertheless, many degrees of freedom remain in the space of feasible solutions. In order to disambiguate the alternative solutions additional external constraints as well as optimization criteria could be employed. Copyright © 2017, The Authors. All rights reserved.

关键词： Polynomial approximation

来源：评论

学校读者我要写书评

暂无评论

Studying bioluminescence flashes with the ANTARES deep Sea neutrino telescope

arXiv

引用

arXiv 2021年

作者： Reeb, Nico Hutschenreuter, S. Zehetner, P. Ensslin, T. Albert, A. Alves, S. André, M. Anghinolfi, M. Anton, G. Ardid, M. Aubert, J.-J. Aublin, J. Baret, B. Basa, S. Belhorma, B. Bendahman, M. Bertin, V. Biagi, S. Bissinger, M. Boumaaza, J. Bouta, M. Bouwhuis, M.C. Brânzaş, H. Bruijn, R. Brunner, J. Busto, J. Caiffi, B. Capone, A. Caramete, L. Carr, J. Carretero, V. Celli, S. Chabab, M. Chau, T.N. Chiarusi, T. Circella, M. Coleiro, A. Colomer-Molla, M. Coniglione, R. Coyle, P. Creusot, A. Díaz, A.F. de Wasseige, G. Deschamps, A. Distefano, C. Di Palma, I. Domi, A. Donzaud, C. Dornic, D. Drouhin, D. van Eeden, T. Enzenhöfer, A. Fermani, P. Ferrara, G. Filippini, F. Fusco, L. Gatelet, Y. Gay, P. Glotin, H. Gozzini, R. Ruiz, R. Gracia Graf, K. Guidi, C. Hallmann, S. van Haren, H. Heijboer, A.J. Hello, Y. Hernández-Rey, J.J. Hößl, J. Hofestädt, J. Huang, F. Illuminati, G. James, C.W. Jisse-Jung, B. de Jong, M. de Jong, P. Jongen, M. Kadler, M. Kalekin, O. Katz, U. Khan-Chowdhury, N.R. Kouchner, A. Kreykenbohm, I. Kulikovskiy, V. Lahmann, R. Le Breton, R. Lefèvre, D. Leonora, E. Levi, G. Lincetto, M. Lopez-Coto, D. Loucatos, S. Maderer, L. Manczak, J. Marcelin, M. Margiotta, A. Marinelli, A. Martínez-Mora, J.A. Melis, K. Migliozzi, P. Moussa, A. Muller, R. Nauta, L. Navas, S. Nezri, E. Fearraigh, B.Ó. Organokov, M. Pavalaş, G.E. Pellegrino, C. Perrin-Terrin, M. Piattelli, P. Pieterse, C. Poirè, C. Popa, V. Pradier, T. Randazzo, N. Reck, S. Riccobene, G. Romanov, A. Sánchez-Losa, A. Greus, F. Salesa Samtleben, D.F.E. Sanguineti, M. Sapienza, P. Schnabel, J. Schumann, J. Schüssler, F. Spurio, M. Stolarczyk, Th. Taiuti, M. Tingay, S.J. Vallage, B. van Elewyck, V. Versari, F. Viola, S. Vivolo, D. Wilms, J. Zavatarelli, S. Zegarelli, A. Zornoza, J.D. Zúñiga, J. Information Field Theory Group Max Planck Institute for Astrophysics Garching Germany Informatics 6 Chair of Robotics Artificial Intelligence and Real time Systems Technical University of Munich Garching Germany Department of Astrophysics IMAPP Radboud University Nijmegen Nijmegen Netherlands Department of Physics Ludwig-Maximilians University Munich Germany CERN Geneva Switzerland Université de Strasbourg CNRS IPHC UMR 7178 StrasbourgF-67000 France Université de Haute Alsace MulhouseF-68200 France IFIC - Instituto de Física Corpuscular CSIC Universitat de València c/ Catedrático José Beltrán 2 Paterna ValenciaE-46980 Spain Technical University of Catalonia Laboratory of Applied Bioacoustics Rambla Exposició Vilanova i la Geltrú Barcelona08800 Spain INFN - Sezione di Genova Via Dodecaneso 33 Genova16146 Italy Friedrich-Alexander-Universität Erlangen-Nürnberg Erlangen Centre for Astroparticle Physics Erwin-Rommel-Str. 1 Erlangen91058 Germany Universitat Politècnica de València C/ Paranimf 1 Gandia46730 Spain Aix Marseille Univ CNRS IN2P3 CPPM Marseille France Université de Paris CNRS Astroparticule et Cosmologie ParisF-75013 France Aix Marseille Univ CNRS CNES LAM Marseille France National Center for Energy Sciences and Nuclear Techniques B.P.1382 RabatR. P. 10001 Morocco University Mohammed V in Rabat Faculty of Sciences 4 av. Ibn Battouta B.P. 1014 R.P. Rabat10000 Morocco Via S. Sofia 62 Catania95123 Italy University Mohammed I Laboratory of Physics of Matter and Radiations B.P.717 Oujda6000 Morocco Nikhef Science Park Amsterdam Netherlands Institute of Space Science Bucharest MagureleRO-077125 Romania Universiteit van Amsterdam Instituut voor Hoge-Energie Fysica Science Park 105 Amsterdam1098 XG Netherlands INFN - Sezione di Roma P.le Aldo Moro 2 Roma00185 Italy Dipartimento di Fisica Università La Sapienza P.le Aldo Moro 2 Roma00185 Italy LPHEA Faculty of Science - Semlali Cadi Ayyad University P.O

We develop a novel technique to exploit the extensive data sets provided by underwater neutrino telescopes to gain information on bioluminescence in the deep sea. The passive nature of the telescopes gives us the unique opportunity to infer information on bioluminescent organisms without actively interfering with them. We propose a statistical method that allows us to reconstruct the light emission of individual organisms, as well as their location and movement. A mathematical model is built to describe the measurement process of underwater neutrino telescopes and the signal generation of the biological organisms. The Metric Gaussian Variational Inference algorithm is used to reconstruct the model parameters using photon counts recorded by the neutrino detectors. We apply this method to synthetic data sets and data collected by the ANTARES neutrino telescope. The telescope is located 40 km off the French coast and fixed to the sea floor at a depth of 2475 m. The runs with synthetic data reveal that we can reliably model the emitted bioluminescent flashes of the organisms. Furthermore, we find that the spatial resolution of the localization of light sources highly depends on the configuration of the telescope. Precise measurements of the efficiencies of the detectors and the attenuation length of the water are crucial to reconstruct the light emission. Finally, the application to ANTARES data reveals the first precise localizations of bioluminescent organisms using neutrino telescope data. © 2021, CC BY.

关键词： Bioluminescence

来源：评论

学校读者我要写书评

暂无评论

Cograph editing: Merging modules is equivalent to editing P4s

arXiv

引用

arXiv 2017年

作者： Fritz, Adrian Hellmuth, Marc Wieseke, Nicolas Stadler, Peter F. Computational Biology of Infection Research Helmholtz Centre for Infection Research Inhoffenstraße 7 BraunschweigD-38124 Germany University of Greifswald Dpt. of Mathematics and Computer Science Walther- Rathenau-Strasse 47 GreifswaldD-17487 Germany Saarland University Center for Bioinformatics Building e 2.1 P.O. Box 151150 SaarbrückenD-66041 Germany Parallel Computing and Complex Systems Group Department of Computer Science University of Leipzig Augustusplatz 10 LeipzigD-04109 Germany Bioinformatics Group Department of Computer Science Interdisciplinary Center of Bioinformatics University of Leipzig Härtelstraße 16-18 LeipzigD-04107 Germany Max-Planck-Institute for Mathematics in the Sciences Inselstraße 22 LeipzigD-04103 Germany Inst. F. Theoretical Chemistry University of Vienna Währingerstraße 17 WienA-1090 Austria Santa Fe Institute 1399 Hyde Park Rd. Santa FeNM87501 United States

The modular decomposition of a graph G = (V;E) does not contain prime modules if and only if G is a cograph, that is, if no quadruple of vertices induces a simple connected path P4. The cograph editing problem consists in inserting into and deleting from G a set F of edges so that H = (V,EΔF) is a cograph and |F| is minimum. This NP-hard combinatorial optimization problem has recently found applications, e.g., in the context of phylogenetics. Efficient heuristics are hence of practical importance. The simple characterization of cographs in terms of their modular decomposition suggests that instead of editing G one could operate directly on the modular decomposition. We show here that editing the induced P4s is equivalent to resolving prime modules by means of a suitable defined merge operation on the submodules. Moreover, we characterize so-called module-preserving edit sets and demonstrate that optimal pairwise sequences of module-preserving edit sets exist for every non-cograph. This eventually leads to an exact algorithm for the cograph editing problem. In addition, we provide two heuristics with time complexity O(|V|3), resp., O(|V|2). Copyright © 2017, The Authors. All rights reserved.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

Erratum to: Search for dark matter produced in association with a leptonically decaying Z boson in proton–proton collisions at s = 13 Te

引用

The European Physical Journal C 2021年第4期81卷 1-16页

作者： A. M. Sirunyan A. Tumasyan W. Adam T. Bergauer M. Dragicevic J. Erö A. Escalante Del Valle R. Frühwirth M. Jeitler N. Krammer L. Lechner D. Liko T. Madlener I. Mikulec F. M. Pitters N. Rad J. Schieck R. Schöfbeck M. Spanring S. Templ W. Waltenberger C.-E. Wulz M. Zarucki V. Chekhovsky A. Litomin V. Makarenko J. Suarez Gonzalez M. R. Darwish E. A. De Wolf D. Di Croce X. Janssen T. Kello A. Lelek M. Pieters H. Rejeb Sfar H. Van Haevermaet P. Van Mechelen S. Van Putte N. Van Remortel F. Blekman E. S. Bols S. S. Chhibra J. D’Hondt J. De Clercq D. Lontkovskyi S. Lowette I. Marchesini S. Moortgat A. Morton Q. Python S. Tavernier W. Van Doninck P. Van Mulders D. Beghin B. Bilin B. Clerbaux G. De Lentdecker B. Dorney L. Favart A. Grebenyuk A. K. Kalsi I. Makarenko L. Moureaux L. Pétré A. Popov N. Postiau E. Starling L. Thomas C. Vander Velde P. Vanlaer D. Vannerom L. Wezenbeek T. Cornelis D. Dobur M. Gruchala I. Khvastunov M. Niedziela C. Roskas K. Skovpen M. Tytgat W. Verbeke B. Vermassen M. Vit G. Bruno F. Bury C. Caputo P. David C. Delaere M. Delcourt I. S. Donertas A. Giammanco V. Lemaitre K. Mondal J. Prisciandaro A. Taliercio M. Teklishyn P. Vischia S. Wuyckens J. Zobec G. A. Alves C. Hensel A. Moraes W. L. Aldá Júnior E. Belchior Batista Das Chagas H. BRANDAO MALBOUISSON W. Carvalho J. Chinellato E. Coelho E. M. Da Costa G. G. Da Silveira D. De Jesus Damiao S. Fonseca De Souza J. Martins D. Matos Figueiredo M. Medina Jaime C. Mora Herrera L. Mundim H. Nogima P. Rebello Teles L. J. Sanchez Rosas A. Santoro S. M. Silva Do Amaral A. Sznajder M. Thiel F. Torres Da Silva De Araujo A. Vilela Pereira C. A. Bernardes L. Calligaris T. R. Fernandez Perez Tomei E. M. Gregores D. S. Lemos P. G. Mercadante S. F. Novaes Sandra S. Padula A. Aleksandrov G. Antchev I. Atanasov R. Hadjiiska P. Iaydjiev M. Misheva M. Rodozov M. Shopova G. Sultanov M. Bonchev A. Dimitrov T. Ivanov L. Litov B. Pavlov P. Petkov A. Petrov W. Fang Q. Guo H. Wang L. Yuan M. Ahmad Z. Hu Y. Wang E. Chapon G. M. Chen H. S. Chen M. Chen A. Kapoor D. Leggat H. Yerevan Physics Institute Yerevan Armenia Institut für Hochenergiephysik Vienna Austria Vienna University of Technology Vienna Austria Institute for Nuclear Problems Minsk Belarus Universiteit Antwerpen Antwerpen Belgium Department of Basic and Applied Sciences Faculty of Engineering Arab Academy for Science Technology and Maritime Transport Alexandria Egypt Université Libre de Bruxelles Bruxelles Belgium Vrije Universiteit Brussel Brussel Belgium Ghent University Ghent Belgium IRFU CEA Université Paris-Saclay Gif-sur-Yvette France Université Catholique de Louvain Louvain-la-Neuve Belgium Centro Brasileiro de Pesquisas Fisicas Rio de Janeiro Brazil Universidade do Estado do Rio de Janeiro Rio de Janeiro Brazil Universidade Estadual de Campinas Campinas Brazil Federal University of Rio Grande do Sul Porto Alegre Brazil UFMS Nova Andradina Brazil Universidade Federal de Pelotas Pelotas Brazil Universidade Estadual Paulista Universidade Federal do ABC São Paulo Brazil Institute for Nuclear Research and Nuclear Energy Bulgarian Academy of Sciences Sofia Bulgaria University of Sofia Sofia Bulgaria Beihang University Beijing China Department of Physics Tsinghua University Beijing China Institute of High Energy Physics Beijing China University of Chinese Academy of Sciences Beijing China State Key Laboratory of Nuclear Physics and Technology Peking University Beijing China Sun Yat-Sen University Guangzhou China Institute of Modern Physics and Key Laboratory of Nuclear Physics and Ion-beam Application (MOE) - Fudan University Shanghai China Zhejiang University Hangzhou China Universidad de Los Andes Bogota Colombia Universidad de Antioquia Medellin Colombia University of Split Faculty of Electrical Engineering Mechanical Engineering and Naval Architecture Split Croatia University of Split Faculty of Science Split Croatia Institute Rudjer Boskovic Zagreb Croatia Institute for Theoretical and Experimental Physics named by A.I. Alikhanov of NRC ‘K

A Correction to this paper has been published: https://***/10.1140/epjc/s10052-020-08739-5

关键词：

来源：评论

学校读者我要写书评

暂无评论

Erratum to: Search for heavy Higgs bosons decaying to a top quark pair in proton-proton collisions at s = 13 TeV

引用

Journal of High Energy Physics 2022年第3期2022卷 1-21页

作者： Sirunyan, A. M. Tumasyan, A. Adam, W. Ambrogi, F. Bergauer, T. Brandstetter, J. Dragicevic, M. Erö, J. Escalante Del Valle, A. Flechl, M. Frühwirth, R. Jeitler, M. Krammer, N. Krätschmer, I. Liko, D. Madlener, T. Mikulec, I. Rad, N. Schieck, J. Schöfbeck, R. Spanring, M. Spitzbart, D. Waltenberger, W. Wulz, C.-E. Zarucki, M. Drugakov, V. Mossolov, V. Suarez Gonzalez, J. Darwish, M. R. De Wolf, E. A. Di Croce, D. Janssen, X. Lauwers, J. Lelek, A. Pieters, M. Rejeb Sfar, H. Van Haevermaet, H. Van Mechelen, P. Van Putte, S. Van Remortel, N. Blekman, F. Bols, E. S. Chhibra, S. S. D’Hondt, J. De Clercq, J. Lontkovskyi, D. Lowette, S. Marchesini, I. Moortgat, S. Moreels, L. Python, Q. Skovpen, K. Tavernier, S. Van Doninck, W. Van Mulders, P. Van Parijs, I. Beghin, D. Bilin, B. Brun, H. Clerbaux, B. De Lentdecker, G. Delannoy, H. Dorney, B. Favart, L. Grebenyuk, A. Kalsi, A. K. Luetic, J. Popov, A. Postiau, N. Starling, E. Thomas, L. Vander Velde, C. Vanlaer, P. Vannerom, D. Cornelis, T. Dobur, D. Khvastunov, I. Niedziela, M. Roskas, C. Trocino, D. Tytgat, M. Verbeke, W. Vermassen, B. Vit, M. Zaganidis, N. Bondu, O. Bruno, G. Caputo, C. David, P. Delaere, C. Delcourt, M. Giammanco, A. Lemaitre, V. Magitteri, A. Prisciandaro, J. Saggio, A. Vidal Marono, M. Vischia, P. Zobec, J. Alves, F. L. Alves, G. A. Correia Silva, G. Hensel, C. Moraes, A. Rebello Teles, P. Belchior Batista Das Chagas, E. Carvalho, W. Chinellato, J. Coelho, E. Da Costa, E. M. Da Silveira, G. G. De Jesus Damiao, D. De Oliveira Martins, C. Fonseca De Souza, S. Huertas Guativa, L. M. Malbouisson, H. Martins, J. Matos Figueiredo, D. Medina Jaime, M. Melo De Almeida, M. Mora Herrera, C. Mundim, L. Nogima, H. Prado Da Silva, W. L. Sanchez Rosas, L. J. Santoro, A. Sznajder, A. Thiel, M. Tonelli Manganote, E. J. Torres Da Silva De Araujo, F. Vilela Pereira, A. Ahuja, S. Bernardes, C. A. Calligaris, L. Fernandez Perez Tomei, T. R. Gregores, E. M. Lemos, D. S. Mercadante, P. G. Novaes, S. F. Padula, Sandra S. Aleksandrov, A. Antchev, G. Hadjiiska, R. Iaydjiev, Yerevan Physics Institute Yerevan Armenia Institut für Hochenergiephysik Wien Austria Vienna University of Technology Vienna Austria Institute for Nuclear Problems Minsk Belarus Universiteit Antwerpen Antwerpen Belgium Vrije Universiteit Brussel Brussel Belgium Université Libre de Bruxelles Bruxelles Belgium Ghent University Ghent Belgium IRFU CEA Université Paris-Saclay Gif-sur-Yvette France Université Catholique de Louvain Louvain-la-Neuve Belgium Centro Brasileiro de Pesquisas Fisicas Rio de Janeiro Brazil Universidade do Estado do Rio de Janeiro Rio de Janeiro Brazil Universidade Estadual de Campinas Campinas Brazil Federal University of Rio Grande do Sul Porto Alegre Brazil UFMS Nova Andradina Brazil Universidade Federal de Pelotas Pelotas Brazil Universidade Estadual Paulista São Paulo Brazil Universidade Federal do ABC São Paulo Brazil Institute for Nuclear Research and Nuclear Energy Bulgarian Academy of Sciences Sofia Bulgaria University of Sofia Sofia Bulgaria Beihang University Beijing China Department of Physics Tsinghua University Beijing China Institute of High Energy Physics Beijing China University of Chinese Academy of Sciences Beijing China State Key Laboratory of Nuclear Physics and Technology Peking University Beijing China Universidad de Los Andes Bogota Colombia Universidad de Antioquia Medellin Colombia University of Split Faculty of Electrical Engineering Mechanical Engineering and Naval Architecture Split Croatia University of Split Faculty of Science Split Croatia Institute Rudjer Boskovic Zagreb Croatia Institute for Theoretical and Experimental Physics named by A.I. Alikhanov of NRC ‘Kurchatov Institute’ Moscow Russia University of Cyprus Nicosia Cyprus Charles University Prague Czech Republic Joint Institute for Nuclear Research Dubna Russia Escuela Politecnica Nacional Quito Ecuador Universidad San Francisco de Quito Quito Ecuador Cairo University Cairo Egypt Academy of Scientific Research and Technolog

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：