Search

Spatial structured models are predictive models that capture dependency structure between samples based on their locations in the space. Learning such models plays an important role in many geoscience applications such as water surface mapping, but it also poses significant challenges due to implicit dependency structure in continuous space and high computational costs. Existing models often assume that the dependency structure is based on either spatial proximity or network topology, and thus cannot incorporate complex dependency structure such as contour and flow direction on a 3D potential surface. To fill the gap, we recently proposed a novel spatial structured model called hidden Markov contour tree (HMCT), which generalizes the traditional hidden Markov model from a total order sequence to a partial order polytree. HMCT also advances existing work on hidden Markov trees through capturing complex contour structures on a 3D surface. We proposed efficient model construction and learning algorithms. This paper extends our initial HMCT model into a post-processor that can refine the classified results from other existing models. We analyzed the theoretical properties of the extended model. Evaluations on real-world flood mapping datasets show that HMCT outperforms multiple baseline methods in classification performance and the HMCT can also effectively enhance the results of other baseline methods. Computational experiments also show that HMCT is scalable to large data sizes (e.g., classifying millions of samples in seconds). [ABSTRACT FROM AUTHOR]

Accurate models of power plants play an important role in maintaining the reliable and secure grid operations. In this paper, we propose a synchrophasor measurement-based generator parameter calibration method by a novel deep learning method with high computational efficiency. An elementary effects-based approach is developed to identify the critical parameters from a nonlinear system with much better performance than the widely used trajectory sensitivity-based method. Then, synchrophasor measurement-based conditional variational autoencoder is developed to estimate the parameters’ posterior distributions even in the presence of a high-dimensional case with eighteen critical parameters to be calibrated. The effectiveness of the proposed method is validated for a hydro generator with a very detailed model. The results show that the proposed approach can accurately and efficiently estimate the generator parameters’ posterior distributions even when the parameters true values are not in support of the prior distribution. [ABSTRACT FROM AUTHOR]

Item concept modeling is commonly achieved by leveraging textual information. However, many existing models do not leverage the inferential property of concepts to capture word meanings, which therefore ignores the relatedness between correlated concepts, a phenomenon which we term conceptual “correlation sparsity.” In this paper, we distinguish between word modeling and concept modeling and propose an item concept modeling framework centering around the item concept network (ICN). ICN models and further enriches item concepts by leveraging the inferential property of concepts and thus addresses the correlation sparsity issue. Specifically, there are two stages in the proposed framework: ICN construction and embedding learning. In the first stage, we propose a generalized network construction method to build ICN, a structured network which infers expanded concepts for items via matrix operations. The second stage leverages neighborhood proximity to learn item and concept embeddings. With the proposed ICN, the resulting embedding facilitates both homogeneous and heterogeneous tasks, such as item-to-item and concept-to-item retrieval, and delivers related results which are more diverse than traditional keyword-matching-based approaches. As our experiments on two real-world datasets show, the framework encodes useful conceptual information and thus outperforms traditional methods in various item classification and retrieval tasks. [ABSTRACT FROM AUTHOR]

Although individual anxiety evaluation has been well studied, there is still not much work on evaluating public anxiety of groups, especially in the form of communities on social networks, which can be leveraged to detect mental healthness of a society. However, we cannot simply average individual anxiety scores to evaluate a community's public anxiety, because following factors should be considered: (1) impacts from interpersonal relations on each individual group member's anxiety levels (the ${\tt Structural}$ Structural component); (2) topic-based discussions which reflect a community's anxiety status (the ${\tt Topical}$ Topical component). In this paper, we initiate the study of evaluating public anxiety of Topic-based Social Network Communities ($\textsc {TSNC}$ T S N C ). We propose an evaluation framework to project the anxiety level of a $\textsc {TSNC}$ T S N C into a score in the [0,1] range. We devise a cascading model to dynamically compute the individual anxiety scores using the ${\tt Structural}$ Structural influence. We design a probabilistic model to measure anxiety score of social network messages using a generalized user, and compose a tree structure (${\tt MC}$ MC - ${\tt Tree}$ Tree ) to effectively compute the anxiety score of a $\textsc {TSNC}$ T S N C from the ${\tt Topical}$ Topical aspect. For large communities, to avoid expensive real-time computing, we use a small sample to compute the public anxiety within given confidence interval. The effectiveness of our model are verified by precision and recall in an empirical study on real-world Weibo and Twitter data sets. [ABSTRACT FROM AUTHOR]

To address the limited driving range of electric vehicles (EVs) and promote EVs’ penetration, vehicular energy networks (VENs) have emerged and opened possibility to charge EVs in motion via dynamic wireless power transfer (DWPT) technology. However, security and efficiency concerns arise due to the untrusted operating environment and EVs’ selfish charging/discharging behaviors. Existing trust models rely on the personal recommendations from neighboring EVs to identify malicious entities in VENs, which may cause potential privacy breaches and data misuse for recommenders. Besides, it is challenging to optimally schedule EVs’ energy behaviors by considering complex interactions among three energy entities (i.e., energy nodes, charging EVs, and discharging EVs). To this end, by leveraging blockchain technology and game theory, this paper proposes a secure and efficient wireless charging scheme to address these issues in VENs. Firstly, a blockchain-based fine-grained access control mechanism with traceability and auditability is presented to enable EV users to fully control and audit their personal rating data usage during trust management by logging data activities and issuing access tokens into decentralized ledgers. In this manner, the privacy of recommenders can be preserved by fully controlling the access and usage of personal rating data. Furthermore, by introducing cooperative wireless energy transfer mode, a hierarchical game-based energy scheduling algorithm is developed to optimize the strategies of three energy parties tier by tier, while considering their cooperation and competition. Finally, extensive simulations are conducted, which demonstrate that the proposed scheme can effectively improve users’ utility and security of energy transmission for EVs, compared with existing representative approaches. [ABSTRACT FROM AUTHOR]

Geographical topic models have been used to mine geo-tagged documents for topical region and geographical topics, and also have applications in recommendations, user mobility modeling, event detection, etc. Existing studies focus on learning effective geographical topic models while ignoring the efficiency issue. However, it is very expensive to train geographical topic models — it may take days to train a geographical topic model of a small scale on a collection of documents with millions of word tokens. In this paper, we propose the first distributed solution, called ${\sf PGeoTopic}$ PGeoTopic , for training geographical topic models. The proposed solution comprises several novel technical components to increase parallelism, reduce memory requirement, and reduce communication cost. Experiments show that our approach for mining geographical topic models is scalable with both model size and data size on distributed systems. [ABSTRACT FROM AUTHOR]

