Filetype
Knowledge of the forest biomass and its change in time is crucial to understanding the carbon cycle and its interactions with climate change. LiDAR (Light Detection and Ranging) technology, in this respect, has proven to be a valuable tool, providing reliable estimates of aboveground biomass (AGB). The overall goal of this study was to develop a method for assessing AGB using a synergy of low poin
Popular Abstract in Swedish SVENSK SAMMANFATTNING (SUMMARY IN SWEDISH) Hematopoes och leukemi Hematopoes är benämningen på den process vari alla blodceller genom hela livet kontinuerligt utvecklas i benmärgen, samt vid bildandet av lymfocyter även i lymfkörtlarna. Varje dygn bildas det ca 1012 nya celler i benmärgen för att ersätta uttjänta blodceller som dör och bryts ned. Ett litet antal stamcelWilms’ tumour gene 1 (WT1) encodes a zinc-finger transcription factor functioning as a key regulator in organ development. WT1 was first identified as a tumour suppressor gene due to its inactivation in Wilms’ tumour cases, a childhood kidney cancer. In adult tissues WT1 expression is restricted to few organs, but various forms of cancers express high WT1 levels, suggesting an oncogenic potential
The interaction between nitrogen monoxide (NO) and organic peroxy radicals (RO2) greatly impacts the formation of highly oxygenated organic molecules (HOM), the key precursors of secondary organic aerosols. It has been thought that HOM production can be significantly suppressed by NO even at low concentrations. Here, we perform dedicated experiments focusing on HOM formation from monoterpenes at l
An estimation model which uses the gross heat release data and the fuel energy to estimate the total amount of emissions and unburned Hydro Carbon (HC) is developed. Gross heat release data is calculated from a self-tuned heat release method which uses in-cylinder pressure data for computing the energy released during combustion. The method takes all heat and mass losses into account. The method e
In computer simulations, long-range electrostatic interactions are surprisingly well approximated by truncated, short-ranged pair potentials. Examples are reaction field methods; the Wolf method; and a number of schemes based on cancellation of electric multipole moments inside a cut-off region. These methods are based on the assumption that the polarization of the neglected surroundings can be in
With the emergence of autonomous vehicles comes requirements on adequate and rigorous testing techniques, particularly as systems continuously adapt to changing environments. Scenario-based, simulated testing is one approach that has received attention, where deriving relevant scenarios from various sources is still a challenge. We therefore explore creating executable test scenarios from textual
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
New particle formation (NPF) events substantially contribute to the number concentration of atmospheric particles and cloud condensation nuclei (CCN) which can further influence radiative balance and Earth's climate. Many short-term studies have found that sulfuric acid (H2 SO4) and highly oxygenated organic molecules (HOM) are critical compounds in the early steps of NPF. However, it is not fully
This article addresses the obstacle avoidance problem for setpoint stabilization tasks in complex dynamic 2-D environments that go beyond conventional scenes with isolated convex obstacles. A combined motion planner and controller is proposed that integrates the favorable convergence characteristics of closed-form motion planning techniques with the intuitive representation of system constraints t
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 solve
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
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
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
Continuous experimentation (CE) is used by many internet-facing companies to improve the value of their products based on user feedback gathered, e.g. through on-line experiments using A/B testing. Frameworks and theories for CE have been derived through academic research from applications in large internet facing companies. To assist practitioners in a broader range of companies, we herein presen
We present FACT, a method for predicting alignment quality (i.e., registration error) of registered lidar point cloud pairs. This is useful e.g. for quality assurance of large, automatically registered 3D models. FACT extracts local features from a registered pair and processes them with a point transformer-based network to predict a misalignment class. We generalize prior work that study binary a
We propose a new class of high-rate spatially coupled LDPC (SC-LDPC) codes based on the convolutional selforthogonal codes (CSOCs) first introduced by Massey. The SCLDPC codes are constructed by treating the irregular graph corresponding to the parity-check matrix of a systematic rate R=(n-1) / n CSOC as a convolutional protograph. The protograph can then be lifted using permutation matrices to ge
