Search

The traditional method for transformer moisture diagnosis is to establish empirical equations between feature parameters extracted from frequency domain spectroscopy (FDS) and the transformer’s moisture content. However, the established empirical equation may not be applicable to a novel testing environment, resulting in an unreliable evaluation result. In this regard, it is acknowledged that FDS combined with machine learning is more suitable for estimating moisture content in a variety of test environments. Nonetheless, the accuracy of the estimation results obtained using the existing method is limited by the algorithm’s inability to generalize. To address this issue, we propose an AdaBoost algorithm-enhanced back-propagation neural network (BP_AdaBoost). This study creates a database by extracting feature parameters from the FDS that characterize the insulation states of the prepared samples. Then, using the BP_AdaBoost algorithm and the newly constructed database, the moisture estimation models are trained. Finally, the results of the estimation are discussed in terms of laboratory and field transformers. By comparing the proposed BP_AdaBoost algorithm to other intelligence algorithms, it is demonstrated that it not only performs better in generalization, but also maintains a high level of accuracy. [ABSTRACT FROM AUTHOR]

Fighting against the pandemic diseases with unique characters requires new sophisticated approaches like the artificial intelligence. This paper develops an artificial intelligence algorithm to produce multi-dimensional policies for controlling and minimizing the pandemic casualties under the limited pharmacological resources. In this respect, a comprehensive parametric model with a priority and age-specific vaccination policy and a variety of non-pharmacological policies are introduced. This parametric model is utilized for constructing an artificial intelligence algorithm by following the exact analogy of the model-based solution. Also, this parametric model is manipulated by the artificial intelligence algorithm to seek for the best multi-dimensional non-pharmacological policies that minimize the future pandemic casualties as desired. The role of the pharmacological and non-pharmacological policies on the uncertain future casualties are extensively addressed on the real data. It is shown that the developed artificial intelligence algorithm is able to produce efficient policies which satisfy the particular optimization targets such as focusing on minimization of the death casualties more than the infected casualties or considering the curfews on the people age over 65 rather than the other non-pharmacological policies. The paper finally analyses a variety of the mutant virus cases and the corresponding non-pharmacological policies aiming to reduce the morbidity and mortality rates. [ABSTRACT FROM AUTHOR]

Fighting against the pandemic diseases with unique characters requires new sophisticated approaches like the artificial intelligence. This paper develops an artificial intelligence algorithm to produce multi-dimensional policies for controlling and minimizing the pandemic casualties under the limited pharmacological resources. In this respect, a comprehensive parametric model with a priority and age-specific vaccination policy and a variety of non-pharmacological policies are introduced. This parametric model is utilized for constructing an artificial intelligence algorithm by following the exact analogy of the model-based solution. Also, this parametric model is manipulated by the artificial intelligence algorithm to seek for the best multi-dimensional non-pharmacological policies that minimize the future pandemic casualties as desired. The role of the pharmacological and non-pharmacological policies on the uncertain future casualties are extensively addressed on the real data. It is shown that the developed artificial intelligence algorithm is able to produce efficient policies which satisfy the particular optimization targets such as focusing on minimization of the death casualties more than the infected casualties or considering the curfews on the people age over 65 rather than the other non-pharmacological policies. The paper finally analyses a variety of the mutant virus cases and the corresponding non-pharmacological policies aiming to reduce the morbidity and mortality rates. [ABSTRACT FROM AUTHOR]

Many datasets including social media data and bibliographic data can be modeled as graphs. Clustering such graphs is able to provide useful insights into the structure of the data. To improve the quality of clustering, node attributes can be taken into account, resulting in attributed graphs. Existing attributed graph clustering methods generally consider attribute similarity and structural similarity separately. In this paper, we represent attributed graphs as star-schema heterogeneous graphs, where attributes are modeled as different types of graph nodes. This enables the use of personalized pagerank (PPR) as a unified distance measure that captures both structural and attribute similarities. We employ DBSCAN for clustering, and we update edge weights iteratively to balance the importance of different attributes. The rapidly growing volume of data nowadays challenges traditional clustering algorithms, and thus, a distributed method is required. Hence, we adopt a popular distributed graph computing system Blogel, based on which, we develop four exact and approximate approaches that enable efficient PPR score computation when edge weights are updated. To improve the effectiveness of the clustering, we propose a simple yet effective edge weight update strategy based on entropy. In addition, we present a game theory based method that enables trading efficiency for result quality. Extensive experiments on real-life datasets offer insights into the effectiveness and efficiency of our proposals. [ABSTRACT FROM AUTHOR]

This paper addresses a UAV path planning problem for a team of cooperating heterogeneous vehicles composed of one unmanned aerial vehicle (UAV) and multiple unmanned ground vehicles (UGVs). The UGVs are used as mobile actuators and scattered in a large area. To achieve multi-UGV communication and collaboration, the UAV, modeled as a Dubins vehicle, serves as a messenger to fly over the effective communication range of all UGVs to relay information. The curvature-constrained path planning of the messenger UAV is formulated as a Dubins Traveling Salesman Problem with Dynamic Neighborhood (DTSPDN) which is a complex optimization problem involving coupled variables and contains dynamic constraints. We design an effective memetic algorithm to find the shortest route that enables the messenger UAV to visit all moving UGVs. This algorithm combines the genetic algorithm procedure, two kinds of local search operators based on gradient search and uniform sampling respectively, and a gradient-based repair operator to repair the solutions violating dynamic constraints. During the evolutionary process, a special phenomenon may occur that changing some decision variables (i.e., visiting sequence and location) may not affect the evaluation function value, but may alter the feasible region of another decision variable (i.e., visiting time) due to the encounter constraint between the UAV and UGV. To track and utilize the change of the feasible region, a transformation procedure is proposed to change one solution to another with less visiting time by analyzing the encounter pattern between UAV and UGV. The computational results on random instances with different scales demonstrate that the proposed approach can effectively generate better curvature-constrained tours to encounter all moving UGVs when compared to other four competitive algorithms in the literature. Note to Practitioners—This paper studies an emerging path planning problem for a UAV which is used to provide communication service for multiple moving UGVs. These UGVs are required to execute tasks (e.g., firefighting, search and rescue) within a large area. Due to their limited communication capabilities, they may be unable to obtain necessary information from other UGVs. The UAV serves as a messenger to fly over the effective communication range of all moving UGVs to relay information. We propose a novel memetic algorithm to efficiently search for the shortest tour that enables the messenger UAV to visit all moving UGVs. The memetic algorithm combines the parallel global search virtue of genetic algorithm with efficient local search procedure to improve the generated tour. A gradient-based repair procedure is also employed to make sure that the planned tour can guide the UAV to sequentially encounter each moving UGV. Simulations exhibit that the proposed approach can effectively generate high-quality tours for messenger UAV to rapidly visit all UGVs, which assists UGVs to achieve collaboration in large area. In future work, the proposed memetic algorithm will be extended to plan tours for multiple messenger UAVs. [ABSTRACT FROM AUTHOR]

