<META HTTP-EQUIV="Content-Type" CONTENT="text/html; charset=iso-8859-1">
<html xmlns:v="urn:schemas-microsoft-com:vml" xmlns:o="urn:schemas-microsoft-com:office:office" xmlns:w="urn:schemas-microsoft-com:office:word" xmlns:m="http://schemas.microsoft.com/office/2004/12/omml" xmlns="http://www.w3.org/TR/REC-html40"><head><meta name=Generator content="Microsoft Word 14 (filtered medium)"><style><!--
/* Font Definitions */
@font-face
{font-family:\B3CB\C6C0;
panose-1:2 11 6 0 0 1 1 1 1 1;}
@font-face
{font-family:\AD74\B9BC;
panose-1:2 11 6 0 0 1 1 1 1 1;}
@font-face
{font-family:\AD74\B9BC;
panose-1:2 11 6 0 0 1 1 1 1 1;}
@font-face
{font-family:"\@\AD74\B9BC";
panose-1:2 11 6 0 0 1 1 1 1 1;}
@font-face
{font-family:Tahoma;
panose-1:2 11 6 4 3 5 4 4 2 4;}
@font-face
{font-family:"\@\B3CB\C6C0";
panose-1:2 11 6 0 0 1 1 1 1 1;}
@font-face
{font-family:Verdana;
panose-1:2 11 6 4 3 5 4 4 2 4;}
/* Style Definitions */
p.MsoNormal, li.MsoNormal, div.MsoNormal
{margin:0cm;
margin-bottom:.0001pt;
text-align:left;
font-size:12.0pt;
font-family:\AD74\B9BC;
color:windowtext;}
a:link, span.MsoHyperlink
{color:blue;
text-decoration:underline;}
a:visited, span.MsoHyperlinkFollowed
{mso-style-priority:99;
color:purple;
text-decoration:underline;}
p
{mso-margin-top-alt:auto;
margin-right:0cm;
mso-margin-bottom-alt:auto;
margin-left:0cm;
text-align:justify;
text-justify:inter-ideograph;
font-size:12.0pt;
font-family:"Times New Roman","serif";
color:black;}
span.EmailStyle18
{mso-style-type:personal;
font-family:"Arial","sans-serif";
color:windowtext;}
span.site1
{mso-style-name:site1;
font-family:"Tahoma","sans-serif";
color:#A93800;
text-decoration:none none;}
span.EmailStyle20
{mso-style-type:personal-reply;
font-family:"Arial","sans-serif";
color:#1F497D;}
.MsoChpDefault
{mso-style-type:export-only;}
@page WordSection1
{size:612.0pt 792.0pt;
margin:3.0cm 72.0pt 72.0pt 72.0pt;}
div.WordSection1
{page:WordSection1;}
--></style><!--[if gte mso 9]><xml>
<o:shapedefaults v:ext="edit" spidmax="1026" />
</xml><![endif]--><!--[if gte mso 9]><xml>
<o:shapelayout v:ext="edit">
<o:idmap v:ext="edit" data="1" />
</o:shapelayout></xml><![endif]--></head><body lang=KO link=blue vlink=purple><div class=WordSection1><p class=MsoNormal style='line-height:150%'><span lang=EN-US style='font-family:"Times New Roman","serif"'>Dear Colleague:<o:p></o:p></span></p><p class=MsoNormal style='line-height:150%'><span lang=EN-US style='font-family:"Times New Roman","serif"'><o:p> </o:p></span></p><p class=MsoNormal style='line-height:12.0pt;mso-line-height-rule:exactly'><span lang=EN-US style='font-family:"Times New Roman","serif"'>We are pleased to announce the release of a new issue of Journal of Computing Science and Engineering (JCSE), published by the Korean Institute of Information Scientists and Engineers (KIISE). KIISE is the largest organization for computer scientists in Korea with over 4000 active members. <o:p></o:p></span></p><p class=MsoNormal style='line-height:12.0pt;mso-line-height-rule:exactly'><span lang=EN-US style='font-family:"Times New Roman","serif"'><o:p> </o:p></span></p><p class=MsoNormal style='line-height:12.0pt;mso-line-height-rule:exactly'><i><span lang=EN-US style='font-family:"Times New Roman","serif"'>Journal of Computing Science and Engineering</span></i><span lang=EN-US style='font-family:"Times New Roman","serif"'> (JCSE) is a peer-reviewed quarterly journal that publishes high-quality papers on all aspects of computing science and engineering. JCSE aims to foster communication between academia and industry within the rapidly evolving field of Computing Science and Engineering. The journal is intended to promote problem-oriented research that fuses academic and industrial expertise. The journal focuses on emerging computer and information technologies including, but not limited to, embedded computing, ubiquitous computing, convergence computing, green computing, smart and intelligent computing, and human computing. JCSE publishes original research contributions, surveys, and experimental studies with scientific advances.<o:p></o:p></span></p><p class=MsoNormal style='line-height:12.0pt;mso-line-height-rule:exactly'><span lang=EN-US style='font-family:"Times New Roman","serif"'><o:p> </o:p></span></p><p class=MsoNormal style='line-height:12.0pt;mso-line-height-rule:exactly'><span lang=EN-US style='font-family:"Times New Roman","serif"'>Please take a look at our new issue posted at <a href="http://jcse.kiise.org/">http://jcse.kiise.org</a>. All the papers can be downloaded from the Web page.<o:p></o:p></span></p><p class=MsoNormal style='line-height:150%'><span lang=EN-US style='font-family:"Times New Roman","serif"'><o:p> </o:p></span></p><p class=MsoNormal style='line-height:150%'><span lang=EN-US style='font-family:"Times New Roman","serif"'>The contents of the latest issue of Journal of Computing Science and Engineering (JCSE)<o:p></o:p></span></p><p class=MsoNormal style='line-height:150%'><span lang=EN-US style='font-family:"Times New Roman","serif"'>Official Publication of the Korean Institute of Information Scientists and Engineers<o:p></o:p></span></p><p class=MsoNormal style='line-height:150%'><span lang=EN-US style='font-family:"Times New Roman","serif"'>Volume 8, Number 4, December 2014<o:p></o:p></span></p><p class=MsoNormal style='line-height:150%'><span lang=EN-US style='font-family:"Times New Roman","serif"'><o:p> </o:p></span></p><p class=MsoNormal style='line-height:150%'><span lang=EN-US style='font-family:"Times New Roman","serif"'>pISSN: 1976-4677<o:p></o:p></span></p><p class=MsoNormal style='line-height:150%'><span lang=EN-US style='font-family:"Times New Roman","serif"'>eISSN: 2093-8020<o:p></o:p></span></p><p class=MsoNormal style='line-height:150%'><span lang=EN-US style='font-family:"Times New Roman","serif"'><o:p> </o:p></span></p><p class=MsoNormal style='line-height:150%'><span lang=EN-US style='font-family:"Times New Roman","serif"'>* JCSE web page: http://jcse.kiise.org<o:p></o:p></span></p><p class=MsoNormal style='line-height:150%'><span lang=EN-US style='font-family:"Times New Roman","serif"'>* e-submission: http://mc.manuscriptcentral.com/jcse<o:p></o:p></span></p><p class=MsoNormal style='line-height:150%'><span lang=EN-US style='font-family:"Times New Roman","serif"'><o:p> </o:p></span></p><p class=MsoNormal style='line-height:150%'><span lang=EN-US style='font-family:"Times New Roman","serif"'>Editor in Chief: Insup Lee (University of Pennsylvania)<o:p></o:p></span></p><p class=MsoNormal style='text-indent:78.0pt;line-height:150%'><span lang=FR style='font-family:"Times New Roman","serif"'>Il-Yeol Song (Drexel University) <o:p></o:p></span></p><p class=MsoNormal style='text-indent:78.0pt;line-height:150%'><span lang=EN-US style='font-family:"Times New Roman","serif"'>Jong C. Park (KAIST)<o:p></o:p></span></p><p class=MsoNormal style='text-indent:78.0pt;line-height:150%'><span lang=EN-US style='font-family:"Times New Roman","serif"'>Taewhan Kim (Seoul National University)<o:p></o:p></span></p><p class=MsoNormal style='line-height:150%'><span lang=EN-US style='font-family:"Times New Roman","serif"'><o:p> </o:p></span></p><p class=MsoNormal style='line-height:150%'><b><span lang=EN-US style='font-size:14.0pt;line-height:150%;font-family:"Verdana","sans-serif"'>JCSE, vol. 8, no. 4, December 2014<o:p></o:p></span></b></p><p class=MsoNormal style='line-height:150%'><b><span lang=EN-US style='font-family:"Times New Roman","serif"'><o:p> </o:p></span></b></p><p class=MsoNormal style='line-height:150%'><b><span lang=EN-US style='font-family:"Times New Roman","serif"'>[Paper One]<o:p></o:p></span></b></p><p class=MsoNormal style='line-height:150%'><b><span lang=EN-US style='font-family:"Times New Roman","serif"'>- Title:</span></b><span lang=EN-US style='font-family:"Times New Roman","serif"'> <span style='color:black'>A New Approach to Web Data Mining Based on Cloud Computing<o:p></o:p></span></span></p><p class=MsoNormal style='line-height:150%'><b><span lang=EN-US style='font-family:"Times New Roman","serif"'>- Authors:</span></b><span lang=EN-US style='font-family:"Times New Roman","serif"'> </span><span lang=EN-US style='font-family:"Times New Roman","serif"'>Wenzheng Zhu and Changhoon Lee<o:p></o:p></span></p><p class=MsoNormal style='line-height:150%'><b><span lang=EN-US style='font-family:"Times New Roman","serif"'>- Keyword: </span></b><span lang=EN-US style='font-family:"Times New Roman","serif"'>Web data mining; Cloud computing; Hadoop; Map/Reduce programming model<o:p></o:p></span></p><p class=MsoNormal style='line-height:150%'><b><span lang=EN-US style='font-family:"Times New Roman","serif"'>- Abstract<o:p></o:p></span></b></p><p class=MsoNormal style='line-height:150%'><span lang=EN-US style='font-family:"Times New Roman","serif"'>Web data mining aims at discovering useful knowledge from various Web resources. There is a growing trend among companies, organizations, and individuals alike of gathering information through Web data mining to utilize that information in their best interest. In science, cloud computing is a synonym for distributed computing over a network; cloud computing relies on the sharing of resources to achieve coherence and economies of scale, similar to a utility over a network, and means the ability to run a program or application on many connected computers at the same time. In this paper, we propose a new system framework based on the Hadoop platform to realize the collection of useful information of Web resources. The system framework is based on the Map/Reduce programming model of cloud computing. We propose a new data mining algorithm to be used in this system framework. Finally, we prove the feasibility of this approach by simulation experiment.<b><o:p></o:p></b></span></p><p class=MsoNormal style='line-height:150%'><span lang=EN-US style='font-family:"Times New Roman","serif"'> <o:p></o:p></span></p><p class=MsoNormal style='line-height:150%'><span lang=EN-US style='font-family:"Times New Roman","serif";color:blue'>To obtain a copy of the entire article, click on the link below.<br></span><b><span lang=EN-US style='font-family:"Times New Roman","serif"'><a href="http://jcse.kiise.org/PublishedPaper/year_abstract.asp?idx=220&page_url=Current_Issues">JCSE, vol. 8, no. 4, pp.181-186</a></span></b><span lang=EN-US style='font-family:"Times New Roman","serif"'><o:p></o:p></span></p><p class=MsoNormal style='line-height:150%'><span lang=EN-US style='font-family:"Times New Roman","serif"'><o:p> </o:p></span></p><p class=MsoNormal style='line-height:150%'><b><span lang=EN-US style='font-family:"Times New Roman","serif"'>[Paper Two]<o:p></o:p></span></b></p><p class=MsoNormal><b><span lang=EN-US style='font-family:"Times New Roman","serif"'>- Title:</span></b><span lang=EN-US style='font-family:"Times New Roman","serif"'> <span style='color:black'>A New Approach for Image Encryption Based on Cyclic Rotations and Multiple Blockwise Diffusions Using Pomeau-Manneville and Sin Maps<o:p></o:p></span></span></p><p class=MsoNormal style='line-height:150%'><b><span lang=EN-US style='font-family:"Times New Roman","serif"'>- Authors:</span></b><span lang=EN-US style='font-family:"Times New Roman","serif"'> </span><span lang=EN-US style='font-family:"Times New Roman","serif"'>Gururaj Hanchinamani and Linganagouda Kulakarni<o:p></o:p></span></p><p class=MsoNormal style='line-height:150%'><b><span lang=EN-US style='font-family:"Times New Roman","serif"'>- Keyword:</span></b><span lang=EN-US style='font-family:"Times New Roman","serif"'> Image encryption/decryption; Chaotic theory; Cryptanalytic attacks; Pomeau-Manneville map; Sin map<o:p></o:p></span></p><p class=MsoNormal style='line-height:150%'><b><span lang=EN-US style='font-family:"Times New Roman","serif"'>- Abstract<o:p></o:p></span></b></p><p class=MsoNormal style='line-height:150%'><span lang=EN-US style='font-family:"Times New Roman","serif"'>In this paper an efficient image encryption scheme based on cyclic rotations and multiple blockwise diffusions with two chaotic maps is proposed. A Sin map is used to generate round keys for the encryption/decryption process. A Pomeau- Manneville map is used to generate chaotic values for permutation, pixel value rotation and diffusion operations. The encryption scheme is composed of three stages: permutation, pixel value rotation and diffusion. The permutation stage performs four operations on the image: row shuffling, column shuffling, cyclic rotation of all the rows and cyclic rotation of all the columns. This stage reduces the correlation significantly among neighboring pixels. The second stage performs circular rotation of pixel values twice by scanning the image horizontally and vertically. The amount of rotation is based on M </span><span lang=EN-US>×</span><span lang=EN-US style='font-family:"Times New Roman","serif"'> N chaotic values. The last stage performs the diffusion four times by scanning the image in four different ways: block of 8 </span><span lang=EN-US>×</span><span lang=EN-US style='font-family:"Times New Roman","serif"'> 8 pixels, block of 16 </span><span lang=EN-US>×</span><span lang=EN-US style='font-family:"Times New Roman","serif"'> 16 pixels, principal diagonally, and secondary diagonally. Each of the above four diffusions performs the diffusion in two directions (forwards and backwards) with two previously diffused pixels and two chaotic values. This stage makes the scheme resistant to differential attacks. The security and performance of the proposed method is analyzed systematically by using the key space, entropy, statistical, differential and performance analysis. The experimental results confirm that the proposed method is computationally efficient with high security.<o:p></o:p></span></p><p class=MsoNormal style='line-height:150%'><b><span lang=EN-US style='font-family:"Times New Roman","serif"'><o:p> </o:p></span></b></p><p class=MsoNormal style='line-height:150%'><span lang=EN-US style='font-family:"Times New Roman","serif";color:blue'>To obtain a copy of the entire article, click on the link below.<br></span><b><span lang=EN-US style='font-family:"Times New Roman","serif"'><a href="http://jcse.kiise.org/PublishedPaper/year_abstract.asp?idx=221&page_url=Current_Issues">JCSE, vol. 8, no. 4, pp.187-198</a></span></b><span lang=EN-US style='font-family:"Times New Roman","serif"'><o:p></o:p></span></p><p class=MsoNormal style='line-height:150%'><span lang=EN-US style='font-family:"Times New Roman","serif"'><o:p> </o:p></span></p><p class=MsoNormal style='line-height:150%'><b><span lang=EN-US style='font-family:"Times New Roman","serif"'>[Paper Three]<o:p></o:p></span></b></p><p class=MsoNormal style='line-height:150%'><b><span lang=EN-US style='font-family:"Times New Roman","serif"'>- Title:</span></b><span lang=EN-US style='font-family:"Times New Roman","serif"'> <span style='color:black'>A Novel Hybrid Intelligence Algorithm for Solving Combinatorial Optimization Problems</span><o:p></o:p></span></p><p class=MsoNormal style='line-height:150%'><b><span lang=EN-US style='font-family:"Times New Roman","serif"'>- Authors:</span></b><span lang=EN-US style='font-family:"Times New Roman","serif"'> Wu Deng, Han Chen and He Li<o:p></o:p></span></p><p class=MsoNormal style='line-height:150%'><b><span lang=EN-US style='font-family:"Times New Roman","serif"'>- Keyword:</span></b><span lang=EN-US style='font-family:"Times New Roman","serif"'> Genetic algorithm; Ant colony optimization algorithm; Multi strategies; Hybrid evolutionary<o:p></o:p></span></p><p class=MsoNormal style='line-height:150%'><b><span lang=EN-US style='font-family:"Times New Roman","serif"'>- Abstract<o:p></o:p></span></b></p><p class=MsoNormal style='line-height:150%'><span lang=EN-US style='font-family:"Times New Roman","serif"'>The ant colony optimization (ACO) algorithm is a new heuristic algorithm that offers good robustness and searching ability. With in-depth exploration, the ACO algorithm exhibits slow convergence speed, and yields local optimization solutions. Based on analysis of the ACO algorithm and the genetic algorithm, we propose a novel hybrid genetic ant colony optimization (NHGAO) algorithm that integrates multi-population strategy, collaborative strategy, genetic strategy, and ant colony strategy, to avoid the premature phenomenon, dynamically balance the global search ability and local search ability, and accelerate the convergence speed. We select the traveling salesman problem to demonstrate the validity and feasibility of the NHGAO algorithm for solving complex optimization problems. The simulation experiment results show that the proposed NHGAO algorithm can obtain the global optimal solution, achieve self-adaptive control parameters, and avoid the phenomena of stagnation and prematurity.<o:p></o:p></span></p><p class=MsoNormal style='line-height:150%'><b><span lang=EN-US style='font-family:"Times New Roman","serif"'><o:p> </o:p></span></b></p><p class=MsoNormal style='line-height:150%'><span lang=EN-US style='font-family:"Times New Roman","serif";color:blue'>To obtain a copy of the entire article, click on the link below.<br></span><b><span lang=EN-US style='font-family:"Times New Roman","serif"'><a href="http://jcse.kiise.org/PublishedPaper/year_abstract.asp?idx=222&page_url=Current_Issues">JCSE, vol. 8, no. 4, pp.199-206</a></span></b><span lang=EN-US style='font-family:"Times New Roman","serif"'><o:p></o:p></span></p><p class=MsoNormal style='line-height:150%'><span lang=EN-US style='font-family:"Times New Roman","serif"'><o:p> </o:p></span></p><p class=MsoNormal style='line-height:150%'><b><span lang=EN-US style='font-family:"Times New Roman","serif"'>[Paper Four]<o:p></o:p></span></b></p><p class=MsoNormal style='line-height:150%'><b><span lang=EN-US style='font-family:"Times New Roman","serif"'>- Title:</span></b><span lang=EN-US style='font-family:"Times New Roman","serif"'> An Efficient Pedestrian Detection Approach Using a Novel Split Function of Hough Forests<span style='color:black'><o:p></o:p></span></span></p><p class=MsoNormal style='line-height:150%'><b><span lang=EN-US style='font-family:"Times New Roman","serif"'>- Authors:</span></b><span lang=EN-US style='font-family:"Times New Roman","serif"'> </span><span lang=EN-US style='font-family:"Times New Roman","serif"'>Trung Dung Do, Thi Ly Vu, Van Huan Nguyen, Hakil Kim, and Chongho Lee<o:p></o:p></span></p><p class=MsoNormal style='line-height:150%'><b><span lang=EN-US style='font-family:"Times New Roman","serif"'>- Keyword:</span></b><span lang=EN-US style='font-family:"Times New Roman","serif"'> Pedestrian detection; Object detection; Random forests; Hough forests; Boosting algorithm; Alternating decision forest<o:p></o:p></span></p><p class=MsoNormal style='line-height:150%'><b><span lang=EN-US style='font-family:"Times New Roman","serif"'>- Abstract<o:p></o:p></span></b></p><p class=MsoNormal style='line-height:150%'><span lang=EN-US style='font-family:"Times New Roman","serif"'>In pedestrian detection applications, one of the most popular frameworks that has received extensive attention in recent years is widely known as a </span><span lang=EN-US>‘</span><span lang=EN-US style='font-family:"Times New Roman","serif"'>Hough forest</span><span lang=EN-US>’</span><span lang=EN-US style='font-family:"Times New Roman","serif"'> (HF). To improve the accuracy of detection, this paper proposes a novel split function to exploit the statistical information of the training set stored in each node during the construction of the forest. The proposed split function makes the trees in the forest more robust to noise and illumination changes. Moreover, the errors of each stage in the training forest are minimized using a global loss function to support trees to track harder training samples. After having the forest trained, the standard HF detector follows up to search for and localize instances in the image. Experimental results showed that the detection performance of the proposed framework was improved significantly with respect to the standard HF and alternating decision forest (ADF) in some public datasets.<o:p></o:p></span></p><p class=MsoNormal style='line-height:150%'><b><span lang=EN-US style='font-family:"Times New Roman","serif"'><o:p> </o:p></span></b></p><p class=MsoNormal style='line-height:150%'><span lang=EN-US style='font-family:"Times New Roman","serif";color:blue'>To obtain a copy of the entire article, click on the link below.<br></span><b><span lang=EN-US style='font-family:"Times New Roman","serif"'><a href="http://jcse.kiise.org/PublishedPaper/year_abstract.asp?idx=223&page_url=Current_Issues">JCSE, vol. 8, no. 4, pp.207-214</a></span></b><span lang=EN-US style='font-family:"Times New Roman","serif"'><o:p></o:p></span></p><p class=MsoNormal style='line-height:150%'><span lang=EN-US style='font-family:"Times New Roman","serif"'><o:p> </o:p></span></p><p class=MsoNormal style='line-height:150%'><b><span lang=EN-US style='font-family:"Times New Roman","serif"'> [Paper Five]<o:p></o:p></span></b></p><p class=MsoNormal style='line-height:150%'><b><span lang=EN-US style='font-family:"Times New Roman","serif"'>- Title:</span></b><span lang=EN-US style='font-family:"Times New Roman","serif"'> Two-Level Scratchpad Memory Architectures to Achieve Time Predictability and High Performance<span style='color:black'><o:p></o:p></span></span></p><p class=MsoNormal style='line-height:150%'><b><span lang=EN-US style='font-family:"Times New Roman","serif"'>- Authors:</span></b><span lang=EN-US style='font-family:"Times New Roman","serif"'> </span><span lang=EN-US style='font-family:"Times New Roman","serif"'>Yu Liu and Wei Zhang<o:p></o:p></span></p><p class=MsoNormal style='line-height:150%'><b><span lang=EN-US style='font-family:"Times New Roman","serif"'>- Keyword:</span></b><span lang=EN-US style='font-family:"Times New Roman","serif"'> </span><span lang=EN-US style='font-family:"Times New Roman","serif"'>Hard real-time systems; Scratch-pad memory; Time predictability<o:p></o:p></span></p><p class=MsoNormal style='line-height:150%'><b><span lang=EN-US style='font-family:"Times New Roman","serif"'>- Abstract<o:p></o:p></span></b></p><p class=MsoNormal style='line-height:150%'><span lang=EN-US style='font-family:"Times New Roman","serif"'>In modern computer architectures, caches are widely used to shorten the gap between processor speed and memory access time. However, caches are time-unpredictable, and thus can significantly increase the complexity of worst-case execution time (WCET) analysis, which is crucial for real-time systems. This paper proposes a time-predictable twolevel scratchpad-based architecture and an ILP-based static memory objects assignment algorithm to support real-time computing. Moreover, to exploit the load/store latencies that are known statically in this architecture, we study a Scratchpad Sensitive Scheduling method to further improve the performance. Our experimental results indicate that the performance and energy consumption of the two-level scratchpad-based architecture are superior to the similar cache based architecture for most of the benchmarks we studied.<o:p></o:p></span></p><p class=MsoNormal style='line-height:150%'><b><span lang=EN-US style='font-family:"Times New Roman","serif"'><o:p> </o:p></span></b></p><p class=MsoNormal style='line-height:150%'><span lang=EN-US style='font-family:"Times New Roman","serif";color:blue'>To obtain a copy of the entire article, click on the link below.<br></span><b><span lang=EN-US style='font-family:"Times New Roman","serif"'><a href="http://jcse.kiise.org/PublishedPaper/year_abstract.asp?idx=224&page_url=Current_Issues">JCSE, vol. 8, no. 4, pp.215-227</a></span></b><span lang=EN-US style='font-family:"Times New Roman","serif"'><o:p></o:p></span></p><p class=MsoNormal style='line-height:150%'><span lang=EN-US style='font-family:"Times New Roman","serif"'><o:p> </o:p></span></p><p class=MsoNormal style='line-height:150%'><b><span lang=EN-US style='font-family:"Times New Roman","serif"'>[Call For Papers]<o:p></o:p></span></b></p><p class=MsoNormal style='line-height:150%'><span lang=EN-US style='font-family:"Times New Roman","serif"'>Journal of Computing Science and Engineering (JCSE), published by the Korean Institute of Information Scientists and Engineers (KIISE) is devoted to the timely dissemination of novel results and discussions on all aspects of computing science and engineering, divided into Foundations, Software & Applications, and Systems & Architecture. Papers are solicited in all areas of computing science and engineering. See JCSE home page at <a href="http://jcse.kiise.org/">http://jcse.kiise.org</a> for the subareas.<o:p></o:p></span></p><p><span lang=EN-US>The journal publishes regularly submitted papers, invited papers, selected best papers from reputable conferences and workshops, and thematic issues that address hot research topics. Potential authors are invited to submit their manuscripts electronically, prepared in PDF files, through </span><span class=site1><span lang=EN-US><a href="http://mc.manuscriptcentral.com/jcse" target="_blank"><span style='font-size:10.0pt;color:#A93800;text-decoration:none'>http://mc.manuscriptcentral.com/jcse</span></a></span></span><span lang=EN-US>, where ScholarOne is used for on-line submission and review. Authors are especially encouraged to submit papers of around 10 but not more than 30 double-spaced pages in twelve point type. The corresponding author's full postal and e-mail addresses, telephone and FAX numbers as well as current affiliation information must be given on the manuscript. Further inquires are welcome at JCSE Editorial Office, </span><span class=site1><span lang=EN-US><a href="mailto:office@kiise.org"><span style='font-size:10.0pt;color:#A93800;text-decoration:none'>office@kiise.org</span></a></span></span><span lang=EN-US> (phone: +82-2-588-9240; FAX: +82-2-521-1352).<o:p></o:p></span></p><p class=MsoNormal><span lang=EN-US style='font-family:"Times New Roman","serif";color:black'><o:p> </o:p></span></p><p class=MsoNormal><span lang=EN-US style='font-size:10.0pt;font-family:"Arial","sans-serif";color:#1F497D'><o:p> </o:p></span></p><p class=MsoNormal style='text-autospace:ideograph-other'><span lang=EN-US style='font-size:10.0pt;font-family:"Tahoma","sans-serif";color:black'>=====================================</span><span lang=EN-US style='font-size:10.0pt;font-family:"Arial","sans-serif";color:black'><o:p></o:p></span></p><p class=MsoNormal style='text-autospace:ideograph-other'><span lang=EN-US style='font-size:10.0pt;font-family:"Tahoma","sans-serif";color:black'> Seo-Hee Park (Ms.) * E-mail : <a href="mailto:shpark@kiise.org">shpark@kiise.org</a></span><span lang=EN-US style='font-size:10.0pt;font-family:"Arial","sans-serif";color:black'><o:p></o:p></span></p><p class=MsoNormal style='text-autospace:ideograph-other'><span lang=EN-US style='font-size:10.0pt;font-family:"Tahoma","sans-serif";color:black'>* Tel : +82-2-588-9240 * Fax : +82-2-521-1352</span><span lang=EN-US style='font-size:10.0pt;font-family:"Arial","sans-serif";color:black'><o:p></o:p></span></p><p class=MsoNormal style='text-autospace:ideograph-other'><span lang=EN-US style='font-size:10.0pt;font-family:"Tahoma","sans-serif";color:black'>[JCSE Editorial Office] <a href="http://jcse.kiise.org/">http://jcse.kiise.org</a></span><span lang=EN-US style='font-size:10.0pt;font-family:"Arial","sans-serif";color:black'><o:p></o:p></span></p><p class=MsoNormal style='text-autospace:ideograph-other'><span lang=EN-US style='font-size:10.0pt;font-family:"Tahoma","sans-serif";color:black'>[Korean Institute of Information Scientists and Engineers]</span><span lang=EN-US style='font-size:10.0pt;font-family:"Arial","sans-serif";color:black'><o:p></o:p></span></p><p class=MsoNormal style='text-align:justify;text-justify:inter-ideograph;text-autospace:none;word-break:break-hangul'><span lang=EN-US style='font-size:10.0pt;font-family:"Tahoma","sans-serif";color:black'>=====================================</span><span lang=EN-US style='font-size:10.0pt;font-family:"Arial","sans-serif";color:#1F497D'><o:p></o:p></span></p><p class=MsoNormal><span lang=EN-US style='font-size:10.0pt;font-family:"Arial","sans-serif";color:#1F497D'><o:p> </o:p></span></p><p class=MsoNormal><span lang=EN-US style='font-size:10.0pt;font-family:"Arial","sans-serif";color:#1F497D'><o:p> </o:p></span></p></div></body></html>