• International Journal of Internet, Broadcasting and Communication
• /
• v.11 no.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.

• The Journal of the Acoustical Society of Korea
• /
• v.19 no.1
• /
• pp.78-83
• /
• 2000

Vocoders used in digital mobile phone adopt new improved algorithm to achieve better communication quality. Therefore the communication problem occurs between mobile phones using different vocoder algorithms. In this paper, the efficient implementation of 8kbps and 13kbps QCELP into one DSP chip to solve this problem is presented. We also describe the optimization method at each level, that is, algorithm-level, equation-level, and coding-level, to reduce the complexity for the QCELP vocoder algorithm implementation. The complexity in the codebook search-loop that is the main part for the QCELP algorithm complexity can be reduced about 50% by using these optimizations. The QCELP implementation with our DSP requires only 25 MIPS of computation for the 8kbps and 33 MIPS for the 13kbps ones. The DSP for our real-time implementation is a 16-bit fixed-point one specifically designed for vocoder applications and has a simple architecture compared to general-purpose ones in order to reduce the power consumption.

• Journal of information and communication convergence engineering
• /
• v.8 no.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.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.14 no.4
• /
• pp.637-644
• /
• 2019

This paper describes an implementation of a graph-based simultaneous localization and mapping(SLAM) method called the General Graph Optimization. The General Graph Optimization formulates the SLAM problem using nodes and edges. The nodes represent the location and attitude of a robot in time sequence, and the edge between the nodes depict the constraint between the nodes. The constraints are imposed by sensor measurements. The General Graph Optimization solves the problem by optimizing the performance index determined by the constraints. The implementation is verified using the measurement data sets which are open for test of various SLAM methods.

• The Journal of the Society of Stroke on Korean Medicine
• /
• v.18 no.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.

• (The) Korean Journal of Educational Psychology
• /
• v.32 no.1
• /
• pp.1-27
• /
• 2018

The proposes of this study were to develop the learning consulting model based on creative problem solving and to verify the effects of its implementation. The model was developed based on ADDIE program developing model. In the analysis stage, literature review and needs survey were conducted for data collection on learning consulting at universities including the literature in related fields. Specific areas needed in the learning consulting model were selected from the results of this collected data. During the design and development stage, the learning consulting processes were established. These constituted the learning consulting model developed and it had been based on the Creative Problem Solving. To verify the validity of the learning consulting model based on the creative problem solving, a pilot study was implemented. The model was completed content a validity verification process performed by experts through focus group interviews. The aim this final model is to improve the self-directed learning ability and creative problem solving capacity of the university students. The study results showed that mean scores on self-directed learning ability of the experimental group increased significantly compared to the control group. Based on these findings, the learning consulting model seemed very effective in improving the university students' self-directed learning ability, as well as their creative problem solving capacity. Based on the results of this study, implications and limitations of the final model and its implementation were discussed.

• Journal of the Institute of Convergence Signal Processing
• /
• v.3 no.3
• /
• pp.63-69
• /
• 2002

Detailed routing is a problem assigning each net to a track after global routing. The most popular algorithms for detailed routing include left-edge algorithm, dogleg algorithm, and greedy channel routing algorithm. In this paper we propose a genetic algorithm searching solution space for the detailed routing problem. We compare the performance of proposed genetic algorithm(GA) for detailed routing with that of greedy channel routing algorithm by analyzing the results of each implementation.

• The Journal of Society for e-Business Studies
• /
• v.6 no.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
• /
• v.34 no.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.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1997.10a
• /
• 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.