Search

Deadbeat predictive current control (DPCC) can predict motor behavior based on SPMSM model. However, during the operation of motor system, motor parameters (such as stator inductance and flux linkage) vary frequently according to different working conditions, which may lead to controller parameter mismatch, causing current harmonic content to increase and efficiency to decrease. In order to solve these problems caused by parameter variation, first, this paper proposes a current prediction error model by considering uncertainties of model parameters. Second, stator inductance and flux linkage are decoupled based on current prediction error model, which can reduce the interaction between parameters. Finally, the Kalman Filter (KF) algorithm is presented to filter the decoupled parameters. It is shown that the stator inductance and flux linkage can be identified accurately and the complexity of computation can be simplified. The traditional DPCC method, Extended Kalman Filter (EKF) based DPCC method and the proposed DPCC method are comparatively analyzed in this paper. Simulation and experiment indicate that the proposed parameter decoupling identification method can effectively reduce current harmonic content, current fluctuation and current tracking errors caused by parameter mismatch. [ABSTRACT FROM AUTHOR]

The Internet of vehicles (IoV) is a large information interaction network that collects information on vehicles, roads and pedestrians. One of the important uses of vehicle networks is to meet the entertainment needs of driving users through communication between vehicles and roadside units (RSUs). Due to the limited storage space of RSUs, determining the content cached in each RSU is a key challenge. With the development of 5G and video editing technology, short video systems have become increasingly popular. Current widely used cache update methods, such as partial file precaching and content popularity- and user interest-based determination, are inefficient for such systems. To solve this problem, this paper proposes a QoE-driven edge caching method for the IoV based on deep reinforcement learning. First, a class-based user interest model is established. Compared with the traditional file popularity- and user interest distribution-based cache update methods, the proposed method is more suitable for systems with a large number of small files. Second, a quality of experience (QoE)-driven RSU cache model is established based on the proposed class-based user interest model. Third, a deep reinforcement learning method is designed to address the QoE-driven RSU cache update issue effectively. The experimental results verify the effectiveness of the proposed algorithm. [ABSTRACT FROM AUTHOR]

Addressing non-convexity plays a fundamental role in solving the optimal electricity-gas flow models. In this paper, an improved spatial branch-and-bound algorithm is proposed to solve the non-convex problem, which is formulated as a mixed-integer bilinear programming, for its exact solution. The core of the algorithm is to divide the non-convex model into convex and small sub-models by branching on specific continuous variables, so that the non-convex problem can be equivalent to a rooted tree for exploration. The exactness of the algorithm is guaranteed by the same criterion as the classical branch-and-bound algorithm. To alleviate the computational burden, a novel two-stage spatial branching strategy is developed to improve the effectiveness and efficiency of the branching operations. The performance of the proposed algorithm is verified on two integrated electricity-gas systems with different sizes. Numerical results demonstrate that our method achieves a balance among feasibility, optimality, and efficiency. The comparison with another 6 convexification-based methods, 3 state-of-the-art non-convex optimization solvers, and 2 spatial branch-and-bound algorithms with classical branching rules further shows the superiority of our algorithm. [ABSTRACT FROM AUTHOR]

In this paper, we propose to extend the standard Convolutional Dictionary Learning problem to a tensor representation where the activations are constrained to be “low-rank” through a Canonical Polyadic decomposition. We show that this additional constraint increases the robustness of the CDL with respect to noise and improve the interpretability of the final results. In addition, we discuss in detail the advantages of this representation and introduce two algorithms, based on ADMM or FISTA, that efficiently solve this problem. We show that by exploiting the low rank property of activations, they achieve lower complexity than the main CDL algorithms. Finally, we evaluate our approach on a wide range of experiments, highlighting the modularity and the advantages of this tensorial low-rank formulation. [ABSTRACT FROM AUTHOR]

The integration of the variable renewable energies makes the operation conditions of the power system ever-changeable. Consequently, the power system operational reliability evaluation is increasingly important. This paper introduces the concept of decision-dependent uncertainty (DDU) in the operational reliability evaluation. Unlike the exogenous uncertainties, DDU reveals that the decisions of the system operation could significantly affect the resolution of the uncertainties which influence the reliability metrics. In this paper, the proposed DDU modeling method links the device reliability indices, i.e., the forced outage rate, and the operational-decision variables. The impacts of DDU on operational reliability are analyzed based on a reliability-constrained stochastic unit commitment (UC) model. An adaptive reliability improvement UC (ARIUC) algorithm is proposed to efficiently solve the problem. Case studies underline the necessity of considering DDU in power system operational reliability evaluations. [ABSTRACT FROM AUTHOR]

Stochastic unit commitment is an efficient method for grid operation in the presence of significant uncertainties. An example is an operation during a predicted hurricane with uncertain line out-ages. However, the solution quality comes at the cost of substantial computational burden, which makes its adoption challenging. This paper evaluates some possible ways that machine learning can be used to reduce this computational burden. First, a set of feasibility studies is conducted. Results suggest that using machine learning as an assistant to the stochastic unit commitment solver is more advantageous than using it as a standalone solver. In particular, the machine learning model is trained to facilitate solving the problem by determining the unnecessary constraints that can be removed from the original problem without affecting the final accuracy. The variables that can be used as input features/predictors or outputs for the machine learning model are determined through feasibility studies. Then, an algorithm to train and utilize a machine learning model is proposed. The method is tested on a 500-bus synthetic South Carolina system. Various test cases show an average reduction in solution time by more than 90% by using the trained machine learning model to assist the stochastic unit commitment solver. [ABSTRACT FROM AUTHOR]

