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

office at kiise.org office at kiise.org
Mon Jun 30 01:45:08 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 2, June 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. 2, June 2014

 

[Paper One]

- Title: An Object-Level Feature Representation Model for the Multi-target
Retrieval of Remote Sensing Images

- Authors: Zhi Zeng, Zhenhong Du and Renyi Liu

- Keyword: Remote sensing; Image processing; Spatial representation; 9DLT;
Content-based remote sensing image

- Abstract

To address the problem of multi-target retrieval (MTR) of remote sensing
images, this study proposes a new object-level feature representation model.
The model provides an enhanced application image representation that
improves the efficiency of MTR. Generating the model in our scheme includes
processes, such as object-oriented image segmentation, feature parameter
calculation, and symbolic image database construction. The proposed model
uses the spatial representation method of the extended nine-direction
lower-triangular (9DLT) matrix to combine spatial relationships among
objects, and organizes the image features according to MPEG-7 standards. A
similarity metric method is proposed that improves the precision of
similarity retrieval. Our method provides a trade-off strategy that supports
flexible matching on the target features, or the spatial relationship
between the query target and the image database. We implement this retrieval
framework on a dataset of remote sensing images. Experimental results show
that the proposed model achieves competitive and high-retrieval precision.

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

 

 

[Paper Two]

- Title: A Regular Expression Matching Algorithm Based on High-Efficient
Finite Automaton

- Authors: Jianhua Wang, Lianglun Cheng, and Jun Liu

- Keyword: Regular expression; Matching algorithm; High-efficient;
Deterministic finite automaton

 

- Abstract

Aiming to solve the problems of high memory access and big storage space and
long matching time in the regular expression matching of extended finite
automaton (XFA), a new regular expression matching algorithm based on
high-efficient finite automaton is presented in this paper. The basic idea
of the new algorithm is that some extra judging instruments are added at the
starting state in order to reduce any unnecessary transition paths as well
as to eliminate any unnecessary state transitions. Consequently, the
problems of high memory access consumption and big storage space and long
matching time during the regular expression matching process of XFA can be
efficiently improved. The simulation results convey that our proposed scheme
can lower approximately 40% memory access, save about 45% storage space
consumption, and reduce about 12% matching time during the same regular
expression matching process compared with XFA, but without degrading the
matching quality.

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

 

[Paper Three]

- Title: CADICA: Diagnosis of Coronary Artery Disease Using the Imperialist
Competitive Algorithm

- Authors: Zahra Mahmoodabadi, Mohammad Saniee Abadeh

- Keyword: CAD; Decision tree; Fuzzy; ICA; Membership functions; PSO

 

- Abstract

Coronary artery disease (CAD) is currently a prevalent disease from which
many people suffer. Early detection and treatment could reduce the risk of
heart attack. Currently, the golden standard for the diagnosis of CAD is
angiography, which is an invasive procedure. In this article, we propose an
algorithm that uses data mining techniques, a fuzzy expert system, and the
imperialist competitive algorithm (ICA), to make CAD diagnosis by a
non-invasive procedure. The ICA is used to adjust the fuzzy membership
functions. The proposed method has been evaluated with the Cleveland and
Hungarian datasets. The advantage of this method, compared with others, is
the interpretability. The accuracy of the proposed method is 94.92% by 11
rules, and the average length of 4. To compare the colonial competitive
algorithm with other metaheuristic algorithms, the proposed method has been
implemented with the particle swarm optimization (PSO) algorithm. The
results indicate that the colonial competition algorithm is more efficient
than the PSO algorithm.

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

 

[Paper Four]

- Title: Appearance-Order-Based Schema Matching

- Authors: Guohui Ding, Keyan Cao and Guoren Wang, Dong Han

- Keyword: Schema matching; Data integration; Attributes; Correspondences;
Appearance order; Similarity

 

- Abstract

