• Title/Summary/Keyword: Analysis Algorithm

Search Result 12,348, Processing Time 0.032 seconds

Reputation Analysis of Document Using Probabilistic Latent Semantic Analysis Based on Weighting Distinctions (가중치 기반 PLSA를 이용한 문서 평가 분석)

  • Cho, Shi-Won;Lee, Dong-Wook
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.58 no.3
    • /
    • pp.632-638
    • /
    • 2009
  • Probabilistic Latent Semantic Analysis has many applications in information retrieval and filtering, natural language processing, machine learning from text, and in related areas. In this paper, we propose an algorithm using weighted Probabilistic Latent Semantic Analysis Model to find the contextual phrases and opinions from documents. The traditional keyword search is unable to find the semantic relations of phrases, Overcoming these obstacles requires the development of techniques for automatically classifying semantic relations of phrases. Through experiments, we show that the proposed algorithm works well to discover semantic relations of phrases and presents the semantic relations of phrases to the vector-space model. The proposed algorithm is able to perform a variety of analyses, including such as document classification, online reputation, and collaborative recommendation.

Time Historical Response Analysis of Three Dimensional Rectilinear Structure using the TSCM (전달강성계수법을 이용한 3차원 직선형 구조물의 시간이력응답 해석)

  • 문덕홍;강현석;최명수
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.26 no.1
    • /
    • pp.108-115
    • /
    • 2002
  • This paper suggests a new analysis algorithm for the time historical response of three dimensional rectilinear structure which is frequently found in a pipe line system of plant by the combination of the transfer stiffness coefficient method(TSCM) and the Newmark method. The present analysis algorithm for a time historical response can improve the computational accuracy and time remarkably owing to advantages of the TSCM in comparison with transfer matrix method(TMM). The structural system is modeled as a lumped mass system in this method. The analysis algorithm was formulated far the three dimensional rectilinear structure. We confirmed the validity of the present algorithm by comparing the numerical computation results of TSCM with those of TMM.

Route Analysis Algorithm using Fuzzy Reasoning in Route Planning (항로 계획시의 퍼지 항로분석 알고리즘)

  • 구자윤
    • Journal of the Korean Institute of Navigation
    • /
    • v.20 no.3
    • /
    • pp.65-71
    • /
    • 1996
  • Recently, the Track Control System which was separated from the Course Control System so-called Auto-Pilot has been developed for track-keeping in coastal area. From this year, the NAV Sub-committee in IMO commenced to consider the Performance Standard for the Track Control System vigorously. This system will be integrated with ECDIS and IBS so that captain/officers should analysis ship's motion characteristics accurately in the route planning using the electronic nautical charts. In this paper, a new Route Analysis Algorithm using fuzzy reasoning in route planning was proposed for 2, 700 TEU container ship. In order to verify the track-keeping, the author established a ship mathematical model and executed the simulation of the Route Analysis Algorithm at on-line condition with Pentium PC. The results of ship trajectories of the Route Analysis Algorithm were found to be effective to get track control automatically.

  • PDF

A Fast Redundancy Analysis Algorithm in ATE for Repairing Faulty Memories

  • Cho, Hyung-Jun;Kang, Woo-Heon;Kang, Sung-Ho
    • ETRI Journal
    • /
    • v.34 no.3
    • /
    • pp.478-481
    • /
    • 2012
  • Testing memory and repairing faults have become increasingly important for improving yield. Redundancy analysis (RA) algorithms have been developed to repair memory faults. However, many RA algorithms have low analysis speeds and occupy memory space within automatic test equipment. A fast RA algorithm using simple calculations is proposed in this letter to minimize both the test and repair time. This analysis uses the grouped addresses in the faulty bitmap. Since the fault groups are independent of each other, the time needed to find solutions can be greatly reduced using these fault groups. Also, the proposed algorithm does not need to store searching trees, thereby minimizing the required memory space. Our experiments show that the proposed RA algorithm is very efficient in terms of speed and memory requirements.

Structural analysis based on multiresolution blind system identification algorithm

  • Too, Gee-Pinn James;Wang, Chih-Chung Kenny;Chao, Rumin
    • Structural Engineering and Mechanics
    • /
    • v.17 no.6
    • /
    • pp.819-828
    • /
    • 2004
  • A new process for estimating the natural frequency and the corresponding damping ratio in large structures is discussed. In a practical situation, it is very difficult to analyze large structures precisely because they are too complex to model using the finite element method and too heavy to excite using the exciting force method; in particular, the measured signals are seriously influenced by ambient noise. In order to identify the structural impulse response associated with the information of natural frequency and the corresponding damping ratio in large structures, the analysis process, a so-called "multiresolution blind system identification algorithm" which combines Mallat algorithm and the bicepstrum method. High time-frequency concentration is attained and the phase information is kept. The experimental result has demonstrated that the new analysis process exploiting the natural frequency and the corresponding damping ratio of structural response are useful tools in structural analysis application.

