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]

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]

Determining contingency aware dispatch decisions by solving a security-constrained optimal power flow (SCOPF) is challenging for real-world power systems, as the high problem dimensionality often leads to impractical computational requirements. This problem becomes more severe when the SCOPF has to be solved not only for a single instance, but for multiple periods, e.g. in the context of electricity market analyses. This paper proposes an algorithm that identifies the minimal set of constraints that exactly define the space of feasible nodal injections for a given network and contingency scenarios. By internalizing the technical limits of the nodal injections and enforcing a minimal worst-case impact of contingencies to line flows, computational effort can be further improved. The case study applies and analyzes the methods on the IEEE 118 and A&M 2000 bus systems, as well as the German and European transmission systems. In all tested cases the proposed algorithm identifies at least 95% of the network and security constraints as redundant, leading to significant SCOPF solve time reductions. Scalability and practical implementation are explicitly discussed. The code and input data of the case study is published supplementary to the paper under an open-source license. [ABSTRACT FROM AUTHOR]

This paper investigates the debt clearing problem in a debt network with complicated debt relations among various debtors. Each pair of debt relations is modeled with both forward debt chain and backward debt chain to simplify the whole debt network with a developed algorithm. A debt clearing strategy is derived and its benefits and managerial implications are shown in risk management. This paper further demonstrates the validation of the approach for sovereign debt analysis and risk analytics using real debt data from ten developed countries. [ABSTRACT FROM AUTHOR]

Moving towards regional Supergrids, an increasing number of interconnections are formed by High Voltage Direct Current (HVDC) lines. Currently, in most regions, HVDC losses are not considered in market operations, resulting in additional costs for Transmission System Operators (TSOs). Nordic TSOs have proposed the introduction of HVDC loss factors in the market clearing algorithm, to account for the cost of losses and avoid HVDC flows between zones with zero price difference. In this paper, we introduce a rigorous framework to assess the introduction of loss factors, in particular HVDC loss factors, in nodal and zonal pricing markets. First, we focus on the identification of an appropriate loss factor. We propose and compare three different models: constant, linear, and piecewise linear. Second, we introduce formulations to include losses in market clearing algorithms. Carrying numerical tests for a whole year, we find that accounting only for HVDC or AC losses may lead to lower social welfare for a non-negligible amount of time. To counter this, this paper introduces a framework for including both AC and HVDC losses in a zonal or nodal pricing environment. We show both theoretically and through simulations that such a framework is guaranteed to increase social welfare. [ABSTRACT FROM AUTHOR]

Recent research in intelligent transportation system focus on different possible use cases. Among them are the payment applications with cooperative intelligent transport system (C-ITS) equipment. In this paper, we deal about the tolling application performed with the C-ITS equipment. These latter use the ITS-G5 technology, the Roadside Unit (RSU) and the on-board unit (OBU) with features specified by the standardization Institute ETSI. To perform this service, we highlight two mains requirements: how to have a reliable geolocation of the vehicle when it crosses the tollgate and how to secure the communication during the transaction process. In this paper, we will address the methods that is propose to solve the issue of geolocation. The proposed method takes advantage of the communications data. It uses the principle of Differential - GPS mixed with Kalman filtering and extended Kalman filtering applied to the GPS and CAN bus measurements received by the RSU from the connected vehicles. The kinematic of the vehicle is taken into account to choose the suitable system model. Here as novelties, we discuss about the whole procedure to perform the geolocation process during the tolling service and we have results when we apply the dynamic model according to the real behavior of the vehicle when approaching and crossing the toll station. [ABSTRACT FROM AUTHOR]

With Europe dedicated to limiting climate change and greenhouse gas emissions, large shares of Renewable Energy Sources (RES) are being integrated in the national grids, phasing out conventional generation. The new challenges arising from the energy transition will require a better coordination between neighboring system operators to maintain system security. To this end, this paper studies the benefit of exchanging primary frequency reserves between asynchronous areas using the Supplementary Power Control (SPC) functionality of High-Voltage Direct-Current (HVDC) lines. First, we focus on the derivation of frequency metrics for asynchronous AC systems coupled by HVDC interconnectors. We compare two different control schemes for HVDC converters, which allow for unilateral or bilateral exchanges of reserves between neighboring systems. Second, we formulate frequency constraints and include them in a unit commitment problem to ensure the N-1 security criterion. A data-driven approach is proposed to better represent the frequency nadir constraint by means of cutting hyperplanes. Our results suggest that the exchange of primary reserves through HVDC can reduce up to 10% the cost of reserve procurement while maintaining the system N-1 secure. [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]

