Search

Graphs have been widely used to represent objects and object connections in applications such as the web, social networks, and citation networks. Mining influence relationships from graphs has gained increasing interests in recent years because providing information on how graph objects influence each other can facilitate graph exploration, graph search, and connection recommendations. In this paper, we study the problem of detecting influence aspects, on which objects are connected, and influence degree (or influence strength), with which one graph node influences another graph node on a given aspect. Existing techniques focus on inferring either the overall influence degrees or the influence types from graphs. In this paper, we propose a systematic approach to extract influence aspects and learn aspect-level influence strength. In particular, we first present a novel instance-merging based method to extract influence aspects from the context of object connections. We then introduce two generative models, Observed Aspect Influence Model (OAIM) and Latent Aspect Influence Model (LAIM), to model the topological structure of graphs, the text content associated with graph objects, and the context in which the objects are connected. To learn OAIM and LAIM, we design both non-parallel and parallel Gibbs sampling algorithms. We conduct extensive experiments on synthetic and real data sets to show the effectiveness and efficiency of our methods. The experimental results show that our models can discover more effective results than existing approaches. Our learning algorithms also scale well on large data sets. [ABSTRACT FROM PUBLISHER]

The simplex growing algorithm (SGA) has been widely used for finding endmembers. It can be considered as a sequential version of the well-known endmember finding algorithm, N-finder algorithm (N-FINDR), which finds endmembers one at a time by growing simplexes. However, one of the major hurdles for N-FINDR and SGA is the calculation of simplex volume (SV) which poses a great challenge in designing any algorithm using SV as a criterion for finding endmembers. This paper develops an orthogonal projection (OP)-based SGA (OP-SGA) which essentially resolves this computational issue. It converts the issue of calculating SV to calculating the OP on previously found simplexes without computing matrix determinants. Most importantly, a recursive Kalman filter-like OP-SGA, to be called recursive OP-SGA (ROP-SGA), can be also derived to ease computation. By virtue of ROP-SGA, several advantages and benefits in computational savings and hardware implementation can be gained for which N-FINDR and SGA do not have. [ABSTRACT FROM AUTHOR]

The aim of this paper is to propose a distributed electric vehicle (EV) coordination mechanism, which enables the management of the charging/discharging operation of an EV fleet, offering V2G regulation services to support system operation based on a day-ahead scheduling profile generated by an EV aggregator. Initially, a decentralized iterative algorithm is introduced to manage EV charging/discharging schedule aiming to meet the daily mobility energy requirement of an EV fleet with respect to the day-ahead schedule of the EV aggregator. Then, a droop-based control and a novel distributed regulation dispatch algorithm are developed aiming to meet the regulation dispatch signals send to the EV aggregator by the system. [ABSTRACT FROM PUBLISHER]

A new formulation of the auxiliary difference equation (ADE) finite-difference time-domain (FDTD) algorithm for the simulation of dispersive materials has been presented in the literature. Although flexible and efficient, this algorithm suffers from instability when modeling lossy high contrast dielectrics. In this paper, we adapt this ADE-FDTD formulation and present alternative algorithms for modeling static conductivity and Debye dispersion. The stability of these algorithms is assessed by numerical simulation in a wide variety of dielectric media, and their performance is compared to the existing algorithm by means of a simulation of the reflection of a plane wave from a dielectric boundary. Results and comparison with theory demonstrate the stability and accuracy of the new methods. The flexibility, computational efficiency, and ability to model a wide range of materials make these new methods highly attractive compared to other dispersive FDTD algorithms, particularly for modeling materials with multiple dispersion models. [ABSTRACT FROM PUBLISHER]

The bilateral filter is a non-linear filter that uses a range filter along with a spatial filter to perform edge-preserving smoothing of images. A direct computation of the bilateral filter requires $O(S)$ operations per pixel, where $S$ is the size of the support of the spatial filter. In this paper, we present a fast and provably accurate algorithm for approximating the bilateral filter when the range kernel is Gaussian. In particular, for box and Gaussian spatial filters, the proposed algorithm can cut down the complexity to $O(1)$ per pixel for any arbitrary $S$ . The algorithm has a simple implementation involving $N+1$ spatial filterings, where $N$ is the approximation order. We give a detailed analysis of the filtering accuracy that can be achieved by the proposed approximation in relation to the target bilateral filter. This allows us to estimate the order $N$ required to obtain a given accuracy. We also present comprehensive numerical results to demonstrate that the proposed algorithm is competitive with the state-of-the-art methods in terms of speed and accuracy. [ABSTRACT FROM AUTHOR]

To efficiently trade off system sum-rate and link fairness, this paper is dedicated to maximizing the sum of \alpha-fair utility in spectrum-sharing networks, where multiple interfering links share one channel. In the literature, three special cases, including \alpha=\mbox{0} (sum-rate maximization), \alpha=\mbox{1} (proportional fairness), and \alpha=\infty (max-min fairness), have been investigated; the complexity for cases \mbox{1} < \alpha < \infty and \mbox{0} < \alpha < \mbox{1} is still unknown. In this paper, we prove that the problem is convex when \mbox1 < \alpha < \infty and is NP-hard when \mbox0 < \alpha < \mbox1. To deal with the latter case, we transform the objective function and represent it by the difference of two concave functions (D.C.). Then, a power allocation algorithm is proposed with fast convergence to a local optimal point. Simulation results show that the proposed algorithm can obtain global optimality in two-link cases when \mbox0 < \alpha < \mbox1. In addition, we can get a flexible tradeoff between sum-rate and fairness in terms of Jain's index by adjusting $\alpha$. [ABSTRACT FROM AUTHOR]

