• Title/Summary/Keyword: 연산 효율

Search Result 2,622, Processing Time 0.028 seconds

An Analysis of Continuous Beam by Material Non-linear Transfer Matrix Method (재료비선형 전달행렬법에 의한 연속보의 해석)

  • Seo, Hyun Su;Kim, Jin Sup;Kwon, Min Ho
    • Journal of the Korea institute for structural maintenance and inspection
    • /
    • v.15 no.1
    • /
    • pp.77-84
    • /
    • 2011
  • This study is to develop nonlinear analysis algorithm for transfer matrix method, which can be applied to continuous beam analysis. Gauss-Lobatto integral rule is adopted and the transfer matrix is derived from stiffness matrix. In the transfer matrix method, the system equation has a constant number of unknowns regardless of number of D.O.F. Therefore, the transfer matrix method has computational efficiencies not only in linear elastic analysis but also in nonlinear analysis. To verify the developed method, the analysis results of several examples are compared with commercial code in moment-curvature, moment-displacement and load-displacement relation.

Optimal Construction of Multiple Indexes for Time-Series Subsequence Matching (시계열 서브시퀀스 매칭을 위한 최적의 다중 인덱스 구성 방안)

  • Lim Seung-Hwan;Park Hee-Jin;Kim Sang-Wook
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2005.07b
    • /
    • pp.193-195
    • /
    • 2005
  • 서브시퀀스 매칭은 주어진 질의 시퀀스와 변화의 추세가 유사한 서브시퀀스들을 시계열 데이터베이스로부터 검색하는 연산이다. 본 논문에서는 크기 효과로 인한 서브시퀀스 매칭의 심각한 성능 저하 현상을 정량적으로 관찰하여, 하나의 윈도우 크기를 대상으로 만든 단 하나의 인덱스만을 이용하는 것은 실제 응용에서 만족할만한 성능을 제공할 수 없다는 것을 규명하였다. 또한, 이러한 문제로 인해 다양한 윈도우 크기를 기반으로 다수의 인덱스들을 구성하여 서브시퀀스 매칭을 수행하는 인덱스 보간법의 응용이 필요함을 보였다. 인덱스 보간법을 응용하여 서비시퀀스 매칭을 수행하기 위해서는 먼저 다수의 인덱스들을 위한 윈도우 크기들을 결정해야 한다. 본 연구에서는 물리적 데이터베이스 설계방식을 이용하여 이러한 최적의 다수의 윈도우 크기들을 선정하는 문제를 해결하였다. 이를 위하여 시계열 데이터베이스에서 수행될 예정인 질의 시퀀스들의 집합과 인덱스 구성의 기반이 되는 윈도우들의 크기의 집합이 주어질 때, 전체 서브시퀀스 매칭들을 수행하는 데에 소요되는 비용을 예측할 수 있는 공식을 산출하였다. 또한, 이 비용 공식을 이용하여 전체 서브시퀀스 매칭들의 성능을 극대화 할 수 있는 최적의 윈도우 크기들을 결정하는 알고리즘을 제안하였으며, 이 알고리즘의 최적성과 효율성을 이론적으로 규명하였다. 끝으로, 실험에 의한 성능 평가를 제안된 기법의 우수성을 제시하였다.

  • PDF

Numerical Characteristics of Hypersonic Air Chemistry and Application of Partially Implicit Time Integration Method (극초음속 공기반응의 수치해석적 특성과 부분 내재적 적분법 적용)

  • Kim, Seong-Lyong;Ok, Ho-Nam;Ra, Seung-Ho;Kim, In-Sun
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.31 no.7
    • /
    • pp.1-8
    • /
    • 2003
  • Numerical characteristics of air chemistry associated with hypersonic flows are described and are compared with those of hydrogen oxygen combustion, applying the partially implicit time integration method to air chemistry. This paper reveals that the time integration of air chemistry needs a chemical Jacobian for stable calculations. However the positive real eigenvalues in air chemistry are relatively smaller than those of hydrogen combustion, and the numerical integration is less sensitive than that with combustion. lt is also found that the application of the partia1ly irnplicit method reduces the computing time without numerical instabilities.

Flexible Batch Signing Techniques for Imbalanced Environments (비대칭환경에 적합한 유동적인 묶음서명 생성기법)

  • Youn, Taek-Young;Lee, Se-Won;Park, Young-Ho;Kim, Chang-Han;Lim, Jong-In
    • Journal of Broadcast Engineering
    • /
    • v.13 no.1
    • /
    • pp.69-78
    • /
    • 2008
  • Batch signature is a cryptographic tool which efficiently generates several signatures for multiple messages. Previously proposed batch signature schemes do not allow a signer to generate a signature immediately for sequentially asked signing queries. In other words, the previous schemes are not applicable when signing requests are not simultaneously given to the signer. In this paper, we propose flexible batch signatures which can provide batch signing for sequential signing requests. Moreover, our schemes are well suited for imbalanced environment where two communicating parties have different computing powers.

