Search

Recognizing actions from still images has been popularly studied recently. In this paper, we model an action class as a flexible number of spatial configurations of body parts by proposing a new spatial sum–product network (SPN). First, we discover a set of parts in image collections via unsupervised learning. Then, our new spatial SPN is applied to model the spatial relationship and also the high-order correlations of parts. To learn robust networks, we further develop a hierarchical spatial SPN method, which models pairwise spatial relationship between parts inside subimages and models the correlation of subimages via extra layers of SPN. Our method is shown to be effective on two benchmark data sets. [ABSTRACT FROM PUBLISHER]

Chemical mechanical polishing/planarization (CMP) combines physical grinding and chemical reactions to planarize the wafer surface. The complex mechanism of CMP brings great challenges to the mechanism-based modeling process. The data-driven CMP modeling process is limited by insufficient datasets. At the same time, these two types of models generally have high computational complexity. In this paper, we introduce the group method of data handling (GMDH)-type polynomial network to build the CMP model to address the above challenges. We designed and manufactured the test chip using a 28nm process. The measurement data from the test chip shows that compared with the mechanism-based CMP model, the trained CMP model based on GMDH-type polynomial network has higher accuracy and lower computational complexity, with the average simulation speed being 115x faster. Experiments based on silicon data show that this modeling method has a small demand for data, and 20 randomly selected sets of data can meet the needs for modeling the current CMP process. [ABSTRACT FROM AUTHOR]

Effectively evaluating the perceptual quality of dehazed images remains an under-explored research issue. In this paper, we propose a no-reference complex-valued convolutional neural network (CV-CNN) model to conduct automatic dehazed image quality evaluation. Specifically, a novel CV-CNN is employed that exploits the advantages of complex-valued representations, achieving better generalization capability on perceptual feature learning than real-valued ones. To learn more discriminative features to analyze the perceptual quality of dehazed images, we design a dual-stream CV-CNN architecture. The dual-stream model comprises a distortion-sensitive stream that operates on the dehazed RGB image, and a haze-aware stream on a novel dark channel difference image. The distortion-sensitive stream accounts for perceptual distortion artifacts, while the haze-aware stream addresses the possible presence of residual haze. Experimental results on three publicly available dehazed image quality assessment (DQA) databases demonstrate the effectiveness and generalization of our proposed CV-CNN DQA model as compared to state-of-the-art no-reference image quality assessment algorithms. [ABSTRACT FROM AUTHOR]

Most researchers focus on designing accurate crowd counting models with heavy parameters and computations but ignore the resource burden during the model deployment. A real-world scenario demands an efficient counting model with low-latency and high-performance. Knowledge distillation provides an elegant way to transfer knowledge from a complicated teacher model to a compact student model while maintaining accuracy. However, the student model receives the wrong guidance with the supervision of the teacher model due to the inaccurate information understood by the teacher in some cases. In this paper, we propose a dual-knowledge distillation (DKD) framework, which aims to reduce the side effects of the teacher model and transfer hierarchical knowledge to obtain a more efficient counting model. First, the student model is initialized with global information transferred by the teacher model via adaptive perspectives. Then, the self-knowledge distillation forces the student model to learn the knowledge by itself, based on intermediate feature maps and target map. Specifically, the optimal transport distance is utilized to measure the difference of feature maps between the teacher and the student to perform the distribution alignment of the counting area. Extensive experiments are conducted on four challenging datasets, demonstrating the superiority of DKD. When there are only approximately 6% of the parameters and computations from the original models, the student model achieves a faster and more accurate counting performance as the teacher model even surpasses it. [ABSTRACT FROM AUTHOR]

Cycle time, which is of order of ten weeks for most products in semiconductor wafer fabrication facilities (wafer fabs), must be explicitly considered in production planning models. Cycle times depend nonlinearly on the resource workload in a wafer fab. Different data-driven (DD) production planning formulations are studied in this paper. Such formulations are based on a set of system states representing the congestion behavior of a wafer fab with work in process (WIP) and resulting output levels. Different WIP-output relations in the DD formulations are investigated. In addition, different methods are proposed to gather representative sets of system states. The DD formulations are compared with the Allocated Clearing Function (ACF) formulation with respect to profit and cost values using simulation models of a scaled-down and a large-sized multi-product wafer fab, respectively. The simulation results show that some DD variants are able to outperform the ACF formulation under several experimental conditions. [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]

Multi-Task Learning (MTL) is a learning paradigm in machine learning and its aim is to leverage useful information contained in multiple related tasks to help improve the generalization performance of all the tasks. In this paper, we give a survey for MTL from the perspective of algorithmic modeling, applications and theoretical analyses. For algorithmic modeling, we give a definition of MTL and then classify different MTL algorithms into five categories, including feature learning approach, low-rank approach, task clustering approach, task relation learning approach and decomposition approach as well as discussing the characteristics of each approach. In order to improve the performance of learning tasks further, MTL can be combined with other learning paradigms including semi-supervised learning, active learning, unsupervised learning, reinforcement learning, multi-view learning and graphical models. When the number of tasks is large or the data dimensionality is high, we review online, parallel and distributed MTL models as well as dimensionality reduction and feature hashing to reveal their computational and storage advantages. Many real-world applications use MTL to boost their performance and we review representative works in this paper. Finally, we present theoretical analyses and discuss several future directions for MTL. [ABSTRACT FROM AUTHOR]

This paper addresses challenges with modeling of heat transfer phenomenon for cables in duct or pipes when applying a numerical solution. Heat transport mechanisms between the cable and pipe surfaces are conduction, convection and radiation. Numerical calculation of convection when applying a finite element analysis (FEA), or other numerical tools requires heavy computation power and great skills of the program operator. In general, this is the most difficult part when modeling the heat transfer between the cable and the pipe surfaces and practitioners are often forced to use simplifications or approximate models. This paper introduces a simplified model where the contribution from convection is replaced by a heat source at the pipe wall and a corresponding heat sink at the cable. The phenomenon of air rising vertically in the tube resulting in the upper half of the pipe being heated more by convection than the lower half is also modelled. The simplified model is compared to both known models from thermodynamics, FEA including convection and laboratory as well as the full-scale field measurements. The simplified model shows good correspondence to both simulations and measurements, with the temperatures deviating by less than 1 °C. [ABSTRACT FROM AUTHOR]

