Blar i Department of Informatics på tittel
Viser treff 419438 av 767

Multiple Side Linear Equations. A New Tool For Solving Sparse Algebraic Equations in Finite Field
(Master thesis, 20100128)A new technique of linearization for sparse multivariate polynomial equation system is presented. Applying Gluing algorithm on the newly constructed linear equation systems, therefore solve the original multivariate ... 
Multiple time–scale dynamics of stage structured populations and derivative–free optimization
(Doctoral thesis, 20181102)The parentprogeny (adult fish–juvenile) relationship is central to understanding the dynamics of fish populations. Management and harvest decisions are based on the assumption of a stockrecruitment function that relates ... 
Multiscale Visual Drilldown for the Analysis of Large Ensembles of MultiBody Protein Complexes
(Journal article; Peer reviewed, 2020)When studying multibody protein complexes, biochemists use computational tools that can suggest hundreds or thousands of their possible spatial configurations. However, it is not feasible to experimentally verify more ... 
Multivariate Algorithmic Analysis of Hitting Small Sets
(Doctoral thesis, 20170529)When a problem has been shown to be NPcomplete, often one has to be content with either exponentialtime algorithms or resort to approximation algorithms that sacrifice the optimality of the solution, or with ad hoc ... 
Naive and adapted utilization of the GPU for general purpose computing
(Master thesis, 2017)In this thesis we will see that adaptive utilization of the graphical processing unit (GPU) has much better performance than naive utilization, but it takes longer time to implement and requires more knowledge about ... 
Naturlige nettverk
(Master thesis, 2008)En innføring i naturlige nettverk. Vi forklarer og diskuterer begrepet naturlige nettverk og vurderer hvilke nettverk som bør kalles naturlige. Vi ser på forskjeller og likheter mellom tilfeldige, planlagte og naturlige ... 
Network coding in Bluetooth networks
(Master thesis, 20091001)This thesis discusses the possibility to apply network coding to a Bluetooth piconet. A protocol is proposed. This protocol is based on using deterministic linear network coding. The proposed alphabet size is binary, and ... 
Neural Substrates of Psychotic Depression: Findings From the Global ECTMRI Research Collaboration
(Journal article; Peer reviewed, 2021)Psychotic major depression (PMD) is hypothesized to be a distinct clinical entity from nonpsychotic major depression (NPMD). However, neurobiological evidence supporting this notion is scarce. The aim of this study is to ... 
Neutrophils induce paracrine telomere dysfunction and senescence in ROSdependent manner
(Journal article; Peer reviewed, 2021)Cellular senescence is characterized by an irreversible cell cycle arrest as well as a proinflammatory phenotype, thought to contribute to aging and agerelated diseases. Neutrophils have essential roles in inflammatory ... 
New cryptanalysis of LFSRbased stream ciphers and decoders for pary QCMDPC codes
(Doctoral thesis, 20220318)The security of modern cryptography is based on the hardness of solving certain problems. In this context, a problem is considered hard if there is no known polynomial time algorithm to solve it. Initially, the security ... 
A New Family of APN Quadrinomials
(Journal article; Peer reviewed, 2020)The binomial B(x) = x 3 +βx 36 (where β is primitive in F 2 2) over F 2 10 is the first known example of an Almost Perfect Nonlinear (APN) function that is not CCZequivalent to a power function, and has remained unclassified ... 
A New Generating Set Search Algorithm for Partially Separable Functions
(ADVCOMP 2010 : The Fourth International Conference on Advanced Engineering Computing and Applications in Sciences, Conference object; Peer reviewed, 2010)A new derivativefree optimization method for unconstrained optimization of partially separable functions is presented. Using average curvature information computed from sampled function values the method generates an ... 
New Lower Bounds on the Maximum Number of Minimal Connected Vertex Covers
(Master thesis, 20170620)Graphs are important mathematical structures that are used to model many reallife problems. They can, for instance, be used to model relations between objects in a network. An important field of study in graph theory is ... 
New Results on Minimal Triangulations
(Doctoral thesis, 20060425) 
New Width Parameters of Graphs
(Doctoral thesis, 20120903)The main focus of this thesis is on using the divide and conquer technique to efficiently solve graph problems that are in general intractable. We work in the field of parameterized algorithms, using width parameters of ... 
Newsenhancer
(Master thesis, 20180823)This thesis describes a web browser plugin called NewsEnhancer, which has the goal to make it more efficient to read the news. The plugin receives data from a server application, which continuously aggregates meta information ... 
NonConstructivity in Kan Simplicial Sets
(Conference object; Peer reviewed, 2015)We give an analysis of the nonconstructivity of the following basic result: if X and Y are simplicial sets and Y has the Kan extension property, then Y X also has the Kan extension property. By means of Kripke countermodels ... 
Nonlinear feedback shift registers and generating of binary de Bruijn sequences
(Master thesis, 20161121) 
Norwegian eInfrastructure for Life Sciences (NeLS)
(Peer reviewed; Journal article, 2018)The Norwegian eInfrastructure for Life Sciences (NeLS) has been developed by ELIXIR Norway to provide its users with a system enabling data storage, sharing, and analysis in a projectoriented fashion. The system is ... 
A Note on Exact Algorithms for Vertex Ordering Problems on Graphs
(Peer reviewed; Journal article, 20110121)In this note, we give a proof that several vertex ordering problems can be solved in O ∗(2 n ) time and O ∗(2 n ) space, or in O ∗(4 n ) time and polynomial space. The algorithms generalize algorithms for the Travelling ...