With the proliferation of distributed generators and energy storage systems, traditional passive consumers in power systems have been gradually evolving into the so-called “prosumers,” i.e., proactive consumers, which can both produce and consume power. To encourage energy exchange among prosumers, energy sharing is increasingly adopted, which is usually formulated as a generalized Nash game (GNG). In this paper, a distributed approach is proposed to seek the Generalized Nash equilibrium (GNE) of the energy sharing game. To this end, we first prove the strong monotonicity of the game. Then, the GNG is converted into an equivalent optimization problem. An algorithm based on Nesterov's methods is thereby devised to solve the equivalent problem and consequently find the GNE in a distributed manner. The convergence of the proposed algorithm is proved rigorously based on the nonexpansive operator theory. The performance of the algorithm is validated by experiments with three prosumers, and the scalability is tested by simulations using 1888 prosumers. [ABSTRACT FROM AUTHOR]

To meet the execution requirements of delay-sensitive services in vehicular edge computing (VEC) networks, vehicular services need to be offloaded to edge computing nodes. For complex, large-scale services, the services need to be migrated if the services are not completed before the vehicles leave the coverage of edge computing nodes. Trust and resource matching between areas thus become major problems. This paper studies the decision model of vehicular service offloading and migration. First, software-defined network (SDN) technology is introduced into the traditional network architecture, and a two-layer distributed SDN-controlled VEC network architecture is designed, which is divided into a domain control layer and an area control layer. In this framework, we use the consortium blockchain as a carrier to share network topology information between SDN controllers to prevent information leakage. We then established a service offloading and migration optimization problem model to minimize service execution delay, reduce energy consumption and maximize the throughput of the blockchain system. We describe the problem model as a Markov Decision Process (MDP), introduce a deep reinforcement learning (DRL) algorithm named asynchronous advantage actor-critic (A3C) and design a dynamic service offloading and migration algorithm (DSOMA) based on A3C to solve the problem. Simulation results show that DSOMA can increase the throughput of the blockchain system, and DSOMA is superior to the deep Q-learning (DQN) algorithm and greedy offloading algorithm in reducing service execution delay and system energy consumption. [ABSTRACT FROM AUTHOR]

In many practical engineering applications, the number of actions that have been finished should be known, particularly for an untrimmed video sequence that includes an event with a series of actions, it is important to know the number of actions that have been finished. In this paper, we termed this process as visual event progress estimation (EPE). However, the research related to this problem is few in the research community. To solve this problem, a visual human action analysis-based framework, namely one-shot simultaneously action detection and identification (SADI)-EPE, is presented in this paper. The visual EPE is modeled as an online one-shot learning-based problem; sliding window and attention-based bag of key poses formulate our framework. Unlike most of the action analysis methods relying on a number of training data of some predefined classes, our method can realize SADI for any event if one sample of the event is given, which makes it feasible for practical applications. At the same time, not only SADI but also the progress estimation of the event can be realized by our algorithm. In terms of methodology, the key pose is defined by an invariant pose descriptor from skeletal data and silhouette data. Moreover, in order to extract representative and discriminative poses from one training sample, we present a new bidirectional $k$ NN-based attention weighted key pose selection method, which can filter the unrelated actions and model different importance of various key poses. In addition, an attention-based multi-modal fusion scheme, which addresses the difficulty of high-dimensional features and few training samples, is proposed to augment the performance of our algorithm. Finally, we propose an evaluation criterion for the estimation problem. Extensive results demonstrated the efficacy of our proposed framework. [ABSTRACT FROM AUTHOR]

As an emulous alternative to deep neural networks, Deep Forest emerges with features like low complexity, fewer hyper-parameters, and good robustness, which are predominantly desired in distributed computing applications and ecosystems. Recently, an efficient distributed Deep Forest system, named ForestLayer, was proposed, designing a fine-grained sub-Forest-based task-parallel algorithm to improve the parallel computing efficiency of Deep Forest. However, the sub-Forest splitting of ForestLayer is static and one-off without adaptability to the computing environment, nevertheless, the size of splitting granularity has a significant impact on the system performance. To further improve the computing efficiency and scalability of the distributed Deep Forest, in this paper, we propose a novel distributed Deep Forest algorithm, named BLB-gcForest (Bag of Little Bootstraps-gcForest), which augments the gcForest (multi-Grained Cascade Forest) approach for constructing Deep Forest. BLB-gcForest carries out parallel computation for each tree in sub-Forests at a finer parallel granularity and integrates with the Bag of Little Bootstraps (BLB) mechanism to reduce massive transmitted feature instances for Cascade Forest Layers, utterly improving both computation efficiency and communication efficiency. Moreover, to solve the problem of the forest splitting granularity, we further design an adaptive sub-Forest splitting algorithm to ensure the maximum resource utilization for parallel computation of each sub-Forest. Experimental results on four well-known large-scale datasets, namely YEAST, LETTER, MNIST, CIFAR10, show that the training efficiency of BLB-gcForest achieves up to 20.3x and 1.64x speedups compared with the state-of-the-art gcForest and ForestLayer, respectively while guaranteeing higher accuracy and better robustness [ABSTRACT FROM AUTHOR]

Nonlinear optimization problems with dynamical parameters are widely arising in many practical scientific and engineering applications, and various computational models are presented for solving them under the hypothesis of short-time invariance. To eliminate the large lagging error in the solution of the inherently dynamic nonlinear optimization problem, the only way is to estimate the future unknown information by using the present and previous data during the solving process, which is termed the future dynamic nonlinear optimization (FDNO) problem. In this paper, to suppress noises and improve the accuracy in solving FDNO problems, a novel noise-tolerant neural (NTN) algorithm based on zeroing neural dynamics is proposed and investigated. In addition, for reducing algorithm complexity, the quasi-Newton Broyden–Fletcher–Goldfarb–Shanno (BFGS) method is employed to eliminate the intensively computational burden for matrix inversion, termed NTN-BFGS algorithm. Moreover, theoretical analyses are conducted, which show that the proposed algorithms are able to globally converge to a tiny error bound with or without the pollution of noises. Finally, numerical experiments are conducted to validate the superiority of the proposed NTN and NTN-BFGS algorithms for the online solution of FDNO problems. [ABSTRACT FROM AUTHOR]

