Search

Bubbles, as typical defects of oil–paper insulation systems, pose a great threat to the insulation state. In this article, the characteristics and mechanisms of the partial discharge (PD) inception, evolution, and induced breakdown of bubbles embedded between oil-impregnated paper (OIP) layers are investigated. The results show that the PD inception has a significant statistical time delay due to the lack of free electrons. The PD inception time delay (PDTD) follows an exponential distribution and leads to the large dispersion of the PD inception voltage (PDIV), which follows a Weibull distribution. The changes in PD behavior [charge, repetition rate, pulse current waveform, and phase-resolved PD (PRPD)] over time all show two separable stages (stages 1 and 2). The continuous recording of bubble area and gas composition under PD reveals that the evolution of bubble PD is attributed to the change in gas composition rather than the change in surface conditions as believed by researchers. The OIP breakdown induced by bubble PD indicates two breakdown modes, fast and slow, which correspond to direct-induced breakdown in stage 1 and cumulative-damage breakdown in stage 2. The former occurs because of the severe distortion of the electric field by the space charge at the head of the discharge channel inside the bubble, whereas the latter occurs because of the gradual deterioration of the OIP due to the continuous PD action. This study increases our understanding of the mechanisms of bubble discharge and of oil–paper insulation deterioration, and it provides guidance for fault diagnoses. [ABSTRACT FROM AUTHOR]

Costa's celebrated "writing on dirty paper" (WDP) shows that the power-constrained channel Y = X + S + Z, with Gaussian Z, has the same capacity as the standard AWGN channel Y = X + Z, provided that the "interference" S (no matter how strong it is) is known at the transmitter. While this ability for perfect interference cancelation is very appealing, it relies heavily on the Gaussianity of the (unknown) noise Z. We construct an example of "bad" noise for writing on dirty paper, namely, "difference set noise". If the interference S is strong, then difference-set noise limits the WDP capacity to at most 2 bits. At the same time, like in the AWGN case, the zero-interference capacity grows without bound with the input constraint. Thus almost 100% of the available capacity is lost in WDP in the presence of difference-set noise. This high capacity loss is due to the "entropy amplification property" (EAP) of noise with an aperiodic probability distribution. Using the EAP and the duality between WDP and Wyner--Ziv source coding, we also give an example of dramatic rate-loss in quantizing encrypted source. [ABSTRACT FROM AUTHOR]

The concept of using cellulose as a smart material for preparing Electro-active paper (EAPap) has been a land mark discovery, since it exhibits an impressive magnitude of actuation at relatively modest voltages. Considering the small thickness of cellulose samples (35 μm) and smaller depth of electrodes (100 nm), even at relatively low operating voltages (7 V), high electrical stresses can exist at pointed asperities on electrode surface, non-uniform locations in cellulose structure and at triple points joining electrode, cellulose and air. This paper reports the results of our ac and dc breakdown tests on cellulose samples carried out according to ASTM standards. The variation of breakdown strengths with relative humidity levels has been investigated and the results are explained with the aid of Maxwell-Wagner effect. [ABSTRACT FROM AUTHOR]

Because the temperature and load of transformer are variable, the moisture is usually inhomogeneous in oil-paper, especially for the traction transformer. In order to research the dielectric relaxation behavior of the oil-paper composite insulation with an inhomogeneous moisture distribution, it was proposed that a theoretical model for dielectric medium with an arbitrary distribution of conductivity and dielectric constant. The dielectric frequency response of oil-paper with transient moisture distribution was simulated by using the proposed model. The results show that transient moisture distribution caused the concentration polarization(CP), which enhanced the low-frequency relaxation. The model is validated against experimental data. [ABSTRACT FROM AUTHOR]

Network alignment is a critical task in a wide variety of fields. Many existing works leverage on representation learning to accomplish this task without eliminating domain representation bias induced by domain-dependent features, which yield inferior alignment performance. This paper proposes a unified deep architecture (DANA) to obtain a domain-invariant representation for network alignment via an adversarial domain classifier. Specifically, we employ the graph convolutional networks to perform network embedding under the domain adversarial principle, given a small set of observed anchors. Then, the semi-supervised learning framework is optimized by maximizing a posterior probability distribution of observed anchors and the loss of a domain classifier simultaneously. We also develop a few variants of our model, such as, direction-aware network alignment, weight-sharing for directed networks and simplification of parameter space. Experiments on three real-world social network datasets demonstrate that our proposed approaches achieve state-of-the-art alignment results. [ABSTRACT FROM AUTHOR]

In this paper, we propose a design process for a plasmonic grating structure to induce the resonance at a target wavelength. In a specific condition, surface gratings may induce the surface plasmon propagation due to the diffraction and the resonance wavelength of the surface plasmon propagation is dependent on the grating shape. The grating configuration was designed by the topology optimization scheme based on the reaction-diffusion equation. To shift the resonance wavelength to the target wavelength, this paper maps the frequency response function to a probability distribution function (PDF). The mean value from the PDF becomes a part of the objective function and the design objective is set to minimize the distance between the present resonance wavelength and the target wavelength while keeping the energy intensity. The process of simulation and optimization was performed using the commercial package COMSOL combined with MATLAB programming. [ABSTRACT FROM AUTHOR]

Flexible pressure sensor with excellent sensing performance and wearability is a major research focus for wearable electronic devices. In this study, polyporrole (PPy) wrapped cotton pads and silver coated wrinkle papers are stacked together to construct a novel piezoresistive sensor, and a bimaterial conductivity-conversion mechanism is presented. The PPy-cotton pads are prepared by an in-situ vapor growth process to ensure the strong adhesion and uniform distribution of PPy, which is beneficial for the stability of pressure sensors. The optimal flexible pressure sensor exhibits fast response speed (about 50 ms) and ultra-low detection limit (0.09 Pa). The potential applications of sensors as wearable e-skin for human activity and physiological signals monitoring are also demonstrated. [ABSTRACT FROM AUTHOR]