The problem under consideration in this paper is how to avoid deadlocks and livelocks in the paradigm of Petri nets (PNs). Although deadlock and livelock avoidance has been extensively studied in existing literature, fewer results can be applied to practical automated manufacturing systems (AMSs) due to expensive computations and reduced permissiveness. In this paper, we propose an efficient and maximally permissive control scheme to avoid deadlocks and livelocks by using critical distance. From the perspective of the reachability graph of a PN, critical distance is equal to the maximum number of transitions among all transition sequences from any critical state to its corresponding deadlock or livelock state. First, we show how to calculate the critical distance of a PN in an efficient way by using a portion of reachable states. Then, local reachability graphs are established based on critical distance to avoid deadlocks and livelocks. The provided policy is maximally permissive since only the necessary minimum number of illegal transitions are forbidden at each state. Several representative examples are presented to illustrate our approach. Note to Practitioners—Deadlock and livelock avoidance is a crucial problem in automated manufacturing systems (AMSs). Various methods have been proposed to deal with deadlocks and livelocks by researchers and practitioners. However, there exist fewer works that focus on deep exploration regarding how long a deadlock or livelock will occur from a safe state. As a consequence, the existing works suffer from the disadvantages of being too aggressive or conservative, i.e., checking the whole state space or forbidding many acceptable states when avoiding deadlocks and livelocks. Through the analysis of a partial of reachable states, this paper derives the critical distance of Petri nets modeling AMSs, which is equal to the maximum number of transitions among all transition sequences from any critical marking to its corresponding deadlock or livelock marking. All deadlocks and livelocks, if exist, can be detected at any given marking within the critical distance. Our approach not only is maximally permissive but also explores only a partial of states, thereby mitigating state explosion problem. [ABSTRACT FROM AUTHOR]

This paper considers distributed estimation methods to enable the formation of Unmanned-Aerial-Vehicles (UAVs) that track a moving target. The UAVs (or agents) are equipped with communication devices to receive a beacon signal from the target and share information with neighboring UAVs. The shared information includes the time-of-arrival (TOA) of the beacon signal from the target and estimates on the target’s location. Every UAV processes the received information from the neighbors using a single-time-scale distributed estimation protocol. This differs from multi-time-scale protocols that require (i) many consensus iterations on a-priori estimates, (ii) fast communication among agents (in general, much faster than the sampling rate of the target dynamics), and thus, more-costly communication equipment and processing units. Further, our approach outperforms most single-time-scale methods in terms of observability assumption as these methods assume that the target is observable via the measurement data received from neighboring UAVs (referred to as local-observability). This requires more communications among the sensors. In contrast, our approach is only based on global-observability assumption, and thus, requires less networking (only strong-connectivity) and communication traffic along with less computational load by data-processing once at the same time-scale of sampling target dynamics. We consider modified time-difference-of-arrival (TDOA) measurements with a constant output matrix for the linearized model. UAVs make a pre-specified formation, and by estimating the target’s location via these measurements, move along with the target. Note to Practitioners—Inspired by recent development in industrial UAVs along with emerging progress in low-cost processing units, fog computing systems, and wireless communications, this paper considers mobile tracking of a moving target via a group of wireless-connected autonomous drones. In the classical tracking methods, which are prone to single-point-of-failure, all the sensors need to send their information to a ground central station over a long-range and costly data-transmission channel. In contrast, by collaborative tracking the processing and decision-making are distributed among a swarm of drones equipped with onboard miniaturized electronic parts such as sensors, microcontrollers, microprocessors, and communication units. This article provides an efficient algorithm to enable such drones to autonomously track the moving target in real-time. Note that the cost and tracking ability of the UAV swarm are directly determined by the computational efficiency and communication burden of the estimation algorithm. In this regard, most available estimation algorithms are over budget and even infeasible due to the need for fast data-transmission channels, fast CPUs, and high network traffic. Our proposed estimation technique outperforms similar algorithms in terms of required communication bandwidth, data-transmission rate, and computational resources, which considerably reduces the hardware cost and improves tracking efficiency in real-time large-scale applications. We show the feasibility and efficiency of our distributed tracking method by simulation. [ABSTRACT FROM AUTHOR]

Objective: This paper presents preliminary methods of incorporating the pathological conditions of cardiac arrhythmias and valvular stenosis in hybrid mock circulation loop (hMCL) operation for the enhanced verification and validation of mechanical circulatory support devices such as VADs. Methods: The MGH/MF Waveform datasets from PhysioNet database (including both nominal and clinically diagnosed arrhythmic ECG measurements) as well as cardiovascular system model updates are used to recreate arrhythmic events and valvular stenosis in vitro. Results: Preliminary results show the hMCL can recreate each tested cardiac event within 2% and 4% mean error for reference pressure tracking in the aortic and left ventricular pressure chambers, respectively. Further, frequency spectrum analysis comparisons using the magnitude-squared coherence analysis shows close alignment between measured arrhythmic and hMCL realized pressure frequency content. Conclusion: The generation of cardiac arrhythmias and valvular stenosis around a VAD via both model and acute measurement based methods was achieved. Significance: Pathological conditions such as cardiac arrhythmias and valvular stenosis are limited in documentation despite the large percentage of patients who experience these events. This paper provides a means to begin incorporating these events into hardware-in-the-loop mock circulatory systems for next generation VAD validation and verification. [ABSTRACT FROM AUTHOR]

This paper attacks the challenging problem of video retrieval by text. In such a retrieval paradigm, an end user searches for unlabeled videos by ad-hoc queries described exclusively in the form of a natural-language sentence, with no visual example provided. Given videos as sequences of frames and queries as sequences of words, an effective sequence-to-sequence cross-modal matching is crucial. To that end, the two modalities need to be first encoded into real-valued vectors and then projected into a common space. In this paper we achieve this by proposing a dual deep encoding network that encodes videos and queries into powerful dense representations of their own. Our novelty is two-fold. First, different from prior art that resorts to a specific single-level encoder, the proposed network performs multi-level encoding that represents the rich content of both modalities in a coarse-to-fine fashion. Second, different from a conventional common space learning algorithm which is either concept based or latent space based, we introduce hybrid space learning which combines the high performance of the latent space and the good interpretability of the concept space. Dual encoding is conceptually simple, practically effective and end-to-end trained with hybrid space learning. Extensive experiments on four challenging video datasets show the viability of the new method. Code and data are available at https://github.com/danieljf24/hybrid_space. [ABSTRACT FROM AUTHOR]

It is known that there exist mathematical problems of practical relevance which cannot be computed on a Turing machine. An important example is the calculation of the first derivative of continuously differentiable functions. This paper precisely classifies the non-computability of the first derivative, and of the maximum-norm of the first derivative in the Zheng-Weihrauch hierarchy. Based on this classification, the paper investigates whether it is possible that a Turing machine detects this non-computability of the first derivative by observing the data of the problem, and whether it is possible to detect upper bounds for the peak value of the first derivative of continuously differentiable functions. So from a practical point of view, the question is whether it is possible to implement an exit-flag functionality for observing non-computability of the first derivative. This paper even studies two different types of exit-flag functionality. A strong one, where the Turing machine always has to stop, and a weak one, where the Turing machine stops if and only if the input lies within the corresponding set of interest. It will be shown that non-computability of the first derivative is not detectable by a Turing machine for two concrete examples, namely for the problem of computing the input–output behavior of simple analog circuits and for solutions of the three-dimensional wave equation. In addition, it is shown that it is even impossible to detect an upper bound for the maximum norm of the first derivative. In particular, it is shown that all three problems are not even semidecidable. Finally, we briefly discuss implications of these results for analog and quantum computing. [ABSTRACT FROM AUTHOR]

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

