Search

Deep probabilistic aspect models are widely utilized in document analysis to extract the semantic information and obtain descriptive topics. However, there are two problems that may affect their applications. One is that common words shared among all documents with low representational meaning may reduce the representation ability of learned topics. The other is introducing supervision information to hierarchical topic models to fully utilize the side information of documents that is difficult. To address these problems, in this article, we first propose deep diverse latent Dirichlet allocation (DDLDA), a deep hierarchical topic model that can yield more meaningful semantic topics with less common and meaningless words by introducing shared topics. Moreover, we develop a variational inference network for DDLDA, which helps us to further generalize DDLDA to a supervised deep topic model called max-margin DDLDA (mmDDLDA) by employing max-margin principle as the classification criterion. Compared to DDLDA, mmDDLDA can discover more discriminative topical representations. In addition, a continual hybrid method with stochastic-gradient MCMC and variational inference is put forward for deep latent Dirichlet allocation (DLDA)-based models to make them more practical in real-world applications. The experimental results demonstrate that DDLDA and mmDDLDA are more efficient than existing unsupervised and supervised topic models in discovering highly discriminative topic representations and achieving higher classification accuracy. Meanwhile, DLDA and our proposed models trained by the proposed continual learning approach cannot only show good performance on preventing catastrophic forgetting but also fit the evolving new tasks well. [ABSTRACT FROM AUTHOR]

The limitation of theDC protection device confines the development of MV/LVDC grids. This paper presents a DC dynamic voltage restorer to exploit DC custom power devices for DC distribution networks in principle. It is based on an improved AC/DC dual active bridge and battery energy storage to maintain the voltage profile of sensitive loads in DC networks. The principle of the improved DC-DVR has been analyzed from the perspectives of the range of compensated voltage, current characteristics, and control strategy. Compared with other existing methods, the proposed DC-DVR features a simple structure, an easy control strategy, and the ability to mitigate both voltage sag and swell by injecting forward or reverse voltage. Experiment results demonstrate the correctness of the theoretical analysis and the feasibility of the proposed structure. A case study of DC doubly-fed induction generator (DFIG) interfaced with power grid is carried out, integrated with the proposed DC-DVR to verify the operation principle of the proposed scheme. [ABSTRACT FROM AUTHOR]

($1- {x}$)BiScO3- ${x}$ PbTiO3 (BS-PT) ceramics have excellent piezoelectricity and high Curie temperature at its morphotropic phase boundary (MPB) (${x} =0.64$), so it is a promising piezoelectric material for fabricating high-temperature ultrasonic transducer (HTUT). Electric properties of 0.36BS-0.64PT ceramics were characterized at different temperatures, and an HTUT with the center frequency of about 15 MHz was designed by PiezoCAD based on the measuring results. The prepared HTUT was tested in a silicone oil bath at different temperatures systematically. The test results show that the HTUT can maintain a stable electrical resonance until 290 °C and get a clear echo response until 250 °C with slight changes of the center frequency. Then, a stepped metal block submerged in silicone oil was imaged by the HTUT until 250 °C. Velocity of silicone oil and axial resolution of the HTUT at different temperatures was calculated. The results verify the capability of 0.36BS-0.64PT-based HTUT for high-temperature ultrasonic imaging applications. [ABSTRACT FROM AUTHOR]

Hyperspectral images (HSIs) with rich spectral information have been widely used in many fields. Anomaly detection is one of the most interesting and important applications. In this article, a novel Gaussian mixture model (GMM)-based anomaly detection (GMMD) method for HSI is proposed. The main contributions of this article are a new GMM-based extraction approach for extracting the anomaly pixels and an effective GMM-based weighting approach for fusing the extracted anomaly results. Specifically, based on the fact that the spectral values of anomaly pixels in some bands are different from those of background pixels, we propose a GMM-based anomaly extraction approach in which the HSI is characterized by the GMM and the anomaly pixels are extracted by a range prescribed by the GMM parameters. In order to fuse the extracted anomaly results, the GMM-based weighting method is introduced to adaptively construct the detection map. The detection map is rectified by using a guided filter to obtain the final anomaly detection map. Experimental results conducted on four hyperspectral data sets demonstrate the superior performance of the proposed GMMD method. [ABSTRACT FROM AUTHOR]