In group decision making, it is inevitable that the individual decision maker’s subjectivity is involved, which causes difficulty in reaching a group decision. One of the difficulties is to aggregate a small set of expert opinions with the individual subjectivity or uncertainty modeled with probability theory. This difficult problem is called probability distribution function aggregation (DFA). This paper presents a simple and efficient approach to the DFA problem. The main idea of the proposed approach is that the DFA problem is modeled as a nonlinear function of a set of probability distribution functions, and then a linear feedback iteration scheme is proposed to solve the nonlinear function, leading to a group judgment or decision. Illustration of this new approach is given by a well-known DFA example which was solved with the Delphi method. The DFA problem is a part of the group decision problem. Therefore, the proposed algorithm is also useful to the decision making problem in general. Another contribution of the this paper is the proposed notation of systematically representing the imprecise group decision problem with the classification of imprecise information into three classes, namely incomplete information, vague information, and uncertain information. The particular DFA problem dealt with in this paper is then characterized with this general notation. [ABSTRACT FROM AUTHOR]

This paper proves an impossibility result for stochastic network utility maximization for multi-user wireless systems, including multiple access and broadcast systems. Every time slot an access point observes the current channel states for each user and opportunistically selects a vector of transmission rates. Channel state vectors are assumed to be independent and identically distributed with an unknown probability distribution. The goal is to learn to make decisions over time that maximize a concave utility function of the running time average transmission rate of each user. Recently it was shown that a stochastic Frank-Wolfe algorithm converges to utility-optimality with an error of $O(\log (T)/T)$ , where $T$ is the time the algorithm has been running. An existing $\Omega (1/T)$ converse is known. The current paper improves the converse to $\Omega (\log (T)/T)$ , which matches the known achievability result. It does this by constructing a particular (simple) system for which no algorithm can achieve a better performance. The proof uses a novel reduction of the opportunistic scheduling problem to a problem of estimating a Bernoulli probability $p$ from independent and identically distributed samples. Along the way we refine a regret bound for Bernoulli estimation to show that, for any sequence of estimators, the set of values $p \in [{0,1}]$ under which the estimators perform poorly has measure at least 1/6. [ABSTRACT FROM AUTHOR]

Satellite-to-earth links are subject to several propagation effects in the troposphere, being rain attenuation the impairment that can cause the deepest fades. In this paper, the duration of both fades and the intervals between consecutive fades (interfade intervals) are characterized on the basis of the results of a long-term slant-path Ka-band propagation experiment carried out in Madrid, Spain. The experimental and statistical results included in this paper correspond to seven complete years of measurements, a period large enough to characterize not only the average-year statistics of fade dynamics but also their variability, which is assessed on the basis of annual statistics of durations. The obtained average-year statistics of fade durations are in many cases close to the predictions made by the International Telecommunication Union-Radiocommunications and Communications Research Center Canada models, although the predictions could be improved with a better selection of the parameters of the distributions used in the models. Interfade duration statistics are also presented and related to recent modeling efforts. The interannual variability of statistics, such as the relative number of fades, is quantified and found to be low, except for the higher attenuation thresholds or the highest durations considered in this paper. [ABSTRACT FROM PUBLISHER]

Modern Medical Information Systems very often comprise Medical Devices and governed by regulations which require stringent Risk Management activities to be implemented to minimize the occurrence of safety risks. Currently, the reference standard adopted by manufacturers for Risk Management is ISO 14971, which, however, was devised for traditional (mostly hardware) Medical Devices and does not either take into account the peculiarities of modern Medical Information Systems, or define a formal methodology to conduct Risk Assessment. Moreover, the approaches currently implemented by manufacturers typically aims at obtaining qualitative Risk Assessment results. Within the so-delineated application scenario, this paper proposes a methodology for the Dynamic Probabilistic Risk Assessment of Medical Information Systems, by specifically looking at medical devices that are intended as one of the most relevant components in such systems. The methodology complies with ISO 14971 and improves current practices because it allows the analyst to conduct a quantitative analysis, also taking into account the temporal dimension. It relies on a Probabilistic Risk Model, defined as a set of Markov Models, which is model-checked to obtain quantitative information about the risks. The proposed methodology is also adopted to improve definitively the Medical Device post-market surveillance, which is currently implemented as a ”wait for an incident” activity. In other words, currently a manufacturer sets up a service that has to ”react” to an incident by starting an investigation activity. Instead, the methodology proposes the adoption of risk models defined during the development phase also to re-assess periodically the risks related to the product during the post-market surveillance. This may prevent some incidents because risks are assessed using data collected in the field (no longer guesstimated as during the development phase) and taking into account the temporal effects on probability distributions (such as the deterioration of hardware/software components over the time). [ABSTRACT FROM AUTHOR]

The values of the propagation constants of electromagnetic (EM) waves through the plasma using as the example of a homogeneous plasma layer for different electron distribution functions (EDFs) are the subject of this paper. The Maxwellian, Druyvesteyn, Pipe-line, and Bi-Maxwellian distribution functions were considered in this paper. Using values of the complex dielectric permittivity obtained from using different EDFs, the results for corresponding reflection, transmission, and absorption coefficients can be significantly different. The EDFs sometimes can have a considerable effect on the dielectric properties of plasma. Hence, comparing the results obtained, it is helpful to analyze the interaction between EM waves and plasma and provide a theoretical basis for the experiments. [ABSTRACT FROM AUTHOR]

This paper investigates the compress-and-forward scheme for an uplink cloud radio access network (C-RAN) model, where multi-antenna base stations (BSs) are connected to a cloud-computing-based central processor (CP) via capacity-limited fronthaul links. The BSs compress the received signals with Wyner-Ziv coding and send the representation bits to the CP; the CP performs the decoding of all the users’ messages. Under this setup, this paper makes progress toward the optimal structure of the fronthaul compression and CP decoding strategies for the compress-and-forward scheme in the C-RAN. On the CP decoding strategy design, this paper shows that under a sum fronthaul capacity constraint, a generalized successive decoding strategy of the quantization and user message codewords that allows arbitrary interleaved order at the CP achieves the same rate region as the optimal joint decoding. Furthermore, it is shown that a practical strategy of successively decoding the quantization codewords first, then the user messages, achieves the same maximum sum rate as joint decoding under individual fronthaul constraints. On the joint optimization of user transmission and BS quantization strategies, this paper shows that if the input distributions are assumed to be Gaussian, then under joint decoding, the optimal quantization scheme for maximizing the achievable rate region is Gaussian. Moreover, Gaussian input and Gaussian quantization with joint decoding achieve to within a constant gap of the capacity region of the Gaussian multiple-input multiple-output (MIMO) uplink C-RAN model. Finally, this paper addresses the computational aspect of optimizing uplink MIMO C-RAN by showing that under fixed Gaussian input, the sum rate maximization problem over the Gaussian quantization noise covariance matrices can be formulated as convex optimization problems, thereby facilitating its efficient solution. [ABSTRACT FROM PUBLISHER]