This paper proposes an adaptive network fuzzy inference system (ANFIS) based decision support system that can provide European policy makers with systematic guidance in allocating and prioritizing scant public resources, whilst accomplishing the best growth performance at a regional level. We do so by taking the stance of the Smart Specialization Strategies, which aim at consolidating the regional strengths and make effective and efficient use of public investment in R&D. By applying the ANFIS method, we were able to understand how—and to what extent—the competitiveness drivers promoted technological development and how the latter contributes to the economic growth of European regions. We used socio–economic, spatial, and patent-based data to train, test, and validate the models. What emerges is that an increase of R&D investments enhances the regional employment rate and the number of patents per capita; in turn, by taking into account the several combinations of specialization and diversification indicators, this leads to an increase of the regional gross domestic product (GDP). [ABSTRACT FROM AUTHOR]

Already in the 1960s, Levenshtein and others studied error-correcting codes that protect against synchronization errors, such as symbol insertions and deletions. However, despite significant efforts, progress on designing such codes has been lagging until recently, particularly compared to the detailed understanding of error-correcting codes for symbol substitution or erasure errors. This paper surveys the recent progress in designing efficient error-correcting codes over finite alphabets that can correct a constant fraction of worst-case insertions and deletions. Most state-of-the-art results for such codes rely on synchronization strings, simple yet powerful pseudo-random objects that have proven to be very effective solutions for coping with synchronization errors in various settings. This survey also includes an overview of what is known about synchronization strings and discusses communication settings related to error-correcting codes in which synchronization strings have been applied. [ABSTRACT FROM AUTHOR]

The concept of segmented AC power systems interconnected by means of HVDC is becoming more and more significant for many cases worldwide. Such systems already exist and will become more complex with the increasing emergence of HVDC links and grids. The concept of a grid composed of multiple subgrids motivates the need to define the governing roles of Interconnecting Power Converters (IPC) which connect the different subgrids. Such IPC can have various operation modes which are presented and analyzed in this paper. In addition, the principles of operation needed for each individual subgrid and for the overall system are introduced and discussed. The resulting fundamental equations are outlined and combined in a power flow formulation of the overall system. A simple case study is presented to illustrate the power flow formulation in a grid of multiple subgrids, also introducing example dynamic simulations of transitions between different operating points. [ABSTRACT FROM AUTHOR]

In this paper, we present a two-stage model of zonal electricity markets with day-ahead market clearing and real-time re-dispatch and balancing that accounts for transmission line switching at both stages. We show how the day-ahead problem with switching can be formulated as an adaptive robust optimization problem with mixed integer recourse and present a new algorithm for solving the adversarial max-min problem that obeys the structure of an interdiction game. We apply the model on a realistic instance of the Central Western European system and comment on the impacts of both proactive and reactive transmission switching on the operating costs of the system. Part I presents day-ahead models of a short-term zonal electricity market with switching, and describes our algorithmic approach for solving these models efficiently. Part II describes variants of the real-time model, and presents the results of our case study on the Central Western European market. [ABSTRACT FROM AUTHOR]

In this paper, we present a two-stage model of zonal electricity markets with day-ahead market clearing, and real-time re-dispatch and balancing that accounts for transmission line switching at both stages. We show how the day-ahead problem with switching can be formulated as an adaptive robust optimization problem with mixed integer recourse, and present a new algorithm for solving the adversarial max-min problem that obeys the structure of an interdiction game. We apply the model on a realistic instance of the Central Western European system, and comment on the impacts of both proactive, and reactive transmission switching on the operating costs of the system. Part I presents day-ahead models of a short-term zonal electricity market with switching, and describes our algorithmic approach for solving these models efficiently. Part II describes variants of the real-time model, and presents the results of our case study on the Central Western European market. [ABSTRACT FROM AUTHOR]

