Search results

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

We analyze reinforcement learning under so-called "dynamic reinforcement." In reinforcement learning, each agent repeatedly interacts with an unknown environment (i.e., other agents), receives a reward, and updates the probabilities of its next action based on its own previous actions and received rewards. Unlike standard reinforcement learning, dynamic reinforcement uses a combination of long-ter

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

This paper presents a Sorted QR-Decomposition (SQRD) processor for 3GPP LTE-A system. It achieves energy efficiency by co-optimizing techniques, such as heterogeneous processing, reconfigurable architecture, and dual-supply voltage operation. At algorithm level, a low-complexity hybrid decomposition scheme is adopted, which switches, depending on the energy distribution of spatial channels, betwee

In models of plant volatile isoprenoid emissions, the instantaneous compound emission rate typically scales with the plant's emission potential under specified environmental conditions, also called as the emission factor, ES. In the most widely employed plant isoprenoid emission models, the algorithms developed by Guenther and colleagues (1991, 1993), instantaneous variation of the steady-state em

Stability of Wardrop equilibria is analyzed for dynamical transportation networks in which the drivers' route choices are influenced by information at multiple temporal and spatial scales. The considered model involves a continuum of nonatomic indistinguishable drivers commuting between a common origin-destination pair in an acyclic transportation network. The drivers' route choices are affected b

Open innovation (OI) means that innovation is fostered by using both external and 5 internal influences in the innovation process. In software engineering (SE), OI has existed 6 for decades, while we currently see a faster and broader move towards OI in SE. We there- 7 fore survey research on how OI takes place and contributes to innovation in SE. This study 8 aims to synthesize the research knowl

This paper presents a heterogeneous reconfigurable cell array, designed for high-throughput baseband processing of multiple-input multiple-output (MIMO) systems. To achieve high performance and energy efficiency while retaining high flexibility, the proposed architecture adopts heterogeneous and hierarchical resource deployments. Additionally, extensive vector computation enhancements and flexible

Lately, much work in the area of voltage stability assessment has been focused on finding post-contingency corrective controls. In this article a contribution to this area will be presented where we investigate the surface of maximal loadability while allowing for post-contingency corrective controls. This objective is different from the usual, where the aim is to include the post-contingency cont

In this paper we consider the classical problem of finding a low rank approximation of a given matrix. In a least squares sense a closed form solution is available via factorization. However, with additional constraints, or in the presence of missing data, the problem becomes much more difficult. In this paper we show how to efficiently compute the convex envelopes of a class of rank minimization

This paper presents an area/energy efficient soft-output MIMO detector that supports the detection of spatial-multiplexing (SM), spatial-diversity (SD), and space-division-multiple-access (SDMA)signals. The developed near-optimal detection algorithms for these tree modes share most of the mathematical operations to enable extensive hardware reuse. A unified VLSI architecture is accordingly designe

This paper discusses the significance of physical models in engineering education. Obvious assets, drawbacks and the educational role of such models are discussed, and the idea of 'open physical models' is introduced. A couple of sophisticated open physical models (an unmanned rotorcraft and an inverted pendulum robot), used in control engineering courses, are presented. Basic ideas and concepts,

The F-FCSR stream cipher family has been presented a few years ago. Apart from some flaws in the initial propositions, corrected in a later stage, there are no known weaknesses of the core of these algorithms. Two variants, F-FCSR-H and F-FCSR-16, were proposed in the eSTREAM project, and F-FCSR-H v2 is one of the ciphers selected for the eSTREAM portfolio. In this paper we present a new and sever

Network re-optimization is a process that must be triggered periodically in order to improve the inefficient resource allocation of online routing heuristics due to the uncertainty of online lightpath demand arrivals and departures. Network re-optimization involves two tasks: a) finding new lightpaths for a (sub)set of current demands, i.e. rerouting, and b) migrating the current traffic to the ne

We use a 2-dimensional (2-D) Vernier gated-ring-oscillator (GRO) time-to-digital-converter (TDC) in a cascade structure (MASH), so that a larger raw quantization step can be allowed without sacrificing the final resolution performance. The 2-D approach effectively reduces the latency time under a large input, while the MASH structure provides a 2nd-order noise shaping that produces a lower in-band