In this paper, we consider a computation offloading problem in a three-tier network consisting of multiple mobile users (MUs), multiple edge clouds, and a central cloud. On this basis, we formulate a system Energy Time Cost ($ETC$) minimization problem by jointly optimizing the resource allocation, mobile-edge matching decision, and offloading decision. Due to the difficulty of directly solving the formulated problem, we decompose it and propose two offloading algorithms, namely Gale-Shapley based Minimum/Sequential Offloading Algorithm (GS-MOA/GS-SOA), to optimize offloading decisions by minimizing the system $ETC$ , in which the mobile-edge matching strategies based on the proposed Gale-Shapley based Mobile-Edge mAtching aLgorithm (GS-MEAL) and resource allocations are optimized iteratively. The simulations show the effectiveness of our proposed algorithm. [ABSTRACT FROM AUTHOR]

This paper investigates a very practical and commonly encountered problem in state estimation. It is related to the placement of measurements in order to make an otherwise unobservable system observable. Typically, this is a situation that is frequently encountered during the daily operation as one or more of the measurements become unavailable due to various unexpected reasons. Under such circumstances, the state estimator resorts to the use of pseudo-measurements in order to recover observability and solve the state estimation problem. Pseudo-measurements that will make the system observable can be selected by applying one of the well-developed network observability analysis techniques in a repetitive fashion adding one candidate measurement at a time until the system is no longer unobservable. As the system size increases, this approach may prove computationally expensive. A nonrepetitive solution has also been proposed. However, its computational requirements grow rapidly with increasing number of observable islands that may exist in large scale systems. This paper presents an alternative approach which will be shown to be suitable for large scale power systems providing a compromise between the two existing techniques. Examples are given to highlight the main benefits of the proposed method. [ABSTRACT FROM PUBLISHER]

Weighted multi-view clustering (MVC) aims to combine the complementary information of multi-view data (such as image data with different types of features) in a weighted manner to obtain a consistent clustering result. However, when the cluster-wise weights across views are vastly different, most existing weighted MVC methods may fail to fully utilize the complementary information, because they are based on view-wise weight learning and can not learn the fine-grained cluster-wise weights. Additionally, extra parameters are needed for most of them to control the weight distribution sparsity or smoothness, which are hard to tune without prior knowledge. To address these issues, in this paper we propose a novel and effective Cluster-weighted mUlti-view infoRmation bottlEneck (CURE) clustering algorithm, which can automatically learn the cluster-wise weights to discover the discriminative clusters across multiple views and thus can enhance the clustering performance by properly exploiting the cluster-level complementary information. To learn the cluster-wise weights, we design a new weight learning scheme by exploring the relation between the mutual information of the joint distribution of a specific cluster (containing a group of data samples) and the weight of this cluster. Finally, a novel draw-and-merge method is presented to solve the optimization problem. Experimental results on various multi-view datasets show the superiority and effectiveness of our cluster-wise weighted CURE over several state-of-the-art methods. [ABSTRACT FROM AUTHOR]

In this paper, we consider the coordinated multipoint (CoMP) transmission design for the downlink cloud radio access network (Cloud-RAN). Our design aims to optimize the set of remote radio heads (RRHs) serving each user and the precoding and transmission power to minimize the total transmission power while maintaining the fronthaul capacity and users' quality-of-service (QoS) constraints. The fronthaul capacity constraint involves a nonconvex and discontinuous function that renders the optimal exhaustive search method unaffordable for large networks. To address this challenge, we propose two low-complexity algorithms. The first pricing-based algorithm solves the underlying problem through iteratively tackling a related pricing problem while appropriately updating the pricing parameter. In the second iterative linear-relaxed algorithm, we directly address the fronthaul constraint function by iteratively approximating it with a suitable linear form using a conjugate function and solving the corresponding convex problem. For performance evaluation, we also compare our proposed algorithms with two existing algorithms in the literature. Finally, extensive numerical results are presented, which illustrate the convergence of our proposed algorithms and confirm that our algorithms significantly outperform the state-of-the-art existing algorithms. [ABSTRACT FROM PUBLISHER]

Estimating set similarity and detecting highly similar sets are fundamental problems in areas such as databases and machine learning. MinHash is a well-known technique for approximating Jaccard similarity of sets and has been successfully used for many applications. Its two compressed versions, $b$ b -bit MinHash and Odd Sketch, can significantly reduce the memory usage of the MinHash, especially for estimating high similarities (i.e., similarities around 1). Although MinHash can be applied to static sets as well as streaming sets, of which elements are given in a streaming fashion, unfortunately, $b$ b -bit MinHash and Odd Sketch fail to deal with streaming data. To solve this problem, we previously designed a memory-efficient sketch method, MaxLogHash, to accurately estimate Jaccard similarities in streaming sets. Compared with MinHash, our method uses smaller sized registers (each register consists of less than 7 bits) to build a compact sketch for each set. In this paper, we further develop a faster method, MaxLogOPH++. Compared with MaxLogHash, MaxLogOPH++ reduces the time complexity for updating each coming element from $O(k)$ O (k) to $O(1)$ O (1) with a small additional memory. We conduct experiments on a variety of datasets, and experimental results demonstrate the efficiency and effectiveness of our methods. [ABSTRACT FROM AUTHOR]

The nonlinear programming (NLP) problem to solve distribution-level optimal power flow (D-OPF) poses convergence issues and does not scale well for unbalanced distribution systems. The existing scalable D-OPF algorithms either use approximations that are not valid for an unbalanced power distribution system, or apply relaxation techniques to the nonlinear power flow equations that do not guarantee a feasible power flow solution. In this paper, we propose scalable D-OPF algorithms that simultaneously achieve optimal and feasible solutions by solving multiple iterations of approximate, or relaxed, D-OPF subproblems of low complexity. The first algorithm is based on a successive linear approximation of the nonlinear power flow equations around the current operating point, where the D-OPF solution is obtained by solving multiple iterations of a linear programming (LP) problem. The second algorithm is based on the relaxation of the nonlinear power flow equations as conic constraints together with directional constraints, which achieves optimal and feasible solutions over multiple iterations of a second-order cone programming (SOCP) problem. It is demonstrated that the proposed algorithms are able to reach an optimal and feasible solution while significantly reducing the computation time as compared to an equivalent NLP D-OPF model for the same distribution system. [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]

