<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:x="urn:schemas-microsoft-com:office:excel" 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=ks_c_5601-1987">
<meta name=Generator content="Microsoft Word 12 (filtered medium)">
<style>
<!--
/* Font Definitions */
@font-face
{font-family:¹ÙÅÁ;
panose-1:2 3 6 0 0 1 1 1 1 1;}
@font-face
{font-family:±¼¸²;
panose-1:2 11 6 0 0 1 1 1 1 1;}
@font-face
{font-family:Vrinda;
panose-1:1 1 6 0 1 1 1 1 1 1;}
@font-face
{font-family:Vrinda;
panose-1:1 1 6 0 1 1 1 1 1 1;}
@font-face
{font-family:Verdana;
panose-1:2 11 6 4 3 5 4 4 2 4;}
@font-face
{font-family:Tahoma;
panose-1:2 11 6 4 3 5 4 4 2 4;}
@font-face
{font-family:"\@±¼¸²";
panose-1:2 11 6 0 0 1 1 1 1 1;}
@font-face
{font-family:"\@¹ÙÅÁ";
panose-1:2 3 6 0 0 1 1 1 1 1;}
/* 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:"¹ÙÅÁ","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:±¼¸²;
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;}
/* Page Definitions */
@page Section1
{size:612.0pt 792.0pt;
margin:3.0cm 72.0pt 72.0pt 72.0pt;}
div.Section1
{page:Section1;}
-->
</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=Section1>
<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 1, March 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. 1, March 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"'>
Analysis and Improvement of the Bacterial Foraging Optimization 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"'>- Authors:</span></b><span
lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'>
Jun Li, Jianwu Dang, Feng Bu and Jiansheng Wang<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"'>
Bacterial Foraging optimization algorithm; Chemotaxis; Step; Elimination and
dispersal; Escape<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"'>.</span><span lang=EN-US> </span><span
lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'>The
Bacterial Foraging Optimization Algorithm is a swarm intelligence optimization
algorithm. This paper first analyzes the chemotaxis, as well as elimination and
dispersal operation, based on the basic Bacterial Foraging Optimization
Algorithm. The elimination and dispersal operation makes a bacterium which has
found or nearly found an optimal position escape away from that position, which
greatly affects the convergence speed of the algorithm. In order to avoid this
escape, the sphere of action of the elimination and dispersal operation can be
altered in accordance with the generations of evolution. Secondly, we put
forward an algorithm of an adaptive adjustment of step length we called
improved<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"'>bacterial foraging optimization (IBFO)
after making a detailed analysis of the impacts of the step length on the
efficiency and accuracy of the algorithm, based on chemotaxis operation. The
classic test functions show that the convergence speed and accuracy of the IBFO
algorithm is much better than the original 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"'><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=196&page_url=Current_Issues">JCSE,
vol. 8, no. 1, pp.1-10</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 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"'>
A Robust Authentication System Handwritten Documents using Local Features for
Writer Identification<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"'>
Parves Kamal and Faisal Rahman, Saad Mustafiz<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"'>
Authentication system; Identification technology; Gesture authentication;
Computer security<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"'>.A robust authentication system for
handwritten document images carries considerable importance. The authenticity
of legal documents, such as wills, signatures, etc., needs to be verified, in
order to prevent fraudulent acts. The characteristics of writing style vary
from person to person; by analyzing the local features of handwriting, we can
possibly identify the writer. In this paper, we introduce a local feature based
approach, in which writer-specific characteristics are extracted. The presence
of repetitive patterns within handwriting gave us the idea of dividing the
writing into a large number of small sub-images. The similarly shaped
sub-images are grouped together in classes. The most repetitive patterns<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"'>are extracted, and the unknown author of
the document is identified, using a Bayesian classifier. We tested the system
on 50 documents, achieving a successful identification rate of approximately
94%.<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=197&page_url=Current_Issues">JCSE,
vol. 8, no. 1, pp.11-16</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"'>- Title:</span></b><span
lang=EN-US style='font-size:12.0pt;line-height:150%;font-family:"Times New Roman","serif"'>
An Exponential Smoothing Adaptive Failure Detector in the Dual Model of
Heartbeat and Interaction<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"'>
Zhiyong Yang, Chunlin Li, Yanpei Liu, Yunchang Liu, and Lijun Xu<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"'>
Failure detector; Exponential smoothing; Eventually perfect<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"'>In this paper, we propose a new
implementation of a failure detector. The implementation uses a dual model of
heartbeat and interaction. First, the heartbeat model is adopted to shorten the
detection time, if the detection process does not receive the heartbeat message
in the expected time. The interaction model is then used to check the process
further. The expected time is calculated using the exponential smoothing method.
Exponential smoothing can be used to estimate the next arrival time not only in
the random data, but also in the data of linear trends. It is proven that the
new detector in the paper can eventually be a perfect detector.<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=198&page_url=Current_Issues">JCSE,
vol. 8, no. 1, pp.17-24</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"'>
Comparing Separate and Statically-Partitioned Caches for Time-Predictable
Multicore Processors<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"'>
Lan Wu, Yiqiang Ding, and Wei Zhang<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"'>
Performance; Reliability; Hard real-time systems; Multicore processors; Cache
architectures; WCET analysis<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"'>In this paper, we quantitatively compare
two different time-predictable multicore cache architectures, separate and
statically-partitioned caches, through extensive simulation. Current research
trends primarily focus on partitioned-cache architectures in order to achieve
time predictability for hard real-time multicore based systems, and our
experiments reveal that separate caches actually lead to much better
performance and energy efficiency when compared to staticallypartitioned
caches, and both of them are adequate for timing analysis for real-time
multicore applications.<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=199&page_url=Current_Issues">JCSE,
vol. 8, no. 1, pp.25-33</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"'>
Exploiting Standard Deviation of CPI to Evaluate Architectural
Time-Predictability<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"'>
Wei Zhang and Yiqiang Ding<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"'>
Performance; Reliability; Hard real-time systems; WCET analysis;
Time-predictability<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"'>Time-predictability of computing is
critical for hard real-time and safety-critical systems. However, currently
there is no metric available to quantitatively evaluate time-predictability, a
feature crucial to the design of time-predictable processors. This paper first
proposes the concept of architectural time-predictability, which separates the
time variation due to hardware architectural/microarchitectural design from
that due to software. We then propose the standard deviation of clock cycles
per instruction (CPI), a new metric, to measure architectural
time-predictability. Our experiments confirm that the standard deviation of CPI
is an effective metric to evaluate and compare architectural
time-predictability for different processors.<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: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=200&page_url=Current_Issues">JCSE,
vol. 8, no. 1, pp.34-42</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"'>
SS-DRM: Semi-Partitioned Scheduling Based on Delayed Rate Monotonic on Multiprocessor
Platforms<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"'>
Saeed Senobary, Mahmoud Naghibzadeh<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"'>
Real-time systems; Scheduling algorithms; Delayed rate monotonic;
Semi-partitioned technique<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"'>Semi-partitioned scheduling is a new
approach for allocating tasks on multiprocessor platforms. By splitting some
tasks between processors, semi-partitioned scheduling is used to improve
processor utilization. In this paper, a new semi-partitioned scheduling
algorithm called SS-DRM is proposed for multiprocessor platforms. The
scheduling policy used in SSDRM is based on the delayed rate monotonic
algorithm, which is a modified version of the rate monotonic algorithm that can
achieve higher processor utilization. This algorithm can safely schedule any
system composed of two tasks with total utilization less than or equal to that
on a single processor. First, it is formally proven that any task which is
feasible under the rate monotonic algorithm will be feasible under the delayed
rate monotonic algorithm as well. Then, the existing allocation method is
extended to the delayed rate monotonic algorithm. After that, two improvements
are proposed to achieve more processor utilization with the SS-DRM algorithm
than with the rate monotonic algorithm. According to the simulation results,
SS-DRM improves the scheduling performance compared with previous work in terms
of processor utilization, the number of required processors, and the number of
created subtasks.<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=201&page_url=Current_Issues">JCSE,
vol. 8, no. 1, pp.43-56</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 Seven]<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"'>
Addressing User Requirements in Open Source Software: The Role of Online Forums<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"'>
Arif Raza, Luiz Fernando Capretz<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"'>
Open source software; Users; Requirements; Online forums; Empirical analysis<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"'>User satisfaction has always been
important in the success of software, regardless of whether it is closed and
proprietary or open source software (OSS). OSS users are geographically
distributed and include technical as well as novice users. However, it is
generally believed that if OSS was more usable, its popularity would increase
tremendously. Hence, users and their requirements need to be addressed in the
priorities of an OSS environment. Online public forums are a major medium of
communication for the OSS community. The research model of this work studies
the relationship between user requirements in open source software and online
public forums. To conduct this research, we used a dataset consisting of 100
open source software projects in different categories. The results show that
online forums play a significant role in identifying user requirements and
addressing their requests in open source software.<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=202&page_url=Current_Issues">JCSE,
vol. 8, no. 1, pp.57-63</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"'>[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><span lang=EN-US style='font-size:12.0pt;font-family:"Times New Roman","serif";
color:black'><o:p> </o:p></span></p>
</div>
</body>
</html>