• International Journal of Internet, Broadcasting and Communication
• /
• 제11권3호
• /
• pp.49-58
• /
• 2019

Efficient evidential reasoning is an important issue in the development of advanced knowledge based systems. Efficiency is closely related to the design of problems solving methods adopted in the system. The explicit modeling of problem-solving structures is suggested for efficient and effective reasoning. It is pointed out that the problem-solving method framework is often too coarse-grained and too abstract to specify the detailed design and implementation of a reasoning system. Therefore, as a key step in developing a new reasoning scheme based on properties of the problem, the problem-solving method framework is expanded by introducing finer grained problem-solving primitives and defining an overall control structure in terms of these primitives. Once the individual components of the control structure are defined in terms of problem solving primitives, the overall control algorithm for the reasoning system can be represented in terms of a finite state diagram.

• 한국음향학회지
• /
• 제19권1호
• /
• pp.78-83
• /
• 2000

디지털 이동통신 단말기에서 사용되는 보코더는 통화 품질을 높이기 위하여 새로운 알고리즘들을 채택함에 따라 서로 다른 알고리즘을 사용하는 단말기간의 통신이 문제가 된다. 본 논문에서는 8kbps QCELP 및 13kbps QCELP 보코더 알고리즘을 하나의 DSP 칩에 효율적으로 구현함으로써 이러한 단말기 사이의 통신 문제를 해결하였다. 또한 QCELP 보코더 알고리즘을 실시간 구현하는데 있어 계산량 감소를 위한 단계별 최적화 방법에 대하여 기술하였다. 알고리즘 레벨, 수식 레벨, 코딩 레벨 등의 단계별 최적화 과정을 통하여 계산량이 가장 큰 부분인 코드북 검색 루프에서 약 50% 정도의 계산량을 감소하여 8kbps QCELP는 25 MIPS, 13kbps QCELP는 33 MIPS에 각각 구현하였다. 실시간 구현에 사용한 DSP는 자체 설계한 16 비트 고정소수점 DSP로써 보코더 알고리즘의 구현에 적합하도록 설계되었고, 저전력을 실현하기 위하여 범용의 DSP에 비해 매우 간단한 구조를 가지고 있다.

• Journal of information and communication convergence engineering
• /
• 제8권3호
• /
• pp.251-257
• /
• 2010

The realization of u-City is coming near in some local governments by applying various city services, namely, u-City services to the city construction field to improve competitiveness of the city. But it is a reality that some local governments are experiencing many trial and errors in application of the u-City service in addition to the problem posing that the u-City service is not considering characteristics of development or application environment of an individual city. The present research proposes a service model for on-site application of the u-City service to solve this problem. The proposed model suggests a method for specifically conceptualizing and objectifying the on-site application that the existing concept-oriented model or an architecture-oriented model, etc. didn't provide. The verification system on effectiveness or effects of the u-City service model to remove ambiguity on the u-City service especially. The verification system of the u-City service model grasps the technology, function, procedure and target, etc. that the u-City service contains, evaluates whether the model satisfies conditions that the model should have, and secures objectivity and predictability of the u-City service model through confirmation on propriety, implementation and effectiveness, etc.

• 한국전자통신학회논문지
• /
• 제14권4호
• /
• pp.637-644
• /
• 2019

본 논문은 일반 그래프 최적화(g2o, General Graph Optimization)를 사용하여 그래프 기반 SLAM을 구현한 결과를 기술한다. 일반 그래프 최적화는 SLAM을 노드와 엣지의 그래프를 통하여 표현한다. 노드는 시간에 따른 로봇의 위치를 나타내며, 엣지는 노드들 사이의 구속 조건을 나타낸다. 구속 조건은 센서에 의한 측정값에 의해 결정된다. 일반 그래프 최적화는 구속 조건에 의해 결정되는 성능지표를 최적화하여 SLAM 문제를 해결한다. 실현된 일반 그래프 최적화 방법을 SLAM 방법의 성능 시험용으로 공개된 실험 데이터를 사용하여 검증하였다.

• 대한중풍순환신경학회지
• /
• 제18권1호
• /
• pp.1-11
• /
• 2017

It is difficult to combine oriental and western medicine. Each medicine has a different academic background, perspective on the world, and studying methodology. The claim that two paradigms can not be combined is not obtained from an actual verification, but this means it is so hard to combine two medicines having different backgrounds. The amalgamation of oriental and western medicine should be phased in on the basis of the continuous reciprocal understanding and commitment. First, the strength and weakness of each medicine over the treatment and research are required to be identified. Then, a few complementary areas can be chosen enabling a trial of fusion on a small scale. A cycle of problem solving and a new research can be set by analyzing research results obtained through the implementation over a period of time. In other words, the researchers of oriental and western medicine should repeat a continuous and gradual complementary research process by identifying issues to be improved and complemented through a consensus. Once the methodology obtained through the process of problem solving and proficient implementation is established in a stable condition, a method to widen the fusion area by expanding the operating area and implementation method can be chosen. However, the integral system of oriental medicine shouldn't be substituted by mechanical idea or reductionism. What should be done primarily for oriental medicine is to objectify things through quantification. In particular, the oriental treatment should accept the microscopic diagnosis to determine the structure and observe the biochemical change.

