• 디지털융복합연구
• /
• 제20권1호
• /
• pp.293-299
• /
• 2022

본 연구는 간편송금 서비스의 간소화에 따른 사용자의 불안감 해소방안에 관한 연구이다. 기술의 발전으로 금융 서비스는 점차 간소화되고 있지만, 오히려 사용자의 불안감은 증가하는 캐즘(chasm)이 발생한다. 연구 방법은 1차로 사용자의 기술 수용에 영향을 미치는 요인을 제시한 통합기술수용모형(UTAUT)의 요인을 기반으로 설문을 통해 서비스에 관한 인식과 기술 수용 의지를 알아보았다. 2차로 휴리스틱 방법론을 통해 도출한 송금 상황의 실시간 추적기능(tracking)을 제시한 후, 신뢰도와 이용 지속 의도에 관하여 심층 인터뷰하였다. 실험 결과 명확한 피드백의 제공은 서비스에 대한 사용자의 불안감 해소에 긍정적 영향을 주는 것으로 나타났다. 기술 수용의 캐즘과 관련해 디자인의 관점으로 접근한 연구가 활발히 이루어지길 기대한다.

• 대한전자공학회논문지
• /
• 제19권3호
• /
• pp.19-27
• /
• 1982

LSI, 프린트 기판등의 배치 문제에 있어서의 목적 함수로써 총배선장의 최소화, 통과선선의 최소화가 지금까지 채용되어 왔었다. 이 목적 함수는 layout의 궁극적인 목표(100% 결선률)를 대국적으로는 반영하고 있다고 말할 수 있지만 국기적으로 혼잡한 배선 상태를 나타내고 있지 않기 때문에 목적 함수로써 불충분한 경우가 많이 보여 지고 있다. 본 논문에서는 국소적인 배선 혼잡도를 나타내기 위해 쎄그먼트(segment) 혼잡도라고 하는 새로운 개념을 도입하여 이 쎄그먼트 혼잡도를 최소로 하는 것을 목적 함수로 하는 것을 제안하였다. 그리고 이 목적 함수를 최적화 하기 위해 능률 좋은 휴리스틱 알고리즘을 제안하고 프로그램 실험에 의해 그 유용성을 확인하였다. 쎄그먼트 혼잡도의 최대치는 총배선장이 짧게 되면 적게 되고 총배선장이 길게 되면 크게 되는 것이 실험의 결과로 얻어져 총배선장을 ?게 하고 동시에 쌔그먼트 혼잡도의 최대치를 적게 하는 제어 파라미터 (혼잡도 Parameter)의 값의 범위를 실험적으로 구하였다.

• Journal of applied mathematics & informatics
• /
• 제25권1_2호
• /
• pp.217-229
• /
• 2007

In this paper, Genetic Algorithm (GA) is used to find the Maximum Weight Independent Set (MWIS) of a graph. First, MWIS problem is formulated as a 0-1 integer programming optimization problem with linear objective function and a single quadratic constraint. Then GA is implemented with the help of this formulation. Since GA is a heuristic search method, exact solution is not reached in every run. Though the suboptimal solution obtained is very near to the exact one. Computational result comprising an average performance is also presented here.

• ETRI Journal
• /
• 제15권3_4호
• /
• pp.1-26
• /
• 1994

Simulated annealing is an attractive, but expensive, heuristic method for approximating the solution to combinatorial optimization problems. Attempts to parallel simulated annealing, particularly on distributed memory multicomputers, are hampered by the algorithm's requirement of a globally consistent system state. In a multicomputer, maintaining the global state S involves explicit message traffic and is a critical performance bottleneck. To mitigate this bottleneck, it becomes necessary to amortize the overhead of these state updates over as many parallel state changes as possible. By using this technique, errors in the actual cost C(S) of a particular state S will be introduced into the annealing process. This paper places analytically derived bounds on this error in order to assure convergence to the correct optimal result. The resulting parallel simulated annealing algorithm dynamically changes the frequency of global updates as a function of the annealing control parameter, i.e. temperature. Implementation results on an Intel iPSC/2 are reported.

• 제어로봇시스템학회논문지
• /
• 제17권7호
• /
• pp.651-658
• /
• 2011

An efficient modified $D^*$ lite algorithm is suggested, which can perform online path planning for mobile robots in dynamic indoor environment. Online path planning should plan and execute alternately in a short time, and hence it enables the robot avoid unknown dynamic obstacles which suddenly appear on robot's path. Based on $D^*$ Lite algorithm, we improved representation of edge cost, heuristic function, and priority queue management, to build a modified $D^*$ Lite algorithm. Performance of the proposed algorithm is revealed via extensive simulation study.

