Filetype
Partially Premixed combustion (PPC) is a promising combustion concept to achieve high engine efficiency. The combustion-timing of PPC is affected by both inlet-charge condition and the fuel injection, a simple map-based feed-forward control method is not sufficient for controlling the combustion during transient operation. This paper investigates a model-based control method to solve this control
Despite widely acknowledged problems of aggression, presumptions on its constructive and destructive possibilities, aggression still remains scarcely explored phenomenon. The aim of this paper is to propose closer look at the subjective motivation of aggression in women. The study consisted of two stages and embraced 24 participants. As the analysis of semi-structured interviews and projective mat
Realistic network simulations are necessary to assess the performance of any communication system. In this paper, we describe an implementation of a channel model for vehicle-to-vehicle (V2V) communication in the OMNeT++/Plexe simulation environment. The model is based on previous extensive measurements in a V2V multilink highway scenario and cover line-of-sight (LOS) as well as obstructed LOS (OL
The premise of massive multiple-input multiple-output (MIMO) is based around coherent transmission and detection. Majority of the vast literature on massive MIMO presents performance evaluations over simplified statistical propagation models. All such models are drop-based and do not ensure continuity of channel parameters. In this paper, we quantify the impact of spatially consistent (SC) models
With the potential to provide a clean break from massive multiple-input multiple-output, large intelligent surfaces (LISs) have recently received a thrust of research interest. Various proposals have been made in the literature to define the exact functionality of LISs, ranging from fully active to largely passive solutions. Nevertheless, almost all studies in the literature investigate the fundam
Since the 1960s, product designers, architects, lighting planners, gamers and scientific visualizaiton specialists have craved the ability to work in real-time three-dimensional photorealistic virtual worlds. The authors, one specializing in making computer graphics more convincing and the other focusing on making them faster, present the achievements and challenges in the race for real-time photo
The parallel structure of dataflow programs and their support for processing streams of data make dataflow programming an interesting tool for doing stream processing on parallel processing architectures. The computational kernels, the actors, of a dataflow program communicate with other actors via FIFO channels. The actors in the dataflow model used in this paper may perform different actions dep
This paper addresses design space exploration for streaming applications (such as MPEG) running on multi-processor platforms with guaranteed service interconnects. In particular, we solve mapping, path selection and router configuration problems. Given the complexity of these problems, state of the art approaches in this area largely rely on greedy heuristics, which do not guarantee optimality. Ou
Massive multiple-input multiple-output (MIMO) promises significantly higher performance relative to conventional multiuser systems. However, the promised gains of massive MIMO systems rely heavily on the accuracy of the absolute front-end calibration, as well as quality of channel estimates at the base station (BS). In this paper, we analyze user equipment-aided calibration mechanism to estimate t
We propose that CDCL SAT solver heuristics such as restarts and clause database management can be analysed by studying the resolution proofs produced by the solvers, and by trimming these proofs to extract the clauses actually used to reach the final conclusion. We find that for non-adaptive Luby restarts higher frequency makes both untrimmed and trimmed proofs smaller, while adaptive restarts bas
We study planning problems where the transition function is described by a learned binarized neural network (BNN). Theoretically, we show that feasible planning with a learned BNN model is NP-complete, and present two new constraint programming models of this task as a mathematical optimization problem. Experimentally, we run solvers for constraint programming, weighted partial maximum satisfiabil
An algorithm is said to be certifying if it outputs, together with a solution to the problem it solves, a proof that this solution is correct. We explain how state of the art maximum clique, maximum weighted clique, maximal clique enumeration and maximum common (connected) induced subgraph algorithms can be turned into certifying solvers by using pseudo-Boolean models and cutting planes proofs, an
Braided convolutional codes (BCCs) are a class of spatially coupled turbo-like codes that can be described by a (2), (3)-regular compact graph. In this paper, we introduce a family of (d v , d c )-regular GLDPC codes with convolutional code constraints (CC-GLDPC codes), which form an extension of classical BCCs to arbitrary regular graphs. In order to characterize the performance in the waterfall
Propagation models constitute a fundamental building block of wireless communications research. Before we build and operate real systems, we must understand the science of radio propagation, and develop channel models that both reflect the important propagation processes and allow a fair comparison of different systems. In the past five decades, wireless systems have gone through five generations,
Radio based positioning or tracking solutions typically require wideband signals or phase coherent antennas. In this paper, we present a target tracking method based on received non-coherent signal strength differences (RSSDs) between antennas for outdoor Internet-of-things (IoT) scenarios. We introduce an RSSD model based on classical path-loss models. With known antenna patterns and antenna arra
In this paper, we introduce two new methods of mit- igating decoder error propagation for low-latency sliding window decoding (SWD) of spatially coupled low-density parity-check (SC- LDPC) codes. Building on the recently introduced idea of check node (CN) doping of regular SC-LDPC codes, here we employ variable node (VN) doping to fix (set to a known value) a subset of variable nodes in the coupli
Given a Boolean formula, the problem of counting seeks to estimate the number of solutions of F while the problem of uniform sampling seeks to sample solutions uniformly at random. Counting and uniform sampling are fundamental problems in computer science with a wide range of applications ranging from constrained random simulation, probabilistic inference to network reliability and beyond. The pas
The use of ultra-low power wake-up receivers (WuRx) can significantly reduce idle listening energy cost. To tailor a WuRx scheme to orthogonal frequency division multiplexing (OFDM) based systems, such as LTE-MTC or IEEE 802.11, the wake-up signal (WUS) also needs to follow OFDM principles to avoid interfering with other transmissions in the same shared bandwidth. Here, we address this particular