The wide deployment of advanced robots with industrial IoT (IIoT) technologies in smart factories generates a large volume of data during production and a wide variety of data processing workloads are launched to maintain productivity and safety of smart manufacture. The emerging fog computing paradigm offers a promising solution to enhancing data processing performance in a smart factory environment while on the other hand brings in new challenges to resource management, which call for a more effective approach for recommending resource configurations to heterogeneous workloads. In this paper, we propose an Optimized Recommendations of Heterogeneous Resource Configurations (ORHRC) model that employs machine learning techniques to provide resource configuration recommendations for the heterogeneous workloads in a fog computing-based smart factory environment. ORHRC learns a recommendation model by leveraging the operating characteristics and execution time of workloads on fog servers with different configurations. We also design a decision model in ORHRC to further improve prediction accuracy and reduce operational overheads. Experiment results show that ORHRC outperforms the state of art configuration recommendation methods in terms of average prediction accuracy. Note to Practitioners—The various data processing workloads in a smart factory environment need to be processed by the computational resources with optimal configurations for meeting their performance requirements. In this paper, we employ machine learning technologies for enabling automatic recommendation of resource configurations to heterogeneous workloads. Specifically, we develop an Optimized Recommendations of Heterogeneous Resource Configurations (ORHRC) model that can identify the optimal resource configurations for various workloads. We also conducted extensive experiments that verify the effectiveness of the proposed ORHRC model. [ABSTRACT FROM AUTHOR]

Surface defect is a serious problem in real-world manufacturing system and it is important to use vision-based recognition to ensure the surface quality of products. Currently, due to the ability of automatic feature extraction, deep learning models, such as convolutional neural network (CNN), have been widely used in this area. However, these CNN-based models may not solve a problem well - inter-class similarities and intra-class variations (ISIV), which affect their ability of feature extraction and thus influence their recognition performance. To address this problem, this paper introduces a graph guidance mechanism into CNN to improve the ability of feature extraction, called Graph guided Convolutional Neural Network (GCNN). Firstly, GCNN defines a graph by computing the similarities between training samples. Secondly, the graph is introduced into VGG11, a popular CNN structure, to increase the inter-class distances and decrease the intra-class distances between defect samples. Meanwhile, a learnable coefficient is introduced into the training process to balance the effect of graph guidance automatically. The experimental results on four famous surface defect datasets demonstrate that the graph guidance helps CNN models have better ability of feature extraction and thus achieve better performance. Compared with state-of-the-art models, the proposed method can achieve the best performance. Furthermore, the final discussion shows that the learnable coefficient can help the proposed model to gain better performance, and that the proposed model increases a little computation cost compared to its original CNN model. Note to Practitioners—This paper is motivated by the problem in real-world manufacturing process – inter-class similarities and intra-class variations. Most of current CNN-based models may not solve this problem well, which limits their applications in real-world system. This paper proposes a graph guidance mechanism and introduces it to the training of CNN. The proposal can improve the ability of feature extraction, and thus have better performance than those without the graph guidance. By applying the proposal to four examples, the results show that the proposal is more feasible and effective than the state-of-the-art models in surface defect recognition. Furthermore, the mechanism assists the training of CNN and is removed in the process of recognition, so it will not increase time and occupied memory in recognition, and meanwhile, only limited computation cost is increased in training process. [ABSTRACT FROM AUTHOR]

The dataflow concept has been successfully used for modeling and synthesizing signal processing applications since decades, and recently, dataflow has also been discovered to match the computation model of machine learning applications, leading to extremely successful dataflow based application design frameworks. One of the most attractive features of dataflow, especially for signal processing, is related to its formal nature: when properly defined, a dataflow-based application model can be analytically verified for correctness at the stage of application design. This paper proposes VR-PRUNE, a novel dataflow model of computation that is aimed for design of high-performance signal processing software, together with runtime support that allows efficient application deployment to heterogeneous GPU-equipped platforms. Compared to prior work, VR-PRUNE features variable token rate processing, which enables designing adaptive signal processing applications, and implementing solutions that, e.g., allow trading-off between power consumption and filtering bandwidth at runtime. The paper presents the formal concepts of VR-PRUNE, as well as four application examples from domains related to signal processing, accompanied with quantitative results, which show that using VR-PRUNE enables, for example, application power-performance scaling, and on the other hand describing adaptive application behavior with 59% fewer dataflow graph components compared to previous work. [ABSTRACT FROM AUTHOR]

In this paper, we study an automatic hypothesis generation (HG) problem, which refers to the discovery of meaningful implicit connections between scientific terms, including but not limited to diseases, chemicals, drugs, and genes extracted from databases of biomedical publications. Most prior studies of this problem focused on the use of static information of terms and largely ignored the temporal dynamics of scientific term relations. Even when the dynamics were considered in a few recent studies, they learned the representations for the scientific terms, rather than focusing on the term-pair relations. Since the HG problem is to predict term-pair connections, it is not enough to know with whom the terms are connected, it is more important to know how the connections have been formed (in a dynamic process). We formulate this HG problem as a future connectivity prediction in a dynamic attributed graph. The key is to capture the temporal evolution of node-pair (term-pair) relations. We propose an inductive edge (node-pair) embedding method named T-PAIR, utilizing both the graphical structure and node attribute to encode the temporal node-pair relationship. We demonstrate the efficiency of the proposed model on three real-world datasets, which are three graphs constructed from Pubmed papers published until 2019 in Neurology, Immunotherapy, and Virology, respectively. Evaluations were conducted on predicting future term-pair relations between millions of seen terms (in the transductive setting), as well as on the relations involving unseen terms (in the inductive setting). Experiment results and case study analyses show the effectiveness of the proposed model. [ABSTRACT FROM AUTHOR]

This paper proposes a dynamic valuation framework to determine the opportunity value of battery capacity degradation in grid applications based on the internal degradation mechanism and utilization scenarios. The proposed framework follows a dynamic programming approach and includes a piecewise linear value function approximation solution that solves the optimization problem over a long planning horizon. The paper provides two case studies on price arbitrage and frequency regulation using real market and system data to demonstrate the broad applicability of the proposed framework. Results show that the battery lifetime value is critically dependent on both the external market environment and its internal state of health. On the grid service side, results show that second-life batteries can provide more than 50% of the value compared to new batteries, and frequency regulation provides two times more revenue than price arbitrage throughout the battery lifetime. [ABSTRACT FROM AUTHOR]

