Blar i Department of Informatics på tittel
Viser treff 520-539 av 915
-
Network coding in Bluetooth networks
(Master thesis, 2009-10-01)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 ECT-MRI 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 ROS-dependent manner
(Journal article; Peer reviewed, 2021)Cellular senescence is characterized by an irreversible cell cycle arrest as well as a pro-inflammatory phenotype, thought to contribute to aging and age-related diseases. Neutrophils have essential roles in inflammatory ... -
New cryptanalysis of LFSR-based stream ciphers and decoders for p-ary QC-MDPC codes
(Doctoral thesis, 2022-03-18)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 CCZ-equivalent to a power function, and has remained unclassified ... -
A New Generating Set Search Algorithm for Partially Separable Functions
(Chapter; Peer reviewed, 2010)A new derivative-free 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 Key-Recovery Attack on Reduced-Round AES
(Journal article; Peer reviewed, 2022)A new fundamental 4-round property of AES, called the zero-difference property, was introduced by Rønjom, Bardeh and Helleseth at Asiacrypt 2017. Our work characterizes it in a simple way by exploiting the notion of related ... -
New Lower Bounds on the Maximum Number of Minimal Connected Vertex Covers
(Master thesis, 2017-06-20)Graphs are important mathematical structures that are used to model many real-life 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, 2006-04-25) -
New Results on the -1 Conjecture on Cross-Correlation of m-Sequences Based on Complete Permutation Polynomials
(Journal article; Peer reviewed, 2023)The cross-correlation between two maximum length sequences (m-sequences) of the same period has been studied since the end of 1960s. One open conjecture by Helleseth states that the cross- correlation between any two p-ary ... -
New Width Parameters of Graphs
(Doctoral thesis, 2012-09-03)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, 2018-08-23)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 ... -
Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-Width
(Journal article; Peer reviewed, 2022)The two weighted graph problems Node Multiway Cut (NMC) and Subset Feedback Vertex Set (SFVS) both ask for a vertex set of minimum total weight, that for NMC disconnects a given set of terminals, and for SFVS intersects ... -
Non-Constructivity in Kan Simplicial Sets
(Journal article; Peer reviewed, 2015)We give an analysis of the non-constructivity 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 ... -
Non-Uniform k-Center and Greedy Clustering
(Journal article; Peer reviewed, 2022)In the Non-Uniform k-Center (NUkC) problem, a generalization of the famous k-center clustering problem, we want to cover the given set of points in a metric space by finding a placement of balls with specified radii. In ... -
Nonlinear feedback shift registers and generating of binary de Bruijn sequences
(Master thesis, 2016-11-21) -
Norwegian e-Infrastructure for Life Sciences (NeLS)
(Peer reviewed; Journal article, 2018)The Norwegian e-Infrastructure 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 project-oriented fashion. The system is ... -
A Note on Exact Algorithms for Vertex Ordering Problems on Graphs
(Peer reviewed; Journal article, 2011-01-21)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 ... -
A note on some algebraic trapdoors for block ciphers
(Peer reviewed; Journal article, 2018)We provide sufficient conditions to guarantee that a translation based cipher is not vulnerable with respect to the partition-based trapdoor. This trapdoor has been introduced, recently, by Bannier et al. (2016) and it ... -
Notes on Lattice-Based Cryptography
(Doctoral thesis, 2022-09-06)Asymmetrisk kryptering er avhengig av antakelsen om at noen beregningsproblemer er vanskelige å løse. I 1994 viste Peter Shor at de to mest brukte beregningsproblemene, nemlig det diskrete logaritmeproblemet og ...