The Cox proportional hazards model is a popular semi-parametric model for survival analysis. In this paper, we aim at developing a federated algorithm for the Cox proportional hazards model over vertically partitioned data (i.e., data from the same patient are stored at different institutions). We propose a novel algorithm, namely VERTICOX, to obtain the global model parameters in a distributed fashion based on the Alternating Direction Method of Multipliers (ADMM) framework. The proposed model computes intermediary statistics and exchanges them to calculate the global model without collecting individual patient-level data. We demonstrate that our algorithm achieves equivalent accuracy for the estimation of model parameters and statistics to that of its centralized realization. The proposed algorithm converges linearly under the ADMM framework. Its computational complexity and communication costs are polynomially and linearly associated with the number of subjects, respectively. Experimental results show that VERTICOX can achieve accurate model parameter estimation to support federated survival analysis over vertically distributed data by saving bandwidth and avoiding exchange of information about individual patients. The source code for VERTICOX is available at: https://github.com/daiwenrui/VERTICOX. [ABSTRACT FROM AUTHOR]

Large-scale optimization has become an important application for data management systems, particularly in the context of statistical machine learning. In this paper, we consider how one might implement the join-and-co-group pattern in the context of a fully declarative data processing system. The join-and-co-group pattern is ubiquitous in iterative, large-scale optimization. In the join-and-co-group pattern, a user-defined function $g$g is parameterized with a data object $x$x as well as the subset of the statistical model $\Theta _x$Θx that applies to that object, so that $g(x | \Theta _x)$g(x|Θx) can be used to compute a partial update of the model. This is repeated for every $x$x in the full data set $X$X. All partial updates are then aggregated and used to perform a complete update of the model. The join-and-co-group pattern has several implementation challenges, including the potential for a massive blow-up in the size of a fully parameterized model. Thus, unless the correct physical execution plan be chosen for implementing the join-and-co-group pattern, it is easily possible to have an execution that takes a very long time or even fails to complete. In this paper, we carefully consider the alternatives for implementing the join-and-co-group pattern on top of a declarative system, as well as how the best alternative can be selected automatically. Our focus is on the SimSQL database system, which is an SQL-based system with special facilities for large-scale, iterative optimization. Since it is an SQL-based system with a query optimizer, those choices can be made automatically. [ABSTRACT FROM AUTHOR]

This paper introduces a fully automated greedy algorithm for the construction of parameterized behavioral models of electromagnetic structures, targeting at the same time uniform model stability and passivity. The proposed algorithm is able to determine a small set of parameter configurations for which an external solver provides on-the-fly the sampled scattering parameters of the structure over a predetermined frequency band. These samples are subjected to a multivariate rational/polynomial fitting process, which iteratively leads to a parameterized descriptor realization of the model. The main novel contribution in this paper is the adoption of a model-based approach for the adaptive augmentation of an initially small set of frequency responses, each corresponding to a randomly selected parameter configuration. In particular, the locations of the in-band passivity violations of intermediate macromodels constructed at each iteration are used as a proxy for the model-data error in those regions where input data are not available. This physics-based consistency check, which is enabled by recent developments in multivariate passivity characterization based on Skew-Hamiltonian–Hamiltonian (SHH) spectra, is combined with standard space exploration metrics to obtain a small-size and automatically determined distribution of points in the parameter space, leading to the construction of an accurate macromodel with a very limited number of external field solver runs. The embedded passivity check and enforcement process guarantees that either the final model is passive throughout the parameter space or the residual violations, if present, are negligible for practical purposes. Several examples validate the proposed approach for up to three concurrent parameters. [ABSTRACT FROM AUTHOR]

This paper presents a procedure for estimating the systems state when considerable Information and Communication Technology (ICT) component outages occur, leaving entire system areas unobservable. For this task, a novel method for analyzing system observability is proposed based on the Manifold Boundary Approximation Method (MBAM). By utilizing information geometry, MBAM analyzes boundaries of models in data space, thus detecting unidentifiable system parameters and states based on available data. This approach extends local, matrix-based methods to a global perspective, making it capable of detecting both structurally unidentifiable parameters as well as practically unidentifiable parameters (i.e., identifiable with low accuracy). Beyond partitioning identifiable/unidentifiable states, MBAM also reduces the model to remove reference to the unidentifiable state variables. To test this procedure, cyber-physical system (CPS) simulation environments are constructed by co-simulating the physical and cyber system layers. [ABSTRACT FROM AUTHOR]

Heterogeneous information network (HIN) embedding aims to learn the low-dimensional representations of nodes while preserving structures and semantics in HINs. Although most existing methods consider heterogeneous relations and achieve promising performance, they usually employ one single model for all relations without distinction, which inevitably restricts the capability of HIN embedding. In this paper, we argue that heterogeneous relations have different structural characteristics, and propose a novel Relation structure-aware HIN Embedding model, called RHINE. By exploring four real-world networks with thorough analysis, we present two structure-related measures which consistently distinguish heterogeneous relations into two categories: Affiliation Relations (ARs) and Interaction Relations (IRs). To respect the distinctive structural characteristics of relations, in RHINE, we propose different models specifically tailored to handle ARs and IRs, which can better capture the structures in HINs. Finally, we combine and optimize these models in a unified manner. Furthermore, considering that nodes connected via heterogeneous relations may have multi-aspect semantics and each relation focuses on one aspect, we introduce relation-specific projection matrices to learn node and relation embeddings in separate spaces rather than a common space, which can better preserve the semantics in HINs, referring to a new model RHINE-M. Experiments on four real-world datasets demonstrate that our models significantly outperform the state-of-the-art methods in four tasks. [ABSTRACT FROM AUTHOR]

Hierarchical Dirichlet Process (HDP) has attracted much attention in the research community of natural language processing. Given a corpus, HDP is able to determine the number of topics automatically, possessing an important feature dubbed nonparametric that overcomes the challenging issue of manually specifying a suitable topic number in parametric topic models, such as Latent Dirichlet Allocation (LDA). Nevertheless, HDP requires a much higher computational cost than LDA for parameter estimation. By taking the advantage of multi-threading, a parallel Gibbs sampling algorithm is proposed to estimate parameters for HDP based on the equivalence between HDP and Gamma-Gamma Poisson Process (G2PP) in terms of the generative process. Unfortunately, the above parallel Gibbs sampling algorithm requires to apply the finite approximation on the number of topics manually (i.e., predefine the topic number), thus can not retain the nonparametric feature of HDP. Another drawback of the above models is the lack of capturing the semantic dependencies between words, because the topic assignment of words is independent with each other. Although some works have been done in phrase-based topic modelling, these existing methods are still limited by either enforcing the entire phrase to share a common topic or requiring much complex and time-consuming phrase mining methods. In this paper, we aim to develop a copula guided parallel Gibbs sampling algorithm for HDP which can adjust the number of topics dynamically and capture the latent semantic dependencies between words that compose a coherent segment. Extensive experiments on real-world datasets indicate that our method achieves low perplexities and high topic coherence scores with a small time cost. In addition, we validate the effectiveness of our method on the modelling of word semantic dependencies by comparing the extracted topical phrases with those learned by state-of-the-art phrase-based baselines. [ABSTRACT FROM AUTHOR]

