• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 1999년도 추계학술대회 및 정기총회 : 정보통신기술의 활용과 21세기 전자상거래
• /
• pp.172-172
• /
• 1999

• 대한수학회지
• /
• 제55권1호
• /
• pp.43-58
• /
• 2018

In this paper, we study a delayed predator-prey system with Holling type IV functional response incorporating the effect of habitat complexity. The results show that there exist stability switches and Hopf bifurcation occurs while the delay crosses a set of critical values. The explicit formulas which determine the direction and stability of Hopf bifurcation are obtained by the normal form theory and the center manifold theorem.

• 한국멀티미디어학회논문지
• /
• 제21권10호
• /
• pp.1131-1141
• /
• 2018

Motion Estimation which is used to reduce the redundant data plays an important role in video compressions. However, it requires huge computational complexity of the encoder part. And therefore many fast motion estimation methods has been developed to reduce complexity. Multi-view video is obtained by using many cameras at different positions and its complexity increases in proportion to the number of cameras. In this paper, we proposed a fast motion estimation method for multi-view video. The proposed method predicts a search start point by using correlated candidate vectors of the current block. According to the motion size of the start search point, a search start pattern of the current block is decided adaptively. The proposed method proves to be about 2 ~ 5 times faster than existing methods while maintaining similar image quality and bitrates.

• 한국전자통신학회논문지
• /
• 제7권3호
• /
• pp.545-551
• /
• 2012

본 논문에서는 류수 계산의 복잡성과 소인수분해의 어려움을 덫으로 하는 IQC(Imaginary Quadratic Cryptosystem)에 기반을 둔 새로운 암호계를 제안한 다음, 그의 암호화와 복호화 시간을 줄이는 효율적인 알고리즘을 제시하기로 한다. 또한 제안하는 암호계의 안전성을 쉽게 알 수 있도록, 그 암호계의 가장 간단한 예를 들어 그 암호계에 사용되는 공개키 또는 비밀키의 복잡도와 안전성을 분석하고 제안된 암호계의 작동과정을 소개하기로 한다.

• JSTS:Journal of Semiconductor Technology and Science
• /
• 제16권1호
• /
• pp.118-125
• /
• 2016

This paper presents a new high-efficient algorithm and architecture for an elliptic curve cryptographic processor. To reduce the computational complexity, novel modified Lopez-Dahab scalar point multiplication and left-to-right algorithms are proposed for point multiplication operation. Moreover, bit-serial Galois-field multiplication is used in order to decrease hardware complexity. The field multiplication operations are performed in parallel to improve system latency. As a result, our approach can reduce hardware costs, while the total time required for point multiplication is kept to a reasonable amount. The results on a Xilinx Virtex-5, Virtex-7 FPGAs and VLSI implementation show that the proposed architecture has less hardware complexity, number of clock cycles and higher efficiency than the previous works.

• 전자공학회논문지A
• /
• 제32A권6호
• /
• pp.104-110
• /
• 1995

In this paper, an effective method for the minimization of two-level Reed-muller expressions by cube selection whcih considers functional complexity is presented. In contrast to the previous methods which use Xlinking operations to join two cubes for minimizatio, the cube selection method tries to select cubes one at a time until they cover the ON-set of the given function. This method works for most benchmark circuits, but for parity-type functions it shows power performance. To solve this problem, a cost function which computes the functional complexity instead of only the size of ON-set of the function is used. Therefore the optimization is performed considering how the trun minterms are grouped together so that they can be realized by only a small number of cubes. In other words, it considers how the function is changed and how the change affects the next optimization step. Experimental results shows better performance in many cases including parity-type functions compared to pervious results.

• 한국전자통신학회논문지
• /
• 제6권1호
• /
• pp.20-26
• /
• 2011

본 논문에서는 NM(node monitoring) 알고리듬과 NP(Piecewise Linear Function Approximation)를 사용해서 LDPC 코드 복호의 복잡도를 감소시키기 위한 효율적인 알고리듬을 제안한다. 이 NM 알고리듬은 새로운 node-threshold 방법과 message passing 알고리듬에 근거해서 제안되었는데, 이에 NP 방법을 사용해서 알고리듬의 복잡도를 더 줄일 수 있었다. 이 알고리듬의 효율성을 입증하기 위해서 모의 실험을 하였다. 모의실험결과, 기존에 잘 알려진 방법에 비해서 20% 정도 더 효율적이었다.

• 감성과학
• /
• 제16권4호
• /
• pp.567-578
• /
• 2013

The research is a correlational study to look for causes and factors relating to the design of written documents (professional reading materials) and identify those relationships that are useful for communication designers. The research specifically targeted the relationships between perception and reader's past experiences and appearance of the written documents. A preliminary survey, such as interviews, discussions, questionnaires and brainstorming sessions are conducted to establish the observable attributes related to perception which are reader's interests, importance of information and written documents complexity. Finally, the research used Structural Equation Model (SEM) to identify significant differences and analyze strong and weak correlations between these attributes. In general, the results of the study shows that the attribute appearances of a written documents with excellent visualizations for information display shows a strong correlation with interests while the attributes importance is weakly correlated with the complexity of the documents.

• 한국전자통신학회논문지
• /
• 제10권11호
• /
• pp.1231-1238
• /
• 2015

본 논문에서는 노드 모니터링(NM)과 Piecewise Linear Function Approximation(: NP)을 사용하여 LDPC 디코딩 알고리듬의 계산복잡도를 감소시키는 알고리듬을 제안한다. 이 알고리듬은 기존의 알고리듬보다도 더 효율적이다. 제안된 알고리즘이 기존의 방법보다도 개선되었다는 것을 확인하기 위해서 모의실험을 하였다. 실험결과, 제안된 알고리즘의 계산은 기존의 방법에 비해 약 20 % 향상되었음을 확인하였다.

• 한국정보보호학회:학술대회논문집
• /
• 한국정보보호학회 1991년도 학술발표논문집
• /
• pp.40-48
• /
• 1991

McEliece 공개키 암호체계에 대한 새로운 암호해독적 공격이 제시되어진다. 기존의 암호해독 algorithm이 exponential-time의 complexity를 가지는 반면, 본고에서 제시되어지는 algorithm은 polynomial-time의 complexity를 가진다. 모든 linear codes에는 systematic generator matrix가 존재한다는 사실이 본 연구의 동기가 된다. Public generator matrix로부터, 암호해독에 사용되어질 수 있는 새로운 trapdoor generator matrix가 Gauss-Jordan Elimination의 역할을 하는 일련의 transformation matrix multiplication을 통해 도출되어진다. 제시되어지는 algorithm의 계산상의 complexity는 주로 systematic trapdoor generator matrix를 도출하기 위해 사용되는 binary matrix multiplication에 기인한다. Systematic generator matrix로부터 쉽게 도출되어지는 parity-check matrix를 통해서 인위적 오류의 수정을 위한 Decoding이 이루어진다.