Blind motion deblurring from a single image is a highly under-constrained problem with many degenerate solutions. A good approximation of the intrinsic image can, therefore, only be obtained with the help of prior information in the form of (often nonconvex) regularization terms for both the intrinsic image and the kernel. While the best choice of image priors is still a topic of ongoing investigation, this research is made more complicated by the fact that historically each new prior requires the development of a custom optimization method. In this paper, we develop a stochastic optimization method for blind deconvolution. Since this stochastic solver does not require the explicit computation of the gradient of the objective function and uses only efficient local evaluation of the objective, new priors can be implemented and tested very quickly. We demonstrate that this framework, in combination with different image priors produces results with Peak Signal-to-Noise Ratio (PSNR) values that match or exceed the results obtained by much more complex state-of-the-art blind motion deblurring algorithms. [ABSTRACT FROM PUBLISHER]

We consider a generalization of both the classic Steiner tree problem and the terminal Steiner tree problem. Given a complete graph G = (V,E) with a metric cost function c:E \rightarrow \BBQ_ \geq and two proper subsets R \subset V and R^\prime \subseteq R, a partial-terminal Steiner tree is a Steiner tree which contains all vertices in \it R such that all vertices in R^\prime must be leaves. The partial-terminal Steiner tree problem is to find a partial-terminal Steiner tree of the minimum cost in G. The previously best-known approximation ratio of the problem is 2\rho, where \bf \rho is the approximation ratio of the Steiner tree problem. In this paper, we improve the ratio from 2\rho to 2\rho - \rho \over 3\rho - 2 - f, where f is a non-negative function whose value is between 0 and \rho - \rho \over 3\rho - 2. [ABSTRACT FROM AUTHOR]

Source localization and spectral estimation are among the most fundamental problems in statistical and array signal processing. Methods that rely on the orthogonality of the signal and noise subspaces, such as Pisarenko's method, MUSIC, and root-MUSIC, are some of the most widely used algorithms to solve these problems. As a common feature, these methods require both a priori knowledge of the number of sources and an estimate of the noise subspace. Both requirements are complicating factors to the practical implementation of the algorithms and, when not satisfied exactly, can potentially lead to severe errors. In this paper, we propose a new localization criterion based on the algebraic structure of the noise subspace that is described for the first time to the best of our knowledge. Using this criterion and the relationship between the source localization problem and the problem of computing the greatest common divisor (GCD), or more practically approximate GCD, for polynomials, we propose two algorithms, which adaptively learn the number of sources and estimate their locations. Simulation results show a significant improvement over root-MUSIC in challenging scenarios such as closely located sources, both in terms of detection of the number of sources and their localization over a broad and practical range of signal-to-noise ratios. Furthermore, no performance sacrifice in simple scenarios is observed. [ABSTRACT FROM AUTHOR]

In recent years, unmanned aerial vehicles (UAVs) have unlocked numerous sensing applications, which are expected to add billions of dollars to the world economy in the next decade. To further improve the Quality-of-Service in these applications, the 3rd Generation Partnership Project has considered the use of terrestrial cellular networks to support UAV sensing services, also known as the cellular Internet of UAVs. In this paper, we consider a cellular Internet of UAVs, where the sensory data can be transmitted either to the base station via cellular links, or to the mobile devices by underlay UAV-to-Device (U2D) communications. To evaluate the freshness of the sensory data, the concept of age of information (AoI) is adopted, in which a lower AoI implies fresher data. Since UAVs’ AoIs are determined by their trajectories during sensing and transmission, we investigate the AoI minimization problem for UAVs by designing their trajectories. This problem is a Markov decision problem with an infinite state-action space, and thus we utilize multi-agent deep reinforcement learning to approximate the state-action space. Then, we propose a multi-UAV trajectory design algorithm to solve this problem. Simulation results show that our proposed algorithm can achieve a lower AoI than a greedy algorithm, policy gradient algorithm, and overlay U2D scheme. [ABSTRACT FROM AUTHOR]

Face Super-Resolution (FSR) aims to infer High-Resolution (HR) face images from the captured Low-Resolution (LR) face image with the assistance of external information. Existing FSR methods are less effective for the LR face images captured with serious low-quality since the huge imaging/degradation gap caused by the different imaging scenarios (i.e., the complex practical imaging scenario that generates test LR images, the simple manual imaging degradation that generates the training LR images) is not considered in these algorithms. In this paper, we propose an image homogenization strategy via re-expression to solve this problem. In contrast to existing methods, we propose a homogenization projection in LR space and HR space as compensation for the classical LR/HR projection to formulate the FSR in a multi-stage framework. We then develop a re-expression process to bridge the gap between the complex degradation and the simple degradation, which can remove the heterogeneous factors such as serious noise and blur. To further improve the accuracy of the homogenization, we extract the image patch set that is invariant to degradation changes as Robust Neighbor Resources (RNR), with which these two homogenization projections re-express the input LR images and the initial inferred HR images successively. Both quantitative and qualitative results on the public datasets demonstrate the effectiveness of the proposed algorithm against the state-of-the-art methods. [ABSTRACT FROM AUTHOR]