Schema matching is widely used in many applications, such as data
integration, ontology merging, data warehouse and dataspaces. In this paper,
we propose a novel matching technique that is based on the order of
attributes appearing in the schema structure of query results. The
appearance order embodies the extent of the importance of an attribute for
the user examining the query results. The core idea of our approach is to
collect statistics about the appearance order of attributes from the query
logs, to find correspondences between attributes in the schemas to be
matched. As a first step, we employ a matrix to structure the statistics
around the appearance order of attributes. Then, two scoring functions are
considered to measure the similarity of the collected statistics. Finally, a
traditional algorithm is employed to find the mapping with the highest
score. Furthermore, our approach can be seen as a complementary member to
the family of the existing matchers, and can also be combined with them to
obtain more accurate results. We validate our approach with an experimental
study, the results of which demonstrate that our approach is effective, and
has good performance.

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

 

[Paper Five]

- Title: Asymmetric RTS/CTS for Exposed Node Reduction in IEEE 802.11 Ad Hoc
Networks

- Authors: Akihisa Matoba, Masaki Hanada, Hidehiro Kanemitsu, and Moo Wan
Kim

- Keyword: Mitigation of exposed node problem; IEEE 802.11; RTS; CTS; Hidden
node

 

- Abstract

One interesting problem regarding wireless local area network (WLAN) ad-hoc
networks is the effective mitigation of hidden nodes. The WLAN standard IEEE
802.11 provides request to send/clear to send (RTS/CTS) as mitigation for
the hidden node problem; however, this causes the exposed node problem. The
first 802.11 standard provided only two transmission rates, 1 and 2 Mbps,
and control frames, such as RTS/CTS assumed to be sent at 1 Mbps. The 802.11
standard has been enhanced several times since then and now it supports
multi-rate transmission up to 65 Mbps in the currently popular 802.11n (20
MHz channel, single stream with long guard interval). As a result, the
difference in transmission rates and coverages between the data frame and
control frame can be very large. However adjusting the RTS/CTS transmission
rate to optimize network throughput has not been well investigated. In this
paper, we propose a method to decrease the number of exposed nodes by
increasing the RTS transmission rate to decrease RTS coverage. Our proposed
method, Asymmetric Range by Multi-Rate Control (ARMRC), can decrease or even
completely eliminate exposed nodes and improve the entire network
throughput. Experimental results by simulation show that the network
throughput in the proposed method is higher by 20% to 50% under certain
conditions, and the proposed method is found to be effective in equalizing
dispersion of throughput among nodes.

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

 

[Paper Six]

- Title: Automatic Segmentation of Retinal Blood Vessels Based on Improved
Multiscale Line Detection

- Authors: Yanli Hou

- Keyword: Image segmentation; Retinal image; Morphological processing;
Multiscale line detection

- Abstract

The appearance of retinal blood vessels is an important diagnostic indicator
of serious disease, such as hypertension, diabetes, cardiovascular disease,
and stroke. Automatic segmentation of the retinal vasculature is a primary
step towards automatic assessment of the retinal blood vessel features. This
paper presents an automated method for the enhancement and segmentation of
blood vessels in fundus images. To decrease the influence of the optic disk,
and emphasize the vessels for each retinal image, a multidirectional
morphological top-hat transform with rotating structuring elements is first
applied to the background homogenized retinal image. Then, an improved
multiscale line detector is presented to produce a vessel response image,
and yield the retinal blood vessel tree for each retinal image. Since
different line detectors at varying scales have different line responses in
the multiscale detector, the line detectors with longer length produce more
vessel responses than the ones with shorter length; the improved multiscale
detector combines all the responses at different scales by setting different
weights for each scale. The methodology is evaluated on two publicly
available databases, DRIVE and STARE. Experimental results demonstrate an
excellent performance that approximates the average accuracy of a human
observer. Moreover, the method is simple, fast, and robust to noise, so it
is suitable for being integrated into a computer-assisted diagnostic system
for ophthalmic disorders.

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

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

 So-Ra Choi (Ms.)           * E-mail :  <mailto:srchoi at kiise.org>
srchoi at kiise.org

[KIISE 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/20140630/14f0d208/attachment.html>


More information about the AISWorld mailing list