In this paper, we propose a new mathematical model for power flow problem based on the linear and nonlinear matrix inequality theory. We start with rectangular model of power flow (PF) problem and then reformulate it as a Bilinear Matrix Inequality (BMI) model. A Theorem is proved which is able to convert this BMI model to a Linear Matrix Inequality (LMI) model along with One Nonconvex Quadratic Constraint (ONQC). Our proposed LMI-ONQC model for PF problem has only one single nonconvex quadratic constraint irrespective of the network size, while in the rectangular and BMI models the number of nonconvex constraints grows as the network size grows. This interesting property leads to reduced complexity level in our LMI-ONQC model which in turn makes it easier to solve for finding a PF solution. The non-conservativeness, iterative LMI solvability, well-defined and easy-to-understand geometry and pathwise connectivity of feasibility region are other important properties of proposed LMI-ONQC model which are discussed in this paper. An illustrative two-bus example is carefully studied to show different properties of our LMI-ONQC model. We have also tested our LMI-ONQC model on 30 different power-system cases including four ill-conditioned systems and compared it with a group of existing approaches. The numerical results show the promising performance of our LMI-ONQC model and its solution algorithm to find a PF solution. [ABSTRACT FROM AUTHOR]

Moving cast shadow identification and extraction are the commonly encountered problems in visual surveillance applications. In the video object detection problem, a shadow is a category of the dynamic entity which needs to be removed for accurate detection of moving objects. In this paper, we have proposed a new scheme to detect the moving object in video frames while removing the shadow. The proposed scheme is based on the notion of background modeling and model learning. The background is modeled by the proposed Spatio-Temporal Kernel Density Estimation (ST-KDE) based model, but the model learning takes place in online mode in the fused feature space. In the fusion process, the Local Binary Pattern (LBP) features of the ST-KDE model of a frame are determined and are fused probabilistically with the Gabor features of the corresponding original frame. To achieve accurate background modeling, weights in the probabilistic fusion are adaptively determined from the scene dynamics. Background model learning is pixel-based where model histograms learn the background with every temporal frame. Learning and classification of the fused feature frames happen simultaneously with frame by frame. The classified frame thus obtained contains the object with some residual shadow which is eliminated by entropy map and thresholding. The main novelties of our paper are: (i) ST-KDE based background modeling, (ii) Determination of the weights of the fusion process in an adaptive framework and, (iii) online background model learning in feature space. The proposed modeling approach has been tested successfully with different video sequences considered from CDnet, Lasiesta, ATON-CVRR, SRD, and ISTD databases. The performance metrics of the proposed scheme have been compared with many existing methods and it has been found that the proposed method exhibits improved performance. [ABSTRACT FROM AUTHOR]

The paper presents a numerical study on electrodynamic behavior of the inter-pancake twin-box joints of the Poloidal Field (PF) coils of the ITER Magnet System. This work was carried out with the THELMA code, developed at the University of Bologna. The THELMA model was adapted to describe both the superconducting wires and the resistive saddle of the joint in a set of reference configurations representative of a set of experimental tests performed on a joint sample at the SULTAN facility in Villigen, Switzerland. The model was applied to analyze both the DC joint resistance measurements and the AC loss vs frequency curve, in order to obtain a full representation of the joint electromagnetic behavior. The paper reports a comparison between the numerical and experimental results and parametric studies on the impact of the main model parameters on the loss vs frequency curve. [ABSTRACT FROM AUTHOR]

The goal of this paper is to investigate linear approximations of random functions and permutations. Our motivation is twofold. First, before the distinguishability of a practical cipher from an ideal one can be analysed, the cryptanalyst must have an accurate understanding of the statistical behaviour of the ideal cipher. Secondly, this issue has been neglected both in old and in more recent studies, particularly when multiple linear approximations are being used simultaneously. Traditional models have been based on the average behaviour and simplified using other assumptions such as independence of the linear approximations. Multidimensional cryptanalysis was introduced to avoid making artificial assumptions about statistical independence of linear approximations. On the other hand, it has the drawback of including many trivial approximations that do not contribute to the attack but just cause a waste of time and memory. We show for the first time in this paper that the trivial approximations reduce the degree of freedom of the related $\chi ^{2}$ distribution. Previously, the affine linear cryptanalysis was proposed to allow removing trivial approximations and, at the same time, admitting a solid statistical model. In this paper, we identify another type of multidimensional linear approximation, called Davies-Meyer approximation, which has similar advantages, and present full statistical models for both the affine and the Davies-Meyer type of multidimensional linear approximations. The new models given in this paper are realistic, accurate and easy to use. They are backed up by standard statistical tools such as Pearson’s $\chi ^{2}$ test and finite population correction and demonstrated to work accurately using practical examples. [ABSTRACT FROM AUTHOR]

Frequency Response Analysis (FRA) is a comparison based method and is useful to identify the mechanical fault in transformer winding only when the ‘healthy’ or ‘reference’ magnitude response is available. But, in practice, ‘healthy’ response may not be always available and the subsequent FRA measurement alone also cannot detect the fault. This is one serious limitation for conventional FRA method and the desired solution is still far away. To this effect, this paper presents an innovative way of measuring the frequency responses of transformer winding with two equal and opposite polarity sinusoidal excitations from two ends. For viability test, the present work is limited to fault-detection only in a single isolated uniformly-wound transformer winding followed by verification on an actual single-phase autotransformer. The two equal and opposite polarity excitations for such winding are likely to impose a virtual ground at the centre and hence the two admittances measured from the two source-ends are likely to be identical. Two admittances also get dissimilar for a fault in transformer winding and therefore the fault could be identified simply by measuring and comparing these two responses in absence of ‘healthy’ response. Pertinent simulation and experimental results are also included in the paper. [ABSTRACT FROM AUTHOR]

3D object recognition is a hot research topic. Particularly, view-based methods, which represent a 3D object with a collection of its rendered views on the 2D domain, play an important role in this field. Currently, view-based researches tend to aggregate information from multiple views via pooling based strategies to endow the models with the characteristic of view permutation invariance, at the cost of inevitable loss of useful features. In this paper, we introduce a new method that learns a more comprehensive descriptor for a 3D object from its views while successfully keeping its robustness to the variation of view permutation. Our method disentangles the information in the set of multi-view images into a global category-related feature and a set of view-permutation related features. To unbind these two parts, an encode-decoder based disentangling architecture is proposed, which barely bring extra computations compared to the baseline model. Systematic experiments are conducted for this new method to demonstrates the effectiveness and the competitive performance based on ModelNet40, ModelNet10, and ShapeNetCore55 datasets. Codes for our paper will be released soon on “ https://github.com/hjjpku/multi%5fview%5fsort ”. [ABSTRACT FROM AUTHOR]

