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 4,000
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.
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 15, Number 3, September 2021
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. 15, no. 3, September 2021
[Paper One]
- Title: Collision-Minimizing Beacon Scheduling
Scheme Using RPL in Dense TSCH-Based IoT Environment
- Authors: Jaeyoung Kim, Sanghwa Chung, and Hyungteak Shin
- Keyword: IEEE
802.15.4e; TSCH; Industrial WSN
- Abstract
Time slotted channel hopping (TSCH) is one of the techniques defined in
the IEEE802.15.4e standard. TSCH operates based on a time-division scheme and
uses 16 separate channels for each communication, ensuring high reliability.
Since the entire network operates synchronously, the network participation process
is indispensable. However, due to the channel change technique of TSCH, the
network participation time of a new node that wants to participate in the
network becomes longer. In the previous research, channels for beaconing were
chosen randomly to reduce network formation time. However, this approach is
effective in networks with a smaller number of nodes, e.g., congestion occurs
due to collisions of beacon messages in networks with approximately more than
20, which increases the network participation time. In addition, since channels
are selected stochastically, beacons can’t be broadcast evenly throughout the
network.
To solve this problem, this paper proposes a collision-minimizing
scheduling scheme. The strategy allocates a separate timeslot for each node,
eliminating the possibility of beacon message collisions. In this experiment,
the average network join time decreased by 15%. The
technique applied to this technique can reduce the network formation time
without network congestion in a dense industrial environment.
To obtain a copy of the entire article, click on
the link below.
JCSE,
vol. 15, no. 3, pp.97-106
[Paper Two]
- Title: Cascaded Cache Based on
Recently Used Order for Latency Optimization for IoT
- Authors: Juhee Choi and Heemin Park
- Keyword: Latency
optimization; L1 data cache; Cache replacement policy
- Abstract
The load-to-use latency of the L1 cache is one of the main factors to
determine the performance of low power processors. As the clock frequency
competitions become severe even in Internet of Things (IoT) devices, the access
cycle to the L1 cache was increased to meet the timing constraints. Because
previous studies assumed that every access to the data cache has the same
latency, the latencies tend to be longer for higher performance. We propose a
latency optimization method that uses a cascaded cache based on a recently used
order that has several small banks with various latencies instead of one whole
data cache with constant latency. In our cache, each bank contains the cache
block according to its recently used order. The experiments show that the
performance of our proposal is improved by 23.0%, with a 1.3% reduction in the
dynamic energy consumption on average.
To obtain a copy of the entire article, click on
the link below.
JCSE,
vol. 15, no. 3, pp.107-114
[Paper Three]
- Title: Assessment of
Segmentation Impact on Melanoma Classification Using Convolutional Neural
Networks
- Authors: Qikang Deng, Jose Cruz
Castelo Beltran, and DoHoon Lee
- Keyword: Skin cancer;
Melanoma classification; Medical image segmentation
- Abstract
Among the different types of skin
cancer, melanoma is the one with the highest death rate. Therefore, the early
detection of melanoma and the development of technologies that can assist in
this task have become significantly important. Convolutional neural networks
are one of the most popular skin cancer classification methods. However, most
of the available skin cancer datasets include images with lesions that are hard
to differentiate from healthy skin or with a high presence of hair that can
occlude the lesion. This characteristics of the images
makes it harder to extract lesion features.
Therefore, utilizing segmentation
to extract the lesion location is an important step to reduce hair noise and
improve lesion analysis. In this paper, two combining methods for segmentation
and classification were explored: concatenation and multiplication. By
utilizing these methods, it was possible to improve the accuracy of different
neural network architectures by around 1% when compared to unmodified models
without segmentation. The best-performing model was selected for further
training. This model in conjunction with the segmentation module allowed for
the correct re-classification of around 10% of the total examples in the
dataset, indicating that a segmentation phase leads to an overall accuracy
improvement and suggested that by improving the segmentation, an improvement on
the overall accuracy can be obtained.
To obtain a copy of the
entire article, click on the link below.
JCSE,
vol. 15, no. 3, pp.115-124
[Paper Four]
- Title: Leverage Sidechains to
Reduce the Workload of Smart Contracts through Parallelization
- Authors: Magne Saetran,
Jungwon Seo, and Sooyong Park
- Keyword: Blockchain; Smart contracts; Scalability; Sidechains; Parallelization
- Abstract
Recently,
blockchain has been evolving rapidly with new innovations, coins, and use cases
every day. The platform is getting more congested due to the increase of
interest and mainstream adoption, and because most of this activity is on the
widely used Ethereum blockchain. This also further increases the costs of using
the platform, as the gas prices become higher. Smart contracts are deployed on
the Ethereum blockchain and the high usage of these smart contracts is one of
the main reasons behind the congestion. We propose a new scheme using
sidechains and a middleware to reduce the workload for certain smart contracts,
which allows the execution of smart contract transactions in parallel through
sidechains. In this way, the sidechains could be leveraged to decrease the
congestion on the main blockchain and increase the rate of transactions per
second. Furthermore, the sidechains could have their settings, like block time
and block gas limit, adjusted to give more optimal results. We implemented a
modified version of the ballot contract from the solidity documentation, and
our results demonstrated that through the use of two sidechains, the
transactions processed per second could be increased from 1.8× to 13.0×, depending
on the sidechains settings.
To obtain a copy of the entire article, click on
the link below.
JCSE,
vol. 15, no. 3, pp.125-133
[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
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, 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, office@kiise.org (phone: +82-2-588-9240; FAX: +82-2-521-1352).