Decentralized sparsity learning has attracted a significant amount of attention recently due to its rapidly growing applications. To obtain the robust and sparse estimators, a natural idea is to adopt the non-smooth median loss combined with a $\ell _1$ sparsity regularizer. However, most of the existing methods suffer from slow convergence performance caused by the double non-smooth objective. To accelerate the computation, in this paper, we proposed a decentralized surrogate median regression (deSMR) method for efficiently solving the decentralized sparsity learning problem. We show that our proposed algorithm enjoys a linear convergence rate with a simple implementation. We also investigate the statistical guarantee, and it shows that our proposed estimator achieves a near-oracle convergence rate without any restriction on the number of network nodes. Moreover, we establish the theoretical results for sparse support recovery. Thorough numerical experiments and real data study are provided to demonstrate the effectiveness of our method. [ABSTRACT FROM AUTHOR]

Federated Learning (FL) as a promising technique is able to address the privacy issues in machine learning. However, due to the broadcast nature of wireless channel, one of the key challenges of FL is its vulnerability to wireless security threats. Thus, in this paper, we consider the model update security in FL. In particular, we propose to adopt a covert communication technique with which a friendly jammer transmits jamming signals to prevent a warden from detecting local model update transmissions of mobile devices in FL. The use of jamming signals reduces the transmission rate of the devices. Thus, we formulate an optimization problem that jointly determines the jamming power, local model transmission power, and local training accuracy to minimize the FL latency, given a security performance requirement. The problem is non-convex, and we propose an alternating descent algorithm to solve it. Extensive simulations are conducted and the results demonstrate the effectiveness and network performance improvement of the proposed algorithm. [ABSTRACT FROM AUTHOR]

Recent advances in objective-based uncertaintyquantification (objective-UQ) have shown that such a goal-driven approach for quantifying model uncertainty is extremely usefulin real-world problems that aim at achieving specific objectives based on complex uncertain systems. Central to this objective-UQ is the concept of mean objective cost of uncertainty (MOCU), which provides effective means of quantifying the impact of uncertainty on the operational goals at hand. MOCU is especially useful for optimal experimental design (OED) as the potential efficacy of an experimental (or data acquisition) campaign can be quantified by estimating the MOCU that is expected to remain after the campaign. However, MOCU-based OED tends to be computationally expensive, which limits its practical applicability. In this paper, we propose a novel machine learning (ML) scheme that can significantly accelerate MOCU computation and expedite MOCU-based experimental design. The main idea is to use an ML model to efficiently search for the optimal robust operator under model uncertainty, a necessary step for computing MOCU. We apply the proposed ML-based OED acceleration scheme to design experiments aimed at optimally enhancing the control performance of uncertain Kuramoto oscillator models. Our results show that the proposed scheme results in up to ${154}$ -fold speed improvement without any degradation of the OED performance. [ABSTRACT FROM AUTHOR]

Bulk integrated electricity and gas systems (IEGSs) introduce complex coupling relations and induce synergistic operation challenges. The growing uncertainty arising from the renewable power generation in the IEGS further aggravates the synergistic problems. Considering the availability of historical wind power generation data, this paper adopts a two-stage sample robust optimization (SRO) model, which is equivalent to the two-stage distributionally robust optimization (DRO) model with a ${\text{type}} - \infty $ Wasserstein ambiguity set, to address the wind power penetrated unit commitment optimal energy flow (UC-OEF) problem for the IEGS. Compared to the equivalent DRO model, the two-stage SRO model can be approximately transformed into a computationally efficient form. Specifically, we employ linear decision rules to simplify the proposed UC-OEF model. Moreover, we further enhance the tractability of the simplified model by exploring its structural features and, accordingly, develop a solution method. Simulation results on two IEGSs validate the effectiveness of the proposed model and solution method. [ABSTRACT FROM AUTHOR]

The approach of ambient signals-based load modeling (ASLM) was recently proposed to better track the time-varying changes of load models. To improve computation efficiency and model structure complexity, a hierarchical framework for ASLM is proposed in this paper. Through this framework, the hidden quasi-convexity of the load modeling problem is explored for the first time. This allows more complicated static load model structures and gradient or Hessian-based optimization algorithms to be used. In the upper level, the identification of dynamic load parameters is regarded as an optimization problem. In the lower level, the optimal static load parameters are obtained through linear regression for a given group of dynamic load parameters. Afterward, the regression residuals are regarded as the objective function (OF) of the upper level optimization problem. The proposed method is validated by the case study results on the Guangdong Power Grid. The results show that the OF is mostly quasi-convex after the transformation of the induction motor model, which provides the basis for the application of gradient or Hessian-based optimization algorithms. The case study results also validate that the proposed approach has better computation efficiency and model structure complexity compared with the previous ASLM approaches. [ABSTRACT FROM AUTHOR]

Radar radio source (RRS) recognition plays an important role in the fields of military electronic support systems (ESM) and civilian autonomous driving. The rapid development of machine learning technology, especially deep learning, has effectively and efficiently improved RRS intelligent recognition performances when operating in the increasingly complex electromagnetic environment. However, the data sampling limitation and computation cost are still severe challenges in real RRS recognition scenarios. In this paper, we propose a novel network based on meta-transfer learning, called RRSARNet, to achieve effective adaptive RRS recognition in the context of low signal-to-noise ratio (SNR). First, by using the short-time Fourier transform, a six-type small samples RRS simulation dataset with different SNR levels is constructed. Then, a novel RRSARNet, based on metric learning, is proposed, which consists of a four-layer embedding module and a four-layer relational module. Finally, the RRS dataset is divided into training, supporting and testing subsets, which are used to train and test the RRSARNet in a meta-transfer learning method. Experiments on the RRS dataset show that the proposed RRSARNet can achieve an overall accuracy (OA) above 96% and 99% when the SNR is above −15 dB and −10 dB, respectively. Even when the SNR is -30 dB, OA can reach more than 70%. For 5-way 1-shot and 5-way 5-shot experiments, the inference time of an image is about 0.043 and 0.140 milliseconds, respectively. Besides, experiments on the RRS simulation dataset and the two benchmark datasets, the RRSARNet performs better or more competitive than many existing state-of-the-art technologies in terms of recognition accuracy. [ABSTRACT FROM AUTHOR]