Mixed Noise Cancellation by Independent Vector Analysis and Frequency Band Beamforming Algorithm in 4-channel Environments (4채널 환경에서 독립벡터분석 및 주파수대역 빔형성 알고리즘에 의한 혼합잡음제거)

  • Choi, Jae-Seung
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.14 no.5
    • /
    • pp.811-816
    • /
    • 2019
  • This paper first proposes a technique to separate clean speech signals and mixed noise signals by using an independent vector analysis algorithm of frequency band for 4 channel speech source signals with a noise. An improved output speech signal from the proposed independent vector analysis algorithm is obtained by using the cross-correlation between the signal outputs from the frequency domain delay-sum beamforming and the output signals separated from the proposed independent vector analysis algorithm. In the experiments, the proposed algorithm improves the maximum SNRs of 10.90dB and the segmental SNRs of 10.02dB compared with the frequency domain delay-sum beamforming algorithm for the input mixed noise speeches with 0dB and -5dB SNRs including white noise, respectively. Therefore, it can be seen from this experiment and consideration that the speech quality of this proposed algorithm is improved compared to the frequency domain delay-sum beamforming algorithm.

Probabilistic Analysis of JPV Prime Generation Algorithm and its Improvement (JPV 소수 생성 알고리즘의 확률적 분석 및 성능 개선)

  • Park, Hee-Jin;Jo, Ho-Sung
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.35 no.2
    • /
    • pp.75-83
    • /
    • 2008
  • Joye et al. introduced a new prime generation algorithm (JPV algorithm hereafter), by removing the trial division from the previous combined prime generation algorithm (combined algorithm hereafter) and claimed that JPV algorithm is $30{\sim}40%$ faster than the combined algorithm. However, they only compared the number of Fermat-test calls, instead of comparing the total running times of two algorithms. The reason why the total running times could not be compared is that there was no probabilistic analysis on the running time of the JPV algorithm even though there was a probabilistic analysis for the combined algorithm. In this paper, we present a probabilistic analysis on the running time of the JPV algorithm. With this analytic model, we compare the running times of the JPV algorithm and the combined algorithm. Our model predicts that JPV algorithm is slower than the combined algorithm when a 512-bit prime is generated on a Pentium 4 system. Although our prediction is contrary to the previous prediction from comparing Fermat-test calls, our prediction corresponds to the experimental results more exactly. In addition, we propose a method to improve the JPV algorithm. With this method, the JPV algorithm can be comparable to the combined algorithm with the same space requirement.

Analysis on Vulnerability of Masked SEED Algorithm (마스킹 기법이 적용된 SEED 알고리즘에 대한 취약점 분석)

  • Kim, TaeWon;Chang, Nam Su
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.25 no.4
    • /
    • pp.739-747
    • /
    • 2015
  • Masking technique that is most widely known as countermeasure against power analysis attack prevents leakage for sensitive information during the implementations of cryptography algorithm. it have been studied extensively until now applied on block cipher algorithms. Masking countermeasure have been applied to international standard SEED algorithm. Masked SEED algorithm proposed by Cho et al, not only protects against first order power analysis attacks but also efficient by reducing the execution of Arithmetic to Boolean converting function. In this paper, we analyze the vulnerability of Cho's algorithm against first order power analysis attacks. We targeted additional pre-computation to improve the efficiency in order to recover the random mask value being exploited in first order power analysis attacks. We describe weakness by considering both theoretical and practical aspects and are expecting to apply on every device equipped with cho's algorithm using the proposed attack method.

Improvement of Iterative Algorithm for Live Variable Analysis based on Computation Reordering (사용할 변수의 예측에 사용되는 반복적 알고리즘의 계산순서 재정렬을 통한 수행 속도 개선)

  • Yun Jeong-Han;Han Taisook
    • Journal of KIISE:Software and Applications
    • /
    • v.32 no.8
    • /
    • pp.795-807
    • /
    • 2005
  • The classical approaches for computing Live Variable Analysis(LVA) use iterative algorithms across the entire programs based on the Data Flow Analysis framework. In case of Zephyr compiler, average execution time of LVA takes $7\%$ of the compilation time for the benchmark programs. The classical LVA algorithm has many aspects for improvement. The iterative algorithm for LVA scans useless basic blocks and calculates large sets of variables repeatedly. We propose the improvement of Iterative algorithm for LVA based on used variables' upward movement. Our algorithm produces the same result as the previous iterative algorithm. It is based on use-def chain. Reordering of applying the flow equation in DFA reduces the number of visiting basic blocks and redundant flow equation executions, which improves overall processing time. Experimental results say that our algorithm ran reduce $36.4\%\;of\;LVA\;execution\;time\;and\;2.6\%$ of overall computation time in Zephyr compiler with benchmark programs.

New Nonlinear Analysis Algorithm Using Equivalent Load for Stiffness (강성등가하중을 이용한 새로운 비선형해석 알고리즘)

  • Kim, Yeong-Min;Kim, Chee-Kyeong;Kim, Tae-Jin
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.20 no.6
    • /
    • pp.731-742
    • /
    • 2007
  • This paper presents a new nonlinear analysis algorithm, that is, adaptive Newton-Raphson iteration method, The presented algorithm is based on the existing Newton-Raphson method, and the concept of it can be summarized as calculating the equivalent load for stiffness(ELS) and adapting this to the initial global stiffness matrix which has already been calculated and saved in initial analysis and finally calculating the correction displacements for the nonlinear analysis, The key characteristics of the proposed algorithm is that it calculates the inverse matrix of the global stiffness matrix only once irresponsive of the number of load steps. The efficiency of the proposed algorithm depends on the ratio of the active Dofs - the Dofs which are directly connected to the members of which the element stiffness are changed - to the total Dofs, and based on this ratio by using the proposed algorithm as a complementary method to the existing algorithm the efficiency of the nonlinear analysis can be improved dramatically.