Energy management strategy (EMS) is the key to the performance of fuel cell / battery hybrid system. At present, reinforcement learning (RL) has been introduced into this field and has gradually become the focus of research. However, traditional EMSs only take the energy consumption into consideration when optimizing the operation economy, and ignore the cost caused by power source degradations. It would cause the problem of poor operation economy regarding Total Cost of Ownership (TCO). On the other hand, most studied RL algorithms have the disadvantages of overestimation and improper way of restricting battery SOC, which would lead to relatively poor control performance as well. To solve these problems, this paper establishes a TCO model including energy consumption, equivalent energy consumption and degradation of power sources at first, then adopt the Double Q-learning RL algorithm with state constraint and variable action space to determine the optimal EMS. Finally, using hardware-in-the-loop platform, the feasibility, superiority and generalization of proposed EMS is proved by comparing with the optimal dynamic programming and traditional RL EMS and equivalent consumption minimum strategy (ECMS) under both training and unknown operating conditions. Results prove that the proposed strategy has high global optimality and excellent SOC control ability regardless of training or unknown conditions. [ABSTRACT FROM AUTHOR]

Periodicity is a frequently happening phenomenon for social interactions in temporal networks. Mining periodic communities are essential to understanding periodic group behaviors in temporal networks. Unfortunately, most previous studies for community mining in temporal networks ignore the periodic patterns of communities. In this paper, we study the problem of seeking periodic communities in a temporal network, where each edge is associated with a set of timestamps. We propose novel models, including $\sigma$ σ -periodic $k$ k -core and $\sigma$ σ -periodic $k$ k -clique, that represent periodic communities in temporal networks. Specifically, a $\sigma$ σ -periodic $k$ k -core (or $\sigma$ σ -periodic $k$ k -clique) is a $k$ k -core (or clique with size larger than $k$ k ) that appears at least $\sigma$ σ times periodically in the temporal graph. The problem of searching periodic core is efficient but the resulting communities may be not enough cohesive; the problem of enumerating all periodic cliques is not efficient (NP-hard) but the resulting communities are very cohesive. To compute all of them efficiently, we first develop two effective graph reduction techniques to significantly prune the temporal graph. Then, we transform the temporal graph into a static graph and prove that mining the periodic communities in the temporal graph equals mining communities in the transformed graph. Subsequently, we propose a decomposition algorithm to search maximal $\sigma$ σ -periodic $k$ k -core, a Bron-Kerbosch style algorithm to enumerate all maximal $\sigma$ σ -periodic $k$ k -cliques, and a branch-and-bound style algorithm to find the maximum $\sigma$ σ -periodic clique. The results of extensive experiments on five real-life datasets demonstrate the efficiency, scalability, and effectiveness of our algorithms. [ABSTRACT FROM AUTHOR]

Motivated by applications in data center networks, in this paper, we study the problem of scheduling in an input queued switch. While throughput maximizing algorithms in a switch are well-understood, delay analysis was developed only recently. It was recently shown that the well-known MaxWeight algorithm achieves optimal scaling of mean queue lengths in steady state in the heavy-traffic regime, and is within a factor less than 2 of a universal lower bound. However, MaxWeight is not used in practice because of its high time complexity. In this paper, we study several low complexity algorithms and show that their heavy-traffic performance is identical to that of MaxWeight. We first present a negative result that picking a random schedule does not have optimal heavy-traffic scaling of queue lengths even under uniform traffic. We then show that if one picks the best among two matchings or modifies a random matching even a little, using the so-called flip operation, it leads to MaxWeight like heavy-traffic performance under uniform traffic. We then focus on the case of non-uniform traffic and show that a large class of low time complexity algorithms have the same heavy-traffic performance as MaxWeight, as long as it is ensured that a MaxWeight matching is picked often enough. We also briefly discuss the performance of these algorithms in the large scale heavy-traffic regime when the size of the switch increases simultaneously with the load. Finally, we perform empirical study on a new algorithm to compare its performance with some existing algorithms. [ABSTRACT FROM AUTHOR]

Non-Line-of-Sight (NLOS) imaging reconstructs occluded scenes based on indirect diffuse reflections. The computational complexity and memory consumption of existing NLOS reconstruction algorithms make them challenging to be implemented in real-time. This paper presents a fast and memory-efficient phasor field-diffraction-based NLOS reconstruction algorithm. In the proposed algorithm, the radial property of the Rayleigh Sommerfeld diffraction (RSD) kernels along with the linear property of Fourier transform are utilized to reconstruct the Fourier domain representations of RSD kernels using a set of kernel bases. Moreover, memory consumption is further reduced by sampling the kernel bases in a radius direction and constructing them during the run-time. According to the analysis, the memory efficiency can be improved by as much as $\mathbf {220}\times$ 220 × . Experimental results show that compared with the original RSD algorithm, the reconstruction time of the proposed algorithm is significantly reduced with little impact on the final imaging quality. [ABSTRACT FROM AUTHOR]

Since the definition of the bufferbloat phenomenon, several Linux kernel modules have been introduced in its TCP/IP stack, and there is a lack of experimental studies on their effects when coupled with WLAN technologies, in particular, IEEE 802.11n and IEEE 802.11ac. One essential algorithm introduced is named TCP Small Queues (TSQ) and has the role of limiting the number of packets that a TCP socket can enqueue in the stack, waiting for the physical layer to send the packets before enqueueing extra data. A second significant TCP algorithm is named TCP Pacing (TP) and regulates the pace used by the socket to enqueue packets in the stack, regulating the formation of bursts of data. These mechanisms affect the frame aggregation logic on WLAN networks and compromise the throughput-latency tradeoff of all the TCP variants. This paper presents an experimental evaluation of these techniques investigating the wireless network performance of several TCP congestion control variants under the presence of different TSQ and TP policies, modeling also their interaction. [ABSTRACT FROM AUTHOR]

This paper investigates the stochastic optimization problem focusing on developing scalable parallel algorithms for deep learning tasks. Our solution involves a reformation of the objective function for stochastic optimization in neural network models, along with a novel parallel computing strategy, coined the weighted aggregating stochastic gradient descent (WASGD). Following a theoretical analysis on the characteristics of the new objective function, WASGD introduces a decentralized weighted aggregating scheme based on the performance of local workers. Without any center variable, the new method automatically gauges the importance of local workers and accepts them by their contributions. Furthermore, we have developed an enhanced version of the method, WASGD+, by (1) implementing a designed sample order and (2) upgrading the weight evaluation function. To validate the new method, we benchmark our pipeline against several popular algorithms including the state-of-the-art deep neural network classifier training techniques (e.g., elastic averaging SGD). Comprehensive validation studies have been conducted on four classic datasets: CIFAR-100, CIFAR-10, Fashion-MNIST, and MNIST. Subsequent results have firmly validated the superiority of the WASGD scheme in accelerating the training of deep architecture. Better still, the enhanced version, WASGD+, is shown to be a significant improvement over its prototype. [ABSTRACT FROM AUTHOR]