Recent workat the U.S. Army CCDC Ground Vehicle Systems Center has shown that machine learning classifiers can quickly construct high-fidelity mobility maps. Training these classifiers, on the other hand, is still a challenge, since each data instance is labeled by performing a computationally intensive, physics-based simulation. In this paper we introduce an active learning framework, based on the query-by-bagging algorithm, that substantially reduces the number of simulations needed to train a classifier. Experimental results suggest that our sampling algorithm can train a neural network, with higher accuracy, using less than half the number of simulations when compared to random sampling. [ABSTRACT FROM AUTHOR]

In this paper, a coupled interaction matrix is proposed to describe the interactions between line outages and the load shed at buses. The coupled interaction matrix is effectively estimated by the Expectation Maximization algorithm. A highly probabilistic coupled interaction model is further proposed to efficiently generate cascades with both line outages and the load shed based on the coupled interaction matrix and the distribution of initial outages. To mitigate cascading failures, critical links are identified based on the coupled interaction matrix by calculating a comprehensive severity index that considers the consequences of both line outages and the load shed. Simulation results on the IEEE 300-bus system verify the effectiveness of the proposed approach. The cascades generated from the coupled interaction model match the statistics of the original cascades very well. The identified critical links based on the comprehensive severity index enable a proper tradeoff between reducing line outages and reducing the load shed, leading to a better mitigation effect than only considering either line outages or the load shed. [ABSTRACT FROM AUTHOR]

Automated machine learning (AutoML) has achieved remarkable progress on various tasks, which is attributed to its minimal involvement of manual feature and model designs. However, most of existing AutoML pipelines only touch parts of the full machine learning pipeline, e.g., neural architecture search or optimizer selection. This leaves potentially important components such as data cleaning and model ensemble out of the optimization, and still results in considerable human involvement and suboptimal performance. The main challenges lie in the huge search space assembling all possibilities over all components, as well as the generalization ability over different tasks like image, text, and tabular etc. In this paper, we present a first-of-its-kind fully AutoML pipeline, to comprehensively automate data preprocessing, feature engineering, model generation/selection/training and ensemble for an arbitrary dataset and evaluation metric. Our innovation lies in the comprehensive scope of a learning pipeline, with a novel “life-long” knowledge anchor design to fundamentally accelerate the search over the full search space. Such knowledge anchors record detailed information of pipelines and integrates them with an evolutionary algorithm for joint optimization across components. Experiments demonstrate that the result pipeline achieves state-of-the-art performance on multiple datasets and modalities. Specifically, the proposed framework was extensively evaluated in the NeurIPS 2019 AutoDL challenge, and won the only champion with a significant gap against other approaches, on all the image, video, speech, text and tabular tracks. [ABSTRACT FROM AUTHOR]

When applying machine learning techniques to the Internet of things, aggregating massive amount of data seriously reduce the system efficiency. To tackle this challenge, a distributed learning framework called federated learning has been proposed. Due to the parallel training structure, the performance of federated learning suffers from the straggler effect. In this paper, to mitigate the straggler effect, we propose a novel learning scheme, edge-assisted federated learning (EAFL), which utilizes edge computing to reduce the computational burdens for stragglers in federated learning. It enables stragglers to offload partial computation to the edge server, and leverages the server's idle computing power to assist clients in model training. The offloading data size is optimized to minimize the learning delay of the system. Based on the optimized data size, a threshold-based offloading strategy for EAFL is proposed. Moreover, we extend EAFL to a dynamic scenario where clients may be offline after several update rounds. By grouping clients into different sets, we formulate the new EAFL delay optimization problem and derive the corresponding offloading strategy for the dynamic scenario. Simulation results are presented to show that EAFL has lower system delay than the original federated learning scheme. [ABSTRACT FROM AUTHOR]

In this paper, we study an energy-efficient computation offloading for vehicular edge computing systems, where multiple roadside units assist vehicular users to offload computation tasks to edge servers. Our goal is to minimize the users’ energy consumption by optimizing user association, data partition, transmit power, and computation resources, subject to the constraints of partial tasks offloading, user latency, maximum transmit power, outage performance, and computation capacity of edge servers. We utilize deep learning for user association to avoid combinatorial complexity, and develop an efficient optimization algorithm to optimize other variables. The resulting algorithm has scalable complexity with convergence guarantee, as confirmed by our theoretical analysis. Simulation results demonstrate that the introduced resource allocation algorithm can significantly reduce the total energy consumption of users. [ABSTRACT FROM AUTHOR]

Recently, with the explosive increase in Internet data, the traditional Graph-based Semi-Supervised Learning (GSSL) model is not suitable to deal with large scale data as the high computation complexity. Besides, GSSL models perform classification on a fixed input data graph. The quality of initialized graph has a great effect on the classification result. To solve this problem, in this paper, we propose a novel approach, named optimal bipartite graph-based SSL (OBGSSL). Instead of fixing the input data graph, we learn a new bipartite graph to make the result more robust. Based on the learned bipartite graph, the labels of the original data and anchors can be calculated simultaneously, which solves co-classification problem in SSL. Then, we use the label of anchor to handle out-of-sample problem, which preserves well classification performance and saves much time. The computational complexity of OBGSSL is O(ndmt + nm2), which is a significant improvement compared with traditional GSSL methods that need O(n2d + n3) , where n, d, m and t are the number of samples, features anchors and iterations, respectively. Experimental results demonstrate the effectiveness and efficiency of our OBGSSL model. [ABSTRACT FROM AUTHOR]

Due to the growing popularity of indoor location-based services, indoor data management has received significant research attention in the past few years. However, we observe that the existing indexing and query processing techniques for the indoor space do not fully exploit the properties of the indoor space. Consequently, they provide below par performance which makes them unsuitable for large indoor venues with high query workloads. In this paper, we first propose two novel indexes called Indoor Partitioning Tree (IP-Tree) and Vivid IP-Tree (VIP-Tree) that are carefully designed by utilizing the properties of indoor venues. The proposed indexes are lightweight, have small pre-processing cost and provide near-optimal performance for shortest distance and shortest path queries. We are also the first to study spatial keyword queries in indoor venues. We propose a novel data structure called Keyword Partitioning Tree (KP-Tree) that indexes objects in an indoor partition. We propose an efficient algorithm based on VIP-Tree and KP-Trees to efficiently answer spatial keyword queries. Our extensive experimental study on real and synthetic data sets demonstrates that our proposed indexes outperform the existing solutions by several orders of magnitude. [ABSTRACT FROM AUTHOR]