• 교육심리연구
• /
• 제32권1호
• /
• pp.1-27
• /
• 2018

본 연구의 목적은 창의적 문제해결(CPS) 기반으로 대학생을 위한 학습컨설팅 모형을 개발하고 나아가 이의 실증적 효과를 검증하는 것이었다. 창의적 문제해결 기반 학습컨설팅 모형은 ADDIE 모형에 근거하여 개발하였다. 분석과정에서 컨설팅 과정과 내용 영역을 확인하여 구성요소를 추출하고, 설계과정에서는 모형의 목적에 적합한 컨설팅 과정과 세부내용을 구체화하였다. 개발과정에서는 구체화된 내용으로 창의적 문제해결 기반 학습컨설팅 주요과정과 세부과정 및 주요활동을 구조화하였다. 그리고 실행과정에서는 개발된 모형을 대학생 15명에게 적용하여 모형의 효과성을 확인하였다. 마지막으로 평가과정에서는 학습컨설팅전문가 4명을 포커스 그룹으로 구성하여 인터뷰 한 다음 모형 타당도 검증을 거쳐 최종모형을 개발하였다. 그리고 최종모형을 대학생 20명에게 적용한 결과 자기주도학습능력과 창의적 문제해결능력이 통제집단에 비해 향상되었음을 확인하였다. 이러한 결과를 토대로 창의적 문제해결 기반 학습컨설팅 모형 개발 및 활용에 대한 시사점과 제한점을 논의하였다.

• 융합신호처리학회논문지
• /
• 제3권3호
• /
• pp.63-69
• /
• 2002

디테일드 라우팅은 VLSI 설계 과정중의 하나로, 글로벌 라우팅을 수행한 후 각 라우팅 영역에 할당된 네트들을 트랙에 할당하여 구체적인 네트들의 위치를 결정하는 문제이며, 디테일드 라우팅에서 최적의 해를 얻기 위해 left-edge 알고리즘, dogleg 알고리즘, greedy 채널 라우팅 알고리즘등이 이용된다 본 논문에서는 디테일드 라우팅 문제에 대하여 유전자 알고리즘(genetic algorithm; GA)을 이용한 해 공간 탐색(solution space search) 방식을 제안하였으며, 제안한 방식을 greedy 채널 라우팅 알고리즘과 비교, 분석하였다.

• 한국전자거래학회지
• /
• 제6권1호
• /
• pp.17-33
• /
• 2001

EC(Electronic Commerce) which is done on the virtual space through Internet has strong point like independence from time and space. On the contrary, it also has weak point like security problem because anybody can access easily to the system due to open network attribute of Internet, Therefore, we need the solutions that protect the EC security problem for safe and useful EC activity. One of these solutions is the implementation of strong cipher system. YK2(Young Ku King) cipher system proposed in this paper is good solution for the EC security and it overcome the limit of current block cipher system using 128 bits key length for input, output, encryption key and 32 rounds. Moreover, it is designed for the increase of time complexity by adapting more complex design for key scheduling algorithm regarded as one of important element effected to encryption.

• Journal of applied mathematics & informatics
• /
• 제34권5_6호
• /
• pp.383-395
• /
• 2016

The convergence rate of a numerical procedure based on Schwarz Alternating Method (SAM) for solving elliptic boundary value problems depends on the selection of the interface conditions applied on the interior boundaries of the overlapping subdomains. It has been observed that the Robin condition (mixed interface condition), controlled by a parameter, can optimize SAM's convergence rate. In [8], one formulated the twolayer multi-parameterized SAM and determined the optimal values of the multi-parameters to produce the best convergence rate for one-dimensional elliptic boundary value problems. Two-dimensional implementation was presented in [10]. In this paper, we present an implementation for threedimensional problem.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 1997년도 추계학술대회발표논문집; 홍익대학교, 서울; 1 Nov. 1997
• /
• pp.52-55
• /
• 1997

In this paper, both the generalization of one artificial variable technique to the general bound problem and the efficient implementation of the technique are suggested. When the steepest-edge method is used as a pricing rule in the simplex method, it is easy to update the reduced cost and the simplex multiplier every iteration. Therefore, one artificial variable technique is more efficient than Wolfe's method in which the reduced cost and simplex multiplier must be recalculated in every iteration. When implementing the one artificial variable technique on the LP problems with the general bound restraints on the variables, an arbitrary basic solution which satisfies the bound restraints is sought first, and the artificial column which adjusts the infeasibility is introduced. The phase one of the simplex method minimizes the one artificial variable. The efficient implementation technique includes the splitting, scaling, storage of the artificial column, and the cure of infeasibility problem.