Due to the statistical uncertainty of loads and power sources found in smart grids, effective computational tools for probabilistic load flow analysis and planning are now becoming indispensable. In this paper, we describe a unified simulation framework that allows quantifying the probability distributions of a set of observation variables as well as evaluating their sensitivity to potential variations in the power demands. The proposed probabilistic technique relies on the generalized polynomial Chaos algorithm and on a regionwise aggregation/description of the time-varying load profiles. It is shown how detailed statistical distributions of some important figures of merit, which includes voltage unbalance factor in distribution networks, can be calculated with a two orders of magnitude acceleration compared to standard Monte Carlo analysis. In addition, it is highlighted how the associated sensitivity analysis is of guidance for the optimal allocation and planning of new loads. [ABSTRACT FROM AUTHOR]

The inrush current generated by power transformer energization (TE) causes voltage sag of the nearby bus, the typical residual voltage of the voltage sag caused by transformer energization (VSTE) is about 0.7 p.u.--0.9 p.u. and lasts for a longer duration, which may lead to the sensitive equipment trips. This paper proposes an estimation method of voltage sag frequency considering VSTE. Firstly, based on the maximum entropy method, the residual flux distribution is calculated by considering the relationship between the residual flux and closing angle at the moment of TE. The voltage sag waveform caused by TE is calculated based on the estimation of the probability distribution of residual flux, to evaluate VSTE objectively and comprehensively. Secondly, this paper proposes a non-rectangular voltage sag equivalent frequency statistical method based on multiple magnitude-duration (MMD) function, to avoid the overestimation of voltage sag frequency by the traditional methods. Furthermore, this paper proposes an assessment algorithm of voltage sag frequency. Finally, the simulation of IEEE-30 test system verifies the necessity and correctness of the proposed method. [ABSTRACT FROM AUTHOR]

