• Journal of Korean Society of Water and Wastewater
• /
• v.28 no.6
• /
• pp.735-745
• /
• 2014

This paper presents PKES(PuKyung -Excel based Simulator) for WWTPs(wastewater treatment plants) by using MS Excel and VBA(Visual Basic for Application). PKES is a user-friendly simulator for the design and optimization of the whole plant including biological and physico-chemical processes for the wastewater and sludge treatment. PKES calculates the performance under steady or dynamic state and allows changing the mathematical model by the user. Mathematical model implemented in PKES is a improved integration model based on ASM2d and ADM1 for simulation of AS(activated sludge) and AD(anaerobic digestion). Gaseous components of $N_2$, $N_2O$, $CO_2$ and $CH_4$ are added for estimation of GHGs(greenhouse gases) emission. The simulation results for comparison between PKES and Aquasim(EAWAG) showed about the same effluent concentrations. As a result of verification using by measured data of BOD, TSS, TN and TP for 2 years of operation, calculated effluent concentrations were similar to measured effluent concentrations. The values of average RMSE(root mean square error) were 1.9, 0.8, 1.6 and 0.2 mg/L for BOD, TSS, TN and TP, respectively. Total GHGs emission of WWTP calculated by PKES was 138.5 ton-$CO_2$/day and GHGs emissions of $N_2O$, $CO_2$ and $CH_4$ were calculated at 21.7, 28.9 and 87.9 ton-$CO_2$/day, respectively. GHGs emission of activated sludge was 32.5 % and that of anaerobic digestion was 67.5 %.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.8
• /
• pp.2774-2796
• /
• 2015

Quality-of-service (QoS) provisioning for a cognitive mesh network (CMN) with heterogeneous services has become a challenging area of research in recent days. Considering both real-time (RT) and non-real-time (NRT) traffic in a multihop CMN, [1] studied cross-layer resource management, including joint access control, route selection, and resource allocation. Due to the complexity of the formulated resource allocation problems, which are mixed-integer non-linear programming, a low-complexity yet efficient algorithm was proposed there to approximately solve the formulated optimization problems. In contrast, in this work, we present an application of genetic algorithm (GA) to re-address the hard resource allocation problems studied in [1]. Novel initialization, selection, crossover, and mutation operations are designed such that solutions with enough randomness can be generated and converge with as less number of attempts as possible, thus improving the efficiency of the algorithm effectively. Simulation results show the effectiveness of the newly proposed GA-based algorithm. Furthermore, by comparing the performance of the newly proposed algorithm with the one proposed in [1], more insights have been obtained in terms of the tradeoff among QoS provisioning for RT traffic, throughput maximization for NRT traffic, and time complexity of an algorithm for resource allocation in a multihop network such as CMN.

• Journal of KIISE
• /
• v.43 no.2
• /
• pp.204-211
• /
• 2016

In this paper, we propose an automatic melody composition system that can generate a sophisticated melody by adding non-harmony tone in the given chord progression. An overall procedure consists of two steps, which are the rhythm generation and melody generation parts. In the rhythm generation part, we designed new fitness functions for rhythm that can be controlled by a user setting parameters. In the melody generation part, we designed new fitness functions for melody based on harmony theory. We also designed evolutionary operators that are conducted by considering a musical context to improve computational efficiency. In the experiments, we compared four metaheuristics to optimize the rhythm fitness functions: Simple Genetic Algorithm (SGA), Elitism Genetic Algorithm (EGA), Differential Evolution (DE), and Particle Swarm Optimization (PSO). Furthermore, we compared proposed genetic algorithm for melody with the four algorithms for verifying performance. In addition, composition results are introduced and analyzed with respect to musical correctness.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.3
• /
• pp.375-381
• /
• 2005

Usually genetic algorithms are used to design optimal system. However the performance of the algorithm is determined by the fitness function and the system environment. It is expected that a co-evolutionary algorithm, two populations are constantly interact and co-evolve, is one of the solution to overcome these problems. In this paper we propose three types of co-evolutionary algorithm to solve GA-Hard problem. The first model is a competitive co-evolutionary algorithm that solution and environment are competitively co-evolve. This model can prevent the solution from falling in local optima because the environment are also evolve according to the evolution of the solution. The second algorithm is schema co-evolutionary algorithm that has host population and parasite (schema) population. Schema population supply good schema to host population in this algorithm. The third is game model-based co-evolutionary algorithm that two populations are co-evolve through game. Each algorithm is applied to visual servoing, robot navigation, and multi-objective optimization problem to verify the effectiveness of the proposed algorithms.

• Journal of Information Processing Systems
• /
• v.9 no.4
• /
• pp.511-537
• /
• 2013