For timely maintenance and replacement in lithium-ion battery system, it is crucial to achieve fast and accurate State of Health (SOH) prediction. SOH is a dynamic status parameter of a battery indicated by its available capacity compared to the initial condition. SOH tends to decrease in the long-term because a battery is aged by its charging and discharging cycles due to the degradation of chemical composition. To ensure a battery has sufficiently good conditions, it is significant to predict the battery SOH precisely so that the depleted or weak battery can be replaced in time. However, the prediction of battery SOH is a difficult and complex task due to the following reasons (1) SOH degradation is a dynamic process because of the time-varying nature of both battery electrochemistry and working condition; (2) SOH prediction model usually involves numerous input attributes that lead to sheer complexity and computational cost for real-time battery management; (3) the balance of overhead-accuracy tradeoff is challenging to adapt to various application scenarios. In this paper, we propose a theoretical framework for fast and accurate SOH prediction based on the non-additive measure and overhead-accuracy balancing. Specifically, we characterize the interactions among battery attributes and their aggregated impacts on SOH prediction. By choosing the most significant subset of battery attributes, the computational complexity of SOH prediction can be substantially reduced while maintaining high accuracy. The tradeoff between accuracy and computational overhead can be balanced by adjusting the number of attributes and volume of training data. The experimental results validate the effectiveness and efficiency of the proposed framework. [ABSTRACT FROM AUTHOR]

With growth in the number of smart devices and advancements in their hardware, in recent years, data-driven machine learning techniques have drawn significant attention. However, due to privacy and communication issues, it is not possible to collect this data at a centralized location. Federated learning is a machine learning setting where the centralized location trains a learning model over remote devices. Federated learning algorithms cannot be employed in the real world scenarios unless they consider unreliable and resource-constrained nature of the wireless medium. In this paper, we propose a federated learning algorithm that is suitable for cellular wireless networks. We prove its convergence, and provide a sub-optimal scheduling policy that improves the convergence rate. We also study the effect of local computation steps and communication steps on the convergence of the proposed algorithm. We prove, in practice, federated learning algorithms may solve a different problem than the one that they have been employed for if the unreliability of wireless channels is neglected. Finally, through numerous experiments on real and synthetic datasets, we demonstrate the convergence of our proposed algorithm. [ABSTRACT FROM AUTHOR]

Edge Computing in 5G and Beyond is a promising solution for ultra-low latency applications (e.g., Autonomous Vehicle, Augmented Reality, and Remote Surgery), which have an extraordinarily low tolerance for delay and require fast data processing for a very high volume of data. The requirements of delay-sensitive applications (e.g., Low latency, proximity, and Location/Context-awareness) cannot be satisfied by Cloud Computing due to the high latency between User Equipment and Cloud. Nevertheless, Edge Computing in 5G and beyond can promise ultra-high-speed data processing thanks to the placement of computation capabilities closer to endpoint devices, where 5G encourages the speed rate that is 10 times faster than 4G LTE-Advanced. This paper deeply investigates Edge Computing in 5G and characterizes it based on the requirements of ultra-low latency applications. As a contribution, we propose a hybrid architecture that takes advantage of novel and sustainable technologies (e.g., D2D communication, Massive MIMO, SDN, and NFV) and has major features such as scalability, reliability, and ultra-low latency support. The proposed architecture is evaluated based on agent-based simulations demonstrating that our proposal can satisfy requirements and has the ability to respond to high volume demands with low latency. [ABSTRACT FROM AUTHOR]

In skeleton-based action recognition, graph convolutional networks (GCNs) have achieved remarkable success. However, there are two shortcomings of current GCN-based methods. Firstly, the computation cost is pretty heavy, typically over 15 GFLOPs for one action sample. Some recent works even reach ~100 GFLOPs. Secondly, the receptive fields of both spatial graph and temporal graph are inflexible. Although recent works introduce incremental adaptive modules to enhance the expressiveness of spatial graph, their efficiency is still limited by regular GCN structures. In this paper, we propose a shift graph convolutional network (ShiftGCN) to overcome both shortcomings. ShiftGCN is composed of novel shift graph operations and lightweight point-wise convolutions, where the shift graph operations provide flexible receptive fields for both spatial graph and temporal graph. To further boost the efficiency, we introduce four techniques and build a more lightweight skeleton-based action recognition model named ShiftGCN++. ShiftGCN++ is an extremely computation-efficient model, which is designed for low-power and low-cost devices with very limited computing power. On three datasets for skeleton-based action recognition, ShiftGCN notably exceeds the state-of-the-art methods with over $10\times $ less FLOPs and $4\times $ practical speedup. ShiftGCN++ further boosts the efficiency of ShiftGCN, which achieves comparable performance with $6\times $ less FLOPs and $2\times $ practical speedup. [ABSTRACT FROM AUTHOR]

CNNs, RNNs, GCNs, and CapsNets have shown significant insights in representation learning and are widely used in various text mining tasks such as large-scale multi-label text classification. Most existing deep models for multi-label text classification consider either the non-consecutive and long-distance semantics or the sequential semantics. However, how to coherently take them into account is still far from studied. In addition, most existing methods treat output labels as independent medoids, ignoring the hierarchical relationships among them, which leads to a substantial loss of useful semantic information. In this paper, we propose a novel hierarchical taxonomy-aware and attentional graph capsule recurrent CNNs framework for large-scale multi-label text classification. Specifically, we first propose to model each document as a word order preserved graph-of-words and normalize it as a corresponding word matrix representation preserving both the non-consecutive, long-distance and local sequential semantics. Then the word matrix is input to the proposed attentional graph capsule recurrent CNNs for effectively learning the semantic features. To leverage the hierarchical relations among the class labels, we propose a hierarchical taxonomy embedding method to learn their representations, and define a novel weighted margin loss by incorporating the label representation similarity. Extensive evaluations on three datasets show that our model significantly improves the performance of large-scale multi-label text classification by comparing with state-of-the-art approaches. [ABSTRACT FROM AUTHOR]