Triple patterning lithography (TPL) is regarded as a promising technique to handle the manufacturing challenges in the 14nm technology node and beyond. It is necessary to consider TPL in early design stages to make the layout more TPL friendly and reduce the manufacturing cost. In this paper, we propose a flow to co-optimize cell layout decomposition and detailed placement. Our cell decomposition approach can enumerate all coloring solutions with the minimum number of stitches. The experimental results show that our approach can outperform the existing work in all aspects of stitch number, half-perimeter wirelength (HPWL), and running time. We further extend our placer to consider the displacement of cells as a constraint and as an objective, respectively, which can help to preserve the quality of the input placement. Effectiveness of the extensions is verified by the experiments. [ABSTRACT FROM AUTHOR]

In this paper, we propose a novel memetic algorithm, which is explorative particle swarm optimization (ePSO), combined with mesh adaptive direct search and apply it to the design of a permanent magnet synchronous machine (PMSM). The ePSO, which is modified from the PSO, drastically improves search time and iteration number at an exploration search stage. Unlike the existing methods, the proposed rule of start point selection takes an advantage of minimizing the search time. By applying the proposed algorithm to PMSM, we clarify the effectiveness of the proposed algorithm. [ABSTRACT FROM AUTHOR]

Metaheuristics have recently become the forefront of the current research as a powerful way to deal with many electromagnetic optimization problems. Based on the simulation of the herding behavior of krill individuals, a krill herd (KH) algorithm was recently proposed to solve optimization problems. In order to extend the classical mono-objective KH algorithm approach, this paper proposes a new multiobjective KH (MOKH) algorithm and a modified MOKH approach using the beta distribution in the inertia weight tuning. Numerical results on a multiobjective constrained brushless direct current motor design problem show that the evaluated MOKH algorithms present a promising performance. [ABSTRACT FROM AUTHOR]

The design of an electromagnetic machine is a nonlinear, multivariable, and multimodal optimization problem that incurs a great deal of computation time when calculating electromagnetic fields. To overcome these problems effectively, this paper proposes a new evolutionary multimodal optimization algorithm based on the Big Bang–Big Crunch method and aided by a surrogate model using the theory of compressed sensing. Its efficiency is demonstrated by assessing the optimization results for test functions. Moreover, to evaluate the feasibility of its application to an electromagnetic problem, an interior permanent magnet motor is designed using the proposed algorithm. The obtained results confirm that the proposed method has the ability to search for multiple optimal solutions with a good computational efficiency by reducing the number of fitness function evaluations during the optimization process. [ABSTRACT FROM AUTHOR]

This paper presents a study of different fuzzy neural network (FNN) learning control methods for brushless dc (BLDC) motor drives. The FNN combines fuzzy logic (FL) with the learning capabilities of an artificial neural network. The study designs an FNN structure and defines four different training algorithms for the FNN, namely, backpropagation (BP), extended Kalman filter (EKF), genetic (GEN), and particle swarm optimization (PSO). These algorithms are examined in the simple application of pattern matching an input set to an output set and determine the strengths and weaknesses of each algorithm. Tests of each learning algorithm by a pattern matching benchmark are achieved via dSPACE DSP MATLAB/Simulink environment and allows for the capability for adaptive self-tuning of the weights and memberships of the input parameters. Thus, this adds a self-learning capability to the initial fuzzy design for operational adaptively and implements the solution on real hardware using a BLDC motor drive system. The success of the adaptive FNN-controlled BLDC motor drive system is verified by experimental results. Testing results show that the EKF method is the superior method of the four for this specific application. The BP method was also somewhat successful, nearly matching the pattern but not to the accuracy of the EKF. The GEN and PSO methods did not demonstrate success. Demonstrating the proposed self-learning FNN control on real hardware realizes the solution. [ABSTRACT FROM AUTHOR]

The Internet of Things (IoT) has received an increasing attention in recent years. Embedded intelligent terminal (EIT), an indispensable part of IoT, works not only as a sensor but also as a primary processor. Due to the limited power resource of EIT, it is important to study how to improve the efficiency of its power use. To tackle this problem, we propose an energy-saving algorithm, Bayesian idle time prediction (BIP). The basic idea of BIP is to explore historical information and obtain a better estimation of idle time. In this paper, we provide a theoretical analysis of BIP and compare our method with three existing algorithms [weighted idle-time-prediction (IP) algorithm, IP algorithm, and running time fixed threshold in IP algorithm] with respect to energy-saving potential, as well as system delay under a random number of tasks. Both simulation and field experiment results demonstrate the advantages of our algorithm in energy saving. [ABSTRACT FROM AUTHOR]

In Part I of the study of the tensor deflation for CANDECOMP/PARAFAC, we have shown that the rank-1 tensor deflation is applicable under some conditions. Part II of the study presents several initialization algorithms suitable for the algorithm proposed in Part I. In addition, Part II contains an algorithm for the case when one or more factor matrices in the estimated model is constrained to be orthogonal. Finally, Part II provides an error analysis of the tensor deflation algorithm, which shows that there is a marginal loss of accuracy of the deflation algorithm compared to the ordinary CP decomposition. [ABSTRACT FROM PUBLISHER]