Numerous data intensive applications demand the efficient processing of a new type of query, which is called a progressive query (PQ). A PQ consists of a set of unpredictable but inter-related step-queries (SQ) that are specified by its user in a sequence of steps. A conventional DBMS was not designed to efficiently process such PQs. In our earlier work, we introduced a materialized view based approach for efficiently processing PQs, where the focus was on selecting promising views for materialization. The problem of how to efficiently find usable views from the materialized set in order to answer the SQs for a PQ remains open. In this paper, we present a new index technique, called the Dynamic Materialized View Index (DMVI), to rapidly discover usable views for answering a given SQ. The structure of the proposed index is a special ordered tree where the SQ domain tables are used as search keys and some bitmaps are kept at the leaf nodes for refined filtering. A two-level priority rule is adopted to order domain tables in the tree, which facilitates the efficient maintenance of the tree by taking into account the dynamic characteristics of various types of materialized views for PQs. The bitmap encoding methods and the strategies/algorithms to construct, search, and maintain the DMVI are suggested. The extensive experimental results demonstrate that our index technique is quite promising in improving the performance of the materialized view based query processing approach for PQs.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.37 no.5
• /
• pp.77-87
• /
• 2000

In this paper, we propose a Over-The-Cell channel routing algorithm for the advanced three-layer process. The proposed algorithm makes the channel routing problem to simplified one and makes use of simulated annealing technique to achieve the global optimal solution. And, a new method to remove the cyclic vertical constraints which are known to be the hardest element in the channel routing problem is proposed, and a way to detect the local minimal solution and escape from it successfully is presented. Futhermore, genetic algorithm based channel router is implemented and comparison is performed with the simulated annealing based one. All algorithms are written in C++ and GUI is made using Motif under Linux environment.

• KIPS Transactions on Software and Data Engineering
• /
• v.5 no.10
• /
• pp.483-488
• /
• 2016

In this paper, we propose a prototype-based classification learning by using the nearest-neighbor rule. The nearest-neighbor is applied to segment the class area of all the training data with hyperspheres, and a hypersphere must cover the data from the same class. The radius of a hypersphere is computed by the mid point of the two distances to the farthest same class point and the nearest other class point. And we transform the prototype selection problem into a set covering problem in order to determine the smallest set of prototypes that cover all the training data. The proposed prototype selection method is designed by a greedy algorithm and applicable to process a large-scale training set in parallel. The prediction rule is the nearest-neighbor rule and the new training data is the set of prototypes. In experiments, the generalization performance of the proposed method is superior to existing methods.

• The KIPS Transactions:PartB
• /
• v.11B no.2
• /
• pp.207-212
• /
• 2004

This paper presents a reinforcement learning framework for stock trading systems. Trading system parameters are optimized by Q-learning algorithm and neural networks are adopted for value approximation. In this framework, cooperative multiple agents are used to efficiently integrate global trend prediction and local trading strategy for obtaining better trading performance. Agents Communicate With Others Sharing training episodes and learned policies, while keeping the overall scheme of conventional Q-learning. Experimental results on KOSPI 200 show that a trading system based on the proposed framework outperforms the market average and makes appreciable profits. Furthermore, in view of risk management, the system is superior to a system trained by supervised learning.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2006.05a
• /
• pp.510-513
• /
• 2006

Mobile Ad-hoc networks have recently attracted a lot of attention in the research community as well as in industry. Although the previous research mainly focused on various of Ad-hoc in routing we consider, in this paper, how to efficiently support applications such as variable Geocasting basd on Ad-hoc networks. The goal of a geocasting protocol is deliver data packets to a group of nodes that are located within a specified geocasting region. Previous research that support geocast service in mobilie computing based on Ad-hoc have the non-optimization problem of data delivery path, overhead by frequent reconstruction of the geocast tree, and service disruption problem. In this paper, we propose the mobility pattern based geocast technique using variable service range according to the mobility of destination node and resource reservation to solve this problem. The experimental results show that our proposed mechanism has improved performance than previous research.

• The KIPS Transactions:PartD
• /
• v.12D no.5 s.101
• /
• pp.719-728
• /
• 2005

2-dimensional electrophoresis(2DE) is a separation technique to identify proteins contained in a sample. However, the image is very sensitive to its experimental conditions as well as the quality of scanning. In order to adjust the possible variation of spots in a particular image, a user should manually annotate landmark spots on each gel image to analyze the spots of different images together. However, this operation is an error-prone and tedious job. This thesis develops an automated method of extracting the landmark spots of an image based on landmark profile. The landmark profile is created by clustering the previously identified landmarks of sample images of the same type. The profile contains the various properties of clusters identified for each landmark. When the landmarks of a new image need to be fount all the candidate spots of each landmark are first identified by examining the properties of its clusters. Subsequently, all the landmark spots of the new image are collectively found by the well-known optimization algorithm $A^*$. The performance of this method is illustrated by various experiments on real 2DE images of mouse's brain-tissues.