Filetype
The min-sum (MS) and approximate-min* (a-min*) algorithms are alternatives of the belief propagation (BP) algorithm for decoding low-density parity-check (LDPC) codes. To lower the BP decoding complexity, both algorithms compute two magnitudes at each check node (CN) and pass them to the neighboring variable nodes (VNs).In this work we propose a new algorithm, ga-min*, that generalizes the MS
Conflict-driven pseudo-Boolean solvers optimize 0-1 integer linear programs by extending the conflict-driven clause learning (CDCL) paradigm from SAT solving. Though pseudo-Boolean solvers have the potential to be exponentially more efficient than CDCL solvers in theory, in practice they can sometimes get hopelessly stuck even when the linear programming (LP) relaxation is infeasible over the real
We see a potential for ESS to benefit from sharing alarm data for machine learning applications, by establishing data ecosystem. To achieve these goal, ESS must make a strategic decision to pursue data sharing, establish a technical platform to share a digital twin, continue advancing the data ecosystem, and work towards a standardized reference model.
One type of light source that remains largely unexplored in the field of light transport rendering is the light generated by superluminal particles, a phenomenon more commonly known as Cherenkov radiation. By re-purposing the Frank-Tamm equation for rendering, the energy output of these particles can be estimated and consequently mapped to photons, making it possible to visualize the brilliant blu
We establish an exactly tight relation between reversiblepebblings of graphs and Nullstellensatz refutations of pebbling formulas,showing that a graph G can be reversibly pebbled in time t and space s if and only if there is a Nullstellensatz refutation of the pebbling formulaover G in size t + 1 and degree s (independently of the field in whichthe Nullstellensatz refutation is made). We use this
In this paper we propose a design methodology to partition dataflow applications on a multi clock domain architecture. This work shows how starting from a high level dataflow representation of a dynamic program it is possible to reduce the overall power consumption without impacting the performances. Two different approaches are illustrated, both based on the post-processing and analysis of the ca
In this paper, we present a systematic approach to design a compact dual-mode monopole-like patch antenna using characteristic mode analysis (CMA). The modal analysis of a slotted circular patch structure incorporating a new shorting pin loading technique is presented. To achieve a compact monopole-like antenna with wideband operation, it is demonstrated that the first two significant modes with m
A pre-requisite for the design of wireless systems is the understanding of the propagation channel. While a wealth of propagation knowledge exists for bands below 6 GHz, the same can not be said for bands approaching millimeter-wave frequencies. In this paper, we present the design, implementation and measurement-based verification of a re-configurable 27.5-29.5 GHz channel sounder for measuring d
A co-designed (3+3)-port antenna for dual-band operation that requires no feeding or decoupling network is proposed and verified. The antenna consists of six ports which are divided into two groups that resonate in two differentfrequency ranges. The basic radiating element is a tri-modal patch in a folded snowflake-shaped structure with the largest antenna dimension of 0.48λ1 or 0.68λ2, where λ1 and
Background: The aim of this study was to analyze overall survival in endometrial cancer patients’ FIGO stages I-III in relation to surgical approach; minimally invasive (MIS) or open surgery (laparotomy). Methods: A population-based retrospective study of 7275 endometrial cancer patients included in the Swedish Quality Registry for Gynecologic Cancer diagnosed from 2010 to 2018. Cox proportional h
Side-channel attacks exploiting Plaintext-Checking (PC) and Decryption Failure (DF) oracles are a pressing threat to deployed post-quantum cryptography. These oracles can be instantiated from tangible leakage sources like timing, power, and microarchitectural behaviors, making them a practical concern for leading schemes based on lattices, codes, and isogenies. In this paper, we revisit chosen-cip
We show exponential lower bounds on resolution proof length for pigeonhole principle (PHP) formulas and perfect matching formulas over highly unbalanced, sparse expander graphs, thus answering the challenge to establish strong lower bounds in the regime between balanced constant-degree expanders as in [Ben-Sasson and Wigderson’01] and highly unbalanced, dense graphs as in [Raz’04] and [Razborov’03
Background: Tumor multiplicity is a negative prognostic factor in intrahepatic cholangiocarcinoma (iCCA) and the role of surgical resection in multiple iCCA remains unclear. Patients and Methods: Data were extracted from the Swedish quality registry for cancers of the liver and biliary tract, for all patients undergoing surgery for iCCA (2010–2021). Validation was performed with all Swedish hepato
Age of Information (AoI) is a widely used metric to quantify the freshness of updates in communication systems. Existing AoI analyses implicitly assume a shared or synchronized notion of time between transmitter and receiver, thereby neglecting distortions arising from relative motion and gravitational effects. In this paper, we investigate the impact of relativistic time dilation on information f
Background All hospital laboratories in Sweden use the Owren prothrombin time (PT) method primarily to monitor anticoagulant treatment. Direct international normalized ratio (INR) calibration was introduced in 1999 under the supervision of Equalis, the national organization for external quality assessment (EQA) in laboratory medicine. Objectives We present 25 years of combined experience in develo
We study a class of dynamical multi-commodity flows in transportation networks. These are modeled as dynamical systems describing the evolution of the densities of a number of different commodities across the cells of a transportation network. Each cell is characterized by commodity-specific increasing demand functions returning the maximum outflow of each commodity from the cell as a function of
This paper investigates a behavioral-feedback SIR model in which the infection rate adapts dynamically based on the fractions of susceptible and infected individuals. We introduce an invariant of motion and we characterize the peak of infection. We further examine the system under a threshold constraint on the infection level. Based on this analysis, we formulate an optimal control problem to keep
We consider two optimization problems in which a planner aims to influence the average transient opinion in the Friedkin-Johnsen dynamics on a network by intervening on the agents' innate opinions. Solving these problems requires full network knowledge, which is often not available because of the cost involved in collecting this information or due to privacy considerations. For this reason, we foc