In social networks, individuals’ decisions are strongly influenced by recommendations from their friends, acquaintances, and favorite renowned personalities. The popularity of online social networking platforms makes them the prime venues to advertise products and promote opinions. The Influence Maximization (IM) problem entails selecting a seed set of users that maximizes the influence spread, i.e., the expected number of users positively influenced by a stochastic diffusion process triggered by the seeds. Engineering and analyzing IM algorithms remains a difficult and demanding task due to the NP-hardness of the problem and the stochastic nature of the diffusion processes. Despite several heuristics being introduced, they often fail in providing enough information on how the network topology affects the diffusion process, precious insights that could help researchers improve their seed set selection. In this paper, we present VAIM, a visual analytics system that supports users in analyzing, evaluating, and comparing information diffusion processes determined by different IM algorithms. Furthermore, VAIM provides useful insights that the analyst can use to modify the seed set of an IM algorithm, so to improve its influence spread. We assess our system by: $(i)$ (i) a qualitative evaluation based on a guided experiment with two domain experts on two different data sets; $(ii)$ (i i) a quantitative estimation of the value of the proposed visualization through the ICE-T methodology by Wall et al. (IEEE TVCG - 2018). The twofold assessment indicates that VAIM effectively supports our target users in the visual analysis of the performance of IM algorithms. [ABSTRACT FROM AUTHOR]

This paper proposes a reconstruction algorithm for the geometric shapes of static overhead transmission lines that is based on the spatial coordinate data (obtained by field mapping) and the corresponding inclination data (obtained by attitude sensors). The algorithm takes the piecewise cubic Hermite interpolation function as the basic framework and corrects the aforementioned two types of data based on the “minimum energy principle” of the transmission line system. The introduction of a new energy function in modified energy method (MEM) overcame the shortcomings of conventional energy method (CEM) in fairing strategy, and the new Fairing Criterion made result curves more consistent with the mechanical properties of transmission lines. In the numerical simulation tests, the two energy methods were compared in terms of load type, horizontal span, elevation difference, and anti-disturbance ability, which showed that MEM has a higher reconstruction accuracy (average Euclidean distance is less than 1 cm) and better robustness than CEM. Meanwhile, the key parameters involved in the algorithm were discussed to guide the application in practical engineering. In addition, measurement tests under non-uniform icing were carried out in the field test station, and the results showed that the maximum relative error is less than 0.1%. [ABSTRACT FROM AUTHOR]

This paper proposes an approach to mitigate adverse effects of the fault management of closed/ring grids with high shares of distributed generation (DG). The approach refers to conventional distance protection relays in particular. The rising share of DG, especially in distribution systems, can lead to overloadings and intolerable voltages. Closed-ring structures increase the grid capacity for DG due to more balanced load and voltages profiles. However, malfunctions of protection relays may occur because fault locating and selective fault clearing can be disturbed. This paper presents a distance protection algorithm for feeder relays that complies with the requirements of closed/ring grids with inter/infeeds. The proposed current comparison method (CCM) bases on the comparison of negative/sequence currents. It needs no voltage measurement and remains unaffected from inter/infeeds and fault resistances. Additionally, for relays located at the ring coupler, where the ring can be opened, a coupling relay method (CRM) is proposed. It locates unsymmetrical faults in closed/ring grids with inter/infeeds and enables fast and selective opening of the ring. This helps maintaining reliable power supply for customers in closed rings. Finally, the paper presents a grading strategy reducing the average fault clearing time. Lab tests prove the capability of both proposed algorithms. [ABSTRACT FROM AUTHOR]

For nearly a decade, quality-related fault detection algorithms have been widely used in industrial systems. However, the majority of these detection strategies rely on static assumptions of the operating environment. In this paper, taking the time series of variables into consideration, a dynamic kernel entropy component regression (DKECR) framework is proposed to address the instability of quality-related fault detection due to the existing dynamic characteristics. Compared with the typical kernel entropy component analysis method, the proposed method constructs the relationship between process states and quality states to further interpret the direct effect on the product taken by the fault. In the proposed approach, process measurements are converted to a lower-dimensional subspace with a specific angular structure that is more comprehensive than traditional subspace approaches. In addition, the angular statistics and their relevant thresholds are exploited to enhance the quality-related fault detection performance. Finally, the proposed method will be compared with three methods by means of a numerical example and two industrial scenarios to demonstrate its practicality and effectiveness. Note to Practitioners—This paper studies a quality-related fault detection problem for the dynamic nonlinear industrial system. Controlling and measuring the quality state is challenging for the high-level monitoring system of the manufacturing process due to the nonlinear dynamic feature in states. This paper proposes a new data-driven method based on the kernel entropy component analysis method to assess the correlation between the quality and fault in the industrial system, reducing unnecessary overhaul and maintenance. Based on the autoregressive moving average exogenous algorithm, the proposed method captures the dynamic interaction between the process states to decrease false alarms. In the experimental section, the DKECR method outperforms the compared approaches, which can provide stable fault detection results. Additionally, the unique angle structure of the proposed method can supply more information for engineers’ monitoring needs. [ABSTRACT FROM AUTHOR]

Flexible block partition and newly adopted intra coding tools bring significant performance improvement for next generation video coding, and meanwhile introduce non-negligible encoding complexity increment. This paper presents a scalable intra coding optimization (SICO) scheme for the third generation of audio video coding standard (AVS3). The complexity distribution and inheriting relationship among different partitioning, as well as intra prediction modes, are systematically analyzed. Subsequently, low-complexity algorithms are proposed, which could early exclude unlikely coding modes safely. In particular, a data-driven binary classifier is elegantly trained for the determination of coding unit partitioning. Moreover, the preliminary coding information can be exhaustively utilized for the mode decision in a low-cost manner. The proposed method provides scalable intra coding optimizing solutions, which is eligible to cater to various application scenarios. Experimental results show that the proposed method could achieve a wide range of encoding complexity reduction from 18% to 76% with moderate compression performance loss. One implementation of the proposed method has been adopted to the AVS3 reference software. [ABSTRACT FROM AUTHOR]

As an algorithmic framework, message passing is extremely powerful and has wide applications in the context of different disciplines including communications, coding theory, statistics, signal processing, artificial intelligence and combinatorial optimization. In this paper, we investigate the performance of a message-passing algorithm called min-sum belief propagation (BP) for the vertex-disjoint shortest $k$ -path problem ($k$ -VDSP) on weighted directed graphs, and derive the iterative message-passing update rules. As the main result of this paper, we prove that for a weighted directed graph $G$ of order $n$ , BP algorithm converges to the unique optimal solution of $k$ -VDSP on $G$ within $O(n^{2}w_{max})$ iterations, provided that the weight $w_{e}$ is nonnegative integral for each arc $e\in E(G)$ , where $w_{max}=\max \{w_{e}: e\in E(G)\}$. To the best of our knowledge, this is the first instance where BP algorithm is proved correct for NP-hard problems. Additionally, we establish the extensions of $k$ -VDSP to the case of multiple sources or sinks. [ABSTRACT FROM AUTHOR]

