• Journal of Information Technology Services
• /
• v.16 no.4
• /
• pp.137-148
• /
• 2017

Researches on the Artificial Intelligence has been explosively activated in various fields since the advent of AlphaGo. Particularly, researchers on the application of multi-layer neural network such as deep learning, and various machine learning algorithms are being focused actively. In this paper, we described a development of an artificial intelligence Janggi game based on reinforcement learning algorithm and MCTS (Monte Carlo Tree Search) algorithm with accumulated game data. The previous artificial intelligence games are mostly developed based on mini-max algorithm, which depends only on the results of the tree search algorithms. They cannot use of the real data from the games experts, nor cannot enhance the performance by learning. In this paper, we suggest our approach to overcome those limitations as follows. First, we collects Janggi expert's game data, which can reflect abundant real game results. Second, we create a graph structure by using the game data, which can remove redundant movement. And third, we apply the reinforcement learning algorithm and MCTS algorithm to select the best next move. In addition, the learned graph is stored by object serialization method to provide continuity of the game. The experiment of this study is done with two different types as follows. First, our system is confronted with other AI based system that is currently being served on the internet. Second, our system confronted with some Janggi experts who have winning records of more than 50%. Experimental results show that the rate of our system is significantly higher.

• Journal of KIISE:Software and Applications
• /
• v.28 no.10
• /
• pp.732-742
• /
• 2001

The concept of an agent has become important in computer science and has been applied to the number of application domains such electronic commerce and information retrieval. But, no one has proposed yet in software test. The test agent system applied the concept of an agent to software test is new test tool. It consists of the User Interface Agent. the Test Case Selection & Testing Agent and the Regression Test Agent. Each of these agents, with their intelligent rules, carry out the tests autonomously by empolying the object-oriented test processes. This system has 2 advantages. Firstly since the tests are carried our autonomously, it minimizes tester interference and secondly, since redundant-free and consistent effective test cases are intellectually selected, the testing time is reduced while the fault detection effectiveness improves. In this paper, by actually showing the testing process being carried out autonomously by the 3 agents that form the TAS, we show that the TAS minimizes tester interference. By also carrying out the 4 different types of experiments on the RE-Rule, CTS-Rule, overall TAS experiment, and the fault-detection effectiveness experiment on the RE-Rule, we show the cut-down on the testing time and improvement in the fault detection effectivity.

• Journal of KIISE:Software and Applications
• /
• v.35 no.2
• /
• pp.59-69
• /
• 2008

Automatic obfuscation is known to be the most viable method for preventing reverse engineering intentional1y making code more difficult to understand for security purposes. In this paper, we study and implement an obfuscation method for protecting MS Visual C++ programs against attack on the intellectual property in software like reverse engineering attack. That is, the paper describes the implementation of a code obfuscator, a tool which converts a Visual C++ source program into an equivalent one that is much harder to understand. We have used ANTLR parser generator for handling Visual C++ sources, and implemented some obfuscating transformations such as 'Remove comments', 'Scramble identifiers', 'Split variables', 'Fold array', 'Insert class', 'Extend loop condition', 'Add redundant operands', and 'Insert dead code'. We have also evaluated the performance and effectiveness of the obfuscator in terms of potency, resilience, and cost. When the obfuscated source code has been compared with the original source code, it has enough effectiveness for software protection though it incurs some run-time overheads.

• Journal of Information Management
• /
• v.38 no.1
• /
• pp.75-98
• /
• 2007

Each domain of web services increased in geometrical progression by remarkable growth of the Internet serves various services or functions, and earns an income. And all services are divided by individual goal in each domain. What counts is that we must offer a personal data, our human resource information to use web service in the majority of cases. Otherwise we have to act under constraint in using the many web services. In this paper, we analyze the database structure or schema for managing human resource information from several web sites or service demands, and propose an agent design and implementation method for preventing duplication input of personal human resource information and sharing the human resource data.

• Journal of Biomedical Engineering Research
• /
• v.24 no.5
• /
• pp.473-480
• /
• 2003

Iterative reconstruction methods have played a prominent role in emission computed tomography due to their remarkable advantages over the conventional filtered backprojection method. However, since iterative reconstructions typically are comprised of repeatedly projecting and backprojecting the data, the computational load required for reconstructing an image depends highly on the performance of the projector-backprojector pair used in the algorithm. In this work we compare quantitative performance of representative methods for implementing projector-backprojector pairs. To reduce the overall cost for the projection-backprojection operations for each method, we investigate how previously computed results can be reused so that the number of redundant calculations can be minimized. Our experimental results demonstrate that the ray tracing method not only outperforms other methods in computation time, but also provides improved reconstructions with good accuracy.

• Journal of Korean Society for Geospatial Information Science
• /
• v.18 no.2
• /
• pp.99-105
• /
• 2010

