[AISWorld] Newly published papers of JCSE (Jun. 2015)

[office at kiise.org]

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 9, Number 2, June 2015

 

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. 9, no. 2, June 2015

 

[Paper One]

- Title: An Optimization Algorithm with Novel Flexible Grid: Applications to
Parameter Decision in LS-SVM

- Authors: Weishang Gao, Cheng Shao and Qin Gao

- Keyword: Optimization algorithm; Swarm intelligence; Evolutionary
computation

- Abstract


Genetic algorithm (GA) and particle swarm optimization (PSO) are two
excellent approaches to multimodal optimization problems. However, slow
convergence or premature convergence readily occurs because of inappropriate
and inflexible evolution. In this paper, a novel optimization algorithm with
a flexible grid optimization (FGO) is suggested to provide adaptive
trade-off between exploration and exploitation according to the specific
objective function. Meanwhile, a uniform agents array with adaptive scale is
distributed on the gird to speed up the calculation. In addition, a
dominance centroid and a fitness center are proposed to efficiently
determine the potential guides when the population size varies dynamically.
Two types of subregion division strategies are designed to enhance
evolutionary diversity and convergence, respectively. By examining the
performance on four benchmark functions, FGO is found to be competitive with
or even superior to several other popular algorithms in terms of both
effectiveness and efficiency, tending to reach the global optimum earlier.
Moreover, FGO is evaluated by applying it to a parameter decision in a least
squares support vector machine (LS-SVM) to verify its practical competence.

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

 

[Paper Two]

- Title: Scratchpad Memory Architectures and Allocation Algorithms for Hard
Real-Time Multicore Processors

- Authors: Yu Liu and Wei Zhang

- Keyword: Scratch-pad memory (SPM); Hard real-time system; Worst-case
execution time (WCET); Multicore processors

- Abstract

Time predictability is crucial in hard real-time and safety-critical
systems. Cache memories, while useful for improving the average-case memory
performance, are not time predictable, especially when they are shared in
multicore processors. To achieve time predictability while minimizing the
impact on performance, this paper explores several time-predictable
scratch-pad memory (SPM) based architectures for multicore processors. To
support these architectures, we propose the dynamic memory objects
allocation based partition, the static allocation based partition, and the
static allocation based priority L2 SPM strategy to retain the
characteristic of time predictability while attempting to maximize the
performance and energy efficiency. The SPM based multicore architectural
design and the related allocation methods thus form a comprehensive solution
to hard real-time multicore based computing. Our experimental results
indicate the strengths and weaknesses of each proposed architecture and the
allocation method, which offers interesting on-chip memory design options to
enable multicore platforms for hard real-time systems.

 

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

 

[Paper Three]

- Title: A Semantic Aspect-Based Vector Space Model to Identify the Event
Evolution Relationship within Topics

- Authors: Yaoyi Xi, Bicheng Li, and Yang Liu

- Keyword: Topic evolution; Event evolution relationship; Hierarchical
Dirichlet process; Semantic similarity

- Abstract

Understanding how the topic evolves is an important and challenging task. A
topic usually consists of multiple related events, and the accurate
identification of event evolution relationship plays an important role in
topic evolution analysis. Existing research has used the traditional vector
space model to represent the event, which cannot be used to accurately
compute the semantic similarity between events. This has led to poor
performance in identifying event evolution relationship. This paper suggests
constructing a semantic aspect-based vector space model to represent the
event: First, use hierarchical Dirichlet process to mine the semantic
aspects. Then, construct a semantic aspect-based vector space model
according to these aspects. Finally, represent each event as a point and
measure the semantic relatedness between events in the space. According to
our evaluation experiments, the performance of our proposed technique is
promising and significantly outperforms the baseline methods.

 

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

 

[Paper Four]

- Title: A Holistic Approach to Optimizing the Lifetime of IEEE
802.15.4/ZigBee Networks with a Deterministic Guarantee of Real-Time Flows