Topic models, such as LDA and its variants, are popular probabilistic models for discovering the abstract “topics” that occur in a collection of documents. However, the performance of topic models may vary a lot for different workloads, and it is not a trivial task to achieve a well-optimized implementation. In this paper, we systematically study all recently proposed samplers over LDA: AliasLDA, F+LDA, LightLDA, and WarpLDA, and discover a novel system tradeoff by considering the diversity and skewness of workloads. Then, we propose a hybrid sampler which can cleverly choose an efficient sampler with the tradeoff, and apply the hybrid sampler to LDA and its variants, including STM, TOT and CTM. Finally, we build a fast and general topic modeling system Sys-TM, which provides a unified topic modeling framework by integrating the hybrid sampler. Based on our empirical studies, the hybrid sampler outperforms the state-of-the-art samplers by up to 2 × over various topic models, and with carefully engineered implementation, Sys-TM is able to outperform the existing systems by up to 10 × . [ABSTRACT FROM AUTHOR]

In this paper, characteristic model-based modeling and control approaches for complex dynamical networks based on sampled data are studied. It shows that the characteristic model, in which underline network topological structures are simplified, can provide a straightforward and implicit description for network dynamics. The induced parameter estimation method can further make the model adaptive and purely data-driven. Moreover, a control law based on this model is also proposed to govern the network dynamics. Finally, the theoretical results are verified through numerical simulations of modeling and stabilizing a dynamical network. [ABSTRACT FROM AUTHOR]

High-dimensional and sparse (HiDS) data with non-negativity constraints are commonly seen in industrial applications, such as recommender systems. They can be modeled into an HiDS matrix, from which non-negative latent factor analysis (NLFA) is highly effective in extracting useful features. Preforming NLFA on an HiDS matrix is ill-posed, desiring an effective regularization scheme for avoiding overfitting. Current models mostly adopt a standard ${L} _{2}$ scheme, which does not consider the imbalanced distribution of known data in an HiDS matrix. From this point of view, this paper proposes an instance-frequency-weighted regularization (IR) scheme for NLFA on HiDS data. It specifies the regularization effects on each latent factors with its relevant instance count, i.e., instance-frequency, which clearly describes the known data distribution of an HiDS matrix. By doing so, it achieves finely grained modeling of regularization effects. The experimental results on HiDS matrices from industrial applications demonstrate that compared with an ${L} _{2}$ scheme, an IR scheme enables a resultant model to achieve higher accuracy in missing data estimation of an HiDS matrix. [ABSTRACT FROM AUTHOR]

Due to the visibility and controllability features of the latest distribution networks, there are potentials to model customer loads through a component-based approach more accurately. The electricity markets started in recent years enable trading and exchanges of electricity among traditional power stations and prosumers. It provides a possibility to improve the optimality of classical volt-var optimization (VVO) schemes. In this paper, a tri-level bottom-up load model and a market-based volt-var optimization (mVVO) model are proposed. The energy-to-voltage (ETV) parameter is proposed in our load model as a substitute for the widely used load-to-voltage (LTV) parameter to reflect long-term load characteristics. The mVVO model using ETV parameters aims to combine the optimal voltage regulation strategies and electricity purchase strategies from wholesale and retail markets for maximum cost saving. The case studies based on real load data of Hong Kong show that by coordinating the voltage regulation methods with market behaviors, utilities can reach a higher level of cost saving, in addition to energy saving. [ABSTRACT FROM AUTHOR]

This paper introduces a new approach to quantify the impact of forward propagated demand and weather uncertainty on power system planning and operation models. Recent studies indicate that such sampling uncertainty, originating from demand and weather time series inputs, should not be ignored. However, established uncertainty quantification approaches fail in this context due to the data and computing resources required for standard Monte Carlo analysis with disjoint samples. The method introduced here uses an m out of n bootstrap with shorter time series than the original, enhancing computational efficiency and avoiding the need for any additional data. It both quantifies output uncertainty and determines the sample length required for desired confidence levels. Simulations and validation exercises are performed on two capacity expansion planning models and one unit commitment and economic dispatch model. A diagnostic for the validity of estimated uncertainty bounds is discussed. The models, data and code are made available. [ABSTRACT FROM AUTHOR]

The join operations, including both equi and non-equi joins, are essential to the complex data analytics in the big data era. However, they are not inherently supported by existing DSPEs (Distributed Stream Processing Engines). The state-of-the-art join solutions on DSPEs rely on either complicated routing strategies or resource-inefficient processing structures, which are susceptible to dynamic workload, especially when the DSPEs face various join predicate operations and skewed data distribution. In this paper, we propose a new cost-effective stream join framework, named A-DSP (Adaptive Dimensional Space Processing), which enhances the adaptability of real-time join model and minimizes the resource used over the dynamic workloads. Our proposal includes: 1) a join model generation algorithm devised to adaptively switch between different join schemes so as to minimize the number of processing task required; 2) a load-balancing mechanism which maximizes the processing throughput; and 3) a lightweight algorithm designed for cutting down unnecessary migration cost. Extensive experiments are conducted to compare our proposal against state-of-the-art solutions on both benchmark and real-world workloads. The experimental results verify the effectiveness of our method, especially on reducing the operational cost under pay-as-you-go pricing scheme. [ABSTRACT FROM AUTHOR]

Quantization has been proven to be an effective method for reducing the computing and/or storage cost of DNNs. However, the trade-off between the quantization bitwidth and final accuracy is complex and non-convex, which makes it difficult to be optimized directly. Minimizing direct quantization loss (DQL) of the coefficient data is an effective local optimization method, but previous works often neglect the accurate control of the DQL, resulting in a higher loss of the final DNN model accuracy. In this paper, we propose a novel metric, called Vector Loss. Using this new metric, we decompose the minimization of the DQL to two independent optimization processes, which significantly outperform the traditional iterative L2 loss minimization process in terms of effectiveness, quantization loss as well as final DNN accuracy. We also develop a new DNN quantization solution called VecQ, which provides minimal direct quantization loss and achieve higher model accuracy. In order to speed up the proposed quantization process during model training, we accelerate the quantization process with a parameterized probability estimation method and template-based derivation calculation. We evaluate our proposed algorithm on MNIST, CIFAR, ImageNet, IMDB movie review and THUCNews text data sets with numerical DNN models. The results demonstrate that our proposed quantization solution is more accurate and effective than the state-of-the-art approaches yet with more flexible bitwidth support. Moreover, the evaluation of our quantized models on Salient Object Detection (SOD) tasks maintains comparable feature extraction quality with up to 16× weight size reduction. [ABSTRACT FROM AUTHOR]