Photovoltaic system is the core one among the new and renewable energy of the low Carbon and green growth. Recently, the necessity developing PV is emerging since its of less green hose gas emissions. However, a survey or research on the PV system has been hardly performed. It's not easy to find a appropriate location in consideration of environment. These circumstances encourages a systematic approach for the PV system development. The purpose of this study is to propose a methodology of the location analysis for developing PV system. With this, constraint and location criteria with weights of Analytic Hierarchy Process are established and quantification method of each factor is presented. The location analysis of PV system using the GIS were generalized and the results of analysis for redundant topographic features were presented as 3 criteria of the suitability rank.

• Journal of Internet Computing and Services
• /
• v.12 no.2
• /
• pp.47-53
• /
• 2011

When some sensors under Wireless Sensor Networks fail or become energy-exhausted, redundant mobile sensors might be moved to recover the sensing holes. Within rugged terrain where wheeled sensors are unsuitable, other type of mobile sensors, such as hopping sensors, are needed. In this paper, we address the problem of relocating hopping sensors to the detected sensing holes. Recent study for this work considered the relocation using the shortest path between clusters; however, the shortest path might be used repeatedly and create other sensing holes. In order to overcome the mentioned problem, we propose relocation schemes using the most disjointed paths or multi-paths. Simulation results show that the proposed schemes guarantee more balanced migration distributions of efficient sensors and higher movement success ratios of required sensors than those of the shortest path-based scheme.

• Journal of Internet Computing and Services
• /
• v.15 no.5
• /
• pp.1-7
• /
• 2014

WireWireless sensor networks(WSNs) are generally comprised of densely deployed sensor nodes, which causes highly redundant sensor data transmission and energy waste. Many studies have focused on energy saving in WSNs. However, delay problem also should be taken into consideration for mission-critical applications. In this paper, we propose a BISA (Bio-Inspired Scheduling Algorithm) to reduce the energy consumption and delay for WSNs inspired by biological systems. BISA investigates energy-efficient routing path and minimizes the energy consumption and delay using multi-channel for data transmission. Through simulations, we observe that the BISA archives energy efficiency and delay guarantees.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.9
• /
• pp.4389-4411
• /
• 2018

High dynamic range (HDR) images are becoming pervasive due to capturing or rendering of a wider range of luminance, but their special display equipment is difficult to be popularized because of high cost and technological problem. Thus, HDR images must be adapted to the conventional display devices by applying tone mapping (TM) operation, which puts forward higher requirements for intellectual property protection of HDR images. As the robustness presents regional diversity in the low dynamic range (LDR) watermarked image after TM, which is different from the traditional watermarking technologies, a concept of watermarking activity is defined and used to distinguish the essential distinction of watermarking between LDR image and HDR image in this paper. Then, a novel robust HDR image watermarking algorithm is proposed against TM operations. Firstly, based on the hybrid processing of redundant discrete wavelet transform and singular value decomposition, the watermark is embedded by modifying the structure information of the HDR image. Distinguished from LDR image watermarking, the high embedding strength can cause more obvious distortion in the high brightness regions of HDR image than the low brightness regions. Thus, a perceptual brightness mask with low complexity is designed to improve the imperceptibility further. Experimental results show that the proposed algorithm is robust to the existing TM operations, with taking into account the imperceptibility and embedded capacity, which is superior to the current state-of-art HDR image watermarking algorithms.

• Journal of Microbiology and Biotechnology
• /
• v.11 no.3
• /
• pp.508-514
• /
• 2001

A stuructural gene (ycl) encoding novel yeast cell wall hydrolase, YCL, was cloned from alkalophilic Bacillus alcalophilus subsp. YB380 by PCR, and transformed into E. coli JM83. Based on the N-terminal and internal amino acid sequences of the enzyme, primers were designed for PCr. The positive clone that harbors 1.8 kb of the yeast cell wall hydrolase gene was selected by the colony hybridization method with a PCR fragment as a probe. According to the computer analysis, this gene contained a 400-base-paired N-terminal domain of the enzyme. Based on nucletide homology of the cloned gene, a 850 bp fragment was amplified and the C-terminal domain of the enzyme was sequenced. With a combination of the two sequences, a full nucleotide sequence for YCL was obtained. This gene, ycl, consisted of 1,297 nucleotides with 27 nucleotides with 27 amino acids of signal sequence, 83 redundant amino acids of prosequence, and 265 amino acids of the mature protein. This gene was then cloned into the pJH27 shuttle vector and transformed into the Bacillus subtilis DB104 to express the enzyme. It was confirmed that the expressed cell wall hydrolase that was produced by Bacillus subtilis DB104 was the same as that of the donor strain, by Western blot using polyclonal antibody (IgY) prepared from White Leghorn hen. Purified yeast cell wall hydrolase and expressed recombinant protein showed a single band at the same position in the Western blot analysis.