Depression is ranked as the largest contributor to global disability and is also a major reason for suicide. Still, many individuals suffering from forms of depression are not treated for various reasons. Previous studies have shown that depression also has an effect on language usage and that many depressed individuals use social media platforms or the internet in general to get information or discuss their problems. This paper addresses the early detection of depression using machine learning models based on messages on a social platform. In particular, a convolutional neural network based on different word embeddings is evaluated and compared to a classification based on user-level linguistic metadata. An ensemble of both approaches is shown to achieve state-of-the-art results in a current early detection task. Furthermore, the currently popular $ERDE$ E R D E score as metric for early detection systems is examined in detail and its drawbacks in the context of shared tasks are illustrated. A slightly modified metric is proposed and compared to the original score. Finally, a new word embedding was trained on a large corpus of the same domain as the described task and is evaluated as well. [ABSTRACT FROM AUTHOR]

This paper presents a novel methodology for the conversion of balancing energy offers, submitted during the integrated scheduling process (ISP) of European central-dispatch systems, into replacement reserve (RR) standard products. The aim is to allow the integration of the balancing market of central-dispatch systems, where generating unit operating constraints and real-time dispatch lie in the responsibility of the TSO, with the pan-European balancing market mainly characterized by self-dispatch arrangements and portfolio-based market participation. To respect the diversified clearing rules of both systems, we propose a break-down of the one-shot RR clearing problem into four distinct steps: (a) a local RR quantity maximization process, where the maximum quantity of upward and downward RR balancing energy offered by each balancing service provider (BSP) is defined by the TSO subject to detailed unit operating limitations, (b) a local mandatory activation process, driven by binding unit constraints determined in the previous step, (c) a local conversion process, during which the ISP offers are converted into RR standard products, and (d) the purely economic RR clearing to obtain the activated volumes. Four different modeling approaches are constructed, the attained solution of which is compared with the one-shot techno-economic clearing benchmark currently applied in central-dispatch systems. The comparison indicates that the break-down process results coincide with the one-shot benchmark results, achieving identical social welfare and final unit dispatch, while additionally allowing less-costly Europe-wide cross-border activations of RR. [ABSTRACT FROM AUTHOR]

In this paper, we propose a framework, based on the combined use of single- and multiuser detection, to jointly optimize the achievable rates of two signals sharing the same frequency in the forward link of a multibeam satellite system. We then propose the application of the described framework to two different scenarios of interest. First, we consider a uniform coverage scenario, aimed at maximizing the average throughput per beam in a realistic coverage condition. We compare different solutions based on alternative frequency reuse (FR) schemes and different receiver strategies. We demonstrate that the use of multiuser detection can achieve significant gains over a reference strategy based on single-user detection. Next, we analyze a “hotspot” case, where resources are pulled from empty beams to serve a beam with a high service demand. Also in this case, we compare several strategies and FR schemes. We show that the best performance is achieved by a scheme adopting three colors and single-user detection. [ABSTRACT FROM AUTHOR]

Whereas the design and properties of bent and plateaued functions have been frequently addressed during the past few decades, there are only a few design methods of the so-called five-valued spectra Boolean functions whose Walsh spectra take the values in $\{0, \pm 2^{\lambda _{1}}, \pm 2^{\lambda _{2}}\}$. Moreover, these design methods mainly regard the specification of these functions in their algebraic normal form (ANF) domain. In this paper, we give a precise characterization of this class of functions in their spectral domain using the concept of a dual of plateaued functions. Both necessary and sufficient conditions on the Walsh support of these functions are given, which then connects their design (in the spectral domain) to a family of the so-called totally (non-overlap) disjoint spectra plateaued functions. We identify some suitable families of plateaued functions having this property, thus providing some generic methods in the spectral domain. Furthermore, we also provide an extensive analysis of their constructions in the ANF domain and provide several generic design methods. The importance of this class of functions is manifolded, where apart from being suitable for some cryptographic applications, we emphasize their property of being constituent functions in the so-called four-bent decomposition. [ABSTRACT FROM AUTHOR]