Semiconductor manufacturing consists of multiple sequential processes. In addition, even in a single process, a wafer must pass several steps. Accordingly, a dataset generated in semiconductor manufacturing has sequential information. Thus, the sequential information between steps and processes must be considered when predicting a target variable such as a yield or defect status. This paper proposes a method that utilizes the concept of residual learning to capture sequential information. Specifically, we propose to learn several modules that use data gathered starting from different steps and obtain a final decision by combining all modules’ decisions. In each module including multiple models, the first model is trained to predict the target variable using the data from the earliest step, and the remaining models are trained to predict the residuals that cannot be explained by the models for the previous steps based on the concept of residual learning. We conducted extensive experiments using two real-world semiconductor manufacturing datasets and found that even though each module’s performance was not good, the final decision obtained by combining all the modules’ decisions achieved a significant performance improvement. As a result, the proposed method significantly outperformed the baseline models. [ABSTRACT FROM AUTHOR]

The critical nature of vehicular communications requires their extensive testing and evaluation. Analytical models can represent an attractive and cost-effective approach for such evaluation if they can adequately model all underlying effects that impact the performance of vehicular communications. Several analytical models have been proposed to date to model vehicular communications based on the IEEE 802.11p (or DSRC) standard. However, existing models normally model in detail the MAC (Medium Access Control), and generally simplify the propagation and interference effects. This reduces their value as an alternative to evaluate the performance of vehicular communications. This paper addresses this gap, and presents new analytical models that accurately model the performance of vehicle-to-vehicle communications based on the IEEE 802.11p standard. The models jointly account for a detailed modeling of the propagation and interference effects, as well as the impact of the hidden terminal problem. The model quantifies the PDR (Packet Delivery Ratio) as a function of the distance between transmitter and receiver. The paper also presents new analytical models to quantify the probability of the four different types of packet errors in IEEE 802.11p. In addition, the paper presents the first analytical model capable to accurately estimate the Channel Busy Ratio (CBR) metric even under high channel load levels. All the analytical models are validated by means of simulation for a wide range of parameters, including traffic densities, packet transmission frequencies, transmission power levels, data rates and packet sizes. An implementation of the models is provided openly to facilitate their use by the community. [ABSTRACT FROM AUTHOR]

The stochastic block model (SBM) is a random graph model in which the edges are generated according to the underlying cluster structure on the vertices. The (ferromagnetic) Ising model, on the other hand, assigns ±1 labels to vertices according to an underlying graph structure in a way that if two vertices are connected in the graph then they are more likely to be assigned the same label. In SBM, one aims to recover the underlying clusters from the graph structure while in Ising model, an extensively-studied problem is to recover the underlying graph structure based on i.i.d. samples (labelings of the vertices). In this paper, we propose a natural composition of SBM and the Ising model, which we call the Stochastic Ising Block Model (SIBM). In SIBM, we take SBM in its simplest form, where $n$ vertices are divided into two equal-sized clusters and the edges are connected independently with probability $p$ within clusters and $q$ across clusters. Then we use the graph $G$ generated by the SBM as the underlying graph of the Ising model and draw $m$ i.i.d. samples from it. The objective is to exactly recover the two clusters in SBM from the samples generated by the Ising model, without observing the graph $G$. As the main result of this paper, we establish a sharp threshold $m^\ast $ on the sample complexity of this exact recovery problem in a properly chosen regime, where $m^\ast $ can be calculated from the parameters of SIBM. We show that when $m\ge m^\ast $ , one can recover the clusters from $m$ samples in $O(n)$ time as the number of vertices $n$ goes to infinity. When $m < m^\ast $ , we further show that for almost all choices of parameters of SIBM, the success probability of any recovery algorithms approaches 0 as $n\to \infty $. [ABSTRACT FROM AUTHOR]

This paper discusses the back-flashover (BFO) phenomena in a high-voltage (HV) vertical double-circuit transmission line by means of numerical simulations. The single- and multiphase BFOs are analyzed considering 24 cases of AC-voltage angles and nonlinear characteristic of flashovers, taking advantage of the circuit analysis method in time domain. The models used in circuit analysis are the TEM-delay model, which can take into account the non-TEM characteristics of tower and line, and the conventional models. Prior to the BFO analysis, the characteristics of circuit models are compared and discussed with the numerical electromagnetic analysis results. In BFO analysis, it is clarified that the occurrence probability of the multiphase BFO is heavily depending on the bias AC-voltages. The relation of measured BFO phases and AC-voltages are well explained by the TEM-delay model with the valid lightning current magnitude. The conventional circuit models could have underestimated the occurrence of BFOs in HV transmission lines. The analysis and discussions shown in this paper can be utilized for advanced evaluation of lightning performance of transmission lines that considers the seriousness of lightning accidents. [ABSTRACT FROM AUTHOR]

Droop control is a viable method for the operation of island DC microgrids in a decentralized architecture. This paper presents a mixed-integer conic optimization formulation for the design of generator droop control, comprising the parameters of a piecewise linear droop curve. The mixed-integer formulation originates from a stochastic optimization framework that considers several operating scenarios for finding the optimal design. The convexity of the mixed-integer problem continuous relaxation gives global optimality guarantees for the design problem. The paper presents computational results using a tight polyhedral approximation of the conic program, leading to a mixed-integer linear programming (MILP) problem that is solved using a state-of-the-art commercial solver. The results from the proposed approach are contrasted with both a classic linear droop control design and a recent piecewise linear formulation. The Monte-Carlo simulation results quantify the extent to which the MILP solution is superior in reducing voltage violations and power loss, and the degree to which the loss is close to that from a conic optimal power flow solution. [ABSTRACT FROM AUTHOR]

The performance of a single neural network can vary unexpectedly corresponding to different classification tasks, and thus the network with fixed structure may lack flexibility and often lead to overfitting or underfitting. It is urgent, also the main objective of this paper, to deal with the limitation of the fixed neural network structure on classifying radar signals in different electromagnetic environments. We in this paper propose a variable network architecture search (NAS) mechanism, called balanced-NAS framework, and apply it in specific emitter identification (SEI) to greatly improve the flexibility of model searching. In the proposed balanced-NAS framework, a “block-cell” structure and a controller based recurrent neural network (RNN) are utilized to design models automatically according to external environment. In particular, a balance function is also proposed and utilized in the balanced-NAS framework, acting on the RNN controller to take both the validation accuracy and computational budget into consideration while searching for ideal models. The efficiency of the searching process is further enhanced by exploiting a progressive strategy to design simple and complicate child models where unpromising ones after each evaluation process are obsoleted to release searching space. Simulations and experiments indicate that the proposed balanced-NAS framework is extremely efficient and outperforms the conventional algorithms in classifying radar signals in different environments. [ABSTRACT FROM AUTHOR]

