<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 HTTP-EQUIV="Content-Type" CONTENT="text/html; charset=us-ascii"><meta name=Generator content="Microsoft Word 14 (filtered medium)"><style><!--
/* Font Definitions */
@font-face
{font-family:\BC14\D0D5;
panose-1:2 3 6 0 0 1 1 1 1 1;}
@font-face
{font-family:Vrinda;
panose-1:2 11 5 2 4 2 4 2 2 3;}
@font-face
{font-family:Vrinda;
panose-1:2 11 5 2 4 2 4 2 2 3;}
@font-face
{font-family:"\B9D1\C740 \ACE0\B515";
panose-1:2 11 5 3 2 0 0 2 0 4;}
@font-face
{font-family:Tahoma;
panose-1:2 11 6 4 3 5 4 4 2 4;}
@font-face
{font-family:"\@\BC14\D0D5";
panose-1:2 3 6 0 0 1 1 1 1 1;}
@font-face
{font-family:"\@\B9D1\C740 \ACE0\B515";
panose-1:2 11 5 3 2 0 0 2 0 4;}
@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:justify;
text-justify:inter-ideograph;
text-autospace:none;
word-break:break-hangul;
font-size:10.0pt;
font-family:"\BC14\D0D5","serif";
color:windowtext;}
a:link, span.MsoHyperlink
{mso-style-priority:99;
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.EmailStyle17
{mso-style-type:personal-compose;
font-family:"\B9D1\C740 \ACE0\B515";
color:windowtext;}
span.site1
{mso-style-name:site1;
font-family:"Tahoma","sans-serif";
color:#A93800;
text-decoration:none none;}
.MsoChpDefault
{mso-style-type:export-only;
font-family:"\B9D1\C740 \ACE0\B515";}
/* Page Definitions */
@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 align=left style='text-align:left;line-height:150%;word-break:keep-all'><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'>Dear Colleague:<o:p></o:p></span></p><p class=MsoNormal align=left style='text-align:left;line-height:150%;word-break:keep-all'><span lang=EN-US style='font-size:12.0pt;line-height:150%;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;word-break:keep-all'><span lang=EN-US style='font-size:12.0pt;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;word-break:keep-all'><span lang=EN-US style='font-size:12.0pt;font-family:"Times New Roman","serif"'><o:p> </o:p></span></p><p class=MsoNormal align=left style='text-align:left;line-height:12.0pt;mso-line-height-rule:exactly;word-break:keep-all'><i><span lang=EN-US style='font-size:12.0pt;font-family:"Times New Roman","serif"'>Journal of Computing Science and Engineering</span></i><span lang=EN-US style='font-size:12.0pt;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 align=left style='text-align:left;line-height:12.0pt;mso-line-height-rule:exactly;word-break:keep-all'><span lang=EN-US style='font-size:12.0pt;font-family:"Times New Roman","serif"'><o:p> </o:p></span></p><p class=MsoNormal align=left style='text-align:left;line-height:12.0pt;mso-line-height-rule:exactly;word-break:keep-all'><span lang=EN-US style='font-size:12.0pt;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 align=left style='text-align:left;line-height:150%;word-break:keep-all'><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'><o:p> </o:p></span></p><p class=MsoNormal align=left style='text-align:left;line-height:150%;word-break:keep-all'><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'><o:p> </o:p></span></p><p class=MsoNormal align=left style='text-align:left;line-height:150%;word-break:keep-all'><span lang=EN-US style='font-size:12.0pt;line-height:150%;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 align=left style='text-align:left;line-height:150%;word-break:keep-all'><span lang=EN-US style='font-size:12.0pt;line-height:150%;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 align=left style='text-align:left;line-height:150%;word-break:keep-all'><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'>Volume 8, Number 2, June 2014<o:p></o:p></span></p><p class=MsoNormal align=left style='text-align:left;line-height:150%;word-break:keep-all'><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'><o:p> </o:p></span></p><p class=MsoNormal align=left style='text-align:left;line-height:150%;word-break:keep-all'><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'>pISSN: 1976-4677<o:p></o:p></span></p><p class=MsoNormal align=left style='text-align:left;line-height:150%;word-break:keep-all'><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'>eISSN: 2093-8020<o:p></o:p></span></p><p class=MsoNormal align=left style='text-align:left;line-height:150%;word-break:keep-all'><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'><o:p> </o:p></span></p><p class=MsoNormal align=left style='text-align:left;line-height:150%;word-break:keep-all'><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'>* JCSE web page: http://jcse.kiise.org<o:p></o:p></span></p><p class=MsoNormal align=left style='text-align:left;line-height:150%;word-break:keep-all'><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'>* e-submission: http://mc.manuscriptcentral.com/jcse<o:p></o:p></span></p><p class=MsoNormal align=left style='text-align:left;line-height:150%;word-break:keep-all'><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'><o:p> </o:p></span></p><p class=MsoNormal align=left style='text-align:left;line-height:150%;word-break:keep-all'><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'>Editor in Chief: Insup Lee (University of Pennsylvania)<o:p></o:p></span></p><p class=MsoNormal align=left style='text-align:left;text-indent:78.0pt;line-height:150%;word-break:keep-all'><span lang=FR style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'>Il-Yeol Song (Drexel University) <o:p></o:p></span></p><p class=MsoNormal align=left style='text-align:left;text-indent:78.0pt;line-height:150%;word-break:keep-all'><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'>Jong C. Park (KAIST)<o:p></o:p></span></p><p class=MsoNormal align=left style='text-align:left;text-indent:78.0pt;line-height:150%;word-break:keep-all'><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'>Taewhan Kim (Seoul National University)<o:p></o:p></span></p><p class=MsoNormal align=left style='text-align:left;line-height:150%;word-break:keep-all'><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'><o:p> </o:p></span></p><p class=MsoNormal align=left style='text-align:left;line-height:150%;word-break:keep-all'><b><span lang=EN-US style='font-size:14.0pt;line-height:150%;font-family:"Verdana","sans-serif"'>JCSE, vol. 8, no. 2, June 2014<o:p></o:p></span></b></p><p class=MsoNormal align=left style='text-align:left;line-height:150%;word-break:keep-all'><b><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'><o:p> </o:p></span></b></p><p class=MsoNormal align=left style='text-align:left;line-height:150%;word-break:keep-all'><b><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'>[Paper One]<o:p></o:p></span></b></p><p class=MsoNormal align=left style='text-align:left;line-height:150%;word-break:keep-all'><b><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'>- Title:</span></b><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'> <span style='color:black'>An Object-Level Feature Representation Model for the Multi-target Retrieval of Remote Sensing Images</span><o:p></o:p></span></p><p class=MsoNormal align=left style='text-align:left;line-height:150%;word-break:keep-all'><b><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'>- Authors:</span></b><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'> </span><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'>Zhi Zeng, Zhenhong Du and Renyi Liu<o:p></o:p></span></p><p class=MsoNormal align=left style='text-align:left;line-height:150%;word-break:keep-all'><b><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'>- Keyword:</span></b><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'> </span><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'>Remote sensing; Image processing; Spatial representation; 9DLT; Content-based remote sensing image<o:p></o:p></span></p><p class=MsoNormal align=left style='text-align:left;line-height:150%;word-break:keep-all'><b><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'>- Abstract<o:p></o:p></span></b></p><p class=MsoNormal align=left style='text-align:left;line-height:150%;word-break:keep-all'><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'> To address the problem of multi-target retrieval (MTR) of remote sensing images, this study proposes a new object-level feature representation model. The model provides an enhanced application image representation that improves the efficiency of MTR. Generating the model in our scheme includes processes, such as object-oriented image segmentation, feature parameter calculation, and symbolic image database construction. The proposed model uses the spatial representation method of the extended nine-direction lower-triangular (9DLT) matrix to combine spatial relationships among objects, and organizes the image features according to MPEG-7 standards. A similarity metric method is proposed that improves the precision of similarity retrieval. Our method provides a trade-off strategy that supports flexible matching on the target features, or the spatial relationship between the query target and the image database. We implement this retrieval framework on a dataset of remote sensing images. Experimental results show that the proposed model achieves competitive and high-retrieval precision.<o:p></o:p></span></p><p class=MsoNormal style='line-height:150%'><span lang=EN-US style='font-size:12.0pt;line-height:150%;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-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'><a href="http://jcse.kiise.org/PublishedPaper/year_abstract.asp?idx=205&page_url=Current_Issues">JCSE, vol. 8, no. 2, pp.65-77</a></span></b><span lang=EN-US style='font-size:12.0pt;line-height:150%;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-size:12.0pt;line-height:150%;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-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'><o:p> </o:p></span></p><p class=MsoNormal align=left style='text-align:left;line-height:150%;word-break:keep-all'><b><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'>[Paper Two]<o:p></o:p></span></b></p><p class=MsoNormal align=left style='text-align:left;line-height:150%;word-break:keep-all'><b><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'>- Title:</span></b><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'> <span style='color:black'>A Regular Expression Matching Algorithm Based on High-Efficient Finite Automaton</span><o:p></o:p></span></p><p class=MsoNormal align=left style='text-align:left;line-height:150%;word-break:keep-all'><b><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'>- Authors:</span></b><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'> </span><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'>Jianhua Wang, Lianglun Cheng, and Jun Liu<o:p></o:p></span></p><p class=MsoNormal align=left style='text-align:left;line-height:150%;word-break:keep-all'><b><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'>- Keyword:</span></b><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'> </span><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'>Regular expression; Matching algorithm; High-efficient; Deterministic finite automaton<o:p></o:p></span></p><p class=MsoNormal align=left style='text-align:left;line-height:150%;word-break:keep-all'><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'><o:p> </o:p></span></p><p class=MsoNormal align=left style='text-align:left;line-height:150%;word-break:keep-all'><b><span lang=EN-US style='font-size:12.0pt;line-height:150%;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-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'>Aiming to solve the problems of high memory access and big storage space and long matching time in the regular expression matching of extended finite automaton (XFA), a new regular expression matching algorithm based on high-efficient finite automaton is presented in this paper. The basic idea of the new algorithm is that some extra judging instruments are added at the starting state in order to reduce any unnecessary transition paths as well as to eliminate any unnecessary state transitions. Consequently, the problems of high memory access consumption and big storage space and long matching time during the regular expression matching process of XFA can be efficiently improved. The simulation results convey that our proposed scheme can lower approximately 40% memory access, save about 45% storage space consumption, and reduce about 12% matching time during the same regular expression matching process compared with XFA, but without degrading the matching quality.<o:p></o:p></span></p><p class=MsoNormal style='line-height:150%'><span lang=EN-US style='font-size:12.0pt;line-height:150%;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-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'><a href="http://jcse.kiise.org/PublishedPaper/year_abstract.asp?idx=206&page_url=Current_Issues">JCSE, vol. 8, no. 2, pp.78-86</a></span></b><span lang=EN-US style='font-size:12.0pt;line-height:150%;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-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'><o:p> </o:p></span></p><p class=MsoNormal align=left style='text-align:left;line-height:150%;word-break:keep-all'><b><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'>[Paper Three]<o:p></o:p></span></b></p><p class=MsoNormal align=left style='text-align:left;line-height:150%;word-break:keep-all'><b><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif";color:black'>- Title:</span></b><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif";color:black'> CADICA: Diagnosis of Coronary Artery Disease Using the Imperialist Competitive Algorithm<o:p></o:p></span></p><p class=MsoNormal align=left style='text-align:left;line-height:150%;word-break:keep-all'><b><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif";color:black'>- Authors:</span></b><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif";color:black'> </span><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif";color:black'>Zahra Mahmoodabadi, Mohammad Saniee Abadeh<o:p></o:p></span></p><p class=MsoNormal align=left style='text-align:left;line-height:150%;word-break:keep-all'><b><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif";color:black'>- Keyword:</span></b><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif";color:black'> </span><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif";color:black'>CAD; Decision tree; Fuzzy; ICA; Membership functions; PSO<o:p></o:p></span></p><p class=MsoNormal align=left style='text-align:left;line-height:150%;word-break:keep-all'><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif";color:black'><o:p> </o:p></span></p><p class=MsoNormal align=left style='text-align:left;line-height:150%;word-break:keep-all'><b><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif";color:black'>- Abstract<o:p></o:p></span></b></p><p class=MsoNormal align=left style='text-align:left;line-height:150%;word-break:keep-all'><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif";color:black'>Coronary artery disease (CAD) is currently a prevalent disease from which many people suffer. Early detection and treatment could reduce the risk of heart attack. Currently, the golden standard for the diagnosis of CAD is angiography, which is an invasive procedure. In this article, we propose an algorithm that uses data mining techniques, a fuzzy expert system, and the imperialist competitive algorithm (ICA), to make CAD diagnosis by a non-invasive procedure. The ICA is used to adjust the fuzzy membership functions. The proposed method has been evaluated with the Cleveland and Hungarian datasets. The advantage of this method, compared with others, is the interpretability. The accuracy of the proposed method is 94.92% by 11 rules, and the average length of 4. To compare the colonial competitive algorithm with other metaheuristic algorithms, the proposed method has been implemented with the particle swarm optimization (PSO) algorithm. The results indicate that the colonial competition algorithm is more efficient than the PSO algorithm.<o:p></o:p></span></p><p class=MsoNormal align=left style='text-align:left;line-height:150%;word-break:keep-all'><span lang=EN-US style='font-size:12.0pt;line-height:150%;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-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'><a href="http://jcse.kiise.org/PublishedPaper/year_abstract.asp?idx=207&page_url=Current_Issues">JCSE, vol. 8, no. 2, pp.87-93</a></span></b><span lang=EN-US style='font-size:12.0pt;line-height:150%;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-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'><o:p> </o:p></span></p><p class=MsoNormal align=left style='text-align:left;line-height:150%;word-break:keep-all'><b><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'>[Paper Four]<o:p></o:p></span></b></p><p class=MsoNormal align=left style='text-align:left;line-height:150%;word-break:keep-all'><b><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'>- Title:</span></b><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'> <span style='color:black'>Appearance-Order-Based Schema Matching<o:p></o:p></span></span></p><p class=MsoNormal align=left style='text-align:left;line-height:150%;word-break:keep-all'><b><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'>- Authors:</span></b><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'> </span><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'>Guohui Ding, Keyan Cao and Guoren Wang, Dong Han<o:p></o:p></span></p><p class=MsoNormal align=left style='text-align:left;line-height:150%;word-break:keep-all'><b><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'>- Keyword:</span></b><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'> </span><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'>Schema matching; Data integration; Attributes; Correspondences; Appearance order; Similarity<o:p></o:p></span></p><p class=MsoNormal align=left style='text-align:left;line-height:150%;word-break:keep-all'><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'><o:p> </o:p></span></p><p class=MsoNormal align=left style='text-align:left;line-height:150%;word-break:keep-all'><b><span lang=EN-US style='font-size:12.0pt;line-height:150%;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-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'>Schema matching is widely used in many applications, such as data integration, ontology merging, data warehouse and dataspaces. In this paper, we propose a novel matching technique that is based on the order of attributes appearing in the schema structure of query results. The appearance order embodies the extent of the importance of an attribute for the user examining the query results. The core idea of our approach is to collect statistics about the appearance order of attributes from the query logs, to find correspondences between attributes in the schemas to be matched. As a first step, we employ a matrix to structure the statistics around the appearance order of attributes. Then, two scoring functions are considered to measure the similarity of the collected statistics. Finally, a traditional algorithm is employed to find the mapping with the highest score. Furthermore, our approach can be seen as a complementary member to the family of the existing matchers, and can also be combined with them to obtain more accurate results. We validate our approach with an experimental study, the results of which demonstrate that our approach is effective, and has good performance.<o:p></o:p></span></p><p class=MsoNormal style='line-height:150%'><span lang=EN-US style='font-size:12.0pt;line-height:150%;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-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'><a href="http://jcse.kiise.org/PublishedPaper/year_abstract.asp?idx=208&page_url=Current_Issues">JCSE, vol. 8, no. 2, pp.94-106</a></span></b><span lang=EN-US style='font-size:12.0pt;line-height:150%;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-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'><o:p> </o:p></span></p><p class=MsoNormal align=left style='text-align:left;line-height:150%;word-break:keep-all'><b><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'>[Paper Five]<o:p></o:p></span></b></p><p class=MsoNormal align=left style='text-align:left;line-height:150%;word-break:keep-all'><b><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'>- Title:</span></b><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'> <span style='color:black'>Asymmetric RTS/CTS for Exposed Node Reduction in IEEE 802.11 Ad Hoc Networks</span><o:p></o:p></span></p><p class=MsoNormal align=left style='text-align:left;line-height:150%;word-break:keep-all'><b><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'>- Authors:</span></b><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'> </span><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'>Akihisa Matoba, Masaki Hanada, Hidehiro Kanemitsu, and Moo Wan Kim<o:p></o:p></span></p><p class=MsoNormal align=left style='text-align:left;line-height:150%;word-break:keep-all'><b><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'>- Keyword:</span></b><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'> </span><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'>Mitigation of exposed node problem; IEEE 802.11; RTS; CTS; Hidden node<o:p></o:p></span></p><p class=MsoNormal align=left style='text-align:left;line-height:150%;word-break:keep-all'><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'><o:p> </o:p></span></p><p class=MsoNormal align=left style='text-align:left;line-height:150%;word-break:keep-all'><b><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'>- Abstract<o:p></o:p></span></b></p><p class=MsoNormal align=left style='text-align:left;line-height:150%;word-break:keep-all'><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'>One interesting problem regarding wireless local area network (WLAN) ad-hoc networks is the effective mitigation of hidden nodes. The WLAN standard IEEE 802.11 provides request to send/clear to send (RTS/CTS) as mitigation for the hidden node problem; however, this causes the exposed node problem. The first 802.11 standard provided only two transmission rates, 1 and 2 Mbps, and control frames, such as RTS/CTS assumed to be sent at 1 Mbps. The 802.11 standard has been enhanced several times since then and now it supports multi-rate transmission up to 65 Mbps in the currently popular 802.11n (20 MHz channel, single stream with long guard interval). As a result, the difference in transmission rates and coverages between the data frame and control frame can be very large. However adjusting the RTS/CTS transmission rate to optimize network throughput has not been well investigated. In this paper, we propose a method to decrease the number of exposed nodes by increasing the RTS transmission rate to decrease RTS coverage. Our proposed method, Asymmetric Range by Multi-Rate Control (ARMRC), can decrease or even completely eliminate exposed nodes and improve the entire network throughput. Experimental results by simulation show that the network throughput in the proposed method is higher by 20% to 50% under certain conditions, and the proposed method is found to be effective in equalizing dispersion of throughput among nodes.<o:p></o:p></span></p><p class=MsoNormal style='line-height:150%'><span lang=EN-US style='font-size:12.0pt;line-height:150%;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-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'><a href="http://jcse.kiise.org/PublishedPaper/year_abstract.asp?idx=209&page_url=Current_Issues">JCSE, vol. 8, no. 2, pp.107-118</a></span></b><span lang=EN-US style='font-size:12.0pt;line-height:150%;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-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'><o:p> </o:p></span></p><p class=MsoNormal align=left style='text-align:left;line-height:150%;word-break:keep-all'><b><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'>[Paper Six]<o:p></o:p></span></b></p><p class=MsoNormal align=left style='text-align:left;line-height:150%;word-break:keep-all'><b><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'>- Title:</span></b><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'> <span style='color:black'>Automatic Segmentation of Retinal Blood Vessels Based on Improved Multiscale Line Detection</span><o:p></o:p></span></p><p class=MsoNormal align=left style='text-align:left;line-height:150%;word-break:keep-all'><b><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'>- Authors:</span></b><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'> </span><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'>Yanli Hou<o:p></o:p></span></p><p class=MsoNormal align=left style='text-align:left;line-height:150%;word-break:keep-all'><b><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'>- Keyword:</span></b><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'> </span><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'>Image segmentation; Retinal image; Morphological processing; Multiscale line detection<o:p></o:p></span></p><p class=MsoNormal align=left style='text-align:left;line-height:150%;word-break:keep-all'><b><span lang=EN-US style='font-size:12.0pt;line-height:150%;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-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'>The appearance of retinal blood vessels is an important diagnostic indicator of serious disease, such as hypertension, diabetes, cardiovascular disease, and stroke. Automatic segmentation of the retinal vasculature is a primary step towards automatic assessment of the retinal blood vessel features. This paper presents an automated method for the enhancement and segmentation of blood vessels in fundus images. To decrease the influence of the optic disk, and emphasize the vessels for each retinal image, a multidirectional morphological top-hat transform with rotating structuring elements is first applied to the background homogenized retinal image. Then, an improved multiscale line detector is presented to produce a vessel response image, and yield the retinal blood vessel tree for each retinal image. Since different line detectors at varying scales have different line responses in the multiscale detector, the line detectors with longer length produce more vessel responses than the ones with shorter length; the improved multiscale detector combines all the responses at different scales by setting different weights for each scale. The methodology is evaluated on two publicly available databases, DRIVE and STARE. Experimental results demonstrate an excellent performance that approximates the average accuracy of a human observer. Moreover, the method is simple, fast, and robust to noise, so it is suitable for being integrated into a computer-assisted diagnostic system for ophthalmic disorders.</span><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif";color:blue'><o:p></o:p></span></p><p class=MsoNormal style='line-height:150%'><span lang=EN-US style='font-size:12.0pt;line-height:150%;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-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'><a href="http://jcse.kiise.org/PublishedPaper/year_abstract.asp?idx=210&page_url=Current_Issues">JCSE, vol. 8, no. 2, pp.119-128</a></span></b><span lang=EN-US style='font-size:12.0pt;line-height:150%;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-size:12.0pt;line-height:150%;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-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'><o:p> </o:p></span></p><p class=MsoNormal align=left style='text-align:left;line-height:150%;word-break:keep-all'><b><span lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'>[Call For Papers]<o:p></o:p></span></b></p><p class=MsoNormal align=left style='text-align:left;line-height:150%;word-break:keep-all'><span lang=EN-US style='font-size:12.0pt;line-height:150%;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 style='font-size:10.0pt'><a href="http://mc.manuscriptcentral.com/jcse" target="_blank"><span style='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 style='font-size:10.0pt'><a href="mailto:office@kiise.org"><span style='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 align=left style='text-align:left;text-autospace:ideograph-other;word-break:keep-all'><span lang=EN-US style='font-family:"Tahoma","sans-serif";color:black'>=====================================</span><span lang=EN-US style='font-family:"맑은 고딕";color:black'><o:p></o:p></span></p><p class=MsoNormal align=left style='text-align:left;text-autospace:ideograph-other;word-break:keep-all'><span lang=EN-US style='font-family:"Tahoma","sans-serif";color:black'> So-Ra Choi (Ms.) * E-mail : <a href="mailto:srchoi@kiise.org"><span style='color:blue'>srchoi@kiise.org</span></a></span><span lang=EN-US style='font-family:"맑은 고딕";color:black'><o:p></o:p></span></p><p class=MsoNormal align=left style='text-align:left;text-autospace:ideograph-other;word-break:keep-all'><span lang=EN-US style='font-family:"Tahoma","sans-serif";color:black'> [KIISE JCSE Editorial Office] </span><span lang=EN-US style='font-family:"맑은 고딕";color:black'><a href="http://jcse.kiise.org/" title="http://jcse.kiise.org/"><span style='font-family:"Tahoma","sans-serif";color:blue'>http://jcse.kiise.org</span></a><o:p></o:p></span></p><p class=MsoNormal align=left style='text-align:left;text-autospace:ideograph-other;word-break:keep-all'><span lang=EN-US style='font-family:"Tahoma","sans-serif";color:black'>[Korean Institute of Information Scientists and Engineers]</span><span lang=EN-US style='font-family:"맑은 고딕";color:black'><o:p></o:p></span></p><p class=MsoNormal><span lang=EN-US style='font-family:"Tahoma","sans-serif";color:black'>=====================================</span><span lang=EN-US style='font-family:"맑은 고딕"'><o:p></o:p></span></p><p class=MsoNormal><span lang=EN-US style='font-family:"맑은 고딕"'><o:p> </o:p></span></p><p class=MsoNormal><span lang=EN-US><o:p> </o:p></span></p></div></body></html>