Cache optimization, i.e., determining the optimal content placement and routing paths, is essential for obtaining high performance of cache-enabled networks. This paper studies the problem of optimizing system throughput and content delivery cost over cache networks with lossy links (i.e., ICN-based wireless IoT systems), where content is divided into packet-level chunks, and packets may be lost in transmission. We first propose a new performance metric – the expected overall content routing cost for satisfied requests (RCS), for better characterizing content delivery cost under packet losses. RCS at the same time possesses the attractive mathematical property of super-modularity. We then formulate an optimization problem for the task through jointly optimizing content caching and request routing, and analyze it under fixed-routing scenario. The formulated problem is NP-hard and we prove it is reducible to the one of minimizing content routing cost without packet losses. We establish rules for the reduction, and leverage existing efficient algorithm to solve the problem. We also propose a potential-based online algorithm that is simple and adaptive to traffic changes and packet losses. The effectiveness of our mechanism is validated through extensive simulations over a wide array of network topologies. [ABSTRACT FROM AUTHOR]

It is of central interest in information theory to determine whether a given vector in the entropy space is an almost entropic vector. This problem can be answered if all the information inequalities are known, but this is an extremely challenging problem. On the other hand, we can establish that a given vector is an entropy vector if we can show the existence of distribution such that the corresponding entropy vector is the same as the given vector. However, there is no known algorithm to solve this problem. Only for the simplest case of binary entropy vectors, an algorithm is known to solve this problem. In this paper, we present a recursive algorithm to determine whether a given vector is a quasi-uniform entropy vector and, if it is, to return a consistent quasi-uniform distribution. We also present two applications of the recursive procedure: (i) to generate all quasi-uniform distributions motivated by the problem of finding the smallest quasi-uniform distribution such that its entropy vector violates the well known Ingleton inequality and (ii) to obtain an entropy vector (not necessarily quasi-uniform) near to a target vector in the entropy space for random variables with given alphabet size. [ABSTRACT FROM AUTHOR]

We consider the problem of gathering $(n)$ anonymous and oblivious mobile robots, which requires that all robots meet in finite time at a nonpredefined point. While the gathering problem cannot be solved deterministically without assuming any additional capabilities for the robots, randomized approaches easily allow it to be solvable. However, the randomized solutions currently known have a time complexity that is exponential in $(n)$ with no additional assumption. This fact yields the following two questions: Is it possible to construct a randomized gathering algorithm with polynomial expected time? If it is not possible, what is the minimal additional assumption necessary to obtain such an algorithm? In this paper, we address these questions from the aspect of multiplicity-detection capabilities. We newly introduce two weaker variants of multiplicity detection, called local-strong and local-weak multiplicity, and investigate whether those capabilities permit a gathering algorithm with polynomial expected time or not. The contribution of this paper is to show that any algorithm only assuming local-weak multiplicity detection takes exponential number of rounds in expectation. On the other hand, we can obtain a constant-round gathering algorithm using local-strong multiplicity detection. These results imply that the two models of multiplicity detection are significantly different in terms of their computational power. Interestingly, these differences disappear if we take one more assumption that all robots are scattered (i.e., no two robots stay at the same location) initially. We can obtain a gathering algorithm that takes a constant number of rounds in expectation, assuming local-weak multiplicity detection and scattered initial configurations. [ABSTRACT FROM PUBLISHER]

A novel and general method to quickly obtain frequency-domain solutions based on one or a few time-domain solutions is presented. The time-domain solution of electromagnetic field is found by using either two-dimensional (2-D) or three-dimensional (3-D) finite-element methods (FEM). The time-domain FEM is first used to obtain a solution for step function excitations by taking into account all the necessary initial conditions. Then, based on time-domain convolution theorem and the principle of integration by parts, a numerical algorithm to find the solutions of any excitations, without additional FEM computation, is deduced. A typical, interesting and meaningful application is to obtain the frequency-domain solutions when sweeping the operating frequency over a wide range. In this paper, a problem involving the finding of the resonant frequency of a copper loop connected with a pair of parallel plates using 3-D FEM is used as an illustrative example. The numerical experiment shows that the proposed method can reduce the computing time effectively and readily as it is easy to adjust the time step size in time-domain FEM. [ABSTRACT FROM AUTHOR]

In the present paper, we show that the pairing inversion problem of Atei pairing can be solved under the assumption that we have a generic algorithm for solving “exponentiation inversion” problem. With such an algorithm, the inversion problem of Atei pairing can be solved without solving the Miller inversion. Thus, the pairing inversion problem of Atei pairing is reduced to the exponentiation inversion problem. [ABSTRACT FROM AUTHOR]

The shooting and bouncing ray (SBR) method may give rise to a divergence problem when ray tubes intersect discontinuous parts of the target, such as the boundary, and this affects the accuracy to some extent. This paper proposes an adaptive aperture partition algorithm to solve this problem. The proposed algorithm adaptively splits the virtual aperture into continuous irregular beams instead of discrete uniform ray tubes according to the geometry of the target during the recursive beam tracing. These beams form a beam tree, the level of which represents the number of reflections. Geometric optics is applied to the representative propagation path of each leaf beam to obtain the exit field, and then physical optics is used to evaluate each leaf beam's scattered field. The proposed algorithm could generate the convergent solution of the SBR method when the ray-tube size tends toward infinitesimal. Additionally, this paper describes the beam-triangle intersection in detail and utilizes the kd-tree to accelerate the beam-target intersection. Numerical experiments demonstrate that adaptive aperture partition can greatly improve the accuracy of the SBR method, and the computational efficiency can be also significantly enhanced in several applications, such as the RCS prediction in the THz band. [ABSTRACT FROM AUTHOR]