To decrease potentially harmful effects to the environment and reduce costs of cellular network operators, the exploration of energy saving is significant. In this paper, we shed light on the following energy consumption minimization (ECM) problem: “how to select the smallest set of active base stations (BSs) that can preserve the quality of service (the minimum data rate) required by the users.” Since the ECM problem belongs to the field of integer programming and is NP-hard, we propose two low-complexity approximation algorithms that yield performance guarantees: the iterative minimal set cover algorithm and the iterative maximal coverage (IMC) algorithm. Moreover, by leveraging the submodularity theory, we establish the performance bound of the IMC algorithm. Finally, the computational complexity of our proposed algorithms is analyzed, and a simulation platform is developed to evaluate the number of active BSs of proposed approaches. The numerical results demonstrate that our proposed algorithms outperform the conventional counterpart. [ABSTRACT FROM AUTHOR]

This paper reports on the development of dynamic characteristic analysis algorithm for irreversible demagnetization in brushless dc motors. In general, in static characteristic analysis of irreversible demagnetization, only the $d$ -axis magnetic flux components are considered. As a result, this type of analysis cannot be used to accurately analyze the characteristics of irreversible demagnetization while the motor is actually being driven. Thus, we developed a dynamic characteristic analysis algorithm that we utilize to compare the static and the dynamic characteristic analyses of irreversible demagnetization. Consequently, we propose a maximum current limit for motor designs that reduces the impact of irreversible demagnetization. [ABSTRACT FROM AUTHOR]

Microaggregation is a technique for disclosure limitation aimed at protecting the privacy of data subjects in microdata releases. It has been used as an alternative to generalization and suppression to generate $k$ -anonymous data sets, where the identity of each subject is hidden within a group of $k$ subjects. Unlike generalization, microaggregation perturbs the data and this additional masking freedom allows improving data utility in several ways, such as increasing data granularity, reducing the impact of outliers, and avoiding discretization of numerical data. $k$ -Anonymity, on the other side, does not protect against attribute disclosure, which occurs if the variability of the confidential values in a group of $k$ subjects is too small. To address this issue, several refinements of $k$ -anonymity have been proposed, among which $t$ -closeness stands out as providing one of the strictest privacy guarantees. Existing algorithms to generate $t$ -close data sets are based on generalization and suppression (they are extensions of $k$ -anonymization algorithms based on the same principles). This paper proposes and shows how to use microaggregation to generate $k$ -anonymous $t$ -close data sets. The advantages of microaggregation are analyzed, and then several microaggregation algorithms for $k$ -anonymous $t$ -closeness are presented and empirically evaluated. [ABSTRACT FROM PUBLISHER]

In blind hyperspectral unmixing (HU), the pure-pixel assumption is well known to be powerful in enabling simple and effective blind HU solutions. However, the pure-pixel assumption is not always satisfied in an exact sense, especially for scenarios where pixels are heavily mixed. In the no-pure-pixel case, a good blind HU approach to consider is the minimum volume enclosing simplex (MVES). Empirical experience has suggested that MVES algorithms can perform well without pure pixels, although it was not totally clear why this is true from a theoretical viewpoint. This paper aims to address the latter issue. We develop an analysis framework wherein the perfect endmember identifiability of MVES is studied under the noiseless case. We prove that MVES is indeed robust against lack of pure pixels, as long as the pixels do not get too heavily mixed and too asymmetrically spread. The theoretical results are supported by numerical simulation results. [ABSTRACT FROM PUBLISHER]

In space communication environments, most studies in delay tolerant networks (DTNs) adopt experimental approaches and they have shown that the utilization efficiency of link bandwidth can be affected by changing packet sizes at the bundle layer and the convergence layer. However, the lack of theoretical work makes it difficult to find the optimal packet sizes in general scenarios. In this paper, we focus on this important issue by performing a theoretical analysis to solve the packet size optimization problems in both one-hop and multihop DTNs. As our analysis is based on the widely used DTN architecture with Bundle Protocol (BP) and Licklider Transmission Protocol (LTP), the theoretical results can be applied to any DTN scenario using this architecture. We formulate packet size optimization problems in DTNs as nonconvex optimization problems. Furthermore, a goodput enhancement algorithm (GEA) is also proposed to find the optimal packet sizes in order to maximize goodput in DTNs. We conduct numerical analysis as well as simulations to validate our theoretical analysis and study the factors that determine the optimal packet sizes for BP and LTP. Numerical results show that GEA achieves significant performance improvement compared with schemes where packet size optimization on BP and LTP is not jointly considered. [ABSTRACT FROM PUBLISHER]

Consider two remote nodes having binary sequences $X$ and Y$ , respectively. Y$ is an edited version of , where the editing involves random deletions, insertions, and substitutions, possibly in bursts. The goal is for the node with Y$ to reconstruct X$ with minimal exchange of information over a noiseless link. The communication is measured in terms of both the total number of bits exchanged and the number of interactive rounds of communication. This paper focuses on the setting where the number of edits is , where $n$ is the length of $X$ . We first consider the case where the edits are a mixture of insertions and deletions (indels), and propose an interactive synchronization algorithm with near-optimal communication rate and average computational complexity of $O(n)$ arithmetic operations. The algorithm uses interaction to efficiently split the source sequence into substrings containing exactly one deletion or insertion. Each of these substrings is then synchronized using an optimal one-way algorithm based on the single-deletion correcting channel codes of Varshamov and Tenengolts. We then build on this synchronization algorithm in three different ways. First, it is modified to work with a single round of interaction. The reduction in the number of rounds comes at the expense of higher communication, which is quantified. Next, we present an extension to the practically important case where the insertions and deletions may occur in (potentially large) bursts. Finally, we show how to synchronize the sources to within a target Hamming distance. This feature can be used to differentiate between substitution and indel edits. In addition to theoretical performance bounds, we provide several validating simulation results for the proposed algorithms. [ABSTRACT FROM PUBLISHER]

