[AISWorld] Newly published papers of JCSE (June. 2017)

Fri Jun 30 05:25:04 EDT 2017

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 11, Number 2, June 2017

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. 11, no. 2, June 2017

[Paper One]

- Title: Main Content Extraction from Web Pages Based on Node
Characteristics

- Authors: Qingtang Liu, Mingbo Shao, Linjing Wu, Gang Zhao, Guilin Fan, and
Jun Li

- Keyword: Content extraction; Web page; Text density; Hyperlink density

- Abstract

Main content extraction of web pages is widely used in search engines, web
content aggregation and mobile Internet browsing. However, a mass of
irrelevant information such as advertisement, irrelevant navigation and
trash information is included in web pages. Such irrelevant information
reduces the efficiency of web content processing in content-based
applications. The purpose of this paper is to propose an automatic main
content extraction method of web pages. In this method, we use two
indicators to describe characteristics of web pages: text density and
hyperlink density. According to continuous distribution of similar content
on a page, we use an estimation algorithm to judge if a node is a content
node or a noisy node based on characteristics of the node and neighboring
nodes. This algorithm enables us to filter advertisement nodes and
irrelevant navigation. Experimental results on 10 news websites revealed
that our algorithm could achieve a 96.34% average acceptable rate.

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

[Paper Two]

- Title: IPv6 Networking with Subnet ID Deprecated

- Authors: Young Hee Kim, Dae Young Kim, and Jong Won Park

- Keyword: Future Internet; No subnet IDs; No locator/identifier separation

- Abstract

This paper proposes a new IPv6 networking paradigm as a counter answer to
the rationale for locator/identifier separation. Instead of involving
separate number spaces each for node identifiers and locators, the context
of the IP address as a node identifier alone is utilized and no additional
locators are incorporated. That is, there are only node addresses and no
locators, and location information is indirectly derived from neighbor
relations between nodes. In order to accomplish this, no subnet IDs are
utilized; the ID value is set to zero for all subnets. The paper details how
to construct this paradigm through novel choice of operational policies in
various IPv6 protocols and some trivial modifications. Especially, inherent
provision of intra-domain node- as well as subnet-mobility by use of
standard link-state intra-domain routing protocols is discussed. A number of
important advantages of this paradigm over the canonical IPv6 networking and
various known solutions of locator/identifier separation are discussed.
Tailoring for multi-area domains and IPv4 is left for further study.

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

[Paper Three]

- Title: Warp-Based Load/Store Reordering to Improve GPU Time Predictability

- Authors: Yijie Huangfu and Wei Zhang

- Keyword: GPU; Data cache; WCET estimation

- Abstract

While graphics processing units (GPUs) can be used to improve the
performance of real-time embedded applications that require high throughput,
it is challenging to estimate the worst-case execution time (WCET) of GPU
programs, because modern GPUs are designed for improving the average-case
performance rather than time predictability. In this paper, a reordering
framework is proposed to regulate the access to the GPU data cache, which
helps to improve the accuracy of the estimation of GPU L1 data cache miss
rate with low performance overhead. Also, with the improved cache miss rate
estimation, tighter WCET estimations can be achieved for GPU programs.

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

[Paper Four]

- Title: Enhancing GPU Performance by Efficient Hardware-Based and Hybrid L1
Data Cache Bypassing

- Authors: Yijie Huangfu and Wei Zhang

- Keyword: GPU; CUDA; Cache bypassing; Memory traffic; Profiling

- Abstract

Recent GPUs have adopted cache memory to benefit general-purpose GPU (GPGPU)
programs. However, unlike CPU programs, GPGPU programs typically have
considerably less temporal/spatial locality. Moreover, the L1 data cache is
used by many threads that access a data size typically considerably larger
than the L1 cache, making it critical to bypass L1 data cache intelligently
to enhance GPU cache performance. In this paper, we examine GPU cache access
behavior and propose a simple hardware-based GPU cache bypassing method that
can be applied to GPU applications without recompiling programs. Moreover,
we introduce a hybrid method that integrates static profiling information
and hardware- based bypassing to further enhance performance. Our
experimental results reveal that hardware-based cache bypassing can boost
performance for most benchmarks, and the hybrid method can achieve
performance comparable to state-of-the-art compiler-based bypassing with
considerably less profiling cost.

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

Thank you.

Best regards,

Min-Kyung Kim

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

Min-Kyung Kim (Ms.)         * E-mail : mkim at kiise.or.kr

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

[Korean Institute of Information Scientists and Engineers]

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