Blar i Department of Informatics på utgivelsesdato
Viser treff 81-100 av 1122
-
Gold functions and switched cube functions are not 0-extendable in dimension n > 5
(Journal article; Peer reviewed, 2023)In the independent works by Kalgin and Idrisova and by Beierle, Leander and Perrin, it was observed that the Gold APN functions over \(\mathbb {F}_{2^5}\) give rise to a quadratic APN function in dimension 6 having maximum ... -
Simplicity conditions for binary orthogonal arrays
(Journal article; Peer reviewed, 2023)It is known that correlation-immune (CI) Boolean functions used in the framework of side channel attacks need to have low Hamming weights. The supports of CI functions are (equivalently) simple orthogonal arrays, when their ... -
Composition of multilevel domain-specific modelling languages
(Journal article; Peer reviewed, 2023)Multilevel Modelling (MLM) approaches make it possible for designers and modellers to work with an unlimited number of abstraction levels to specify their domain-specific modelling languages (DSMLs). To fully exploit MLM ... -
Interactive Visual Analysis of Structure-borne Noise Data
(Journal article; Peer reviewed, 2023)Numerical simulation has become omnipresent in the automotive domain, posing new challenges such as high-dimensional parameter spaces and large as well as incomplete and multi-faceted data. In this design study, we show ... -
sMolBoxes: Dataflow Model for Molecular Dynamics Exploration
(Journal article; Peer reviewed, 2023)We present sMolBoxes, a dataflow representation for the exploration and analysis of long molecular dynamics (MD) simulations. When MD simulations reach millions of snapshots, a frame-by-frame observation is not feasible ... -
A survey of parameterized algorithms and the complexity of edge modification
(Journal article; Peer reviewed, 2023)The survey is a comprehensive overview of the developing area of parameterized algorithms for graph modification problems. It describes state of the art in kernelization, subexponential algorithms, and parameterized ... -
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 ... -
Strongly Stable Stationary Points for a Class of Generalized Equations
(Journal article; Peer reviewed, 2023)In this paper we consider a generalized equation that is mainly characterized by a cone-valued mapping. It is well known that optimality conditions for different classes of optimization problems can be formulated as such ... -
Structural Operational Semantics for Heterogeneously Typed Coalgebras
(Journal article; Peer reviewed, 2023)Concurrently interacting components of a modular software architecture are heterogeneously structured behavioural models. We consider them as coalgebras based on different endofunctors. We formalize the composition of these ... -
Lossy Kernelization of Same-Size Clustering
(Journal article; Peer reviewed, 2023)In this work, we study the k-median clustering problem with an additional equal-size constraint on the clusters from the perspective of parameterized preprocessing. Our main result is the first lossy (2-approximate) ... -
Plasma cortisol linked gene networks in hepatic and adipose tissues implicate corticosteroid binding globulin in modulating tissue glucocorticoid action and cardiovascular risk
(Journal article; Peer reviewed, 2023)Genome-wide association meta-analysis (GWAMA) by the Cortisol Network (CORNET) consortium identified genetic variants spanning the SERPINA6/SERPINA1 locus on chromosome 14 associated with morning plasma cortisol, cardiovascular ... -
An adaptive heuristic for Feeder Network Design with optional transshipment
(Journal article; Peer reviewed, 2023)This paper studies the Feeder Network Design Problem (FNDP), which considers the design of a minimum cost liner shipping network for the transportation of cargo (containers) between a given hub port and a set of feeder ... -
Fine-grained parameterized complexity analysis of graph coloring problems
(Journal article; Peer reviewed, 2023)The q-Coloring problem asks whether the vertices of a graph can be properly colored with q colors. In this paper we perform a fine-grained analysis of the complexity of q- Coloring with respect to a hierarchy of structural ... -
b-Coloring Parameterized by Clique-Width
(Journal article; Peer reviewed, 2023)We provide a polynomial-time algorithm for b- Coloring on graphs of constant clique-width. This unifies and extends nearly all previously known polynomial time results on graph classes, and answers open questions posed by ... -
FAIR+E pathogen data for surveillance and research: lessons from COVID-19
(Journal article; Peer reviewed, 2023)The COVID-19 pandemic has exemplified the importance of interoperable and equitable data sharing for global surveillance and to support research. While many challenges could be overcome, at least in some countries, many ... -
Order Reconfiguration under Width Constraints
(Journal article; Peer reviewed, 2023)In this work, we consider the following order reconfiguration problem: Given a graph G together with linear orders ω and ω′ of the vertices of G, can one transform ω into ω′ by a sequence of swaps of adjacent elements in ... -
Finding haplotypic signatures in proteins
(Journal article; Peer reviewed, 2023)Background The nonrandom distribution of alleles of common genomic variants produces haplotypes, which are fundamental in medical and population genetic studies. Consequently, protein-coding genes with different ... -
Measuring Adversarial Robustness using a Voronoi-Epsilon Adversary
(Journal article; Peer reviewed, 2023)Previous studies on robustness have argued that there is a tradeoff between accuracy and adversarial accuracy. The tradeoff can be inevitable even when we neglect generalization. We argue that the tradeoff is inherent to ... -
Further investigations on permutation based constructions of bent functions
(Journal article; Peer reviewed, 2023)Constructing bent functions by composing a Boolean function with a permutation was introduced by Hou and Langevin in 1997. The approach appears simple but heavily depends on the construction of desirable permutations. In ... -
Treewidth is NP-Complete on Cubic Graphs
(Journal article; Peer reviewed, 2023)In this paper, we show that Treewidth is NP-complete for cubic graphs, thereby improving the result by Bodlaender and Thilikos from 1997 that Treewidth is NP-complete on graphs with maximum degree at most 9. We add a new ...