Polar codes, as the first provable capacity-achieving error-correcting codes, have received much attention in recent years. However, the decoding performance of polar codes with traditional successive-cancellation (SC) algorithm cannot match that of the low-density parity-check or Turbo codes. Because SC list (SCL) decoding algorithm can significantly improve the error-correcting performance of polar codes, design of SCL decoders is important for polar codes to be deployed in practical applications. However, because the prior latency reduction approaches for SC decoders are not applicable for SCL decoders, these list decoders suffer from the long-latency bottleneck. In this paper, we propose a multibit-decision approach that can significantly reduce latency of SCL decoders. First, we present a reformulated SCL algorithm that can perform intermediate decoding of 2 b together. The proposed approach, referred as 2-bit reformulated SCL (2b-rSCL) algorithm, can reduce the latency of SCL decoder from ( 3n-2 ) to ( 2n-2 ) clock cycles without any performance loss. Then, we extend the idea of 2-b-decision to general case, and propose a general decoding scheme that can perform intermediate decoding of any 2^K bits simultaneously. This general approach, referred as \textit 2^K -bit reformulated SCL ( 2^K b-rSCL) algorithm, can reduce the overall decoding latency to as short as n/2^K-2-2 cycles. Furthermore, on the basis of the proposed algorithms, very large-scale integration architectures for 2b-rSCL and 4b-rSCL decoders are synthesized. Compared with a prior SCL decoder, the proposed (1024, 512) 2b-rSCL and 4b-rSCL decoders can achieve 21% and 60% reduction in latency, 1.66 and 2.77 times increase in coded throughput with list size 2, and 2.11 and 3.23 times increase in coded throughput with list size 4, respectively. [ABSTRACT FROM PUBLISHER]

This paper considers unimodular sequence synthesis under similarity constraint for both the continuous and discrete phase cases. A computationally efficient iterative algorithm for the continuous phase case (IA-CPC) is proposed to sequentially optimize the quadratic objective function. The quadratic optimization problem is turned into multiple one-dimensional optimization problems with closed-form solutions. For the discrete phase case, we present an iterative block optimization algorithm. Specifically, we partition the design variables into $K$ blocks, and then, we sequentially optimize each block via exhaustive search while fixing the remaining $K-1$ blocks. Finally, we evaluate the computational costs and performance gains of the proposed algorithms in comparison with power method-like and semidefinite relaxation related techniques. [ABSTRACT FROM PUBLISHER]

Facing a large number of unlabeled data and a small number of labeled data, semisupervised sparse feature selection has received increasing attention in recent years. However, most semisupervised feature selection algorithms are developed for single-view data and cannot naturally handle multiview data. Moreover, most existing semisupervised sparse feature selection methods are based on Laplacian regularization, which is a lack of extrapolating power. To overcome the above-mentioned drawbacks, we present a multiview Hessian semi-supervised sparse feature selection (MHSFS) framework in this paper. MHSFS can directly accomplish multiview sparse feature selection by exploiting multiview learning to reveal and leverage the correlated and complemental information among different views. In addition, MHSFS can achieve better performance based on Hessian regularization, which favors functions whose values linearly vary with respect to geodesic distance and preserves the local manifold structure well. A simple yet efficient iterative method is proposed to solve the objective function, followed by convergence analysis. We apply the proposed method into different multimedia analysis tasks, such as image annotation, video concept detection, and 3D motion analysis. The results show that MHSFS outperforms the state-of-the-art sparse feature selection methods and achieves good performance. [ABSTRACT FROM PUBLISHER]

The paper is concerned with stabilizing the family of adaptive filtering algorithms based on minimizing the $2Lth$ moment of the estimation error, with $L$ being an integer greater than 1. Stabilization is attained via a proposed normalization of the algorithm. Mean square stability of the normalized algorithm is proved for a Markov plant for all $L > 1$ . Transient and steady-state performances of the algorithm are analyzed for a time-invariant plant. Expressions are derived for the steady-state misadjustment and convergence time. Tradeoff between the transient and steady-state performances is evaluated. Dependence of this tradeoff on the value of L is studied. This tradeoff is compared with the tradeoff of the NLMS algorithm. The proposed algorithm is dramatically superior to the NLMS algorithm for sub-Gaussian noise. The superiority increases with L, initial mean-square deviation and signal-to-noise ratio. Analytical results are supported by simulations. [ABSTRACT FROM PUBLISHER]

Neighbor discovery, one of the most fundamental bootstrapping networking primitives, is particularly challenging in decentralized wireless networks where devices have directional antennas. In this paper, we study the following fundamental problem, which we term oblivious neighbor discovery: How can neighbor nodes with heterogeneous antenna configurations discover each other within a bounded delay in a fully decentralised manner without any prior coordination or synchronisation? We establish a theoretical framework on the oblivious neighbor discovery and the performance bound of any neighbor discovery algorithm achieving oblivious discovery. Guided by the theoretical results, we then devise an oblivious neighbor discovery algorithm, which achieves guaranteed oblivious discovery with order-minimal worst case discovery delay in the asynchronous and heterogeneous environment. We further demonstrate how our algorithm can be configured to achieve a desired tradeoff between average and worst case performance. [ABSTRACT FROM AUTHOR]

In this paper, we developed a golf position analysis system with an inertial sensor and swing motion analysis algorithm that can be used in golf courses. Specifically, we developed a band for both wrists that analyzes the golf swing of whoever is wearing it. By analyzing the movements of both the right and left wrists of the golfer, their golf swing can be judged more accurately, which can be used to advise the golfer regarding their golf swing. Experimental results show that this portable instrument along with its swing motion detection algorithm is a promising training tool for golfers. [ABSTRACT FROM AUTHOR]