Unavoidably, the controlsystem of any permanent magnet synchronous motor (PMSM) is subjected to perturbations, e.g., motor nonidealities and inverter nonlinearities. To reject these perturbations, a new super-twisting (ST) control variant, called speed adaptive super-twisting (S-AST) control, is proposed in this paper. In the S-AST control, a proportional-integral (PI) and a ST controllers are merged using an adaptive law that is based on the motor speed measurement. This is done to reduce the chattering problems that the standard ST control presents. In addition, a mathematical design for the S-AST control is proposed, where the relationship between the chattering amplitude, the switching frequency and the system perturbations is shown. The main contribution in this paper is the application of the S-AST controller to reduce the total harmonic distortion (THDi) of the PMSM currents. By comparing the S-AST control against PI control, the THDi is reduced from 9.9% to 1.27%, in simulation, and the THDi is reduced from 22.79% to 1.56%, experimentally. These results demonstrate how the S-AST control is an excellent alternative to improve the waveform of the PMSM currents. [ABSTRACT FROM AUTHOR]

Extreme events can cause severe power system damage. Resilience-driven operation of networked microgrids (MGs) has been heavily studied in literature. There is, though, little research considering the influence of resilience on decision making for planning. In this paper, a three-level model is suggested to solve the optimal sizing problem of networked MGs considering both resilience and cost. In the first level, a meta-heuristic technique based on an adaptive genetic algorithm (AGA) is utilized to tackle the normal sizing problem, while a time-coupled AC OPF is utilized to capture stability properties for accurate decision-making. The second and third levels are combined as a defender-attacker-defender model. In the former, the suggested AGA is utilized to generate attacking plans capturing load profile uncertainty and contingencies for load shedding maximization, while a multi-objective optimization problem is suggested for the latter to obtain a trade-off between cost and resilience. Simulations considering meshed networks and load distinction into critical and non-critical are developed to demonstrate algorithm effectiveness on capturing resilience at the planning stage and optimally sizing multiple parameters. The results indicate that higher resilience levels lead to higher investment cost, while sizing networked MGs leads to decreased investment in comparison with standalone MGs sizing. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the convergence speed of the Arimoto-Blahut algorithm. For many channel matrices, the convergence speed is exponential, but for some channel matrices it is slower than exponential. By analyzing the Taylor expansion of the defining function of the Arimoto-Blahut algorithm, we will make the conditions clear for the exponential or slower convergence. The analysis of the slow convergence in this paper is new. Based on this analysis, we will compare the convergence speeds of the Arimoto-Blahut algorithm numerically with the values obtained in our theorems for several channel matrices. The purpose of this paper is to obtain a complete understanding of the convergence speed of the Arimoto-Blahut algorithm. [ABSTRACT FROM AUTHOR]

Flexible DC distribution networks have been widely developed because of their advantages of high efficiency, low cost, and easy access to renewable energy. However, as distribution networks have more ends than the two-terminal transmission line, it is more challenging to protect them and locate their faults. Therefore, this paper proposes a modified T-source circuit breaker to protect against DC faults. Based on the proposed circuit breaker, an integral fault location method using double-terminal asynchronous data is proposed. The accuracy of the algorithm is not affected by the fault resistance. There are no differential terms in the algorithm, which greatly reduces the sensitivity to noise. The integral algorithm can remain steady when the voltage and current are zero in oscillation and attenuation periods. This constitutes the main contribution of this paper. Finally, it is verified by simulation and experiment that the proposed circuit breaker can isolate the power source within a short time in the typical DC distribution network. Under a noise of 30 dB for simulation, the location error of the proposed algorithm is <0.4% when the fault resistance is 0.5 Ω–500 Ω. [ABSTRACT FROM AUTHOR]

Unlike the conventional facial expressions, micro-expressions are involuntary and transient facial expressions capable of revealing the genuine emotions that people attempt to hide. Therefore, they can provide important information in a broad range of applications such as lie detection, criminal detection, etc. Since micro-expressions are transient and of low intensity, however, their detection and recognition is difficult and relies heavily on expert experiences. Due to its intrinsic particularity and complexity, video-based micro-expression analysis is attractive but challenging, and has recently become an active area of research. Although there have been numerous developments in this area, thus far there has been no comprehensive survey that provides researchers with a systematic overview of these developments with a unified evaluation. Accordingly, in this survey paper, we first highlight the key differences between macro- and micro-expressions, then use these differences to guide our research survey of video-based micro-expression analysis in a cascaded structure, encompassing the neuropsychological basis, datasets, features, spotting algorithms, recognition algorithms, applications and evaluation of state-of-the-art approaches. For each aspect, the basic techniques, advanced developments and major challenges are addressed and discussed. Furthermore, after considering the limitations of existing micro-expression datasets, we present and release a new dataset — called micro-and-macro expression warehouse (MMEW) — containing more video samples and more labeled emotion types. We then perform a unified comparison of representative methods on CAS(ME) $^2$ 2 for spotting, and on MMEW and SAMM for recognition, respectively. Finally, some potential future research directions are explored and outlined. [ABSTRACT FROM AUTHOR]

Mal-operation of distance protection relays during power swing (PS) condition can endanger the power system stability. Therefore, it is crucial to distinguish between short-circuit faults and PS by a power swing blocking (PSB) function to prevent undesired tripping of distance relay. This paper develops a novel and straightforward PSB method based on the rate of impedance angle change (RIAC). Not only can the proposed approach fairly discriminate both symmetrical and asymmetrical faults from PS, but also it can appropriately preserve protection scheme security during PS under single-pole tripping (SPT) on a transmission line. Furthermore, there is no need to perform extensive dynamic stability studies for setting the PSB function parameters. Unlike the rate of impedance change approaches utilized two blinders, the developed approach only needs an inner blinder. Thus, it can be used for networks running near their operational limits. The proposed method is evaluated through a modified IEEE-PSRC benchmark system in PSCAD/EMTC environment. The obtained results verify superior performance of the proposed method to traditional impedance rate of change method under different scenarios. [ABSTRACT FROM AUTHOR]

With the increasing number of controllable devices in the grid, devices owned by different entities are supposed to cooperatively support the grid operation. To balance the various interests of the customers and the utility, this paper proposes a two-level scheduling algorithm to address voltage regulation by coordinating the customer-owned battery energy storage system (BESS) and utility-owned load tap changers (LTCs) in power distribution systems. The objective is to find the optimal operation scheduling for both BESSs and LTCs that simultaneously maximize the economic payback and satisfy system operation rules. For BESSs, a local optimization problem is formulated in a chance-constrained manner in major consideration of the economic performance. For the utility interest, a Markov decision process (MDP) and a computationally efficient reinforcement learning (RL) algorithm are utilized to solve the optimal tap setting problem. To coordinate BESSs and LTCs, a global voltage adjustment is applied. The effectiveness of the proposed algorithm is validated via simulations on the IEEE 13-node and 34-node distribution test feeders. [ABSTRACT FROM AUTHOR]