In this paper, shaped continuous parallel plate waveguide delay lenses are proposed. The previous configurations introduced by the authors displayed a residual side lobe imbalance, showing the limitations of elliptical delay lens profiles, derived from a starting bifocal constrained lens. Polynomial profiles are proposed here as a way to enhance the scanning performance and the pattern shape. Optimized configurations demonstrate a reduction in the phase aberration levels over a large scanning range ([−30°, 30°]). The associated radiation patterns demonstrate lower and more balanced first side lobe levels (SLLs) ($\cong -18$ dB), as compared to the previous elliptical approach ($\cong -13.2$ dB). A validation has been proposed through the manufacturing and test of a prototype over the down-link Ka-band ([27.5–31] GHz). Excellent radiation performance [half-power beamwidth (HPBW), SLL] has been experimentally obtained over a wide angular range ([−31.5°, 31.5°]), including low scanning loss and high radiation stability over the entire frequency range. High radiation efficiencies are demonstrated with this fully metallic design, particularly suitable for space applications. The mechanical simplicity offered by the concept is also quite attractive for low-cost multi-beam platforms. [ABSTRACT FROM AUTHOR]

In 1959, Rényi proposed the information dimension and the $d$ -dimensional entropy to measure the information content of general random variables. This paper proposes a generalization of information dimension to stochastic processes by defining the information dimension rate as the entropy rate of the uniformly quantized stochastic process divided by minus the logarithm of the quantizer step size $1/m$ in the limit as $m\to \infty $. It is demonstrated that the information dimension rate coincides with the rate-distortion dimension, defined as twice the rate-distortion function $R(D)$ of the stochastic process divided by $-\log (D)$ in the limit as $D\downarrow 0$. It is further shown that among all multivariate stationary processes with a given (matrix-valued) spectral distribution function (SDF), the Gaussian process has the largest information dimension rate and the information dimension rate of multivariate stationary Gaussian processes is given by the average rank of the derivative of the SDF. The presented results reveal that the fundamental limits of almost zero-distortion recovery via compressible signal pursuit and almost lossless analog compression are different in general. [ABSTRACT FROM AUTHOR]

This paper presents an innovative global navigation satellite system (GNSS) fault detection and exclusion approach for the adoption of satellite localization in the rail sector. Current global integrity monitoring systems cannot guarantee the safety level needed for such applications as train control where tolerable hazard rate in the order of 10−9/h is required. A new method, named two tiers, enabling to integrate local augmentation systems and global augmentation infrastructures, is presented. It is based on the comparison of single differences residuals among satellites for detecting signal in space (SIS) faults and double difference residuals among local augmentation stations and satellite-based augmentation systems ranging and integrity monitoring stations for detecting reference stations faults. GPS SIS faults described in literature and real GNSS raw data recorded on a train are taken into account. This study reports the performance analysis for the two-tiers approach carried out during relevant European projects. A test-bed architecture has been developed through the implementation of the algorithm in real time on a local augmentation operational center. Relevant performances have been tested on a rail track for validating the algorithm in real operative conditions. Significant results of the analysis are reported for SIS integrity assessment only. [ABSTRACT FROM AUTHOR]

The first of this two-paper series addresses a practical day-ahead auction model, where generation revenue constraints are explicitly incorporated in the problem formulation, as routinely done in several national electricity markets across Europe. The revenue-constrained market-clearing procedure includes the effect of the transmission network, inter-temporal constraints associated with generation scheduling, demand-side bidding, and marginal pricing. This auction design is an instance of price-based market clearing which features two major complicating factors. First, locational marginal prices become decision variables of the optimization process. In addition, producer revenues are formulated as bilinear and highly nonconvex products of power outputs and market-clearing prices. The resulting problem is formulated as a mixed-integer nonlinear bilevel program with bilinear terms for which available solution techniques rely on heuristics, approximations, or modeling simplifications. This paper presents a novel and exact methodology whereby the original problem is recast as an equivalent single-level mixed-integer linear program. As a consequence, finite convergence to optimality is guaranteed and the use of standard commercial software is allowed. The proposed transformation is based on duality theory of linear programming, Karush-Kuhn-Tucker optimality conditions, and integer algebra results. In the second part of this two-paper series, numerical results from several case studies illustrate the effective performance of the proposed solution approach. [ABSTRACT FROM AUTHOR]

