• Journal of Korean Society of Environmental Engineers
• /
• v.37 no.6
• /
• pp.357-362
• /
• 2015

A novel $TiO_2$-Coconut Shell Powder Composite (TCSPS), prepared by the controlled sol-gel method with subsequent heat treatment, was evaluated as an innovative photocatalytic absorbent for the removal of methylene blue. Optimal preparation conditions of TCSPC were obtained by a response surface methodology and a central composite design model. As compared with the results obtained from one-factor-at-a-time experiments, the values were approximated to the nearest condition of these values and the following experimental parameters were set as the optimum : $600^{\circ}C$ calcination temperature and 20 g of coconut shell powder loading amount.

• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.6
• /
• pp.231-236
• /
• 2014

The transit time of contrast agents and the parameters of time-intensity curves in ultrasonography are important factors to diagnose various diseases of a digestive organ. We have implemented an automatic parametric imaging method to overcome the difficulty of the diagnosis by naked eyes. However, the micro-bubble noise and the respiratory motions may degrade the reliability of the parameter images. In this paper, we introduce an optimization technique based on MRF(Markov Random Field) model to enhance the quality of the parameter images, and present an image tracking algorithm to compensate the image distortion by respiratory motions. A method to extract the respiration periods from the ultrasound image sequence has been developed. We have implemented the ROI(Region of Interest) tracking algorithm using the dynamic weights and a momentum factor based on these periods. An energy function is defined for the Gibbs sampler of the image enhancement method. Through the experiments using the data to diagnose liver lesions, we have shown that the proposed method improves the quality of the parametric images.

• Journal of Digital Convergence
• /
• v.18 no.2
• /
• pp.261-268
• /
• 2020

Machine learning is achieved by making a cost function from a given digital signal data and optimizing the cost function. The cost function here has local minimums in the cost function depending on the amount of digital signal data and the structure of the neural network. These local minimums make a problem that prevents learning. Among the many ways of solving these methods, our proposed method is to change the learning step-size. Unlike existed methods using the learning rate (step-size) as a fixed constant, the use of multivariate function as the cost function prevent unnecessary machine learning and find the best way to the minimum value. Numerical experiments show that the results of the proposed method improve about 3%(88.8%→91.5%) performance using the proposed method rather than the existed methods.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.2
• /
• pp.131-136
• /
• 2015

The chemical tank loading problem has been classified as nondeterministic polynomial time (NP)-complete problem because of the polynomial-time algorithm to find the solution has been unknown yet. Gu$\acute{e}$ret et al. tries to obtain the optimal solution using linear programming package with $O(m^4)$ time complexity for chemical tank loading problem a kind of bin packing problem. On the other hand, this paper suggests the rule of loading chemical into minimum margin tank algorithm with O(m) time complexity. The proposed algorithm stores the chemical in the tank that has partial residual of the same kind chemical firstly. Then, we load the remaining chemical to the minimum marginal tanks. As a result of experiments, this algorithm reduces the $O(m^4)$ of linear programming to O(m) time complexity for NP-complete chemical tank loading problem.

• Journal of Korea Game Society
• /
• v.7 no.4
• /
• pp.93-104
• /
• 2007

In the complex real-time multi-agent system such as game environment, dynamic task allocations are repeatedly performed to achieve a goal in terms of system efficiency. In this research, we present a task allocation scheme suitable for the real-time multi-agent environment. The scheme is to optimize the task allocation by complementing existing coordination agent with $A^*$ algorithm. The coordination agent creates a status graph that consists of nodes which represent the combinations of tasks and agents, and refines the graph to remove nodes of non-execution tasks and agents. The coordination agent performs the selective utilization of the $A^*$ algorithm method and the greedy method for real-time re-allocation. Then it finds some paths of the minimum cost as optimized results by using $A^*$ algorithm. Our experiments show that the coordination agent with $A^*$ algorithm improves a task allocation efficiency about 25% highly than the coordination agent only with greedy algorithm.

• Journal of Energy Engineering
• /
• v.25 no.2
• /
• pp.21-28
• /
• 2016

This research was conducted for the optimal design of large commercial gas oven system. Equivalent ratio was determined through a numerical analysis and experiments on the combustion condition of the combustor. After reviewing the supply capacity of burner(20,000 kcal) and control method of convection fan, two types of heat exchangers designed. In order to maintain a uniform temperature inside the oven is required convection fan braking system. The center temperature in the oven rises more rapidly when the convectional fan is rotated in the counterclockwise direction than the counter-clockwise direction. And The efficiency of the system by installing a large heat transfer area was higher.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.1
• /
• pp.83-90
• /
• 2015

This paper proposes a Tabu search algorithm to maximize the connectivity between the router nodes and the client nodes in wireless mesh networks. As the number of the router nodes and the client nodes in the networks increases, the amount of calculation for finding the solution would be too much increased. To obtain the optimal solution within a reasonable computation time for a high-density network, we propose a Tabu search algorithm to obtain the optimal solution for maximizing the connectivity. In order to make a search more efficient, we propose some efficient neighborhood generating operations of the Tabu search algorithm. We evaluate those performances through some experiments in terms of the maximum number of the connectivity and the execution time of the proposed algorithm. The comparison results show that the proposed algorithm outperforms other existing algorithms.

• Journal of KIISE:Databases
• /
• v.30 no.4
• /
• pp.362-371
• /
• 2003

In this paper, we propose an optimal interest point extraction method to support shape-base image classification and indexing for image database by applying a dynamic threshold that reflects the characteristics of the shape contour. The threshold is determined dynamically by comparing the contour length ratio of the original shape and the approximated polygon while the algorithm is running. Because our algorithm considers the characteristics of the shape contour, it can minimize the number of interest points. For n points of the contour, the proposed algorithm has O(nlogn) computational cost on an average to extract the number of m optimal interest points. Experiments were performed on the 70 synthetic shapes of 7 different contour types and 1100 fish shapes. It shows the average optimization ratio up to 0.92 and has 14% improvement, compared to the fixed threshold method. The shape features extracted from our proposed method can be used for shape-based image classification, indexing, and similarity search via normalization.

• The KIPS Transactions:PartA
• /
• v.9A no.2
• /
• pp.207-216
• /
• 2002

This paper present a design and implementation of a distributed audio, Video stream service framework based on CORBA for efficient processing and control of audio/video stream. We design software components which support processing, control and transmission of audio/video streams as distributed objects. For optimization of stream transmission performance, we separate the transmission path of control data and media data. Distributed objects are defined by IDL and implemented using JAVA. And device dependent facilities like media capturing, playing and communication channels are implemented using JMF (Java Media Framework) components. We show a connection establishment and control procedure of streams communication. And for evaluation, we implement a test system and experiment a system performance. Our experiments show that test system has somewhat longer connection latency time compared to TCP connection establishment, but has optimized media transmission time compared to CORBA IIOP. Also test system show acceptable service quality of media transmission.

• Journal of Digital Convergence
• /
• v.19 no.10
• /
• pp.253-263
• /
• 2021

Machine learning is the process of constructing a cost function using learning data used for learning and an artificial neural network to predict the data, and finding parameters that minimize the cost function. Parameters are changed by using the gradient-based method of the cost function. The more complex the digital signal and the more complex the problem to be learned, the more complex and deeper the structure of the artificial neural network. Such a complex and deep neural network structure can cause over-fitting problems. In order to avoid over-fitting, a weight decay regularization method of parameters is used. We additionally use the value of the cost function in this method. In this way, the accuracy of machine learning is improved, and the superiority is confirmed through numerical experiments. These results derive accurate values for a wide range of artificial intelligence data through machine learning.