Sökresultat

Currently, most research and public datasets for video sports analytics are base on detecting players as bounding boxes in broadcast videos. Going from there to precise locations on the pitch is however hard. Modern solutions are making dedicated static cameras covering the entire pitch more readily accessible, and they are now used more and more even in lower tiers. To promote research that can t

Background: After an older person moves into a nursing home, the next of kin often continues to participate in the care provided there. This participation in care may contribute valuable knowledge of the preferences and wishes of the older person, thereby helping nursing staff deliver personalised care. Objectives: The aim of this study was to explore how next of kin experience their participati

Proof logging in constraint programming is an approach to certifying a conclusion reached by a solver. To allow for this, different propagators must be augmented to produce justifications for any inferences they make, so that an independent proof checker can certify correctness. The Circuit constraint is used to enforce a Hamiltonian cycle on a set of vertices, e.g. for vehicle routing. Maintainin

It is well known that reformulating the original problem can be crucial for the performance of mixed-integer programming (MIP) solvers. To ensure correctness, all transformations must preserve the feasibility status and optimal value of the problem, but there is currently no established methodology to express and verify the equivalence of two mixed-integer programs. In this work, we take a first s

Building on the progress in Boolean satisfiability (SAT) solving over the last decades, maximum satisfiability (MaxSAT) has become a viable approach for solving NP-hard optimization problems. However, ensuring correctness of MaxSAT solvers has remained a considerable concern. For SAT, this is largely a solved problem thanks to the use of proof logging, meaning that solvers emit machine-verifiable

Proof logging has long been the established method to certify correctness of Boolean satisfiability (SAT) solvers, but has only recently been introduced for SAT-based optimization (MaxSAT). The focus of this paper is solution-improving search (SIS), in which a SAT solver is iteratively queried for increasingly better solutions until an optimal one is found. A challenging aspect of modern SIS solv

Pseudo-Boolean proof logging has been used successfully to provide certificates of optimality from a variety of constraint- and satisifability-style solvers that combine reasoning with a backtracking or clause-learning search. Another paradigm, occurring in dynamic programming and decision diagram solving, instead reasons about partial states and possible transitions between them. We describe a fr

Background: Multiple system atrophy is a neurodegenerative disease with α-synuclein aggregation in glial cytoplasmic inclusions, leading to dysautonomia, parkinsonism, and cerebellar ataxia. Objective: The aim of this study was to validate the accuracy of the International Parkinson and Movement Disorder Society Multiple System Atrophy clinical diagnostic criteria, particularly considering the imp

Normalizing flows (NFs) have been shown to be advantageous in modeling complex distributions and improving sampling efficiency for unbiased sampling. In this work, we propose a new class of continuous NFs, ascent continuous normalizing flows (ACNFs), that makes a base distribution converge faster to a target distribution. As solving such a flow is non-trivial and barely possible, we propose a prac

Objective To elucidate experiences and coping strategies among adults in the surveillance of indeterminate pulmonary nodules detected with CT in the population-based Swedish CardioPulmonary bioImage Study (SCAPIS).Design A qualitative study of conventional content analysis.Settings The study was conducted at a university hospital in a southern region of Sweden. The SCAPIS setting is similar to the

An extension of the feedline is often needed when an antenna is integrated with the roof glass of a car. How much the extension affects the antenna performance depends on the type of antenna and feedline used. This paper studies the effects of coplanar waveguide feedline extension on the performance of a circularly-polarized square slot antenna. Simulation results show a general decrease in the an

Reconfigurable surface (RS) has been shown to be an effective solution for improving wireless communication links in general multi-user multiple-input multiple-output (MU-MIMO) setting. Current research efforts have been largely directed towards the study of reconfigurable intelligent surface (RIS), which corresponds to an RS made of passive reconfigurable elements with only phase shifting capabil

In this paper, we investigate the problem of decoder error propagation for spatially coupled low-density parity-check (SC-LDPC) codes with sliding window decoding (SWD). This problem typically manifests itself at signal-to-noise ratios (SNRs) close to capacity under low-latency operating conditions. In this case, infrequent but severe decoder error propagation can sometimes occur. To help understa

Modern subgraph-finding algorithm implementations consist of thousands of lines of highly optimized code, and this complexity raises questions about their trustworthiness. Recently, some state-of-the-art subgraph solvers have been enhanced to output machine-verifiable proofs that their results are correct. While this significantly improves reliability, it is not a fully satisfactory solution, sinc

In this paper, a wideband circularly polarized antenna is designed for integration into the glass roof of a modern car for GNSS positioning applications. Characteristic mode analysis is used to obtain more physical insight into the problem and hence satisfy the polarization and bandwidth requirements. The antenna has a low profile and uses a single coplanar waveguide feed to cover all GNSS bands.

Due to their natural and inherent way of capturing concurrency, dataflow descriptions of stream programs have seen prevalent usage in fields such as video processing, networks and scientific computing. They are often deployed on manycore, heterogeneous and distributed architectures. Despite robust research on the topic, obstacles still exist in evaluating the performance of stream programs accurat

One of the major open problems in complexity theory is proving super-logarithmiclower bounds on the depth of circuits (i.e., P⊈NC1). Karchmer et al. (Comput Complex 5(3/4):191–204, 1995) suggested to approach thisproblem by proving that depth complexity behaves “as expected”with respect to the composition of functions f◊g. They showedthat the validity of this conjecture would imply that P⊈NC1.Seve

Streaming applications, such as MPEG video encoders or sensor processing pipelines, are increasing in complexity as well as the diversity of platforms that they run on. The toolchains handling these applications must keep up with this increase at all levels of abstraction. The Actor Machine (AM) is an intermediate representation in the toolchain that we make use of. Large AMs are difficult to work

Positioning with 5G signals generally requires connection to several base stations (BSs), which makes positioning more demanding in terms of infrastructure than communications. To address this issue, there have been several theoretical studies on single BS positioning, leveraging high-resolution angle and delay estimation and multipath exploitation possibilities at mmWave frequencies. This paper p