Real-time shadow creation technique for a online game (온라인 게임을 위한 실시간 음영 생성 기법)

  • Lee, Sung-Ug;Bae, Jae-Hawan
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2008.05a
    • /
    • pp.635-638
    • /
    • 2008
  • Online games' environments have recently changed with developments of computer technique. Various factors such as respective for realistic expression, solidity, the quality of the material, shadow, should be considered. In these factors, shadow expression plays a important role for realistic one. A lot of repeated operation should be executed to provide shadow. In other words, realm division against a lot of dots to estimate objections and the degree of brightness should be divided. This paper provides effective methods to perform realistic shadow through mapping LOD of objections as shadow without drawing data to judge the realm of shadow for shadow creation.

  • PDF

Overlap Estimation for Panoramic Image Generation (중첩 영역 추정을 통한 파노라마 영상 생성)

  • Yang, Jihee;Jeon, Jihye;Park, Gooman
    • Journal of Satellite, Information and Communications
    • /
    • v.9 no.4
    • /
    • pp.32-37
    • /
    • 2014
  • The panorama is a good alternative to overcome narrow FOV under study in robot vision, stereo camera and panorama image registration and modeling. The panorama can materialize view with angles wider than human view and provide realistic space which make feeling of being on the scene based on realism. If we use all correspondence, it is too difficult to find strong features and correspondences and assume accurate homography matrix in geographic changes in images as load of calculation increases. Accordingly, we used SURF algorithm to estimate overlapping areas with high similarity by comparing and analyzing the input images' histograms and to detect features. And we solved the problem of input order so we can make panorama by input images without order.

Masking-Based Block Cipher LEA Resistant to Side Channel Attacks (부채널 공격에 대응하는 마스킹 기반의 블록 암호 LEA)

  • Park, Eunsoo;Oh, Soohyun;Ha, Jaecheol
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.27 no.5
    • /
    • pp.1023-1032
    • /
    • 2017
  • When a cryptographic device such as smart card performs an encryption for a plain text, an attacker can extract the secret key in it using side channel information. Especially, many researches found some weaknesses for side channel attack on the lightweight block cipher LEA designed to apply in IoT environments. In this paper, we survey several masking countermeasures to defeat the side channel attack and propose a novel masking conversion method. Even though the proposed Arithmetic-to-Boolean masking conversion method requires storage memory of 256 bytes, it can improve the LEA encryption speed up to 17 percentage compared to the case adopted the previous masking method.

3X Serial GF(2m) Multiplier on Polynomial Basis Finite Field (Polynomial basis 방식의 3배속 직렬 유한체 곱셈기)

  • 문상국
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2004.05b
    • /
    • pp.255-258
    • /
    • 2004
  • Efficient finite field operation in the elliptic curve (EC) public key cryptography algorithm, which attracts much of latest issues in the applications in information security, is very important. Traditional serial finite multipliers root from Mastrovito's serial multiplication architecture. In this paper, we adopt the polynomial basis and propose a new finite field multiplier, inducing numerical expressions which can be applied to exhibit 3 times as much performance as the Mastrovito's. We described the proposed multiplier with HDL to verify and evaluate as a proper hardware IP. HDL-implemented serial GF (Galois field) multiplier showed 3 times as fast speed as the traditional serial multiplier's adding only Partial-sum block in the hardware.

  • PDF

A Plastic Product Surface Inspector for 6 Axes Articulated Robot (6축 다관절 로봇용 플라스틱 제품의 표면 검사기)

  • Yun, Jae-Sik;Park, Jong-Hyun;Kim, Jin-Wook;Kim, Seok-Tae
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2010.05a
    • /
    • pp.569-571
    • /
    • 2010
  • In this paper, we develop a vision inspection system for inspecting flaws on plastic products such as insufficient moldings, spots, scratches. The inspection algorithm for this system consist of image binarization for curved structure of plastic products, image noise removal using morphology operation, labeling methods for candidate regions and image filtering and calibration method for flaw inspection. In order to improve its performance, we also develop fast image processing algorithm based on GUI. To verify the effectiveness of this system, we conducted evaluation for the system accuracy and the inspection algorithm processing time.

  • PDF

Extended Pairing Heap Algorithms Considering Cache Effect (캐쉬 효과를 고려한 확장된 Pairing Heap 알고리즘)

  • 정균락;김경훈
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.30 no.5_6
    • /
    • pp.250-257
    • /
    • 2003
  • As the memory access time becomes slower relative to the fast processor speed, most systems use cache memory to reduce the gap. The cache performance has an increasingly large impact on the performance of algorithms. Blocking is the well known method to utilize cache and has shown good results in multiplying matrices and search trees like d-heap. But if we use blocking in the data structures which require rotation during insertion or deletion, the execution time increases as the data movements between blocks are necessary. In this paper, we have proposed the extended pairing heap algorithms using block node and shown by experiments that our structure is superior Also in case of using block node, we use less memory space as the number of pointers decreases.