Viser treff 1-20 av 1118

    • The Ultimate GUI Framework: Are We There Yet? 

      Stokke, Knut Anders; Barash, Mikhail; Järvi, Jaakko Timo Henrik (Journal article; Peer reviewed, 2023)
      The programming community seems to be forever searching for the ultimate user interface programming approach and the accompanying framework. We describe the landscape of recent efforts in this quest through describing ...
    • A domain-specific language for structure manipulation in constraint system-based GUIs 

      Stokke, Knut Anders; Barash, Mikhail; Järvi, Jaakko Timo Henrik (Journal article, 2023)
      A common frustration with programming Graphical User Interfaces (GUIs) is that features for manipulating structures, such as lists and trees, are limited, inconsistent, buggy, or even missing. Implementing complete and ...
    • Multi-Task Optimization in Reliability Redundancy Allocation Problem: A Multifactorial Evolutionary-Based Approach 

      Nath, Rahul; Chowdury, Md. Abdul Malek; Shukla, Amit K.; Rauniyar, Amit; Muhuri, Pranab K. (Journal article; Peer reviewed, 2024)
      Evolutionary multi-task optimization attempts to solve multiple optimization problems simultaneously by modeling the solution structures of two or more problems within a single encoding. In this paper, we report a novel ...
    • Hardware architecture of Dillon's APN permutation for different primitive polynomials 

      Imaña, José L.; Kaleyski, Nikolay Stoyanov; Budaghyan, Lilya (Journal article; Peer reviewed, 2023)
      Cryptographically strong functions used as S-boxes in block cyphers are fundamental for the cypher’s security. Their representation as lookup tables is possible for functions of small dimension. For larger dimensions, this ...
    • A contrastive learning approach for individual re-identification in a wild fish population 

      Olsen, Ørjan Langøy; Sørdalen, Tonje Knutsen; Goodwin, Morten; Malde, Ketil; Knausgård, Kristian Muri; Halvorsen, Kim Aleksander Tallaksen (Journal article; Peer reviewed, 2023)
      In both terrestrial and marine ecology, physical tagging is a frequently used method to study population dynamics and behavior. However, such tagging techniques are increasingly being replaced by individual re-identification ...
    • Annotating otoliths with a deep generative model 

      Bojesen, Troels Arnfred; Denechaud, Côme; Malde, Ketil (Journal article; Peer reviewed, 2023)
      Otoliths are a central information source for fish ecology and stock management, conveying important data about age and other life history for individual fish. Traditionally, interpretation of otoliths has required skilled ...
    • Covering Radius of Generalized Zetterberg Type Codes Over Finite Fields of Odd Characteristic 

      Shi, Minjia; Helleseth, Tor; Özbudak, Ferruh (Journal article; Peer reviewed, 2023)
      Let Fq0 be a finite field of odd characteristic. For an integer s≥1 , let Cs(q0) be the generalized Zetterberg code of length qs0+1 over Fq0 . If s is even, then we prove that the covering radius of Cs(q0) is 3. Put q=qs0 ...
    • New Results on the -1 Conjecture on Cross-Correlation of m-Sequences Based on Complete Permutation Polynomials 

      Wu, GaoFei; Feng, Keqin; Li, Nian; Helleseth, Tor (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 ...
    • Detours in directed graphs 

      Fomin, Fedor; Golovach, Petr; Lochet, William Alexandre; Sagunov, Danil; Saurabh, Saket; Simonov, Kirill (Journal article; Peer reviewed, 2023)
      We study two “above guarantee” versions of the classical Longest Path problem on undirected and directed graphs and obtain the following results. In the first variant of Longest Path that we study, called Longest Detour, ...
    • Classes of intersection digraphs with good algorithmic properties 

      Jaffke, Lars; Kwon, O-joung; Telle, Jan Arne (Journal article; Peer reviewed, 2023)
      While intersection graphs play a central role in the algorithmic analysis of hard problems on undirected graphs, the role of intersection digraphs in algorithms is much less understood. We present several contributions ...
    • Parameterized complexity of categorical clustering with size constraints 

      Fomin, Fedor; Golovach, Petr; Purohit, Nidhi (Journal article; Peer reviewed, 2023)
    • Diverse collections in matroids and graphs 

      Fomin, Fedor; Golovach, Petr; Panolan, Fahad; Philip, Geevarghese; Saurabh, Saket (Journal article; Peer reviewed, 2023)
      We investigate the parameterized complexity of finding diverse sets of solutions to three fundamental combinatorial problems. The input to the Weighted Diverse Bases problem consists of a matroid M, a weight function ω : ...
    • Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs 

      Fomin, Fedor; Golovach, Petr; Thilikos, Dimitrios M. (Journal article; Peer reviewed, 2023)
      We introduce the rendezvous game with adversaries. In this game, two players, Facilitator and Divider, play against each other on a graph. Facilitator has two agents and Divider has a team of k agents located in some ...
    • Five-weight codes from three-valued correlation of M-sequences 

      Shi, Minjia; Qian, Liqin; Helleseth, Tor; Sole, Patrick (Journal article; Peer reviewed, 2023)
      In this paper, for each of six families of three-valued m-sequence correlation, we construct an infinite family of five-weight codes from trace codes over the ring R = F2 + uF2, where u2 = 0. The trace codes have the ...
    • Dynamic Programming on Bipartite Tree Decompositions 

      Jaffke, Lars; Morelle, Laure; Sau, Ignasi; Thilikos, Dimitrios M. (Journal article; Peer reviewed, 2023)
      We revisit a graph width parameter that we dub bipartite treewidth, along with its associated graph decomposition that we call bipartite tree decomposition. Bipartite treewidth can be seen as a common generalization of ...
    • Structural Parameterizations of b-Coloring 

      Jaffke, Lars; Lima, Paloma Thome de; Sharma, Roohani (Journal article; Peer reviewed, 2023)
      The b-Coloring problem, which given a graph G and an integer k asks whether G has a proper k-coloring such that each color class has a vertex adjacent to all color classes except its own, is known to be FPT parameterized ...
    • How to find a good explanation for clustering? 

      Bandyapadhyay, Sayan; Fomin, Fedor; Golovach, Petr; Lochet, William Alexandre; Purohit, Nidhi; Simonov, Kirill (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, ...
    • The Connections Among Hamming Metric, b-Symbol Metric, and r-th Generalized Hamming Metric 

      Shi, Minjia; Zhu, Hongwei; Helleseth, Tor (Journal article; Peer reviewed, 2023)
      The r -th generalized Hamming metric and the b -symbol metric are two different generalizations of Hamming metric. The former is used on the wire-tap channel of Type II, and the latter is motivated by the limitations of ...
    • VR Walk: Game. VR simulator for treadmill as a tool for constraint-based gait rehabilitation 

      Bleikli, Bendik Myrene; Valved, Lauritz Skålevik (Master thesis, 2020-06-06)
      The viability of Virtual Reality (VR) is being explored in an increasing number of fields outside its primary use in entertainment. A notable example is VR therapy, where VR-based alternatives to exposure therapy and ...
    • Computational searches for quadratic APN functions with subfield coefficients 

      Berg, Simon Knotten (Master thesis, 2023-06-01)
      Almost perfect nonlinear (APN) functions are important in fields such as algebra, combinatorics, cryptography, etc. Finding new APN functions is of special importance in cryptography. This is because when used in modern ...