Capturing image with defocused background by using a large aperture is a widely used technique in digital single-lens reflex (DSLR) camera photography. It is also desired to provide this function to smart phones. In this paper, a new algorithm is proposed to synthesize such an effect for a single portrait image. The foreground portrait is detected using a face prior based salient object detection algorithm. Then with an improved gradient domain guided image filter, the details in the foreground are enhanced while the background pixels are blurred. In this way, the background objects are defocused and thus the foreground objects are emphasized. The resultant image looks similar to image captured using a camera with a large aperture. The proposed algorithm can be adopted in smart phones, especially for the front cameras of smart phones. [ABSTRACT FROM AUTHOR]

This paper analyzes the stochastic runtime of the cross-entropy (CE) algorithm for the well-studied standard problems OneMax and LeadingOnes. We prove that the total number of solutions the algorithm needs to evaluate before reaching the optimal solution (i.e., its runtime) is bounded by a polynomial Q(n) in the problem size n with a probability growing exponentially to 1 with n if the parameters of the algorithm are adapted to n in a reasonable way. Our polynomial bound Q(n) for OneMax outperforms the well-known runtime bound of the 1-ANT algorithm, a particular ant colony optimization algorithm. Our adaptation of the parameters of the CE algorithm balances the number of iterations needed and the size of the samples drawn in each iteration, resulting in an increased efficiency. For the LeadingOnes problem, we improve the runtime of the algorithm by bounding the sampling probabilities away from 0 and 1. The resulting runtime outperforms the known stochastic runtime for a univariate marginal distribution algorithm, and is very close to the known expected runtime of variants of max-min ant systems. Bounding the sampling probabilities allows the CE algorithm to explore the search space even for test functions with a very rugged landscape as the LeadingOnes function. [ABSTRACT FROM PUBLISHER]

The low-rank matrix completion problem is fundamental to a number of tasks in data mining, machine learning, and signal processing. This paper considers the problem of adaptive matrix completion in time-varying scenarios. Given a sequence of incomplete and noise-corrupted matrices, the goal is to recover and track the underlying low rank matrices. Motivated from the classical least-mean square (LMS) algorithms for adaptive filtering, three LMS-like algorithms are proposed for estimating and tracking low-rank matrices. Performance of the proposed algorithms is provided in form of nonasymptotic bounds on the tracking mean-square error. Tracking performance of the algorithms is also studied via detailed simulations over real-world datasets. [ABSTRACT FROM PUBLISHER]

In this paper, we aim to obtain the optimal tradeoff between the average delay and the average power consumption in a communication system. In our system, the arrivals occur at each timeslot according to a Bernoulli arrival process, and are buffered at the transmitter waiting to be scheduled. We consider a finite buffer and allow the scheduling decision to depend on the buffer occupancy. In order to capture the realism in communication systems, the transmission power is assumed to be an increasing and convex function of the number of packets transmitted in each timeslot. This problem is modeled as a constrained Markov decision process (CMDP). We first prove that the optimal policy of the Lagrangian relaxation of the CMDP is deterministic and threshold-based. We then show that the optimal delay-power tradeoff curve is convex and piecewise linear, and the optimal policies of the original problem are also threshold-based. Based on the results, we propose an algorithm to obtain the optimal policy and the optimal tradeoff curve. We also show that the proposed algorithm is much more efficient than using general methods. The theoretical results and the algorithm are validated by linear programming and simulations. [ABSTRACT FROM PUBLISHER]

In intelligent vehicular communication networks, a hybrid communication architecture is used which combines both centralized and ad hoc transmission schemes. In order to maximize the end-to-end delivery ratio while reducing the network overhead, one important problem is to efficiently design the data forwarding algorithm to guarantee the quality of data transmission. In this paper, by considering the traveling information and vehicular space-crossing community structure, two metrics, “space–time approachability” and “social approachability,” are defined to provide the absolute and relative geographical information of the forthcoming contacts, respectively. Then, a novel data-forwarding algorithm, called approachability-based algorithm, is proposed, which utilizes two metrics together for better routing quality. We evaluate the proposed approachability-based algorithm utilizing San Francisco Cabspotting and Shanghai Taxi Movement datasets. Simulation results show that the approachability-based data forwarding algorithm can achieve better performance than the popular data forwarding algorithms ZOOM and BUBBLE RAP in all the interested scenarios. [ABSTRACT FROM PUBLISHER]

By employing the finite-time control method, the consensus control algorithm for higher-order multiagent systems is designed in this paper. Under a neighbor-based rule, a higher-order finite-time consensus algorithm is explicitly constructed, which only uses local information. The finite-time consensus control algorithm can guarantee that the state consensus is achieved in a finite time. In addition, for multiagent systems having a leader-following structure, the consensus algorithm is also designed. Finally, two examples are presented to show the effectiveness. [ABSTRACT FROM AUTHOR]

This paper introduces a mathematical model that incorporates the pertinent optical and physiological properties of skin reflections with the objective to increase our understanding of the algorithmic principles behind remote photoplethysmography (rPPG). The model is used to explain the different choices that were made in existing rPPG methods for pulse extraction. The understanding that comes from the model can be used to design robust or application-specific rPPG solutions. We illustrate this by designing an alternative rPPG method, where a projection plane orthogonal to the skin tone is used for pulse extraction. A large benchmark on the various discussed rPPG methods shows that their relative merits can indeed be understood from the proposed model. [ABSTRACT FROM AUTHOR]

