Blar i Department of Informatics på tittel
Viser treff 405-424 av 1112
-
Galaxy: A Decade of Realising CWFR Concepts
(Journal article; Peer reviewed, 2022)Despite recent encouragement to follow the FAIR principles, the day-to-day research practices have not changed substantially. Due to new developments and the increasing pressure to apply best practices, initiatives to ... -
Gamification To Promote Guideline Training In Health Care
(Master thesis, 2019-06-29)Clinical practice guidelines are recipes for how clinician can identify a specific medical condition in a patient, how to manage and provide treatment for such a patient. These are evidence based statements, which includes ... -
GAPGOM—an R package for gene annotation prediction using GO metrics
(Journal article; Peer reviewed, 2021)Objective Properties of gene products can be described or annotated with Gene Ontology (GO) terms. But for many genes we have limited information about their products, for example with respect to function. This is ... -
Gaussian Likelihoods in Bayesian Neural Networks
(Master thesis, 2023-10-02)Bayesian neural networks (BNNs) offer a promising probabilistic take on neural networks, allowing uncertainty quantification in both model predictions and parameters. Being a relatively new and evolving field of research, ... -
A general deep reinforcement learning hyperheuristic framework for solving combinatorial optimization problems
(Journal article; Peer reviewed, 2023)Many problem-specific heuristic frameworks have been developed to solve combinatorial optimization problems, but these frameworks do not generalize well to other problem domains. Metaheuristic frameworks aim to be more ... -
A General Methodology for Internalising Multi-level Model Typing
(Chapter, 2021)Multilevel Modelling approaches allow for an arbitrary number of abstraction levels in typing chains. In this paper, a transformation of a multi-level typing chain into a single all-covering representing model is proposed. ... -
Generalization of a class of APN binomials to Gold-like functions
(Journal article; Peer reviewed, 2021)In 2008 Budaghyan, Carlet and Leander generalized a known instance of an APN function over the finite field F212 and constructed two new infinite families of APN binomials over the finite field F2n , one for n divisible ... -
Generalized Bent and/or Negabent Constructions
(Master thesis, 2012-04-27)In this thesis, we generalize the Maiorana-McFarland construction for bent, negabent and bent-negabent Boolean functions and describe a way to computationally search for constructions using these generalizations. We present ... -
Generalized isotopic shift construction for APN functions
(Journal article; Peer reviewed, 2021)In this work we give several generalizations of the isotopic shift construction, introduced recently by Budaghyan et al. (IEEE Trans Inform Theory 66:5299–5309, 2020), when the initial function is a Gold function. In ... -
Generating a synthetic diffusion tensor dataset
(Peer reviewed; Journal article, 2005)During the last years, many techniques for de-noising, segmentation and fiber-tracking have been applied to diffusion tensor MR image data (DTI) from human and animal brains. However, evaluating such methods may be difficult ... -
Generating sample code snippets from Lark grammar specifications
(Master thesis, 2022-10-25)Programming languages are the basis of computer science and are extensively used in computer science education. Many educational materials, such as tutorials, constantly appear on the market with the goal of targeting ... -
Generating software for MUB complementary sequence constructions
(Master thesis, 2015-11-18)This master thesis has been performed at the Department of Informatics, University of Bergen between February and November 2015. The work has been supervised by Professor Matthew G. Parker as a part of the research interest ... -
Generating tree-like graphs
(Master thesis, 2008-11-18)Implementation of an algorithm that interactively generates k-graphs, a superclass of k-branches. -
Generation of random chordal graphs using subtrees of a tree
(Journal article; Peer reviewed, 2022)Chordal graphs form one of the most studied graph classes. Several graph problems that are NP-hard in general become solvable in polynomial time on chordal graphs, whereas many others remain NP-hard. For a large group of ... -
Generative Adversarial Networks for Annotating Images of Otoliths
(Master thesis, 2023-01-30)This thesis explores the use of generative adversarial networks (GANs) for annotating images of otoliths to determine the age of fish. The proposed solution not only provides accurate age determinations, but also visual ... -
Generic programming using Higher Kinded Data
(Master thesis, 2023-06-28)This thesis describes datatype-generic programming, what it is, and how it is done in Scala. The thesis covers ways of thinking about datatype-generic programming and today's tools and libraries for datatype-generic ... -
The genome sequence of Atlantic cod reveals a unique immune system
(Peer reviewed; Journal article, 2011-09)Atlantic cod (Gadus morhua) is a large, cold-adapted teleost that sustains long-standing commercial fisheries and incipient aquaculture. Here we present the genome sequence of Atlantic cod, showing evidence for complex ... -
The Genomic HyperBrowser: an analysis web server for genome-scale data
(Peer reviewed; Journal article, 2013-04-30)The immense increase in availability of genomic scale datasets, such as those provided by the ENCODE and Roadmap Epigenomics projects, presents unprecedented opportunities for individual researchers to pose novel falsifiable ... -
Geometric Planar Networks on Bichromatic Points
(Journal article; Peer reviewed, 2020)We study four classical graph problems – Hamiltonian path, Traveling salesman, Minimum spanning tree, and Minimum perfect matching on geometric graphs induced by bichromatic ( Open image in new window and Open image in new ... -
A geometry-based generic predictor for catalytic and allosteric sites
(Peer reviewed; Journal article, 2011)An important aspect of understanding protein allostery, and of artificial effector design, is the characterization and prediction of substrate- and effector-binding sites. To find binding sites in allosteric enzymes, many ...