NUMA platforms, emerging memory architectures with on-package high bandwidth memories bring new opportunities and challenges to bridge the gap between computing power and memory performance. Heterogeneous memory machines feature several performance trade-offs, depending on the kind of memory used, when writing or reading it. Finding memory performance upper-bounds subject to such trade-offs aligns with the numerous interests of measuring computing system performance. In particular, representing applications performance with respect to the platform performance bounds has been addressed in the state-of-the-art Cache-Aware Roofline Model (CARM) to troubleshoot performance issues. In this paper, we present a Locality-Aware extension (LARM) of the CARM to model NUMA platforms bottlenecks, such as contention and remote access. On top of this, the new contribution of this paper is the design and validation of a novel hybrid memory bandwidth model. This new hybrid model quantifies the achievable bandwidth upper-bound under above-described trade-offs with less than 3 percent error. Hence, when comparing applications performance with the maximum attainable performance, software designers can now rely on more accurate information. [ABSTRACT FROM AUTHOR]

This paper introduces recurrent neural networks (RNN), long short-term memory (LSTM), and gated recurrent unit (GRU) to detect and classify continuous sequences of volcano-seismic events at the Deception Island Volcano, Antarctica. A representative data set containing volcano-tectonic earthquakes, long-period events, volcanic tremors, and hybrid events was used to train these models. Experimental results show that RNN, LSTM, and GRU can exploit temporal and frequency information from continuous seismic data, attaining close to 90%, 94%, and 92% events correctly detected and classified. A second experiment is presented in this paper. The architectures described above, trained with data from campaigns of seismic records obtained in 1995–2002, have been tested with data from the recent seismic survey performed at the Deception Island Volcano in 2016–2017 by the Spanish Antarctic scientific campaign. Despite the variations in the geophysical properties of the seismic events within the volcano across eruptive periods, results provide good generalization accuracy. This result expands the possibilities of RNNs for real-time monitoring of volcanic activity, even if seismic sources change over time. [ABSTRACT FROM AUTHOR]

In crowdsourced preference aggregation, it is often assumed that all the annotators are subject to a common preference or social utility function which generates their comparison behaviors in experiments. However, in reality, annotators are subject to variations due to multi-criteria, abnormal, or a mixture of such behaviors. In this paper, we propose a parsimonious mixed-effects model, which takes into account both the fixed effect that the majority of annotators follows a common linear utility model, and the random effect that some annotators might deviate from the common significantly and exhibit strongly personalized preferences. The key algorithm in this paper establishes a dynamic path from the social utility to individual variations, with different levels of sparsity on personalization. The algorithm is based on the Linearized Bregman Iterations, which leads to easy parallel implementations to meet the need of large-scale data analysis. In this unified framework, three kinds of random utility models are presented, including the basic linear model with $L_2$ loss, Bradley-Terry model, and Thurstone-Mosteller model. The validity of these multi-level models are supported by experiments with both simulated and real-world datasets, which shows that the parsimonious multi-level models exhibit improvements in both interpretability and predictive precision compared with traditional HodgeRank. [ABSTRACT FROM AUTHOR]

Autonomous and connected cars (ACCs), together with edge computing (EC), have been recognized as a promising solution to achieve green intelligent transportation for smart cities. This paper aims to address short-term traffic prediction, a fundamental enabler for the success of ACC applications, under the European Telecommunications Standards Institute multi-access EC (MEC) architecture that exhibits constraints different from conventional cloud computing. First, a data-centric experiment platform is designed and implemented to facilitate traffic prediction algorithm development. This paper further proposes a novel short-term traffic prediction model that integrates a traffic light model and a vehicle velocity model, considering limited computing resources of MEC servers. We note that the effects of traffic lights are complicated and have not been rigorously examined in most, if not all, of the related work. This work models the queueing time when a driver arrives at a road intersection and faces a red light. Moreover, to forecast the vehicle velocity, we propose a novel low-complexity semiparametric prediction model considering periodic features and spatial/temporal correlations of dynamic road events. The experiment results demonstrate that our vehicle-velocity prediction model achieves almost equivalent accuracy to the well-known Long Short-Term Memory Neural Network model, requiring much lower computational complexity. Our experiment results also confirm that since our integrated model pays attention to the traffic-light effects and the individual driver behavior, it can more effectively capture the real-time changes of traffic conditions. [ABSTRACT FROM AUTHOR]

In this paper, a local area influence probabilistic (LAIP) detector for estimating magnetic grain interactions with coded data bits in two-dimensional magnetic recording is combined with a 2-D Bahl–Cocke–Jelinek–Raviv (BCJR)-based detector for joint removal of intertrack interference (ITI) and intersymbol interference (ISI). The LAIP detector sends log-likelihood ratio estimates of coded bits and an estimate of the local ISI/ITI convolution mask to a BCJR-based ISI/ITI detector followed by an irregular-repeat-accumulate decoder. Simulation results on a random Voronoi grain media model with ISI and ITI show that the concatenated LAIP/BCJR system, which detects three tracks simultaneously, achieves user information bit areal densities competitive or higher than results reported in a previous paper that employed the LAIP detector alone on a Voronoi grain channel without ISI/ITI. Simulation results on a grain-flipping probability media model based on micromagnetic simulations show that the proposed detector achieves an 11.3% bit error rate reduction compared to a recently proposed system with a 2-D linear equalizer followed by a two-track BCJR detector with 2-D pattern-dependent noise prediction. [ABSTRACT FROM AUTHOR]

Composition and parameterization of multicomponent predictive systems (MCPSs) consisting of chains of data transformation steps are a challenging task. Auto-WEKA is a tool to automate the combined algorithm selection and hyperparameter (CASH) optimization problem. In this paper, we extend the CASH problem and Auto-WEKA to support the MCPS, including preprocessing steps for both classification and regression tasks. We define the optimization problem in which the search space consists of suitably parameterized Petri nets forming the sought MCPS solutions. In the experimental analysis, we focus on examining the impact of considerably extending the search space (from approximately 22000 to 812 billion possible combinations of methods and categorical hyperparameters). In a range of extensive experiments, three different optimization strategies are used to automatically compose MCPSs for 21 publicly available data sets. The diversity of the composed MCPSs found is an indication that fully and automatically exploiting different combinations of data cleaning and preprocessing techniques is possible and highly beneficial for different predictive models. We also present the results on seven data sets from real chemical production processes. Our findings can have a major impact on the development of high-quality predictive models as well as their maintenance and scalability aspects needed in modern applications and deployment scenarios. Note to Practitioners—The extension of Auto-WEKA to compose and optimize multicomponent predictive systems (MCPSs) developed as part of this paper is freely available on GitHub under GPL license, and we encourage practitioners to use it on a broad variety of classification and regression problems. The software can either be used as a blackbox—where search space is made of all possible WEKA filters, predictors, and metapredictors (e.g., ensembles)—or as an optimization tool on a subset of preselected machine learning methods. The application has a graphical user interface, but it can also run from command line and can be embedded in any project as a Java library. There are three main outputs once an Auto-WEKA run has finished: 1) the trained MCPS ready to make predictions on unseen data; 2) the WEKA configuration (i.e., parameterized components); and 3) the Petri net in a Petri Net Markup Language format that can be analyzed using any tool supporting this standard language. There are, however, some practical considerations affecting the quality of the results that must be taken into consideration, such as the CPU time budget or the search starting point. These are extensively discussed in this paper. [ABSTRACT FROM AUTHOR]