Multimodal path queries over transportation networks are receiving increasing attention due to their widespread applications. A multimodal path query consists of finding multimodal journeys from source to destination in transportation networks, including unrestricted walking, driving, cycling, and schedule-based public transportation. Transportation networks are generally continent-sized. This characteristic highlights the need for parallel computing to accelerate multimodal path queries. Meanwhile, transportation networks are often fragmented and distributively stored on different machines. This situation calls for exploiting parallel computing power for these distributed systems. Therefore, in this paper, we study distributed multimodal path (DMP) queries over large transportation networks. We develop algorithms to explore parallel computation. When evaluating a DMP query $Q$ Q on a distributed multimodal graph $Gmult$ G m u l t , we show that the algorithms possess the following performance guarantees, irrespective of how $Gmult$ G m u l t is fragmented and distributed: (1) each machine is visited only once; (2) the total network traffic is determined by the size of $Q$ Q and the fragmentation of $Gmult$ G m u l t ; (3) the response time is decided by the largest fragment of $Gmult$ G m u l t ; and (4) the algorithm is parallel scalable. Using real-life and synthetic data, we experimentally verify that the algorithms are scalable on large graphs. [ABSTRACT FROM AUTHOR]

This paper tackles the problem of decomposing binary data using matrix factorization. We consider the family of mean-parametrized Bernoulli models, a class of generative models that are well suited for modeling binary data and enables interpretability of the factors. We factorize the Bernoulli parameter and consider an additional Beta prior on one of the factors to further improve the model’s expressive power. While similar models have been proposed in the literature, they only exploit the Beta prior as a proxy to ensure a valid Bernoulli parameter in a Bayesian setting; in practice it reduces to a uniform or uninformative prior. Besides, estimation in these models has focused on costly Bayesian inference. In this paper, we propose a simple yet very efficient majorization-minimization algorithm for maximum a posteriori estimation. Our approach leverages the Beta prior whose parameters can be tuned to improve performance in matrix completion tasks. Experiments conducted on three public binary datasets show that our approach offers an excellent trade-off between prediction performance, computational complexity, and interpretability. [ABSTRACT FROM AUTHOR]

Network partition in complex power networks is essential for the var-voltage control. Traditional partition methods such as Ward method are applied in practical power networks, but they are unable to evaluate the quality of partition results. Moreover, they lack efficiency when dealing with large-scale networks. Since complex operation characteristics and topology have emerged in recent power systems, the power grid partition requires higher efficiency and quality. Therefore, this paper proposes a fast network partition method with a balanced-depth-based community detection algorithm. Its aim is to significantly improve the efficiency of partition while maintaining high quality of partition, with which the inter-zone coupling is minimized while the intra-zone coupling is maximized. In the meantime, a surrogate-optimization-based selection algorithm is proposed to select the zonal pilot bus, based on which the secondary voltage control method is used to evaluate the quality of partition. Results from four case studies conducted in various power networks with different sizes, as compared to other partition methods, validate the high efficiency and high quality of the proposed power grid partition approach. [ABSTRACT FROM AUTHOR]

Many big data applications produce a massive amount of high-dimensional, real-time, and evolving streaming data. Clustering such data streams with both effectiveness and efficiency are critical for these applications. Although there are well-known data stream clustering algorithms that are based on the popular online-offline framework, these algorithms still face some major challenges. Several critical questions are still not answer satisfactorily: How to perform dimensionality reduction effectively and efficiently in the online dynamic environment? How to enable the clustering algorithm to achieve complete real-time online processing? How to make algorithm parameters learn in a self-supervised or self-adaptive manner to cope with high-speed evolving streams? In this paper, we focus on tackling these challenges by proposing a fully online data stream clustering algorithm (called ESA-Stream) that can learn parameters online dynamically in a self-adaptive manner, speedup dimensionality reduction, and cluster data streams effectively and efficiently in an online and dynamic environment. Experiments on a wide range of synthetic and real-world data streams show that ESA-Stream outperforms state-of-the-art baselines considerably in both effectiveness and efficiency. [ABSTRACT FROM AUTHOR]

This paper presents a nonlinear dynamic simulation model of an ultracapacitor (UC) bank and the associated control system. The control system at hand consists of two levels: the lower level controls the inverter of the UC bank, while the upper control level is responsible for providing charging/discharging active power set points to be followed by the lower control level. This paper focuses on the development of the upper control level for frequency control. Specifically, two simulation case studies are developed so as to assess the performance of the proposed control framework. In the first case study the upper control level is developed using a classical Proportional-Integral-Derivative (PID) controller. In the second case study the upper control level is devised using a Model Predictive Control (MPC) algorithm based on internal linear prediction model of a nonlinear UC bank. In both cases, a nonlinear UC bank simulation model is used. The simulation case studies are modelled and tested in Matlab/Simulink. The response of the MPC-controlled UC bank is compared to the 3 existing PID-control algorithms for frequency control. The simulation results show that the MPC algorithm outperforms the conventional PID controllers. [ABSTRACT FROM AUTHOR]

This paper proposes a novel inertia-enhanced distributed control method to complement the inertia of microgrids. The rate of change of frequency (RoCoF) and the rate of change of voltage (RoCoV) are employed in this paper to quantify the frequency inertia and voltage inertia, respectively. Then, a fully distributed algorithm with constrained changing rates is proposed. By bounding the changing rates of frequency and voltage during the consensus control, the algorithm can address the consensus problem while enhancing the inertia of microgrids. Compared with most inertia control methods, the proposed method can utilize the reserve power of scattered DGs to supply inertia. Besides, it performs better under disturbances and delays than conventional distributed control methods. The effectiveness of the proposed method is validated by several cases in MATLAB/Simulation and a hardware experiment. [ABSTRACT FROM AUTHOR]

Remaining useful life prediction is an important way to improve the durability and reduce the cost of the proton exchange membrane fuel cell. This paper presents a novel method to predict the remaining useful life of proton exchange membrane fuel cell under different load currents based on support vector regression and grey wolf optimizer algorithm. The proposed method considers the influence of 17 operating conditions and historical voltage. Firstly, the measured data are reconstructed through robust locally weighted smoothing method to reduce the calculation amount and filter disturbances. Then, support vector regression with fewer hyperparameters is used to establish the degradation model. Finally, the hyperparameters of support vector regression are optimized through grey wolf optimizer algorithm to improve the accuracy of degradation prediction. The proposed method is validated by two degradation experiments under different load currents. The test results show that grey wolf optimizer algorithm can effectively improve the accuracy of degradation prediction based on support vector regression. Compared with other methods, the proposed method has the highest accuracy. The proposed method can predict the fuel cell degradation with a mean absolute percentage error of less than 0.3%. The proposed method can predict the remaining useful life of 492 hours. [ABSTRACT FROM AUTHOR]

The development of Blockchain-based mobile applications are impeded due to the resource limitations of mobile devices. Computation offloading can be a viable solution. In this paper, we consider a two-layer computation offloading paradigm including an edge computing service provider (ESP) and a cloud computing service provider (CSP). We formulate a multi-leader multi-follower Stackelberg game to address the computing resource management problem in such a network, by jointly maximizing the profits of each service provider (SP) and the payoffs of individual miners. We study two practical scenarios: a fixed-miner-number scenario for permissioned blockchains and a dynamic-miner-number scenario for permissionless blockchains. For the fixed-miner-number scenario, we discuss two different edge operation modes, i.e., the ESP is connected (to the CSP) or standalone, which form different miner subgames based on whether each miner's strategy set is mutually dependent. The existence and uniqueness of Stackelberg equilibrium (SE) in both modes are analyzed, according to which algorithms are proposed to achieve the corresponding SE(s). For the dynamic-miner-number scenario, we focus on the impact of population uncertainty and find that the uncertainty inflates the aggressiveness in the ESP resource purchasing. Numerical evaluations are presented to verify the proposed models. [ABSTRACT FROM AUTHOR]

