Filtyp
Programming languages are ever evolving, with new languages being invented to solve new problems, and old languages being extended to solve old problems in new ways. With the continued evolution of programming languages, and with new and improved static program analyses, we need flexible systems for building our static analyses and compilers. Declarative programming with Reference Attribute Gramma
Knowing whether a software feature will be completed in its planned iteration can help with release planning decisions. However, existing research has focused on predictions of only low-level software tasks, like bug fixes. In this paper, we describe a mixed-method empirical study on three large IBM projects. We investigated the types of iteration changes that occur. We show that up to 54% of high
Datalog has emerged as a powerful tool for expressing staticprogram analyses. Program analysis researchers have builtnontrivial code bases in Datalog, but tool support for workingwith Datalog itself has been lacking. In this paper, weintroduce MetaDL, a language extension to Datalog thatenables source-level Datalog program analysis within Datalog.We describe several program analyses implemented in
In the era of the Internet of Things and social media; communities, governments, and corporations are increasingly eager to exploit new technological innovations in order to track and keep up to date with important new events. Examples of such events include the news, health related incidents, and other major occurrences such as earthquakes and landslides. This area of research commonly referred t
We consider channel estimation (CE) in narrowband Internet-of-Things (NB-IoT) systems. Due to the fluctuations in phase within receiver and transmitter oscillators, and also the residual frequency offset (FO) caused by discontinuous receiving of repetition coded transmit data-blocks, random phase noises are presented in received signals. Although the coherent-time of fading channel can be assumed
Channel measurements of large-scale multiuser multiple-input multiple-output (MU-MIMO) radio propagation channels are presented. In the setup, three users with patch antennas communicate simultaneously with a base station (BS) equipped with a large antenna array in an indoor environment. Both a uniform linear array (ULA) and a uniform planar array (UPA) are used, and their relative ability to sepa
Massive multiple-input multiple-output (MIMO) arrays are becoming critical elements in cellular base station infrastructure. We utilize the theory of characteristic modes (TCM) to design a novel tri-modal broadside antenna element which is suitable for the construction of compact massive MIMOarrays. The proposed antenna element consists of three ports which is formed by reviewing an existing compa
We analyze the downlink of a massive multiuser multiple input, multiple output (MIMO) system where antenna units at the base station are connected in a daisy chain without a central processing unit and only possess local channel knowledge. For this setup, we develop and analyze a linear precoding algorithm for suppressing interuser interference. It is demonstrated that the algorithm is close to ze
Reliable wireless communication links are a critical but challenging aspect for high-speed railway (HSR). To develop and analyze such systems, accurate models for the propagation channel are required. The radio channel properties in HSR scenarios are different from those in cellular scenarios not only due to the high velocity, but also due to the special construction elements and the type of surro
This paper presents a 16-lane, 16-bit complex application-specific instruction processor (ASIP) for baseband processing in massive multiple-input multiple-output (MIMO). The architecture utilizes a 3/4-way very large instruction word (VLIW) with highly efficient pre- and post-processing units specifically trimmed for massive MIMO requirements. Architecture optimizations include features like singl
This summary refers to the paper 'Comparison of the FMEA and STPA safety analysis methods-a case study' [Su17]. The paper was published as an article in the Software Quality Journal. It compares the Failure Mode and Effect Analysis (FMEA) and the System Theoretic Process Analysis (STPA) in an industrial case study.
Large open and closed source organizations like Google, Facebook and Mozilla are migrating their products towards rapid releases. While this allows faster time-to-market and user f eedback, it also implies less time for testing and bug fixing. Since initial research results indeed show that rapid releases fix proportionally less reported bugs than traditional releases, this paper investigates the
Computing is no longer considered a subject area only relevant for a narrow group of professionals, but rather as a vital part of general education that should be available to all children and youth. Since making changes to national curricula takes time, people are trying to find other ways of introducing children and youth to computing. In Sweden, several current initiatives by researchers and te
Input data for communication network design/optimization problems involving multi-hour or uncertain traffic can consist of a large set of traffic matrices. These matrices are explicitly considered in problem formulations for link dimensioning. However, many of these matrices are usually dominated by others so only a relatively small subset of matrices would be sufficient to obtain proper link capa
In this paper we propose a new algorithm for solving the Learning With Errors (LWE) problem based on the steps of the famous Blum-Kalai-Wasserman (BKW) algorithm. The new idea is to introduce an additional procedure of mapping subvectors into codewords of a lattice code, thereby increasing the amount of positions that can be cancelled in each BKW step. The procedure introduces an additional noise
Abstract in UndeterminedWe introduce Gaussian wave packets in pursuit of representations of functions, in which the representation is invariant under translation, modulation, scale,rotation and anisotropic dilation. Properties of both continuous and discrete representations are discussed. For the discrete (two-dimensional) case, we develop fastalgorithms for the application of the analysis and syn
