• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제17권2호
• /
• pp.542-558
• /
• 2023

A digital focus index (DFI) is a value used to determine image focus in scientific apparatus and smart devices. Automatic focus (AF) is an iterative and time-consuming procedure; however, its processing time can be reduced using a general processing unit (GPU) and a multi-core processor (MCP). In this study, parallel architectures of a minimax search algorithm (MSA) are applied to two DFIs: range algorithm (RA) and image contrast (CT). The DFIs are based on a histogram; however, the parallel computation of the histogram is conventionally inefficient because of the bank conflict in shared memory. The parallel architectures of RA and CT are constructed using parallel reduction for MSA, which is performed through parallel relative rating of the image pixel pairs and halved the rating in every step. The array size is then decreased to one, and the minimax is determined at the final reduction. Kernels for the architectures are constructed using open source software to make it relatively platform independent. The kernels are tested in a hexa-core PC and an embedded device using Lenna images of various sizes based on the resolutions of industrial cameras. The performance of the kernels for the DFIs was investigated in terms of processing speed and computational acceleration; the maximum acceleration was 32.6× in the best case and the MCP exhibited a higher performance.

• 대한기계학회논문집
• /
• 제13권3호
• /
• pp.500-507
• /
• 1989

본 논문에서는 흡배기 변동압을 실측하여 이것을 계산의 입력수치로 사용 하는 전산프로그램을 개발하여 간단하면서도 정확한 사이클 시뮬레이션이 가능하도록 하여 체적효율을 예측하였다.

• 한국초전도ㆍ저온공학회논문지
• /
• 제8권4호
• /
• pp.22-25
• /
• 2006

This paper deals with the computation of the current limiting behavior of high-temperature superconducting (HTS) modules for the superconducting fault current limiter (SFCL). The SFCL module consists of a monofilar type BSCCO-2212 tube and a shunt coil made of copper or brass. The shunt coil is connected to the monofilar superconducting tube in parallel. Through analysis of the quench behavior of the monofilar component with shunt coils, it is achieved to drive an equivalent circuit equation from the experimental circuit structure. In order to analyze the quench behavior of the SFCL module, we derived a partial differential equation technique. Inductance of the monofilar component and the impedance of the shunt coil are calculated by Bio-Savart and Ohm's formula, respectively. We computed the quench behavior using the calculated values, and compared the results with experimental results for the quench characteristics of a component. The results of computation and test agreed well each other, and it was concluded that the analytic result could be applied effectively to design of the distribution-level SFCL system.

• 한국정보통신학회논문지
• /
• 제10권8호
• /
• pp.1428-1434
• /
• 2006

RFID 시스템에서 프라이버시 침해 문제를 해결하기 위한 방안 중 백엔드 서버에서의 필수요건인 확장성을 단축하는 기법을 제안한다. 현재 RFID/USN이 큰 이슈가 되면서 RFID에 대한 각종 연구와 응용들이 활발히 진행 중에 있다. 반면에 RFID의 낮은 연산능력과 기억능력으로 개인의 프라이버시 보호 측면에서 여러 문제들을 유발시킨다. 기존 해시 체인 기법은 프라이버시를 침해하는 공격들에 대해서 전방 보안성, 기밀성, 불구분성 등을 모두 보장하는 안전한 기법이다. 그러나 백엔드 서버에서 태그를 식별하기 위한 계산량이 많다는 문제점이 있다. 따라서 본 논문에서는 백 엔드 서버에서의 계산량을 감소하기 위해 키를 효율적으로 찾는 Hellman Method를 적용한다. Hellman Method 알고리즘은 선행계산과 탐색 두 단계로 진행되는 알고리즘이다. 본 논문에서는 해시 체인 기법에 Hellman Method를 적용한 후 병행성을 분석하고 분할적용하여 보안성과 키 검색을 비교하였다. 비교 결과는 기존의 프라이버시 보호를 위한 보안 요건을 모두 보장하면서 키 검색 비교는 기존 방식보다 계산 복잡도를 O(m)에서 $O(\frac{m{^2/3}}{w})$ 으로 단축하여 서버에서의 계산 시간을 단축하였다.

• Structural Engineering and Mechanics
• /
• 제16권5호
• /
• pp.627-641
• /
• 2003