In this paper, we consider a robust lattice alignment design for K-user quasi-static multiple-input multiple-output (MIMO) interference channels with imperfect channel knowledge. With random Gaussian inputs, the conventional interference alignment (IA) method has the feasibility problem when the channel is quasi-static. On the other hand, structured lattices can create structured interference as opposed to the random interference caused by random Gaussian symbols. The structured interference space can be exploited to transmit the desired signals over the gaps. However, the existing alignment methods on the lattice codes for quasi-static channels either require infinite signal-to-noise ratio (SNR) or symmetric interference channel coefficients. Furthermore, perfect channel state information (CSI) is required for these alignment methods, which is difficult to achieve in practice. In this paper, we propose a robust lattice alignment method for quasi-static MIMO interference channels with imperfect CSI at all SNR regimes, and a two-stage decoding algorithm to decode the desired signal from the structured interference space. We derive the achievable data rate based on the proposed robust lattice alignment method, where the design of the precoders, decorrelators, scaling coefficients and interference quantization coefficients is jointly formulated as a mixed integer and continuous optimization problem. The effect of imperfect CSI is also accommodated in the optimization formulation, and hence the derived solution is robust to imperfect CSI. We also design a low complex iterative optimization algorithm for our robust lattice alignment method by using the existing iterative IA algorithm that was designed for the conventional IA method. Numerical results verify the advantages of the proposed robust lattice alignment method compared with the time-division multiple-access (TDMA), two-stage maximum-likelihood (ML) decoding, generalized Han–Kobayashi (HK), distributive IA and conventional IA methods in the literature. [ABSTRACT FROM PUBLISHER]

Search-based optimization techniques have been applied to structural software test data generation since 1992, with a recent upsurge in interest and activity within this area. However, despite the large number of recent studies on the applicability of different search-based optimization approaches, there has been very little theoretical analysis of the types of testing problem for which these techniques are well suited. There are also few empirical studies that present results for larger programs. This paper presents a theoretical exploration of the most widely studied approach, the global search technique embodied by Genetic Algorithms. It also presents results from a large empirical study that compares the behavior of both global and local search-based optimization on realworld programs. The results of this study reveal that cases exist of test data generation problem that suit each algorithm, thereby suggesting that a hybrid global-local search (a Memetic Algorithm) may be appropriate. The paper presents a Memetic Algorithm along with further empirical results studying its performance. [ABSTRACT FROM AUTHOR]

In this paper, we aim to design an adaptive power allocation scheme to minimize the average transmit power of a hybrid automatic repeat request with chase combining (HARQ-CC) enabled non-orthogonal multiple access (NOMA) system under strict outage constraints of users. Specifically, we assume that the base station only knows the statistical channel state information of the users. To achieve power efficient design and cope with the reliable transmissions of users, a partial HARQ-CC scheme is proposed. We first focus on the two-user case. To evaluate the performance of the two-user partial HARQ-CC enabled NOMA system, we first analyze the outage probability of each user. Then, an average power minimization problem is formulated. However, the attained expressions of the outage probabilities are nonconvex, and thus make the problem challenging to solve. Hence, we propose to use a successive convex approximation (SCA) based algorithm to solve the problem iteratively. Meanwhile, we prove that the proposed algorithm can converge to a Karush–Kuhn–Tucker point of the original problem. For more practical applications, we also investigate the partial HARQ-CC enabled transmissions in the multi-user scenario. The user pairing and power allocation problem is considered. With the aid of matching theory, a low complexity algorithm is presented to first handle the user pairing problem. Then the power allocation problem for each user pair is solved by the proposed SCA-based algorithm. Simulation results show the efficiency of the proposed transmission strategy and the near-optimality of the proposed algorithms. [ABSTRACT FROM AUTHOR]

Power loss and voltage regulation are two fundamental and challenging issues in DC distributed generation system. In this paper, a multi-objective optimization problem is established to achieve trade-offs between reducing power loss and decreasing voltage deterioration by adjusting the weighting coefficients. This problem is proven to be a convex optimization under constant impedance load and constant current load. A distributed algorithm based on random coordinate descent method is developed to solve this problem without acquiring the information of line impedance. Thus, the optimal operating point of the system can be found automatically in real-time, and the deviation of optimal solution caused by the fluctuation of network parameters is avoided. In addition, the complexity of this algorithm is low and its computational requirement is reduced in practice. Finally, case studies are implemented to verify the effectiveness of the proposed algorithm under the scenarios of line parameter fluctuation, load variation, communication line failure, and plug-play capabilities. [ABSTRACT FROM AUTHOR]

Breakthroughs in unsupervised domain adaptation (uDA) can help in adapting models from a label-rich source domain to unlabeled target domains. Despite these advancements, there is a lack of research on how uDA algorithms, particularly those based on adversarial learning, can work in distributed settings. In real-world applications, target domains are often distributed across thousands of devices, and existing adversarial uDA algorithms – which are centralized in nature – cannot be applied in these settings. To solve this important problem, we introduce FRuDA: an end-to-end framework for distributed adversarial uDA. Through a careful analysis of the uDA literature, we identify the design goals for a distributed uDA system and propose two novel algorithms to increase adaptation accuracy and training efficiency of adversarial uDA in distributed settings. Our evaluation of FRuDA with five image and speech datasets show that it can boost target domain accuracy by up to 50% and improve the training efficiency of adversarial uDA by at least $11\times$ 11 × . [ABSTRACT FROM AUTHOR]

In this paper we study the problem of characterizing and exploiting the complete flexibility of a special logic architecture, called P-circuits, which realize a Boolean function by projecting it onto overlapping subsets given by a generalized Shannon decomposition. P-circuits are used to restructure logic by pushing some signals towards the outputs. The algorithms proposed so far for exploiting the structural flexibility of P-circuits do not guarantee to find the best implementation, because they cast the problem as the minimization of an incompletely specified function. Instead, here we show that to explore all solutions we must set up the problem as the minimization of a Boolean relation, because there are don’t care conditions that cannot be expressed by single cubes. Finally we report the results obtained using a minimizer of Boolean relations, which improve in a major way with respect to the previous literature. [ABSTRACT FROM PUBLISHER]