This paper studies the distributed linearly separable computation problem, which is a generalization of many existing distributed computing problems such as distributed gradient coding and distributed linear transform. A master asks ${\mathsf {N}}$ distributed workers to compute a linearly separable function of ${\mathsf {K}}$ datasets, which is a set of ${\mathsf {K}}_{\mathrm{ c}}$ linear combinations of ${\mathsf {K}}$ equal-length messages (each message is a function of one dataset). We assign some datasets to each worker in an uncoded manner, who then computes the corresponding messages and returns some function of these messages, such that from the answers of any ${\mathsf {N}}_{\mathrm{ r}}$ out of ${\mathsf {N}}$ workers the master can recover the task function with high probability. In the literature, the specific case where ${\mathsf {K}}_{\mathrm{ c}}=1$ or where the computation cost is minimum has been considered. In this paper, we focus on the general case (i.e., general ${\mathsf {K}}_{\mathrm{ c}} $ and general computation cost) and aim to find the minimum communication cost. We first propose a novel converse bound on the communication cost under the constraint of the popular cyclic assignment (widely considered in the literature), which assigns the datasets to the workers in a cyclic way. Motivated by the observation that existing strategies for distributed computing fall short of achieving the converse bound, we propose a novel distributed computing scheme for some system parameters. The proposed computing scheme is optimal for any assignment when ${\mathsf {K}}_{\mathrm{ c}}$ is large and is optimal under the cyclic assignment when the numbers of workers and datasets are equal or ${\mathsf {K}}_{\mathrm{ c}}$ is small. In addition, it is order optimal within a factor of 2 under the cyclic assignment for the remaining cases. [ABSTRACT FROM AUTHOR]

Low-rank tensor representation philosophy has enjoyed a reputation in many hyperspectral image (HSI) low-level vision applications, but previous studies often failed to comprehensively exploit the low-rank nature of HSI along different modes in low-dimensional subspace, and unsurprisingly handled only one specific task. To address these challenges, in this paper, we figured out that in addition to the spatial correlation, the spectral dependency of HSI also implicitly exists in the coefficient tensor of its subspace, this crucial dependency that was not fully utilized by previous studies yet can be effectively exploited in a cascaded manner. This led us to propose a unified subspace low-rank learning regime with a new tensor cascaded rank minimization, named STCR, to fully couple the low-rankness of HSI in different domains for various low-level vision tasks. Technically, the high-dimensional HSI was first projected into a low-dimensional tensor subspace, then a novel tensor low-cascaded-rank decomposition was designed to collapse the constructed tensor into three core tensors in succession to more thoroughly exploit the correlations in spatial, nonlocal, and spectral modes of the coefficient tensor. Next, difference continuity-regularization was introduced to learn a basis that more closely approximates the HSI’s endmembers. The proposed regime realizes a comprehensive delineation of the self-portrait of HSI tensor. Extensive evaluations conducted with dozens of state-of-the-art (SOTA) baselines on eight datasets verified that the proposed regime is highly effective and robust to typical HSI low-level vision tasks, including denoising, compressive sensing reconstruction, inpainting, and destriping. The source code of our method is released at https://github.com/CX-He/STCR.git. [ABSTRACT FROM AUTHOR]

Dependency-aware jobs, such as the big data analytic workflows, are commonly executed on the cloud. They are compiled to directed acyclic graphs, with tasks linked in regarding the dependency. The cloud scheduler, which maintains a large number of resources, is responsible to execute tasks in parallel. To resolve the complex dependencies, Deep Reinforcement Learning (DRL) based schedulers are widely applied. However, we find that the DRL-based schedulers are vulnerable to the perturbations in the input jobs and may generate falsified decisions to benefit a particular job while delaying the others. By perturbation, we mean a slight adjustment to the job's node features or dependencies, while not changing its functionality. In this paper, we first explore the vulnerability of DRL-based schedulers to job perturbations without accessing the information of the DRL models used in the scheduler. We devise the black-box perturbation system, in which, a proxy model is trained to mimic the DRL-based scheduling policy. We show that the high-faith proxy model can help to craft effective perturbations. The DRL-based schedulers can be as high as 60% likely to be badly affected by the perturbations. Then, we investigate the solution to improve the robustness of DRL-based schedulers to such perturbations. We propose an adversarial training framework to force the neural model to adapt to the perturbation patterns during training so as to eliminate the potential damage during applications. Experiments show that the adversarial-trained scheduler is more robust, reducing the chance of being affected to 3-fold less and the potential bad effects halved. [ABSTRACT FROM AUTHOR]

Recently, hyperbolic deep neural networks (HDNNs) have been gaining momentum as the deep representations in the hyperbolic space provide high fidelity embeddings with few dimensions, especially for data possessing hierarchical structure. Such a hyperbolic neural architecture is quickly extended to different scientific fields, including natural language processing, single-cell RNA-sequence analysis, graph embedding, financial analysis, and computer vision. The promising results demonstrate its superior capability, significant compactness of the model, and a substantially better physical interpretability than its counterpart in the euclidean space. To stimulate future research, this paper presents a comprehensive review of the literature around the neural components in the construction of HDNN, as well as the generalization of the leading deep approaches to the hyperbolic space. It also presents current applications of various tasks, together with insightful observations and identifying open questions and promising future directions. [ABSTRACT FROM AUTHOR]

A dynamically weighted directed network (DWDN) is frequently encountered in various big data-related applications like a terminal interaction pattern analysis system (TIPAS) concerned in this study. It consists of large-scale dynamic interactions among numerous nodes. As the involved nodes increase drastically, it becomes impossible to observe their full interactions at each time slot, making a resultant DWDN High Dimensional and Incomplete (HDI). An HDI DWDN, in spite of its incompleteness, contains rich knowledge regarding involved nodes’ various behavior patterns. To extract such knowledge from an HDI DWDN, this paper proposes a novel Alternating direction method of multipliers (ADMM)-based Nonnegative Latent-factorization of Tensors (ANLT) model. It adopts three-fold ideas: a) building a data density-oriented augmented Lagrangian function for efficiently handling an HDI tensor's incompleteness and nonnegativity; b) splitting the optimization task in each iteration into an elaborately designed subtask series where each one is solved based on the previously solved ones following the ADMM principle to achieve fast convergence; and c) theoretically proving that its convergence is guaranteed with its efficient learning scheme. Experimental results on six DWDNs from real applications demonstrate that the proposed ANLT outperforms state-of-the-art models significantly in both computational efficiency and prediction accuracy for missing links of an HDI DWDN. Hence, this study proposes a novel and efficient approach to large-scale DWDN representation. [ABSTRACT FROM AUTHOR]

