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

[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 8, Number 4, December 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. 4, December 2014

 

[Paper One]

- Title: A New Approach to Web Data Mining Based on Cloud Computing

- Authors: Wenzheng Zhu and Changhoon Lee

- Keyword: Web data mining; Cloud computing; Hadoop; Map/Reduce programming
model

- Abstract

Web data mining aims at discovering useful knowledge from various Web
resources. There is a growing trend among companies, organizations, and
individuals alike of gathering information through Web data mining to
utilize that information in their best interest. In science, cloud computing
is a synonym for distributed computing over a network; cloud computing
relies on the sharing of resources to achieve coherence and economies of
scale, similar to a utility over a network, and means the ability to run a
program or application on many connected computers at the same time. In this
paper, we propose a new system framework based on the Hadoop platform to
realize the collection of useful information of Web resources. The system
framework is based on the Map/Reduce programming model of cloud computing.
We propose a new data mining algorithm to be used in this system framework.
Finally, we prove the feasibility of this approach by simulation experiment.

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

 

[Paper Two]

- Title: A New Approach for Image Encryption Based on Cyclic Rotations and
Multiple Blockwise Diffusions Using Pomeau-Manneville and Sin Maps

- Authors: Gururaj Hanchinamani and Linganagouda Kulakarni

- Keyword: Image encryption/decryption; Chaotic theory; Cryptanalytic
attacks; Pomeau-Manneville map; Sin map

- Abstract

In this paper an efficient image encryption scheme based on cyclic rotations
and multiple blockwise diffusions with two chaotic maps is proposed. A Sin
map is used to generate round keys for the encryption/decryption process. A
Pomeau- Manneville map is used to generate chaotic values for permutation,
pixel value rotation and diffusion operations. The encryption scheme is
composed of three stages: permutation, pixel value rotation and diffusion.
The permutation stage performs four operations on the image: row shuffling,
column shuffling, cyclic rotation of all the rows and cyclic rotation of all
the columns. This stage reduces the correlation significantly among
neighboring pixels. The second stage performs circular rotation of pixel
values twice by scanning the image horizontally and vertically. The amount
of rotation is based on M × N chaotic values. The last stage performs the
diffusion four times by scanning the image in four different ways: block of
8 × 8 pixels, block of 16 × 16 pixels, principal diagonally, and secondary
diagonally. Each of the above four diffusions performs the diffusion in two
directions (forwards and backwards) with two previously diffused pixels and
two chaotic values. This stage makes the scheme resistant to differential
attacks. The security and performance of the proposed method is analyzed
systematically by using the key space, entropy, statistical, differential
and performance analysis. The experimental results confirm that the proposed
method is computationally efficient with high security.

 

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

 

[Paper Three]

- Title: A Novel Hybrid Intelligence Algorithm for Solving Combinatorial
Optimization Problems

- Authors: Wu Deng, Han Chen and He Li

- Keyword: Genetic algorithm; Ant colony optimization algorithm; Multi
strategies; Hybrid evolutionary

- Abstract

The ant colony optimization (ACO) algorithm is a new heuristic algorithm
that offers good robustness and searching ability. With in-depth
exploration, the ACO algorithm exhibits slow convergence speed, and yields
local optimization solutions. Based on analysis of the ACO algorithm and the
genetic algorithm, we propose a novel hybrid genetic ant colony optimization
(NHGAO) algorithm that integrates multi-population strategy, collaborative
strategy, genetic strategy, and ant colony strategy, to avoid the premature
phenomenon, dynamically balance the global search ability and local search
ability, and accelerate the convergence speed. We select the traveling
salesman problem to demonstrate the validity and feasibility of the NHGAO
algorithm for solving complex optimization problems. The simulation
experiment results show that the proposed NHGAO algorithm can obtain the
global optimal solution, achieve self-adaptive control parameters, and avoid
the phenomena of stagnation and prematurity.

 

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

 

[Paper Four]

- Title: An Efficient Pedestrian Detection Approach Using a Novel Split
Function of Hough Forests

- Authors: Trung Dung Do, Thi Ly Vu, Van Huan Nguyen, Hakil Kim, and Chongho
Lee

- Keyword: Pedestrian detection; Object detection; Random forests; Hough
forests; Boosting algorithm; Alternating decision forest

- Abstract

In pedestrian detection applications, one of the most popular frameworks
that has received extensive attention in recent years is widely known as a
‘Hough forest’ (HF). To improve the accuracy of detection, this paper
proposes a novel split function to exploit the statistical information of
the training set stored in each node during the construction of the forest.
The proposed split function makes the trees in the forest more robust to
noise and illumination changes. Moreover, the errors of each stage in the
training forest are minimized using a global loss function to support trees
to track harder training samples. After having the forest trained, the
standard HF detector follows up to search for and localize instances in the
image. Experimental results showed that the detection performance of the
proposed framework was improved significantly with respect to the standard
HF and alternating decision forest (ADF) in some public datasets.

 

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

 

[Paper Five]

- Title: Two-Level Scratchpad Memory Architectures to Achieve Time
Predictability and High Performance

- Authors: Yu Liu and Wei Zhang

- Keyword: Hard real-time systems; Scratch-pad memory; Time predictability

- Abstract

In modern computer architectures, caches are widely used to shorten the gap
between processor speed and memory access time. However, caches are
time-unpredictable, and thus can significantly increase the complexity of
worst-case execution time (WCET) analysis, which is crucial for real-time
systems. This paper proposes a time-predictable twolevel scratchpad-based
architecture and an ILP-based static memory objects assignment algorithm to
support real-time computing. Moreover, to exploit the load/store latencies
that are known statically in this architecture, we study a Scratchpad
Sensitive Scheduling method to further improve the performance. Our
experimental results indicate that the performance and energy consumption of
the two-level scratchpad-based architecture are superior to the similar
cache based architecture for most of the benchmarks we studied.

 

To obtain a copy of the entire article, click on the link below.
JCSE, vol. 8, no. 4, pp.215-227
<http://jcse.kiise.org/PublishedPaper/year_abstract.asp?idx=224&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 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).

 

 

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

 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]

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

 

 

-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.aisnet.org/pipermail/aisworld_lists.aisnet.org/attachments/20141230/353a79f5/attachment.html>