Combining different validation techniques for continuous software improvement - Implications in the development of TRNSYS 16

Validation using published, high quality test suites can serve to identify different problems in simulation software: modeling and coding errors, missing features, frequent sources of user confusion. This paper discusses the application of different published validation procedures during the development of a new TRNSYS version: BESTEST/ASHRAE 140 (Building envelope), HVAC BESTEST (mechanical systems) and IEA ECBCS Annex 21 / SHC Task 12 empirical validation (performance of a test cell with a very simple mechanical system). It is shown that each validation suite has allowed to identify different types of problems. Those validation tools were also used to diagnose and fix some of the identified problems, and to assess the influence of code modifications. The paper also discusses some limitations of the selected validation tools

A Fast Frequency Sweep – Green’s Function Based Analysis of Substrate Integrated Waveguide

In this paper, a fast frequency sweep technique is applied to the analysis of Substrate Integrated Waveguides performed with a Green’s function technique. The well-known Asymptotic Waveform Evaluation technique is used to extract the Padè approximation of the frequency response of Substrate Integrated Waveguides devices. The analysis is extended to a large frequency range by adopting the Complex Frequency Hopping algorithm. It is shown that, with this technique, CPU time can be reduced of almost one order of magnitude with respect to a point by point computation

Modelling Self-similar Traffic Of Multiservice Networks

Simulation modelling is carried out, which allows adequate describing the traffic of multiservice networks with the commutation of packets with the characteristic of burstiness. One of the most effective methods for studying the traffic of telecommunications systems is computer simulation modelling. By using the theory of queuing systems (QS), computer simulation modelling of packet flows (traffic) in modern multi-service networks is performed as a random self-similar process. Distribution laws such as exponential, Poisson and normal-logarithmic distributions, Pareto and Weibull distributions have been considered.The distribution of time intervals between arrivals of packages and the service duration of service of packages at different system loads has been studied. The research results show that the distribution function of time intervals between packet arrivals and the service duration of packages is in good agreement with the Pareto and Weibull distributions, but in most cases the Pareto distribution prevails.The queuing systems with the queues M/Pa/1 and Pa/M/1 has been studied, and the fractality of the intervals of requests arriving have been compared by the properties of the estimates of the system load and the service duration. It has been found out that in the system Pa/M/1, with the parameter of the form a> 2, the fractality of the intervals of requests arriving does not affect the average waiting time and load factor. However, when ≤2, as in the M/Pa/1 system, both considered statistical estimates differ.The application of adequate mathematical models of traffic allows to correctly assess the characteristics of the quality of service (QoS) of the network

Evaluating probabilistic forecasts with scoringRules

Probabilistic forecasts in the form of probability distributions over future events have become popular in several fields including meteorology, hydrology, economics, and demography. In typical applications, many alternative statistical models and data sources can be used to produce probabilistic forecasts. Hence, evaluating and selecting among competing methods is an important task. The scoringRules package for R provides functionality for comparative evaluation of probabilistic models based on proper scoring rules, covering a wide range of situations in applied work. This paper discusses implementation and usage details, presents case studies from meteorology and economics, and points to the relevant background literature

Computationally Efficient Simulation of Queues: The R Package queuecomputer

Large networks of queueing systems model important real-world systems such as MapReduce clusters, web-servers, hospitals, call centers and airport passenger terminals. To model such systems accurately, we must infer queueing parameters from data. Unfortunately, for many queueing networks there is no clear way to proceed with parameter inference from data. Approximate Bayesian computation could offer a straightforward way to infer parameters for such networks if we could simulate data quickly enough. We present a computationally efficient method for simulating from a very general set of queueing networks with the R package queuecomputer. Remarkable speedups of more than 2 orders of magnitude are observed relative to the popular DES packages simmer and simpy. We replicate output from these packages to validate the package. The package is modular and integrates well with the popular R package dplyr. Complex queueing networks with tandem, parallel and fork/join topologies can easily be built with these two packages together. We show how to use this package with two examples: a call center and an airport terminal.Comment: Updated for queuecomputer_0.8.