Online social networks have become major battlegrounds for political campaigns, viral marketing, and the dissemination of news. As a consequence, “bad actors” are increasingly exploiting these platforms, which is a key challenge for their administrators, businesses and society in general. The spread of fake news is a classical example of the abuse of social networks by these bad actors. While some have advocated for stricter policies to control the spread of misinformation in social networks, this often happens in detriment of their democratic and organic structure. In this paper, we aim to limit the influence of a target group in a social network via the removal of a few users/links. We formulate the influence limitation problem in a data-driven fashion, by taking into account past propagation traces. More specifically, our algorithms find critical edges to be removed in order to decrease the influence of a target group based on past data. The idea is to control the diffusion processes while minimizing the amount of disturbance in the network structure. Moreover, we consider two types of constraints over edge removals, a budget constraint and also a, more general, set of matroid constraints. These problems lead to interesting challenges in terms of algorithm design. For instance, we are able to show that influence limitation is APX-hard and propose deterministic and probabilistic approximation algorithms for the budgeted and the matroid version of the problem, respectively. Experiments show that the proposed approaches outperform several baselines. [ABSTRACT FROM AUTHOR]

This paper introduces a novel frequency domain technique to globally evaluate the accuracy of electro-magnetic transient simulations. It is shown that simulation accuracy at low frequencies can sometimes be poorer than at high frequency. A modified approach which quantifies accuracy from a driving point as a function of frequency is also introduced that uses the Bilinear Transformation and Norton equivalents, to produce a “simulation accuracy spectrum”. This approach can be applied to large systems without explicitly forming state space equations. It also permits the accuracy analysis of networks with distributed components such as frequency dependent transmission lines. Two examples are used to verify the proposed technique, a small network with a frequency dependent transmission line modeled by the universal line model; and the IEEE 39 bus system connected with an LCC-HVdc system. [ABSTRACT FROM AUTHOR]

The literature on the subject of frequency estimation algorithms has discussed the use of interpolated discrete Fourier transform (IpDFT) for the unbalanced/balanced three-phase voltage signal in a power system. It is diffcult to estimate frequency of the unbalanced signal with high accuracy since the unknown parameters of the unbalanced signal make the spectrum different from the real-valued sinusoid signal. Moreover, the spectral leakage of the spectrum of the unbalanced signal also brings large estimation errors when the acquired signal cycles become very small. In this paper, we propose a two-point iterative IpDFT algorithm for frequency estimation of the unbalanced/balanced three-phase voltage signal. We decompose the unbalanced signal into a real-valued sinusoid signal, and then search the system frequency iteratively with the minimum error by a bisection method. Both long- and short- range leakages are compensated to estimate the frequency accurately. Simulation results prove the effectiveness of our method, compared with other iterative/noniterative IpDFT methods. [ABSTRACT FROM AUTHOR]

This paper focuses on similarity caching systems, in which a user request for an object $o$ that is not in the cache can be (partially) satisfied by a similar stored object $o'$ , at the cost of a loss of user utility. Similarity caching systems can be effectively employed in several application areas, like multimedia retrieval, recommender systems, genome study, and machine learning training/serving. However, despite their relevance, the behavior of such systems is far from being well understood. In this paper, we provide a first comprehensive analysis of similarity caching in the offline, adversarial, and stochastic settings. We show that similarity caching raises significant new challenges, for which we propose the first dynamic policies with some optimality guarantees. We evaluate the performance of our schemes under both synthetic and real request traces. [ABSTRACT FROM AUTHOR]

Tactile Internet based Cyber-Physical Systems (TCPS) are highly sensitive to component and communication latencies and packet drops. Building a high performing TCPS, thus, necessitates experimenting with different hardware, algorithms, access technologies, and communication protocols. To facilitate such experiments, we have developed TCPSbed, a modular testbed for TCPS. TCPSbed facilitates the integration of different components, both real and simulated, to realize different TCPS applications and evaluate their latency and control performances. TCPSbed’s latency analyzer tool employs a novel method to isolate latencies of individual TCPS components such as the latencies contributed by actuation, sensing, algorithms, and by the network, all in an online fashion. TCPSbed’s method of analyzing stability is also novel. It involves the use of the step response analysis method, a classic control-theoretic method used for analyzing the stability of generic control systems. TCPSbed’s support for edge intelligence modules enables prediction of command and feedback signals at the network’s edge allowing TCPS applications to perform well in adverse network conditions. TCPSbed’s source-code, made available through our GitHub page TactileInternet, allows developers to extend its features and functionalities further. In this paper, we describe the architecture and implementation details of TCPSbed and demonstrate its features through several proof-of-concept experiments. [ABSTRACT FROM AUTHOR]

Localizing ground devices (GDs) is an important requirement for a wide variety of applications, such as infrastructure monitoring, precision agriculture, search and rescue operations, to name a few. To this end, unmanned aerial vehicles (UAVs) or drones offer a promising technology due to their flexibility. However, the distance measurements performed using a drone, an integral part of a localization procedure, incur several errors that affect the localization accuracy. In this paper, we provide analytical expressions for the impact of different kinds of measurement errors on the ground distance between the UAV and GDs. We review three range-based and three range-free localization algorithms, identify their source of errors, and analytically derive the error bounds resulting from aggregating multiple inaccurate measurements. We then extend the range-free algorithms for improved accuracy. We validate our theoretical analysis and compare the observed localization error of the algorithms after collecting data from a testbed using ten GDs and one drone, equipped with ultra wide band (UWB) antennas and operating in an open field. Results show that our analysis closely matches with experimental localization errors. Moreover, compared to their original counterparts, the extended range-free algorithms significantly improve the accuracy. [ABSTRACT FROM AUTHOR]

Graph query autocompletion (gQAC) generates a small list of ranked query suggestions during the graph query formulation process in a visual environment. The current state-of-the-art of gQAC provides suggestions that are formed by adding subgraph increments to arbitrary places of an existing (partial) user query. However, according to the research results on human-computer interaction (HCI), humans can only interact with a small number of recent software artifacts in hand. Hence, many of such suggestions could be irrelevant. In this paper, we present the GFocus framework that exploits a novel notion of user focus of graph query formulation (or simply focus). Intuitively, the focus is the subgraph that a user is working on. We formulate locality principles inspired by the HCI research to automatically identify and maintain the focus. We propose novel monotone submodular ranking functions for generating popular and comprehensive query suggestions only at the focus. In particular, the query suggestions of GFocus have high result counts (when they are used as queries) and maximally cover the possible suggestions at the focus. We propose efficient algorithms and an index for ranking the suggestions. Our results show that GFocus saves 12-32 percent more mouse clicks and is 35× more efficient than the state-of-the-art competitor. [ABSTRACT FROM AUTHOR]

