DOCSLIB.ORG

Computational Biology

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Computational Biology InspiredResearch Winter 2016 Issue 9 News from the Department of Computer Science, University of Oxford Computational FabulousBiology: Striving for Newexcellence Title– p17 ANNIV E R S A th R Y Welcome Professor Sir Tim Berners-Lee: Inventor of the World Wide Web, joins us – p3 Surveilling surveillance: Examining how smartphone apps track people – p26 Keeping Social Media Social: New video launched – p16 CompSciOxford DepartmentOfComputerScienceUniversityOfOxford Inspired Research Letter from the is a twice-yearly newsletter published by the Department of Computer Science at the University Head of Department of Oxford. If you would like to learn more about anything you read in these It’s official: Oxford is the best! At least, according pages, please get in touch: to the 2016 Times Higher Education world [email protected] university rankings. Oxford is the first UK To subscribe to future issues, university to achieve first position in this ranking, e-mail: [email protected] a huge coup for the whole institution, and a wonderful boost for our new Vice Chancellor, To download previous issues, visit Professor Louise Richardson. The announcement www.cs.ox.ac.uk/inspiredresearch made headline news in the UK, but the following week the THE gave us news that, to us in the Editorial board Department of Computer Science at least, was Suzanna Marsh (Editor) even more important. For the first time, the THE published a subject ranking of computer science departments, and Kiri Walden (Sub-Editor) according to this, Oxford is ranked third in the world (and first in the Suvarna Designs (Designer) UK). Perhaps that might not sound so impressive, but when one Benjamin Neal considers that our competition in the USA includes giants like MIT and Berkeley, this is a huge achievement. Daniel Marsden Emma Dunlop I am delighted to be able to confirm that Sir Tim Berners-Lee, inventor Faris Abou-Saleh of the World Wide Web, joins the Department of Computer Science as Jason RC Nurse a Professor. More on that on page 3. Leanne Carveth One of my main goals when I took over as Head of Department Martha Lewis two years ago was to increase our undergraduate intake, which in Maureen York practice means persuading more colleges to admit Computer Science Megan Schaible students. This process has to be done on a college-by-college basis, and there is no simple way to affect a step change. It is therefore Peter Jeavons very gratifying that I am able to report that Lady Margaret Hall, Sarah Baldwin Christ Church, Hertford, and Jesus Colleges have all agreed to admit Seyyed Shah undergraduate computer scientists in the years to come. This is but a Sharon Lloyd step – we still have a long way to go! Varun Kanade Whenever one writes an article of this type, there is a natural Will Smith temptation to simply list all the wonderful things that have happened to us since the last report, and you will have guessed that this is Contributors indeed the rule of thumb I use for the most part (see above!). However, Alex Rogers Michael Wooldridge it would be criminally negligent of me to write a report on the life of Arnau Erola Sir Nigel Shadbolt the department over the last six months without mentioning Brexit. David Gavaghan Paul Harrenstein Whatever one’s views on the rights and wrongs of Brexit, the simple truth is that research-led universities in 2016 must be international Emma Espinosa Prince Abudu in their outlook. We seek to attract the best students, irrespective Gabriel Inelus Reuben Binns of their origins, and the best academics, wherever they may be Helena Webb Sadie Cresse found. Anything that impedes this makes it harder for us to be as Ioannis Agrafiotis Seyyed Shah excellent as we can be. And quite apart from this, about 40% of Jassim Happa Thomas Gibson- our research income derives from EU sources – in particular, the Robinson Jim Davies wonderful European Research Council (ERC), which funds large scale Jun Zhao pure research projects on the sole basis of scientific excellence. Our Katherine Fletcher department has been the recipient of twelve ERC grants in total, a Laura Jones total which I believe exceeds that of any other UK Computer Science Maria Sueiro department. The ERC has been, in my opinion, the most important Max Van Kleek development for European science of the last century. It is painful Michael Goldsmith indeed to contemplate a future without it: there are challenging times ahead for UK universities. But amidst all the doubt and uncertainty, Cover image: Blanca Rodriguez continued on next page 2 Inspired Research: News from the Department of Computer Science, University of Oxford NEWS from previous page there is one thing that I am quite Sir Tim Berners-Lee certain about: the University of Oxford will not just continue joins the University of Oxford’s but will prosper in the years to come. And there is no institution, anywhere in the world, that I Department of Computer Science would rather work for – Brexit or no Brexit! Professor Sir Tim Berners-Lee, We are very much looking inventor of the World Wide Web, has forward to celebrating the joined the Department of Computer department’s 60th anniversary in Science at the University of Oxford 2017. (See page 8.) as a professor. Sir Tim, who has become a member of Christ Church, DEPARTMENT REVIEW 2016 will be undertaking research. Sir Tim is also a full-time professor One of the big changes in at the Massachusetts Institute of academic life since the 1980s Technology (MIT), in Massachusetts, is the ever increasing scrutiny USA, where he is based, and of our activity. As well as where he leads the Decentralized national activities such as the Information Group research. He will Research Excellence Framework, continue to shape the future of the universities typically organise Web as Director of both the World their own internal assessments, Wide Web Consortium (W3C) and and Oxford is no exception. Our the World Wide Web Foundation. last such evaluation, in 2010, made recommendations that Named as one of Time magazine’s have changed the department 100 Most Important People of the ‘Few living individuals have changed dramatically – the establishment 20th Century, Sir Tim is best known our world as profoundly as Tim of an algorithms research group as the inventor of the World Wide did, with his invention of the World being the most obvious example. Web. In 1989 he wrote a memo Wide Web’, said Head of Computer In June 2016 we underwent the called ‘Information Management: Science Professor Mike Wooldridge. latest such assessment. With A Proposal’ in which he married ‘We are delighted and honoured to a panel of external assessors, up hypertext with the Internet, to welcome Tim back to Oxford, and we submitted 130 pages of create a system for sharing and are tremendously excited about self-evaluation reports, critically distributing information globally. He what we will be able to do together assessing all aspects of our also created the first web browser, in the years to come.’ activity. This was followed by server and editor, and ensured that two visits by the panel, over 3 the technology was made freely The Dean of Christ Church, the Very days in total, where the panel available to everyone. Revd Professor Martyn Percy, said: had the opportunity to meet ‘we are delighted that Professor with staff and students. Despite Sir Tim graduated from the Sir Tim Berners-Lee will be joining the incredible amount of work University of Oxford with a first- us. As one of the most significant that such reviews entail, and class degree in Physics in 1976, innovators and scholars of our the stress that they inevitably and we are very glad that he has time, his work with us here in generate, I am pleased to report returned 40 years later to become Oxford will continue to consolidate that the review was an extremely a member of the Department of our standing as the world’s top positive event, with praise – and, Computer Science. Sir Tim is also university. Christ Church also of course, suggestions for further pleased to join, at Oxford, his long intends to appoint a new Associate improvement – offered across the time research collaborator Sir Professor in Computer Science to whole spectrum of our activities. Nigel Shadbolt, who was recently enhance our collaboration with the appointed Principal of Jesus Department, and hopes to offer at Professor ANNIV College, and with whom he co- least three undergraduate places E R S Michael Wooldridge A founded the Open Data Institute, per year in the subject.’ th R Y November 2016 London. www.cs.ox.ac.uk Issue 9 Winter 2016 3 NEWS News in brief Max Whitby, first year DPhil student, won the Best Student Paper Award at the DNA22 conference for the paper titled ‘Chemical Reaction Network Designs for Asynchronous Logic Circuits’. The paper proposed the first design for an asynchronous computing device using chemical reaction networks. Anna Muszkiewicz has been awarded an EPSRC Doctoral Prize. During her DPhil project, Anna has constructed multi- scale models of human atrial muscle cells and whole atria to investigate the role of the nNOS protein in human atrial electrophysiology. During the EPSRC Doctoral Prize project, Grant awarded The aim of this award is to accelerate Anna will design and conduct the use of computer simulation in silico drug trials for atrial for research into in the research of cardiotoxicity fibrillation using a population of cardiotoxicity and specific cardiac diseases human whole-atria computer such as myocardial infarction and models. heart failure. The team includes an The National Centre for the impressive list of collaborators from Replacement, Refinement & Oxford DPhil student Martin 11 countries including industry and Reduction of Animals in Research Strohmeier has been awarded academic scientists, clinicians and (known as NC3Rs) has just awarded an EPSRC Doctoral Prize.
Load more