A deep belief network (DBN) is effective to create a powerful generative model by using training data. However, it is difficult to fast determine its optimal structure given specific applications. In this paper, a growing DBN with transfer learning (TL-GDBN) is proposed to automatically decide its structure size, which can accelerate its learning process and improve model accuracy. First, a basic DBN structure with single hidden layer is initialized and then pretrained, and the learned weight parameters are frozen. Second, TL-GDBN uses TL to transfer the knowledge from the learned weight parameters to newly added neurons and hidden layers, which can achieve a growing structure until the stopping criterion for pretraining is satisfied. Third, the weight parameters derived from pretraining of TL-GDBN are further fine-tuned by using layer-by-layer partial least square regression from top to bottom, which can avoid many problems of traditional backpropagation algorithm-based fine-tuning. Moreover, the convergence analysis of the TL-GDBN is presented. Finally, TL-GDBN is tested on two benchmark data sets and a practical wastewater treatment system. The simulation results show that it has better modeling performance, faster learning speed, and more robust structure than existing models. Note to Practitioners—Transfer learning (TL) aims to improve training effectiveness by transferring knowledge from a source domain to target domain. This paper presents a growing deep belief network (DBN) with TL to improve the training effectiveness and determine the optimal model size. Facing a complex process and real-world workflow, DBN tends to require long time for its successful training. The proposed growing DBN with TL (TL-GDBN) accelerates the learning process by instantaneously transferring the knowledge from a source domain to each new deeper or wider substructure. The experimental results show that the proposed TL-GDBN model has a great potential to deal with complex system, especially the systems with high nonlinearity. As a result, it can be readily applicable to some industrial nonlinear systems. [ABSTRACT FROM AUTHOR]

Prognostics play an increasingly important role in modern engineering systems for smart maintenance decision-making. In parametric regression-based approaches, the parametric models are often too rigid to model degradation signals in many applications. In this paper, we propose a Bayesian multiple-change-point (CP) modeling framework to better capture the degradation path and improve the prognostics. At the offline modeling stage, a novel stochastic process is proposed to model the joint prior of CPs and positions. All hyperparameters are estimated through an empirical two-stage process. At the online monitoring and remaining useful life (RUL) prediction stage, a recursive updating algorithm is developed to exactly calculate the posterior distribution and RUL prediction sequentially. To control the computational cost, a fixed-support-size strategy in the online model updating and a partial Monte Carlo strategy in the RUL prediction are proposed. The effectiveness and advantages of the proposed method are demonstrated through thorough simulation and real case studies. Note to Practitioners—Degradation signals have been widely used in determining the current health condition and estimate the remaining useful life (RUL) of a component or a system. Most of the existing prognostics utilize a parametric regression model to describe the evolution path of degradation signals for RUL prediction. The common functional forms of these models include simple linear, quadratic, and exponential functions. However, in many applications, the degradation signals show multiple-segment characteristics and the existing parametric forms are inadequate to capture the degradation trend. Motivated by such issue, this paper presents a multiple-change-point (CP) modeling approach, where the degradation signal is divided into several consecutive segments by CPs, and each segment is modeled by a unique parametric model. To capture the heterogeneity across different units, all the parameters, including the number and locations of CPs and model parameters of each segment, are assumed to be random variables following certain distributions. Then, we develop a statistical method to estimate these distributions using historical data. At the online monitoring stage, we develop an innovative updating algorithm to exactly calculate the closed forms of the posterior distributions of the latest CP, the current segment, and model parameters of the current segment. We also derive a closed form for the RUL distribution estimation. Later, several efficient approximation strategies are proposed to reduce the computational burden. Simulation studies and real case studies have shown that the proposed methodology has much better performance than those of existing approaches in handling degradation signals of multiple-segment characteristics. [ABSTRACT FROM AUTHOR]

This paper presents a new method for modeling the nonideal conductance response (CR) of synaptic devices. Unlike previous studies, which utilize physical device properties for modeling, this paper only uses the measured CR data. This allows the proposed modeling method to be easily applied to various types of synaptic devices without considering the unique physical properties of each device. An efficient piecewise linear approximation method which offers a tradeoff between computational complexity and simulation accuracy of neural networks is also presented to generate a linear device model out of nonlinear CR data. In addition, model parameters, which reflect the nonideal characteristics of the CR such as abrupt and asymmetric conductance changes, conductance variation, and limited conductance dynamic range, are introduced to evaluate the network performances in the presence of the nonidealities. By adjusting the model parameters, the desired CR satisfying the network performance requirements can be derived for device development. A three-layer neural network employing the device model has been designed and trained for the MNIST data set in order to demonstrate the application of the model to system-level simulations and verify the effectiveness of the modeling method. [ABSTRACT FROM AUTHOR]

Identifying the underlying models in a set of data points that is contaminated by noise and outliers leads to a highly complex multi-model fitting problem. This problem can be posed as a clustering problem by the projection of higher-order affinities between data points into a graph, which can be clustered using spectral clustering. Calculating all possible higher-order affinities is computationally expensive. Hence, in most cases, only a subset is used. In this paper, we propose an effective sampling method for obtaining a highly accurate approximation of the full graph, which is required to solve multi-structural model fitting problems in computer vision. The proposed method is based on the observation that the usefulness of a graph for segmentation improves as the distribution of the hypotheses that are used to build the graph approaches the distribution of the actual parameters for the given data. In this paper, we approximate this actual parameter distribution by using a $k$ th-order statistics-based cost function, and the samples are generated using a greedy algorithm that is coupled with a data sub-sampling strategy. The experimental analysis shows that the proposed method is both accurate and computationally efficient compared with the state-of-the-art robust multi-model fitting techniques. The implementation of the method is publicly available from https://github.com/RuwanT/model-fitting-cbs. [ABSTRACT FROM AUTHOR]

It has been. As an automated validation method recommended by the IEEE Standard 1597.1/2, the FSV method has gained broad attention in the practice of computational electromagnetics modeling and simulations. This paper reviews the motivation, evolution, enhancements, and criticisms of the method over this time. The aims of this paper are to give a detailed contextualization of the development of the FSV method itself and to discuss the open questions and possible strategies of the next generation of automated validation methods. [ABSTRACT FROM PUBLISHER]