• 대한산업공학회지
• /
• 제21권3호
• /
• pp.409-428
• /
• 1995

Job shop scheduling with m different machines and n different jobs is a NP-hard problem of combinatorial optimization. The purpose of the paper is to develop the heuristic method using tabu search for job shop scheduling to minimize makespan or mean flowtime. To apply tabu search to job shop scheduling problem, in this paper we propose the several move methods that employ insert moves in order to generate the neighbor solutions, and present the efficient rescheduling procedure that yields active schedule for a changed operation sequence by a move of operations. We also discuss the tabu search techniques of diversifying the search of solution space as well as the simple tabu search. By experiments, we find the appropriate tabu list size and tabu attributes, and analyze the proposed tabu search techniques with respect to the quality of solutions and the efforts of computation. The experimental results show that the proposed tabu search techniques using long-term memory function have the ability to search a good solution, and are more efficient in the mean flowtime minimization problem than in the makespan minimization.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 하계종합학술대회 논문집(3)
• /
• pp.161-164
• /
• 2000

We propose the genetic algorithm to apply three kinds of FFT data flows to be considered the overhead for the data exchange between processors that have the multi-scheduling problem on parallel computer In the design of genetic algorithm, we propose the chromosome representation which can simply encode and decode a solution without any heuristic information, the evaluation function to be considered an efficiency of processor, and the genetic operator to inherit a superior gene from their parents. And we saw that the simulation result can verify better performance than the existing algorithm(BEA : binary exchange algorithm)in the face of execution time.

• 한국공작기계학회논문집
• /
• 제12권3호
• /
• pp.82-88
• /
• 2003

SGA(Single Genetic Algorithm) is a heuristic global optimization method based on the natural characteristics and uses many populations and stochastic rules. Therefore SGA needs many function evaluations and takes much time for convergence. In order to solve the demerits of SGA, ${\mu}GA$(Micro-Genetic Algorithm) has recently been developed. In this study, ${\mu}GA$ which have small populations and fast convergence rate, was applied to structural optimization with discrete or integer variables such as 3, 10 and 25 bar trusses. The optimized results of ${\mu}GA$ were compared with those of SGA. Solutions of ${\mu}GA$ for structural optimization were very similar or superior to those of SGA, and faster convergence rate was obtained. From the results of examples, it is found that ${\mu}GA$ is a suitable and very efficient optimization algorithm for structural design.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권4호
• /
• pp.822-839
• /
• 2011

Group key agreement protocols derive a shared secret key for a group of users to ensure data confidentiality or/and integrity among the users in the subsequent communications. In this paper, we inspect two group key agreement schemes which have been proposed by Shi et al. and Zheng et al. in 2005 and 2007 respectively. Although both schemes were claimed to be secure in a heuristic way, we reveal several flaws using the Bellare-Rogaway security model extended to multi-party setting by Bresson et al. These flaws are found to be originated from inappropriate selection of key derivation function, inadvertent exclusion of partners' identities from the protocol specification and insufficient consideration in preserving known temporary information security and key freshness properties. Furthermore, we suggest and discuss proper countermeasures to address such flaws.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회/대한산업공학회 2005년도 춘계공동학술대회 발표논문
• /
• pp.614-620
• /
• 2005

Ensemble에서 feature selection은 각 classifier의 학습할 데이터의 변수를 다르게 하여 diversity를 높이며, 이것은 일반적인 성능향상을 가져온다. Feature selection을 할 때 쓰는 방법 중의 하나가 Genetic Algorithm (GA)이며, GA-SVM은 GA를 기본으로 한 wrapper based feature selection mechanism으로 response model과 keystroke dynamics identity verification model을 만들 때 좋은 성능을 보였다. 하지만 population 안의 후보들간의 diversity를 보장해주지 못한다는 단점 때문에 classifier들의 accuracy와 diversity의 균형을 맞추기 위한 heuristic parameter setting이 존재하며 이를 조정해야만 하였다. 우리는 GA-SVM 알고리즘을 바탕으로, population안 후보들의 fitness를 측정할 때 accuracy와 diversity 둘 다 고려하는 fitness function을 도입하여 추가적인 classifier 선택 작업을 제거하면서 성능을 유지시키는 방안을 연구하였으며 결과적으로 알고리즘의 복잡성을 줄이면서도 모델의 성능을 유지시켰다.