Search

The opening up of the railway to competition in Europe has been accompanied by many technical challenges never before seen in the railway field. One of these challenges concerns precise energy metering. As European railways have been a monopoly until now, the current systems can only measure the energy consumption of a single operator. In accordance with European law, the installation of an energy meter has been mandatory in new or refurbished rolling stocks since 2014. Nevertheless, these energy meters are still not fully reliable, with misreadings and missing readings being common occurrences. To address the problem of energy metering data reliability, this paper presents a method for validating the reading measurement based on a physical model and validates it in two different case studies. For the issue of energy metering data availability, different estimators are developed, and their performance are shown with the aim of calculating the missing consumptions for both case studies. Finally, the paper suggests how these methods may be implemented in other types of trains. [ABSTRACT FROM AUTHOR]

“Roam like Home” is the initiative of the European Commission (EC) to end the levy of extra charges when roaming within the European region. As a result, people can use data services more freely across Europe. However, the implications of roaming solutions on network performance have not been carefully examined yet. This paper provides an in-depth characterization of the implications of international data roaming within Europe. We build a unique roaming measurement platform using 16 different mobile networks deployed in six countries across Europe. Using this platform, we measure different aspects of international roaming in 4G networks in Europe, including mobile network configuration, performance characteristics, and quality of experience. We find that operators adopt a common approach to implement roaming called Home-routed roaming (HR). This results in additional latency penalties of 60 ms or more, depending on geographical distance. This leads to worse browsing performance, with an increase in the metrics related to Quality of Experience (QoE) of users (Page Load time and Speed Index) in the order of 15-20 percent. We further analyze in isolation the impact of latency on QoE metrics and find that the penalty imposed by HR leads to a degradation on QoE metrics up to 150 percent in case of intercontinental roaming. [ABSTRACT FROM AUTHOR]

The paper addresses a real-time optimization-based reference calculation integrated with a control structure for Modular Multilevel Converters (MMC) operating under normal and constrained situations (where it has reached current and/or voltage limitations, as it may occur during system faults). Firstly, a nonlinear optimization problem has been developed in which it prioritizes to satisfy the AC grid current set-points imposed by the transmission System Operator (TSO). The constrained nonlinear optimization problem is formulated based on the steady-state model of the MMC, whereby the prioritization is achieved through distinct weights defined in the Objective Function’s (OF) terms. The resultant optimization problem, however, is highly nonlinear requiring high computation burden to be solved in real-time. To cope with this issue, this paper applies a Linear Time-Varying (LTV) approximation, which permits to represent the nonlinear dynamics of the system as constant parameters, while a Linear Time-Invariant (LTI) system is used to formulate the optimization constraints. The converter’s current references are determined in real-time by solving a constrained linearized optimization problem at each control time step, which considers the TSO’s demands, the current MMC operating point and its physical limitations. Theoretical analyses comparing the responses of the linear and nonlinear optimization problems are performed to validate the accuracy of the LTV approximation. Finally, the linearized-optimization problem is integrated with the MMC controllers, evaluated under different AC and DC network conditions and compared with conventional control strategies, where it is shown that the presented method can be potentially employed to obtain the MMC current references for distinct network scenarios. [ABSTRACT FROM AUTHOR]

This paper studies the problem of constructing codes correcting deletions in arrays. Under this model, it is assumed that an $n \times n$ array can experience deletions of rows and columns. These deletion errors are referred to as $({t_{\mathrm {r}}}, {t_{\mathrm {c}}})$ -criss-cross deletions if ${t_{\mathrm {r}}}$ rows and ${t_{\mathrm {c}}}$ columns are deleted, while a code correcting these deletion patterns is called a $({t_{\mathrm {r}}}, {t_{\mathrm {c}}})$ -criss-cross deletion correction code. The definitions for criss-cross insertions are similar. It is first shown that when $t_{r}=t_{c}$ the problems of correcting criss-cross deletions and criss-cross insertions are equivalent. The focus of this paper lies on the case of (1, 1)-criss-cross deletions. A non-asymptotic upper bound on the cardinality of (1, 1)-criss-cross deletion correction codes is shown which assures that the redundancy is at least $2n-3+2\log n$ bits. A code construction with an existential encoding and an explicit decoding algorithm is presented. The redundancy of the construction is at most $2n+4 \log n + 7 +2 \log e$. A construction with explicit encoder and decoder is presented. The explicit encoder adds an extra $5\log n + 5$ bits of redundancy to the construction. [ABSTRACT FROM AUTHOR]