The ongoing coronavirus disease 2019 (COVID-19) is a pandemic causing millions of deaths, devastating social and economic disruptions. Testing individuals for severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2), the pathogen of COVID-19, is critical for mitigating and containing COVID-19. Many countries are implementing group testing strategies against COVID-19 to improve testing capacity and efficiency while saving required workloads and consumables. A group of individuals’ nasopharyngeal/oropharyngeal (NP/OP) swab samples is mixed to conduct one test. However, existing group testing methods neglect the fact that mixing samples usually leads to substantial dilution of viral ribonucleic acid (RNA) of SARS-CoV-2, which seriously impacts the sensitivity of tests. In this paper, we aim to screen individuals infected with COVID-19 with as few tests as possible, under the premise that the sensitivity of tests is high enough. To achieve this goal, we propose an Adaptive Group Testing (AdaGT) method. By collecting information on the number of positive and negative samples that have been identified during the screening process, the AdaGT method can estimate the ratio of positive samples in real-time. Based on this ratio, the AdaGT algorithm adjusts its testing strategy adaptively between an individual testing strategy and a group testing strategy. The group size of the group testing strategy is carefully selected to guarantee that the sensitivity of each test is higher than a predetermined threshold and that this group contains at most one positive sample on average. Theoretical performance analysis on the AdaGT algorithm is provided and then validated in experiments. Experimental results also show that the AdaGT algorithm outperforms existing methods in terms of efficiency and sensitivity. Note to Practitioners—Real-time reverse transcription-polymerase chain reaction (rRT-PCR) tests provide scope for automation and are one of the most widely used laboratory methods for detecting the SARS-CoV-2 virus. This paper is motivated by the following challenges: (1) Many countries are experiencing an acute shortage of professionals and consumables for conducting rRT-PCR tests; (2) Group sizes of existing group testing methods against COVID-19 may not be optimal, which adversely impacts the efficiency of the screening of the SARS-CoV-2 virus; (3) Existing group testing methods do not consider the fact that the sensitivity of rRT-PCR tests usually decreases with the group size. The objective of this paper is to improve the efficiency and sensitivity of large-scale screening against COVID-19. For achieving this goal, we propose an Adaptive Group Testing (AdaGT) algorithm, which has the following advantages: (1) It can improve the efficiency for screening the SARS-CoV-2 virus, mainly by adaptively adjusting its testing strategy between an individual testing strategy and a group testing strategy based upon an estimated ratio of positive samples during the screening process; (2) It can guarantee a high sensitivity of the rRT-PCR tests by determining the group sizes of the group testing strategy based upon some constraints; (3) We derive an appropriate threshold for the estimated ratio of positive samples such that the AdaGT algorithm can achieve a minimum average number of rRT-PCR tests and can be directly employed in practical applications. [ABSTRACT FROM AUTHOR]

Single-image super-resolution (SISR) techniques have found wide applications in semiconductor defect inspection. Enhancing image resolution to improve inspection sensitivity and accuracy holds great significance. A novel SISR algorithm, called cross-convolutional residual network (CCRN), is proposed in this study. CCRN comprises a cross-convolutional module (CCM), which incorporates a cross-sharing mechanism that facilitates the fusion of features from different stages, enabling the extraction of more information from the image. Moreover, a global residual aggregation structure (GRA) is introduced. GRA captures and transfers different levels of residual features acquired from learning each CCM to the reconstruction layer. Experimental results demonstrate that the proposed SR algorithm outperforms existing state-of-the-art SR algorithms in terms of both visual and quantitative metrics when applied to optical, SEM, and TEM images of microfluidic chips, CMOS image sensors, and quantum dots, respectively. Additionally, CCRN significantly improves the accuracy of defect classification and inspection of unpatterned wafers, as evaluated using the WM-811K dataset. Notably, an increase in local defection testing accuracy from 79.00% to 89.00% and an improvement in classification accuracy from 93.69% to 96.06% are achieved. These findings underscore the potential applications of the proposed algorithm in improving semiconductor defect inspection and classification accuracies. [ABSTRACT FROM AUTHOR]

Consider a massive random access scenario in which a small set of $k$ active users out of a large number of $n$ potential users need to be scheduled in $b\ge k$ slots. What is the minimum common feedback to the users needed to ensure that scheduling is collision-free? Instead of a naive scheme of listing the indices of the $k$ active users in the order in which they should transmit, at a cost of $k\log (n)$ bits, this paper shows that for the case of $b=k$ , the rate of the minimum fixed-length common feedback code scales only as $k \log (e)$ bits, plus an additive term that scales in $n$ as $\Theta (\log \log (n))$ for fixed $k$. If a variable-length code can be used, assuming uniform activity among the users, the minimum average common feedback rate still requires $k \log (e)$ bits, but the dependence on $n$ can be reduced to $O(1)$. When $b>k$ , the number of feedback bits needed for collision-free scheduling can be significantly further reduced. Moreover, a similar scaling on the minimum feedback rate is derived for the case of scheduling $m$ users per slot, when $k \le mb$. The problem of constructing a minimum collision-free feedback scheduling code is connected to that of constructing a perfect hashing family, which allows practical feedback scheduling codes to be constructed from perfect hashing algorithms. [ABSTRACT FROM AUTHOR]

HVDC grid protection with adequate speed and reliability is required to minimise the impact of DC faults. In particular, fast breaker failure backup protection algorithms are needed to meet the expected reliability requirements of HVDC grids. In this paper, existing breaker failure backup protection algorithms are shown inadequate to detect partial failures like a single module failure of breakers with a modular structure. This paper proposes a backup protection algorithm which rapidly detects a DC breaker failure based on estimating the counter-voltage created by the energy absorption branch during an interruption. The performance of the proposed algorithm is evaluated using a four-terminal test network with both hybrid and mechanical DC breaker technologies. The simulation results show that the proposed algorithm is able to quickly detect both complete and partial failures of the two breaker technologies even considering measurement errors, noise and ageing of the energy absorption components. [ABSTRACT FROM AUTHOR]