The ever-growing cellular traffic demand has laid a heavy burden on cellular networks. The recent rapid development in vehicle-to-vehicle communication techniques makes vehicular delay-tolerant network (VDTN) an attractive candidate for traffic offloading from cellular networks. In this paper, we study a bulk traffic offloading problem with the goal of minimizing the cellular communication cost under the constraint that all the subscribers receive their desired whole content before it expires. It needs to determine the initial offloading points and the dissemination scheme for offloaded traffic in a VDTN. By novelly describing the content delivery process via a contact-based flow model, we formulate the problem in a linear programming (LP) form, based on which an online offloading scheme is proposed to deal with the network dynamics (e.g., vehicle arrival/departure). Furthermore, an offline LP-based analysis is derived to obtain the optimal solution. The high efficiency of our online algorithm is extensively validated by simulation results. [ABSTRACT FROM PUBLISHER]

The problem of random number generation dates back to Von Neumann’s work in 1951. Since then, many algorithms have been developed for generating unbiased bits from complex correlated sources as well as for generating arbitrary distributions from unbiased bits. An equally interesting, but less studied aspect is the structural component of random number generation. That is, given a set of primitive sources of randomness, and given composition rules induced by a device or nature, how can we build networks that generate arbitrary probability distributions? In this paper, we study the generation of arbitrary probability distributions in multivalued relay circuits, a generalization in which relays can take on any of $N$ states and the logical ‘and’ and ‘or’ are replaced with ‘min’ and ‘max’ respectively. These circuits can be thought of as modeling the timing of events which depend on other event occurences. We describe a duality property and give algorithms that synthesize arbitrary rational probability distributions. We prove that these networks are robust to errors and design a universal probability generator which takes input bits and outputs any desired binary probability distribution. [ABSTRACT FROM PUBLISHER]

There has been a recent rise in research on real-time problem solving algorithms in artificial intelligence (AI). A real-time AI problem solver performs a task or a set of tasks in two phases. During the first phase, the problem solver searches for a solution that, once executed, will satisfy the requirements of the task. We refer to this phase as the planning phase or the search phase. During the next phase, the problem solver executes the planned solution to achieve the desired results of the task. This phase is referred to as the execution phase. Under time constraints, a real-time AI problem solver must balance planning and execution to minimize total response times and to comply with deadlines. This paper provides a methodology for the specification of real-time AI problem solvers. Using this methodology, we provide a formal specification of a real-time problem. In addition, the paper presents a methodology for analyzing real-time AI problem solvers. This methodology is demonstrated via a case study of two real-time problem solvers, namely DYNORAII and RTA* [1], for the real-time path planning problem. We provide new results on worst-case and avenge-case complexity of the problem, and of the algorithms that solve it. We also provide experimental evaluation of DYNORAII and RTA* for deadline compliance and response-time minimization. [ABSTRACT FROM AUTHOR]

The \(k\) -core decomposition in a graph is a fundamental problem for social network analysis. The problem of \(k\) -core decomposition is to calculate the core number for every node in a graph. Previous studies mainly focus on \(k\) -core decomposition in a static graph. There exists a linear time algorithm for \(k\) -core decomposition in a static graph. However, in many real-world applications such as online social networks and the Internet, the graph typically evolves over time. In such applications, a key issue is to maintain the core numbers of nodes when the graph changes over time. A simple implementation is to perform the linear time algorithm to recompute the core number for every node after the graph is updated. Such simple implementation is expensive when the graph is very large. In this paper, we propose a new efficient algorithm to maintain the core number for every node in a dynamic graph. Our main result is that only certain nodes need to update their core numbers when the graph is changed by inserting/deleting an edge. We devise an efficient algorithm to identify and recompute the core numbers of such nodes. The complexity of our algorithm is independent of the graph size. In addition, to further accelerate the algorithm, we develop two pruning strategies by exploiting the lower and upper bounds of the core number. Finally, we conduct extensive experiments over both real-world and synthetic datasets, and the results demonstrate the efficiency of the proposed algorithm. [ABSTRACT FROM AUTHOR]

Both cost-sensitive classification and online learning have been extensively studied in data mining and machine learning communities, respectively. However, very limited study addresses an important intersecting problem, that is, “Cost-Sensitive Online Classification”. In this paper, we formally study this problem, and propose a new framework for Cost-Sensitive Online Classification by directly optimizing cost-sensitive measures using online gradient descent techniques. Specifically, we propose two novel cost-sensitive online classification algorithms, which are designed to directly optimize two well-known cost-sensitive measures: (i) maximization of weighted sum of sensitivity and specificity, and (ii) minimization of weighted misclassification cost. We analyze the theoretical bounds of the cost-sensitive measures made by the proposed algorithms, and extensively examine their empirical performance on a variety of cost-sensitive online classification tasks. Finally, we demonstrate the application of the proposed technique for solving several online anomaly detection tasks, showing that the proposed technique could be a highly efficient and effective tool to tackle cost-sensitive online classification tasks in various application domains. [ABSTRACT FROM AUTHOR]

In pulsed Doppler radars, subsampling causes incorrect estimates of the radial velocity of the detected targets whenever its related Doppler frequency is greater than the pulse repetition frequency of the radar. The classic Chinese remainder theorem is a well-known method to overcome this problem. On the other hand, the robust Chinese remainder theorem is a search-based algorithm that, under some conditions, can guarantee the correct estimation of the Doppler frequency. In this paper, we have derived the exact probability of detection for both methods applied in a pulsed Doppler radar. Simulations have been compared to the analytical results and have shown an excellent agreement. [ABSTRACT FROM AUTHOR]