In this paper, a novel global search algorithm, implementing principal component optimization (PCO) in combination with mesh adaptive direct search (MADS) is proposed. The PCO is based on principal component analysis, a widely used multivariate technique in statistics, while MADS is a highly effective local search algorithm, implemented to find local optima. Their integration reduces computation time and improves convergence reliability to a global optimum. The proposed algorithm is verified via application of a test function and comparison to conventional hybrid algorithms such as particle swarm optimization with MADS. Finally, the algorithm is applied to the optimal design of an interior permanent magnet synchronous machine for minimization of total harmonic distortion and torque ripple via finite element analysis. [ABSTRACT FROM AUTHOR]

Autoencoders are deep learning architectures that learn feature representation by minimizing the reconstruction error. Using an autoencoder as baseline, this paper presents a novel formulation for a class sparsity based supervised encoder, termed as CSSE. We postulate that features from the same class will have a common sparsity pattern/support in the latent space. Therefore, in the formulation of the autoencoder, a supervision penalty is introduced as a joint-sparsity promoting l2,1 -norm. The formulation of CSSE is derived for a single hidden layer and it is applied for multiple hidden layers using a greedy layer-by-layer learning approach. The proposed CSSE approach is applied for learning face representation and verification experiments are performed on the LFW and PaSC face databases. The experiments show that the proposed approach yields improved results compared to autoencoders and comparable results with state-of-the-art face recognition algorithms. [ABSTRACT FROM AUTHOR]

In this paper, a new pseudoanalytical axial mode-matching formulation is introduced to provide a flexible technique for analyzing direction well-logging tools in anisotropic formations. The presented technique does not rely on spatial discretization as former well-known methods. In this problem, a number of coil antennas with arbitrary relative tilt angle with respect to the symmetry axis are used to radiate electromagnetic fields in a cylindrically layered medium with both axial and radial stratifications, composed of a metallic mandrel, a borehole, and a surrounding layered earth formation. This configuration corresponds to that of triaxial well-logging tools used for oil and gas exploration. Our approach combines closed-form solutions of Maxwell’s equations for uniaxially anisotropic media in cylindrical coordinates with the generalized scattering matrix (GSM) at each axial discontinuity based on the mode-matching technique. The electromagnetic field from the tilted-coil source is represented by a set of modal coefficients that, after computation using GSM matrices, are used to extract the transimpedances of the well-logging tool. [ABSTRACT FROM PUBLISHER]

The high-dimensional data space of hyperspectral images (HSIs) often result in ill-conditioned formulations, which finally leads to many of the high-dimensional feature spaces being empty and the useful data existing primarily in a subspace. To avoid these problems, we use distance metric learning for dimensionality reduction. The goal of distance metric learning is to incorporate abundant discriminative information by reducing the dimensionality of the data. Considering that global metric learning is not appropriate for all training samples, this paper proposes an ensemble discriminative local metric learning (EDLML) algorithm for HSI analysis. The EDLML algorithm learns robust local metrics from both the training samples and the relative neighborhood of them and considers the different local discriminative distance metrics by dealing with the data region by region. It aims to learn a subspace to keep all the samples in the same class are as near as possible, while those from different classes are separated. The learned local metrics are then used to build an ensemble metric. Experiments on a number of different hyperspectral data sets confirm the effectiveness of the proposed EDLML algorithm compared with that of the other dimension reduction methods. [ABSTRACT FROM PUBLISHER]

The heat exchanging process is a strong nonlinear and cascade industrial unit, which is effected by the large random disturbances in the steam pressure, the outdoor temperature, and the water discharged by users. To solve this problem, in this paper, a PI controller with unmodeled dynamic compensation is combined with a dual-rate control, and a dynamic model of the supply water temperature in the outer loop with linear model and unknown higher order nonlinear is established by introducing the dynamics of the closed-loop control system for the steam flow-rate with a lifting method. This is then used in designing a one-step optimal PI control algorithm with unmodeled dynamics compensation. Second, a data-driven dual-rate control method is proposed for the control of water temperature and steam flow-rate. The stability and convergence of the proposed algorithm is analyzed. Finally, both, a contrast simulated experiment with the interval intelligent cascade control algorithm and an industrial application are included to demonstrate that the proposed method can control water temperature and steam flow-rate with large random disturbances within the target range of values for process requirements. [ABSTRACT FROM AUTHOR]

In this paper, we propose a new framework for hierarchical image segmentation based on iterative contraction and merging. In the proposed framework, we treat the hierarchical image segmentation problem as a sequel of optimization problems, with each optimization process being realized by a contraction-and-merging process to identify and merge the most similar data pairs at the current resolution. At the beginning, we perform pixel-based contraction and merging to quickly combine image pixels into initial region-elements with visually indistinguishable intra-region color difference. After that, we iteratively perform region-based contraction and merging to group adjacent regions into larger ones to progressively form a segmentation dendrogram for hierarchical segmentation. Comparing with the state-of-the-art techniques, the proposed algorithm can not only produce high-quality segmentation results in a more efficient way, but also keep a lot of boundary details in the segmentation results. [ABSTRACT FROM PUBLISHER]

This paper studies the stochastic behavior of the signed variants of the LMS algorithm for a system identification framework when the input signal is a cyclostationary white Gaussian process. Three algorithms are studied: the signed regressor, the signed error, and the sign–sign algorithms. The input cyclostationary signal is modeled by a white Gaussian random process with periodically time-varying power. The system parameters vary according to a random-walk. Mathematical models are derived for the mean and mean-square-deviation behavior of the adaptive weights with the input cyclostationarity. These models are used to derive new results concerning the performance of the algorithms. Some of these results are surprising. Monte Carlo simulations of the three algorithms provide strong support for the theory. [ABSTRACT FROM PUBLISHER]

