• Title/Summary/Keyword: Algorithm decomposition

Search Result 789, Processing Time 0.029 seconds

Neighborhood coreness algorithm for identifying a set of influential spreaders in complex networks

  • YANG, Xiong;HUANG, De-Cai;ZHANG, Zi-Ke
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.6
    • /
    • pp.2979-2995
    • /
    • 2017
  • In recent years, there has been an increasing number of studies focused on identifying a set of spreaders to maximize the influence of spreading in complex networks. Although the k-core decomposition can effectively identify the single most influential spreader, selecting a group of nodes that has the largest k-core value as the seeds cannot increase the performance of the influence maximization because the propagation sphere of this group of nodes is overlapped. To overcome this limitation, we propose a neighborhood coreness cover and discount heuristic algorithm named "NCCDH" to identify a set of influential and decentralized seeds. Using this method, a node in the high-order shell with the largest neighborhood coreness and an uncovered status will be selected as the seed in each turn. In addition, the neighbors within the same shell layer of this seed will be covered, and the neighborhood coreness of the neighbors outside the shell layer will be discounted in the subsequent round. The experimental results show that with increases in the spreading probability, the NCCDH outperforms other algorithms in terms of the affected scale and spreading speed under the Susceptible-Infected-Recovered (SIR) and Susceptible-Infected (SI) models. Furthermore, this approach has a superior running time.

A Novel Approach of Feature Extraction for Analog Circuit Fault Diagnosis Based on WPD-LLE-CSA

  • Wang, Yuehai;Ma, Yuying;Cui, Shiming;Yan, Yongzheng
    • Journal of Electrical Engineering and Technology
    • /
    • v.13 no.6
    • /
    • pp.2485-2492
    • /
    • 2018
  • The rapid development of large-scale integrated circuits has brought great challenges to the circuit testing and diagnosis, and due to the lack of exact fault models, inaccurate analog components tolerance, and some nonlinear factors, the analog circuit fault diagnosis is still regarded as an extremely difficult problem. To cope with the problem that it's difficult to extract fault features effectively from masses of original data of the nonlinear continuous analog circuit output signal, a novel approach of feature extraction and dimension reduction for analog circuit fault diagnosis based on wavelet packet decomposition, local linear embedding algorithm, and clone selection algorithm (WPD-LLE-CSA) is proposed. The proposed method can identify faulty components in complicated analog circuits with a high accuracy above 99%. Compared with the existing feature extraction methods, the proposed method can significantly reduce the quantity of features with less time spent under the premise of maintaining a high level of diagnosing rate, and also the ratio of dimensionality reduction was discussed. Several groups of experiments are conducted to demonstrate the efficiency of the proposed method.

Simulation of stationary Gaussian stochastic wind velocity field

  • Ding, Quanshun;Zhu, Ledong;Xiang, Haifan
    • Wind and Structures
    • /
    • v.9 no.3
    • /
    • pp.231-243
    • /
    • 2006
  • An improvement to the spectral representation algorithm for the simulation of wind velocity fields on large scale structures is proposed in this paper. The method proposed by Deodatis (1996) serves as the basis of the improved algorithm. Firstly, an interpolation approximation is introduced to simplify the computation of the lower triangular matrix with the Cholesky decomposition of the cross-spectral density (CSD) matrix, since each element of the triangular matrix varies continuously with the wind spectra frequency. Fast Fourier Transform (FFT) technique is used to further enhance the efficiency of computation. Secondly, as an alternative spectral representation, the vectors of the triangular matrix in the Deodatis formula are replaced using an appropriate number of eigenvectors with the spectral decomposition of the CSD matrix. Lastly, a turbulent wind velocity field through a vertical plane on a long-span bridge (span-wise) is simulated to illustrate the proposed schemes. It is noted that the proposed schemes require less computer memory and are more efficiently simulated than that obtained using the existing traditional method. Furthermore, the reliability of the interpolation approximation in the simulation of wind velocity field is confirmed.