Byzantine attackers are serious threats to collaborative spectrum sensing (CSS) systems of cognitive radio networks (CRNs). When the attackers eavesdrop on the sensing reports of honest users and fabricate their local reports according to an undetectable criterion, they can even evolve into stealthy attackers, which cannot be detected by conventional detection approaches. However, in existing works, the significant threats of stealthy attacks have yet to be well considered. In this paper, we focus on the issue of detecting stealthy attackers in CSS systems. To analyze the detectability of stealthy attackers, we propose a multidimensional metric. We prove that dissimilarity in the metrics between different subsets of cognitive radios (CRs) reveals the existence of attackers, and when the attackers fabricate their local reports to eliminate the dissimilarity, they can avoid being detected. Based on these analyses, we propose a multidimensional feature vector (FV) and its empirical form to indicate the identity (an honest user or an attacker) of a CR. By classifying the CRs according to their empirical FVs (EFVs), attackers are distinguished from honest users. The effectiveness of the EFV-based attacker detection scheme is validated by both mathematical proof and numerical experiments. [ABSTRACT FROM PUBLISHER]

The restoration of images corrupted by blur and Poisson noise is a key issue in medical and biological image processing. While most existing methods are based on variational models, generally derived from a maximum a posteriori (MAP) formulation, recently sparse representations of images have shown to be efficient approaches for image recovery. Following this idea, we propose in this paper a model containing three terms: a patch-based sparse representation prior over a learned dictionary, the pixel-based total variation regularization term and a data-fidelity term capturing the statistics of Poisson noise. The resulting optimization problem can be solved by an alternating minimization technique combined with variable splitting. Extensive experimental results suggest that in terms of visual quality, peak signal-to-noise ratio value and the method noise, the proposed algorithm outperforms state-of-the-art methods. [ABSTRACT FROM PUBLISHER]

In this paper, we consider the rate distortion problem of discrete-time, ergodic, and stationary sources with feed forward at the receiver. We derive a sequence of achievable and computable rates that converge to the feed-forward rate distortion. We show that for ergodic and stationary sources, the rate $ Rn(D)= {{1}\over {n}}\min I({\hat {X}}^{n} \rightarrow{} X^{n}) $ is achievable for any n, where the minimization is performed over the transition conditioning probability p(\hat x^n\vert x^n) such that \BBE \left [d(X^n, \hat X^n)\right]\leq D. We also show that the limit of Rn(D) exists and is the feed-forward rate distortion. We follow Gallager's proof where there is no feed forward and, with appropriate modification, obtain our result. We provide an algorithm for calculating Rn(D) using the alternating minimization procedure and present several numerical examples. We also present a dual form for the optimization of Rn(D) and transform it into a geometric programming problem. [ABSTRACT FROM AUTHOR]

Complementary synthesis automatically synthesizes the decoder circuit of an encoder. It determines the existence of the decoder by checking whether the encoder's input can be uniquely determined by its output. However, this algorithm will not halt if the decoder does not exist. To solve this problem, a novel halting algorithm is proposed. For every path of the encoder, this algorithm first checks whether the encoder's input can be uniquely determined by its output. If yes, the decoder exists; otherwise, this algorithm checks if this path contains loops, which can be further unfolded to prove the non-existence of the decoder for all those longer paths. To illustrate its usefulness and efficiency, this algorithm has been run on several complex encoders, including PCI-E and Ethernet. Experimental results indicate that this algorithm always halts properly by distinguishing correct encoders from incorrect ones, and it is more than three times faster than previous ones. [ABSTRACT FROM AUTHOR]

In this paper, an observer-based stabilizing controller has been designed for networked systems involving both random measurement and actuation delays. The developed control algorithm is suitable for networked systems with any type of delays. By the simultaneous presence of binary random delays and making full use of the delay information in the measurement model and controller design, new and less conservative stabilization conditions for networked control systems are derived. The criterion is formulated in the form of a nonconvex matrix inequality of which a feasible solution can be obtained by solving a minimization problem in terms of linear matrix inequalities. An illustrative example is presented to show the applicability of the proposed design technique. [ABSTRACT FROM AUTHOR]

Speed control during startup is one of the most critical tasks of gas turbine power plant operation. This paper introduces the PI fuzzy gain-scheduling (PI-FGS) controller to solve the foremost speed-control problems, including tracking of the acceleration pattern and rejection of disturbances caused by operation events throughout startup. Fundamentally, the PI-FGS synthesizes a GS controller from multiple locally tuned generalized proportional integral (PI) algorithms by means of a fuzzy system. The PI-FGS structure permits independent tuning of the tracking and rejection responses at any operating point. In addition, tuning can be carried out on-site based on the operator experience and inspection of the current plant response. Simulation experiments show that the PI-FGS may improve speed-control performance well over that provided by commercially available speed controllers, which are based on a single conventional PI algorithm. [ABSTRACT FROM PUBLISHER]

This paper proposes an improved subspace-based optimization method (SOM) by using a new construction method for the ambiguous part of the induced current. The new current construction method reduces not only the computational complexity of the current construction in every iteration of the optimization but also the computational complexity of the singular-value decomposition of the mapping from the induced current to scattered fields. Thus, the improved SOM is able to deal with the 3-D inverse-scattering problems. Numerical tests validate the algorithm. [ABSTRACT FROM AUTHOR]

In this paper, we present a quantum multicasting network, called a generalized quantum connector (n-GQC), which can be used to multicast quantum information from n inputs to n outputs. This network is recursively constructed using n/2-GQCs and consists of O(n log² n) quantum gates. The key component of the n-GQC is another network, called an n-quantum concentrator (n-QC). This concentrator is also an n x n quantum network, and can route arbitrary quantum states on any m of its inputs to its top m outputs, for any m; 1 ≤ m ≤ n. Its quantum gate complexity is O(n log n). The quantum gate-level depths of n-QC and n-GQC are O(log² n) and O(log³ n), respectively. Both n-QC and n-GQC are based on the classical self-routing concentrators and generalized connection networks given by Lee and Oruç. While these networks work for multicasting classical packets, they cannot be used to multicast quantum packets as they employ balancer switches with both forward and backward propagation of packets. We introduce a quantum balancer switch that works using a forward propagation of packets only, thereby facilitating the n-QC and n-GQC designs presented in the paper. [ABSTRACT FROM AUTHOR]