Recommended publications
  • Complete Issue
    Volume 5, Issue 7, July 2015 Algorithms and Scheduling Techniques to Manage Resilience and Power Consumption in Distributed Systems (Dagstuhl Seminar 15281) Henri Casanova, Ewa Deelman, Yves Robert, and Uwe Schwiegelshohn ........... 1 The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 15301) Andrei A. Bulatov, Venkatesan Guruswami, Andrei Krokhin, and Dániel Marx . 22 Digital Scholarship and Open Science in Psychology and the Behavioral Sciences (Dagstuhl Perspectives Workshop 15302) Alexander Garcia Castro, Janna Hastings, Robert Stevens, and Erich Weichselgartner ....................................................... 42 DagstuhlReports,Vol.5,Issue7 ISSN2192-5283 ISSN 2192-5283 Published online and open access by Aims and Scope Schloss Dagstuhl – Leibniz-Zentrum für Informatik The periodical Dagstuhl Reports documents the GmbH, Dagstuhl Publishing, Saarbrücken/Wadern, program and the results of Dagstuhl Seminars and Germany. Online available at Dagstuhl Perspectives Workshops. http://www.dagstuhl.de/dagpub/2192-5283 In principal, for each Dagstuhl Seminar or Dagstuhl Perspectives Workshop a report is published that Publication date contains the following: January, 2016 an executive summary of the seminar program and the fundamental results, Bibliographic information published by the Deutsche an overview of the talks given during the seminar Nationalbibliothek (summarized as talk abstracts), and The Deutsche Nationalbibliothek lists this publica- summaries from working groups (if applicable). tion in the Deutsche Nationalbibliografie; detailed bibliographic data are available in the Internet at This basic framework can be extended by suitable http://dnb.d-nb.de. contributions that are related to the program of the seminar, e. g. summaries from panel discussions or License open problem sessions. This work is licensed under a Creative Commons Attribution 3.0 DE license (CC BY 3.0 DE).
    [Show full text]
  • COMPLEXITY CLASSIFICATION of EXACT and APPROXIMATE COUNTING PROBLEMS by Heng Guo a Dissertation Submitted in Partial Fulfillment
    COMPLEXITY CLASSIFICATION OF EXACT AND APPROXIMATE COUNTING PROBLEMS by Heng Guo A dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy (Computer Sciences) at the UNIVERSITY OF WISCONSIN–MADISON 2015 Date of final oral examination: 07/22/2015 The dissertation is approved by the following members of the Final Oral Committee: Jin-Yi Cai (Advisor), Professor Eric Bach, Professor Dieter van Melkebeek, Professor Shuchi Chawla, Associate Professor Sebastian Roch, Associate Professor © Copyright by Heng Guo 2015 All Rights Reserved i To my parents ii Acknowledgments First and foremost, I cannot express enough gratitude to Jin-Yi Cai, who has guided, advised, and tolerated me in the last five years. When I first came to Madison, I was an ambitious yet clueless young student. It is Jin-Yi who illustrated to me how to do research and solve problems. He also helped me to secure every possible opportunity: attending conferences, giving talks, visiting other institutions, and so on. His insights and knowledge helped me to develop my skill set, and his dedication and attitude inspired me to devote into academics. Truly my role model. There are also other people from whom I received wisdom and to whom I am in debt. Thanks to the hospitality of Leslie Ann Goldberg, I spent six amazing months in Oxford. It was a productive period full of wonderful events and stimulating discussions, and I enjoyed a lot the relaxed atmosphere there. Another big thanks goes to Pinyan Lu, whom I have been working with before and after starting my Ph.
    [Show full text]
  • A Complexity Trichotomy for Approximately Counting List H-Colourings‡§ 3
    A COMPLEXITY TRICHOTOMY FOR APPROXIMATELY COUNTING LIST H-COLOURINGS‡§ ANDREAS GALANIS∗, LESLIE ANN GOLDBERG∗, AND MARK JERRUM† Abstract. We examine the computational complexity of approximately counting the list H-colourings of a graph. We discover a natural graph-theoretic trichotomy based on the structure of the graph H. If H is an irreflexive bipartite graph or a reflexive complete graph then counting list H-colourings is trivially in polynomial time. Otherwise, if H is an irreflex- ive bipartite permutation graph or a reflexive proper interval graph then approximately counting list H-colourings is equivalent to #BIS, the problem of approximately counting independent sets in a bipartite graph. This is a well-studied problem which is believed to be of intermediate complexity – it is believed that it does not have an FPRAS, but that it is not as difficult as approximating the most difficult counting problems in #P. For every other graph H, approximately counting list H-colourings is complete for #P with respect to approximation-preserving reductions (so there is no FPRAS unless NP = RP). Two pleasing features of the trichotomy are (i) it has a natural formulation in terms of hereditary graph classes, and (ii) the proof is largely self-contained and does not require any universal algebra (unlike similar dichotomies in the weighted case). We are able to extend the hardness results to the bounded-degree setting, showing that all hardness results apply to input graphs with maximum degree at most 6. 1. Overview In this paper we study the complexity of approximately counting the list H-colourings of a graph.
    [Show full text]
  • The Complexity of Approximating Conservative Counting Csps
    This is a repository copy of The complexity of approximating conservative counting CSPs. White Rose Research Online URL for this paper: http://eprints.whiterose.ac.uk/89268/ Version: Accepted Version Article: Chen, X, Dyer, M orcid.org/0000-0002-2018-0374, Goldberg, LA et al. (4 more authors) (2015) The complexity of approximating conservative counting CSPs. Journal of Computer and System Sciences, 81 (1). pp. 311-329. ISSN 0022-0000 https://doi.org/10.1016/j.jcss.2014.06.006 © 2014, Elsevier. Licensed under the Creative Commons Attribution-NonCommercial- NoDerivatives 4.0 International http://creativecommons.org/licenses/by-nc-nd/4.0/ Reuse Items deposited in White Rose Research Online are protected by copyright, with all rights reserved unless indicated otherwise. They may be downloaded and/or printed for private study, or other acts as permitted by national copyright laws. The publisher or other rights holders may allow further reproduction and re-use of the full text version. This is indicated by the licence information on the White Rose Research Online record for the item. Takedown If you consider content in White Rose Research Online to be in breach of UK law, please notify us by emailing [email protected] including the URL of the record and the reason for the withdrawal request. [email protected] https://eprints.whiterose.ac.uk/ The complexity of approximating conservative counting CSPs∗ Xi Chen† Martin Dyer‡ Leslie Ann Goldberg§ Mark Jerrum¶ Pinyan Luk Colin McQuillan∗∗ David Richerby§ May 30, 2014 Abstract We study the complexity of approximately solving the weighted counting constraint satisfaction problem #CSP(F).
    [Show full text]
  • Inspiredresearch
    InspiredResearch Winter 2013 Issue 4 Research News from the Department of Computer Science, University of Oxford CITIES OF SLIME Computational Biology Group models bacteria to boost understanding of biofilm – p4 Facebook Photos: The Hidden message Student’s tool for hiding secret messages in Facebook photos hits headlines – p16 Nature flies in with a solution Distributed computing problem solved by studying how flies’ cells develop – p8 Chips with confidence Collaboration between Oxford and Intel to improve chips – p6 InSpired NEWS Research… Oxford sweeps up Prominent Paper is a twice-yearly newsletter published by the Department BCS accolades Award for artificial of Computer Science at Oxford University. intelligence research If you would like to learn more Thomas Lukasiewicz and his co- about anything you read in these Dr Boris Motik authors have won the prestigious pages please get in touch: AIJ Prominent Paper Award 2013 for Department of Computer Science, the paper ‘Combining answer set University of Oxford, Samson Abramsky FRS Prof. programming with description logics Wolfson Building, for the Semantic Web’. Parks Road, Oxford, OX1 3QD Two academics from Oxford’s This paper proposes dl-programs, a [email protected] Computer Science Department have been recognised by BCS, The formalism that integrates description Chartered Institute for IT, for their logics with rule-based logic programs outstanding contribution to the field. under answer set semantics. It Editorial board provides not only detailed theoretical Suzanna Marsh (editor) Dr Boris Motik has been named as the recipient of the BCS Roger analyses of these programs in Helen Wilcox (freelance editor) terms of their expressive power and Suvarna Designs (designer) Needham Award while Professor Samson Abramsky FRS has received computational complexities, but also Wendy Adams the BCS Lovelace Medal.
    [Show full text]
  • BEATCS No 119
    ISSN 0252–9742 Bulletin of the European Association for Theoretical Computer Science EATCS E A T C S Number 119 June 2016 Council of the European Association for Theoretical Computer Science President:Luca Aceto Iceland Vice Presidents:Paul Spirakis United Kingdom and Greece Antonin Kucera Czech Republic Giuseppe Persiano Italy Treasurer:Dirk Janssens Belgium Bulletin Editor:Kazuo Iwama Kyoto,Japan Lars Arge Denmark Anca Muscholl France Jos Baeten The Netherlands Luke Ong UK Lars Birkedal Denmark Catuscia Palamidessi France Mikolaj Bojanczyk Poland Giuseppe Persiano Italy Fedor Fomin Norway Alberto Policriti Italy Pierre Fraigniaud France Alberto Marchetti Spaccamela Italy Leslie Ann Goldberg UK Vladimiro Sassone UK Magnus Halldorsson Iceland Thomas Schwentick Germany Monika Henzinger Austria Jukka Suomela Finland Christos Kaklamanis Greece Thomas Wilke Germany Elvira Mayordomo Spain Peter Widmayer Switzerland Michael Mitzenmacher USA Gerhard Woeginger¨ The Netherlands Past Presidents: Maurice Nivat (1972–1977)Mike Paterson (1977–1979) Arto Salomaa (1979–1985)Grzegorz Rozenberg (1985–1994) Wilfred Brauer (1994–1997)Josep D´iaz (1997–2002) Mogens Nielsen (2002–2006)Giorgio Ausiello (2006–2009) Burkhard Monien (2009–2012) Secretary Office:Ioannis Chatzigiannakis Italy Efi Chita Greece EATCS Council Members email addresses Luca Aceto ..................................... [email protected] Lars Arge .............................. [email protected] Jos Baeten ............................... [email protected] Lars Birkedal ............................ [email protected] Mikolaj Bojanczyk .......................... [email protected] Fedor Fomin ................................ [email protected] Pierre Fraigniaud .. [email protected] Leslie Ann Goldberg ................ [email protected] Magnus Halldorsson ........................ [email protected] Monika Henzinger ................ [email protected] Kazuo Iwama ........................ [email protected] Dirk Janssens ........................
    [Show full text]
  • Combinatorial Aspects of Spatial Mixing and New Conditions for Pressure Representation
    Combinatorial aspects of spatial mixing and new conditions for pressure representation by Raimundo Jose´ Briceno˜ Dom´ınguez A THESIS SUBMITTED IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF DOCTOR OF PHILOSOPHY in The Faculty of Graduate and Postdoctoral Studies (Mathematics) THE UNIVERSITY OF BRITISH COLUMBIA (Vancouver) August 2016 c Raimundo Jose´ Briceno˜ Dom´ınguez 2016 Abstract Over the last few decades, there has been a growing interest in a measure-theore- tical property of Gibbs distributions known as strong spatial mixing (SSM). SSM has connections with decay of correlations, uniqueness of equilibrium states, ap- proximation algorithms for counting problems, and has been particularly useful for proving special representation formulas and the existence of efficient approx- imation algorithms for (topological) pressure. We look into conditions for the existence of Gibbs distributions satisfying SSM, with special emphasis in hard constrained models, and apply this for pressure representation and approximation d techniques in Z lattice models. Given a locally finite countable graph G and a finite graph H, we consider Hom(G ;H) the set of graph homomorphisms from G to H, and we study Gibbs measures supported on Hom(G ;H). We develop some sufficient and other neces- sary conditions on Hom(G ;H) for the existence of Gibbs specifications satisfying SSM (with exponential decay). In particular, we introduce a new combinatorial condition on the support of Gibbs distributions called topological strong spatial mixing (TSSM). We establish many useful properties of TSSM for studying SSM on systems with hard constraints, and we prove that TSSM combined with SSM is sufficient for having an efficient approximation algorithm for pressure.
    [Show full text]
  • 30Th International Symposium on Theoretical Aspects of Computer Science
    30th International Symposium on Theoretical Aspects of Computer Science STACS’13, February 27th to March 2nd, 2013, Kiel, Germany Edited by Natacha Portier Thomas Wilke LIPIcs – Vol. 20 – STACS’13 www.dagstuhl.de/lipics Editors Natacha Portier Thomas Wilke École Normale Supérieure de Lyon Christian-Albrechts-Universität zu Kiel Lyon Kiel [email protected] [email protected] ACM Classification 1998 F.1.1 Models of Computation, F.2.2 Nonnumerical Algorithms and Problems, F.4.1 Mathematical Logic, F.4.3 Formal Languages, G.2.1 Combinatorics, G.2.2 Graph Theory ISBN 978-3-939897-50-7 Published online and open access by Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, Saarbrücken/Wadern, Germany. Online available at http://www.dagstuhl.de/dagpub/978-3-939897-50-7. Publication date February, 2013 Bibliographic information published by the Deutsche Nationalbibliothek The Deutsche Nationalbibliothek lists this publication in the Deutsche Nationalbibliografie; detailed bibliographic data are available in the Internet at http://dnb.d-nb.de. License This work is licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported license (CC-BY- ND 3.0): http://creativecommons.org/licenses/by-nd/3.0/legalcode. In brief, this license authorizes each and everybody to share (to copy, distribute and transmit) the work under the following conditions, without impairing or restricting the authors’ moral rights: Attribution: The work must be attributed to its authors. No derivation: It is not allowed to alter or transform this work. The copyright is retained by the corresponding authors. Digital Object Identifier: 10.4230/LIPIcs.STACS.2013.i ISBN 978-3-939897-50-7 ISSN 1868-8969 http://www.dagstuhl.de/lipics iii LIPIcs – Leibniz International Proceedings in Informatics LIPIcs is a series of high-quality conference proceedings across all fields in informatics.
    [Show full text]
  • Arxiv:1305.6306V2 [Cs.CC] 27 Feb 2014 Image Ooopim from Homomorphisms H Olwn Opttoa Problem
    THE COMPLEXITY OF APPROXIMATELY COUNTING TREE HOMOMORPHISMS LESLIE ANN GOLDBERG AND MARK JERRUM ABSTRACT. We study two computationalproblems, parameterisedby a fixed tree H. #HOMSTO(H) is the problem of counting homomorphisms from an input graph G to H. #WHOMSTO(H) is the problem of counting weighted homomorphisms to H, given an input graph G and a weight function for each vertex v of G. Even though H is a tree, these problems turn out to be suf- ficiently rich to capture all of the known approximation behaviour in #P. We give a complete trichotomy for #WHOMSTO(H). If H is a star then #WHOMSTO(H) is in FP. If H is not a star but it does not contain a certain induced subgraph J3 then #WHOMSTO(H) is equivalent under approximation-preserving (AP) reductions to #BIS, the problem of counting independent sets in a bipartite graph. This problem is complete for the class #RHΠ1 under AP-reductions. Finally, if H contains an induced J3 then #WHOMSTO(H) is equivalent under AP-reductions to #SAT, the problem of counting satisfying assignments to a CNF Boolean formula. Thus, #WHOMSTO(H) is complete for #P under AP-reductions. The results are similar for #HOMSTO(H) except that a rich structure emerges if H contains an induced J3. We show that there are trees H for which #HOMSTO(H) is #SAT-equivalent (disproving a plausible conjecture of Kelk). However, it is still not known whether #HOMSTO(H) is #SAT-hard for every tree H which contains an induced J3. It turns out that there is an interesting connection between these homomorphism-counting problems and the problem of approximating the partition function of the ferromagnetic Potts model.
    [Show full text]
  • Novel Frameworks for Mining Heterogeneous and Dynamic
    Novel Frameworks for Mining Heterogeneous and Dynamic Networks A dissertation submitted to the Graduate School of the University of Cincinnati in partial fulfillment of the requirements for the degree of Doctor of Philosophy in the Department of Electrical and Computer Engineering and Computer Science of the College of Engineering by Chunsheng Fang B.E., Electrical Engineering & Information Science, June 2006 University of Science & Technology of China, Hefei, P.R.China Advisor and Committee Chair: Prof. Anca L. Ralescu November 3, 2011 Abstract Graphs serve as an important tool for discrete data representation. Recently, graph representations have made possible very powerful machine learning algorithms, such as manifold learning, kernel methods, semi-supervised learning. With the advent of large-scale real world networks, such as biological networks (disease network, drug target network, etc.), social networks (DBLP Co- authorship network, Facebook friendship, etc.), machine learning and data mining algorithms have found new application areas and have contributed to advance our understanding of proper- ties, and phenomena governing real world networks. When dealing with real world data represented as networks, two problems arise quite naturally: I) How to integrate and align the knowledge encoded in multiple and heterogeneous networks? For instance, how to find out the similar genes in co-disease and protein-protein inter- action networks? II) How to model and predict the evolution of a dynamic network? A real world exam- ple is, given N years snapshots of an evolving social network, how to build a model that can cap- ture the temporal evolution and make reliable prediction? In this dissertation, we present an innovative graph embedding framework, which identifies the key components of modeling the evolution in time of a dynamic graph.
    [Show full text]
  • Dagstuhl Reports, Volume 7, Issue 8, August 2017
    Volume 7, Issue 8, August 2017 Scalable Set Visualizations (Dagstuhl Seminar 17332) Yifan Hu, Luana Micallef, Martin Nöllenburg, and Peter Rodgers ................ 1 Computational Counting (Dagstuhl Seminar 17341) Ivona Bezáková, Leslie Ann Goldberg, and Mark R. Jerrum ...................... 23 SLEBOK: The Software Language Engineering Body of Knowledge (Dagstuhl Seminar 17342) Benoît Combemale, Ralf Lämmel, and Eric Van Wyk ............................ 45 Machine Learning and Formal Methods (Dagstuhl Seminar 17351) Sanjit A. Seshia, Xiaojin (Jerry) Zhu, Andreas Krause and Susmit Jha . 55 Analysis and Synthesis of Floating-point Programs (Dagstuhl Seminar 17352) Eva Darulova, Alastair F. Donaldson, Zvonimir Rakamarić, and Cindy Rubio-González ........................................................... 74 DagstuhlReports,Vol.7,Issue8 ISSN2192-5283 ISSN 2192-5283 Published online and open access by Aims and Scope Schloss Dagstuhl – Leibniz-Zentrum für Informatik The periodical Dagstuhl Reports documents the GmbH, Dagstuhl Publishing, Saarbrücken/Wadern, program and the results of Dagstuhl Seminars and Germany. Online available at Dagstuhl Perspectives Workshops. http://www.dagstuhl.de/dagpub/2192-5283 In principal, for each Dagstuhl Seminar or Dagstuhl Perspectives Workshop a report is published that Publication date contains the following: March, 2018 an executive summary of the seminar program and the fundamental results, Bibliographic information published by the Deutsche an overview of the talks given during the seminar Nationalbibliothek (summarized as talk abstracts), and The Deutsche Nationalbibliothek lists this publica- summaries from working groups (if applicable). tion in the Deutsche Nationalbibliografie; detailed bibliographic data are available in the Internet at This basic framework can be extended by suitable http://dnb.d-nb.de. contributions that are related to the program of the seminar, e.
    [Show full text]
  • The Complexity of Computing the Sign of the Tutte Polynomial∗
    SIAM J. COMPUT. c 2014 Society for Industrial and Applied Mathematics Vol. 43, No. 6, pp. 1921–1952 THE COMPLEXITY OF COMPUTING THE SIGN OF THE TUTTE POLYNOMIAL∗ LESLIE ANN GOLDBERG† AND MARK JERRUM‡ Abstract. We study the complexity of computing the sign of the Tutte polynomial of a graph. As there are only three possible outcomes (positive, negative, and zero), this seems at first sight more like a decision problem than a counting problem. Surprisingly, however, there are large regions of the parameter space for which computing the sign of the Tutte polynomial is actually #P-hard. As a trivial consequence, approximating the polynomial is also #P-hard in this case. Thus, approxi- mately evaluating the Tutte polynomial in these regions is as hard as exactly counting the satisfying assignments to a CNF Boolean formula. For most other points in the parameter space, we show that computing the sign of the polynomial is in FP, whereas approximating the polynomial can be done in polynomial time with an NP oracle. As a special case, we completely resolve the complexity of computing the sign of the chromatic polynomial—this is easily computable at q =2andwhen q ≤ 32/27, and is NP-hard to compute for all other values of the parameter q. Key words. computational complexity, Tutte polynomial, #P-completeness AMS subject classifications. Primary, 68Q17; Secondary, 05C31, 05C30, 68R10 DOI. 10.1137/12088330X 1. Introduction. The Tutte polynomial of an undirected1 graph is a two-variable polynomial that captures many interesting properties of the graph, such as (by mak- ing appropriate choices of the two variables) the number of q-colorings, the number of nowhere-zero q-flows, the number of acyclic orientations, and the probability that the graph remains connected when edges are deleted at random.
    [Show full text]