Cognitive radio networks (CRNs) have been proposed to solve the spectrum scarcity problem. One of their fundamental procedures is to construct a communication link on a common channel for the users, which is referred to as rendezvous. In reality, the capability to sense the spectrum may vary from user to user. We study distributed rendezvous for heterogeneous sensing capabilities in this paper. The licensed spectrum is divided into $n$ n channels, $U = \lbrace 1,2,\ldots,n\rbrace$ U = { 1 , 2 ,... , n } . We denote the sensing capability of user $i$ i as $C_i \subseteq U$ C i ⊆ U and the set of available channels (i.e., the channels not occupied by paying users) as $V_i \subseteq C_i$ V i ⊆ C i . Due to hardware differences, the users may have different sensing capabilities: $C_i \ne C_j$ C i ≠ C j , and this is called heterogeneous sensing capability. In this paper, we propose efficient algorithms for two scenarios: the fully available scenario where $V_i = C_i$ V i = C i and the partially available scenario where $V_i \subseteq C_i$ V i ⊆ C i . Our idea is to utilize two ‘pointers’ to traverse the sensing capability set, which sets our algorithms apart from the extant rendezvous algorithms. Considering any two neighboring users $a, b$ a , b , we propose the Traversing Pointer (TP) algorithm that guarantees rendezvous in $O(\max \lbrace |C_a|,|C_b|\rbrace \log \log n)$ O (max { | C a | , | C b | } log log n) time slots for the fully available scenario. This result is only $O(\log \log n)$ O (log log n) larger than the theoretical lower bound. Moreover, it removes an $O(\min \lbrace |C_a|,|C_b|\rbrace)$ O (min { | C a | , | C b | }) factor when compared to the state-of-the-art result ($O(|C_a||C_b|)$ O (| C a | | C b |) in S.-H. Wu et al. For the partially available scenario, we propose the Moving Traversing Pointers (MTP) and Prime based Moving Traversing Pointers (P-MTP) algorithms that can guarantee rendezvous within $O((\max \lbrace |V_a|,|V_b|\rbrace)^2\log \log n)$ O ((max { | V a | , | V b | }) 2 log log n) and $O(|V_a||V_b|\log \log n)$ O (| V a | | V b | log log n) time slots respectively, where the latter one combines the pointers and a common technique of plugging in a prime number. The proposed algorithms work more efficiently than the previous best result ($O(|C_a||C_b|)$ O (| C a | | C b |) in C.-C. Wu et al. under various circumstances. We also conduct extensive simulations and the results corroborate our analyses. [ABSTRACT FROM AUTHOR]

This paper presents a distributionally robust network-constrained unit commitment (DR-NCUC) model considering AC network modeling and uncertainties of demands and renewable productions. The proposed model characterizes uncertain parameters using a data-driven ambiguity set constructed by training samples. The non-convex AC power flow equations are approximated by convex quadratic and McCormick relaxations. Since the proposed min-max-min DR-NCUC problem cannot be solved directly by available solvers, a new decomposition algorithm with proof of convergence is reported in this paper. The master problem of this algorithm is solved using both primal and dual cuts, while the max-min sub-problem is solved using the primal-dual hybrid gradient method, obviating the need for using duality theory. Also, an active set strategy is proposed to enhance the tractability of the decomposition algorithm by ignoring the subset of inactive constraints. The proposed model is applied to a 6-bus test system and the IEEE 118-bus test system under different conditions. These case studies illustrate the performance of the proposed DR-NCUC model to characterize uncertainties and the superiority of the proposed decomposition algorithm over other decomposition approaches using either primal or dual cuts. [ABSTRACT FROM AUTHOR]

Co-simulation of heterogeneous systems allows for in-depth analysis of various aspects of power systems’ operation while staying within the environments of the simulation tools that are best fit to represent their respective domains. Equipped with a proprietary co-simulation platform, the paper focuses on the issue of power-conjugate coupling between parts of power grids modeled in transient stability and electromagnetic transient simulation tools. The problems of co-simulation stability and precision in presence of delays are tackled by means of designing a proper coupling interface. It is shown that two established interface methods – the V-I method and the Transmission Line Interface – are special cases of a generalized interface framework proposed in the paper. Moreover, a new interface algorithm is described by parametrizing the generalized framework. Analytical tools are also formulated to aid in the analysis of interface stability and precision via the concepts of passivity and transparency. Simulation results of benchmark systems of various complexity demonstrate the application of the developed power coupling interface. [ABSTRACT FROM AUTHOR]

In task offloading systems, it is imperative to guarantee that an offloaded task is completed within a pre-specified deadline. In this paper, we propose a distributed device-to-device (D2D) offloading system (DDOS) in which a task owner opportunistically broadcasts an offloading request that includes its mobility level and task completion deadline. After receiving the request, mobile devices in the vicinity of the task owner employ a constraint stochastic game to decide, in a distributed manner, whether to accept the request or not. We devise a best response dynamics-based algorithm (BRDA) to obtain a multi-policy constrained Nash equilibrium. Evaluation results demonstrate that DDOS can guarantee a high on-time task completion probability, as well as a low energy consumption. [ABSTRACT FROM AUTHOR]

Adversarial attacks have been extensively studied in recent years since they can identify the vulnerability of deep learning models before deployed. In this paper, we consider the black-box adversarial setting, where the adversary needs to craft adversarial examples without access to the gradients of a target model. Previous methods attempted to approximate the true gradient either by using the transfer gradient of a surrogate white-box model or based on the feedback of model queries. However, the existing methods inevitably suffer from low attack success rates or poor query efficiency since it is difficult to estimate the gradient in a high-dimensional input space with limited information. To address these problems and improve black-box attacks, we propose two prior-guided random gradient-free (PRGF) algorithms based on biased sampling and gradient averaging, respectively. Our methods can take the advantage of a transfer-based prior given by the gradient of a surrogate model and the query information simultaneously. Through theoretical analyses, the transfer-based prior is appropriately integrated with model queries by an optimal coefficient in each method. Extensive experiments demonstrate that, in comparison with the alternative state-of-the-arts, both of our methods require much fewer queries to attack black-box models with higher success rates. [ABSTRACT FROM AUTHOR]

A flat-field correction method is proposed for multiple measured hyperspectral microscopy imaging in this paper. As the most crucial preprocessing process in quantitative microscopic analysis, flat-field correction solves the uneven illumination caused by vignetting in microscopic images, and guarantees the precision of spatial and spectral information in hyperspectral microscopic imaging. In order to carry out flat-field correction and extract uneven illumination among groups of hyperspectral microscopic data containing hundreds of bands simultaneously, two properties of vignetting have been exploited: i) low-rank property is reflected by little information contained in vignetting; ii) local smoothness can be observed as a gradual change in brightness of vignetting, which is typically equivalent to the sparseness in spatial frequency domain. Combining the two properties above, a novel Low Rank Smooth Flat-field Correction (LRSFC) model modified from common orthogonal basis extraction is proposed, while an optimization is solved based on alternating direction multiplier method (ADMM), obtaining a unique flat-field term with low-rank and smooth properties. Qualitative and quantitative experimental assessments indicate that LRSFC does not add extra cell texture to the extracted flat-field term, whose performance appears prior to other state-of-the-art flat-field correction methods. [ABSTRACT FROM AUTHOR]

Adversarial attacks have been extensively studied in recent years since they can identify the vulnerability of deep learning models before deployed. In this paper, we consider the black-box adversarial setting, where the adversary needs to craft adversarial examples without access to the gradients of a target model. Previous methods attempted to approximate the true gradient either by using the transfer gradient of a surrogate white-box model or based on the feedback of model queries. However, the existing methods inevitably suffer from low attack success rates or poor query efficiency since it is difficult to estimate the gradient in a high-dimensional input space with limited information. To address these problems and improve black-box attacks, we propose two prior-guided random gradient-free (PRGF) algorithms based on biased sampling and gradient averaging, respectively. Our methods can take the advantage of a transfer-based prior given by the gradient of a surrogate model and the query information simultaneously. Through theoretical analyses, the transfer-based prior is appropriately integrated with model queries by an optimal coefficient in each method. Extensive experiments demonstrate that, in comparison with the alternative state-of-the-arts, both of our methods require much fewer queries to attack black-box models with higher success rates. [ABSTRACT FROM AUTHOR]