- Authors: Kang-Wook Kim, Myung-Gon Park, Junghee Han and Chang-Gun Lee

- Keyword: Holistic optimization; Real-time; Wireless sensor networks

- Abstract

IEEE 802.15.4 is a global standard designed for emerging applications in
low-rate wireless personal area networks (LRWPANs). The standard provides
beneficial features, such as a beacon-enabled mode and guaranteed time slots
for realtime data delivery. However, how to optimally operate those features
is still an open issue. For the optimal operation of the features, this
paper proposes a holistic optimization method that jointly optimizes three
cross-related problems: cluster- tree construction, nodes??power
configuration, and duty-cycle scheduling. Our holistic optimization method
provides a solution for those problems so that all the real-time packets can
be delivered within their deadlines in the most energyefficient way. Our
simulation study shows that compared to existing methods, our holistic
optimization can guarantee the on-time delivery of all real-time packets
while significantly saving energy, consequently, significantly increasing
the lifetime of the network. Furthermore, we show that our holistic
optimization can be extended to take advantage of the spatial reuse of a
radio frequency resource among long distance nodes and, hence, significantly
increase the entire network capacity.

 

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

 

[Paper Five]

- Title: A Conflict Detection Method Based on Constraint Satisfaction in
Collaborative Design

- Authors: Kangkang Yang, Shijing Wu, Wenqiang Zhao and Lu Zhou

- Keyword: Collaborative design; Conflict detection; Constraint
satisfaction; Immune algorithm; Back propagation neural network

- Abstract

Hierarchical constraints and constraint satisfaction were analyzed in order
to solve the problem of conflict detection in collaborative design. The
constraints were divided into two sets: one set consisted of known
constraints and the other of unknown constraints. The constraints of the two
sets were detected with corresponding methods. The set of the known
constraints was detected using an interval propagation algorithm, a back
propagation (BP) neural network was proposed to detect the set with the
unknown constraints. An immune algorithm (IA) was utilized to optimize the
weights and the thresholds of the BP neural network, and the steps were
designed for the optimization process. The results of the simulation
indicated that the BP neural network that was optimized by IA has a better
performance in terms of convergent speed and global searching ability than a
genetic algorithm. The constraints were described using the eXtensible
Markup Language (XML) for computers to be able to automatically recognize
and establish the constraint network. The implementation of the conflict
detection system was designed based on constraint satisfaction. A wind
planetary gear train is taken as an example of collaborative design with a
conflict detection system.

 

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

 

[Paper Six]

- Title: Priority-Based Network Interrupt Scheduling for Predictable
Real-Time Support

- Authors: Minsub Lee, Hyosu Kim, and Insik Shin

- Keyword: Real-time scheduling; Interrupt handling; Network I/O management;
Process-aware resource scheduling

- Abstract

Interrupt handling is generally separated from process scheduling. This can
lead to a scheduling anomaly and priority inversion. The processor can
interrupt a higher priority process that is currently executing, in order to
handle a network packet reception interruption on behalf of its intended
lower priority receiver process. We propose a new network interrupt handling
scheme that combines interrupt handling with process scheduling and the
priority of the process. The proposed scheme employs techniques to identify
the intended receiver process of an incoming packet at an earlier phase. We
implement a prototype system of the proposed scheme on Linux 2.6, and our
experiment results show that the prototype system supports the predictable
real-time behavior of higher priority processes even when excessive traffic
is sent to lower priority processes.

 

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

 

[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 inquiries
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).

 

 

 

=====================================

 Seo-Hee Park (Ms.)           * E-mail : shpark at kiise.org

* Tel : +82-2-588-9240        * Fax : +82-2-521-1352

[JCSE Editorial Office]           http://jcse.kiise.org
<http://jcse.kiise.org/> 

[Korean Institute of Information Scientists and Engineers]

=====================================