Recently, hyperbolic deep neural networks (HDNNs) have been gaining momentum as the deep representations in the hyperbolic space provide high fidelity embeddings with few dimensions, especially for data possessing hierarchical structure. Such a hyperbolic neural architecture is quickly extended to different scientific fields, including natural language processing, single-cell RNA-sequence analysis, graph embedding, financial analysis, and computer vision. The promising results demonstrate its superior capability, significant compactness of the model, and a substantially better physical interpretability than its counterpart in the euclidean space. To stimulate future research, this paper presents a comprehensive review of the literature around the neural components in the construction of HDNN, as well as the generalization of the leading deep approaches to the hyperbolic space. It also presents current applications of various tasks, together with insightful observations and identifying open questions and promising future directions. [ABSTRACT FROM AUTHOR]

A dynamically weighted directed network (DWDN) is frequently encountered in various big data-related applications like a terminal interaction pattern analysis system (TIPAS) concerned in this study. It consists of large-scale dynamic interactions among numerous nodes. As the involved nodes increase drastically, it becomes impossible to observe their full interactions at each time slot, making a resultant DWDN High Dimensional and Incomplete (HDI). An HDI DWDN, in spite of its incompleteness, contains rich knowledge regarding involved nodes’ various behavior patterns. To extract such knowledge from an HDI DWDN, this paper proposes a novel Alternating direction method of multipliers (ADMM)-based Nonnegative Latent-factorization of Tensors (ANLT) model. It adopts three-fold ideas: a) building a data density-oriented augmented Lagrangian function for efficiently handling an HDI tensor's incompleteness and nonnegativity; b) splitting the optimization task in each iteration into an elaborately designed subtask series where each one is solved based on the previously solved ones following the ADMM principle to achieve fast convergence; and c) theoretically proving that its convergence is guaranteed with its efficient learning scheme. Experimental results on six DWDNs from real applications demonstrate that the proposed ANLT outperforms state-of-the-art models significantly in both computational efficiency and prediction accuracy for missing links of an HDI DWDN. Hence, this study proposes a novel and efficient approach to large-scale DWDN representation. [ABSTRACT FROM AUTHOR]

The heterogeneity in recently published knowledge graph embedding models’ implementations, training, and evaluation has made fair and thorough comparisons difficult. To assess the reproducibility of previously published results, we re-implemented and evaluated 21 models in the PyKEEN software package. In this paper, we outline which results could be reproduced with their reported hyper-parameters, which could only be reproduced with alternate hyper-parameters, and which could not be reproduced at all, as well as provide insight as to why this might be the case. We then performed a large-scale benchmarking on four datasets with several thousands of experiments and 24,804 GPU hours of computation time. We present insights gained as to best practices, best configurations for each model, and where improvements could be made over previously published best configurations. Our results highlight that the combination of model architecture, training approach, loss function, and the explicit modeling of inverse relations is crucial for a model’s performance and is not only determined by its architecture. We provide evidence that several architectures can obtain results competitive to the state of the art when configured carefully. We have made all code, experimental configurations, results, and analyses available at https://github.com/pykeen/pykeen and https://github.com/pykeen/benchmarking. [ABSTRACT FROM AUTHOR]

While recent developments of neural network (NN) models have led to a series of record-breaking achievements in many applications, the lack of sufficiently good datasets remains a problem for some applications. For such a problem, we can however exploit a large number of unstructured text corpora as an external knowledge to complement the training data, and most prevailing neural network solutions employ word embedding methods for such purposes. In this paper, we propose LDA-Reg, a novel knowledge driven regularization framework based on Latent Dirichlet Allocation (LDA) as an alternative to the word embedding methods to adaptively utilize abundant external knowledge and to interpret the NN model. For the joint learning of the parameters, we propose EM-SGD, an effective update method which incorporates Expectation Maximization (EM) and Stochastic Gradient Descent (SGD) to update parameters iteratively. Moreover, we also devise a lazy update and sparse update method for the high-dimensional inputs and sparse inputs respectively. We validate the effectiveness of our regularization framework through an extensive experimental study over real world and standard benchmark datasets. The results show that our proposed framework not only achieves significant improvement over state-of-the-art word embedding methods but also learns interpretable and significant topics for various tasks. [ABSTRACT FROM AUTHOR]

Graph learning has emerged as a promising technique for multi-view clustering due to its efficiency of learning a unified graph from multiple views. Previous multi-view graph learning methods mainly try to exploit the multi-view consistency to boost learning performance. However, these methods ignore the prevalent multi-view diversity which may be induced by noise, corruptions, or even view-specific attributes. In this paper, we propose to simultaneously and explicitly leverage the multi-view consistency and the multi-view diversity in a unified framework. The consistent parts are further fused to our target graph with a clear clustering structure, on which the cluster label to each instance can be directly allocated without any postprocessing such as $k$ k -means in classical spectral clustering. In addition, our model can automatically assign suitable weight for each view based on its clustering capacity. By leveraging the subtasks of measuring the diversity of graphs, integrating the consistent parts with automatically learned weights, and allocating cluster label to each instance in a joint framework, each subtask can be alternately boosted by utilizing the results of the others towards an overall optimal solution. Extensive experimental results on several benchmark multi-view datasets demonstrate the effectiveness of our model in comparison to several state-of-the-art algorithms. [ABSTRACT FROM AUTHOR]

Knowledge graph embedding is an effective way to represent knowledge graph, which greatly enhance the performances on knowledge graph completion tasks, e.g., entity or relation prediction. For knowledge graph embedding models, designing a powerful loss framework is crucial to the discrimination between correct and incorrect triplets. Margin-based ranking loss is a commonly used negative sampling framework to make a suitable margin between the scores of positive and negative triples. However, this loss can not ensure ideal low scores for the positive triplets and high scores for the negative triplets, which is not beneficial for knowledge completion tasks. In this paper, we present a double limit scoring loss to separately set upper bound for correct triplets and lower bound for incorrect triplets, which provides more effective and flexible optimization for knowledge graph embedding. Upon the presented loss framework, we present several knowledge graph embedding models including TransE-SS, TransH-SS, TransD-SS, ProjE-SS and ComplEx-SS. The experimental results on link prediction and triplet classification show that our proposed models have the significant improvement compared to state-of-the-art baselines. [ABSTRACT FROM AUTHOR]

It is widely acknowledged that the success of deep learning is built upon large-scale training data and tremendous computing power. However, the data and computing power are not always available for many real-world applications. In this paper, we address the machine learning problem where it lacks training data and limits computing power. Specifically, we investigate domain adaptation which is able to transfer knowledge from one labeled source domain to an unlabeled target domain, so that we do not need much training data from the target domain. At the same time, we consider the situation that the running environment is confined, e.g., in edge computing the end device has very limited running resources. Technically, we present the Faster Domain Adaptation (FDA) protocol and further report two paradigms of FDA: early stopping and amid skipping. The former accelerates domain adaptation by multiple early exit points. The latter speeds up the adaptation by wisely skip several amid neural network blocks. Extensive experiments on standard benchmarks verify that our method is able to achieve the comparable and even better accuracy but employ much less computing resources. To the best of our knowledge, there are very few works which investigated accelerating knowledge adaptation in the community. This work is expected to inspire the topic for more discussion. [ABSTRACT FROM AUTHOR]

