• 한국정보보호학회:학술대회논문집
• /
• 한국정보보호학회 1995년도 종합학술발표회논문집
• /
• pp.163-172
• /
• 1995

In this paper, the bit-level 1-dimensionl systolic array for modular multiplication are designed. First of all, the parallel algorithms and data dependence graphs from Walter's Iwamura's methods based on Montgomery Algorithm for modular multiplication are derived and compared. Since Walter's method has the smaller computational index points in data dependence graph than Iwamura's, it is selected as the base algorithm. By the systematic procedure for systolic array design, four 1-dimensional systolic arrays ale obtained and then are evaluated by various criteria. Modifying the array derived from 〔0,1〕 projection direction by adding a control logic and serializing the communication paths of data A, optimal 1-dimensional systolic array is designed. It has constant I/O channels for modular expandable and is good for fault tolerance due to unidirectional paths. And so, it is suitable for RSA Cryptosystem which deals with the large size and many consecutive message blocks.

• ETRI Journal
• /
• 제38권5호
• /
• pp.896-902
• /
• 2016

Luby transform (LT) codes were the first practical rateless erasure codes proposed in the literature. The performances of these codes, which are iteratively decoded using belief propagation algorithms, depend on the degree distribution used to generate the coded symbols. The existence of degree-one coded symbols is essential for the starting and continuation of the decoding process. The absence of a degree-one coded symbol at any instant of an iterative decoding operation results in decoding failure. To alleviate this problem, we proposed a method used in the absence of a degree-one code symbol to overcome a stuck decoding operation and its continuation. The simulation results show that the proposed approach provides a better performance than a conventional LT code and memory-based robust soliton distributed LT code, as well as that of a Gaussian elimination assisted LT code, particularly for short data lengths.

• Journal of applied mathematics & informatics
• /
• 제9권1호
• /
• pp.239-252
• /
• 2002

A sort sequence $S_n$ is sequence of all unordered pairs of indices in $I_n$={1,2,…n}. With a sort sequence $S_n$ = ($s_1,S_2,...,S_{\frac{n}{2}}$),one can associate a predictive sorting algorithm A($S_n$). An execution of the a1gorithm performs pairwise comparisons of elements in the input set X in the order defined by the sort sequence $S_n$ except that the comparisons whose outcomes can be inferred from the results of the preceding comparisons are not performed. A sort sequence is said to be extremal if it maximizes a given objective function. First we consider the extremal sort sequences with respect to the objective function $\omega$($S_n$) - the expected number of tractive predictions in $S_n$. We study $\omega$-extremal sort sequences in terms of their prediction vectors. Then we consider the objective function $\Omega$($S_n$) - the minimum number of active predictions in $S_n$ over all input orderings.

• 전자공학회논문지B
• /
• 제33B권9호
• /
• pp.62-69
• /
• 1996

In this paper, the bit-level 1-dimensional systolic array for modular multiplication is designed. First of all, the parallel algorithm and data dependence graph from walter's method based on montgomery algorithm suitable for array design for modular multiplication is derived. By the systematic procedure for systolic array design, four 1-dimensional systolic arrays are obtained and then are evaluated by various criteria. As it is modified the array which is derived form [0,1] projection direction by adding a control logic and it is serialized the communication paths of data A, optimal 1-dimensional systolic array is designed. It has constant I/O channels for expansile module and it is easy for fault tolerance due to unidirectional paths. It is suitable for RSA cryptosystem which deals iwth the large size and many consecutive message blocks.

• 산업경영시스템학회지
• /
• 제32권4호
• /
• pp.192-202
• /
• 2009

Disassembly of products at their end-of-life (EOL) is a prerequisite for recycling or remanufacturing, since most products should be disassembled before being recycled or remanufactured as secondary parts or materials. In disassembly sequence planning of EOL products, considered are the uncertainty issues, i.e., defective parts or joints in an incoming product, disassembly damage, and imprecise net profits and costs. The paper deals with the problem of determining the disassembly level and corresponding sequence, with the objective of maximizing the overall profit under uncertainties in disassembly cost and/or revenue. The solution is represented as the longest path on a directed acyclic graph where parameter (arc length) uncertainties are modeled in the form of intervals. And, a heuristic algorithm is developed to find a path with the minimum worst case regret, since the problem is NP-hard. Computational experiments are carried out to show the performance of the proposed algorithm compared with the mixed integer programming model and Conde's heuristic algorithm.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2019년도 추계학술발표대회
• /
• pp.657-659
• /
• 2019