Recent developments in the field of non-local attention (NLA) have led to a renewed interest in self-similarity-based single image super-resolution (SISR). Researchers usually use the NLA to explore non-local self-similarity (NSS) in SISR and achieve satisfactory reconstruction results. However, a surprising phenomenon that the reconstruction performance of the standard NLA is similar to that of the NLA with randomly selected regions prompted us to revisit NLA. In this paper, we first analyzed the attention map of the standard NLA from different perspectives and discovered that the resulting probability distribution always has full support for every local feature, which implies a statistical waste of assigning values to irrelevant non-local features, especially for SISR which needs to model long-range dependence with a large number of redundant non-local features. Based on these findings, we introduced a concise yet effective soft thresholding operation to obtain high-similarity-pass attention (HSPA), which is beneficial for generating a more compact and interpretable distribution. Furthermore, we derived some key properties of the soft thresholding operation that enable training our HSPA in an end-to-end manner. The HSPA can be integrated into existing deep SISR models as an efficient general building block. In addition, to demonstrate the effectiveness of the HSPA, we constructed a deep high-similarity-pass attention network (HSPAN) by integrating a few HSPAs in a simple backbone. Extensive experimental results demonstrate that HSPAN outperforms state-of-the-art approaches on both quantitative and qualitative evaluations. Our code and a pre-trained model were uploaded to GitHub (https://github.com/laoyangui/HSPAN) for validation. [ABSTRACT FROM AUTHOR]

In this paper, we examine an input-constrained erasure channel and we characterize the asymptotics of its capacity when the erasure rate is low. More specifically, for a general memoryless erasure channel with its input supported on an irreducible finite-type constraint, we derive partial asymptotics of its capacity, using some series expansion type formula of its mutual information rate; and for a binary erasure channel with its first-order Markovian input supported on the $(1, \infty )$ -RLL constraint based on the concavity of its mutual information rate with respect to some parameterization of the input, we numerically evaluate its first-order Markov capacity and further derive its full asymptotics. The asymptotics obtained in this paper, when compared with the recently derived feedback capacity for a binary erasure channel with the same input constraint, enable us to draw the conclusion that feedback may increase the capacity of an input-constrained channel, even if the channel is memoryless. [ABSTRACT FROM PUBLISHER]

Transmission system operators (TSOs) in recent years have faced challenges in order to ensure maximum transmission capacity of the system to satisfy market needs, while maintaining operational safety and permissible impact on the environment. A great help in the decision-making process was introduced with the Dynamic Thermal Rating (DTR) – an instrument to monitor and predict the maximal allowed ampacity of the power grid based on weather measurements and forecast. However, the introduction of DTR raises a number of questions related to the accuracy and uncertainty of the results of thermal assessment and the level of acceptable risk and its management. In this paper, we present a solution for estimating DTR uncertainty, appropriate for operational use at TSOs. With the help of conductor surface temperature measurements, weather measurements and predicted weather data, we also estimate the error of the weather forecast and the DTR itself. Following the results of the data analyses, we build an operative solution for estimating the ampacity uncertainty based on Monte Carlo random simulations and integrate it into the operational environment of ELES – the operator of the Slovenian electric power transmission network. [ABSTRACT FROM AUTHOR]

This paper deals with the novel and complex problem of scheduling the internal operations in post-distribution cross docking systems (PDCDSs), i.e., a kind of cross docking terminal where the operations of good allocation are performed. More precisely, internal operations of the PDCDS consist in deconsolidating inbound cases, sorting products according to customer requests, and consolidating outbound cases. The problem is determining the optimal schedule of the internal operations with the objective of minimizing the makespan. The contribution of this paper is twofold. First, the PDCDS scheduling problem is characterized and the corresponding NP-hardness is proved. Second, in order to address the complexity of the problem, two mixed integer linear programming (MILP) models and a heuristic algorithm are presented. In particular, the mathematical programming formulations are solved by using symmetry breaking constraints and objective function perturbations. Moreover, the lower bounds of the start times of operations are evaluated in order to strengthen the formulations. A set of test results compare the formulation performances and a case study shows the effectiveness of the proposed heuristic algorithm to schedule the operations of an half work day of an Italian company of cloth retail stores. [ABSTRACT FROM AUTHOR]

Millimeter-wave (mmWave) and sub-Terahertz (THz) frequencies are expected to play a vital role in 6G wireless systems and beyond due to the vast available bandwidth of many tens of GHz. This paper presents an indoor 3-D spatial statistical channel model for mmWave and sub-THz frequencies based on extensive radio propagation measurements at 28 and 140 GHz conducted in an indoor office environment from 2014 to 2020. Omnidirectional and directional path loss models and channel statistics such as the number of time clusters, cluster delays, and cluster powers were derived from over 15,000 measured power delay profiles. The resulting channel statistics show that the number of time clusters follows a Poisson distribution and the number of subpaths within each cluster follows a composite exponential distribution for both LOS and NLOS environments at 28 and 140 GHz. This paper proposes a unified indoor statistical channel model for mmWave and sub-Terahertz frequencies following the mathematical framework of the previous outdoor NYUSIM channel models. A corresponding indoor channel simulator is developed, which can recreate 3-D omnidirectional, directional, and multiple input multiple output (MIMO) channels for arbitrary mmWave and sub-THz carrier frequency up to 150 GHz, signal bandwidth, and antenna beamwidth. The presented statistical channel model and simulator will guide future air-interface, beamforming, and transceiver designs for 6G and beyond. [ABSTRACT FROM AUTHOR]

Real-time dynamic line rating forecasting can be classified into two critical steps of evaluating the operation risk, and avoiding the overload operation of transmission lines. The dynamic capacity of the transmission line is generally predicted for scheduling power networks in the day-ahead market. However, the forecasting error motivates researchers to propose real-time forecasting models to correct the day-ahead scheduling results based on the accurate data close to real-time values in the balancing market. Among the methods presented for real-time dynamic line rating forecasting, the single-point estimation type has been considered more than other forecasting types. Despite its safety, and efficiency, a single point estimation type suffers from several significant drawbacks. For instance, this forecasting type cannot indicate the probabilistic distribution function of forecasted value, which is used in novel balancing methods of market scheduling. The main purpose of this paper is to present a density forecast method to predict real-time dynamic line rating for covering the balancing market requirements. Dynamic stochastic general equilibrium (DSGE) is applied to achieve this aim. Due to incorporating stochastic volatility in the proposed real-time forecasting model, evaluating simulation results, and reference models highlight a significant improvement in the performance of the real-time density forecast of DLR. [ABSTRACT FROM AUTHOR]

Emerging communication technologies allow to reconfigure the physical network topology at runtime, enabling demand-aware networks (DANs): networks whose topology is optimized toward the workload they serve. However, today, only little is known about the fundamental algorithmic problems underlying the design of such demand-aware networks. This paper presents the first bounded-degree, demand-aware network, $\textit {cl-DAN} $ , which minimizes both congestion and route lengths. The degree bound $\Delta $ is given as part of the input. The designed network is provably (asymptotically) optimal in each dimension individually: we show that there do not exist any bounded-degree networks providing shorter routes (independently of the load), nor do there exist networks providing lower loads (independently of the route lengths). The main building block of the designed $\textit {cl-DAN} $ networks are $\textit {ego-trees}$ : communication sources arrange their communication partners in an optimal tree, individually. While the union of these ego-trees forms the basic structure of $\textit {cl-DANs}$ , further techniques are presented to ensure bounded degrees (for scalability). [ABSTRACT FROM AUTHOR]

For fixed integers $n$ and $b\geq k$ , let $A(b,k,n)$ the largest size of a subset of $\{1,2,\ldots,b\}^{n}$ such that, for any $k$ distinct elements in the set, there is a coordinate where they all differ. Bounding $A(b,k,n)$ is a problem of relevant interest in information theory and computer science, relating to the zero-error capacity with list decoding and to the study of $(b, k)$ -hash families of functions. It is known that, for fixed $b$ and $k$ , $A(b,k,n)$ grows exponentially in $n$. In this paper, we determine new exponential upper bounds for different values of $b$ and $k$. A first bound on $A(b,k,n)$ for general $b$ and $k$ was derived by Fredman and Komlós in the ’80s and improved for certain $b\neq k$ by Körner and Marton and by Arikan. Only very recently better bounds were derived for general $b$ and $k$ by Guruswami and Riazanov, while stronger results for small values of $b=k$ were obtained by Arikan, by Dalai, Guruswami and Radhakrishnan, and by Costa and Dalai. In this paper, we strengthen the bounds for some specific values of $b$ and $k$. Our contribution is a new computational method for obtaining upper bounds on the values of a quadratic form defined over discrete probability distributions in arbitrary dimensions, which emerged as a central ingredient in recent works. The proposed method reduces an infinite-dimensional problem to a finite one, which we manage to further simplify by means of a series of optimality conditions. [ABSTRACT FROM AUTHOR]

This paper investigates the problem of resilient fault-tolerant control for a class of Takagi–Sugeno fuzzy model which is described by fractional order differential equations. In particular, the system input under consideration is subject to actuator saturations, actuator faults, and nonlinearities. The main purpose of this paper is to put forward a generalized nonlinear resilient fault-tolerant controller that can make the considered system robustly asymptotically stable. Utilizing the concept of continuous frequency distribution, a new set of linear matrix inequalities, which are the sufficient conditions for robust asymptotic stability of the closed-loop system, are derived by using the indirect Lyapunov approach. Two numerical examples are included to illustrate the feasibility and effectiveness of the proposed method. [ABSTRACT FROM AUTHOR]

Ferroelectric (FE) materials are being studied for a variety of applications in memory, logic, and neuromorphic computing, for which predictive models of FE polarization are essential. In this paper, we present a Monte Carlo simulation framework capable of predicting the dynamic, history-dependent response of an FE under arbitrary input waveforms. The simulation is developed by generalizing the physics-based nucleation-limited switching model for polarization reversal in a polycrystalline FE. Measured polarization reversal data from fabricated FE Hf0.5Zr0.5O2 capacitors are used to extract the statistical distribution of FE grains. After parameter extraction, the model is able to predict the dynamics of the FE capacitor without further calibration. Finally, the model is applied to characterize the dynamic response of FE–dielectric bilayer structures and quantify the reduction in memory window due to device variability. [ABSTRACT FROM AUTHOR]

Given two discrete random variables $X$ and $Y$ , with probability distributions $p=(p_{1}, \ldots , p_{n})$ and $q=(q_{1}, \ldots , q_{m})$ , respectively, let us denote by ${\mathcal{ C}}(p, q)$ the set of all couplings of $p$ and $q$ , that is, the set of all bivariate probability distributions that have $p$ and $q$ as marginals. In this paper, we study the problem of finding a joint probability distribution in ${\mathcal{ C}}(p, q)$ of minimum entropy (equivalently, a coupling that maximizes the mutual information between $X$ and $Y$), and we discuss several situations where the need for this kind of optimization naturally arises. Since the optimization problem is known to be NP-hard, we give an efficient algorithm to find a joint probability distribution in ${\mathcal{ C}}(p, q)$ with entropy exceeding the minimum possible at most by 1 bit, thus providing an approximation algorithm with an additive gap of at most 1 bit. Leveraging on this algorithm, we extend our result to the problem of finding a minimum-entropy joint distribution of arbitrary $k\geq {2}$ discrete random variables $X_{1}, \ldots , X_{k}$ , consistent with the known $k$ marginal distributions of the individual random variables $X_{1}, \ldots , X_{k}$. In this case, our algorithm has an additive gap of at most $\log k$ from optimum. We also discuss several related applications of our findings and extensions of our results to entropies different from the Shannon entropy. [ABSTRACT FROM AUTHOR]

This paper investigates the minimum energy required to transmit k information bits with a given reliability over a multiple-antenna Rayleigh block-fading channel, with and without channel state information (CSI) at the receiver. No feedback is assumed. It is well known that the ratio between the minimum energy per bit and the noise level converges to −1.59 dB as k goes to infinity, regardless of whether CSI is available at the receiver or not. This paper shows that the lack of CSI at the receiver causes a slowdown in the speed of convergence to −1.59 dB as k\to \infty compared with the case of perfect receiver CSI. Specifically, we show that, in the no-CSI case, the gap to −1.59 dB is proportional to , whereas when perfect CSI is available at the receiver, this gap is proportional to 1/\sqrt {k} . In both cases, the gap to −1.59 dB is independent of the number of transmit antennas and of the channel’s coherence time. Numerically, we observe that, when the receiver is equipped with a single antenna, to achieve an energy per bit of −1.5 dB in the no-CSI case, one needs to transmit at least 7\times 10^{7}$ information bits, whereas 6\times 10^{4} bits suffice for the case of perfect CSI at the receiver. [ABSTRACT FROM PUBLISHER]

In a multi-regional interconnected grid, the probabilistic load flow (PLF) of any region cannot be calculated individually but should consider the uncertainties introduced in other areas. Accordingly, the topologies, loads, and generations of every region are needed. Although the renewable generation data could be assumed as publicly known, some regional independent system operators (ISOs) still would not share important parameters with others. This motivates the development of a privacy-preserving distributed (PPD) PLF method. The challenge is to identify the mapping between the regional flows and uncertain power injections across regions without full information about the entire grid. The main idea of this paper is to respectively calculate the coefficient matrix and constant vector of the mapping: for the former, a PPD accelerated projection-based consensus algorithm is proposed; for the latter, a privacy-preserving accelerated average consensus algorithm is leveraged. Consequently, a PLF method is derived for each ISO to analytically obtain its regional joint PLF in a distributed way without sharing parameters — the key contribution of this paper. Experiments on the 118- and 1354-bus systems demonstrate that this method can generate the same results as the corresponding centralized method, and has satisfactory accuracy compared with frequently used PLF methods. [ABSTRACT FROM AUTHOR]

A sum-product network (SPN) is a probabilistic model, based on a rooted acyclic directed graph, in which terminal nodes represent probability distributions and non-terminal nodes represent convex sums (weighted averages) and products of probability distributions. They are closely related to probabilistic graphical models, in particular to Bayesian networks with multiple context-specific independencies. Their main advantage is the possibility of building tractable models from data, i.e., models that can perform several inference tasks in time proportional to the number of edges in the graph. They are somewhat similar to neural networks and can address the same kinds of problems, such as image processing and natural language understanding. This paper offers a survey of SPNs, including their definition, the main algorithms for inference and learning from data, several applications, a brief review of software libraries, and a comparison with related models. [ABSTRACT FROM AUTHOR]

Cascading failure models are important for understanding the mechanism of blackouts and evaluating the control strategies to prevent the failure propagation. The evolution of cascading failure in actual power grid is a continuous dynamic process triggered by discrete events, such as initial disturbances and physical responses. In this paper, we develop an event-triggered hybrid system model to describe the dynamic process of cascading failure. In the model, the evolution of continuous states of power grid is described by differential algebraic equations and the discrete events are defined as transitions between discrete states of power grid. The model also integrates multiple physical responses including relay protection, frequency regulation and dispatching action. Based on the developed model, we propose an event-triggered simulation method of cascading failure to accelerate the simulation process. Compared with the DC power flow model, hidden failure model and topological model, the simulation results of our model are more accurate because the statistical distribution of demand loss in our model is closer to historical blackouts data. The efficiency of the proposed event-triggered method is demonstrated by comparing our model with the time-driven model and three existing models. The experimental results show that our model can trade off the simulation accuracy and time consumption. Note to Practitioners—This paper focuses on modeling the dynamic process of cascading failure with multiple physical responses in power grid. We develop an event-triggered hybrid system model for cascading failure. In the model, the continuous dynamics of power grid and discrete events triggering the evolution of cascading failure are all described by the framework of hybrid system, which is a good example of modeling the hybrid system for automation researchers and engineers. By this way, the model is more accurate in describing the actual characteristics of cascading failure in power grid, and thus supporting the design and evaluation of control strategies for improving the stability of power grid. Based on the developed model, we propose an event-triggered simulation method of cascading failure, which aims to improve simulation accuracy while potentially reducing time consumption. In practice, the model can make fast control strategies to prevent the failure propagation. [ABSTRACT FROM AUTHOR]

With the increasing penetration of renewable energy, accurate and efficient probabilistic optimal power flow (POPF) calculation becomes more and more important to provide decision support for secure and economic operation of power systems. This paper develops a novel nonparametric probabilistic optimal power flow (N-POPF) model describing the probabilistic information by quantiles, which avoids any parametric probability distribution assumptions of random variables. A novel critical region integral method (CRIM) which combines the multiparametric programming theory and discrete integral is proposed to efficiently solve the N-POPF problem. In the CRIM, the critical region partitioning algorithm is firstly introduced into the POPF model to directly establish the mapping relationship from wind power to optimal solutions of the POPF problem. Besides, a discrete integral method is developed in the CRIM to achieve the probability convolution calculation based on quantiles. Comprehensive numerical experiments verify the superior performance of the proposed CRIM in estimation accuracy and computational efficiency, and demonstrate that N-POPF model significantly improves the accuracy of uncertainty analysis. In general, the proposed N-POPF model and CRIM form a new framework of POPF problem for power system analysis and operation. [ABSTRACT FROM AUTHOR]

This article addresses polynomial computation with unipolar stochastic logic by exploiting correlation between the bit-streams. The AND-OR, double-NAND, OR-AND and double-NOR circuits are presented for polynomials with all positive coefficients whose sum is less than or equal to one by mathematically analyzing the joint probability distribution of coefficient bit-streams. The NAND-AND expansion is also developed for polynomials with alternatively positive and negative coefficients whose absolute values are decreasing by applying the same idea. Unlike the original methods with multiple uncorrelated random number sources (RNSs) for coefficient bit-stream generation, the presented methods only require a single RNS. Since the RNSs take up huge hardware resource in stochastic circuits, the proposed RNS-sharing techniques for polynomial computation result in a significant reduction of hardware complexity. For the factorization technique in the general polynomials, this paper enhances the original stochastic designs for the second-order polynomial and further presents the simple correlation-dependent circuits. Results show that the proposed architectures are superior to the previous ones by reducing the total number of RNSs. [ABSTRACT FROM AUTHOR]

One critical issue for wireless power transfer is to avoid human health impairments caused by electromagnetic radiation (EMR) exposure. The existing studies mainly focus on scheduling wireless chargers so that (expected) EMR at any point in the area does not exceed a threshold $R_t$ R t . Nevertheless, they overlook the EMR jitter that leads to exceeding of $R_t$ R t even if the expected EMR is no more than $R_t$ R t . This paper studies the fundamental problem of RObustly SafE charging for wireless power transfer (ROSE), that is, scheduling the power of chargers so that the charging utility for all rechargeable devices is maximized while the probability that EMR anywhere does not exceed $R_t$ R t is no less than a given confidence. We first build our empirical probabilistic charging model and EMR model. Then, we present EMR approximation and area discretization techniques to formulate ROSE into a Second-Order Cone Program. After that, we propose the first redundant second-order cone constraints reduction algorithm to reduce the computational cost, and therefore obtain a $(1-\epsilon)$ (1 - ε) -approximation centralized algorithm. Further, we propose a $(1-\epsilon)$ (1 - ε) -approximation fully distributed algorithm scalable with network size for ROSE. We conduct both simulation and field experiments, and the results show that our algorithms can outperform comparison algorithms by 480.19 percent. [ABSTRACT FROM AUTHOR]

This paper addresses the design of a torque vectoring architecture to control the four electrical machines in a four-wheel-drive (4WD) formula-type competition vehicle. The scheme includes a new yaw-rate controller and a novel optimal torque distribution algorithm. Two yaw-rate controllers are proposed: one based on $\mathcal {H}_\infty$ optimal control and another based on linear parameter varying (LPV) system concepts. Both controllers are designed using an extended bicycle model validated with experimental data. Simulation results shown the effectiveness of the proposed overall control scheme in terms of energy efficiency, cornering speed and stability no matter the high-demanding working conditions. Such an effectiveness is quantitatively demonstrated by means of several key performance indicators chosen to ease the comparison of the proposed approach with respect to other reported works. [ABSTRACT FROM AUTHOR]

In the field of ultrasonic array imaging for non-destructive testing (NDT), material structural noise caused by grain scattering is one of the main sources of error when characterizing defects that are found in the polycrystalline materials. The existence of grains can also severely affect the detection performance of ultrasonic testing, making small defects indistinguishable from the grain indications due to ultrasonic attenuation and backscatter. This paper proposes a model in which the statistical distribution of the defect data is obtained from different realizations of the grain structure. This statistical distribution, termed the defect+grains model in this paper, is shown to contain information that is needed for detection and characterization of defects. Hence, given a specific measurement configuration, the characterization result can be obtained by constructing a defect+grains model based on the multiple realizations of each possible defect and calculating their probability. The detection, classification, and sizing accuracy are shown to be predictable by quantifying the probabilities that an experimentally measured defect matches the different defect+grains models. This defect+grains modeling approach gives insight into the detection/characterization problem, leading to an evaluation of the fundamental limits of the achievable inspection performance. [ABSTRACT FROM AUTHOR]

In this paper, a class of two-weight and three-weight linear codes over \mathrm GF(p) is constructed, and their application in secret sharing is investigated. Some of the linear codes obtained are optimal in the sense that they meet certain bounds on linear codes. These codes have applications also in authentication codes, association schemes, and strongly regular graphs, in addition to their applications in consumer electronics, communication and data storage systems. [ABSTRACT FROM PUBLISHER]

This paper considers a Gaussian channel with one transmitter and two receivers. The goal is to maximize the communication rate at the intended/primary receiver subject to a disturbance constraint at the unintended/secondary receiver. The disturbance is measured in terms of the minimum mean square error (MMSE) of the interference that the transmission to the primary receiver inflicts on the secondary receiver. This paper presents a new upper bound for the problem of maximizing the mutual information subject to an MMSE constraint. The new bound holds for vector inputs of any length and recovers a previously known limiting (when the length of the vector input tends to infinity) expression from the work of Bustin et al. The key technical novelty is a new upper bound on the MMSE. This bound allows one to bound the MMSE for all signal-to-noise ratio (SNR) values below a certain SNR at which the MMSE is known (which corresponds to the disturbance constraint). The bound also complements the “single-crossing point property” of the MMSE that upper bounds the MMSE for all SNR values above a certain value at which the MMSE value is known. The MMSE upper bound provides a refined characterization of the phase-transition phenomenon, which manifests, in the limit as the length of the vector input goes to infinity, as a discontinuity of the MMSE for the problem at hand. For vector inputs of size n=1 , a matching lower bound, to within an additive gap of order O ( \log \log ({1}/{\sf MMSE}) ) (where {\sf MMSE}$ is the disturbance constraint), is shown by means of the mixed inputs technique recently introduced by Dytso et al. [ABSTRACT FROM PUBLISHER]

Providing truly ubiquitous connectivity requires development of low Earth orbit (LEO) satellite Internet, whose theoretical study is lagging behind network-specific simulations. In this paper, we derive analytical expressions for the downlink coverage probability and average data rate of a massive inclined LEO constellation in terms of total interference power’s Laplace transform in the presence of fading and shadowing, ergo presenting a stochastic geometry-based analysis. We assume the desired link to experience Nakagami- $m$ fading, which serves to represent different fading scenarios by varying integer $m$ , while the interfering channels can follow any fading model without an effect on analytical tractability. To take into account the inherent non-uniform distribution of satellites across different latitudes, we model the LEO network as a nonhomogeneous Poisson point process with its intensity being a function of satellites’ actual distribution in terms of constellation size, the altitude of the constellation, and the inclination of orbital planes. From the numerical results, we observe optimum points for both the constellation altitude and the number of orthogonal frequency channels; interestingly, the optimum user’s latitude is greater than the inclination angle due to the presence of fewer interfering satellites. Overall, the presented study facilitates general stochastic evaluation and planning of satellite Internet constellations without specific orbital simulations or tracking data on satellites’ exact positions in space. [ABSTRACT FROM AUTHOR]

Predictions of the ampacity of overhead lines can be framed in a general context that aims to make electric grids highly efficient and reliable. In this paper, a methodology is presented that provides ampacity forecasts, which are valid for both the very short term, such as a few minutes or hours, and longer terms, up to 24 hours ahead. The former can be useful for grid operations, while the latter may be valuable in electricity markets. A time series methodology and mesoscale weather forecasts have been combined in machine learning algorithms for producing reliable ampacity forecasts for a span located in complex terrain. In a prior step, the developed algorithms made point forecasts, but finally, a computationally inexpensive algorithm produces probabilistic forecasts. These probabilistic forecasts are nonparametric, as they are not based on predefined probability distributions, and they demonstrate how a low risk in overhead lines is closely related to the reliability of ampacity forecasts. [ABSTRACT FROM AUTHOR]

This paper investigates the dynamic property of a tropical forested channel due to the weather effect on very high frequency (VHF) and ultrahigh frequency (UHF) radio-wave propagation. In this paper, continuous-wave (CW) envelope fading waveforms are recorded over a period of 59 s with static antennas. This paper focuses on the analysis of the combined effect of wind and rain, which is often encountered in a tropical forest. The induced temporal effects are discussed and compared with theoretical models. It is found that the distribution of temporal fading components resembles a Rician distribution function. Its Rician K factor gradually decreases as the strength of either wind or rain increases due to the movement of the forest components. [ABSTRACT FROM AUTHOR]

This paper investigates downlink transmission over a quasi-static fading Gaussian broadcast channel (BC), to model delay-sensitive applications over slowly time-varying fading channels. System performance is characterized by the outage capacity region. In contrast to most previous work, here the problem is studied under the key assumption that the transmitter knows only the probability distributions of the fading coefficients, not their realizations. For scalar-input channels, two coding schemes are studied. The first scheme is called blind dirty paper coding (B-DPC), which utilizes a robustness property of dirty paper coding to perform precoding at the transmitter. The second scheme is called statistical superposition coding (S-SC), in which each receiver adaptively performs successive decoding with the process statistically governed by the realized fading. Both B-DPC and S-SC schemes achieve the outage capacity region, which dominates the outage rate region of time-sharing, irrespective of the particular fading distributions. The S-SC scheme can be extended to BCs with multiple transmit antennas. [ABSTRACT FROM AUTHOR]

In this correspondence, we extend the Gaussian wiretap channel model introduced by Leung-Yan-Cheong and Hellman to the Gaussian wiretap channel with side information by introducing additive white Gaussian interference in the main channel, which is available to the encoder in advance. This model is also an extension of the dirty-paper channel introduced by Costa since its main channel is the dirty-paper channel. A perfect-secrecy-achieving coding strategy for the model is proposed. It is used to derive achievable rates with asymptotic perfect secrecy and an achievable rate-equivocation region. The achievable rates with asymptotic perfect-secrecy are then compared to upper and lower bounds. The comparison indicates that the proposed coding strategy is optimal in some cases. [ABSTRACT FROM AUTHOR]

This paper proposes a lossless point cloud (PC) geometry compression method that uses neural networks to estimate the probability distribution of voxel occupancy. First, to take into account the PC sparsity, our method adaptively partitions a point cloud into multiple voxel block sizes. This partitioning is signalled via an octree. Second, we employ a deep auto-regressive generative model to estimate the occupancy probability of each voxel given the previously encoded ones. We then employ the estimated probabilities to code efficiently a block using a context-based arithmetic coder. Our context has variable size and can expand beyond the current block to learn more accurate probabilities. We also consider using data augmentation techniques to increase the generalization capability of the learned probability models, in particular in the presence of noise and lower-density point clouds. Experimental evaluation, performed on a variety of point clouds from four different datasets and with diverse characteristics, demonstrates that our method reduces significantly (by up to 37%) the rate for lossless coding compared to the state-of-the-art MPEG codec. [ABSTRACT FROM AUTHOR]

With the rapid development of connecting massive devices to the Internet, especially for remote areas without cellular network infrastructures, space-air-ground integrated networks (SAGINs) emerge and offload computation-intensive tasks. In this paper, we consider a SAGIN, where multiple low-earth-orbit (LEO) satellites providing connections to the cloud server, an unmanned aerial vehicle (UAV), and nearby base stations (BSs) providing edge computing services are included. The UAV flies along a fixed trajectory to collect tasks generated by Internet of Things (IoT) devices, and forwards these tasks to a BS or the cloud server for further processing. To facilitate efficient processing, the UAV needs to decide where to offload as well as the proportion of offloaded tasks. However, in practice, due to the variability of environment and actual demand, the amount of arrival tasks is uncertain. If the deterministic optimization is utilized to develop offloading strategy, unnecessary system overhead or higher task drop rate may occur, which severely damages the system robustness. To address this issue, we characterize the uncertainty with a data-driven approach, and formulate a distributionally robust optimization problem to minimize the expected energy-constrained system latency under the worst-case probability distribution. Furthermore, the distributionally robust latency optimization algorithm is proposed to reach the sub-optimal solution. Finally, we perform simulations on the real-world data set, and compare with other benchmark schemes to verify the efficiency and robustness of our proposed algorithm. [ABSTRACT FROM AUTHOR]

In Part I of this paper we have introduced the closed-form conditions for guaranteeing regional frequency stability in a power system. Here we propose a methodology to represent these conditions in the form of linear constraints and demonstrate their applicability by implementing them in a generation-scheduling model. This model simultaneously optimises energy production and ancillary services for maintaining frequency stability in the event of a generation outage, by solving a frequency-secured Stochastic Unit Commitment (SUC). We consider the Great Britain system, characterised by two regions that create a non-uniform distribution of inertia: England in the South, where most of the load is located, and Scotland in the North, containing significant wind resources. Through several case studies, it is shown that inertia and frequency response cannot be considered as system-wide magnitudes in power systems that exhibit inter-area oscillations in frequency, as their location in a particular region is key to guarantee stability. In addition, securing against a medium-sized loss in the low-inertia region proves to cause significant wind curtailment, which could be alleviated through reinforced transmission corridors. In this context, the proposed constraints allow to find the optimal volume of ancillary services to be procured in each region. [ABSTRACT FROM AUTHOR]

This paper deals with the problem of testing for equality between the location parameters of two unknown symmetric distributions that may belong to different families. Under this framework, we develop a new robust extension of the two-sample Hotelling test (HT). The proposed extension, called measure-transformed HT (MT-HT), operates by applying a transform to the probability measures of some reshaped versions of the two compared data sets. The considered measure transform is structured by a non-negative function, called MT-function, that weights the data points. In the paper we show that proper selection of the involved MT-functions can result in significant enhancement of the decision performance in the presence of non-Gaussian distributions with heavy tails. The advantages of the proposed MT-HT are illustrated in simulation studies that involve synthetic measurements. Additionally, the MT-HT is illustrated for anomaly detection in a blurred and noisy video stream. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the problem of designing good non-binary LDPC codes for Slepian-Wolf coding. The design method is based on Density Evolution which gives the asymptotic error probability of the decoder for given code degree distributions. Density Evolution was originally introduced for channel coding under the assumption that the channel is symmetric. In Slepian-Wolf coding, the correlation channel is not necessarily symmetric and the source distribution has to be taken into account. In this paper, we express the non-binary Density Evolution recursion for Slepian-Wolf coding. From Density Evolution, we then perform code degree distribution optimization using an optimization algorithm called differential evolution. Both asymptotic performance evaluation and finite-length simulations show the gain at considering optimized degree distributions for SW coding. [ABSTRACT FROM AUTHOR]

Traditional relational topic models provide a successful way to discover the hidden topics from a document network. Many theoretical and practical tasks, such as dimensional reduction, document clustering, and link prediction, could benefit from this revealed knowledge. However, existing relational topic models are based on an assumption that the number of hidden topics is known a priori, which is impractical in many real-world applications. Therefore, in order to relax this assumption, we propose a nonparametric relational topic model using stochastic processes instead of fixed-dimensional probability distributions in this paper. Specifically, each document is assigned a Gamma process, which represents the topic interest of this document. Although this method provides an elegant solution, it brings additional challenges when mathematically modeling the inherent network structure of typical document network, i.e., two spatially closer documents tend to have more similar topics. Furthermore, we require that the topics are shared by all the documents. In order to resolve these challenges, we use a subsampling strategy to assign each document a different Gamma process from the global Gamma process, and the subsampling probabilities of documents are assigned with a Markov Random Field constraint that inherits the document network structure. Through the designed posterior inference algorithm, we can discover the hidden topics and its number simultaneously. Experimental results on both synthetic and real-world network datasets demonstrate the capabilities of learning the hidden topics and, more importantly, the number of topics. [ABSTRACT FROM PUBLISHER]

For an overhead conductor, meteorological correlations exist among the meteorological elements that dominantly determine its thermal rating, and temporal correlations exist among the thermal ratings in sequential time periods. It is necessary to exploit these correlations to improve the performance of the probabilistic prediction of thermal ratings. To this end, a copula-based method of joint probability density prediction for multiperiod thermal ratings (JPDP-MPTR) is presented in this paper. In this method, the probability density functions (PDFs) of the thermal ratings for every 15 minutes over a 1-hour horizon are first predicted individually, considering the correlations among meteorological elements. Then, the joint probability density function (JPDF) of the multiperiod thermal ratings is further formulated based on copula theory. Finally, the probability distributions of the thermal ratings in the predicted time periods are estimated via joint sampling based on the JPDF. Numerical simulations based on actual meteorological data collected around an overhead conductor show that the proposed method can significantly improve prediction results through the integration of meteorological and temporal correlations into the probabilistic prediction of the thermal rating. [ABSTRACT FROM AUTHOR]