The structural intensity fields of rectangular plates with single cutout and multiple cutouts are studied. The main objective is to examine the effect of the presence of cutouts on the flow pattern of vibrational energy from the source to the sink on a rectangular plate. The computation of the structural intensity is carried out using the finite element method. The magnitude of energy flow is significantly larger at the edges on the plate near the cutout boundary parallel to the energy flow. The effects of cutouts with different shape and size at different positions on structural intensity of a rectangular plate are presented and discussed. A case study on a plate with two cutouts is also presented.

• 산업기술연구
• /
• 제17권
• /
• pp.255-260
• /
• 1997

The analysis of eigenvalue and eigenvector is a crucial procedure for many electromagnetic computation problems. Although it is always the case in practice that only selected eigenpairs are needed, computation of eigenpair still seems to be a time-consuming task. In order to compute the eigenpair more quickly, there are two resorts: one is to select a good algorithm with care and another is to use parallelization technique to improve the speed of the computing. In this paper, one of the best eigensolver, the Davidson method, is parallelized on a cluster of workstations. We apply this scheme to a ridged waveguide design problem and obtain promising linear speedup and scalability.

• 한국지능시스템학회논문지
• /
• 제12권4호
• /
• pp.317-322
• /
• 2002

The major operations of Evolutionary Computation include crossover, mutation, competition and selection. Although selection does not create new individuals like crossover or mutation, a poor selection mechanism may lead to problems such as taking a long time to reach an optimal solution or even not finding it at all. In view of this, this paper proposes a hybrid Evolutionary Programming (EP) algorithm that exhibits a strong capability to move toward the global optimum even when stuck at a local minimum using a synergistic combination of the following three basic ideas. First, a "local selection" technique is used in conjunction with the normal tournament selection to help escape from a local minimum. Second, the mutation step has been improved with respect to the Fast Evolutionary Programming technique previously developed in our research group. Finally, the crossover and mutation operations of the Genetic Algorithm have been added as a parallel independent branch of the search operation of an EP to enhance search diversity.

• 한국국방경영분석학회지
• /
• 제9권1호
• /
• pp.29-49
• /
• 1983

The algorithm developed in this paper utilized kettelle's [1] idea of the undominated allocation sequence and his way of tableau computation to solve the more general spares allocation problem in the system availability optimization. The algorithm is to optimally allocate resources to the independent modules which are connected to be series/parallel/mixed system configurations. It has advantages over the standard dynamic programming algorithm by eliminating the need for backtracking and by solving the allocation problem for any budget size. By careful heuristic inspection the algorithm can be made very efficient for manual calculations because large blocks of cells can be eliminated from computation. A numerical example is provided to illustrate the allocation algorithm.

• 한국전산유체공학회:학술대회논문집
• /
• 한국전산유체공학회 2006년도 추계 학술대회논문집
• /
• pp.7-8
• /
• 2006

The governing equations for high-speed lateral atomizing injector nozzle flow based on the LES-VOF model in conjunction with the CSF model are presented, and then an integrated parallel computation are performed to clarify the detailed atomization process of a high speed nozzle flow and to acquire data which is difficult to confirm by experiment such as atomization length, liquid core shapes, droplets size distributions, spray angle and droplets velocity profiles. According to the present analysis, it is found that the atomization rate and the droplets-gas two-phase flow characteristics are controlled by the turbulence perturbation upstream of the injector nozzle, hydrodynamic instabilities at the gas-liquid interface, shear stresses between liquid core and periphery of the jet. Furthermore, stable and a high-resolution computation can be attained in the high density ratio (pl/ pg = 554) conditions conditions by using our numerical method.

• 한국멀티미디어학회논문지
• /
• 제20권2호
• /
• pp.163-169
• /
• 2017

There are various algorithms evaluating a threshold for image segmentation. Among them, Otsu's algorithm sets a threshold based on the histogram. It finds the between-class variance for all over gray levels and then sets the largest one as Otsu's optimal threshold, so we can see that Otsu's algorithm requires a lot of the computation. In this paper, we improved the amount of computational needs by using estimated Otsu's threshold rather than computing for all the threshold candidates. The proposed algorithm is compared with the original one in computation amount and accuracy. we confirm that the proposed algorithm is about 29 times faster than conventional method on single processor and about 4 times faster than on parallel processing architecture machine.