Conference Program of WCICA 2012

More documents

Recommendations

Info

Conference Program WCICA 2012 Study on the Structure of Human Body Simulated Controller , pp.10–14 Wang, Peijin Yantai Univ. Wang, Xuejie Li, Yanjun Zhejiang Univ. City College Zhejiang Univ. City College According to object oriented methodology, all of the controller object, sensor object and actor object are intelligent in a human body simulated control system. The above three intelligent control objects can co-operate with each other to keep the controlled system safety and reliability although one of them does not work. The above three intelligent objects consist of human body simulated controller, each of them is analyzed simply in this paper. The human body simulated controller has been used in a real control system, it proves that the controller is best, and the control result is best. ◮ FrA01-3 14:10–14:30 Attitude Control of 3-DOF Helicopter based on Iterative Learning Control, pp.128–132 Zhang, Xining Liu, Chenglin Liu, Fei Jiangnan Univ. Jiangnan Univ. Inst. of Automation,Southern Yangtze Univ. Tracking control problems of the elevation and travel angles are investigated for 3-DOF (three degree of freedom) helicopter in this paper. By combining the normal PID controller based on LQR (linear quadratic regulator) and PID-type Iterative Learning Control, a new mixed controller is proposed for 3-DOF helicopter to achieve higher tracking accuracy. Compared with the normal PID controller based on LQR, the mixed controller can achieve better asymptotic converging effect for the control of the elevation and travel angles of 3-DOF helicopter. By the relatively small times of iteration, the system achieves quite high tracing accuracy under the mixed controller. ◮ FrA01-4 14:30–14:50 Dancing Behavior Modeling and Logic Control Simulation of Twowheeled Robot based on Stateflow, pp.89–92 Yu, Jianjun College of Electronic Information & Control Engineering, Beijing Univ. of Tech. Yang, Qiong Sun, Liang Wang, Guanwei Beijing Univ. of Tech. Inst. of Electric Information & Control Engineering Beijing Univ. of Tech. Using FSM (Finite State Machine) theory as the foundation, based on the MATLAB / Stateflow graphical behavior description method, realizes the wheeled robot dance behavior modeling, design of the wheeled mobile robot behavior control logic. The simulation results show that the simulation model can be constructed, simulated robot dance behavior of the actual process; the logic control method can realize the wheeled robot dance planning. And the modular design of concise and clear, design and debugging time is greatly reduced, cost is reduced, operation controllability enhancement, It can provide the theoretical basis for wheeled robot dance planning. ◮ FrA01-5 14:50–15:10 Stable flocking of mobile agents in mixed absolute and relative navigations context with communication , pp.67–73 Dang, Zhaohui National Univ. of Defense Tech. In this paper, we studied the flocking motion of multiple agents in mixed absolute/relative navigation condition with communication. The difference between navigation and communication in the role taken part in the neighbourhood relations was firstly pointed out. We gave a criterion which can judge whether a communication neighbourhood graph with mixed absolute/relative navigation devices is connected. We also proposed an algorithm to achieve the absolute navigation using the communication. Based on above preliminaries, we design a control law to stabilize the flocking motion of multiple agents whose dynamics are nonlinear with noise. The simulation in three different scenarios was performed and the corresponding results illustrated the effectiveness of the control law. ◮ FrA01-6 15:10–15:30 A Modified Fruit-Fly Optimization Algorithm Aided PID Controller Designing, pp.233–238 Liu, Yi ZheJiang Univ. City College Fruit Fly Optimization Algorithm (FOA) is one of the newest intelligent optimization algorithms. Attracted by its simple implement procedure with effective searching capability, our work is to popularize this algorithm to tackle some practical optimization applications requesting real-time performance. However, the updating strategy of FOA is with strong randomness, thus bringing in some blindness searching in solution updating, which will result in slow convergence rate and premature. Therefore, a modified FOA (MFOA) based on PSO and SA was proposed in this paper to improve the performance of basic FOA. Besides, Chaos funtion was used to enhance the stochastic and ergodic features of initial solution so as to improve the diversity of initial population in MFOA. PSO is introduced to reduce the blindness searching in solution updating. SA is used as a local search to improve the convergence rate. Finally, in order to verify the efficiency of MFOA algorithm, two common functions and a practical high-order AVR system with PID controller were tested in simulation. Experimental results revealed the encouraging performance of our proposed algorithm. FrA02 13:30–15:30 Room 203B Computational Intelligence and Applications (I) Chair: Zhang, Xuncai Co-Chair: Wu, Xiuli Zhengzhou Univ. of Light Industry Univ. of Sci. & Tech. Beijing ◮ FrA02-1 13:30–13:50 An Increasing on Knowledge of MAS Trained by Boltzmann Machine Algorithm based Sugarscape CA Using a Synergy of Communication and Cooperation bet Agents , pp.484–489 Nourafza, Nasim Setayeshi, Saeed Islamic Azad Univ. ,Najafabad Branch Amirkabir Univ. of Technolog Sugarscape model is a multi-agent environment that is used for modeling and organizing processes such as social, political and economic. After the previous studies which were concerned with the production of a learned multi-agent model based on Boltzmann Machine learning algorithm and also the evaluation of the learning of a learned system in sugarscape, the purpose of this study is to evaluate the learning done after adding the two parameters of communication and cooperation to the sugarscape learned model. Thus a cellular learned multiagent model with use of Boltzmann Machine learning algorithm based on sugarscape model was considered. In this model, each agent has been allocated with a parameter that indicates the knowledge of the agent. Once all agents reach sugar peaks it means that all agents have become knowledgeable and the model has converged. After that the two parameters of communication and cooperation are added to the given model and for each one of the models the number of agents present in sugar peaks after the model had reached convergence per the specific number of agents has been measured. After analyzing the resulting diagram it was concluded that after the convergence of the model, the average number of knowledgeable agents in learned model with communication and cooperation is higher than the number of knowledgeable agents in learned model without use of communication and cooperation. Therefore communication and cooperation of the a- gents causes to incre ◮ FrA02-2 13:50–14:10 Data Collection Based on Mobile Agent in Wireless Sensor Networks, pp.392–396 Li, Tongying National Astronomical Observatories / Nanjing Inst. of Astronomical Optics & Tech., Chinese Acad. of Sci., Nanjing Environment Changes due to temperature, humidity, wind loading and so on can affect the performance of a large telescope. The real-time information of environment change must be got in order to exert control, reduce or eliminate the adverse effects of environment changes on the large telescope. A novel method of environment monitoring for a large telescope based on wireless sensor networks has therefore been proposed to realize environment data acquisition, on-line-detection and 92
WCICA 2012 Book of Abstracts: Friday Sessions data analyzing in this paper, which provides the basis for the adjustment of the large telescope to improve its control performance and image quality. ◮ FrA02-3 14:10–14:30 3D DNA Self-Assembly for Maximum Clique Problem, pp.438–443 Zhang, Xuncai Fan, Rui Wang, Yanfeng Cui, Guangzhao Zhengzhou Univ. of Light Industry Zhengzhou Univ. of Light Industry Zhengzhou Univ. of Light Industry Zhengzhou Univ. of Light Industry DNA self-assembly technology has brought novel inspirations to the development of DNA computing. At present there are many diversified computational models to solve various NP problems, which are very useful of solving some complex NP problems. In this paper, 3D self - assembly model is presented to solve the maximum clique problem. With the capacity of DNA molecules in massive parallel computation, the model can simulate a non-deterministic algorithm and solve this problem. In this model, the number of distinct tiles used is a constant - 15, computation time is θ(n2), and computation space is θ(n3). Our work makes a significant attempt to explore the computational power of 3D DNA self - assembly. ◮ FrA02-4 14:30–14:50 A Novel Content Based and Social Network Aided Online Spam Short Message Filter, pp.444–449 Yu, Yang Chen, Yuzhong Fuzhou Univ. Fuzhou Univ. With the rapid development of mobile SMS (short message service), spam messages have grown explosively which trouble our daily life seriously and lead to the loss of telecom operators. In this paper, an online spam filter based on the analysis of two criteria of content representations and relationship between the senders and receivers in social network is proposed. A Naïve Bayesian classifier is used to build up the filter including both the content features and social network features. We use the data provided by a partner telecom operator to do the experiments. The results show that our model is effective and satisfies all the requirements of our partner and will be deployed recently. ◮ FrA02-5 14:50–15:10 Solving the Flexible Job-shop Scheduling Problem with Quantuminspired Algorithm, pp.538–543 Wu, Xiuli Univ. of Sci. & Tech. Beijing The flexible job shop scheduling problem (FJSP) is typically NP hard. A quantum inspired algorithm is proposed to solve the FJSP. Firstly, the FJSP is formulated. Secondly, the detail of the quantum inspired algorithm is designed, including the quantum chromosome encoding and decoding mechanism, the updating method with the rotation gate matrix. The elitist strategy is integrated to speed up the convergence. The niche technology is combined to avoid trapping into the local optimization. Finally, some benchmark instances are tested to verify the performance of the proposed algorithm. The results shows that the proposed algorithm outperform the compared algorithms. ◮ FrA02-6 15:10–15:30 Max-Min Ant System for Bus Transit Multi-depot Vehicle Scheduling Problem with Route Time Constraints, pp.555–560 Hao, Xiao Ni Jin, Wen Zhou Wei, Ming South China Univ. of Tech. South China Univ. of Tech. South China Univ. of Tech. The bus transit vehicle scheduling problem (VSP), in which a given set of scheduled trips have to be assigned to vehicles stationed at different depots, minimizing the capital cost and the overall operational cost, has caused great concern to the bus transit companies. Considering the real world operational restrictions, this paper researches the bus transit multi-depot vehicle scheduling problem with route time constraints and depot capability restrictions, and puts forward a model with comprehensive objective to minimize the number of required vehicles, travel time along deadheading trips and the waiting time at the starting stations of service trips for VSP satisfying a set of constraints. This problem is NPhard, and therefore its solution is obtained by a Max-Min ant system. This article describes steps of the whole algorithm in detail, especially construction of solutions and pheromone updating rule. Finally, an example was analyzed to demonstrate that the correctness of the application of the MMAS, and it prove to be more efficient and effective in solving this problem compared with the ACS. FrA03 13:30–15:30 Room 203C Artificial Intelligence Chair: Feng, Xin Co-Chair: Han, Deqiang Marquette Univ. Xi’an Jiaotong Univ. ◮ FrA03-1 13:30–13:50 Hierarchical Proportional Redistribution principle for uncertainty reduction and bba approximation, pp.664–671 Dezert, Jean Han, Deqiang Liu, Zhunga Tacnet, Jean-marc ONERA Xi’an Jiaotong Univ. NW Polytech. Univ Cemagref-ETGR Dempster-Shafer evidence theory is very important in the fields of information fusion and decision making. However, it always brings high computational cost when the frames of discernments to deal with become large. To reduce the heavy computational load involved in many rules of combinations, the approximation of a general belief function is needed. In this paper we present a new general principle for uncertainty reduction based on hierarchical proportional redistribution (HPR) method which allows to approximate any general basic belief assignment (bba) at a given level of non-specificity, up to the ultimate level 1 corresponding to a Bayesian bba. The level of non-specificity can be adjusted by the users. Some experiments are provided to illustrate our proposed HPR method. ◮ FrA03-2 13:50–14:10 An algorithm based on piecewise slope transformation distance for short time series similarity measure, pp.691–695 Li, Huimin Fang, Liying Wang, Pu Liu, Jingwei Beijing Univ. of Tech. Beijing Univ. of Tech. Beijing Univ. of Tech., China Beijing Univ. of Tech. Abstract - Aiming at the irregular and uneven feature of medicine time series data, an novel algorithm based on piecewise slope transformation distance for short time series similarity measure is proposed. We firstly do some preprocess based on algorithm for key points selected, make the data curve to zigzag shape, then, we measure the distance between two curves based on piecewise slope transformation algorithm. By experiments, conclusion can be made that this new approach can measure distance rapidly and correctly, especially appropriate to short time series data. ◮ FrA03-3 14:10–14:30 Pruning-Included Weights and Structure Determination of 2-Input Neuronet Using Chebyshev Polynomials of Class 1, pp.700–705 Zhang, Yunong Yin, YongHua Yu, Xiaotian Guo, Dongsheng Xiao, Lin Sun Yat-sen Univ. Sun Yat-sen Univ. Sun Yat-sen Univ. Sun Yat-Sen Univ. Sun Yat-sen Univ. A new type of feed-forward 2-input neuronet using Chebyshev polynomials of Class 1 (2INCP1) is constructed and investigated in this paper. In addition, with the weights-direct-determination method exploited to obtain the optimal weights from hidden layer to output layer directly (i.e., just in one step), a new structure-automatic-determination method called weights-and-structure-determination (WASD) algorithm is proposed to determine the optimal number of hidden-layer neurons of the 2INCP1. Such a WASD algorithm includes a procedure of pruning the proposed neuronet (after the net grows up). Numerical results further substantiate the efﬁcacy of the 2INCP1 equipped with the so-called WASD algorithm. ◮ FrA03-4 14:30–14:50 93
Page 1 and 2:
WCICA 2012 The 10 th World Congress
Page 3 and 4:
WCICA 2012 Welcome Welcome It is ou
Page 5 and 6:
WCICA 2012 Sponsorships Sponsorship
Page 7 and 8:
WCICA 2012 Organizing Committee Org
Page 9 and 10:
WCICA 2012 Program Committee Progra
Page 11 and 12:
WCICA 2012 Program Committee Lilin
Page 13 and 14:
WCICA 2012 Instruction for Oral and
Page 15 and 16:
WCICA 2012 Transportation Fig. 1: L
Page 17 and 18:
WCICA 2012 Floor Plan of BICC Exhib
Page 19 and 20:
WCICA 2012 Plenary Lectures Multi-Z
Page 21 and 22:
WCICA 2012 Plenary Lectures Plenary
Page 23 and 24:
Page 25 and 26:
Page 27 and 28:
WCICA 2012 Plenary Panel Sessions P
Page 29 and 30:
WCICA 2012 Plenary Panel Sessions g
Page 31 and 32:
WCICA 2012 Plenary Panel Sessions a
Page 33 and 34:
WCICA 2012 Pre-conference Workshops
Page 35 and 36:
Page 37 and 38:
Page 39 and 40:
Page 41 and 42:
Page 43 and 44:
WCICA 2012 Best Paper Awards and Fi
Page 45 and 46: 41 WCICA 2012 Program Schedule July
Page 47 and 48: WCICA 2012 Technical Program Techni
Page 49 and 50: WCICA 2012 Technical Program: Frida
Page 67 and 68: WCICA 2012 Technical Program: Satur
Page 87 and 88: WCICA 2012 Technical Program: Sunda
Page 95: WCICA 2012 Book of Abstracts Book o
Page 99 and 100: WCICA 2012 Book of Abstracts: Frida
Page 147 and 148:
WCICA 2012 Book of Abstracts: Frida
Page 149 and 150:
Page 151 and 152:
Page 153 and 154:
WCICA 2012 Book of Abstracts: Satur
Page 155 and 156:
Page 157 and 158:
Page 159 and 160:
Page 161 and 162:
Page 163 and 164:
Page 165 and 166:
Page 167 and 168:
Page 169 and 170:
Page 171 and 172:
Page 173 and 174:
Page 175 and 176:
Page 177 and 178:
Page 179 and 180:
Page 181 and 182:
Page 183 and 184:
Page 185 and 186:
Page 187 and 188:
Page 189 and 190:
Page 191 and 192:
Page 193 and 194:
Page 195 and 196:
Page 197 and 198:
Page 199 and 200:
Page 201 and 202:
Page 203 and 204:
Page 205 and 206:
Page 207 and 208:
Page 209 and 210:
WCICA 2012 Book of Abstracts: Sunda
Page 211 and 212:
Page 213 and 214:
Page 215 and 216:
Page 217 and 218:
Page 219 and 220:
Page 221 and 222:
Page 223 and 224:
Page 225 and 226:
Page 227 and 228:
Page 229 and 230:
WCICA 2012 Author Index Author Inde
Page 231 and 232:
WCICA 2012 Author Index . . . . . .
Page 233 and 234:
Page 235 and 236:
Page 237 and 238:
Page 239 and 240:
Page 241 and 242:
Page 243 and 244:
WCICA 2012 Author Index W Wan, Chua
Page 245 and 246:
Page 247 and 248:
Page 249 and 250:
Page 251 and 252:
Page 253 and 254:
WCICA 2012 Chair/Co-Chair Index Cha
show all

Conference Program of WCICA 2012

Create successful ePaper yourself

Delete template?

Save as template?