Special Issue on Parallel Architecture, Algorithms and Programming
Guest Editors: Yuping Wang, Yiu-ming Cheung and Hailin Liu
International Conferences on Computational Intelligence and Security (CIS conferences) are high quality annually
international conferences originated from 2005, and most of CIS2005 to CIS2011 received more than 700
submissions, but the rate of accepted papers for almost CIS conferences was fewer than 20%. CIS'2011 was held in
Sanya, Hainan Province, China on December 3-4, 2011. In recent years, there has been a growing interest in the field of
computational intelligent and security as well as their applications. Many novel algorithms and their new applications
have been developed. They are widely applied to our daily life to solve realistic problems in various fields including
science, engineering, management and games. The aim of CIS2011 is to bring together researchers, engineers,
developers and practitioners working in two crucial fields: computational intelligence (CI) and information security (IS),
to share the experience, exchange and cross-fertilize ideas. In this special issue, we try to select a part of high quality
extended and revised papers from CIS2011 on new computational algorithms and their new applications. The details of
these selected papers are briefly introduced as follows:
1. In a synchronization problem on a class of supply chain complex networks authored by Xiaobing Gan and Jingyi
Wang, a class of the supply chain problems was modeled as a complex network with nonlinearly coupled identical
nodes. Then the global adaptive synchronization problem on this class of supply chain problems is studied, and a
practical sufficient condition for the global synchronization is given. The computer simulations demonstrate the
effectiveness of the theory.
2. In solving constrained optimization problems with a hybrid genetic algorithm Genetic algorithm authored by
Dalian Liu, Xiao-hua Chen and Jin-ling Du, a new fitness function based hybrid genetic optimization algorithm for
constrained optimization problems is proposed. In designing crossover operator, Union Design is employed; In
designing new fitness function, the smooth function technique is adopted. Experiments on benchmark problems are
made and the results indicate the proposed algorithm can not only quickly converge to optimal or near-optimal solutions,
but also have a high performance.
3. In New Heuristic Algorithm of RNA Structure Prediction Including Pseudoknots authored by Zhendong Liu and
Daming Zhu, an improved heuristic algorithm is presented to predict RNA pseudoknotted structure, and it can compute
arbitrary pseudoknots. The algorithm requires O(n3) time and O(n2) space, and widens the maximum length of the RNA
sequence. The preliminary experiment shows that the algorithm is more effective than the existing algorithms.
4. In A Hybrid Simplex Multi-Objective Evolutionary Algorithm Based on A New Fitness Assignment Strategy
authored by Xiaofang Guo and Yuping Wang, a new algorithm is proposed for multi-objective optimization problems,
which adopts a new fitness assignment strategy using the information of the individual preference order ranking and the
individual density. In this way, it is helpful to guide the individuals to more sparse areas in the Pareto Front.
5. In Transactional Automaton-driven Web Services Selection authored by Weitao Ha, selection rules based on
transactional properties of service is defined first. An automaton model to implement transactional-aware service
selection is set up. Experimental results are also presented.
....
PREVIOUS PAPER
Recoverable Video Watermark in DCT Domain
NEXT PAPER
Last page
General Information
ISSN: 1796-203X
Abbreviated Title: J.Comput.
Frequency: Bimonthly
Abbreviated Title: J.Comput.
Frequency: Bimonthly
Editor-in-Chief: Prof. Liansheng Tan
Executive Editor: Ms. Nina Lee
Abstracting/ Indexing: DBLP, EBSCO, ProQuest, INSPEC, ULRICH's Periodicals Directory, WorldCat,etc
E-mail: jcp@iap.org
-
Nov 14, 2019 News!
Vol 14, No 11 has been published with online version [Click]
-
Mar 20, 2020 News!
Vol 15, No 2 has been published with online version [Click]
-
Dec 16, 2019 News!
Vol 14, No 12 has been published with online version [Click]
-
Sep 16, 2019 News!
Vol 14, No 9 has been published with online version [Click]
-
Aug 16, 2019 News!
Vol 14, No 8 has been published with online version [Click]
- Read more>>