An adaptive method of multi-scale edge detection for underwater image

  • Bo, Liu
    • Ocean Systems Engineering
    • /
    • v.6 no.3
    • /
    • pp.217-231
    • /
    • 2016
  • This paper presents a new approach for underwater image analysis using the bi-dimensional empirical mode decomposition (BEMD) technique and the phase congruency information. The BEMD algorithm, fully unsupervised, it is mainly applied to texture extraction and image filtering, which are widely recognized as a difficult and challenging machine vision problem. The phase information is the very stability feature of image. Recent developments in analysis methods on the phase congruency information have received large attention by the image researchers. In this paper, the proposed method is called the EP model that inherits the advantages of the first two algorithms, so this model is suitable for processing underwater image. Moreover, the receiver operating characteristic (ROC) curve is presented in this paper to solve the problem that the threshold is greatly affected by personal experience when underwater image edge detection is performed using the EP model. The EP images are computed using combinations of the Canny detector parameters, and the binaryzation image results are generated accordingly. The ideal EP edge feature extractive maps are estimated using correspondence threshold which is optimized by ROC analysis. The experimental results show that the proposed algorithm is able to avoid the operation error caused by manual setting of the detection threshold, and to adaptively set the image feature detection threshold. The proposed method has been proved to be accuracy and effectiveness by the underwater image processing examples.

3D Volumetric Medical Image Coding Using Unbalanced Tree (3차원 불균형 트리 구조를 가진 의료 영상 압축에 대한 연구)

  • Kim, Young-Seop;Cho, Jae-Hoon
    • Journal of the Semiconductor & Display Technology
    • /
    • v.5 no.2 s.15
    • /
    • pp.19-25
    • /
    • 2006
  • This paper focuses on lossy medical image compression methods for medical images that operate on three-dimensional(3-D) irreversible integer wavelet transform. We offer an application of unbalanced tree structure algorithm to medical images, using a 3-D unbalanced wavelet decomposition and a 3-D unbalanced spatial dependence tree. The wavelet decomposition is accomplished with integer wavelet filters implemented with the lifting method. We have tested our encoder on volumetric medical images using different integer filters and coding unit sizes. The coding unit sizes of 16 slices save considerable dynamic memory(RAM) and coding delay from full sequence coding units used in previous works. If we allow the formation of trees of different lengths, then we can accomodate more transaxial scales than three. The encoder and decoder can then keep track of the length of the tree in which each pixel resides through the sequence of decompositions. Results show that, even with these small coding units, our algorithm with certain filters performs as well and better in lossy coding than previous coding systems using 3-D integer unbalanced wavelet transforms on volumetric medical images.

  • PDF

Turning STEP- NC paradigm and delta volume decomposition (선반용 STEP-NC 패러다임 및 델터볼륨 분해 알고리즘)

  • Lee Byeong Eon;Jeong Dae Hyeok;Seo Seok Hwan
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2003.05a
    • /
    • pp.217-224
    • /
    • 2003
  • ISO 14649 is a new interface (or language) standard for the CAD-CAM -CNC chain, currently under establishment by ISO TC184 SCI and SC4 . Upon completion, it will replace ISO 6983, so called M amp; G codes used for CNC since 1950' s. As the new language is being established, a new CNC controller called STEP-CNC (STEP­compliant CNC), capable of carrying out various intelligent tasks using the new language as an input, receives worldwide attention. In this paper, we present a distributed architecture for STEP-NC system based on the generic paradigm of STEP-NC. The STEP-NC system is consisted of 3 sub-systems: 1) CGS (Code Generation System), 2) CES (Code Edit System), and 3) ACS (Autonomous Control System). Also presented in this paper is algorithm for delta volume decomposition, a crucial algorithm for developing CGS. First method is based on the cutting tool and the second method is based on the turning features commonly used in the shop floor. An illustrative example is given to compare the two methods, and to illustrate usage scenario of the delta volume in the turning STEP- NC system under development.

  • PDF