The control of virus spreading over complex networks with a limited budget has attracted much attention but remains challenging. This article aims at addressing the combinatorial, discrete resource allocation problems (RAPs) in virus spreading control. To meet the challenges of increasing network scales and improve the solving efficiency, an evolutionary divide-and-conquer algorithm is proposed, namely, a coevolutionary algorithm with network-community-based decomposition (NCD-CEA). It is characterized by the community-based dividing technique and cooperative coevolution conquering thought. First, to reduce the time complexity, NCD-CEA divides a network into multiple communities by a modified community detection method such that the most relevant variables in the solution space are clustered together. The problem and the global swarm are subsequently decomposed into subproblems and subswarms with low-dimensional embeddings. Second, to obtain high-quality solutions, an alternative evolutionary approach is designed by promoting the evolution of subswarms and the global swarm, in turn, with subsolutions evaluated by local fitness functions and global solutions evaluated by a global fitness function. Extensive experiments on different networks show that NCD-CEA has a competitive performance in solving RAPs. This article advances toward controlling virus spreading over large-scale networks. [ABSTRACT FROM AUTHOR]

Supply chain network design (SCND) is a complicated constrained optimization problem that plays a significant role in the business management. This article extends the SCND model to a large-scale SCND with uncertainties (LUSCND), which is more practical but also more challenging. However, it is difficult for traditional approaches to obtain the feasible solutions in the large-scale search space within the limited time. This article proposes a cooperative coevolutionary bare-bones particle swarm optimization (CCBBPSO) with function independent decomposition (FID), called CCBBPSO-FID, for a multiperiod three-echelon LUSCND problem. For the large-scale issue, binary encoding of the original model is converted to integer encoding for dimensionality reduction, and a novel FID is designed to efficiently decompose the problem. For obtaining the feasible solutions, two repair methods are designed to repair the infeasible solutions that appear frequently in the LUSCND problem. A step translation method is proposed to deal with the variables out of bounds, and a labeled reposition operator with adaptive probabilities is designed to repair the infeasible solutions that violate the constraints. Experiments are conducted on 405 instances with three different scales. The results show that CCBBPSO-FID has an evident superiority over contestant algorithms. [ABSTRACT FROM AUTHOR]

Estimating optical flow from successive video frames is one of the fundamental problems in computer vision and image processing. In the era of deep learning, many methods have been proposed to use convolutional neural networks (CNNs) for optical flow estimation in an unsupervised manner. However, the performance of unsupervised optical flow approaches is still unsatisfactory and often lagging far behind their supervised counterparts, primarily due to over-smoothing across motion boundaries and occlusion. To address these issues, in this paper, we propose a novel method with a new post-processing term and an effective loss function to estimate optical flow in an unsupervised, end-to-end learning manner. Specifically, we first exploit a CNN-based non-local term to refine the estimated optical flow by removing noise and decreasing blur around motion boundaries. This is implemented via automatically learning weights of dependencies over a large spatial neighborhood. Because of its learning ability, the method is effective for various complicated image sequences. Secondly, to reduce the influence of occlusion, a symmetrical energy formulation is introduced to detect the occlusion map from refined bi-directional optical flows. Then the occlusion map is integrated to the loss function. Extensive experiments are conducted on challenging datasets, i.e. FlyingChairs, MPI-Sintel and KITTI to evaluate the performance of the proposed method. The state-of-the-art results demonstrate the effectiveness of our proposed method. [ABSTRACT FROM AUTHOR]

Cloud workflow scheduling is a significant topic in both commercial and industrial applications. However, the growing scale of workflow has made such a scheduling problem increasingly challenging. Many current algorithms often deal with small- or medium-scale problems (e.g., less than 1000 tasks) and face difficulties in providing satisfactory solutions when dealing with the large-scale problems, due to the curse of dimensionality. To this aim, this article proposes a dynamic group learning distributed particle swarm optimization (DGLDPSO) for large-scale optimization and extends it for the large-scale cloud workflow scheduling. DGLDPSO is efficient for large-scale optimization due to its following two advantages. First, the entire population is divided into many groups, and these groups are coevolved by using the master-slave multigroup distributed model, forming a distributed PSO (DPSO) to enhance the algorithm diversity. Second, a dynamic group learning (DGL) strategy is adopted for DPSO to balance diversity and convergence. When applied DGLDPSO into the large-scale cloud workflow scheduling, an adaptive renumber strategy (ARS) is further developed to make solutions relate to the resource characteristic and to make the searching behavior meaningful rather than aimless. Experiments are conducted on the large-scale benchmark functions set and the large-scale cloud workflow scheduling instances to further investigate the performance of DGLDPSO. The comparison results show that DGLDPSO is better than or at least comparable to other state-of-the-art large-scale optimization algorithms and workflow scheduling algorithms. [ABSTRACT FROM AUTHOR]