In this paper, we study ways to enhance the composition of teams based on new requirements in a collaborative environment. We focus on recommending team members who can maintain the team's performance by minimizing changes to the team's skills and social structure. Our recommendations are based on computing team-level similarity, which includes skill similarity, structural similarity as well as the synergy between the two. Current heuristic approaches are one-dimensional and not comprehensive, as they consider the two aspects independently. To formalize team-level similarity, we adopt the notion of graph kernel of attributed graphs to encompass the two aspects and their interaction. To tackle the computational challenges, we propose a family of fast algorithms by (a) designing effective pruning strategies, and (b) exploring the smoothness between the existing and the new team structures. Extensive empirical evaluations on real world datasets validate the effectiveness and efficiency of our algorithms. [ABSTRACT FROM PUBLISHER]

Phasor measurement units (PMUs) are expected to be the basis of modern power networks monitoring systems. They are conceived to allow measuring the phasor, frequency, and rate of change of frequency (ROCOF) of electrical signals in a synchronized way and with unprecedented accuracy. PMUs are intended to apply to three-phase systems and to track signal parameters evolution during network dynamics. For these reasons, the design of the algorithms and, in particular, of the filters that allow rejecting the disturbances while preserving the passband signal content is a paramount concern. In this paper, a novel space vector approach is proposed. It exploits the three-phase nature of the monitored signals together with proper lowpass and differentiation filters. Analytical formulas for performance prediction under almost all the test conditions prescribed by the synchrophasor standard C37.118.1 for PMUs, are introduced. The given expressions are extremely accurate, thus allowing to derive the filter design criteria for phasor, frequency, and ROCOF computation, so that the requirements in terms of estimation errors can be easily translated into filter specifications. The implications of the proposed approach in practical PMU design are illustrated by means of two simple design examples matching P and M compliance classes, respectively, for all the test cases of the standard. The reported performance proves the validity of the proposal. [ABSTRACT FROM AUTHOR]

A Sequence OLAP (S-OLAP) system provides a platform on which pattern-based aggregate (PBA) queries on a sequence database are evaluated. In its simplest form, a PBA query consists of a pattern template $T$ and an aggregate function $F$ . A pattern template is a sequence of variables, each is defined over a domain. Each variable is instantiated with all possible values in its corresponding domain to derive all possible patterns of the template. Sequences are grouped based on the patterns they possess. The answer to a PBA query is a sequence cuboid (s-cuboid), which is a multidimensional array of cells. Each cell is associated with a pattern instantiated from the query's pattern template. The value of each s-cuboid cell is obtained by applying the aggregate function $F$ to the set of data sequences that belong to that cell. Since a pattern template can involve many variables and can be arbitrarily long, the induced s-cuboid for a PBA query can be huge. For most analytical tasks, however, only iceberg cells with very large aggregate values are of interest. This paper proposes an efficient approach to identifying and evaluating iceberg cells of s-cuboids. Experimental results show that our algorithms are orders of magnitude faster than existing approaches. [ABSTRACT FROM AUTHOR]

Near-field backscattering problems are often encountered in computational electromagnetics. In this paper, contour-integral representations have been presented to evaluate the physical-optics backscattered electric and magnetic fields from a perfectly conducting object illuminated by a dipole source. The advantage of the proposed representations is that the integrands in the contour integrals along the rim of the scatterer are free from singularities for all the source/observer positions. In addition, the proposed algorithm is easily extensible to analyze the scattering from complex objects. Such a liberty is achieved by deriving the novel representations using vector-algebra theorems in global coordinates, instead of existing scalar theorems in a particular angular coordinate. Numerical examples are presented to illustrate the efficiency and accuracy of the proposed contour-integral representations. [ABSTRACT FROM PUBLISHER]

This paper proposes a unified framework based on affine arithmetic for computing reliable enclosures of uncertain power flow (PF) and optimal power flow (OPF) solutions. The main idea is to formulate a generic mathematical programming problem under uncertainty by means of equivalent deterministic problems, and to identify the affine forms describing the data uncertainty by means of a signal processing technique based on principal components analysis. Compared to existing solution algorithms, this formulation presents greater flexibility, as it allows to find feasible solutions and inclusion of multiple equality and inequality constraints, and reduce the approximation errors to obtain better PF and OPF solution enclosures. Detailed numerical results are presented and discussed using a variety of realistic test systems, demonstrating the effectiveness of the proposed methodologies and comparing it to existing techniques for uncertain PF and OPF analysis. [ABSTRACT FROM AUTHOR]

As a noninvasive technique, electroencephalography (EEG) is commonly used to monitor the brain signals of patients with epilepsy such as the interictal epileptic spikes. However, the recorded data are often corrupted by artifacts originating, for example, from muscle activities, which may have much higher amplitudes than the interictal epileptic signals of interest. To remove these artifacts, a number of independent component analysis (ICA) techniques were successfully applied. In this paper, we propose a new deflation ICA algorithm, called penalized semialgebraic unitary deflation (P-SAUD) algorithm, that improves upon classical ICA methods by leading to a considerably reduced computational complexity at equivalent performance. This is achieved by employing a penalized semialgebraic extraction scheme, which permits us to identify the epileptic components of interest (interictal spikes) first and obviates the need of extracting subsequent components. The proposed method is evaluated on physiologically plausible simulated EEG data and actual measurements of three patients. The results are compared to those of several popular ICA algorithms as well as second-order blind source separation methods, demonstrating that P-SAUD extracts the epileptic spikes with the same accuracy as the best ICA methods, but reduces the computational complexity by a factor of 10 for 32-channel recordings. This superior computational efficiency is of particular interest considering the increasing use of high-resolution EEG recordings, whose analysis requires algorithms with low computational cost. [ABSTRACT FROM AUTHOR]