Finite Element Analysis of Shape Rolling Process using Destributive Parallel Algorithms on Cray T3E (병렬 컴퓨터를 이용한 형상 압연공정 유한요소 해석의 분산병렬처리에 관한 연구)

  • Gwon, Gi-Chan;Yun, Seong-Gi
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.24 no.5 s.176
    • /
    • pp.1215-1230
    • /
    • 2000
  • Parallel Approaches using Cray T3E which is NIPP (Massively Parallel Processors) machine are presented for the efficient computation of the finite element analysis of 3-D shape rolling processes. D omain decomposition method coupled with parallel linear equation solver is used. Domain decomposition is applied for obtaining element tangent stifffiess matrices and residual vectors. Direct and iterative parallel algorithms are used for solving the linear equations. Direct algorithm is_parallel version of direct banded matrix solver. For iterative algorithms, the well-known preconditioned conjugate gradient solver with Jacobi preconditioner is also employed. Moreover a new effective iterative scheme with block inverse matrix preconditioner, which is named by present authors, is presented and its results are compared with the one using Jacobi preconditioner. PVM and MPI are used for message passing and synchronization between processors. The performance and efficiency of each algorithm is discussed and comparisons are made among different algorithms.

A Study on Blind Watermarking Technique of Digital Image using 2-Dimensional Empirical Mode Decomposition in Wavelet Domain (웨이블릿 평면에서의 2D-EMD를 이용한 디지털 영상의 블라인드 워터마킹 기술에 관한 연구)

  • Lee, Young-Seock;Kim, Jong-Weon
    • Journal of Internet Computing and Services
    • /
    • v.11 no.2
    • /
    • pp.99-107
    • /
    • 2010
  • In this paper a blind watermarking algorithm for digital image is presented. The proposed method operates in wavelet domain. The watermark is decomposed into 2D-IMFs using BEMD which is the 2-dimensional extension of 1 dimensional empirical mode decomposition. The CDMA based on SS technique is applied to watermark embedding and detection process. In the watermark embedding process, each IMF of watermark is embedded into middle frequency subimages in wavelet domain, so subimages just include partial information about embedded watermark. By characteristics of BEMD, when the partial information of watermark is synthesized, the original watermark is reconstructed. The experimental results show that the proposed watermarking algorithm is imperceptible and moreover is robust against JPEG compression, common image processing distortions.

Dimension-reduction simulation of stochastic wind velocity fields by two continuous approaches

  • Liu, Zhangjun;He, Chenggao;Liu, Zenghui;Lu, Hailin
    • Wind and Structures
    • /
    • v.29 no.6
    • /
    • pp.389-403
    • /
    • 2019
  • In this study, two original spectral representations of stationary stochastic fields, say the continuous proper orthogonal decomposition (CPOD) and the frequency-wavenumber spectral representation (FWSR), are derived from the Fourier-Stieltjes integral at first. Meanwhile, the relations between the above two representations are discussed detailedly. However, the most widely used conventional Monte Carlo schemes associated with the two representations still leave two difficulties unsolved, say the high dimension of random variables and the incompleteness of probability with respect to the generated sample functions of the stochastic fields. In view of this, a dimension-reduction model involving merely one elementary random variable with the representative points set owing assigned probabilities is proposed, realizing the refined description of probability characteristics for the stochastic fields by generating just several hundred representative samples with assigned probabilities. In addition, for the purpose of overcoming the defects of simulation efficiency and accuracy in the FWSR, an improved scheme of non-uniform wavenumber intervals is suggested. Finally, the Fast Fourier Transform (FFT) algorithm is adopted to further enhance the simulation efficiency of the horizontal stochastic wind velocity fields. Numerical examplesfully reveal the validity and superiorityof the proposed methods.

A Soft Output Enhancement Technique for Spatially Multiplexed MIMO Systems (공간다중화 MIMO 시스템을 위한 Soft Output 성능향상 기법)

  • Kim, Jin-Min;Im, Tae-Ho;Kim, Jae-Kwon;Yi, Joo-Hyun;Cho, Yong-Soo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.9C
    • /
    • pp.734-742
    • /
    • 2008
  • In spatially multiplexed MIMO systems that enable high data rate transmission over wireless communication channels, the spatial demultiplexing at the receiver is a challenging task and various demultiplexing methods have been developed. Among the previous methods, maximum likelihood detection with QR decomposition and M-algorithm (QRM-MLD), sphere decoding (SD), QOC, and MOC schemes have been reported to achieve a (near) maximum likelihood (ML) hard decision performance. In general, however, the reliability of soft output of these schemes is not satisfactory. In this paper, we propose a method which enhances the reliability of soft output. By computer simulations, we demonstrate the improved performance by the proposed method.