This paper investigates the problem of correcting multiple criss-cross insertions and deletions in arrays. More precisely, we study the unique recovery of $n \times n$ arrays affected by ${t}$ -criss-cross deletions defined as any combination of ${t_{\mathrm {r}}}$ row and ${t_{\mathrm {c}}}$ column deletions such that ${t_{\mathrm {r}}}+ {t_{\mathrm {c}}}= {t}$ for a given $t$. We show an equivalence between correcting ${t}$ -criss-cross deletions and ${t}$ -criss-cross insertions and show that a code correcting ${t}$ -criss-cross insertions/deletions has redundancy at least ${t} n + {t}\log n - \log ({t}!)$. Then, we present an existential construction of a ${t}$ -criss-cross insertion/deletion correcting code with redundancy bounded from above by ${t} n + \mathcal {O}({t}^{2} \log ^{2} n)$. The main ingredients of the presented code construction are systematic binary ${t}$ -deletion correcting codes and Gabidulin codes. The first ingredient helps locating the indices of the inserted/deleted rows and columns, thus transforming the insertion/deletion-correction problem into a row/column erasure-correction problem which is then solved using the second ingredient. [ABSTRACT FROM AUTHOR]

In this article, we present a new construction of evaluation codes in the Hamming metric, which we call twisted Reed–Solomon codes. Whereas Reed–Solomon (RS) codes are MDS codes, this need not be the case for twisted RS codes. Nonetheless, we show that our construction yields several families of MDS codes. Further, for a large subclass of (MDS) twisted RS codes, we show that the new codes are not generalized RS codes. To achieve this, we use properties of Schur squares of codes as well as an explicit description of the dual of a large subclass of our codes. We conclude the paper with a description of a decoder, that performs very well in practice as shown by extensive simulation results. [ABSTRACT FROM AUTHOR]

In this paper, we analyze the high-SNR regime of the $M\times K$ Network MISO channel in which each transmitter has access to a different channel estimate, possibly with different precision. It has been recently shown that, for some regimes, this setting attains the same Degrees-of-Freedom as the ideal centralized setting with perfect Channel State Information (CSI) sharing, in which all the transmitters are endowed with the best estimate available at any transmitter. This result is restricted by the limitations of the Degrees-of-Freedom metric, as it only provides information about the slope of growth of the capacity as a function of the SNR, without any insight about the possible performance at a given SNR. In order to overcome this limitation, we analyze the affine approximation of the rate on the high-SNR regime for this decentralized Network MISO setting for the antenna configurations in which it achieves the Degrees-of-Freedom of the centralized setting. We show that, for a regime of antenna configurations, it is possible to asymptotically attain the same achievable rate as in the ideal centralized scenario. Consequently, it is possible to achieve the beamforming gain of the ideal perfect-CSI-sharing setting even if only a subset of transmitters is endowed with precise CSI, which can be exploited in scenarios such as distributed massive MIMO where the number of transmit antennas is much bigger than the number of served users. This outcome is a consequence of the synergistic compromise between CSI precision at the transmitters and consistency between the locally-computed precoders, which is an inherent trade-off of decentralized settings that does not exist in the centralized CSI configuration. We propose a precoding scheme achieving the previous result, which is built on an uneven structure in which some transmitters reduce the precision of their own precoding vector for the sake of using transmission parameters that can be more easily predicted by the other transmitters. [ABSTRACT FROM AUTHOR]

Interleaved Reed–Solomon codes admit efficient decoding algorithms which correct burst errors far beyond half the minimum distance in the random errors regime, e.g., by computing a common solution to the Key Equation for each Reed–Solomon code, as described by Schmidt et al. If this decoder does not succeed, it may either fail to return a codeword or miscorrect to an incorrect codeword, and good upper bounds on the fraction of error matrices for which these events occur are known. The decoding algorithm immediately applies to interleaved alternant codes as well, i.e., the subfield subcodes of interleaved Reed–Solomon codes, but the fraction of decodable error matrices differs, since the error is now restricted to a subfield. In this paper, we present new general lower and upper bounds on the fraction of error matrices decodable by Schmidt et al.’s decoding algorithm, thereby making it the only decoding algorithm for interleaved alternant codes for which such bounds are known. [ABSTRACT FROM AUTHOR]

