Blar i Department of Informatics på utgivelsesdato
Viser treff 41-60 av 916
-
Modelling overfow using mixed integer programming in short‑term hydropower scheduling
(Journal article; Peer reviewed, 2023)Short-term hydropower scheduling seeks to find a production schedule that maximizes profit, but must also consider the hydrological balance and risk of overflow. Overflow is by nature a non-linear and non-convex phenomenon. ... -
Do Disease Stories Need a Hero? Effects of Human Protagonists on a Narrative Visualization about Cerebral Small Vessel Disease
(Journal article; Peer reviewed, 2023)Authors use various media formats to convey disease information to a broad audience, from articles and videos to interviews or documentaries. These media often include human characters, such as patients or treating physicians, ... -
Computational complexity aspects of super domination
(Journal article; Peer reviewed, 2023)Let G be a graph. A dominating set D ⊆ V (G) is a super dominating set if for every vertex x ∈ V (G) \ D there exists y ∈ D such that NG (y) ∩ (V (G) \ D)) = {x}. The cardinality of a smallest super dominating set of G is ... -
Causal inference in drug discovery and development
(Journal article; Peer reviewed, 2023)To discover new drugs is to seek and to prove causality. As an emerging approach leveraging human knowledge and creativity, data, and machine intelligence, causal inference holds the promise of reducing cognitive bias and ... -
Polyhedral results and stronger Lagrangean bounds for stable spanning trees
(Journal article; Peer reviewed, 2023)Given a graph G=(V,E) and a set C of unordered pairs of edges regarded as being in conflict, a stable spanning tree in G is a set of edges T inducing a spanning tree in G, such that for each {ei,ej}∈C, at most one of the ... -
Macrophage phenotype transitions in a stochastic gene-regulatory network model
(Journal article; Peer reviewed, 2023)Polarization is the process by which a macrophage cell commits to a phenotype based on external signal stimulation. To know how this process is affected by random fluctuations and events within a cell is of utmost importance ... -
Convexity, convolution and competitive equilibrium
(Journal article; Peer reviewed, 2023)This paper considers a chief interface between mathematical programming and economics, namely: money-based trade of perfectly divisible and transferable goods. Three important and related features are singled out here: ... -
Mining EL⊥ Bases with Adaptable Role Depth
(Journal article; Peer reviewed, 2023)In Formal Concept Analysis, a base for a finite structure is a set of implications that characterizes all valid implications of the structure. This notion can be adapted to the context of Description Logic, where the base ... -
On the maximum number of edges in planar graphs of bounded degree and matching number
(Journal article; Peer reviewed, 2023)We determine the maximum number of edges that a planar graph can have as a function of its maximum degree and matching number. -
Guarding the First Order: The Rise of AES Maskings
(Journal article; Peer reviewed, 2023)We provide three first-order hardware maskings of the AES, each allowing for a different trade-off between the number of shares and the number of register stages. All maskings use a generalization of the changing of the ... -
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 ... -
Graph Algebras and Derived Graph Operations
(Journal article, 2023)We revise our former definition of graph operations and correspondingly adapt the construction of graph term algebras. As a first contribution to a prospective research field, Universal Graph Algebra, we generalize some ... -
How to find a good explanation for clustering?
(Journal article; Peer reviewed, 2023)k-means and k-median clustering are powerful unsupervised machine learning techniques. However, due to complicated dependencies on all the features, it is challenging to interpret the resulting cluster assignments. Moshkovitz, ...