Now showing items 900-915 of 915

    • Walk Your Tree Any Way You Want 

      Bagge, Anya Helene; Lämmel, Ralf (Lecture Notes in Computer Science; 7909, Chapter; Peer reviewed, 2013)
      Software transformations in the Nuthatch style are described as walks over trees (possibly graphs) that proceed in programmerdefined steps which may observe join points of the walk, may observe and affect state associated ...
    • Wave-shaped round functions and primitive groups 

      Aragona, Riccardo; Calderini, Marco; Civino, Roberto; Sala, Massimiliano; Zappatore, Ilaria (Peer reviewed; Journal article, 2019)
      Round functions used as building blocks for iterated block ciphers, both in the case of Substitution-Permutation Networks (SPN) and Feistel Networks (FN), are often obtained as the composition of different layers. The ...
    • A Web-based Solid Waste Management System for Sierra Leone 

      Kayleemasa, Kisimi (Master thesis, 2018-12-13)
      The generation of waste is a continuous process as long as human activities are going on in the world. To address the threats that waste poses to life in general, it is important to manage waste properly. Waste management ...
    • WEBnm@ v2.0: Web server and services for comparing protein flexibility 

      Tiwari, Sandhya Premnath; Fuglebakk, Edvin; Hollup, Siv Midtun; Skjærven, Lars; Cragnolini, Tristan; Grindhaug, Svenn Helge; Tekle, Kidane M; Reuter, Nathalie (Peer reviewed; Journal article, 2014-12-30)
      Background: Normal mode analysis (NMA) using elastic network models is a reliable and cost-effective computational method to characterise protein flexibility and by extension, their dynamics. Further insight into the ...
    • Webucator 3.0 - Brukerhåndtering og aksesskontroll for DPG 2.0 

      Løvik, Kristian Skønberg (Master thesis, 2008-08-18)
      Oppgaven omhandler brukerhåndtering, sikkerhet og aksesskontroll i Dynamic Presentation Generator og Webucator, som er sentrale systemer for gjennomføringen av fjernundervisningskurs over internett ved Universitetet i Bergen.
    • The Weight Distributions of Several Classes of Cyclic Codes From APN Monomials 

      Li, Chunlei; Li, Nian; Helleseth, Tor; Ding, Cunsheng (Peer reviewed; Journal article, 2014-08)
      Let m ≥ 3 be an odd integer and p be an odd prime. In this paper, a number of classes of three-weight cyclic codes C(1,e) over Fp, which have parity-check polynomial m1(x)me (x), are presented by examining general conditions ...
    • Well-partitioned chordal graphs 

      Ahn, Jungho; Jaffke, Lars; Kwon, O-joung; Lima, Paloma T. (Journal article; Peer reviewed, 2022)
      We introduce a new subclass of chordal graphs that generalizes the class of split graphs, which we call well-partitioned chordal graphs. A connected graph G is a well-partitioned chordal graph if there exist a partition P ...
    • What Is Known About Vertex Cover Kernelization? 

      Fellows, Michael R.; Jaffke, Lars; Király, Aliz Izabella; Rosamond, Frances; Weller, Mathias (Peer reviewed; Journal article, 2018)
      We are pleased to dedicate this survey on kernelization of the Vertex Cover problem, to Professor Juraj Hromkovič on the occasion of his 60th birthday. The Vertex Cover problem is often referred to as the Drosophila of ...
    • Whole genome sequencing of the fish pathogen Francisella noatunensis subsp. orientalis Toba04 gives novel insights into Francisella evolution and pathogenecity 

      Sridhar, Settu; Sharma, Animesh; Kongshaug, Heidi; Nilsen, Frank; Jonassen, Inge (Peer reviewed; Journal article, 2012-11-06)
      Background: Francisella is a genus of gram-negative bacterium highly virulent in fishes and human where F. tularensis is causing the serious disease tularaemia in human. Recently Francisella species have been reported to ...
    • A wide-range algorithm for minimal triangulation from an arbitrary ordering 

      Berry, Anne; Bordat, Jean-Paul; Heggernes, Pinar; Simonet, Genevieve; Villanger, Yngve (Journal article, 2006)
    • Width Notions for Ordering-Related Problems 

      Arrighi, Emmanuel; Fernau, Henning; De Oliveira Oliveira, Mateus; Wolf, Petra (Journal article; Peer reviewed, 2020)
      We are studying a weighted version of a linear extension problem, given some finite partial order ρ, called Completion of an Ordering. While this problem is NP-complete, we show that it lies in FPT when parameterized by ...
    • Workflow management systems 

      Imsland, Geir Inge Struen (Master thesis, 2007-12-01)
      This master's thesis gives an insight to workflow technologies used to improve efficiency of business processes. Ways to use such technologies in order to help users through tasks in MIPS (Material Integrated Production ...
    • WSDL Workshop. Semantic web application in HTML5 for the discovery, construction and analysis of workflows 

      Nozal Canadas, Rafael Adolfo (Master thesis, 2013-11-20)
      WSDL-Workshop is a HTML5 web application for the discovery and exploration of web services and for analysing the compatibility between web services. This is the result of a mathematical model developed from WSDL1.1. The ...
    • WSDL Workshop: Semantic web application in HTML5 for the discovery, construction and analysis of workfows 

      Cañadas, Rafael Adolfo Nozal (Master thesis, 2013)
      WSDL-Workshop is a HTML5 web application for the discovery and exploration of web services and for analyzing the compatibility between web services. This is the result of a mathematical model developed from WSDL1.1. The ...
    • XHM: A system for detection of potential cross hybridizations in DNA microarrays 

      Flikka, Kristian; Yadetie, Fekadu; Lægreid, Astrid; Jonassen, Inge (Peer reviewed; Journal article, 2004-08-27)
      Background: Microarrays have emerged as the preferred platform for high throughput gene expression analysis. Cross-hybridization among genes with high sequence similarities can be a source of error reducing the reliability ...
    • XNLP-Completeness for Parameterized Problems on Graphs with a Linear Structure 

      Bodlaender, Hans L.; Groenland, Carla; Jacob, Hugo; Jaffke, Lars; Lima, Paloma Thome de (Journal article; Peer reviewed, 2022)
      In this paper, we showcase the class XNLP as a natural place for many hard problems parameterized by linear width measures. This strengthens existing W[1]-hardness proofs for these problems, since XNLP-hardness implies ...