본 논문에서는 피부 이미지에서 건선 병변만을 가장 효과적으로 분할 할 수 있는 분할기법 선별을 목표로 한다. Interactive graph cuts (IGC)와 Level set method (LSM)를 사용하여 건선 영역을 분할한 후 Jaccard Index (JI)와 Dice Similarity Coefficient (DSC)을 사용하여 건선 영역에 효과적인 분할 방법을 제안한다.

• ETRI Journal
• /
• 제41권4호
• /
• pp.437-451
• /
• 2019

Outlier detection techniques play an important role in enhancing the reliability of data communication in wireless sensor networks (WSNs). Considering the importance of outlier detection in WSNs, many outlier detection techniques have been proposed. Unfortunately, most of these techniques still have some potential limitations, that is, (a) high rate of false positives, (b) high time complexity, and (c) failure to detect outliers online. Moreover, these approaches mainly focus on either temporal outliers or spatial outliers. Therefore, this paper aims to introduce novel algorithms that successfully detect both temporal outliers and spatial outliers. Our contributions are twofold: (i) modifying the Hampel Identifier (HI) algorithm to achieve high accuracy identification rate in temporal outlier detection, (ii) combining the Gaussian process (GP) model and graph-based outlier detection technique to improve the performance of the algorithm in spatial outlier detection. The results demonstrate that our techniques outperform the state-of-the-art methods in terms of accuracy and work well with various data types.

• 인터넷정보학회논문지
• /
• 제20권1호
• /
• pp.125-133
• /
• 2019

Company A should maintain myriad conversion tools for the purpose of making a geometric compilation of navigation maps. Company A is already using complex compilation tools, which are tailored to geographical areas and various GPS models. However, due to frequent requirement and personnel changes, there is an endless challenge for perfect tool configuration and multiple map consolidation. To solve this problem, Company A launched a process automation project using Graphviz, which is an open source workflow graph visualization software. Before implementation, they had to document their current map compilation processes and then match it with the applicable conversion tool. For effective representation of process controls, a new graphical process notation is designed, i.e. Y Block diagram. The authors will compare Y Block diagram with other process notations and explain why Y Block diagram is more useful for tool based business processes such as digital map generation processes.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2009년도 춘계학술발표대회
• /
• pp.706-709
• /
• 2009

The informatization of Korea is accompanied by the great growth of new strategic export industry, as of mobile phone or semiconductor LCD. Speaking to the situation of mobile phone, Motorola swept over the American domestic market in the beginning of 1990s, digital mobile communication as CDMA developed swiftly in Korea. In 1996, the first year's CDMA users of Samsung were merely one million, nevertheless, the world's sales in the first half of this year is up to 92 million. In this p aper I design 3D application based on J2ME and implement a freely removable 3D object which happened in a 3D scen e by receiving the keyboard response of mobile device with WTK (Wireless ToolKit) simulator. It contains benefits of improvement of relative speed and high-level functionality such as scene graph, keyframe animation, etc.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2024년도 춘계학술발표대회
• /
• pp.692-695
• /
• 2024

With the recent advancements in artificial intelligence (AI), the performance of deep learning-based audio deepfake technology has significantly improved. This technology has been exploited for criminal activities, leading to various cases of victimization. To prevent such illicit outcomes, this paper proposes a deep learning-based audio deepfake detection model. In this study, we propose CoNSIST, an improved audio deepfake detection model, which incorporates three additional components into the graph-based end-to-end model AASIST: (i) Squeeze and Excitation, (ii) Positional Encoding, and (iii) Reformulated HS-GAL, This incorporation is expected to enable more effective feature extraction, elimination of unnecessary operations, and consideration of more diverse information, thereby improving the performance of the original AASIST. The results of multiple experiments indicate that CoNSIST has enhanced the performance of audio deepfake detection compared to existing models.