Sökresultat

Background: In software engineering, industry-academia is a symbiotic relationship. Researchers need to be aware of the industry to produce relevant research, while practitioners are educated in academia and could take advantage of empirical research. The SERP taxonomy architecture is designed to support communication between practitioners and researchers in software engineering. Objective: The pu

To remain competitive in the field of manufacturing today, companies must constantly improve the automation loops within their production plants. This can be done by augmenting the automation applications with "smart services" such as supervisory-control applications or machine-learning inference algorithms. The downside is that these smart services are often hosted in a cloud infrastructure and t

Running regression tests for Modelica models usually takes a long time. This paper presents a safe regression test selection technique for Modelica based on static analysis. The technique tracks dependencies between classes to compute which tests that need to be run given a change. The dependency rules have been verified using mutation testing. The technique has been evaluated on the Modelica Stan

We perform a land-surface model intercomparison to investigate how the simulation of permafrost area on the Tibetan Plateau (TP) varies among six modern stand-alone land-surface models (CLM4.5, CoLM, ISBA, JULES, LPJ-GUESS, UVic). We also examine the variability in simulated permafrost area and distribution introduced by five different methods of diagnosing permafrost (from modeled monthly ground

Just like current software systems, models are characterised by increasing complexity and rate of change. Yet, these models only become useful if they can be continuously evaluated and validated. To achieve sufficiently low response times for large models, incremental analysis is required. Reference Attribute Grammars (RAGs) offer mechanisms to perform an incremental analysis efficiently using dyn

During the last decade the variation in the human genome has been mapped in fine detail. Next generation sequencing has made it possible to cheaply and rapidly aquire vast amounts of biomolecular information on large cohorts of people. This have enabled large-scale epidemiological studies to investigate the relationships between environmental and genetic factors and human biomolecular traits. It i

We propose and analyze distributed computation algorithms for finite-horizon optimal control problems in transportation networks. We model traffic flow dynamics by the cell-transmission model and focus on two problems: system-optimum dynamic traffic assignment (where the routing is part of the optimization) and freeway network control (where the routing is exogenous and the optimization is confine

Massive multiple-input multiple-output (MIMO) is one of the key candidates for the upcoming 5G wireless generation. It offers a multitude of advantages over traditional techniques, such as reduced latency, reduced interference among user equipments (UEs) and increased spectrum and energy efficiencies. However, to verify the theoretically promised gains in real-life, prototype systems are inevitabl

Air-to-air refueling is a vital technique for extending the range and endurance of manned or unmanned aircraft, with over 1000 refueling procedures flown per day in military operations. The hardware used for air-to-air refueling needs to be tailored to the specific aircraft and airspeeds involved, performing markedly different for permutations of tanker and receiver craft. Extensive flight testing

Optimization problems with rank constraints appear in many diverse fields such as control, machine learning, and image analysis. Since the rank constraint is nonconvex, these problems are often approximately solved via convex relaxations. Nuclear norm regularization is the prevailing convexifying technique for dealing with these types of problem. This paper introduces a family of low-rank inducing

Despite the creativity of the scientific community and the funding agencies, the underlying model of computation behind IoT, WSN, cloud, edge, fog, and mist is fundamentally the same; Computational nodes which are dynamically interconnected to form a system in where both processing capacity and connectivity may vary over time. On top of such a system, we consider applications that need packets to

Given a weighted directed graph where some arcs can fail while others are reliable, we aim to compute a shortest pair of failure-disjoint paths. If a reliable arc is used by both paths, its cost is counted only once. We present a polynomial time algorithm to solve the problem.

To be able to connect wirelessly to the internet is nowadays a part of everyday life and the number of wireless devices accessing wireless networks worldwide are increasing rapidly. However, with the increasing number of wireless devices and applications and the amount available bandwidth, spectrum shortage is an issue. A promising way to increase the amount of available spectrum is to utilize fre

We derive the interarrival distribution of a workload input process which is a variation of the infinite source Poisson process for packet traffic. It accounts for long-range dependence and self-similarity exhibited by real traces in the Internet. The packet generation process is compound Poisson over each session which has a heavy tailed distribution. Considering the dependence induced by the wor