Securing profits from energy, reserve capacity and balancing markets is critical to ensure the profitability of battery energy systems (BES). However, the intimate connection between offers on these trading floors combined with the limited energy storage capacity of BES renders its scheduling very complex. In this paper, we develop a bilevel optimization problem for strategic participation of a BES in the day-ahead energy-reserve and balancing markets, improving the state-of-the-art by (i) considering the conditional-value-at-risk; (ii) ensuring the real-time feasibility of the obtained day-ahead schedule; (iii) addressing the operational underperformance risk stemming from inaccurate battery modeling. In a case study, we illustrate how the proposed model allows risk-averse BES owners to hedge their day-ahead position without jeopardizing their expected profit, while ensuring the feasibility of their day-ahead schedule. [ABSTRACT FROM AUTHOR]

Transitioning from fossil fuel dominated power systems to high penetrations of intermittent renewable generation is affecting classical electricity market designs. Here, a method is proposed to model and assess the absence of co-optimization of energy and reserve that prevails in the European system. Co-optimization is formulated through an optimization problem (COM), and its absence as an equilibrium problem (EQM) built on Karush-Kuhn-Tucker conditions of agents’ optimization and market clearing equations. EQM cannot be reformulated as a single optimization problem. Market distortions are identified by comparing the complementarity conditions of both models. These are then discussed on system with Feed in Premium to wind generation. Parameters in the models allow to represent different market configurations regarding: available wind generation, Feed in Premium to wind, generators’ risk aversion, and required reserve from wind generation. [ABSTRACT FROM AUTHOR]

Network constraints play a key role in the price finding mechanism for European Power Markets, but historical data is very sparse and usually insufficient for many quantitative applications. We reconstruct the constraints data, known as the Power Transmission Distribution Factors (PTDFs) and Remaining Available Margins (RAMs), by first recovering the underlying time dependent signals known as the Generation Shift Keys (GSKs) and Phase Angles (PAs), and the electricity grid characteristics, via a mathematical optimisation problem. This is solved by exploiting marginal convexity in certain subspaces via alternating minimisation. The GSKs and PAs are then mapped to the PTDFs and RAMs, using the grid structure. Our reconstruction achieves in-sample relative errors of 22.3% and 15.9% for the PTDFs and RAMs respectively, while the out-of-sample ones are 25.4% and 18.1% respectively. We further show that our model outperforms the naive approach, and that the reconstructed GSKs and PAs recover specific structure. [ABSTRACT FROM AUTHOR]

Convex hull pricing is a well-documented method for coping with the non-existence of uniform clearing prices in electricity markets with non-convex costs and constraints. We revisit primal and dual methods for computing convex hull prices, and discuss the positioning of existing approximation methods in this taxonomy. We propose a dual decomposition algorithm known as the Level Method and we adapt the basic algorithm to the specificities of convex hull pricing. We benchmark its performance against a column generation algorithm that has recently been proposed in the literature. We provide empirical evidence about the favorable performance of our algorithm on large test instances based on PJM and Central Europe. [ABSTRACT FROM AUTHOR]

We propose a chance-constrained formulation for the problem of dimensioning frequency restoration reserves on a power transmission network. We cast our problem as a two-stage stochastic mixed integer linear program, and propose a heuristic algorithm for solving the problem. Our model accounts for the simultaneous sizing of both upward and downward reserves, and uncertainty driven by imbalances, contingencies and available transmission capacity. Our core methodology is further adapted in order to minimize inter-zonal flows and in order to split reserve requirements between automatic and manual frequency restoration reserves. We apply our methodology to the problem of sizing reserves in the four load frequency control areas of the Swedish power system. We demonstrate the benefits of our method in terms of decreasing reserve requirements in the absence of reserve sharing, we analyze the spatial allocation of reserves, and we perform various sensitivity analyses. [ABSTRACT FROM AUTHOR]

Multiple scattering of parallel cylinders with arbitrary cross section is computed using the T-matrix of each single scatterer and the general translational matrix for cylindrical waves. Usually, the recommended golden rule to compute the translational matrix is Graf’s addition theorem. However, this approach cannot be properly implemented for some geometries, such as in a two-cylinder case when the center of one of them falls within the minimum circular cylinder that circumscribes the other one. In order to overcome this limitation, a transformation between cylindrical waves and plane waves, followed by propagation of the latter, is proposed. The new approach succeeds due to an adequate truncation of the evanescent plane wave spectrum. This strategy is demonstrated by studying the scattering of three infinite elliptic metallic cylinders for different electrical sizes and observing the convergence of the results as a function of the truncated spectrum. Finally, to conclusively show the interest and applicability of the approach, two more complex problems are treated: a group of infinite elliptic metallic cylinders where two different sizes are combined and a practical real-life filter in substrate integrated waveguide (SIW) technology, including several groups of rectangular dielectric cylinders. [ABSTRACT FROM AUTHOR]