Signal identification represents the task of a receiver to identify the signal type and its parameters, with applications to both military and commercial communications. In this paper, we investigate the identification of spatial multiplexing and Alamouti space–time block codes with single-carrier frequency-division multiple-access signals, when the receiver is equipped with a single antenna. We develop a discriminating feature based on a fourth-order statistic of the received signal as well as a constant false-alarm rate decision criterion that relies on the statistical properties of the feature estimate. Furthermore, we present the theoretical performance analysis of the proposed identification algorithm. The algorithm does not require channel or noise power estimation, modulation classification, and block synchronization. Simulation results show the validity of the proposed algorithm as well as a very good agreement with the theoretical analysis. [ABSTRACT FROM PUBLISHER]

In this paper, we study the problem of mining frequent sequences under the rigorous differential privacy model. We explore the possibility of designing a differentially private frequent sequence mining (FSM) algorithm which can achieve both high data utility and a high degree of privacy. We found, in differentially private FSM, the amount of required noise is proportionate to the number of candidate sequences. If we could effectively prune those unpromising candidate sequences, the utility and privacy tradeoff can be significantly improved. To this end, by leveraging a sampling-based candidate pruning technique, we propose PFS $^2$, a novel differentially private FSM algorithm. It is the first algorithm that supports the general gap-constrained FSM in the context of differential privacy. The gap constraints in FSM can be used to limit the mining results to a controlled set of frequent sequences. In our PFS$^2$ algorithm, the core is to utilize sample databases to prune the candidate sequences generated based on the downward closure property. In particular, we use the noisy local support of candidate sequences in the sample databases to estimate which candidate sequences are potentially frequent. To improve the accuracy of such private estimations, a gap-aware sequence shrinking method is proposed to enforce the length constraint on the sample databases. Moreover, to calibrate the amount of noise required by differential privacy, a gap-aware sensitivity computation method is proposed to obtain the sensitivity of the local support computations with different gap constraints. Furthermore, to decrease the probability of misestimating frequent sequences as infrequent, a threshold relaxation method is proposed to relax the user-specified threshold for the sample databases. Through formal privacy analysis, we show that our PFS $^2$ algorithm is $\epsilon$ -differentially private. Extensive experiments on real datasets illustrate that our PFS$^2$ algorithm can privately find frequent sequences with high accuracy. [ABSTRACT FROM PUBLISHER]

Causality and responsibility is an essential tool in the database community for providing intuitive explanations for answers/non-answers to queries. Causality denotes the causes for the answers/non-answers to queries, and responsibility represents the degree of a cause which reflects its influence on the answers/non-answers to queries. In this paper, we study the causality and responsibility problem (CRP) for the non-answers to probabilistic reverse skyline queries (PRSQ). We first formalize CRP on PRSQ, and then, we propose an efficient algorithm termed as CP to compute the causality and responsibility for the non-answers to PRSQ. CP first finds candidate causes, and then, it performs verification to obtain actual causes with their responsibilities, during which several strategies are used to boost efficiency. Further, we explore the CRP for the non-answers to reverse skyline queries. Towards this, we extend CP to identify directly all the actual causes and their responsibilities for a non-answer to reverse skyline queries without additional verification. Extensive experiments using both real and synthetic data sets demonstrate the effectiveness and efficiency of our presented algorithms. [ABSTRACT FROM AUTHOR]

Digital microfluidic biochips (DMFBs), a second-generation lab-on-chip device has developed in recent years as a feasible alternative to conventional laboratory procedure for biochemical analysis and diagnostic applications. These devices enable the precise manipulation of nanoliter volumes of biological fluids and chemical reagents within a 2-D rectangular array of electrodes. Increasing number of control pin requirements together with high wire planning complexity becomes a major issue for integrated execution of multiple bioassays within a single DMFB layout. In this paper, we propose new techniques for interconnection wire routing for actuating the electrodes operating at identical time sequence. Here, we propose three different algorithms to develop feasible wire plans for a given layout with an aim to minimize the overall number of control pin count. Multiple actuation on the same pin termed multiphasing is proposed to resolve the issue of wire planning for handling the issue of cross contamination at any particular site. The proposed techniques are implemented in layouts using testbenches for benchmark suite III and selective testbenches for benchmark suite I. The results obtained through simulation show encouraging improvement over contemporary contributions. [ABSTRACT FROM AUTHOR]

In this paper, we study a new problem of continuous learning from doubly-streaming data where both data volume and feature space increase over time. We refer to the doubly-streaming data as trapezoidal data streams and the corresponding learning problem as online learning from trapezoidal data streams. The problem is challenging because both data volume and data dimension increase over time, and existing online learning [1] , [2] , online feature selection [3] , and streaming feature selection algorithms [4] , [5] are inapplicable. We propose a new Online Learning with Streaming Features algorithm (OLSF for short) and its two variants, which combine online learning [1] , [2] and streaming feature selection [4] , [5] to enable learning from trapezoidal data streams with infinite training instances and features. When a new training instance carrying new features arrives, a classifier updates the existing features by following the passive-aggressive update rule [2] and updates the new features by following the structural risk minimization principle. Feature sparsity is then introduced by using the projected truncation technique. We derive performance bounds of the OLSF algorithm and its variants. We also conduct experiments on real-world data sets to show the performance of the proposed algorithms. [ABSTRACT FROM PUBLISHER]