As the mutation strategy and algorithmic parameters in differential evolution (DE) are sensitive to the problems being solved, a hot research topic is to adaptively control the strategy and parameters according to the requirements of the problem. In the literature, most adaptive DE use either historical experiences of the population or heuristic information of the individuals to promote adaptation. In this paper, we develop a novel variant of adaptive DE, utilizing both the historical experience and heuristic information for the adaptation. In this novel historical and heuristic DE (HHDE), each individual dynamically adjusts its mutation strategy and associated parameters not only by learning from previous successful experience of the whole population, but also according to heuristic information related with its own current state. These help the algorithm select a more suitable mutation strategy and determinate better parameters for each individual in different evolutionary stages. The performance of the proposed HHDE is extensively evaluated on 30 benchmark functions with different dimensions. Experimental results confirm the competitiveness of the proposed algorithm to a number of DE variants. [ABSTRACT FROM AUTHOR]

Cloud workflow scheduling is significantly challenging due to not only the large scale of workflow but also the elasticity and heterogeneity of cloud resources. Moreover, the pricing model of clouds makes the execution time and execution cost two critical issues in the scheduling. This paper models the cloud workflow scheduling as a multiobjective optimization problem that optimizes both execution time and execution cost. A novel multiobjective ant colony system based on a co-evolutionary multiple populations for multiple objectives framework is proposed, which adopts two colonies to deal with these two objectives, respectively. Moreover, the proposed approach incorporates with the following three novel designs to efficiently deal with the multiobjective challenges: 1) a new pheromone update rule based on a set of nondominated solutions from a global archive to guide each colony to search its optimization objective sufficiently; 2) a complementary heuristic strategy to avoid a colony only focusing on its corresponding single optimization objective, cooperating with the pheromone update rule to balance the search of both objectives; and 3) an elite study strategy to improve the solution quality of the global archive to help further approach the global Pareto front. Experimental simulations are conducted on five types of real-world scientific workflows and consider the properties of Amazon EC2 cloud platform. The experimental results show that the proposed algorithm performs better than both some state-of-the-art multiobjective optimization approaches and the constrained optimization approaches. [ABSTRACT FROM AUTHOR]

Cross-docks serve as distribution centers where shipments from different vendors are first consolidated according to their destinations, and then delivered to the retailers directly, with little or no storage in between. A critical problem encountered in the operation of cross-docks is the assignment of receiving and shipping doors, which greatly influences the labor or machinery cost of transferring the shipments between inbound and outbound transports. We show that the cross-dock door assignment problem (CDAP) is strictly non-deterministic polynomial-time complete. Although some deterministic algorithms have been reported to handle small-scale problems, the solutions to the middle- and large-scale CDAPs progressed at a slow pace. In this paper, we develop a nature-inspired dual-colony ant algorithm for CDAP, in which the two colonies of ants cooperatively search the optimal assignments of receiving and shipping doors to minimize the transferring costs of shipments. A collaborative local search strategy is designed and incorporated into the algorithm to enhance the search efficiency. Experiments have been conducted on a number of problem instances with different cross-dock sizes and freight flow patterns. The results show that the proposed algorithm is very competitive and can provide better solutions than the state-of-the-art heuristic algorithms. [ABSTRACT FROM AUTHOR]

This paper develops a decomposition-based coevolutionary algorithm for many-objective optimization, which evolves a number of subpopulations in parallel for approaching the set of Pareto optimal solutions. The many-objective problem is decomposed into a number of subproblems using a set of well-distributed weight vectors. Accordingly, each subpopulation of the algorithm is associated with a weight vector and is responsible for solving the corresponding subproblem. The exploration ability of the algorithm is improved by using a mating pool that collects elite individuals from the cooperative subpopulations for breeding the offspring. In the subsequent environmental selection, the top-ranked individuals in each subpopulation, which are appraised by aggregation functions, survive for the next iteration. Two new aggregation functions with distinct characteristics are designed in this paper to enhance the population diversity and accelerate the convergence speed. The proposed algorithm is compared with several state-of-the-art many-objective evolutionary algorithms on a large number of benchmark instances, as well as on a real-world design problem. Experimental results show that the proposed algorithm is very competitive. [ABSTRACT FROM AUTHOR]