A novel model for the clearing of European day-ahead electricity markets, with all associated types of orders, namely simple hourly orders, block orders, complex orders and PUN (“Prezzo Unico Nazionale”) orders is presented in this paper. An iterative algorithm is employed for the market clearing, bearing an inner iteration process for the handling of Paradoxically Accepted block and MIC orders, and an outer iteration process for the handling of PUN orders. During the iterative process a Master Problem and a PUN subproblem are sequentially solved and coordinated, for the efficient handling of all order clearing conditions and market and/or system constraints. The clearing conditions of each order type are explicitly incorporated in the PUN subproblem, formulating a Mixed Complementarity Problem bearing both primal and dual decision variables. The PUN subproblem concerns the sequential clearing of 24 hourly subproblems, employing a special technique for handling the possible inefficiencies due to the myopic nature of the hourly subproblem solutions, leading to enhanced behavior in terms of social surplus with respect to the state-of-the-art day-ahead market clearing solver. The model and the algorithmic process are evaluated in a west-European test case, demonstrating minimal computational requirements and proving its excellent escalation capabilities. [ABSTRACT FROM AUTHOR]

In this paper we present a regression based model for day-ahead electricity spot prices. We estimate the considered linear regression model by the lasso estimation method. The lasso approach allows for many possible parameters in the model, but also shrinks and sparsifies the parameters automatically to avoid overfitting. Thus, it is able to capture the autoregressive intraday dependency structure of the electricity price well. We discuss in detail the estimation results which provide insights to the intraday behavior of electricity prices. We perform an out-of-sample forecasting study for several European electricity markets. The results illustrate well that the efficient lasso based estimation technique can exhibit advantages from two popular model approaches. [ABSTRACT FROM PUBLISHER]

Current opinion on undergraduate studies has led to a reformulation of teaching methodologies to base them not just on learning, but also on skills and competencies. In this approach, the teaching/learning process should accomplish both knowledge assimilation and skill development. Previous works demonstrated that a strategy that uses continuous evaluation is able to meet both objectives. However, those studies did not evaluate and quantify the additional effort required to implement such strategies. This paper evaluates the additional instructor effort required when implementing continuous evaluation in a first-year Computer Fundamentals course in the Computer Engineering degree program at the Technical University of Valencia, Spain. The experiment quantifies how instructor workload increases under different continuous evaluation strategies and how this affects the overall student grade. Both the “standard” continuous evaluation method and the intensive continuous evaluation method are analyzed, the latter being a proposal that builds upon the standard method by increasing the number of tests and examinations. The results obtained reveal that continuous evaluation improves student grades but that intensive continuous evaluation is liable to generate an excessive instructor overload without having a significant impact on student scores. [ABSTRACT FROM PUBLISHER]

This paper outlines a means to manage electrical competence in an international oil company (IOC), and it begins to explore the connections that may be possible to the industry in general and a possible role for the Petroleum and Chemical Industry Committee (PCIC) in this process. A key objective is to allow new employees in the electrical discipline to add value to the business as quickly and effectively as possible. This sometimes involves the acquisition of new knowledge and behaviors. Some resources and programs are available in the open market, but these are usually not well matched to the specific needs of the industries covered by the oil, gas, and chemical sector, i.e., the focus is more often on utility companies. By sharing the needs of this IOC and the initial response from PCIC Europe, it is hoped to stimulate further thinking and possible alignment on this important subject. [ABSTRACT FROM AUTHOR]

A European efficiency enhancement strategy for the grid-tied inverters with common dc bus and ac bus in parallel operation is proposed in this paper. Based on the inherent relationship between the dc bus voltage and the grid-feeding power, two dc bus voltage regulators with different output limits are employed in each grid-tied inverter. The operation of the dc bus voltage regulators depends on the grid-feeding power level. Therefore, the grid-tied inverter has priority up to the maximum efficiency operation point, and then, to operate at full load mode with the increase of the grid-feeding power. As a result, the European efficiency of the grid-tied system is improved without any communication link and extra hardware cost. The operation principle of the grid-tied inverter system is analyzed in detail with the implementation of the proposed control, and the design guidelines for key parameters are given and discussed. A prototype with three grid-tied inverters in parallel operation is built and experimental tests have been conducted on it in terms of steady-state performances and dynamic performances. The experimental results show that the operation modes of each grid-tied inverter depend on its sensing gain of the dc bus voltage. The European efficiency of the grid-tied inverter system with the conventional control and with the proposed control are 94.74% and 95.17%, respectively, which means the European efficiency has been enhanced by 0.43%. These results verify the feasibility and effectiveness of the proposed control strategy. [ABSTRACT FROM AUTHOR]