[AISWorld] Newly published papers of JCSE (Mar. 2014)

Mon Mar 31 21:58:33 EDT 2014

Dear Colleague:

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. 

Journal of Computing Science and Engineering (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.

Please take a look at our new issue posted at http://jcse.kiise.org
<http://jcse.kiise.org/> . All the papers can be downloaded from the Web
page.

The contents of the latest issue of Journal of Computing Science and
Engineering (JCSE)

Official Publication of the Korean Institute of Information Scientists and
Engineers

Volume 8, Number 1, March 2014

pISSN: 1976-4677

eISSN: 2093-8020

* JCSE web page: http://jcse.kiise.org

* e-submission: http://mc.manuscriptcentral.com/jcse

Editor in Chief: Insup Lee (University of Pennsylvania)

Il-Yeol Song (Drexel University) 

Jong C. Park (KAIST)

Taewhan Kim (Seoul National University)

JCSE, vol. 8, no. 1, March 2014

[Paper One]

- Title: Analysis and Improvement of the Bacterial Foraging Optimization
Algorithm

- Authors: Jun Li, Jianwu Dang, Feng Bu and Jiansheng Wang

- Keyword: Bacterial Foraging optimization algorithm; Chemotaxis; Step;
Elimination and dispersal; Escape

- Abstract

. 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

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.

To obtain a copy of the entire article, click on the link below.
JCSE,
<http://jcse.kiise.org/PublishedPaper/year_abstract.asp?idx=196&page_url=Cur
rent_Issues>  vol. 8, no. 1, pp.1-10

[Paper Two]

- Title: A Robust Authentication System Handwritten Documents using Local
Features for Writer Identification

- Authors: Parves Kamal and Faisal Rahman, Saad Mustafiz

- Keyword: Authentication system; Identification technology; Gesture
authentication; Computer security

- Abstract

.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

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%.

To obtain a copy of the entire article, click on the link below.
JCSE,
<http://jcse.kiise.org/PublishedPaper/year_abstract.asp?idx=197&page_url=Cur
rent_Issues>  vol. 8, no. 1, pp.11-16

[Paper Three]

- Title: An Exponential Smoothing Adaptive Failure Detector in the Dual
Model of Heartbeat and Interaction

- Authors: Zhiyong Yang, Chunlin Li, Yanpei Liu, Yunchang Liu, and Lijun Xu

- Keyword: Failure detector; Exponential smoothing; Eventually perfect

- Abstract

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.

To obtain a copy of the entire article, click on the link below.
JCSE,
<http://jcse.kiise.org/PublishedPaper/year_abstract.asp?idx=198&page_url=Cur
rent_Issues>  vol. 8, no. 1, pp.17-24

[Paper Four]

- Title: Comparing Separate and Statically-Partitioned Caches for Time-
Predictable Multicore Processors

- Authors: Lan Wu, Yiqiang Ding, and Wei Zhang

- Keyword: Performance; Reliability; Hard real-time systems; Multicore
processors; Cache architectures; WCET analysis

- Abstract

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.

To obtain a copy of the entire article, click on the link below.
JCSE,
<http://jcse.kiise.org/PublishedPaper/year_abstract.asp?idx=199&page_url=Cur
rent_Issues>  vol. 8, no. 1, pp.25-33

[Paper Five]

- Title: Exploiting Standard Deviation of CPI to Evaluate Architectural
Time-Predictability

- Authors: Wei Zhang and Yiqiang Ding

- Keyword: Performance; Reliability; Hard real-time systems; WCET analysis;
Time-predictability

- Abstract

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.

To obtain a copy of the entire article, click on the link below.
JCSE,
<http://jcse.kiise.org/PublishedPaper/year_abstract.asp?idx=200&page_url=Cur
rent_Issues>  vol. 8, no. 1, pp.34-42

[Paper Six]

- Title: SS-DRM: Semi-Partitioned Scheduling Based on Delayed Rate
Monotonic on Multiprocessor Platforms

- Authors: Saeed Senobary, Mahmoud Naghibzadeh

- Keyword: Real-time systems; Scheduling algorithms; Delayed rate
monotonic; Semi-partitioned technique

- Abstract

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.

To obtain a copy of the entire article, click on the link below.
JCSE,
<http://jcse.kiise.org/PublishedPaper/year_abstract.asp?idx=201&page_url=Cur
rent_Issues>  vol. 8, no. 1, pp.43-56

[Paper Seven]

- Title: Addressing User Requirements in Open Source Software: The Role of
Online Forums

- Authors: Arif Raza, Luiz Fernando Capretz

- Keyword: Open source software; Users; Requirements; Online forums;
Empirical analysis

- Abstract

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.

To obtain a copy of the entire article, click on the link below.
JCSE,
<http://jcse.kiise.org/PublishedPaper/year_abstract.asp?idx=202&page_url=Cur
rent_Issues>  vol. 8, no. 1, pp.57-63

[Call For Papers]

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
http://jcse.kiise.org <http://jcse.kiise.org/>  for the subareas.

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
<http://mc.manuscriptcentral.com/jcse>
http://mc.manuscriptcentral.com/jcse, 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,
<mailto:office at kiise.org> office at kiise.org (phone: +82-2-588-9240; FAX: +82-
2-521-1352).

-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.aisnet.org/pipermail/aisworld_lists.aisnet.org/attachments/20140401/81869ddc/attachment.html>