Multimodal optimization problem (MMOP), which targets at searching for multiple optimal solutions simultaneously, is one of the most challenging problems for optimization. There are two general goals for solving MMOPs. One is to maintain population diversity so as to locate global optima as many as possible, while the other is to increase the accuracy of the solutions found. To achieve these two goals, a novel dual-strategy differential evolution (DSDE) with affinity propagation clustering (APC) is proposed in this paper. The novelties and advantages of DSDE include the following three aspects. First, a dual-strategy mutation scheme is designed to balance exploration and exploitation in generating offspring. Second, an adaptive selection mechanism based on APC is proposed to choose diverse individuals from different optimal regions for locating as many peaks as possible. Third, an archive technique is applied to detect and protect stagnated and converged individuals. These individuals are stored in the archive to preserve the found promising solutions and are reinitialized for exploring more new areas. The experimental results show that the proposed DSDE algorithm is better than or at least comparable to the state-of-the-art multimodal algorithms when evaluated on the benchmark problems from CEC2013, in terms of locating more global optima, obtaining higher accuracy solution, and converging with faster speed. [ABSTRACT FROM AUTHOR]

In this paper, a fast and robust self-representation (FRSR) method is proposed to select a proper band subset from hyperspectral imagery (HSI). The FRSR assumes the separability structure of the HSI band set and transforms the problem of separable nonnegative matrix factorization into the robust self-representation (RSR) model. Then, the FRSR incorporates structured random projections into the RSR model to improve computational efficiency. The solution of FRSR is formulated into optimizing a convex problem and the augmented Lagrangian multipliers are adopted to estimate the proper factorization localizing matrix in the FRSR. The selected band subset is constituted with the bands corresponding to the r largest diagonal entries of the factorization localizing matrix. The experimental results show that FRSR outperforms state-of-the-art techniques in classification accuracy with lower computational cost. [ABSTRACT FROM PUBLISHER]

A band-weighted support vector machine (BWSVM) method is proposed to classify hyperspectral imagery (HSI). The BWSVM presents an L1 penalty term of band weight vector to regularize the regular SVM model. The L1 norm regularization term guarantees the sparsity of band weights and describes potentially divergent contributions from different bands in modeling the binary SVM model. The BWSVM adopts the KerNel iterative feature extraction algorithm to minimize the nonconvex program. It linearizes nonlinear kernels and iteratively optimizes two convex subproblems with respect to both sample coefficients and band weights. The class label is determined by picking the largest sample coefficients from all its binary models of BWSVM. Two popular HSI data sets are utilized to testify the classification performance of BWSVM. Experimental results show that the BWSVM outperforms three state-of-the-art classifiers including SVM, random forest, and k-nearest neighbor. [ABSTRACT FROM PUBLISHER]

In this paper, a fused global saliency-based multiscale multiresolution multistructure local binary pattern (salM 3LBP) feature and local codebookless model (CLM) feature is proposed for high-resolution image scene classification. First, two different but complementary types of descriptors (pixel intensities and differences) are developed to extract global features, characterizing the dominant spatial features in multiple scale, multiple resolution, and multiple structure manner. The micro/macrostructure information and rotation invariance are guaranteed in the global feature extraction process. For dense local feature extraction, CLM is utilized to model local enrichment scale invariant feature transform descriptor and dimension reduction is conducted via joint low-rank learning with support vector machine. Finally, a fused feature representation between salM3LBP and CLM as the scene descriptor to train a kernel-based extreme learning machine for scene classification is presented. The proposed approach is extensively evaluated on three challenging benchmark scene datasets (the 21-class land-use scene, 19-class satellite scene, and a newly available 30-class aerial scene), and the experimental results show that the proposed approach leads to superior classification performance compared with the state-of-the-art classification methods. [ABSTRACT FROM PUBLISHER]

Niching techniques have recently been incorporated into evolutionary algorithms (EAs) for multisolution optimization in multimodal landscape. However, existing niching techniques inevitably increase the time complexity of basic EAs due to the computation of the distance matrix of individuals. In this paper, we propose a fast niching technique. The technique avoids pairwise distance calculations by introducing the locality sensitive hashing, an efficient algorithm for approximately retrieving nearest neighbors. Individuals are projected to a number of buckets by hash functions. The similar individuals possess a higher probability of being hashed into the same bucket than the dissimilar ones. Then, interactions between individuals are limited to the candidates that fall in the same bucket to achieve local evolution. It is proved that the complexity of the proposed fast niching is linear to the population size. In addition, this mechanism induces stable niching behavior and it inherently keeps a balance between the exploration and exploitation of multiple optima. The theoretical analysis conducted in this paper suggests that the proposed technique is able to provide bounds for the exploration and exploitation probabilities. Experimental results show that the fast niching versions of the multimodal algorithms can exhibit similar or even better performance than their original ones. More importantly, the execution time of the algorithms is significantly reduced. [ABSTRACT FROM AUTHOR]