The papers in this special section focus on military and government systems applications. Organizations in this sectors seek to stay on the leading edge of warfare, communications development, smart infrastructure configuration, and efficient and effective service delivery through the design of complex systems. These complex systems are referred to as System of Systems (SoS) and are defined by the internal and external integration of individual systems and subsystems working together to create newcapabilities that could not otherwise be achieved by individual systems. Due to advances in technology and engineering and the proliferation of available information, the complexity of systems continues to increase. Engineering managers and systems engineers are faced with having to integrate multiple complex systems, in which different constituents and configurations, both legacy and new, are integrated to accomplish emergent national security and humanitarian missions, as well as delivery of citizen-centered services. [ABSTRACT FROM AUTHOR]

This paper presents an injected current sensitivity (ICS) based multi-phase load flow (LF) methodology with minimal Jacobian computation for the three-phase unbalanced distribution system with multiple Distributed Energy Resources (DERs). In the proposed approach, first, a generalized bus admittance and Jacobian matrix have been formulated that include various distribution system components such as lines, shunt capacitors, voltage control devices such as regulators, different transformer connections, and load models. Second, DERs are modeled as a PV bus and incorporated into the proposed LF algorithm by formulating a reactive power injection-based sensitivity matrix that iteratively computes its net power injections. Unlike the traditional Jacobian matrix-based LF methods where an update of Jacobian (size and element) is required for each PV bus, this method does not require any update, hence, making it faster and more flexible to include a large number of DERs. From the various tests performed on the standard IEEE three-phase distribution network and their derivatives, it has been observed that the proposed approach is accurate, efficient, computationally less complex, and scalable. [ABSTRACT FROM AUTHOR]

This paper presents an accurate and efficient model to represent the corona effect and frequency dependence of line parameters in electromagnetic transient simulations. The new method, named the voltage and frequency dependent line model (VFDLM), can be seen as a more general case of the well-known frequency-dependent (FD) or wideband (WB) line models, wherein the characteristic admittance and propagation function are considered voltage- and frequency-dependent parameters. The time domain traveling wave equations are solved using recursive convolutions and rational approximation through vector fitting (VF). Since the model can be represented by Norton equivalents, it is totally compatible with EMT-type programs. The model is validated through comparisons with three field measurement data available in the literature, and good agreement could be observed between them, showing that the VFDLM is a stable, efficient, and accurate approach to represent the corona effect in EMT-type programs. [ABSTRACT FROM AUTHOR]

Recently, large offshore wind power plants have been installed far from the shore, using long HVAC three-core armored cables to export power. Its high capacitance may contribute to the appearance of unwanted phenomena, such as overvoltages or resonances at low frequencies. To adequately assess these problems, detailed and reliable cable models are required to develop time-domain/frequency-domain analyses on this type of cables. This paper presents, for the first time in the literature, an assessment on the performance of 3D finite element method-based (3D-FEM) models for developing frequency-domain analyses on three-core armored cables, confronting simulation results with experimental measurements found in the literature for three real cables. To this aim, a simplified ultra-shortened 3D-FEM model is proposed to reduce the simulation time during frequency sweeps, through which relevant aspects never analyzed before with frequency-domain 3D-FEM simulations are addressed, such as total losses, induced sheath current, magnetic field around the power cable, positive and zero sequence harmonic impedances, as well as resonant frequencies. Also, a time-domain example derived from the frequency-domain analysis is provided. Remarkable results are obtained when comparing computed values and measurements, presenting the simplified ultra-shortened 3D-FEM model as a valuable tool for the frequency-domain analysis of these cables. [ABSTRACT FROM AUTHOR]

Long short-term memory (LSTM) is a type of powerful deep neural network that has been widely used in many sequence analysis and modeling applications. However, the large model size problem of LSTM networks make their practical deployment still very challenging, especially for the video recognition tasks that require high-dimensional input data. Aiming to overcome this limitation and fully unlock the potentials of LSTM models, in this paper we propose to perform algorithm and hardware co-design towards high-performance energy-efficient LSTM networks. At algorithm level, we propose to develop fully decomposed hierarchical Tucker (FDHT) structure-based LSTM, namely FDHT-LSTM, which enjoys ultra-low model complexity while still achieving high accuracy. In order to fully reap such attractive algorithmic benefit, we further develop the corresponding customized hardware architecture to support the efficient execution of the proposed FDHT-LSTM model. With the delicate design of memory access scheme, the complicated matrix transformation can be efficiently supported by the underlying hardware without any access conflict in an on-the-fly way. Our evaluation results show that both the proposed ultra-compact FDHT-LSTM models and the corresponding hardware accelerator achieve very high performance. Compared with the state-of-the-art compressed LSTM models, FDHT-LSTM enjoys both order-of-magnitude reduction (more than $1000 \times$ 1000 × ) in model size and significant accuracy improvement (0.6% to 12.7%) across different video recognition datasets. Meanwhile, compared with the state-of-the-art tensor decomposed model-oriented hardware TIE, our proposed FDHT-LSTM architecture achieve $2.5\times$ 2. 5 × , $1.46\times$ 1. 46 × and $2.41\times$ 2. 41 × increase in throughput, area efficiency and energy efficiency, respectively on LSTM-Youtube workload. For LSTM-UCF workload, our proposed design also outperforms TIE with $1.9\times$ 1. 9 × higher throughput, $1.83\times$ 1. 83 × higher energy efficiency and comparable area efficiency. [ABSTRACT FROM AUTHOR]

Blockchain technologies can enable secure computing environments among mistrusting parties. Permissioned blockchains are particularly enlightened by companies, enterprises, and government agencies due to their efficiency, customizability, and governance-friendly features. Obviously, seamlessly fusing blockchain and cloud computing can significantly benefit permissioned blockchains; nevertheless, most blockchains implemented on clouds are originally designed for loosely-coupled networks where nodes communicate asynchronously, failing to take advantages of the closely-coupled nature of cloud servers. In this paper, we propose an innovative cloud-oriented blockchain – CloudChain, which is a modularized three-layer system composed of the network layer, consensus layer, and blockchain layer. CloudChain is based on a shared-memory model where nodes communicate synchronously by direct memory accesses. We realize the shared-memory model with the Remote Direct Memory Access technology, based on which we propose a shared-memory consensus algorithm to ensure presistence and liveness, the two crucial blockchain security properties countering Byzantine nodes. We also implement a CloudChain prototype based on a RoCEv2-based testbed to experimentally validate our design, and the results verify the feasibility and efficiency of CloudChain. [ABSTRACT FROM AUTHOR]