We propose the first non-trivial generic decoding algorithm for codes in the sum-rank metric. The new method combines ideas of well-known generic decoders in the Hamming and rank metric. For the same code parameters and number of errors, the new generic decoder has a larger expected complexity than the known generic decoders for the Hamming metric and smaller than the known rank-metric decoders. Furthermore, we give a formal hardness reduction, providing evidence that generic sum-rank decoding is computationally hard. As a by-product of the above, we solve some fundamental coding problems in the sum-rank metric: we give an algorithm to compute the exact size of a sphere of a given sum-rank radius, and also give an upper bound as a closed formula; and we study erasure decoding with respect to two different notions of support. [ABSTRACT FROM AUTHOR]

This is the story of how Unix users hacked the European data networks competition in the 1980s, by using and appropriating common resources for their own experimental and operational needs while planting the seeds of participatory digital culture, both within and outside of the European Union's tech policies frame, both in prominent roles and behind the scenes of the "standards wars". I analyze how they were acknowledged among international computer networks, focusing on EUNET (1982–1992), a pioneering Internet provider in Europe. I show that Unix culture, beyond technical arguments, was reframed through their institutional relationships, when EUNET were courted by the EU tech programs to help develop a digital infrastructure for the knowledge sector. Eventually, the organization contributed but also profited from this alliance, before turning towards the new business of computerized telecom networks, illustrating the transfers between the knowledge institutions and the knowledge economy. [ABSTRACT FROM AUTHOR]

The solutions recommended by international roadmaps and technical reports on smart metering refer to interval metering with time resolutions higher than 15 min to 1 h as traditionally used. Based on the characteristics of the users’ power patterns in distribution networks, this article shows that in practical cases the resolutions of the traditional metering are not sufficient to assess peak power and network losses effectively. Effective interval metering solutions should have resolutions of one minute or less. Moreover, this article shows the advantages of assessing the average power peak (amplitude and duration) and estimating the network losses through innovative solutions beyond interval metering, based on event-driven energy metering. The use of EDM significantly enhances the quality of pattern representation and reduces the amount of data required with respect to high-resolution interval metering. Based on the Pareto analysis of conflicting objectives, a novel procedure to set up the EDM thresholds is presented. The applications shown use real data and refer to a single user, some users connected to a distribution network feeder, and many users connected to a large distribution system. The EDM benefits are quantified using specific indicators that consider energy losses and peak power. [ABSTRACT FROM AUTHOR]

Energy transition toward smart grids with deep impact of renewables, energy storage systems, and electric vehicle charging stations will increasingly promote the establishment of energy communities that own portions of the electricity grid. The energy communities will consist of clusters of multiunit buildings and or single residential units aggregated sharing a common or multiple medium and low voltage (MV/LV) electrical substations. The size and impact of the location of these MV/LV substations can constitute a barrier especially for highly urbanized contexts where it is very complicated to provide technical spaces inside buildings for large technical systems like transformers, MV switchgear, etc. The idea of this work consists of developing a compact outdoor MV/LV substation to reduce the overall dimensions and to make the execution modularized to facilitate management and maintenance. Also an investigation of energy exchange between multiunit buildings, which are considered as the real energy community case study. The main objective for this case study is to minimize the operation cost of the system by maximizing the self-consumption. [ABSTRACT FROM AUTHOR]

This article presents a cryptographic hardware (HW) accelerator supporting multiple advanced encryption standard (AES)-based block cipher modes, including the more advanced cipher-based MAC (CMAC), counter with CBC-MAC (CCM), Galois counter mode (GCM), and XOR-encrypt-XOR-based tweaked-codebook mode with ciphertext stealing (XTS) modes. The proposed design implements advanced and innovative features in HW, such as AES key secure management, on-chip clock randomization, and access privilege mechanisms. The system has been tested in a RISC-V-based system-on-chip (SoC), specifically designed for this purpose, on an Ultrascale + Xilinx FPGA, analyzing resource and power consumption, together with system performances. The cryptoprocessor has been then synthesized on a 7-nm CMOS standard-cells technology; performances, complexity, and power consumption information are analyzed and compared with the state of the art. The proposed cryptoprocessor is ready to be embedded within the innovative European Processor Initiative (EPI) chip. [ABSTRACT FROM AUTHOR]