Communications in Computer and Information Science
135
Ran Chen (Ed.)
Intelligent Computing and Information Science International Conference, ICICIS 2011 Chongqing, China, January 8-9, 2011 Proceedings, Part II
13
Volume Editor Ran Chen The Key Laboratory of Manufacture and Test Chongqing University of Technology Chongqing, 400054, P. R. China E-mail:
[email protected]
Library of Congress Control Number: Applied for CR Subject Classification (1998): I.2, H.4, H.3, C.2, H.5, D.2 ISSN ISBN-10 ISBN-13
1865-0929 3-642-18133-3 Springer Berlin Heidelberg New York 978-3-642-18133-7 Springer Berlin Heidelberg New York
This work is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, re-use of illustrations, recitation, broadcasting, reproduction on microfilms or in any other way, and storage in data banks. Duplication of this publication or parts thereof is permitted only under the provisions of the German Copyright Law of September 9, 1965, in its current version, and permission for use must always be obtained from Springer. Violations are liable to prosecution under the German Copyright Law. springer.com © Springer-Verlag Berlin Heidelberg 2011 Printed in Germany Typesetting: Camera-ready by author, data conversion by Scientific Publishing Services, Chennai, India Printed on acid-free paper 06/3180
Preface
The 2011 International Conference on Intelligent Computing and Information Science (ICICIS 2011) was held in Chongqing, China, during January 8–9, 2011. The aim of the conference series is to provide a platform for researchers, engineers, academicians as well as industrial professionals from all over the world to present their research results and development activities in intelligent computing and information science. This two-volume set of CCIS 134 and CCIS 135 communicates the latest progress and research results in the theory, methods, and technology in the field of intelligent computing and information science if it also presents an update on the international trends, which will drive the global communication and cooperation in production, education and research in this field. We received more than 600 submissions which were reviewed by international experts, and 230 papers were selected for presentation. We believe the proceedings provide the reader with a broad overview of the latest advances in the field of intelligent computing and information science. On behalf of the guest editors for this special issue, I would like to thank the National 863 Program of China and the National Science Fund of China. I also thank the conference organization staff and the members of the International Technical Committees for their hard work. We look forward to seeing all of you next year at ICICIS 2012.
October 2010 Ran Chen
ICICIS 2011 Committee
Conference Chairman Ran Chen
Chongqing University of Technology, China
Publication Chair Wenli Yao
Control Engineering and Information Science Research Association, Hong Kong International Frontiers of Science and Technology Research Association
International Technical Committees Peifu Chen Lin Mi Viranjay M. Srivastava Liu Yunan Mir Mahdi Zalloi Wang Liying Zhou Liang Chenggui Zhao Rahim Jamian Li-Xin GUO Wen-Sheng Ou Hsiang-Chuan Liu Mostafa Shokshok Ramezan ali Mahdavinejad Wei Fu Anita Kova Kralj Tjamme Wiegers Gang Shi Zengtao Chen Bhagavathi Tarigoppula
Chongqing Aerospace Polytechnic College, China Chongqing University of Technology, China Jaypee University of Information Technology, Solan, India University of Michigan, USA Iran Institute of Water Conservancy and Hydroelectric Power, China Donghua University, China Yunnan University of Finance and Economics, China Universiti Kuala Lumpur Malaysian Spanish Institute, Malaysia Northeastern University, China National Chin-Yi University of Technology, Taiwan R.O.C. Asia University, Japan National University of Malaysia, Malaysia University of Tehran, Iran Chongqing University, China University of Maribor, Slovenia Delft University of Technology, The Netherlands Inha University, South Korea University of New Brunswick, Canada Bradley University, USA
VIII
Organization
Co-Sponsored by Control Engineering and Information Science Research Association International Frontiers of science and technology Research Association Chongqing Xueya Conferences Catering Co., Ltd Chongqing University of Technology
Table of Contents – Part II
Unified Electronic Currency Based on the Fourth Party Platform Integrated Payment Service . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Xu Yong and Hu Qiqi
1
Modeling and Power Flow Analysis for Herringbone Gears Power Dual-Branching Transmission System . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Xiaofang Yang, Yanxiang Zhu, Zongde Fang, and Jiangong Gu
7
Research on SaaS and Web Service Based Order Tracking . . . . . . . . . . . . . Jianhua Jiang, Buyun Sheng, Lixiong Gong, and Mingzhong Yang
16
Research and Analyses on Unsteady Heat Transfer of Inner Thermal Insulation Wall During Multi-temperature Refrigerated Transportation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Guanghai Liu, Ruhe Xie, and Yongcai Sun Evaluation of the Industrial Economic Benefits Based on TOPSIS . . . . . . Baolu Wei, Feng Dai, and Jingxu Liu Optimization and Distributing Research of Measuring Points for Thermal Error of CNC Machine Based on Weighted Grey Relative Analysis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Qin Wu, Jianjun Yang, Zhiyuan Rui, and Fuqiang Wang A DS-UWB Cognitive Radio System Based on Bridge Function Smart Codes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Yafei Xu, Sheng Hong, Guodong Zhao, Fengyuan Zhang, Jinshan Di, and Qishan Zhang Problems and Countermeasures of Zhejiang High-Tech Enterprises Industry-University-Institute Cooperation in China . . . . . . . . . . . . . . . . . . . Qing Zhou, Chong-Feng Mao, and Lin Hou Research on Puncture Area Calibration of Image Navigation for Radio Frequency Ablation Robot . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Peng Wang, Wei Cao, Wenhao Jiang, Jinglei Xin, Shaochen Kang, and Xin Li Low Power and Robust Domino Circuit with Process Variations Tolerance for High Speed Digital Signal Processing . . . . . . . . . . . . . . . . . . . Jinhui Wang, Xiaohong Peng, Xinxin Li, Ligang Hou, and Wuchen Wu
23 30
35
41
47
53
59
X
Table of Contents – Part II
Detection of Attention-to-Rest Transition from EEG Signals with the Help of Empirical Mode Decomposition . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Cheng Man Ng and Mang I. Vai
66
A Traffic Information Estimation Model Using Periodic Location Update Events from Cellular Network . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Bon-Yeh Lin, Chi-Hua Chen, and Chi-Chun Lo
72
The Application of Virtual Reality on Distance Education . . . . . . . . . . . . . Zehui Zhan
78
Framework Design of Unified Cross-Authentication Based on the Fourth Platform Integrated Payment . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Xu Yong and He Yujin
84
Analysis towards VMEM File of a Suspended Virtual Machine . . . . . . . . . Zheng Song, Bo Jin, and Yongqing Sun
89
Optimization and Reconfiguration of Advanced Manufacturing Mode Based on Object-Based Knowledge Mesh and Improved Immune Genetic Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Chaogai Xue and Haiwang Cao Modeling and Simulation of Water Allocation System Based on Simulated Annealing Hybrid Genetic Algorithm . . . . . . . . . . . . . . . . . . . . . . Jiulong Zhu and Shijun Wang Study on Feed-Forward MAP-Based Vector Control Method of Vehicle Drive Motor . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Yafu Zhou, Xiaoyong Shen, Jing Lian, Xinhan Sun, Jun Li, Minghui Liu, and Ziliang Zhao
98
104
110
Condition Monitoring and Fault Diagnosis of Wet-Shift Clutch Transmission Based on Multi-technology . . . . . . . . . . . . . . . . . . . . . . . . . . . . Man Chen, Liyong Wang, and Biao Ma
116
Circulant Graph Modeling Deterministic Small-World Networks . . . . . . . . Chenggui Zhao
124
Research on Risk Manage of Power Construction Project Based on Bayesian Network . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Zhengyuan Jia, Zhou Fan, and Yong Li
128
The Design of Logistics Information Matching Platform for Highway Transportation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Daqiang Chen, Xiaoxiao Zhu, Bing Tong, Xiahong Shen, and Tao Feng
135
Table of Contents – Part II
XI
An Intelligent Prediction Method Based on Information Entropy Weighted Elman Neural Network . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Tao Chen, Xiao-li Xu, and Shao-hong Wang
142
A Multi-layer Dynamic Model for Coordination Based Group Decision Making in Water Resource Allocation and Scheduling . . . . . . . . . . . . . . . . . Wei Huang, Xingnan Zhang, Chenming Li, and Jianying Wang
148
Analysis of Mode Choice Performance among Heterogeneous Tourists to Expo Shanghai 2010 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Shengchuan Jiang, Yuchuan Du, and Lijun Sun
154
Hybrid Schema Matching for Deep Web . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Kerui Chen, Wanli Zuo, Fengling He, and Yongheng Chen
165
Study on DS/FH Technology Used in TT&C System . . . . . . . . . . . . . . . . . Chang Xiaoming, Zhang Xiaolin, and Huang Zhengjing
171
RFID-Based Critical Path Expert System for Agility Manufacture Process Management . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Haifang Cheng and Yuli Xiang
177
Research on the Evolutionary Strategy Based on AIS and Its Application on Numerical Integration . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Li Bei
183
Prediction of the NOx Emissions from Thermal Power Plant Based on Support Vector Machine Optimized by Chaos Optimization Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Jingmin Wang, Junjie Kang, and Huaitao Liang
189
Optimizing of Bioreactor Heat Supply and Material Feeding by Numerical Calculation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Zhiwei Zhou, Boyan Song, Likuan Zhu, Zuntao Li, and Yang Wang
195
Research on Technique of the Cyberspace Public Opinion Detection and Tracking . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Yongping Du, Jiangli Liu, and Ming He
203
A High Performance 50% Clock Duty Cycle Regulator . . . . . . . . . . . . . . . . Peng Huang, Hong-Hui Deng, and Yong-Sheng Yin
208
Study on Risk of Enterprise’ Technology Innovation Based on ISM . . . . . Hongyan Li
215
Study on Reservoir Group Dispatch of Eastern Route of South-to-North Water Transfer Project Based on Network . . . . . . . . . . . . . . . . . . . . . . . . . . . Hongyan Li
221
XII
Table of Contents – Part II
Immune Clone Algorithm to Solve the Multi-object Problems . . . . . . . . . . Liang Zhou and Jianguo Zheng
227
Foreign Language Teachers’ Professional Development in Information Age . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Xiying Fan and Gang Wu
233
Active Learning Framework Combining Semi-supervised Approach for Data Stream Mining . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Mahnoosh Kholghi and MohammadReza Keyvanpour
238
Sensorless Vector Control of the Charging Process for Flywheel Battery with Artificial Neural Network Observer . . . . . . . . . . . . . . . . . . . . . . . . . . . . Honglin Qin, Meng Huang, Zhixiong Li, and Shuangqing Tang
244
Framework for Classifying Website Content Based on Folksonomy in Social Bookmarking . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Shih-Ming Pi, Hsiu-Li Liao, Su-Houn Liu, and Chen-Wen Lin
250
Research on Internal Damping Algorithm of Marine Inertial Navigation System . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Li Kui, Liu Fang, and Xu Yefeng
256
Design and Implementation of Process Migrating among Multiple Virtual Machines . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Si Shen, Zexian Zhang, Shuangxi Yang, Ruilin Guo, and Murong Jiang
262
The Adaptability Evaluation of Enterprise Information Systems . . . . . . . . Junjuan Liu, Chaogai Xue, and Lili Dong
268
Structural Damage Alarm Utilizing Modified Back-Propagation Neural Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Xiaoma Dong
273
Computation of Virtual Regions for Constrained Hybrid Systems . . . . . . Jianqiang Li, Zhen Ji, and Hai-long Pei
279
Fault Diagnosis of Diesel Engine Using Vibration Signals . . . . . . . . . . . . . . Fengli Wang and Shulin Duan
285
Influences on the Directivity of Acoustic Vector Sensor by Soft Finite Cylinder Baffle . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Ji Jianfei, Liang Guolong, Zhang Guangpu, and Li Yang
291
The Method of Intervenient Optimum Decision Based on Uncertainty Information . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Lihua Duan
296
Table of Contents – Part II
The Deflection Identify of the Oil Storage Tank . . . . . . . . . . . . . . . . . . . . . . Jingben Yin, Hongwei Jiao, Jiemin Zhang, Kaina Wang, and Jiahui Ma
XIII
302
PID Control of Miniature Unmanned Helicopter Yaw System Based on RBF Neural Network . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Yue Pan, Ping Song, and Kejie Li
308
Identity-Based Inter-domain Authentication Scheme in Pervasive Computing Environments . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Shi-Wei Huo, Chang-Yuan Luo, and Hong-Zhi Xin
314
Computer Simulation of Blast Wall Protection under Methane-Air Explosion on an Offshore Platform . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Changjian Wang, Weigang Yan, Jin Guo, and Changming Guo
321
Throughput Analysis of Discrete-Time Non-persistent CSMA with Monitoring in Internet of Things . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Hongwei Ding, Dongfeng Zhao, and Yifan Zhao
327
The Effect of Product Placement Marketing on Effectiveness of Internet Advertising . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Hsiu-Li Liao, Su-Houn Liu, Shih-Ming Pi, and Hui-Ju Chen
332
A Modular Approach to Arithmetic and Logic Unit Design on a Reconfigurable Hardware Platform for Educational Purpose . . . . . . . . . . . Halit Oztekin, Feyzullah Temurtas, and Ali Gulbag
338
A Variance Based Active Learning Approach for Named Entity Recognition . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Hamed Hassanzadeh and MohammadReza Keyvanpour
347
Research on Routing Selection Algorithm Based on Genetic Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Guohong Gao, Baojian Zhang, Xueyong Li, and Jinna Lv
353
Optimization of the Performance Face Recognition Using AdaBoost-Based . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Mohsen Faghani, Md Jan Nordin, and Shahed Shojaeipour
359
Design and Implementation Issues of Parallel Vector Quantization in FPGA for Real Time Image Compression . . . . . . . . . . . . . . . . . . . . . . . . . . . Krupa R. Rasane and Srinivasa Rao R. Kunte
366
Discriminative Novel Information Detection of Query-Focused Update Summarization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Jinguang Chen and Tingting He
372
XIV
Table of Contents – Part II
Visualization of Field Distribution of the Circular Area Based on the Green Function Method . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Gang Wu and Xiying Fan Efficient Genetic Algorithm for Flexible Job-Shop Scheduling Problem Using Minimise Makespan . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Hamid Ghaani Farashahi, B.T.H.T. Baharudin, Shahed Shojaeipour, and Mohammad Jaberi
378
385
Core Image Coding Based on WP-EBCOT . . . . . . . . . . . . . . . . . . . . . . . . . . Yongdan Nie, Yan Zhang, and Jinghui Li
393
A New Method of Facial Expression Recognition Based on SPE Plus SVM . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Zilu Ying, Mingwei Huang, Zhen Wang, and Zhewei Wang
399
Multiple Unmanned Air Vehicles Control Using Neurobiologically Inspired Algorithms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Yong Zhang and Li Wang
405
The Use of BS7799 Information Security Standard to Construct Mechanisms for the Management of Medical Organization Information Security . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Shu-Fan Liu, Hao-En Chueh, and Kuo-Hsiung Liao
411
An Improved Frame Layer Rate Control Algorithm for H.264 . . . . . . . . . . Xiao Chen and Feifei Lu
417
Some Properties in Hexagonal Torus as Cayley Graph . . . . . . . . . . . . . . . . Zhen Zhang
422
Modeling Software Component Based on Extended Colored Petri Net . . . Yong Yu, Tong Li, Qing Liu, and Fei Dai
429
Measurement of Software Coupling Based on Structure Entropy . . . . . . . . Yong Yu, Tong Li, Qing Liu, and Qian Yu
435
A 3D Grid Model for the Corridor Alignment . . . . . . . . . . . . . . . . . . . . . . . . Kun Miao and Liang Li
440
The Consumers’ Decisions with Different Delay Cost in Online Dual Channels . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Shengli Chen
445
Fuzzy Control for the Swing-Up of the Inverted Pendulum System . . . . . Yu Wu and Peiyi Zhu
454
A Novel OD Estimation Method Based on Automatic Vehicle Identification Data . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Jian Sun and Yu Feng
461
Table of Contents – Part II
Stress Field in the Rail-End during the Quenching Process . . . . . . . . . . . . Siqiang Xu, Jianyi Kong, Gongfa Li, Jintang Yang, Hegen Xiong, and Guozhang Jiang
XV
471
A Novel Adaptive Target Tracking Algorithm in Wireless Sensor Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Xuewen Wu, Guan Huang, Dunye Tang, and Xinhong Qian
477
Computer Management of Golden Section Effect of Physical Pendulum . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Jia Jing, Hui Lin, Caixia Liu, and Ying Zhu
487
Simulation Study of Gyrotron Traveling Wave Amplifier with Distributed-Loss in Facilities for Aquaculture . . . . . . . . . . . . . . . . . . . . . . . . Xufeng Hua, Chengxun Chen, Dawei Xu, and Kezhi Xing
492
The Worm Propagation Model with Dual Dynamic Quarantine Strategy . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Yu Yao, Xiao-wu Xie, Hao Guo, Fu-xiang Gao, and Ge Yu
497
Keyword Extraction Algorithm Based on Principal Component Analysis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Chang-Jin Li and Hui-Jian Han
503
A Web Information Retrieval System . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Tae-Hyun Kim, Dong-Chul Park, Woong Huh, Hyen-Ug Kim, Chung-Hwa Yoon, Chong-Dae Park, Dong-Min Woo, Taikyeong Jeong, Il-Hwan Cho, and Yunsik Lee
509
An Effective Intrusion Detection Algorithm Based on Improved Semi-supervised Fuzzy Clustering . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Xueyong Li, Baojian Zhang, Jiaxia Sun, and Shitao Yan
515
What Does Industry Really Want in a Knowledge Management System? A Longitudinal Study of Taiwanese Case . . . . . . . . . . . . . . . . . . . . Liang-Chih Yang and Hsi-Peng Lu
521
A Process Positioning System for Sheet-Fed Offset Press . . . . . . . . . . . . . . Li E. Ma, Hai Yan Zhang, and Wei Li
532
Research of Electronic Image Stabilization Algorithm Based on Orbital Character . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Xiaodong Xian, Peipei Hou, Shan Liang, and Ping Gan
538
Study on USB Based CAN Bus for Data Measurement System . . . . . . . . . Weibin Wu, Tiansheng Hong, Yuqing Zhu, Guangbin He, Cheng Ye, Haobiao Li, and Chuwen Chen
544
XVI
Table of Contents – Part II
Research of WLAN CAN Bus Data Test System . . . . . . . . . . . . . . . . . . . . . Weibin Wu, Yuqing Zhu, Tiansheng Hong, Cheng Ye, Zhijie Ye, Guangbin He, and Haobiao Li
550
A Framework of Simple Event Detection in Surveillance Video . . . . . . . . . Weiguang Xu, Yafei Zhang, Jianjiang Lu, Yulong Tian, and Jiabao Wang
556
ESDDM: A Software Evolution Process Model Based on Evolution Behavior Interface . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Na Zhao, Jian Wang, Tong Li, Yong Yu, Fei Dai, and Zhongwen Xie
562
A Loading Device for Intervertebral Disc Tissue Engineering . . . . . . . . . . Lihui Fu, Chunqiu Zhang, Baoshan Xu, Dong Xin, and Jiang Li
568
The Optimization of Spectrum Sensing Frame Time . . . . . . . . . . . . . . . . . . Dongmei Shu, Jinkuan Wang, Xin Song, and Bin Wang
574
A Novel Model for the Mass Transfer of Articular Cartilage: Rolling Depression Load Device . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Zhenmin Fan, Chunqiu Zhang, Haiying Liu, Baoshan Xu, Jiang Li, and Lilan Gao
580
Sensor Scheduling Target Tracking-Oriented Cluster-Based . . . . . . . . . . . . Dongmei Yan, JinKuan Wang, Li Liu, and Bin Wang
586
Improved Stack Algorithm for MIMO Wireless Communication Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Li Liu, Jinkuan Wang, Dongmei Yan, Ruiyan Du, and Bin Wang
592
The Cooperative Hunting Research of Mobile Wireless Sensor Network Based on Improved Dynamic Alliance . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Daming Pei, Ping Song, Xiaobing Han, and Kejie Li
599
Identification of Matra Region and Overlapping Characters for OCR of Printed Bengali Scripts . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Subhra Sundar Goswami
606
New Energy Listed Companies Competitiveness Evaluation Based on Modified Data Envelopment Analysis Model . . . . . . . . . . . . . . . . . . . . . . . . . Chong Gao, Zhou Fan, and Jian-ze Zhang
613
A SMA Actuated Earthworm-Like Robot . . . . . . . . . . . . . . . . . . . . . . . . . . . Y.K. Wang, C.N. Song, Z.L. Wang, C. Guo, and Q.Y. Tan
619
Design of Instruction Execution Stage for an Embedded Real-Time Java Processor . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Guang Hu, Zhilei Chai, and Wenke Zhao
625
Table of Contents – Part II
XVII
A Survey of Enterprise Architecture Analysis Using Multi Criteria Decision Making Models (MCDM) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Mehmooda Jabeen Zia, Farooque Azam, and Maria Allauddin
631
Research of Manufacture Time Management System Based on PLM . . . . Ni Jing, Zhu Juan, and Zhong Liangwei
638
A Non-rigid Registration Method for Dynamic Contrast Enhancement Breast MRI . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Yangping Wang, Jianwu Dang, Xiaogang Du, and Sha Li
644
Iterative Algorithms for Nonexpansive Semigroups with Generalized Contraction Mappings in Banach Space . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Qiang Lin
650
Water Distribution System Optimization Using Genetic Simulated Annealing Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Shihu. Shu
656
Distributed Workflow Service Composition Based on CTR Technology . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Zhilin Feng and Yanming Ye
662
Offline Optimization of Plug-In Hybrid Electric Vehicle Energy Management Strategy Based on the Dynamic Programming . . . . . . . . . . . Shichun Yang, Ming Li, Haigang Cui, Yaoguang Cao, Gang Wang, and Qiang Lei
668
Development of Field Information Monitoring System Based on the Internet of Things . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Ken Cai, Xiaoying Liang, and Keqiang Wang
675
System Design of Real Time Vehicle Type Recognition Based on Video for Windows (AVI) Files . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Wei Zhan and Zhiqing Luo
681
Subjective Assessment of Women’s Pants’ Fit Analysis Using Live and 3D Models . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Linli Zhang, Weiyuan Zhang, and Hong Xiao
687
A Geographic Location-Based Security Mechanism for Intelligent Vehicular Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Gongjun Yan, Jingli Lin, Danda B. Rawat, and Weiming Yang
693
XVIII
Table of Contents – Part II
Intrusion-Tolerant Location Information Services in Intelligent Vehicular Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Gongjun Yan, Weiming Yang, Earl F. Shaner, and Danda B. Rawat
699
The Role of Network and Mobility Simulators in Evaluating Vehicular Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Gongjun Yan, Jingli Lin, Danda Rawat, and Justin C. Enyart
706
Author Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
713
Table of Contents – Part I Some Analysis and Research of the AdaBoost Algorithm . . . . . . . . . . . . . . Peng Wu and Hui Zhao
1
Simulation the Heat Flow Field in Cooler of Rotary Calcining Kiln . . . . . Yonggang Liu, Jishun Li, Xianzhao Jia, Weimin Pan, and Zhiming Liao
6
Teaching Platform Scheme of Engineering Testing Curriculums Based on LabVIEW . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Tingrui Liu, Xiuhua Sui, and Huibin Liang
12
Software Development Cost and Time Forecasting Using a High Performance Artificial Neural Network Model . . . . . . . . . . . . . . . . . . . . . . . . Iman Attarzadeh and Siew Hock Ow
18
A Weighted Combination Method of Target Identity Identification . . . . . Jin Hongbin, Lan Jiangqiao, and Li Hongfei
27
Fault Diagnosis of Power Transformer Based on BP Combined with Genetic Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Weiguo Zhao, Yanning Kang, Gangzhu Pan, and Xinfeng Huang
33
The Complexities of Implementing Cluster Supply Chain – Case Study of JCH . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Xiao Xue, Jibiao Zhang, and Yang Wang
39
Fault Diagnosis of Rolling Bearing Based on Lyapunov Exponents . . . . . . Liying Wang, Huang Meng, and Yanning Kang
45
New Encryption Scheme of One-Time Pad Based on KDC . . . . . . . . . . . . Xin Xie, Honglei Chen, Ying Wu, Heng Zhang, and Peng Wu
51
Three Dimensional Canonical Correlation Analysis and Its Application to Facial Expression Recognition . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Lei Gang, Zhang Yong, Liu Yan-Lei, and Deng Jing
56
Technology Barriers Analysis on Bearing Industry Based on Relational Matrix Method . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Xianzhao Jia, Feng Lv, Yonggang Liu, and Juan Wang
62
Optimizational Study on Computing Method of Channel Earthwork Based on MATLAB . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Yuqiang Wang, Jianqiang Zhang, and Yinghua Wang
69
A New Co-training Approach Based on SVM for Image Retrieval . . . . . . Hui Liu, Hua Han, and Zhenhua Li
77
XX
Table of Contents – Part I
Recognizing Human Activities Using Non-linear SVM Decision Tree . . . . Haiyong Zhao, Zhijing Liu, and Hao Zhang
82
Research on Logistics Service Providers Selection Based on AHP and VIKOR . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Lu Shan
93
Research on Digitized Scenario for Tactical Internet Simulative Training . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Jian-jun Shen, Hua Tian, and Zhi-chun Gan
99
Numerical Simulation for the Timoshenko Beam Equations with Boundary Feedback . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Dian-kun Wang and Fu-le Li
106
A Study on Technology Architecture and Serving Approaches of Electronic Government System . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ChunNian Liu, YiYun Huang, and Qin Pan
112
Construction and Development of CRM Technology and Industry Chain in China . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ChunNian Liu, YongLong Wang, and Qin Pan
118
Multi Scale Adaptive Median Filter for Impulsive Noise Removal . . . . . . . Xiangzhi Bai, Fugen Zhou, Zhaoying Liu, Ting Jin, and Bindang Xue
124
GA-Based Optimization Approach of Fractional Linear Neural Network and Its Application . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Guowei Yang and Lei Guo
130
Study of Unicyclic Graph with Maximal General Randi´c Index Rα for α < 0 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Deqiang Chen
136
Study on Molecular Dynamics Simulation of Calcium Silicate Hydrate (C-S-H) Gels . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Peng Hu and Wei Dai
142
Apply Ensemble of Lazy Learners to Biomedical Data Mining . . . . . . . . . Liu Pengfei and Tang Wulei
148
Molecular Dynamics Simulation on Calcium Silicate Hydrate Doped Organic Molecules . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Wei Dai, Zhonghe Shui, and Ping Duan
155
Construction of Energy Management and Control Information System in Iron and Steel Enterprise . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Wen Qiang Sun, Jiu Ju Cai, and Yong Liu
161
Table of Contents – Part I
XXI
Review of Dynamic Modeling and Simulation of Large Scale Belt Conveyor System . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Qing He and Hong Li
167
Identification of Network Traffic Based on Radial Basis Function Neural Network . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Yabin Xu and Jingang Zheng
173
Thermal Hotspots in CPU Die and It’s Future Architecture . . . . . . . . . . . Jian Wang and Fu-yuan Hu
180
A Modified Nearest Neighbor Classification Approach Based on Class-Wise Local Information . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Deqiang Han, Chongzhao Han, and Yi Yang
186
The kinematics and Dynamics Simulation of the Collision between the Rigid Rod and the Ground . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Lulu Gao and Wenli Yao
193
Research on Innovative Practice Teaching System Based on the High-End Practice Teaching Environment for Software Engineering Speciality . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Jianli Dong, Cunhua Li, Zhaohui Ji, and Junming Wu
199
Chaotic Artificial Bee Colony Used for Cluster Analysis . . . . . . . . . . . . . . . Yudong Zhang, Lenan Wu, Shuihua Wang, and Yuankai Huo
205
A DVE Time Management Simulation and Verification Platform Based on Causality Consistency Middleware . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Hangjun Zhou, Wei Zhang, Yuxing Peng, and Sikun Li
212
Ways of and Gains from Foreign Communication through Computer in China’s College Bilingual Teaching . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Ailing Gong, Tingrui Liu, and Yan Liu
219
Correction Method for Photoelectric Theodolite Measure Error Based on BP Neural Network . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Hai-yan Li and Yun-an Hu
225
The Application of LOGO! in Control System of a Transmission and Sorting Mechanism . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Jian Liu and Yuan-jun Lv
231
Design of Firmware Update Strategy in Tower Mounted Amplifier . . . . . . Yi Lv and Shuqin Han
237
Extraction of Urban Built-Up Land in Remote Sensing Images Based on Multi-sensor Data Fusion Algorithms . . . . . . . . . . . . . . . . . . . . . . . . . . . . Chengfan Li, Jingyuan Yin, Junjuan Zhao, and Lan Liu
243
XXII
Table of Contents – Part I
Coordinated Control and Localizing Target System for Multi-UAVs Based on Adaptive UKF . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Hengyu Li, Jun Luo, Lei Li, Jin Tong, and Shaorong Xie
249
Applying Fuzzy Data Mining to Telecom Churn Management . . . . . . . . . . Kuo-Hsiung Liao and Hao-En Chueh
259
Towards a Pre-computed Relation Matrix for Semantic Web Service . . . . Luokai Hu, Shi Ying, and Kai Zhao
265
Precise Localization of Facial Features Based on Cascade Fusion . . . . . . . Ying Chen, Chunlu Ai, and Chunjian Hua
271
Multi Scale Toggle Contrast Operator Based Image Analysis . . . . . . . . . . Xiangzhi Bai, Fugen Zhou, Zhaoying Liu, Bindang Xue, and Ting Jin
278
Prototype Design and Motion Analysis of a Spherical Robot . . . . . . . . . . . Shengju Sang, Ding Shen, Jichao Zhao, Wei Xia, and Qi An
284
An Algorithm of Fast Mining Frequent Neighboring Class Set . . . . . . . . . Gang Fang, Hong Ying, and Jiang Xiong
290
Research and Development Trends of Car Networking . . . . . . . . . . . . . . . . Wei He, Zhixiong Li, and Guotao Xie
296
A Research on MIMO Radar Based on Simulation . . . . . . . . . . . . . . . . . . . Zeng Jiankui and Dong Zhiming
302
Curriculum Reform Research of Computer Network Technology Based on School-Enterprise Cooperation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Peng Liu
308
Industry Cluster’s Adaptive Co-competition Behavior Modeling Inspired by Swarm Intelligence . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Wei Xiang and Feifan Ye
312
Empirical Study on Relationship Capital in Supply Chain-Based on Analysis of Enterprises in Hunan Province . . . . . . . . . . . . . . . . . . . . . . . . . . Lu Shan and Ou-yang Qiang-bin
320
Hard-Failure Diagnosis Using Self-tuning Kalman Filter . . . . . . . . . . . . . . . Xiuling Xu and Xiaodong Wang
326
Research on the Structure Transformation of Landing Craft . . . . . . . . . . . Linfang Su, Xiao Liang, and Zhibin Li
335
Dynamic Reasoning under Probabilistic Uncertainty in the Semantic Web . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Limin Chen and Zhongzhi Shi
341
Table of Contents – Part I
PLS Regression on Wavelet Transformed Infrared Spectra for Prediction of Coal Contents . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Yanming Wang, Deming Wang, Haihui Xin, Xiaoxing Zhong, and Gouqing Shi
XXIII
348
The Case of Web-Based Course on Taxation: Current Status, Problems and Future Improvement . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Zhigang Qin
354
A Novel Block Encryption Based on Chaotic Map . . . . . . . . . . . . . . . . . . . . Pengcheng Wei, Huaqian Yang, Qunjian Hang, and Xi Shi
360
Fuzzy Evaluating Customer Satisfaction of Jet Fuel Companies . . . . . . . . Haiying Cheng and Guoyi Fang
368
The Research of the BDAR for ATS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Chengjin Gao, Sheng Sheng, and Lin Wang
374
Secure Biometric E-Voting Scheme . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Taha Kh. Ahmed and Mohamed Aborizka
380
Glowworm Swarm Optimization Algorithm for Solving Numerical Integral . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Yan Yang and Yongquan Zhou
389
An Energy Aware Ant Colony Algorithm for the Routing of Wireless Sensor Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Deqiang Cheng, Yangyang Xun, Ting Zhou, and Wenjie Li
395
A Kind of Decay-Curve Inertia Weight Particle Swarm Optimization Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Yan Sun, Shishun Zhu, Qiang Li, Daowei Zhu, and Shujun Luo
402
Performance Analysis of Cooperative Virtual Laboratory Based on Web . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Zheng Gengzhong and Liu Qiumei
410
Numerical Simulation of Gas Leaking Diffusion from Storage Tank . . . . . Hongjun Zhu and Jiaqiang Jing
416
An Orthogonal Wavelet Transform Blind Equalization Algorithm Based on the Optimization of Immune Clone Particle Swarm . . . . . . . . . . . . . . . . Guo Yecai and Hu Lingling
422
A Support Vector Machine Blind Equalization Algorithm Based on Immune Clone Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Guo Yecai and Ding Rui
428
A Service Access Security Control Model in Cyberspace . . . . . . . . . . . . . . . Li Qianmu, Yin Jie, Hou Jun, Xu Jian, Zhang Hong, and Qi Yong
434
XXIV
Table of Contents – Part I
A Motor Speed Measurement System Based on Hall Sensor . . . . . . . . . . . . Wen-cheng Wang
440
Fault Reporting Based on Geographic Information of Distribution Network Fault Locating System . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Sun Quande, Li Kaiyang, and Wang Chunsheng
446
Key Curriculum Reform Research on Numerical Analysis . . . . . . . . . . . . . Zhong Li and Chensong Peng
453
The Topic Analysis of Hospice Care Research Using Co-word Analysis and GHSOM . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Yu-Hsiang Yang, Huimin Bhikshu, and Rua-Huan Tsaih
459
An Approach to Feature Selection Based on Ant Colony Optimization and Rough Set . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Junyun Wu, Taorong Qiu, Lu Wang, and Haiquan Huang
466
A New Adaptive Deformable Model Using Gradient Vector Flow . . . . . . . Bin Zhao, Siyuan Cheng, and Xiangwei Zhang
472
A Comparative Study of Different Distances for Similarity Estimation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Zhong Li, Qiaolin Ding, and Weihua Zhang
483
Reliability Analysis for CNC Machine Tool Based on Failure Interaction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Yingzhi Zhang, Rui Zheng, Guixiang Shen, and Bingkun Chen
489
Distribution Network Information System of Jiaozuo Based on ArcObject . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Wang Chunsheng, Sun Quande, and Li Kaiyang
497
Design and Implementation for Low Network Loaded and Automatically Photographic Surveillance System . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Linying Jiang and Heming Pang
502
The Research on Incentive Mechanism of Knowledge Creation in IT Enterprise . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Si-hua Chen
509
Computational Simulation of Submarine Oil Spill with Current . . . . . . . . Wei Li, Yongjie Pang, and Hongwei Li
515
Study on Engineering Consciousness and Ability Fostering of Applied Talents in Engineering Education . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Wang dong ping
521
Application Research of Improved Grey Forecasting Model in Load Forecasting . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Yuansheng Huang, Wei Fang, and Zhou Fan
529
Table of Contents – Part I
XXV
An Adaptive Multi-Agent System for Project Schedule Management . . . . Yongyi Shou and Changtao Lai
535
Using F-Metric to Construct a New Niederreiter Public Key Cryptosystem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Mu Han, Hong Zhang, and Chun-gen Xu
541
Flax Fibers as Reinforcement in Poly (Lactic Acid) Biodegradable Composites . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Yuan Yuan, Minghui Guo, and Yong Wang
547
A Novel Framework to Maximum Lifetime for Wireless Sensor Network . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Feng Sheng, Qi Xiao-gang, and Xue Ji-long
554
Enhancing Security by System-Level Virtualization in Cloud Computing Environments . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Dawei Sun, Guiran Chang, Chunguang Tan, and Xingwei Wang
565
Enabling Two Levels of Adaptation: A Framework for Traffic-Aware and Context Management Deployment . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Chin-Ling Chen and Jia-Ching Wang
571
Bacteria Foraging Based Agent Feature Selection Algorithm . . . . . . . . . . . Dongying Liang, Weikun Zheng, and Yueping Li
581
Research on the Interrupt Functions Based on the CAN Controller of LPC2300 Series ARM Chips . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Li Tu, Juanjuan Song, and Jun’an Liu
589
Data Recognition and Filtering Based on Efficient RFID Data Processing Control Schemes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Hsu-Yang Kung, Chiung-Wen Kuo, and Ching-Ping Tsai
596
Research on Operating Performance Evaluation of Electric Power Enterprises Based on F-AHP . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Yuansheng Huang, Wei Fang, and Mingxi Shi
602
Efficient Reference Picture Management Schemes for H.264/AVC Decoding System . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Chunshu Li, Kai Huang, Min Yu, and Xiaolang Yan
609
Research on the Algorithm for 3L-CVRP with Considering the Utilization Rate of Vehicles . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Han-wu Ma, Wei Zhu, and Sen Xu
621
Simulation of a Signalized Intersection Delay Model . . . . . . . . . . . . . . . . . . Minghui Wu, Lian Xue, Hui Yan, and Chunyan Yu
630
XXVI
Table of Contents – Part I
Matlab for Forecasting of Electric Power Load Based on BP Neural Network . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Xi-ping Wang and Ming-xi Shi
636
Application of Bayesian Networks in Situation Assessment . . . . . . . . . . . . Xi Su, Peng Bai, Feifei Du, and Yanping Feng
643
Preliminary Analysis on the Relative Solution Space Sizes for MTSP with Genetic Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Junling Hao
649
Hybrid Artificial Fish Swarm Algorithm for Solving Ill-Conditioned Linear Systems of Equations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Yongquan Zhou, Huajuan Huang, and Junli Zhang
656
A Survey on Social Image Mining . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Zheng Liu
662
Binocular Vision-Based Position and Pose of Hand Detection and Tracking in Space . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Chen Jun, Hou Wenjun, and Sheng Qing
668
Linear Feedback Anti-control of Chaos in Permanent Magnet Synchronous Motor . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Jingyue Wang, Haotian Wang, and Lixin Guo
676
An Infrastructure for Personalized Service System Based on Web2.0 and Data Mining . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 686 Yu Liu, Weijia Li, Yuan Yao, Jing Fang, Ruixin Ma, and Zhaofa Yan Research of Optimized Agricultural Information Collaborative Filtering Recommendation Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Fang Kui, Wang Juan, and Bu Weiqiong
692
An IPv6 Multihomed Host for Outbound Traffic . . . . . . . . . . . . . . . . . . . . . Chin-Ling Chen and Sheng-Lung Cao
698
A New Practical Electric Vehicle Battery Management System . . . . . . . . . Yanpeng Shi and Guoxin Wu
704
Dynamic Methods of Component Composite Service Selection Based on Trust-Aware . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Yuan Bo, Wang BinQiang, Zhao Bo, and Song Shasha
711
An Optimization Multi-path Inter-Session Network Coding in Wireless Sensor Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Zhuo-qun Xia, Chao Liu, Xue-han Zhu, Pin-chao Liu, and Li-tong Xie
717
Table of Contents – Part I
Exploring the Intrinsic Motivation of Hedonic Information Systems Acceptance: Integrating Hedonic Theory and Flow with TAM . . . . . . . . . Zhihuan Wang Vision-Guided Robot Tracking Algorithm Based on Characteristic Description of Maneuvering Target . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Yuan Zhang, Peng Wang, Xin Li, Shaochen Kang, Jinglei Xin, and Wenhao Jiang
XXVII
722
731
Fuzzy Comprehensive Evaluation of Peak Load Unit Based on Entropy Weight . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Zhengyuan Jia, Zhou Fan, and Shaohui Chen
737
Molecular Variation of Potato Virus Y in China . . . . . . . . . . . . . . . . . . . . . Hongyi Yang, Nana Zhang, Debin Li, and Lili Li
744
The Overview of Entity Relation Extraction Methods . . . . . . . . . . . . . . . . . Xian-Yi Cheng, Xiao-hong Chen, and Jin Hua
749
Detailed Design and Analysis on Error Handing and Controlling Protocol in Mobile Payment . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Xu Yong and Yan Tingting
755
Author Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
761
Unified Electronic Currency Based on the Fourth Party Platform Integrated Payment Service* Xu Yong1 and Hu Qiqi2 1
School of Economics and Commerce, South China University of Technology, Guangzhou University City, Guangzhou, China
[email protected] 2 School of Economics and Commerce, South China University of Technology, Guangzhou University City, Guangzhou, China
[email protected] Abstract. This paper presents a solution of unified e-currency based on the fourth party platform integrated payment service. The purpose of the paper is to solve the problem of distribution and resource-wasting caused by the lack of unified electronic currency, and to solve regulatory difficulties due to regulation size caused by a wide variety of e-currency. Methods: This article first analyzes the problems in the development of electronic money, and then proposes the concept of a unified electronic currency based on the fourth party platform integrated payment service. Besides, it proposes a unified mechanism and transaction procedures for unified e-currency, and analyzes the liquidation process, security and regulatory requirements, which are involved in using unified electronic currency. Keywords: The fourth party platform integrated payment service, Unified electronic currency, Unified billing.
1 Introduction Electronic currency has a strong vitality. Compared with the traditional currency, it has unique advantages, such as improving the operational efficiency of capital, reducing the transaction costs of clearing, beyond the constraints of time space and so on. However, we cannot ignore the problems which appeared in the development of e-currency. For example, the problems of unity, security issues and regulatory issues, etc. To solve the above problems of electronic money, we need to propose a complete solution from the entire payment chain perspective. Therefore, this paper will develop unified e-currency based on the fourth party platform integrated payment service.
2 Introduction of the Fourth Party Platform Integrated Payment Service The fourth party platform integrated payment service is a comprehensive payment service platform for the payment chain which is based on the theory of The Fourth Party *
The National Soft Science Research Program, 2010B070300016.
R. Chen (Ed.): ICICIS 2011, Part II, CCIS 135, pp. 1–6, 2011. © Springer-Verlag Berlin Heidelberg 2011
2
X. Yong and H. Qiqi
Payment. The Fourth Party Payment is an integrated service provider of electronic payment and value-added service, it can provide a set of solution to customers by integrating and managing various resources as well as the capabilities of complementary providers, standardizing the E-commerce process and providing the supervision interfaces through its own payment and value-added service. The service provided by the fourth party payment enterprises are not solely from a perspective angle of payment, but for uniting various protocols, providing a third-party cross-authorization and electronic payment supervision modes, and more value-added services. [1]
3 Unified Electronic Currency Based on the Fourth Party Platform Integrated Payment Service 3.1 The Concept of Unified Electronic Currency Unified e-currency is a kind of electronic cash in pure electronic form. It is issued by the fourth party platform integrated payment service under the supervision of the relevant regulatory authorities and can be generic used in the whole network (Internet and mobile networks) as well as common industry. The fourth party platform integrated payment service reaches agreement with various electronic currency issued subject, which can make the unified e-currency realize the direct exchange and indirectly achieve these mutual exchange between the electronic cash. Besides itself has very broad range of flow. Unified e-currency itself has strong versatility and convenience. It have the features of wide coverage and the bank independence. 3.2 Unified Electronic Currency Mechanisms and Transaction Process Unified e-currency includes two functions: one is using the traditional currency recharge for consumption; the other is the use of other electronic cash recharge. (A) Obtaining process of unified electronic currency The users store a certain amount of cash after they apply to the fourth party platform integrated payment service for account. And then they will receive the appropriate client software, and that is the electronic wallet. After that they can use electronic cash to make purchases. As shown in figure1:
Fig. 1. Obtain process of unified electronic currency
Unified Electronic Currency Based on the Fourth Party
A. B. C. D. E. F.
3
Users apply to the fourth party integrated payment service for account. Users login account and buy unified e-currency and download electronic purse through the net. And then unified e-currency will be stored in electronic purse. Users choose commodities, then transfer product information and unified electronic currency to the businessman. Businessmen confirm legitimacy of unified electronic currency to the fourth party integrated payment service. Confirm the legality of unified electronic currency, businessmen delivery. The fourth party integrated payment service makes unified settlement of funds according to financial information.
(B) Exchanging with other e-currency (a). Dead e-currency exchange At present, there is Dead e-currency. The user makes an e-currency exchange, which can only buy the goods or services provided by the e-currency issuer, and cannot counter against the traditional currency. When the user no longer uses goods and services provided, the user account balance will be idle, resulting in waste. In order to reduce this waste, the fourth party platform integrated payment service will reach agreement with all e-currency issuers, so that unified electronic currency can be as a bridge to realize the exchange between different dead e-currency. Unified e-currency exchanged from the dead e-currency can only be stored in the Internet account for the purchase of other e-currency, but it cannot be stored in the electronic wallet to purchase other commodities. The process shown in Figure 2:
Fig. 2. Dead e-currency exchange process
A. B.
C.
D.
User logins the account of unified e-currency and makes dead e-currency exchange function available. Then selects dead e-currency A for exchange. User recharges unified e-currency with dead e-currency A; Then the fourth party platform integrated payment service adds the funds in the internet unified ecurrency account according to e-currency exchange rate, and send encrypted recharge messages to dead e-currency issuer A; Dead e-currency issuer A deducts the funds in dead e-currency A account according to the encrypted recharge messages. User recharges the account B with the unified e-currency; then the dead ecurrency issuer B adds funds in the dead e-currency B account depending on the encryption information. The fourth party platform integrated payment service makes unified settlement and do hedge liquidation according to the recharge message.
4
X. Yong and H. Qiqi
(b). Undead e-currency exchange Undead e-currency is a kind of e-currency which can exchange with traditional currency. When the user no longer uses this kind of e-currency, e-currency account balance can be converted into bank account balances, and will not cause waste. Unified e-currency issuer reaches agreement with different e-currency issuers, through which other undead e-currency can be directly used to recharge and funds in the user electronic wallet will add. The funds can be used for shopping. The process shown in Figure 3:
Fig. 3. Undead e-currency exchange processes
In the process of exchange, unified e-currency purse must link to the Internet. Exchange funds are directly deposited into the electronic wallet, which can help separate unified e-currency and funds in Internet account out. A. B. C. D.
E.
User logins unified e-currency wallet, select the recharge way: electronic cash recharge. User recharges unified e-currency purse with e-currency A. Issuers of e-currency receive and sent recharge data through a special interface, then reduce the amount of e-currency A. The fourth party platform integrated payment service receives data through the special interface, send data to unified e-currency purse to increase the amount of e-purse. The fourth party platform integrated payment service makes unified settlement, then the funds of e-currency A in the bank A go to the temporary platform bank account.
4 Unified e-Currency Settlement Mechanisms and Processes 4.1 Unified e-Currency Shopping Capital Clearing and Settlement User uses the bank account A to buy unified e-currency, the funds remains in the fourth party platform integrated payment service temporary clearing account. When using the unified e-currency shopping, the liquidation process is as follows:
Unified Electronic Currency Based on the Fourth Party
5
Fig. 4. Unified e-currency shopping capital settlements
A. B.
C.
D. E.
F.
G.
H.
I.
User buys unified e-currency and the purchase information is passed to the fourth party platform integrated payment service. The fourth party platform integrated payment service receives purchase information which includes user account information, funds information and so on. The fourth party platform integrated payment service sends finished information to the central bank, and then the central bank transfers the funds from User Banks to the fourth party platform integrated payment service temporary clearing account. User uses unified e-currency purse to pay, and the secure payment information is passed to the fourth party platform integrated payment service The fourth party platform integrated payment service receives users’ secure payment information. This information includes user payment amount information, the user bank information, and business information. The fourth party platform integrated payment service based on business information; determine the business bank account information, and business information. The fourth party platform integrated payment service clears up the financial information and bank account information received, analyzes the flow of funds between various banks, and makes the transmission of finished information to the central bank. According to information received, the central bank makes the capital settlement, and then sends the funds from the fourth party platform integrated payment service temporary clearing account to merchant banks clearing account. The central bank transfers liquidation Information to the fourth party platform integrated payment service, then the information is cleared up and sent to the merchants head bank by the platform. The head band sends the specific account information and financial information to the merchant bank branches, making the primary account and fund settlement.
4.2 Non-unified e-Currency Shopping Capital Clearing and Settlement When making purchases, the user can directly use the non-unified e-currency. Platform can judge issuer and currency exchange rates of RMB, according to the type of e-currency, and clears up the funds directly with the issuer bank account. It needn’t to
6
X. Yong and H. Qiqi
be converted into unified e-currency. The liquidation process is the same as the direct use of unified e-currency. 4.3 Dead e-Currency and Undead e-Currency Clearing and Settlement Dead e-currency. The amount of Dead e-currency exchange is usually little, and the exchange involves interests of various businessmen. Therefore, dead e-currency uses the way of hedging accounts directly to clear up. The way of hedging accounts directly to clear up refers that it directly hedges user’s account among dead e-currency issuers, is not to involve in the actual transfer of funds. Undead e-currency clearing and settlement. The users choose the function of undead e-currency exchange. The fourth party platform integrated payment service must reach agreement with undead e-currency issuers, provide the interface for them, clearing up thought the platform. Its liquidation mainly relates to inter-bank settlement; the process is the same as using Internet Bank to buy unified e-currency.
5 Summary Unified e-currency is the ultimate trend in the development of e-currency, the full realization of the ultimate form is industry-wide and entire network coverage function, and replaces all other types of e-currency. The purpose of e-currency exchange is to replace the other e-currency smoothly in the early development. Security and supervision of unified e-currency must be able to keep up with development of unified e-currency, which requires the State and the community to pay adequate attention.
References 1. 2. 3. 4. 5. 6. 7.
Xu, Y., Fang, C.: A theoretical framework of fourth party payment. ICEE, EI Retrieval Li, Y.: Promote the healthy development of the cause of payment and settlement. Financial Computer of China (03) (2010) Ye, Y., Xiong, Z., Chen, Y.: Proposal concerning reconstruction of Chinese foreign currency clearing system based on analysis of its drawbacks. Shanghai Finance (03) (2008) Zhou, Z.: Payment and settlement system for cross-national perspective. China Foreign Exchange (08) (2009) Zhou, J.: The Development of Modern Payment System and the Adjustment of Monetary Regime. Journal of Financial Research (01) (2007) Lacker, J.M.: Clearing, settlement and monetary policy. Journal of Monetary Economics 40, 347–381 (1997) Committee on Payment and Settlement Systems: The role of central bank money in payment systems. In: BIS (2003)
Modeling and Power Flow Analysis for Herringbone Gears Power Dual-Branching Transmission System Xiaofang Yang1, Yanxiang Zhu2, Zongde Fang1, and Jiangong Gu1 1
School of Mechatronics, Northwestern Polytechnical University, Xi’an 710072, China 2 Patent Bureau of State Intellectual Property Office, Beijing 100088, China
[email protected]
Abstract. Based on power dual-branching transmission system of herringbone gears, the mechanical structural model was established. This study represented the simplified algorithm to obtain its power flow situations through formulating the deformation compatibility condition for the linear relationship between the torque and transverse deformation of tooth surface and the torque equilibrium condition. Besides, the effects on the power flow of system were calculated under all kinds of the installation error and processing error of gear pairs. Finally, the power flow situations of dual branches were solved via Programming. A numerical example that illustrated the developed theory was provided. The research results can be applied to analyze the actual application of herringbone gears power split-path transmission system. Keywords: herringbone gears; power-split; torque equilibrium; deformation compatibility; error.
1 Introduction The herringbone gears power flow transmission system has been widely used in the aeroengine and reducer to achieve the high-speed and reverse spilt-flow and confluence high-power [1-3]. The power dual-branching gear transmission system which is composed by herringbone gears of dual-branching structure to implement dual-path power of cross-flow is simple and compact [4]. Besides, the herringbone gears as transmission component has unique characteristics of large contact ratio, smooth transmission and low noise, which make the system on the one hand, to meet the requirements of heavy duty working conditions. On the other hand, it has broad application prospects on the fields such as aviation and marine transmissions due to its size reduced and weight lightened. In this study, the mechanical structural model of power flow transmission system is presented. Based on the torque analysis of the herringbone gears, the mutually meshing influence between related gear pairs of system is researched during the analysis of deformation compatibility. The power flow situations are solved by programming. Actually, the clearance is unavoidable during meshing of gear pairs due to the processing error and installation error of gear system [5-6], and analyzing the influence on power split. R. Chen (Ed.): ICICIS 2011, Part II, CCIS 135, pp. 7–15, 2011. © Springer-Verlag Berlin Heidelberg 2011
8
X. Yang et al.
2 Modeling and Analysis Power dual-branching gear transmission system can be defined as the gear system to divide the torque or power into dual-branching and generally with two stage transmission considering the requirements of structural characteristics. An analytical method is developed and used to study the load-sharing properties of such designs. 2.1 Outline Drawing of Power Dual-Branching System The outline drawing model is adopted by herringbone gears power dual-branching transmission system [4]. The whole system is comprised of first-level transmission and second-level transmission system. In this system, input power is given to firstlevel gear though pinion split-flow which transfers the torque to second-level pinion, and then converges into second-level gear for output though second-level. In order to achieve better load-sharing result and minimize interaction between two levels, the shafts connecting two levels are made into slender load-sharing torsion shaft parts. 2.2 Mechanical Structural Model In the process of modeling, according to herringbone gears transmission characteristic, the system is simplified as lumped-parameter model and the wheel is treated as rigid body. The mechanical structural model established is as shown in Figure 1. The entire system consists of six herringbone gears, T1 as input torque, T6 as output torque, and other torque subjected to every gear as T2 , T3 , T4 , T5 , respectively. As to gear pair 12, gear pair 13, gear pair 46 and gear pair 56, the torque in the two gears of every gear pair are Tij , T ji ( i = 1, 2,3, 4,5, 6; j = 1, 2,3, 4,5, 6 ), respectively,
thereinto, Tij defined as function torque of gear j versus gear i, active torque defined as positive, load torque defined as negative. T24
T42 T46
T21
T64
T1 2
T13
T1
T6 T65 T56
T31 T35
T53
Fig. 1. Mechanical structural model
2.3 Conditions of Torque Equilibrium [7]
The conditions of torque equilibrium which can be obtained based on gears and shafts illustrated in figure 2 are represented with the following equations.
Modeling and Power Flow Analysis for Herringbone Gears Power
⎧T1 + T12 + T13 = 0, T24 + T21 = 0 ⎪ ⎨T35 + T31 = 0, T42 + T46 = 0 ⎪T + T = 0, T + T + T = 0 ⎩ 53 56 6 64 65
9
(1)
The equation of gear 6 is non-independent, due to six herringbone gears formed closed system. The base circle radius of herringbone gears is ri ( i = 1, 2,3, 4,5, 6 ). Owing to gear 2 and pinion 4, gear 3 and pinion 5 both coaxial, according to action and reacting force equilibrium condition, the equations are as follows, (2)
T24 = −T42 , T35 = −T53
Other herringbone gears pairs meshing, the conditions of torque equilibrium are as follows, (3) T ji = −Tij rj / ri Equations (1), (2), (3) yield ⎧T1 + T12 + T13 = 0, −T12 r2 / r1 + T46 = 0 ⎨ ⎩−T13 r3 / r1 + T56 = 0, T6 − T46 r6 / r4 − T56 r6 / r5 = 0
(4)
3 Conditions of Deformation Compatibility The relationship model of various gear pairs meshing rotation angle and gear shafts twist angle of system established is shown in figure 2.
24
(T21 )
2
4
46 12
6
1
13
(T46 )
(T12 )
(T13 ) 56
3
(T56 )
5
35
(T31 )
Fig. 2. Relationship model of various gear pairs meshing rotation angle and gear shafts twist angle
3.1 Conditions of Deformation Compatibility [8]
The relationship of various gear pairs meshing rotation angle and gear shafts twist angle is represented as follows, ⎧Δφ12 (T12 ) = φ1 − φ2i12 , Δφ24 (T21 ) = φ2 − φ4 ⎪ ⎨Δφ46 (T46 ) = φ4 − φ6i46 , Δφ13 (T13 ) = φ1 − φ3i13 ⎪Δφ (T ) = φ − φ , Δφ (T ) = φ − φ i 3 5 56 56 5 6 56 ⎩ 35 31
(5)
10
X. Yang et al.
Here, φi is the rotation of the gear i . Δφij ( Tij ) is the angular distortion of gear i with respect to j under the action of torque Tij , that is the loading transmission error,
and Δφij ( Tij ) is the function of Tij .
Gear 2 and 3, pinion 4 and 5 are as same level gear, respectively. Therefore, the numbers of teeth of gear 2 and 3, pinion 4 and 5 equal, respectively, yield the following equations,
i12 = i13 , i46 = i56
(6)
where i12 = z2 / z1 = r2 / r1 , i13 = z3 / z1 = r3 / r1 , i46 = z6 / z4 = r6 / r4 , i56 = z6 / z5 = r6 / r5 Equations (5) yield T46 = T12 r2 / r1 , T56 = T13 r3 / r2
(7)
Equations (5), (6) and (7) yield the deformation compatibility equations of the system as follows, Δφ12 (T12 ) r1 / r2 − Δφ24 (T12 ) r2 / r1 + Δφ46 (T12 ) r2 / r1 = Δφ13 (T13 ) r1 / r3 − Δφ35 (T13 ) r3 / r1 + Δφ56 (T13 ) r3 / r1
(8)
3.2 Torsion Meshing Stiffness
The relationship between the torsion meshing stiffness K ij and load Tij is nonlinear, however, in the vicinity of a certain load, so it can be approximately considered as linear [9-10]. Accordingly, the meshing angular distortion of gear pairs can be simplified represented as follows, (9) Δφij = Tij / Kij ri 2 In the computational model of gear transmission system, the torsional meshing stiffness is analyzed based on the variation of line of action of gear pair, N / mm as unit, besides, the meshing stiffness in this study all as linear. The torsional meshing stiffness between gear i and gear j is
K ij = 2 × 103 Cγ ij bi
(10)
(
)
Here: b is total width of herringbone gears, mm as unit; Cγ ij = 0.75ε αij + 0.25 C 'ij is defined as the total rigidity mean value in the end section of gear i and j , abbreviation “meshing stiffness”, mm ⋅ μ m / N as unit; ε α is transverse contact ratio; Cij ' = 1 q is the maximum stiffness in the normal section of one pair gears, q = 0.04723 + 0.15551cos3 β / z1 + 0.25791cos3 β / z2 − 0.00635 x1 − 0.11654 x1 cos3 β / z2 − 0.00193 x2 − 0.24188 x2 cos3 β / z2 + 0.00529 x12 + 0.00182 x22
Modeling and Power Flow Analysis for Herringbone Gears Power
11
3.3 Twist Angle Deformation of Load-Sharing Torsion Shaft
Gear 2 and pinion 4, gear 3 and pinion 5 are connected though the load-sharing torsion shafts and their angular deformation is represented by twist deformation of the shaft [11]. Δφ24 = −(32r2 l24T12 ) / (Gπ r1 (d 2 4 − d 4 4 )), Δφ35 = −(32r3l35T13 ) / (Gπ r1 ( d34 − d5 4 ))
(11)
where, G is the material shear elastic modulus of shaft, MPa as unit, and for steel, G = 8.1× 10 4 MPa; l AB ( A = 2,3; B = 4,5) is the length of the shaft under torque, mm as unit; d i (i = 2,3, 4,5) is the shaft diameter connecting first-level and second-level. 3.4 Equations of Deformation Compatibility
As mentioned above, Δφij ( Tij ) is the angular distortion of gear i with respect to
gear j under the action of torque Tij . The variable Δφij (Tij ) includes initial gap between
gears correspond to the relative twist angle Δφij0 before tooth surface of gear i and j come into contact and the relative twist angle Δφij1 ( Tij ) at the mesh point after tooth surface of gear i and j contact deformation. Δφij ( Tij ) =Δφij1 ( Tij ) + Δφij0
(12)
Equations (8), (9), (10), (11) and (12) yield the deformation compatibility equations under the action of torque Tij of meshing gear i and gear j as follows, T12 [1 / ( K12 r1r2 ) − (32r2 l24 ) / (Gπ r1 (d 2 4 − d 4 4 )) + r2 / ( K 46 r4 2 r1 )] − T13 [1 / ( K13 r1r3 ) − (32r3l35 ) / (Gπ r1 (d34 − d5 4 )) + r3 / ( K56 r5 2 r1 )] = 0
(13) The linear equations (4) and (13) conveniently yield load bearing torque of each gear pair Tij , which is the condition of power split of system.
4 Error on the Influence of Power Split Envision that the output gear of the gear train is rigidly fixed from rotating and a torque is applied to the input pinion. As the torque is applied, the input shaft will rotate some amount because of deformations [4]. This rotation of the input pinion relative to the output gear is called the load windup. In the condition of gear parameter and meshing parameter invariable, due to the parallel error of the axes of gear pair made by manufacture and installation [11-12] (thereinafter abbreviation axis based error), the deviation of center distance among gear pairs is produced directly, leading to the gap inevitably in the process of meshing of gear pairs, corresponding to the initial twist angle Δφij0 non-zero.
12
X. Yang et al.
4.1 Initial Twist Angle
The gap of center distance error separately projects along and vertically the direction of line of action, in which the projection along the direction of line of action can transform as the angle of clearance, while the projection vertically the direction of line of action possible ignore[13]. According to the geometric al relationship of tooth face of herringbone gears, when the axial movement of gear i (the gap of center distance error) is ΔEi , the relative twist angle corresponding to initial clearance between gears of gear pair is represented as follows: Δφij 0 = ΔEi sin α t cos β / Rij
(14)
where Rij is the mean radius of gyration for the meshing point with respect to the shaft of gear. 4.2 Error Occurring in Gear Pair
If the gap of center distance axial error ΔE2 occurs between pinion 1 and gear 2, the deformation compatibility equations as follows, T12 [1/ ( K12 r1r2 ) − (32r2 l24 ) / (Gπ r1 ( d 2 4 − d 4 4 )) + r2 / ( K 46 r4 2 r1 )] −T13 [1/ ( K13 r1 r3 ) − (32r3l35 ) / (Gπ r1 ( d 34 − d 5 4 )) + r3 / ( K 56 r5 2 r1 )] = ΔE2 sin α t cos β1r1 / r2 2 (15) If the gap of center distance axial error ΔE3 occurs between pinion 1 and gear 3, the deformation compatibility equations as follows, T12 [1/ ( K12 r1r2 ) − (32r2 l24 ) / (Gπ r1 (d 2 4 − d 4 4 )) + r2 / ( K 46 r4 2 r1 )] −T13 [1/ ( K13 r1r3 ) − (32r3l35 ) / (Gπ r1 ( d34 − d 54 )) + r3 / ( K 56 r52 r1 )] = ΔE3 sin α t cos β r1 / r32
(16)
If the gap of center distance axial error ΔE4 occurs between pinion 4 and gear 6, the deformation compatibility equations as follows, T12 [1/ ( K12 r1r2 ) − (32r2 l24 ) / (Gπ r1 (d 2 4 − d 4 4 )) + r2 / ( K 46 r4 2 r1 )] −T13 [1/ ( K13 r1r3 ) − (32r3l35 ) / (Gπ r1 (d 3 4 − d 5 4 )) + r3 / ( K 56 r52 r1 )] = ΔE4 sin α t cos β / r4 (17) If the gap of center distance axial error ΔE5 occurs between pinion 5 and gear 6, the deformation compatibility equations as follows, T12 [1 / ( K12 r1r2 ) − (32r2 l24 ) / (Gπ r1 ( d 2 4 − d 4 4 )) + r2 / ( K 46 r4 2 r1 )] −T13 [1 / ( K13 r1r3 ) − (32r3l35 ) / (Gπ r1 ( d34 − d 54 )) + r3 / ( K 56 r5 2 r1 )] = ΔE5 sin α t cos β / r5
(18)
If the gap of center distance axial error occurs in every gear pair simultaneously, the deformation compatibility equations as follows, T12 [1 / ( K12 r1r2 ) − (32r2 l24 ) / (Gπ r1 ( d 24 − d 4 4 )) + r2 / ( K 46 r4 2 r1 )] − T13 [1 / ( K13 r1r3 ) − (32r3l35 ) / (Gπ r1 ( d 34 − d 5 4 )) + r3 / ( K 56 r52 r1 )] = ΔE2 sin α t cos β r1 / r2 2 − ΔE4 sin α t cos β / r4 + ΔE3 sin α t cos β r1 / r3 2 − ΔE5 sin α t cos β / r5
(19)
Modeling and Power Flow Analysis for Herringbone Gears Power
13
5 Calculation Results The input power of pinion 1 is 1556 kw , rotational speed 6000 r / min. The parameters of gears of transmission system are listed in table 1, and the parameters of middle torsion shaft listed in table 2. Table 1. Parameters of gears Items
Pinion 1
Gear 2 and 3
Pinion 4 and 5
Gear 6
Number of teeth z Normal module mn / mm
24 8
80 8
65 8
176 8
Face width b / mm Helical angle
/( )
Modification coefficient
120
340
260
770
29.5
29.5
29.5
29.5
x1
x2
0.53
x1
x2
0.53
x1
0.53
x2
x1
x2
0.53
Table 2. Parameters of shafts Items Load effective shaft part length/mm
Shaft 24
l24
Shaft diameter/mm
d2
Shaft 35
1500
260, d 4
l35 180
d3
1500
260, d 5
180
5.1 The Effect of Power Flow Caused By the Gap of Center Distance Axial Error
The gap of center distance axial error of gear pairs, leading to the initial twist angle corresponding to gear pairs, impacts on power split of gear pairs of system, which is according to the torque transferred change. In the conditions of standard installation and existing different errors, the situation of power split in this study is listed in table 3 by programming. Table 3. Situation of power spilt in different conditions
items
Standard installation
Error in pair gear 12
Error in pair gear 13
Error in pair gear 46
Error in pair gear 56
Error in every gear pair
Ei / mm
0
T12 / N m
-1246
-1231
-1216
-1061
-938
-1242
T13 / N m
-1246
-1261
-1276
-1431
-1554
-1250
T46 / N m
-4154
-4104
-4054
-3537
-3126
-4142
T56 / N m
-4154
-4204
-4254
-4771
-5182
-4166
0.01
0.02
0.01
0.02
5.2 The Effect of Power Flow Caused by Installation Error
The load of every gear is diverse in the different engaging position of the system, which explained particularly in author’s other papers. The power flow charts of gear
14
X. Yang et al.
pairs in various situations are fitted through loaded tooth contact analysis [14]. The power flow of system in the various situation of two mesh period (correspondence ten engaging position) is as shown in figure 3.
Fig. 3. Power split diagram of the system under different situation
6 Conclusions This study was done to better understand split-path transmission and support their application in the future. From the analytical study, the following conclusions can be drawn: (1) The method developed in this study greatly simplifies the process for solving the situation of power spilt of the complex gear transmission system, increasing the computational efficiency, with the guidance to the three and four branch transmission structure. (2) The situation of power split affect though adjusting the gap of tooth flank can be conveniently calculated using the method developed. In normal conditions, the amount of power split of dual-branch is equivalent. The insignificant gap results in the tremendous transformation. Therefore, the branched structure is sensitive to the gap of center distance axial error. (3) The variation of power flow caused by the gap of center distance axial error is consistent with the graphs power split caused by installation error. The loaded imbalance of two sides of gear is caused by errors, which is easy to cause one-sided to overload. And consequently, the author proposes the method to achieve load-sharing of power spilt as far as possible though changing the gap of tooth flank of adjusting the axial gear position. (4) The precision required for gap and installation error is within the capabilities of available and proven manufacturing processes. The model provides important theoretical instruction for achieving valid error compensation of load-sharing.
Modeling and Power Flow Analysis for Herringbone Gears Power
15
References 1. Litvin, F.L., Fuentes, A.: Gear Geometry and Applied Theory. Cambridge University Press, Cambridge (2004) 2. Litvin, F.L., Zhang, J., Handschuh, R.F., Coy, J.J.: Topology of Modified Helical Gears. Surface Topography 3, 41–58 (1989) 3. White, G.: Design Study of A 375-kw Helicopter Transmission with Split-torque Epicyclic and Bevel Drive Stage. J. Mech. Eng. Sci. 197C, 213–224 (1983) 4. Timothy, L., Krantz, A.: Method to Analyze and Optimize the Load Sharing of Split Path Transmissions. In: Seventh International Power Transmission and Gearing Conference, San Diego (1996) 5. Zhang, Y., Fang, Z.: Analysis of Transmission Errors Under Load of Helical Gears with Modified Tooth Gears. ASME Journal of Mechanical Design 119, 120–126 (1997) 6. Umeyama, M., Kato, M., Inoue, K.: Effects of Gear Dimensions and Tooth Surface Modifications on The Loaded Transmission Error of A Helical Gear Pair. ASME Journal of Mechanical Design 120, 119–125 (1998) 7. Yao, Y., Yan, H.S.: A New Method for Torque Balancing of Planar Linkages Using Noncircular Gears. Proceedings of the Institution of Mechanical Engineers Part C-Journal of Mechanical Engineering Science 217, 495–503 (2003) 8. Gu, J.G., Fang, Z.D., Zhou, J.X.: Modeling and Power Flow Analyzing for Power Split System of Spiral Bevel Gears. In: Feng, G., Xijun, Z. (eds.) Proc. of 2009 International Workshop on Information Security and Application, pp. 401–404. Acadmy Publisher, Finland (2009) 9. Peng, H., Liu, G.L.: Tooth Contact Analysis of Face-gear Meshing. Mechanical Science and Technology for Aerospace Engineering 27, 92–95 (2008) 10. Vecchiato, D.: Tooth Contact Analysis of a Misaligned Isostatic Planetary Gear Train. Mechanism and Machine Theory 41, 617–631 (2006) 11. Shao, X.R.: Influence of Load Sharing Coefficient on the Manufacture and Assemble Error of the Planetary Gear NGW. Journal of Northeast Heavy Machinery Institute 18, 306–309 (1994) 12. Li, T., Pan, C.Y., Li, Q., Zhang, L.J.: Analysis of assembly error affecting on directing precision of spherical gear attitude adjustment mechanism. Acta Armamentarii. 30, 962– 966 (2009) 13. Chang, S.L., Tsay, C.B., Tseng, C.H.: Kinematic Optimization of a Modified Helical Gear Train. ASME Journal of Mechanical Design 119, 307–314 (1997) 14. Gu, J.G., Fang, Z.D., Pang, H., Wang, C.: Modeling and Load Analysis of Spiral Bevel Gears Power Split System. Journal of Aerospace Power 24, 2625–2630 (2009)
Research on SaaS and Web Service Based Order Tracking Jianhua Jiang1,*, Buyun Sheng1, Lixiong Gong2, and Mingzhong Yang1 1
School of Mechanical and Electronic Engineering, Wuhan University of Technology, Wuhan 430070, China 2 Chong Qing Automobile College, Chongqing University of Technology, Chongqing 400054, China
Abstract. To solve the order tracking of across enterprises in Dynamic Virtual Enterprise (DVE), a SaaS and web service based order tracking solution was designed by analyzing the order management process in DVE. To achieve the system, the SaaS based architecture of data management on order tasks manufacturing states was constructed, and the encapsulation method of transforming application system into web service was researched. Then the process of order tracking in the system was given out. Finally, the feasibility of this study was verified by the development of a prototype system. Keywords: dynamic virtual enterprise, software-as-a-service, web service, order tracking.
1 Introduction DVE takes outsourcing as the main business mode and it allocates customer orders to appropriate supplier by the way of bidding or negotiation. The real-time query of the status of order is named order tracking. Provide order tracking service in DVE helps for customers to participate in the manufacturing process of their orders so as to improve their loyalty to DVE. The service is benefit for the core enterprise of DVE to reallocate orders as to ensure orders completion. The research on order track is rare, such as for order tracking in discrete manufacturing oriented enterprise, an order execution process analysis and model method based on key node tracking of information in MTO environment was proposed [1]. To develop an order tracking system for auto assemblage, the hardware structure and software design based on barcode technology were discussed [2]. Mobile agent was used to develop online order tracking across global logistic alliances [3]. As to order tracking for alliance members within a supply chain, mobile agent was employed to develop a prototype of order tracking on the web [4]. Previous research is focus on single enterprise or alliance enterprise with stable membership. However, the existing solutions and systems is powerless for DVE for member enterprises join or leave dynamically and with distributed geographical location, heterogeneous hardware and software, different information level. So, this paper is to seek the method for order tracking in DVE. *
Corresponding author.
R. Chen (Ed.): ICICIS 2011, Part II, CCIS 135, pp. 16–22, 2011. © Springer-Verlag Berlin Heidelberg 2011
Research on SaaS and Web Service Based Order Tracking
17
2 System Design 2.1 Problem Description After received orders, core enterprise of DVE will classify and divided them into subtasks and allocated to suppliers. Suppliers arrange production for orders and store the related data. In processing of order, customer can query its status and feedback the suggestion for the manufacturing method. In addition, core enterprise of DVE may reallocate orders according orders real-time status. The process is shown in figure 1. Because of suppliers’ different information system and distributed globally, how to collect manufacturing data from suppliers and provide order tracking on web is the main problem to be solved.
Fig. 1. Order management process
2.2 System Design SaaS provides online software and customers purchase service by need while the copyright belongs to software provider. The provider is responsible for maintenance, daily operations and technical support services to software [5]. Web serve is used to integrate and share data or application in heterogeneous platform. So, according application features of SaaS and technical characteristics of web service, a SaaS and web service based order tracking solution was designed as shown in figure 2. The system includes SaaS based manufacturing data management system, UDDI and order tracking & querying. Its idea is suppliers without information system uses SaaS service to store production date into manufacturing data DB. While suppliers have information system encapsulates it into web service and publishes it to UDDI. The order tracking & querying module is responsible for finding out the supplier ID from order allocated DB related to the order firstly. Then it acquires the data from manufacturing data DB ID directly or by invocating web service deployed in remote supplier enterprise.
18
J. Jiang et al.
Fig. 2. SaaS and web service based order tracking solution
3 Key Problem 3.1 SaaS Based Manufacturing Data Management Technically, developer of SaaS cares about the characteristics of multi-tenant, configurable and scalable of software. Multi-tenant refers to customers share a set of code while the data of different tenants is isolated from each other for safe and to meet customers’ personalized needs. Configurable means the tenants’ personalized requirements is realized by configurable operations without changing source code. Scalable makes it can support any scale of applications just by add hardware. According to the technical features of SaaS, the architecture of SaaS based manufacturing data management system is shown in figure 3. Sys. Management
SaaS based manufacturing data management system Presentation layer Collaboration Layer
IE Business rule
Portable terminal Workfolw control
Business component
Order management Order quote Order bid Order prewarning
Common component
Message service DB Access Message managemeng Security service
Mobile terminal
Instant messaging device
Customization and configuration
Role and permission
Quality management workshop management Material management Material purchase Production inspection Task assignmeng Material inspection Package inspection Process scheduling Input workload Material in & out Product in & out inspection Report management Product statistic report Order statistic report Material statistic report Warehouse report Product schedule report Supplier info. report Product quality report Workload report
Infrastructure
Data query Report service
Monitor service Interface service
Network/OS/DB/Server/Cluster
XML parse Log service
Tenant managent Cost management Application customization Account management Security management Role management Permission management System monitor Common management Sys. Maintenance Copyright management Backup management Log management Statistic analysis
Fig. 3. Architecture of SaaS based manufacturing data management system
Research on SaaS and Web Service Based Order Tracking
19
In the architecture, presentation layer is responsible for submitting user needs to business component and it’s the interface for user login. Collaboration layer provides customization and configuration service for different tenants to meet their personalized needs. Business component layer includes all the components needed for manufacturing data management while common component layer provides basic services for all tenants. Infrastructure includes the software and hardware for running the system. To ensure normal running of the system, the system management provides multi-tenant management, system security and maintenance functions. In SaaS mode, the isolation of system data, scalable and configurable of data structure must be taken in account. Data storage method including independent database, shard database and independent structure, shared database and shared structure. In this paper, the shared database and shared structure is chose. For the consistent data model is not suit for the storage method, a meta-data table and extended data table is added to extend the data model. The field and data-type customized by tenant is stored in meta-data table while the value of customized filed is stored in extended data table. The extended information is expressed by the relationship between customer information table, meta-data table and extended data table as shown in figure 4.
Fig. 4. Extension of data model by name-value pairs
In addition, it is important to keep the security of tenants’ data. The security includes the authorization of customer account and accessing database. To the security of customer account, centralized authentication is used. Software provider manages all customer accounts and manager of customer account is authorized to manage user account as shown in figure 5. As to the security of accessing database, MD5 encrypt algorithm and the three-tier architecture was used as shown in figure 6.
System manager
Create customer role
Allocate module for customer role
Account audit
Account & role binding
Apply account Create user role
Verify account N
Y
Inherit role module Apply account failed
Allocate module for user role
customer Create user account
Account & role binding
Inherit role module
Fig. 5. Account management process
customer Presentation layer
Encryption & decryption query module
request Encrypted DB return Web service of data query
Business layer
Data layer
Fig. 6. Data accessing method
20
J. Jiang et al.
The process of accessing encrypted database is customer inputs query to encryption & decryption query module in bushiness layer. It is transferred to data query web service and will be executed on encrypted database if the query is legal and the customer account is authorized. 3.2 Encapsulate Application System into Web Service Application system can be encapsulated into web service directly if it developed by component technology while the component must be extracted from application system if it is developed by object oriented of procedure oriented technology. Application system can be encapsulated into web service from three layer of data layer, business layer and application program. The encapsulation of data layer into web service is to operate database in application system directly by open data connection technology such as ODBC, OLEDB, JDBC, ADO.NET and ADO. In .NET platform, the ADO.NET can be used to access heterogeneous database. The data acquired by ADO.NET is stored in dataset as XML format in local machine. Data in dataset can be operated and updated to real data source or transferred as a parameter. Encapsulate business layer into web service depends on the development language of application. .NET platform is suitable for encapsulating system developed by language such as VB, C or C++ while Java Native Interface (JNI) is suitable for system developed in Linux platform. In .NET platform, the method to encapsulate managed DLL and native DLL is different. For managed DLL, just copy it to bin subdirectory in web service application, instantiating an object and invocating its method. Wile for native DLL such as COM, ActiveX or Win32 API, the p-invoke in .NET platform is used to encapsulate it into web service as shown in figure 7. The process is to load it into memory firstly, acquiring its address and pushing needed parameters into stack, then sends parameters to it and transfers the control to it. metadata Managed code
compiler
P-Invoke
MSIL code assembly
Native DLL DLL function
CRL
Fig. 7. Invocation process of native DLL
The method of encapsulating application program is added an interface for active the process of .exe file. The web service is only transfer the invocation to application without any return.
4 Prototype System To meet the needs of virtual business model, a platform named product customization of mechanical parts in network environment was developed for an enterprise. Its
Research on SaaS and Web Service Based Order Tracking
21
modules including 2D/3D production display on web, customer needs submit, need quoting, classify and allocate orders, supplier management and production management. For the disadvantages of complex tracking process, high cost of communications, constrained by working hours and slow response in current order tracking method by telephone, fax or email, the SaaS and web service based order tracking system was added to the platform and the prototype was developed. Process of order tracking in the prototype is in figure 8.
Fig. 8. Process of order tracking
Step 1 Customer submits an orderId to order tracking system by client IE. Step 2 The system acquired all the supplierId from allocated order information database by orderId and read out the data acquiring method of each supplier from supplier information database. Step 3 Acquire order state from SaaS based manufacturing data management system for suppliers without production management system. While for suppliers has production management system and has been encapsulated as web service, searching for the WSDL by supplierId from UDDI and invocating the web service deployed in remote supplier enterprise by URI in WSDL to acquire order state. Set 4 Merge the acquired order state if it comes from manufacturing data management system and web service respectively. Format it by XSLT and return the result to client IE of customers.
5 Conclusions As to order tracking across the boundary of enterprises, different in information level and heterogeneous in software & hardware, a SaaS and web served based solution was put forward. In realize the solution, the storage of customer data in SaaS mode was solved by adding metadata table and extend data table while MD 5 encryption
22
J. Jiang et al.
algorithm and three-tier architecture was used to ensure the security of customer data. To encapsulate application system into web service, the solutions from three layers of data layer, business logic layer and application program were researched. On basis of the research in this paper, a web based order tracking prototype was developed and it realized the order tracking across enterprises. Next, we will modify and improve it until to put it into practical application. The research in this paper has reference to the development of similar application system.
Acknowledgment It is a project supported by National Natural Science Foundation for the Youth Project of China (contract no. 50905133).
References 1. 2. 3.
4. 5.
Chen, X., Tang, R., Wang, Z.: Research on Order Track Manage System Oriented to Discrete Manufactruing. J. Light Industry Machinery 28, 111–115 (2010) (in Chinese) Chen, S., Liu, T.: Barcode Order Tracking System for Auto Assemblage. J. Journal of Wuhan University of Technology 27, 75–78 (2005) (in Chinese) Trappey, A.J.C., Trappey, C.V., Hou, J.L., et al.: Mobile agent technology and application for online global logistic service. J. Industrial Management & Data System 104, 168–183 (2004) Cheng, C.-B., Wang, C.: Outsourcer selection and order tracking in a supply chain by mobile agents. J. Coupter & Industrial Engineering 55, 406–422 (2008) Choudhary, V.: Software as a Service: Implications for Investment in Software Development. In: Proceedings of the 40th Hawaii International Conference on System Sciences, pp. 209–218. IEEE Press, Hawaii (2007)
Research and Analyses on Unsteady Heat Transfer of Inner Thermal Insulation Wall during Multi-temperature Refrigerated Transportation Guanghai Liu, Ruhe Xie, and Yongcai Sun Research Center of Modern Service Industry, Guangzhou University, Guangzhou, Guangdong, 510006, China
Abstract. There are lots of differences between multi-temperature refrigerated vehicles and ordinary ones in many aspects such as structure and running circumstances, hence the hugely different heat-transfer characters and response coefficients. This paper researched the unsteady heat transfer process of the multi-temperature refrigerated vehicle by response coefficients method, numerically calculated the unsteady heat transfer of inner thermal insulation materials in the multi-temperature refrigerated vehicle by computers, and studied the influences of different term numbers of equation root, term numbers of response coefficients on load calculation accuracy. It showed that the accuracy requirement could be met when the root of equation was -25 and the term number of response coefficient was 30. Keywords: Multi-temperature refrigerated transportation; Unsteady heat transfer; Response coefficients method.
1 Introduction Multi-temperature transportation is a kind of special refrigerated transportation methods that can transport goods of different kinds and storage temperatures simultaneously by dividing the refrigerated transportation into several areas with different temperatures. Since the concept multi-temperature transportation appeared in the end of last century, it has been noticed by experts and has been preliminarily applied rapidly in developed countries because such transportation can meet the small-lot, multi-variety requirement of market, repair the deficiency of traditional refrigerated transportation that food with different temperatures cannot be transportation simultaneously, lower the requirements about transportation burden and kinds of goods, reduce transportation, improve efficiency and cut down energy consumption while food quality is guaranteed during transportation. Considering heat transfer conditions between multi-temperature units can affect food quality and running energy consumption during multi-temperature transportation, the dynamic load model should be adapted in initial design to solve the problems above fundamentally. Moreover, unsteady heat transfer algorithm should be used to calculate the heat of thermal insulation materials in order to achieve the aim of design optimization and energy-saving. R. Chen (Ed.): ICICIS 2011, Part II, CCIS 135, pp. 23–29, 2011. © Springer-Verlag Berlin Heidelberg 2011
24
G. Liu, R. Xie, and Y. Sun
2 Determine the Model of Unstable Heat Transfer By the basic theory of heat transfer, when study unstable heat transfer problems of single homogeneous material (shown in fig.1), we can obtain the answer to solve the partial differential equations: ⎧ ∂t ( x,τ ) ∂t 2 ( x,τ ) = a⋅ ,0 < x < l ,τ > 0 ⎪ ∂x 2 ⎪ ∂τ ∂t ( x,τ ) ⎪ ,0 < x < l ,τ > 0 ⎨ q( x,τ ) = −λ ⋅ ∂x ⎪ t ( x , 0 ) = 0 ⎪ ⎪⎩
℃
(1)
And t was temperature in , q was heat flux in W/m2, α was thermal diffusivity of the wall materials in m2/h, λ namely thermal conductivity of the wall materials in W/m. , x was the wall calculation coordinate in m, τ namely time variable in h.
Fig. 1. Single homogeneous wooden partition
℃
Fig. 2. Multi-layer wooden partition
Laplace transform the variables x and τ in equation (1) that transform the original differential equations to algebraic equations, for x=l, re-use inverse Laplace transform to obtain the mathematical expression about the wall temperature distribution and heat flux distribution, shown in (2). ⎡T (l , s) ⎤ ⎡ch( s / al ),− sh( s / al ) /(λ s / a )⎤ ⎡T (0, s ) ⎤ ⎥⎢ ⎢Q(l , s)⎥ = ⎢ ⎥ ⎣ ⎦ ⎢⎣− λ s / a sh( s / al ), ch( s / al ) ⎥⎦ ⎣Q(0, s)⎦
(2)
And T(l.s) was the Laplace transform with time for temperature on l calculation section, Q(l,s) was the Laplace transform with time for heat flux on l calculation section, s was the Laplace transform with time. If given the boundary conditions, we can obtain the Laplace transform with temperature and heat flux in any position of wooden partition by (2), re-use inverse Laplace transform with T(l.s) and Q(l,s),then obtain the final solution. Because formula (2) only for single homogeneous material of the wall, the wall of multi-temperature refrigerated trucks be combination of multi-layer insulation materials(shown in fig.2), then the transfer matrix of thermal system wooden partition should include the air layer of inside and outside and multi-layer wooden partition etc.
Research and Analyses on Unsteady Heat Transfer of Inner Thermal Insulation Wall
25
⎡T (l , s) ⎤ ⎡1 − 1 / α n ⎤ ⎡ An ( s) − Bn ( s )⎤ ⎡ An −1 ( s ) − Bn −1 ( s) ⎤ LL ⎢Q(l , s) ⎥ = ⎢0 1 ⎥⎦ ⎢⎣− C n ( s) Dn ( s ) ⎥⎦ ⎢⎣− C n −1 ( s ) Dn −1 ( s ) ⎥⎦ ⎣ ⎦ ⎣
(3)
⎡ A1 ( s) − B1 ( s) ⎤ ⎡1 − 1 / α w ⎤ ⎡T (0, s) ⎤ ⎢− C ( s ) D ( s ) ⎥ ⎢0 1 ⎥⎦ ⎢⎣Q(0, s) ⎥⎦ ⎣ 1 1 ⎦⎣
And αn was the convection heat transfer coefficient of air inside of refrigerated trucks in W/m2. , αw was the convection heat transfer coefficient of air outside of refrigerated trucks in W/m2. . Ai ( s ) = ch( s / al i ) ; Bi ( s) = sh( s / ali ) / λ s / a ;
℃
℃
C i ( s ) = λ s / a sh( s / ali ) ; Di ( s ) = ch( s / al i ) .
,
For B(s)=0 when solution the heat transfer coefficient of wall obtain the solution ai of the transcendental equation. Used expand law Heaviside and superposition method to discrete time, we can receive the Y(j) of heat transfer coefficient in wall under the disturbance of the units triangular wave, shown in (4). ∞ Bi ⎧ − ai Δτ ) ⎪Y (0) = K + ∑ Δτ (1 − e ⎪ i =1 ⎨ ∞ ⎪Y ( j ) = − Bi (1 − e − ai Δτ ) 2 e − ( j −1) ai Δτ ∑ ⎪⎩ i =1 Δτ
j=0
(4)
j ≥1
℃
And Y(j) was the j reaction coefficient in W/m2. , K was the heat transfer coefficient of wooden partition in W/m2. , i was the amount of equation root, ai was the i root with B(s)=0 that transfer matrix with wooden partition thermal system. τ was the discrete time interval in h, Bi was the coefficient.
℃
Bi = −1 /[ ai B′(−ai )] 2
△
(5)
Then, the heat through the wooden partition can be determined by (6). ∞
HG ( n) = ∑ Y ( j )t z ( n − j ) − Kt n j =0
(6)
HG(n) was the heat transfer gains with n time in W/m2, tz(n) was the integrated temperature outside the car with n time in , tn was the air temperature inside the car in . In short, the essence of analysis method above was that the modern control theory be introduced and Laplace transform be adopted, which regards the wall as a thermodynamic system, the temperature boundary conditions changing with any time are decomposed into a series of triangular pulse, solved for the heat flux change caused by the external disturbance of units of temperature wave triangle in advance, which regard as the reaction coefficient of thermal system, and each pulse is linearly dependence, but the thermodynamic system itself is linear system. Based on the application of superposition principle, the heat flux change caused by each pulse is superimposed according to the convolution principle, namely, acquired the thermal condition of overall system. Due to a series of final, so this method is called reaction coefficient method. In the heat transfer of construction field, this method has been applied in a certain, and recognized as the optimization calculation method and the development direction of unstable heat transfer, but due to the great differences between construction and refrigerator in the
℃
℃
26
G. Liu, R. Xie, and Y. Sun
conditions of use, structure, material etc, thus the related knowledge of reaction coefficient method acquired in construction field can not directly apply in the refrigerator, which must concrete analysis according to specific problems.
3 Research on Heat Transfer of Heat-Barrier Material in the Multi-temperature Refrigerated Vehicles
(- )
From (4) to (6), the heat transfer reactivity coefficient Y(j) of the batter wall is the sum of an infinite index which is related to the root ai of the transition matrix element B(s). The number of Y(j) selected in the calculation directly affect the accuracy and the complexity level. At the same time, when the number of the heat transfer reaction coefficient get large enough, Y(j) and the index related to the root above mentioned will tend to be zero, so the problem of how to compute the capacity of heat transfer in unsteady state accurately can be translated into problems that how to select the range of the root value of B(s) element and what number of the heat transfer reaction coefficient should be calculated. In architecture, there are more researches on how to define the range of the root value about B(s) element, but the opinions are various for the types of the architecture and the accuracy standard are various: the ASHRAE says the accuracy can be guaranteed generally while calculating to the root is more than (-50) in air conditioning buildings[1]; references [2, 3] suggest that (-40) is a proper value; besides, Japanese HASP program says (-25) is appropriate while the Canadian program set the standard that (-100) is necessary[4,5]. In the aspect of the number about heat transfer coefficients, there are fewer studies since the relevant difference can be eliminated by adopting periodic reaction coefficient which depends on the nature that there are no area changes about the common buildings[6]. But this method is not suitable for the calculation of the heat transfer of the multi-temperature refrigerated vehicles’ wall because of its nature of moving all the time[7]. Therefore, to define the number of reaction coefficients is necessary in the calculation of the unstable heat transfer. Besides, how the special velocity nature impact the heat transfer nature of the vehicle while it is moving is also the aspect which should be considered in the analysis as well as the impaction level. To sum up, since the large difference between the vehicle and the common building, their heat transfer nature is different, and even larger between their reaction coefficients. All of these make the adopting the method of reaction coefficient should be given more comprehensive analysis on different velocities, different numbers of the equation root, different numbers of the reaction coefficient and any other variety elements according to its nature in the progress of the research on unstable heat transfer in multi-temperature refrigerated vehicles.
4 Reaction Coefficient Analysis and Determination 4.1 Research Parameters and Calculation The internal insulation structure of multi-temperature refrigerated truck is various. In order to keep universality in this research, three common insulation materials in our
Research and Analyses on Unsteady Heat Transfer of Inner Thermal Insulation Wall
27
country were chosen to analyze. (1)1.5mm Weathering Steel, 200mm Insulation and 1.5mm Alloy Steel (2)4mm Rubber Floor Cloth, 19mm Plywood, 4mm Glass Floor, 115mm Insulation, 2mm Alloy Steel (3)1.5mm Weathering Steel, 135mm Insulation, 1.5mm Alloy Steel. 4.2 The Precision Influence from the Number of Equation Root For comprehensive analyzing solution precision influence of B(s) element of the root value set the range of ai from (0) to (-10000) in the beginning. Through the study about multi-temperature refrigerated truck, we found just only the top 5 of the number of the B(s) element equation roots are able to greater impact the reaction coefficient. When the range is from ai to 10000, the value of Y(j) is standard value and obtain relative results after putting into the 4th equation. Compare the results with the Y(j) which result from the top 5 above. The Y(j)analysis curve of material 1 as picture 5. As the picture show, the less the number of Y(j) will be, the more sensitive the result to the number of the B(s) element equation roots will be and the more the number of roots increase, the less the influence will be. In the other hand, the better the thermal insulation of exterior-protected construction will be, the greater the influence to the B(s) element which depend on the number of equation root. For material 1, if only take a root, there are 32 reaction coefficients which exist more than 1.0 × 10-15% calculation errors. For material 2, there are 15 and for material 3, there are 11. The trend will still exist when the number of equation root become more. The top 5 of B(s) elements and relevant roots of the multi-temperature refrigerated truck exterior-protected construction are shown in Table 1. The ai of the B(s) element root in roof, wall and underneath of the truck should be set (-10), (-22), (-24) respectively and it will satisfy the requirement of calculation accuracy. For simplicity, the range of ai should be set to (-25) in calculation.
(- )
- -
(- )
(- )
Table 1. the range with -ai of different materials equation root
i
Material 1
(-a ) i
(s)
B
Material 2
(-a ) i
(s)
B
Material 3
(-a ) i
(s)
B
1
-0.39638148 -0.68370221 -1.17013029 -0.49063269 -0.87937917 -0.53068790
2
-1.58547510 0.17344120
3
-3.56712075 -0.07902275 -10.34793579 -0.15963721 -7.90937811 -0.06893153
4
-6.34102397 0.04607084 -17.62221088 0.14606765 -14.05040327 0.04546968
5
-9.90670575 -0.03093426 -23.94561618 -0.11724395 -21.92145553 -0.03732472
-4.65790452
0.15978138
-3.51675725
0.14028678
28
G. Liu, R. Xie, and Y. Sun
Fig. 3. Error with different number roots
Fig. 4. The K with different materials
4.3 The Influence of Reaction Coefficient Number of Terms on Solution Precision
,
Using the basic properties of reaction coefficient Make the sum of former j-ary Series respectively is K(j), make(6)defined the former 100 series of the reaction coefficient is standard heat transfer coefficient, so by choosing the different number of terms reaction coefficient, the existence relative error δj is: δj =
K − K ( j) × 100% K
(7)
Where, δj is relative error by choosing the different number of terms reaction coefficient in energy consumption computation, %. K(j) is considered as heat transfer coefficient value by select the former n-ary series reaction coefficient in energy consumption computation, W/m2. Based on the foregoing analysis, take the root value of elements B(s) from ai to ( 25). By (7), we can calculate the relative error when various walls surface selects the different reaction coefficient, expressed as the image, As shown in Figure 4. The figure shows in respect to reaction coefficient number of terms when the number of items taken from less than 10, each additional one, errors were significantly reduced, but its trend is more and more slowly. As far as car roof, when the number of items are more than 16, error is less than one percent; When reaction coefficient number of terms take to 29, error is less than one ten-thousandth; For wall and underneath of the car, when reaction coefficient number of terms take to 15 and 13, error is less than one ten-thousandth. So, reaction coefficient take to 30th can sufficient to meet the requirements for multi-temperature refrigeration truck.
-
℃。
,
(- )
,
5 Summary Calculating the unsteady heat transfer of the exterior-protected construction by response coefficient method is an objective method to reflect the dynamic characters of
Research and Analyses on Unsteady Heat Transfer of Inner Thermal Insulation Wall
29
refrigerated vehicles. However, it has been only applied in construction area but refrigerated vehicles. Accordingly, this paper numerically calculated unsteady heat transfer of the exterior-protected construction by principles of response coefficient method and computer-aided analysis, studied the influences of various factors such as different velocities, different term numbers of equation root and different term numbers of response coefficients on load accuracy calculation of refrigerated vehicles. Here are the conclusions as follows.
(- )
(- )
(1) The range of ai should be set to 25 in the selection of v element's root. (2) When the term number of response coefficient was determined, it is reasonable to take values until the 30th term. (3) This paper improved the heat transfer response coefficient method, created situations for the application of this method in multi-temperature refrigerated transportation, and provided supports for the design optimization of multi-temperature refrigerated vehicles and the energy-saving of food refrigerated chain.
Acknowledgements The project was supported by the Natural Science Foundation of Guangdong Province (No.9451009101003189) and Natural Science Foundation of China (No. 51008087).
References 1. 2. 3. 4. 5. 6. 7.
ASHRAE. AHSRAE Handbook-Fundamentals (1997) Yan, Q., Zhao, Q.: Building thermal process. Construction Industry Press, Beijing (1986) Long, W.: Energy conservation of building and construction equipment. Construction Industry Press, Beijing (1990) Long, W., Zhao, J.: Computer simulation of annual dynamic thermal load in hig-rise building. Heating Ventilating & Air Conditioning 20(3), 25–28 (1990) Lian, Z.: Effect of number of root on loads calculated by response factor method. Journal of xi an University of Architecture & Technology 28(3), 245–247 (1996) Boyer, H.: Thermal building simulation and computer generation of nodal models. Building and Environment 31(3), 207–214 (1996) Liesen, R.J., Pedersen, C.O.: An evaluation of inside surface heat balance models for cooling load calculations. ASHRAE Trans. 103(1), 485–502 (1997)
Evaluation of the Industrial Economic Benefits Based on TOPSIS Baolu Wei*, Feng Dai, and Jingxu Liu Institute of Information Engineering, Information Engineering University, Zhengzhou China
[email protected]
Abstract. At first, this article gives an introduction to the principle and evaluation procedures of TOPSIS. Secondly, Using TOPSIS method to assess 8 prefecture-level cities of a province of China based on the basis of statistical data. The evaluation results demonstrate that the application of TOPSIS method to Industrial economic benefits is Reasonable. TOPSIS has some practical value in the economic field, can provide scientific basis for the scientific management. Keywords: TOPSIS; Industrial economic benefits; Economic results.
1 Introduction Industrial enterprises are the pillar industry of national economy, the evaluation of economic benefit is not only an important part of industrial policy, but also an important responsibility of managers. How to find a practical, quantitative and accurate multi-objective comprehensive evaluation method in recent years is an research topics of common concern. This paper introduces systems engineering TOPSIS method, the economic efficiency of industrial enterprises a comprehensive evaluation, and achieved satisfactory results.
2 Principle and Steps of TOPSIS TOPSIS is Short for Technique for Order Preference by Similarity to Ideal Solution, The method is close to the ideal solution to the principle of selecting the best technical solution, the final evaluation results should be the ideal solution is the closest, and farthest away from the worst solution. Using this method, firstly should define the ideal solution for the positive and negative assessment, although both programs could not exist in the assessment (otherwise no assessment), but we both can be idealized as the best, the worst point, in order to other possible options for balancing the distance between the two. Secondly, general the Assessment factor as so to sort, evaluate and analysis. Overall, the algorithm process of the method is as follows: *
This work is supported by the National Social Science Foundation of China (No. 09&ZD014).
R. Chen (Ed.): ICICIS 2011, Part II, CCIS 135, pp. 30–34, 2011. © Springer-Verlag Berlin Heidelberg 2011
Evaluation of the Industrial Economic Benefits Based on TOPSIS
31
Assume the property values from Ai to C j is yij ( i = 1, 2, L , n; j = 1, 2,L , m ) , and Y
⎡ y11 y12 L y1m ⎤ ⎢y y22 L y2 m ⎥⎥ is the initial evaluation matrix. Y = ⎢ 21 . ⎢L L O L ⎥ ⎢ ⎥ ⎣ yn1 yn 2 L ynm ⎦ 1. Standardized the evaluation matrix and comparing the index value, eliminate the impact of the dimensionless between different indicators, the attribute value normalization is as follows: If c j is the efficiency index, the greater the
index value, the better the results of the evaluation indicators. decrees zij =
yij
max { yij | 1 ≤ i ≤ n}
(1)
If c j is the cost-based indicator, the smaller the index value, the better the results of the evaluation indicators, decrees zij =
yij
max { yij | 1 ≤ i ≤ n}
(2)
If c j is the moderate type of indicators, to assess the indicators were most satisfied with is that for the more favorable assessment of indicators, decrees max = max { yij − a #j | 1 ≤ i ≤ n} ; min = min { yij − a #j | 1 ≤ i ≤ n} ;
zij =
2.
max − | yij − a #j | max − min
Units of the evaluation matrix, make the index value into the dimensionless quantity. Decrees rij =
zij
(4)
m
∑z j =1
3.
(3)
2 ij
Unit the weighted Matrix by Expert survey or AHP we can obtain the nomalization of the index weight vector. The weighted matrix is: ⎡ x11 ⎢x X = ⎢ 21 ⎢L ⎢ ⎣ xn1
L x1m ⎤ x22 L x2 m ⎥⎥ ; x = yij ⋅ w j ; L O L ⎥ ij ⎥ xn 2 L xnm ⎦ x12
32
B. Wei, F. Dai, and J. Liu
4.
Determine the positive and negative ideal solution, decree xi+ = max xij , state
; decree = { x , x ,L x } is the negative ideal solution;
x + = { x1+ , x2+ , L , xm+ } is the ideal solution x−
5.
− 1
− 2
i
xi− = min xij , state i
− m
Calculated the distance between positive and negative ideal solution, m
Li = ∑ ( xij − x +j )2
(5)
j =1 m
Di = ∑ ( xij − x −j )2
(6)
j =1
Li and Di are the closeness of the ideal solution to the positive and negative points of Ai . 6. Determine the assessment factor, comparative and analysis the program evaluation factor, define Ci =
Di Di + Li
(7)
Clearly, the closer the assessment factor Ci closer to 1, the closer the program Ai is the ideal solution; the closer the assessment factor Ci closer to 0, the closer the negative ideal solution.
3 Analysis of the Assessment Examples 3.1 The Choice of Evaluation Index System
According to the current of the actual situation of industrial development, comprehensive assessment of its economic benefits, to establish evaluation index system should include: X1—Labor productivity (yuan/person) X2—Net output rate (%) X3— Output rate of fixed assets (%) X4—Interest rate of fixed assets (%) X5—Capital tax rate (%) X6—Sales tax rate (%).
、
、
、
、
、
3.2 The Choice of Evaluation Index System
According to an annual 8 of province-level cities in all of independent accounting of the relevant statistical data calculated by the author of the evaluation order (see Table 1), the application of TOPSIS method for comprehensive evaluation of the economic benefits of industrial cities.
Evaluation of the Industrial Economic Benefits Based on TOPSIS
33
Table 1. 8 cities in a province on the table of economic benefit evaluation Indicators Labor productivity Net output rate Output rate of fixed assets Interest rate of fixed assets
A
B
C
D
E
F
G
H
14250
27362
12521
8560
26895
16850
17520
7950
49.97
81.52
64.35
52.64
85.89
82.61
79.20
74.76
52.42
75.64
58.64
68.50
78.10
65.72
49.67
64.51
11.24
28.56
31.00
9.68
20.78
19.85
24.69
10.83
Capital tax rate
15.64
19.88
20.69
19.67
20.13
11.35
9.99
9.97
Sales tax rate
12.35
20.10
17.35
16.85
19.99
12.34
15.66
11.31
The evaluation index system this title established has been meet the same trend, Directly normalized it, ⎡ 0.2817 ⎢ 0.5409 ⎢ ⎢ 0.2475 ⎢ 0.1692 Z =⎢ ⎢ 0.5316 ⎢ ⎢ 0.3331 ⎢ 0.3463 ⎢ ⎣⎢ 0.1571
0.2436 0.3975 0.3137 0.2566 0.4188 0.4013 0.3862 0.3645
0.2858 0.4124 0.3197 0.3734 0.4258 0.3583 0.2708 0.3517
0.1886 0.4794 0.5203 0.1625 0.3488 0.3332 0.4144 0.1818
0.3437 0.4369 0.4547 0.3730 0.4424 0.2494 0.2196 0.1971
0.2716 ⎤ 0.4421⎥⎥ 0.3816 ⎥ ⎥ 0.3706 ⎥ 0.4397 ⎥ ⎥ 0.2714 ⎥ 0.3445 ⎥ ⎥ 0.2488 ⎦⎥
Obtain the optimal value vector and the vector of worst values: Z + = ( 0.5409, 0.4188, 0.4258, 0.5203, 0.4547, 0.4221) ; Z − = ( 0.1571, 0.2436, 0.2708, 0.1625, 0.1971, 0.2488 ) ;
Calculated the distance between positive and negative ideal solution, take city A for example: 2 2 2 Da+ = ( 0.2817 − 0.5409 ) + ( 0.2436 − 0.4188 ) + L + ( 0.2716 − 0.4421) = 0.5186 ; Da− =
( 0.2817 − 0.1571)2 + ( 0.2436 − 0.2436 )2 + L + ( 0.2716 − 0.2488 )2
C = 0.1961* ( 0.5186 + 0.1961) = 0.2744 .
Calculate the remaining city as to A, detailed results see Table 2: Table 2. Industrial economic benefits of 8 results city A B C D E F G H
Di+
Di−
Ci
0.5186 0.0512 0.3347 0.5541 0.1722 0.3928 0.3728 0.6116
0.1961 0.6216 0.4770 0.2379 0.5712 0.3096 0.3595 0.1467
0.2744 0.9239 0.5877 0.3004 0.7684 0.4408 0.4909 0.1934
results 7 1 3 6 2 5 4 8
= 0.1961 ;
34
B. Wei, F. Dai, and J. Liu
From table2 we can see B, E and C city is the finest city, G, D, F, A and H city is the Medium city in the industrial economic benefits. There is no inferior city. It explains that the industrial economic benefits of the 8 cities’ development is Balanced.
4 Summary TOPSIS is a systems engineering approach for the comprehensive evaluation. In recent years, it has begun to be used for economic and health fields. The law of the original data with the trends and normalized, not only to eliminate the influence of different indicators of dimension, but also make full use of the original data can be quantitatively evaluate the pros and cons of different units level, the results of objective and accurate. In this paper, the development of the current status quo of industrial enterprises, the establishment of the industrial economic benefit evaluation index system, the method is introduced into the field of industrial economy, the economic benefits of comprehensive evaluation of multiple units, results in good agreement with the actual situation.
References 1. 2. 3.
Yue, C.-y.: Decision-making theory and approach. Science Press, Beijing (2002) Xu, Z.-s.: A new method of multiple objective decision under uncompleted information. Operations and Management 10(2), 25–28 (2001) Olson, D.L.: Comparison of weights in TOPSIS models. Mathematical and Computer Modeling (40), 721–727 (2004)
Optimization and Distributing Research of Measuring Points for Thermal Error of CNC Machine Based on Weighted Grey Relative Analysis Qin Wu 1,2, Jianjun Yang 1,2, Zhiyuan Rui 1, and Fuqiang Wang1 1
School of Mechanical and Electronical Engineering, Lanzhou University of Technology, Lanzhou, 730050, China 2 Key Laboratory of Digital Manufacturing Technology and Application, The Ministry of Education, Lanzhou University of Technology, Lanzhou, 730050, China
[email protected],
[email protected],
[email protected],
[email protected]
Abstract. The optimization of modeling method and distributing research of choosing the measuring points for thermal error of CNC machine were presented based on the theory of weighted grey relative analysis in the article. The model of weighted grey relation was set up firstly, then, by calculating the matrix of grey relation between the temperature data serial of thermal points and thermal error data serial, after classify the thermal points which placed on the CNC machine, 5 critical points which should be in different classes were picked out from whole16 temperature points according to the degree of grey relation. At last, the thermal forecasting model was founded using the 5 critical points. The model was validated to be more accurate and robust. Keywords: thermal error; weighted grey correlation; machine center; measuring points; modeling.
1 Introduction As the components of CNC machine tools being uneven heated in operation, so the distribution of temperature field of machine tools being complex, the resulting thermal deformation will cause the change of relative position between cutting tools and workpiece , it can be said that the thermal error is the largest error source of CNC machine tool. According to the statistics, the thermal error in the proportion of the total error of machine tool can reach 70% [1]. So how to improve the prediction accuracy and robustness of the error model, become the issue that so many scholars from different countries developing the large number of fruitful research. Chen J. S. of University of Michigan integrated the geometric error and thermal error, defined 32 new machine errors, and conducted the error model of machine tool by using multiple regression analysis[2]. Yang Jian-Guo of Shanghai Jiao Tong University proposed the means of thermal error modeling robustly based on the thermal modal analysis, and R. Chen (Ed.): ICICIS 2011, Part II, CCIS 135, pp. 35–40, 2011. © Springer-Verlag Berlin Heidelberg 2011
36
Q. Wu et al.
established the thermal error model applying multiple linear regression method and the gray correlation method [3]; Du Zheng-Chun, etc. advanced the thermal error compensating and modeling method based on Radial Basis Function (RBF) neural network for CNC lathe. Although these analysis methods improved the identification speed and accuracy of thermal error, but the prediction accuracy and generalization ability of the model is not high, and it is difficult to achieve the requirements of precision machining or ultra-precision machining. As the temperature field with non-stationarity and time variability, its influencing factors are complex. In order to avoid too little temperature measuring points leading to the lack of useful information, it is required to arranging a large number of temperature sensors on the machine tools. But these measuring points not only increases the workload of measuring and calculating data, but also coupling could occur between the nearby measuring points. So it requires to selecting the critical temperature measuring points for thermal error modeling. As the feature of thermal error is obviously gray, while the measurement of limited temperature measuring points have the character of small sample and poor information relative to the overall temperature distribution of the machine tool, so the article will establish the weighted gray correlation analysis model based on the measured temperature data, and select the critical temperature measuring points for the establishment of thermal error prediction model.
2 The Model of Weighted Grey Relative Analysis Grey relative analysis does not require a large sample of the typical distribution of the data column. In the experimental data processing of each temperature measuring point, the analysis method can use very little experimental data. The key of Grey relative analysis is the establishment of Grey correlation, and the Grey relative grade is quantum that reflects the correlative degree among each factor [4]. However, the formula which commonly calculating the correlative coefficient and the relative grade only focusing on the area between the two curves to identify semblable extent, ignoring the change trend of the curves, and not considering the weighted difference of all factors. In this paper, the weighted coefficient will be added based on the optimization of the sample data sequence, this method makes the results better reflect the proximity degree between the two curves. Make X = {xθ θ = 0,1,2,L, m} as the relative factor aggregate of the data sequence, x0 as the reference function, xi as the comparison function, i = 1,2,3, L , m , xθ (k ) for the value of xθ in No. k points, where k = 1, 2,3, L , n . In order to obtained Increment information and expanded density of the information in the modeling, the data sequence had Inverse Accumulating Generation Operator (IAGO). Set up y = ( y(1), y(2), y(3),L y(n)) as the inverse accumulating generated sequence of the sequence x = ( x (1), x (2), x (3), L x( n)), where y (1) = x (1), y (k ) = x (k ) − x (k − 1),, (k = 2, 3, L n) .
Optimization and Distributing Research of Measuring Points
37
对于 x , x ,令: 0
i
ξ ⋅ max max x0 (k ) − xi (k ) i∈m, k∈n
ζ i (k ) =
λ1 x0 (k )− xi (k ) + λ2 y0 (k )− yi (k ) + ξ ⋅ max max x0 (k ) − xi (k ) i∈m
k∈n
i∈m
i∈m
k∈n
(1)
k∈n
the gray relational coefficient x i of x 0 at the time of k, ξ for the differentiate ratio, 0 < ξ < 1 , λ1 for the weighted displacement coefficient, λ 2 for the In the formula (1),
ζ i (k ) for
且
weight coefficient of rate of change, λ1 , λ 2 ≥ 0, λ1 + λ 2 = 1 . In practice, all coefficients can be appropriately adjusted according to the emphasize particularly on the specific issues. According to the formula (1), it met the definition of the gray relational space. The calculating formula of the gray relational grade given as follows [5]:
γ i = γ ( x 0 , xi ) =
1 n ⋅ ∑ ζ i (k ) n k =1
(2)
In the formula (2), γ i for the gray relative grade that xi of x 0 . 2.1 Experimental Analysis of Examining the Thermal Error of CNC Machine In this experiment, a vertical machining center was regarded as the subject investigated, each measuring point and the spindle thermal error data were collected. As temperature field of the tool is subject to many factors, in order to fully detect the changes in temperature field, 16 temperature sensors were disposed on the machining center in the experiment, their distribution was as follows: No.1, 2 sensor were placed at the spindle box near the spindle bearings location; No.3, 4 sensors were placed at the spindle nose; No.5, 6, 7 sensors were placed at the rolling guides of X, Y, Z axes; No.8, 9, 10 sensors were placed separately at the ball screws of X, Y, Z axes close with screw nut; the 11th sensor was placed at the front uprights; the 12th sensor to monitor temperature changes of surroundings;No.13, 14 sensors were placed on both sides of the bed; the 15th sensor was placed on the table; the 16th sensor was placed at the cooling fluid box under the bed. Three non-contact eddy flow displacement sensors were used to measuring thermal error of the vertical machining center. They were installed in specially designed experimental device, arranged around the spindle, were respectively used to measure the thermal drift error of the spindle at the direction of the X, Y and Z axes [6]. The experiment adopted the style of dry run to simulate the cutting cycle. The rotating speed of spindle was 3000r/min; the feed speed was 25m/min; and cooling fluid keeping circulation. Sampling time was 5 hours of continuous operation; the sampling interval was 15 min. The curve diagram changes along with time of the temperature of each measuring point and the thermal error at the direction of z axis separately shown in Fig. 1 and Fig. 2.
38
Q. Wu et al. 36
0
34
-5 9 7 16
1
3 2
11
Error/um
4
32
T/
5 10
8
30
6
13 15
-10
-15
28 14 12
-20 26
24
0
50
100
150
200
250
300
-25
t/min
0
50
100
150
200
250
300
t/min
Fig. 1. The curve diagram changes along with Fig. 2. The curve diagram changes along with time of the temperature of each measuring time of the thermal error at the direction of z axis point
2.2 Establishment and Analysis of the Weighted Grey Relative Model Analysis of the Experimental Data. Make the data sequence of the temperature measuring points as a comparison function of the gray system (son-factors), and makes the data sequence of the thermal error at z direction of the spindle as a reference function (mother-factors), each data series takes 11 time nodes. The data were processed to dimensionless first, and substituted into equation (1), then calculated the relative coefficient between the comparative series xi (k ) i=1,2,3,…,16, k=1,2,3,…,10 and the reference series x0 (k ) .The gray relative coefficient matrix B formed as follows:
(
⎡0.8721 ⎢0.8721 ⎢ ⎢0.8721 ⎢ ⎢0.8721 ⎢0.8721 ⎢ ⎢0.8721 ⎢0.8721 ⎢ B = ⎢0.8721 ⎢0.8721 ⎢ ⎢0.8721 ⎢ ⎢0.8721 ⎢0.8721 ⎢ ⎢0.8721 ⎢0.8721 ⎢ ⎣⎢0.8721
)
0.9041 0.9773 0.8651 0.8016 0.7686 0.7760 0.7515 0.6715 0.6036 0.5553 ⎤ 0.9043 0.9769 0.8654 0.8011 0.7680 0.7759 0.7518 0.6713 0.6037 0.5556 ⎥⎥ 0.9043 0.9769 0.8654 0.8012 0.7678 0.7756 0.7508 0.6706 0.6030 0.5549 ⎥ ⎥ 0.9042 0.9769 0.8659 0.8022 0.7691 0.7766 0.7525 0.6717 0.6039 0.5557 ⎥ 0.9039 0.9774 0.8666 0.8028 0.7705 0.7784 0.7540 0.6732 0.6051 0.5567 ⎥ ⎥ 0.9039 0.9772 0.8669 0.8030 0.7707 0.7787 0.7540 0.6731 0.6052 0.5569 ⎥ 0.9039 0.9773 0.8668 0.8031 0.7706 0.7780 0.7538 0.6734 0.6053 0.5572 ⎥ ⎥ 0.9036 0.9779 0.8671 0.8037 0.7720 0.7799 0.7555 0.6743 0.6060 0.5574⎥ 0.9036 0.9780 0.8671 0.8036 0.7701 0.7773 0.7530 0.6725 0.6046 0.5562⎥ ⎥ 0.9042 0.9766 0.8662 0.8026 0.7697 0.7773 0.7530 0.6723 0.6044 0.5561⎥ ⎥ 0.9034 0.9079 0.8674 0.8033 0.7710 0.7795 0.7557 0.6753 0.6071 0.5585⎥ 0.9034 0.9066 0.8673 0.8034 0.7707 0.7791 0.7556 0.6752 0.6071 0.5583 ⎥ ⎥ 0.9037 0.9052 0.8669 0.8031 0.7709 0.7798 0.7557 0.6756 0.6075 0.5590⎥ 0.9035 0.9040 0.8677 0.8038 0.7715 0.7804 0.7562 0.6761 0.6079 0.5591⎥ ⎥ 0.9027 0.9011 0.8697 0.8065 0.7752 0.7848 0.7605 0.6793 0.6106 0.5615⎦⎥
The relative coefficient substituted into equation (2), gives the relative grade that were normalized between each temperature measuring point and the thermal errors:
Optimization and Distributing Research of Measuring Points
39
, , , , , , = 0.8906,γ = 0.9688,γ = 1,γ = 0.8438,γ = 0.7969,γ = 0.0313, = 0,γ = 0.0156,γ = 0.0469,γ = 0.3594
γ 1' = 0.6875 γ 2' = 0.6719 γ 3' = 0.6250 γ 4' = 0.75 γ 5' = 0.8750 γ 6' = 0.8438 γ
' 7
γ 13'
' 8
' 14
' 9
' 10
' 15
' 11
' 12
' 16
After the normalization, values were all dimensionless quantities [7]. Application and Validation of the Model. Generally, the measuring points which were arranged in the same parts should be united a class, and the number of selected critical temperature measuring points should be as much as possible with the number of key components of machine tools. In this case, measuring points can be divided into six categories, namely: (1,2,3,4); (5,6,7); (8,9,10); (11); (12,13, 14,15); (16). In each category, choose the critical temperature measuring point which with the maximum relative grade. Finally, No.4, 7, 9, 11 and 16, the five sensors were chose as the key temperature measuring points for modeling the thermal error, they corresponded to the five locations such as the spindle end, z-axis rolling guide, y axis screw nut, column and cooling tank. Finally, based on 16 temperature measuring points and the selected 5 critical temperature measuring points, the modified GM modeling approach was used for the thermal error modeling, the results shown in Fig.3 and Fig.4. Obviously, modeling with the 16 temperature measuring points, the coupling with the data of each temperature measuring point, affected the accuracy of the model; and modeling with the finally identified five key temperature measuring points that optimized by the weighted gray relative analysis, the accuracy of the model has been greatly improved, the fitting precision of the curve was relatively high, residual error was small.
Fig. 3. The thermal error model based on 16 temperature variables
Fig. 4. The thermal error model based on 5 temperature variables
40
Q. Wu et al.
3 Conclusion In this study, the data that collected by data acquisition system had gray nature relative to the thermal distribution of the overall machine tool, and the data columns with small samples and uncertain typical distribution. It was very suitable to analyzing and modeling the thermal error with the gray system theory [8]. Using the model of weighted gray relative analysis before-mentioned, the distribution of temperature field that affected the thermal error of machine tool was optimized. Validated by the modeling, the forecast precision of the thermal error model was quite high.
Acknowledgements It is a Special project supported by the national science and technology Program of China (2009ZX04001-015).
References 1. 2.
3.
4. 5.
6.
7.
8.
Jun, N.: A Perspective Review of CNC Machine Accuracy Enhancement through Real-time Error Compensation. China Mechanical Engineering 8, 29–33 (1997) Hong, Y., Jun, N.: Dynamic neural network modeling for nonlinear, non-stationary machine tool thermally induced error. International Journal of Machine Tool Manufacture 45, 455–465 (2005) Jianguo, Y., Weiguo, D.: Grouping Optimization Modeling by Selection of Temperature Variables for the Thermal Error Compensation on Machine Tools. China Mechanical Engineering 15, 10–13 (2004) Youxin, L., Longting, Z., Min, L.: The Grey System Theory and The Application in The Mechanical Engineering. Press of National University of Defense Technology (2001) Yongxiang, L., Hengchao, T., Jianguo, Y.: Application of Grey System Theory in Optimizing the Measuring Points of Thermal Erron on Machine Tools. Machine Design & Research 2, 78–81 (2006) Jiayu, Y., Hongtao, Z., Guoliang, L.: Optimization of Measuring Points for Machine Tool Thermal Error Modeling Based on Grouping of Synthetic Grey Correlation Method. Journal of Hunan University (Natural Sciences) 35, 37–41 (2008) Jiayu, Y., Hongtao, Z., Guoliang, L.: Application of a New Optimizing Method for the Measuring Points of CNC Machine Thermal Error Based on Grey Synthetic Degree of Association. Journal of Sichuan University (Engineering Science Edition) 40, 160–164 (2008) Bryan, J.B.: International Statures of Thermal Error Research. Annals of CIRP 39, 645–656 (1990)
A DS-UWB Cognitive Radio System Based on Bridge Function Smart Codes Yafei Xu1,2, Sheng Hong1, Guodong Zhao1, Fengyuan Zhang2, Jinshan Di1, and Qishan Zhang1 1
Beihang University, XueYuan Road No.37, HaiDian District, BeiJing, China
[email protected],
[email protected] 2 Beijing University of Chemical Technology 15 BeiSanhuan East Road, ChaoYang District, Beijing, China
Abstract. This paper proposes a direct-sequence UWB Gaussian pulse of cognitive radio systems based on bridge function smart sequence matrix and the Gaussian pulse. As the system uses the spreading sequence code, that is the bridge function smart code sequence, the zero correlation zones (ZCZs) which the bridge function sequences' auto-correlation functions had, could reduce multipath fading of the pulse interference. The Modulated channel signal was sent into the IEEE 802.15.3a UWB channel. We analysis the ZCZs's inhibition to the interference multipath interference (MPI), as one of the main system sources interferences. The simulation in SIMULINK/MATLAB is described in detail. The result shows the system has better performance by comparison with that employing Walsh sequence square matrix, and it was verified by the formula in principle. Keywords: UWB; Bridge function; Smart code; BER; Cognitive radio; MPI.
1 Introduction Recent years, international academia and IEEE standardization organizations are more and more interested in cognitive radio technology, calling it as the next big thing in the future [1] [2] [5], ultra-wideband (UWB) wireless communication systems is the first way in the level of technical and practical steps to achieve the cognitive radio [3][4][6]. UWB is Mainly used in intensive multipath indoor channels. Multipath interference (MPI) is the main source of interference in systems [3]. In the third generation mobile communication technology, mainly in code division multiple access technology (wave division technology) [7]. In traditional CDMA systems, multiple encoding are widely used with orthogonal codes and PN code, limited by the Walsh matrix, the traditional CDMA system is a strong self-interference system, people began to study all have a zero correlation zones (ZCZs) and low correlation zones multiple access codes [7], that is, smart code sequence, which can reduce the multipath fading of the pulse interference. R. Chen (Ed.): ICICIS 2011, Part II, CCIS 135, pp. 41–46, 2011. © Springer-Verlag Berlin Heidelberg 2011
42
Y. Xu et al.
This paper has the following main aspects. Section II describes the bridge function smart code sequence matrix and the nature of autocorrelation. Section III elaborates the SIMULINK / MATLAB system model. Section IV gives the simulation results and makes a qualitative description. Section V is the conclusion.
2 Bridge Function Smart Code Sequence Matrix Sequence with the following characteristics could be called smart sequences [7]: autocorrelation function ⎧1 τ = 0 Raa (τ ) = ⎨ ⎩0 τ = 1
in a small intervalτ 0
(1)
cross-correlation function, to some zone τ 0 ,all of the τ
Rab (τ ) = δ
(2)
Where δ far less than 1. Paper [4] discusses the first sort of the bridge function correlation which is first copying and after shifting, obtains a class of smart code sequences, and received the following two theorems, quoting as follows: Theorem 1 (1) Each sequence in the group B r i q , k ( m ) , have the same zero-correlation zone
length, when 0 < τ < 2k , RBri ( m ) (τ ) = 0 (2) Any two different sequences in the group have the same length of zero correlation zone, when 0 ≤ τ ≤ 2 k , RBri ( m ), Bri ( n ) (τ ) = 0 By the definition of smart code, we know that the bridge function sequences in the group is a special kind of smart code sequence. Theorem 2
(1)Each sequence in the group B r i q , k ( m ) , have the same zero-correlation zone length, when 0 < τ < 2k , RBri ( m ) (τ ) = 0 (2) Any two different sequences in the group, it’s cross-correlation function identically zero RBri ( m ), Bri ( n ) (τ ) = 0
A DS-UWB Cognitive Radio System Based on Bridge Function Smart Codes
43
3 System Structure of the DS-UWB The diagram of DS-UWB system model for one user is shown
Fig. 1. The diagram of cognitive radio system model for one user
In the UWB pulse generator, Gaussian pulse waveform was generated. The output single pulse signal is then modulated into modulation. Signal model The transmission signal can be expressed as follows
s (t ) =
∞
∑d
n =−∞
⎡n⎤ ⎣⎢ G ⎦⎥
c n p (t − nTc )
(3)
p (t ) is the normalized pulse, and the duration is Tc . cn is the spreading code, and the period is G , symbol period is Ts = GTc , so G is the spreading gain. Sending the modulation signal into the standard of UWB Channel(SV/IEEE 802.15.3a) By the SV / IEEE 802.15.3a channel model given [3] L −1 K −1
h(t ) = ∑∑ α k ,l (t − Tl − τ k ,l )
(4)
l =0 k =0
where L is the number of clusters, K is the number of cluster-rays,
α k ,l is the multi-
path gain, T l is delay time in cluster l . τ k ,l is the relative delay from the section
k rays in cluster l Received signal,
r (t ) = s (t ) * h(t ) + n(t )
(5)
n (t) is additive white Gaussian noise which the mean is 0, and bilateral power spectral density is N 0 / 2 .
44
Y. Xu et al.
Literature [4] also described as multi-path interference
Eu [nIPI ,u (i ' ) + nISI ,u (i ' )] Where
nIPI ,u (i ' ) is inter-symbol interference, nISI ,u (i ' )
(6) is Inter- Pulse interference.
We can see that multipath interference is made up by every multipath interference, each of the multipath interference is divided into two. Based on the definition of IEEE 802.15.3a channel model, the energy of the multipath components is in accordance with the exponential rate of decay, By literature [5], we know that the variance of multipath interference is
σ 2 MPI =
1 G2
N −1
M −1
∑ ∑
l =0 k =0 M + K ≠m
l 2 (m − M − k )) le − M Δτ / Γ e − k Δτ /γ ( Rc 2 (m − M − k ) + R c
(7)
l (τ ) = R (T − τ ) Rc (τ ) is the Spreading code autocorrelation, R c c s Finally, from the BPSK error rate formula, we can obtain the m’th synchronization of multi-path matched filter’s receiver error probability ⎡ ⎤ 2 Em Pe = Q ⎢ ⎥ 2 ⎣ σ M PI + N 0 / 2 ⎦
(8)
E m is the energy of each reception symbol in the multi-path and
Q(a) = ∫
∞
a
1 − x2 / 2 e dx 2π
(9)
By judging and error rate calculation block, we could get the bit error rate.
Because of Rc (τ ) is the spreading code autocorrelation, with the smart code sequence value k value increases, the zero correlation zones begin to get longer. By the formula (9), we can see that the bit error rate performance getting better and better.
4 Simulation Results The system simulation structure is modeled in Simulink/Matlab software environment. UWB channel impulse response has four types (CM1, CM2, CM3 or CM4). In our simulation, we select the CM2.The transmitted binary data is set to be 10000 bits with symbol period of 4ns. Because the simulation results depend on the channel impulse response of a specific implementation, the channel influence should be correctly amended by averaging a number of the channel realizations. However, this will bring more time costs. Therefore, we make an appropriate balance between impact of the channel and time costs. The simulation results were showed in figure 2, 3. Figure 2, using bridge function smart code sequence matrix which belongs to theorem 1, and parameters is from k=1 to k= 4. Figure 3, using special bridge function smart code sequence matrix which
A DS-UWB Cognitive Radio System Based on Bridge Function Smart Codes
45
belongs to theorem 2, and parameters is from k=1 to k=4. It can be seen from the figure that using the bridge function smart code sequence matrix system has the better bit error rate performance than using Walsh function sequence. And with the values of k in the bridge function sequence increases, the zero correlation zone sequences of smart sequences get large too, and the systems have better system performance. This is because the bridge function smart code autocorrelation function, the existence of zero correlation zones, can effectively reduce the multipath interference. From the paper [7] we can see that the IEEE802.15.3a channel’s multipath interference is determined by the spreading code cycle, multipath gain and code spreading sequence code autocorrelation function .And when the channel parameters and the spreading sequence code determines, the spreading code’s cycle, multipath gain is determined too. Therefore, multipath interference is mainly determined by the correlation function of the spreading code sequences. With the increase of zero correlation zone of the correlation function, by the formula (9), we know that system has better BER performance. 0
10
-1
Bit Error Rate
10
-2
10
-3
10
Walsh With zeors padding Walsh(8) Bridge(3,1) Bridge(3,2)
-4
10
Fig. 2
0
5
10
15
Eb/No(dB)
Fig. 2. Using bridge function smart code sequence matrix which belongs to theorem 1 and Fig. is2 from k=1 to k=4 q = 4, and parameters 0
10
-1
Bit Error Rate
10
-2
10
Walsh(8) With one zero padding Walsh(16) Bridge(4,1) Bridge(4,2) Bridge(4,3)
-3
10
0
5
10
15
Eb/No(dB)
Fig. 3. Using special bridge function smart code sequence matrix which belongs to theorem 2 and q = 4, and parameters is from k=1 to k=4
Fig. 3 Fig. 3
46
Y. Xu et al.
5 Conclusion This paper proposes an ultra wideband (DS-UWB) cognitive radio system model witch make the bridge function smart code as the spread spectrum sequences. And compared bit error rate (BER) which use the Walsh sequence as the spreading code. The non-periodic autocorrelation function of each sequence that in the bridge function smart code sequence matrix has the zero correlation zones (ZCZS). Using the bridge function smart code sequence matrix, and chose the appropriate value of k, we can get a better anti-multipath fading and BER performance. The simulation results also verify this conclusion. This paper presents a single-user system, and verifies the zero correlation zones (ZCZS) of bridge function smart code sequence autocorrelation function have a good inhibition to the multipath interference. We know that, in the Code Division Multiple Access(CDMA) system, wish to use small cross-correlation function of sequences, ideally, the correlation function is to 0, that is, two code sequences is orthogonal, so that we can distinguish between different users, so smart code sequence in the communication system has broad application prospects.
Acknowledgments This work is supported by the Fundamental Research Funds for the Central Universities under grant No. YWF-10-02-023. China.
References 1.
2.
3.
4.
5.
6.
7.
Hong, S., Liu, K., Qi, Y.: A new direct-sequence UWB transceiver based on Bridge function sequence. In: 2010 Second International Conference on Computational Intelligence and Natural Computing, September 13-14, pp. 209–212 (2010) Di, J., Hong, S., Zhang, Q.: An UWB Cognitive Radio System Based on Bridge Function Sequence Matrix and PSWF Pulse Waveform. In: 2010 Second International Conference on Computational Intelligence and Natural Computing, September 13-14, pp. 162–165 (2010) Fisher, R., Kohno, R., Ogawa, H., Zhang, H., Takizawa, K., Mc Laughlin, M., Welborn, M.: DS-UWB physicallayer submission to 802.15 task group 3a, pp. 15–40. IEEE P, Los Alamitos (2005) Shaterian, Z., Ardebilipour, M.: Direct Sequence and Time Hopping ultra wideband over IEEE.802.15.3a channel model. In: 16th International Conference on Telecommunications and Computer Networks, SoftCOM 2008, September 25-27, pp. 90–94 (2008) Yang, Z., Qian, Y., Li, Y., Bi, X.: IEEE 802.15.3a channel DS-UWB multipath interference analysis. Journal of Natural Science of Heilongjiang University 24(1) (February 2007) Sablatash, M.: Adaptive and Cognitive UWB Radio and a Vision for Flexible Future Spectrum Management. In: 10th Canadian Workshop on Information Theory, CWIT 2007, June 6-8, pp. 41–44 (2007) Zhang, F., Zhang, Q.: A new type of smart code sequence and the correlation function. Journal of Telemetry;Tracking and Command (September 2005)
Problems and Countermeasures of Zhejiang High-Tech Enterprises Industry-University-Institute Cooperation in China Qing Zhou1, Chong-Feng Mao2, and Lin Hou1 1
Institute of Management Decision and Innovation, Hangzhou Dianzi University, Xiasha Higher Education Zone, Hangzhou, Zhejiang P.R. China
[email protected] 2 School of Business, Central South University, 932, Yuelu South Road, Changsha, Hunan P.R. China
[email protected]
Abstract. Industry-university-institute cooperation is an important means to accelerate technical development and achievements for high-tech enterprises. Considering that Zhejiang high-tech enterprises existed some problems which included low cooperative level, single distribution, weak secondary R&D ability, obvious risk and so on, government should play an guiding role on improving information service system, enhancing cooperative level, promoting scientific intermediary service organization system construction, and building better environment for Industry-university-institute cooperation. Keywords: High-tech enterprises; Industry-University-Institute Cooperation; Problems; Countermeasures.
1 Introduction Industry-university-institute cooperation is valuable experience getting from the economic and technical development. At the moment, Industry-University- Institute cooperation has become the strategic measure which speeds up technical development and achievement, increases overall national strength, and strengthens economic competitiveness. In 2008, Chinese Industry-University-Institute cooperation technology development contract amounted to 900 billion yuan, accounting for 37% of technology market transactions in total contract amount. The whole nation has established 8 Industry-University-Institute strategic alliances, 129 productivity promotion centers, 67 university science parks, with 1115 colleges and universities participated in the research cooperation. In recent years, industry-university-institute cooperation has enjoyed the rapid development, but also some new problems; many researchers on these issues conducted analysis and discussion from all sides. Cohen, Nelson and Walsw (2002) found that not only the formal cooperation was very important, but informal cooperation was also very important, even more important [1]. Monjon and Waelbroeck (2003) considered that commissioned R&D in a variety of R. Chen (Ed.): ICICIS 2011, Part II, CCIS 135, pp. 47–52, 2011. © Springer-Verlag Berlin Heidelberg 2011
48
Q. Zhou, C.-F. Mao, and L. Hou
industry-university-institute cooperation technical innovation model be in a more important position[2]. Zhong Wei-jun, Mei Shu-e, Xie Yuan-yuan(2009) obtained conclusions that among all the technical innovation modes in the industry-university-institute cooperation, joint and cooperation R&D is in an absolutely dominant position, commissioned R&D and consultation also play an important role, while transforming of the science research and technology development achievements and new ventures are in a secondary position[3]. Mao Jia-qiang, Liu Lu (2009)concluded that in the combination of industry study and research there are such problems as the improper enterprise understanding the low turning ratio of technology the shortage of the research and development funds the imperfect planning and coordination mechanism and the imperfect laws regulations and policies. In the development of industry study and research, governments should make strenuous efforts to support the constructing of regional innovation group of combination of industry study and research should perfect the related policies laws and regulations[4]. This paper used the benchmarking test audit model designed by Chiesa et al 1996 to analyze measured problem[5]. Empirical data originated from “Survey of Zhejiang Enterprises Industry-University-Institute Cooperation in China” organized by Zhejiang Province Science and Technology Department, which obtained 817 sample enterprises. By controlling the variables in the total sample as analysis of high-tech enterprises to extract the object, we obtained 111 researched high-tech enterprises. During empirical analysis, this paper analyzed problems of industry-university-institute cooperation in Zhejiang high-tech enterprises from motivation, the main influencing factors and so on, and gave some countermeasures to solve these problems.
,
,
,
,
,
( )
,
,
, , ,
2 Problem Analysis Between 2006 and 2008, the average operating income of Zhejiang high-tech enterprises was 513.5 million yuan. The average R & D investment was 1327 million yuan, accounting for 2.5% of the average operating income. The average cooperative R & D investment was 5.15 million yuan, accounting for 0.97% of the average operating income. About 86 enterprises hammered at industry–university-institute cooperation, and the total item was 351 projects, nearly 3 projects per enterprise. These data suggested that industry-university-institute cooperation of Zhejiang high-tech enterprises had a boom trend, industry-university-institute cooperation become an important way of Zhejiang high-tech enterprises technical innovation. But through questionnaires and interviews, we also found there were many problems. Firstly, industry-university-institute cooperation still remains at a low level. The main motivation of industry-university-institute cooperation of Zhejiang high-tech enterprises was to develop new products, improve product quality, improve technology equipments and develop new markets, the proportion separately reaching more than 30%. But the object of patent development and technical standards , which was main way to enhance core competitive advantages, separately held only 20% and 6% proportion. Secondly, the mode of cooperation and the way of interest distribution were relatively single. The main mode of industry-university-institute cooperation of Zhejiang high-tech enterprises was cooperative development patterns, accounting for 86.0%. Other patterns, such as commissioned development, building R&D institutions and
Problems and Countermeasures of Zhejiang High-Tech Enterprises
49
technology transfer etc, were accounting to less than 10%. At the same time, 62.0% Zhejiang high-tech enterprises completed cooperation through providing R&D fund for universities and research institutes. Other patterns, such as assigned profit according to sales, retained profits, invest proportion, respectively held 18% proportion. Thirdly, the secondary R&D ability of ZheJiang high-tech enterprises is not strong. Cooperative approach was always the important innovation method selected by ZheJiang high-tech enterprises, but the method always resulted in short-term goal on industry-university-institute cooperation, which mass cooperation remained at imitative phase. Meanwhile, because many decision makers couldn’t understand industry-university-institute cooperation effectively, many enterprises didn’t want to invest a lot of R&D funds for industry-university-institute cooperation. This was a direct result for high-tech enterprises lacking "secondary innovation" capacity, which resulted in weak R&D achievements. Finally, the risk of industry-university-institute cooperation was obvious and serious. At present, the situation of industry-university-institute cooperation of Zhejiang high-tech enterprises was relatively satisfied. More than 40% enterprises considered that their industry-university-institute cooperation was fine; more than 10% enterprises intended to cooperation again after current cooperation. But More than 40% enterprises considered that there were many problems with industry-university-institute cooperation, and among them 14% enterprises often encountered disputes on the distribution of interest. 10% enterprises often disputed with partners because of intellectual property. At the same time enterprises would face risk in the field of market, technology etc during industry-university-institute cooperation. 50% enterprises considered the main risk of industry-university-institute cooperation was technical risk, although 60% enterprises considered marketing risk. These risks directly lead to uncertainty during industry-university-institute cooperation: 70% industry-university-institute cooperation projects couldn’t meet the expected target, 13% projects couldn’t distribute interest reasonably, 9% projects faced with conflict of inconsistent relationships and so on.
3 Countermeasures Enterprise is the body of innovation, and enterprise innovation need intellectual support of universities, research institutes, and it is more important for government supports to provide necessary innovation public goods and services. Through government support, enterprises, research institutes and universities can requires more innovation to be innovative. This section analyzed how different factors affected Zhejiang high-tech enterprises to absorb technology and knowledge from universities and research institutions. Then this section analyzed the role of government on industryuniversity-institute cooperation and we gave some suggestion for government to help Zhejiang high-tech enterprises cooperative R&D. As we can see from Table 1, Zhejiang high-tech enterprises industry-universityinstitute cooperation were influenced by many factors. The main influence factors including lack of information on technology, the high fee of technology transfer, lack of intermediate test and engineering capability and so on. These results indicated that Zhejiang high-tech enterprises industry-university-institute cooperation required
Q. Zhou, C.-F. Mao, and L. Hou
50
Table 1. The Influent Factors of Enterprises Achieving Technology from Universities and Research institutes % Lack of information on technology The
high
fee
of
technology transfer Not mature of technology Unclear
of
technology
ownership
Very small (1)
Smaller (2)
General (3)
More Very large mean large (4) (5)
5.95
15.86
40.17
26.49
11.53
3.22
5.41
13.33
34.41
33.15
13.70
3.36
3.78
9.55
27.57
36.58
22.52
3.65
12.79
18.56
32.25
22.16
14.24
3.06
5.59
13.87
29.55
31.35
19.64
3.46
6.30
13.15
28.65
33.16
18.74
3.45
19.46
25.59
37.66
13.33
3.96
3.58
7.75
16.76
30.63
30.63
14.23
3.29
No advantage compared to
similar
foreign
technology Unclear
of
technology
application prospect Not
strong
of
intermediary services Lack of intermediate test and
engineering
capability
government policy efficient utilization, which can guide cooperation among enterprises, universities and research institutes to improve R&D performance. As can be seen from Table 2, high-tech enterprises of ZheJiang government had very high expectations of countermeasures from government policy to promote industry-university-institute cooperation. Many enterprises hoped that government should establish an information service platform to strengthen exchanges and cooperation, establish fixed department responsible for technology transfer, encouragement to establish R&D consortium, and so on. The enterprises had strong expectation of more than 4 points value, indicated that ZheJiang high-tech enterprises hoped government can play an effective role in information communication, and could become information bridge of industry-university-institute cooperation. Therefore, government should develop effective guide and support mechanism for Zhejiang high-tech enterprises industry-university-institute cooperation. Firstly, government should promote the information service system vigorously. Because information was important resource for technical innovation, especially technology and information market information, government needed to provide perfect kinds of information, such as cooperative information of potential members, patent information, and build information database, etc. Government should ensure all information was authoritative, authenticities and efficient sources.
Problems and Countermeasures of Zhejiang High-Tech Enterprises
51
Secondly, government should urge enterprises to enhance level of industry-university-institute cooperation. Government should highlight enterprises as dominant part in industry-university-institute cooperation, promote innovative elements accumulate for enterprises innovation. Let enterprises play important role as main body to R&D invest, benefit from R&D investment and take a risk. Government should promote enterprises to become not only main body of innovation, but also the accumulation of innovation resources, fund, technology and talents. Table 2. The expectation of countermeasures from government policy
% Establish information service platform Establish fixed department responsible for technology transfer Encouragement to establish R&D consortium Establish database of intellectual property Incubating technology enterprises through intermediary Improving regulations and laws Government’s direct participation
Very small (1)
Smaller General (3)
More large (4)
Very large (5)
mean
(2)
1.08
5.42
14.80
44.04
34.66
4.06
1.80
10.99
31.35
38.56
17.30
3.59
0.54
3.24
18.02
42.34
35.86
4.10
1.62
5.41
26.49
43.78
22.70
3.81
4.32
16.40
41.80
26.31
11.17
3.24
1.44
7.75
28.11
37.84
24.86
3.77
6.49
13.33
33.15
33.51
13.52
3.34
Thirdly, government should play important role in constructing and improving technical intermediary service organization system. In the condition of market economy, science and technology intermediary service institutions was a bridge of knowledge and technology’s flow, diffusion and transfer, a service link of technology and application, production and consumption, and a clear sign of high-tech achievements transfer to practical productive forces, reflecting the level of technical innovation. In course of practice, government needed to urge intermediary service organization to develop long-term plan, establish modern science and technology intermediary network services platform, create actively market demand for technology intermediary, and energetically talent science and technology agency personnel, improve overall quality of team. Finally, government should build better external environment of industryuniversity-institute cooperation. Government needed to further change the functions, and carry out some measures to promote the combination of science and technology transformation and innovation. Through government investment and tax incentives, government induced and encouraged transformation of science and technology,
52
Q. Zhou, C.-F. Mao, and L. Hou
advocated for political combination of industry-University-Institute, coordinate relative government departments to play role. At the same time, government also needed to improve policies, regulations to guide participants to establish risk investment mechanism, which should ensure that all participants could get fair investment income.
4 Conclusion Zhejiang high-tech enterprises industry-university-institute cooperation has achieved some achievements, but still remained some questions, such as low cooperative level, single distribution, weak secondary R&D ability, obvious risk and so on, etc. This paper summarized and analyzed these issues through empirical test, and offered some policy suggestions for government to improve Zhejiang high-tech enterprises industry-university-institute cooperation, which included promoting the information service system vigorously, urging enterprises to enhance level of cooperation, playing important role to construct and improve technical intermediary service organization system, building better external environment of industry-university-institute cooperation, and so on.
Acknowledgement The authors would like to thank NSFC, China, for funding the project coded 70903020 and 71010107007. And we also would like to thank science research project supported by Science and technology Department of Zhejiang Province, for funding the project coded GK090903005.
References 1. 2.
3. 4. 5.
Cohen, Nelson, Walsw: Links and Impacts: the Influence of Public Research on Industrial R&D. Management Science 48, 1–23 (2002) Monjon, Waelbroeck: Assessing Spillovers from Universities to Firms: Evidence from French Firm-level Data. International Journal of Industrial Organization 21, 1255–1270 (2003) Zhong W.-j., Mei S.-e., Xie Y.-y.: Analysis of Technical Innovation Modes for the Industry-university-institute cooperation. China Soft Science 8, 174–181 (2009) Mao J.-q., Liu L.: Problems& Development Measures in Combination of Industry, Study& Research in China. Theory and Practice of Education 29, 23–25 (2009) Chiesa, Coughlan, Voss: Development of a Technical Innovation Audit. Journal of Production Innovation Management 13, 105–136 (1996)
Research on Puncture Area Calibration of Image Navigation for Radio Frequency Ablation Robot Peng Wang1, Wei Cao2, Wenhao Jiang1, Jinglei Xin1, Shaochen Kang1, and Xin Li1 1
School of Mechanical & Power Engineering, Harbin University of Science and Technology, Xuefu road. 52, 150080 Harbin, People’s Republic of China 2 Department of Cardiovascular Disease, The Second Affiliated Hospital of Harbin Medical University, Xuefu road. 246, 150081 Harbin, People’s Republic of China
[email protected],
[email protected]
Abstract. Aiming at puncture image characteristic of robot auxiliary radio frequency ablation, a modified tradition camera calibration method is proposed in this paper. Based on the comprehensive analysis for puncture image distortion characteristic, there are three geometric distortions in the puncture image system: radial distortion, centrifugal distortion and thin lens distortion, we research the distortions and establish the correction matrixes one by one, and then establish the camera mathematical model under the puncture condition, complete the coordinate systems’ conversion calculation to obtain the camera internal and external parameters, finally to get the puncture system calibration polynomial. Through the comparative experiment that takes the area as parameter, we get that the puncture system calibration method after image correction can meet the accuracy requirement in actually. Keywords: Puncture image, Vision system calibration, Image distortion, Vision-guided robot.
1 Introduction The radio frequency ablation is an interventional operation which releases radio frequency current at some part of intracardiac with electrode catheter to make local endocardium and subendocardial myocardium coagulation necrosis to destroy some original points of rapid arrhythmia. The eradication rate of this operation for paroxysmal supraventricular premature tachycardia is above 90 , so it has been the important method and effective means to treat atrial fibrillation in department of cardiology. The puncture and implantation of ablation electrode catheter are the long time operations under the radiation of X-ray, and the ray harms doctors seriously, so it’s necessary to research how to use image navigation robot to do the operations instead. The primary problem for reaching the surgery accuracy requirement is how to calibrate the surgery system. During the calibration process, the mathematical model is often used to describe the camera it describes the process from scene projection and image. The pin-hole model is a common ideal state model, from the physics, the
%
,
R. Chen (Ed.): ICICIS 2011, Part II, CCIS 135, pp. 53–58, 2011. © Springer-Verlag Berlin Heidelberg 2011
54
P. Wang et al.
image point is the intersection point of the image plane and the line connecting between the optical center and the object point, its best advantage is the concisely, practically and accurately linear imaging relationship. Simulating the camera imaging process linearly with the pin-hole imaging is a kind of approximation for the camera applied in the actual, while the obtained puncture image has the seriously geometric distortion, all the geometric distortions will change the image point position in the scene, so they must be compensated. The lens distortion coefficient, which reflects the distortion effect, is brought in the ideal pin-hole perspective model in this paper.
2 Puncture Image Distortion Corrections The radial distortion is caused by the lens shape which can’t meet the theory requirement, when the radial distortion is existing, the image point shifts towards the radial compared with ideal position, while the straight line, which crosses the optical axis in the image plane, only has variation on length. The common mathematical model of radial distortion is shown as:
δ r = k1r 3 + k2 r 5 + k3r 7 + k4 r 9 + ⋅ ⋅ ⋅ Where
δ r is
(1)
the nonlinearity distortion at the image point whose polar coordinate
is (r , ϕ ) , r is the radial distance between the image center and the pixel point and k1 , k2 , k3 , k4 ,⋅ ⋅ ⋅ is distortion coefficient.
During the radial distortion correction, we find that the complicated distortion model not only fails to enhance the measurement accuracy, it appears to make the numerical calculation instability. Its accuracy contribution rate is less than the disturbance for the correction beginning from the third term of the polynomial, so only the first two terms are adopted in this paper, and the finally radial distortion correction model is shown as:
( (
⎧ xr = xd 1 + k1r 2 + k 2 r 4 ⎨ 2 4 ⎩ yr = yd 1 + k1r + k 2 r
) )
(2)
Actually, the varying degrees eccentricity necessarily exists, namely all the optical centers of the lens can’t be strictly collinear. This defect causes the so-called centrifugal distortion, which makes the image characteristic parameter instable. The simplified distortion components on x axis and y axis are:
⎡δ x ⎤ ⎡sin ϕ cos ϕ ⎤ ⎡δ r ⎤ ⎢δ ⎥ = ⎢ ⎥⎢ ⎥ ⎣ y ⎦ ⎣cos ϕ − sin ϕ ⎦ ⎣δ t ⎦ Where
δ r and δ t
(3)
are the distortional components at the radial and the tangential
respectively, m1 and m 2 are the constant coefficients, r is the radial distance between the image center and the pixel point, ϕ is the angle between the radial line, where the
Research on Puncture Area Calibration of Image Navigation
55
y axis positive direction, while ϕ 0 is the angle between the radial line at the maximum tangential distortion and y axis positive direction. Only image point locates, and
the first two order distortions are taken, so from the formula (3) we can get:
( (
) )
⎧ xt = m1 3 x 2 + y 2 + 2m2 xy ⎨ 2 2 ⎩ yt = m2 x + 3 y + 2m1 xy
(4)
With the consideration of thin lens distortion, the nonlinearity distortions mentioned above exist in the puncture images taken by the optical lens; the nonlinearity distortion is the superposition of the three distortions, so the total distortion is:
( (
) )
( (
) )
⎧ Δx = xd 1 + k1r 2 + k 2r 4 + m1 3x 2 + y 2 + 2m2 xy + n1r 2 ⎨ 2 4 2 2 2 ⎩Δy = yd 1 + k1r + k 2 r + m2 x + 3 y + 2m1 xy + n2 r
(5)
3 The Puncture Camera Parameters Calibration The work model of radio frequency ablation robot is shown as Fig.1. Its model schematic diagram is shown as Fig.2. The operation accuracy is directly influenced by the system coordinate calibration and conversion, there are 6 coordinates can be built in the system: word coordinate, camera coordinate, image coordinate, pixel coordinate, robot coordinate and patient coordinate. The conversion from the puncture point to the image coordinate needs 4 matrixes. According to the basic system working principle, the movement locus of surgical robot is determined by the target point correctly calibrated and mapped in each coordinate.
Fig. 1. The work station of radio frequency ablation robot
56
P. Wang et al.
Fig. 2. Puncture camera based on correction
OC ⋅ X CYC Z C is camera coordinate , the origin OC is the optic center of the camera, Z C axis coincides with optical axis, o ⋅ xy image physics coordinate, the origin o is the intersection point of optical axis and image plane, the x and y parallel with X C and YC ; O ⋅ uv is pixel coordinate, the position of point P in world coordinate is ( X W , YW , ZW ) , (u , v ) is actual image coordinate position of imaging point p, whose unit is pixel. The focal distance f is the distance from image plane to the optical center. Through perspective projection, the geometrical relationship of the imaging position p is defined as below:
xu = f × ( X c / Z c ) , Where
yu = f × (Yc / Z c )
(6)
( X C ,YC , Z C ) is the position of P in camera coordinate, (xu , yu ) is the ideal
pin-hole camera model; the unit of p in physics image coordinate is
mm .because
(u , v ) shows the line number and the column number of the pixel locates in digital
image array without any physical units, o ⋅ xy whose unit is built. The relationship between two coordinates depends on the size and the shape of the pixel, in addition to the pixel position in the technical grade camera. In the two coordinates, any pixel in the image has the relationship as below:
⎡u ⎤ ⎡ f u ⎢v ⎥ = ⎢ 0 ⎢ ⎥ ⎢ ⎢⎣1 ⎥⎦ ⎢⎣ 0
s fv 0
u0 ⎤ ⎡ X c / Z c ⎤ v0 ⎥⎥ ⎢⎢ Yc / Z c ⎥⎥ 1 ⎥⎦ ⎢⎣ 1 ⎥⎦
(7)
f u = f × s x , f v = f × s y , f u is the scale factor at u axis, f v is the scale factor at v axis. s is defined as the comprehensive distortion factor, when the pixel is a rectangle, a = 0, s = 0 or else s ≠ 0 . The conversion between the patient coordinate and the Where
world coordinate can be done by translation and rotation, and the camera can be placed at any position. Where R and T are rotation transformation and translation transformation, it shows the relationship between the camera coordinate and the patient coordinate. A group of error equations can be listed with a certain amount of control points in the image coordinate and the reference coordinate and the coefficients in the
Research on Puncture Area Calibration of Image Navigation
57
polynomial can be obtained with the least square method, so get the polynomial shown as below:
⎧ x = cos ϕX + k1r 2 X + sin ϕY + 3 sin ϕm1 X 2 + sin ϕn1r 2 + sin ϕ cos ϕ ⎨ 2 2 2 ⎩ y = sin ϕY + k1r Y + cos ϕX + 3 cos ϕm2Y + cos ϕn1r + sin ϕ cos ϕ
(8)
4 Calibration Experiment and Result Assessment Though the projection model based on comprehensive distortion correction, the calculative image eigenvalue after calibration is more accurate. The mainly thought is that fix the calibration block on the worktable, the calibration data of noncoplanar calibration point can be obtained with the accurate moving at the horizontal and the vertical. Analyzing whether the distortion correction has influence on measurement accuracy after calibration, the specific compare steps are: 1. Set the standard reference. The puncture region sign is a circle, so many circular coins are adopted in the experiment 2. Measure the area of the standard reference.The measuring result of non-corrected image is shown as Fig.3; the measuring result of our calibration is shown as Fig.4.
Fig. 3. The area measurement result of distortional image
Fig. 4. The area measurement result of correction image
58
P. Wang et al.
From the two figures above, we get that, the originally crooked side boundary is eliminated after correcting the distortion image; with the area as parameter, the measured area data has variation during the correction and the measured area after correcting reaches the real value better. So imaging system correction should be done to ensure the puncture accuracy.
5 Conclusions In this paper an image navigation puncture region calibration method is proposed, it is realized with a comprehensive distortion correction projection model, and we test the method with the experiments. The result shows that, this method is simple and effective, what’s more, it can enhance the location accuracy of the puncture point, so it lays a foundation for realizing auxiliary radio frequency ablation surgical robot accurately control the patient pose and enhances the safety of the participation, and meanwhile this method solves the radiation problem when the doctors directly operate in the X-ray. The robot coordinate system will be further researched to effectively realize the puncture point fast positioning. Acknowledgments. This work is supported by post-doctoral Foundation of Heilongjiang Province(LBH-Z09212).
References 1. 2. 3. 4.
Fei, B.: The safety issues of medical robotics. Reliability Engineering and System Safety 73, 183–192 (2001) Zhang, Z.: Camera calibration with dimensional objects. IEEE Transactions on Pattern Analysis and Machine Intelligence 26(7), 892–899 (2004) Machacek, M.: Two-step calibration of a stereo camera system for Measurements in large volumes. Measurement Science and Teehnology 14, 1631–1639 (2003) Devernay, F.: Automatic calibration and removal of distortion from scenes of structured environments. Machine Vision and Application 13, 14–24 (2001)
Low Power and Robust Domino Circuit with Process Variations Tolerance for High Speed Digital Signal Processing Jinhui Wang, Xiaohong Peng, Xinxin Li, Ligang Hou, and Wuchen Wu VLSI & System Lab, Beijing University of Technology, Beijing 100124, China
[email protected] Abstract. Utilizing the sleep switch transistor technique and dual threshold voltage technique, a source following evaluation gate (SEFG) based domino circuit is presented in this paper for simultaneously suppressing the leakage current and enhancing noise immunity. Simulation results show that the leakage current of the proposed design can be reduced by 43%, 62%, and 67% while improving 19.7%, 3.4 %, and 12.5% noise margin as compared to standard low threshold voltage circuit, standard dual threshold voltage circuit, and SEFG structure, respectively. Also, the inputs and clock signals combination static state dependent leakage current characteristic is analyzed and the minimum leakage states of different domino AND gates are obtained. At last, the leakage power characteristic under process variations is discussed. Keywords: Domino circuits, SEFG, power, noise margin.
1 Introduction Domino circuits are commonly employed in register, cache, and high performance microprocessors [1]. As technology scales down, the supply voltage must be reduced to keep the dynamic power within acceptable levels [2]. However, to meet the performance requirements, the threshold voltage (Vt) and gate oxide thickness (tox) of the transistors must be reduced to accompany the supply voltage scaling down, which leads to exponential growth of the sub-threshold leakage (Isub) and the gate leakage (Igate) [3]. Especially, for domino circuits, the excess leakage current also degrades the noise immunity. This further highlights the importance of leakage current reduction. There has been lots of relative work on leakage reduction in domino circuits, such as dual Vt technique [4], sleep transistor technique [5], P-type domino circuit [6], source following evaluation gate (SEFG) [7], and so on. However, each technique could not separately solve the leakage and robustness problem completely. Therefore, in this paper, a novel domino design using several techniques is proposed for simultaneously suppressing the leakage current and enhancing noise immunity.
2 Proposed Circuits As described in Section 1, the excess leakage current has become an important issue to threaten the performance of domino circuit [2]. Dual Vt technique is an effective R. Chen (Ed.): ICICIS 2011, Part II, CCIS 135, pp. 59–65, 2011. © Springer-Verlag Berlin Heidelberg 2011
60
J. Wang et al.
technique to reduce Isub by using low Vt and high Vt transistors on the timing critical paths and non-critical paths, respectively. Utilizing this technique, gating all the initial inputs of the domino gates into a low Isub state is required. But dual Vt domino circuits do not take the effect of the Igate into account and therefore it could not minimize the total leakage current. To reduce Igate, P-type domino circuit adopting low leakage PMOS transistors instead of high leakage NMOS transistors in input network and sleep transistor technique based on adding current switch in sleep state are proposed [5], [6]. What’s more, to improve the robustness of the circuits, Kim proposed SEFG (Source Following Evaluation Gate) structure [7]. In SEFG, the output of source follower is limited by the gate input voltage and does not depend on the width of discharging path even if noise input lasts for a long time, as shown in Fig. 1 (b) and (c). In this paper, the SEFG structure, the dual Vt technique, and the sleep transistor are employed in P-type domino gate, as shown in Fig. 1 (d). When the gate works, sleep transistor is turned on. In the pre-discharge phase, clock is set high. Dynamic node is discharged to ground. Evaluation phase begins when the clock signal is set low. Provided that the necessary input combination to charge the evaluation node is applied, the circuit evaluates and the dynamic node is charged to Vdd, otherwise, preserving until the following pre-discharge phase. When the gate sleeps, sleep transistor is cut-off to lower the leakage current. Thus, compared to other existing domino circuits, the proposed circuit could realize low power and high noise immunity design with a little active power penalty. Vdd Vdd
Vout + Vgs Gnd
Ileak Gnd
+ Vgs Gnd
Vdd Low-Vt device
Vdd
High-Vt device sleep
Ileak Vout
int1
int2 Dynamic node
clk Gnd
P-keep
int1 Out
N-keep
int2 Dynamic node
clk
P-keep Out N-keep
Gnd
Fig. 1. (a) Common Source (b) Source Following (c) SEFG structure (d) Proposed design
3 Simulation Results The analysis in this paper is based on H-spice tool and 45 nm BSIM4 models [8]. The device parameters are listed in Table 1. To evaluate the performance of the proposed design, the following four two-input AND domino gates are simulated: the standard low Vt domino gate (s_Low), the standard dual Vt domino gate (s_dual), the SEFG gate, and the proposed design. Each domino gate drives a capacitive load of 8 fF. All AND gates are turned to operate at 1 GHz clock frequency. To achieve a reasonable comparison, all of the circuits are sized to have the similar delay. The delay is calculated from 50% of signal swing applied at the inputs to 50% of signal swing observed at the output. The leakage current, active power, noise immunity of these gates are simulated and compared. To analyze leakage current, two typical sleep temperatures are considered:
Low Power and Robust Domino Circuit with Process Variations Tolerance
61
(1) 110oC which is assumed that the sleep mode is short and the temperature keeps 110oC during the short sleep period; (2) 25oC which is assumed that the sleep period is long and the sleep temperature has fallen to the room temperature. While considering the noise immunity, the same noise signal is coupled to all of the AND gates, so this situation represents the worst case noise condition. In order to quantify the noise margins, the noise signal is assumed to be a 2.5 GHz square wave with 87.5% duty cycle. The maximum tolerable noise amplitude is defined as the signal amplitude at the inputs which induced a 10%-Vdd rising/falling in the voltage at the output of the AND gate.
(a)
(b)
Fig. 2. (a) Comparison of the active power and the noise immunity of four gates (b) Comparison of leakage current of four gates
Table 1. Parameters of devices The Vt value of four different devices High Vt NMOS High Vt NMOS Low Vt NMOS Low Vt NMOS 0.35V -0.35V 0.22V -0.22V Process: 45nm Working Temperature: 110oC.
Table 2. Normalized Leakage Current of the Devices NMOS Transistor PMOS Transistor Low-Vt High-Vt Low-Vt High-Vt 34.9 2.7 22.8 1.09 Ileak(Isub,Igate) [ 110 oC] (33.3,1.6) (1.2,1.5) (22.7,0.09) (1,0.09) Igate [110 oC] 4.7 3.5 0.1 0.1 126.2 60.4 56.3 4.4 Ileak(Isub,Igate) [25 oC] (66.5,59.6) (0.8,59.6) (52.8,3.4) (1,3.4) Igate [25 oC] 159.1 124.0 5.3 5.3 Currents are normalized to the gate leakage current produced by PMOS Transistor in Ileak state. Transistor width=1μm, length=45 nm. |Low-Vt|=0.22V. |High-Vt|=0.35V. Vdd=0.8V. Igate: |Vgs|=|Vgd|=|Vgb|=Vdd. Ileak: Vgs=0 and |Vds|=Vdd.
62
J. Wang et al.
Table 3. Leakage current of four gates in the different input vector and clock states at 25 oC and 110 oC (A) Input vector and clock state (25 oC) Input vector and clock state (110oC) CLIH CHIH CLIL CHIL CLIH CHIH CLIL CHIL Proposed 6.02e-8 6.23e-8 1.76e-7 1.39e-7 2.94e-7 9.37e-7 3.17e-7 1.55e-6 SEFG 1.86e-7 2.14e-7 1.97e-7 2.49e-7 5.32e-5 1.05e-6 1.45e-6 1.61e-6 s_Low 1.84e-7 1.66e-7 1.59e-7 2.01e-7 2.07e-6 6.62e-7 1.21e-6 1.27e-6 s_Dual 1.81e-7 1.44e-7 1.07e-7 1.79e-7 1.57e-7 6.59e-7 1.67e-7 1.27e-6 CLIH (clock=low, inputs=high), CHIH (clock=high, inputs=high). CLIL (clock=low, inputs=low), CHIL (clock=high, inputs=low).
Fig. 2(A) shows the normalized active power and noise immunity of four different domino gates. It shows that the noise margin of the proposed circuit is 19.7%, 3.4%, and 12.5% higher than that of the low Vt domino circuit, the dual Vt domino circuit, and the SEFG structure, respectively. This results from to the additional P-keeper transistor in the proposed circuit. Though this P-keeper is only half size of the transistor in the pull-up network, it improves the noise immunity effectively. As also shown in Fig. 2(A), the active power of the proposed design is increased by 45.8% as compared to standard dual Vt domino circuit. As discussed in Section 2, the proposed circuit has more transistors, thereby consuming more active power. Also, in order to achieve the same delay time, the size of the sleep transistor and PMOS transistor in the inverter must be increased, which leads to more active power in proposed design. However, the proposed circuit shows better leakage characteristics and noise immunity than other circuits including SEFG structure. Table 3 lists the leakage current of four gates in different input vectors and clock states at typical sleep temperatures. It can be observed that the leakage current characteristic depends strongly upon both of input vector and clock states. Therefore, to obtain the minimum leakage state which can be used to optimize the leakage current, a detailed analysis is required. On the one hand, when the sleep temperature is 25 oC, the minimum leakage states of all AND gates share one common character: the clock signal is low. This is can be explained as followed. When clock signal is low, low-Vt clock PMOS transistor is turned on and produces the total leakage current is 5.3, as shown in Table 2; lowVt/high-Vt clock NMOS transistor is turned off and produces the total leakage current is 126.2/60.4. When clock signal is high, low-Vt clock PMOS transistor is turned off and produce the total leakage current is 56.3; low-Vt/high-Vt clock NMOS transistor is turned on and produce the total leakage current is 159.1/124. Therefore, the low clock signal decreases total leakage current, as can be seen in Table 3. The leakage current of standard domino circuit at 25oC is minimized when inputs are low, as shown in Table 3. When the inputs are high, the PMOS transistors connected to inputs (input-PMOS) are turned off and produce both Isub and Igate (totally 56.3). But with low inputs, these PMOS transistors only produce Igate (only 5.3). Thus, low inputs minimize the total leakage current. However, in the SEFG structure and the proposed design, there are several additional transistors including the P-keeper and sleep transistor. Low inputs would turn on input-PMOS, which would result in the conduction of these additional transistors. Then the current loop is formed and stack effect [9] is vanished, thereby increasing the leakage current significantly. Thus, high input signals to input-PMOS could achieve minimum leakage current in both the SEFG structure and the proposed design.
Low Power and Robust Domino Circuit with Process Variations Tolerance
63
On the other hand, when the temperature is 110 oC, high inputs would minimize leakage current. This is because Isub increases exponentially as temperature increases, due to the reduction of Vt and increasing of the thermal voltage. But Igate, unlike Isub, has a very weak dependence on temperature. Therefore, at 110 oC, Isub makes a larger contribution to the total leakage current than Igate. When the clock input signal is high or low, one of the transistors connected to clock input is non-conduced produce large Isub. To suppress this large Isub, the stack effect is required. The input-PMOS with high signal realizes this important effect. Isub is only produced in turning-off state. In standard dual Vt domino circuit and the proposed design, Isub of high-Vt off-NMOS connected to clock (the values is 1.2) is less than that of low-Vt off-PMOS connected to clock (the values is 22.7). Low clock signal is efficient to suppress Isub. On the contrary, in the standard low-Vt domino circuit and the SEFG structure, Isub of the low-Vt off-NMOS connected to clock (the values is 33.3) is larger than that of low-Vt off-PMOS connected to clock (the values is 22.7). High clock signal is helpful to suppress leakage current, as can be seen in Table 3. From the above analysis, the minimum leakage state at 25 oC of the proposed design and the SEFG structure is CLIH and the minimum leakage state of standard domino circuits is CLIL. Alternatively, the minimum leakage state at 110oC of the proposed design and standard dual Vt domino circuit is CLIH. But in SEFG structure and standard low Vt domino circuits, the leakage is minimum in CHIH state. Fig. 2(B) compares the leakage current of four different gates at their minimum leakage states. It is observed that the leakage current of the proposed design is smallest in four gates due to dual Vt technology and sleep transistor technology. At 25 o C, the leakage current of the proposed design decrease by 43%, 62%, and 67% as compared to standard dual Vt domino circuit, standard dual Vt domino circuit and the SEFG structure. However, Isub increases exponentially with the increasing of temperature. Although the sleep transistor suppresses leakage current efficiently, the leakage current of the proposed design oversteps standard dual Vt domino circuit. But simulation results in Fig. 2(B) indicates that at 110 oC the proposed design decrease leakage current by 55%, and 72% as compared to standard low Vt domino circuit and the SEFG structure. In conclusion, the proposed design has great advantage to decrease leakage power at typical sleep temperatures.
4 Leakage Power Characteristic under Process Variations As the CMOS process advances continually, scaling has resulted in significant increase in the variations of the process parameters, including gate length (Lgate), channel doping concentration (Nch), and gate oxide thickness (tox). All of these process variations have a significant effect on the threshold voltage of the devices, which result in variation of the leakage power. Therefore, in order to evaluate the impact of process variations on leakage power characteristics of different domino circuits, Monte Carlo analysis is applied [10]. In the simulation, Lgate, Nch and tox are all assumed to have normal Gaussian statistical distributions with a three sigma (3σ) fluctuation of 10%. And 1000 Monte Carlo simulations are run.
64
J. Wang et al.
150
55 W
Samples
85 %
Proposed (CLIH) Dual Vt (CLIL)
76 %
200
Proposed (CLIH) Low Vt (CHIH)
180
T=25
100
0.4 W
160
99 %
140 120
89 %
T=11
100 80
50
60 40 20 0
0 0.2
0.4
0.6
0.8
1
1.2
0
1.4
0.2
0.4
1.6
0.6
1.8
0.8
1
1.2
1.4
2
Fig. 3. Leakage power distribution curves of the standard low threshold voltage circuit, the dual threshold voltage circuit, and the proposed circuit under process variations
Fig. 3 shows the leakage power distribution curves of the standard low threshold voltage circuit, the dual threshold voltage circuit, and the proposed circuit, respectively, in two typical temperatures under process variations. And three kinds of circuits are set in the minimum leakage power state (standard low threshold voltage circuit - CHIH, dual threshold voltage circuit - CLIL, proposed circuit - CLIH). It can be seen that the leakage current distribution curves of the dual threshold voltage circuit vs. the proposed circuit cross at 55 nW in 25 oC. 85% of the samples of the proposed circuit are lower than 55 nW and 76% of the samples of the dual threshold voltage circuit are higher than 55 nW. The leakage current distribution curves of the standard low threshold voltage circuit vs. the proposed circuit cross at 0.4 uW in 110 o C. 99% of the samples of the proposed circuit are lower than 0.4 uA and 89% of the samples of the standard low threshold voltage circuit are higher than 0.4 uW. These results indicate that the proposed design is preferable to reduce the leakage current in majority of the samples even under process variations, which is similar result to the analysis of the normal case.
5 Summary In this paper, a novel domino circuit structure is proposed to suppress the leakage current and enhance the noise immunity. Based on the simulation results, input vector and clock state of the gate is discussed to obtain the minimum leakage state. At last, the leakage characteristic under process variations is analyzed.
References 1. Stackhouse, B., et al.: A 65 nm 2-Billion Transistor Quad-Core Itanium Processor. IEEE Journal of Solid-State Circuits 44, 18–31 (2009) 2. Gong, N., et al.: Analysis and Optimization of Leakage Current Characteristics in Sub65nm Dual Vt Footed Domino Circuits. Microelectronics Journal 39, 1149–1155 (2008)
Low Power and Robust Domino Circuit with Process Variations Tolerance
65
3. Wang, J., et al.: Low Power and High Performance Zipper CMOS Domino Full-adder Design in 45nm Technology. Chinese Journal of Electronics 37, 266–271 (2009) 4. Kao, J.T., Chandrakasan, A.P.: Dual-threshold voltage techniques for low-power digital circuits. IEEE Journal of Solid-State Circuits 35, 1009–1018 (2000) 5. Liu, Z., Kursun, V.: IEEE transactions on Circuits and Systems. Leakage Biased PMOS SleepSwitch Dynamic Circuits 53, 1093–1097 (2006) 6. Hamzaoglu, F., Stan, M.R.: Circuit-level techniques to control gate leakage for sub-100nm CMOS Proc. In: Int. Symp. on Low Power Electronics and Design, pp. 60–63. IEEE Press, New York (2002) 7. Kim, J., Roy, K.: A leakage tolerant high fan-in dynamic circuit design technique. In: Solid-State Circuits Conference, ESSCIRC 2001, pp. 309–313. IEEE Press, New York (2001) 8. Predictive Technology Model (PTM), http://www.eas.asu.edu/~ptm 9. Lee, D., et al.: Analysis and Minimization Techniques for Total Leakage Considering Gate Oxide Leakage. In: ACM/IEEE Design Automation Conference, pp. 175–180. IEEE Press, New York (2003) 10. Wang, J., et al.: Monte Carlo Analysis of Low Power Domino Gate under Parameter Fluctuation. Journal of Semiconductors 30, 125010-1–125010-5 (2009)
Detection of Attention-to-Rest Transition from EEG Signals with the Help of Empirical Mode Decomposition Cheng Man Ng and Mang I. Vai Department of Electrical and Electronics Engineering, Faculty of Science and Technology, University of Macau, Macau SAR, China {ma36578,fstmiv}@umac.mo
Abstract. In this paper, an empirical mode decomposition (EMD) scheme is applied to analyze the steady-state visually evoked potentials (SSVEP) in electroencephalogram (EEG). Based on EMD method, the oscillatory activities of the decomposed SSVEP signal are analyzed. It is observed that the 6th IMF showed the features of the attention-to-rest transition response. In other words, high powers are observed instantly after the volunteer turns from an attentively focusing stage into an unfocused attention stage. Having made the point that the 6th IMF of the SSVEP signals corresponds to very low frequency (0.5 – 2 Hz), this drives us to look into that frequency range of the SSVEP signal. All of this reflects that a very low frequency seems to occur during the attention-to-rest transitions. Experiments are performed with different people. The result shows that the attention-to-rest transition can be detected with an accuracy of 82.6%. Keywords: Electroencephalogram (EEG); Empirical Mode Decomposition (EMD); Intrinsic mode functions (IMF); Steady-state visually evoked potentials (SSVEP).
1 Introduction Electroencephalography is the neurophysiologic measurement of the electrical activity of the brain by records from electrodes put on the scalp or the cortex. The resulting traces, namely electroencephalogram (EEG), reflect the electrical activity of a multitude of neural populations in the brain. EEG signal is a complicated nonlinear and non-stationary signal, containing different types of rhythmic waves: alpha wave (8–12 Hz), beta wave (12–30 Hz), delta wave (up to 4 Hz), theta wave (4–8 Hz) [1]. This paper is intended to analyze the SSVEP based BCI system in EEG. SSVEP are signals that are natural responses to visual stimulation at specific frequencies. They are stable responses that can be measured when a person is attentively focusing on a flashing light source with flickering frequency. The database of this paper is obtained from different volunteers who are asked to continuously focus on the flashing lights for every 6 seconds, with 4 seconds of resting time between each 6 seconds of attention. Our concern is to consider the transition point when the volunteer turns from the 6s attention stage into the 4s resting stage. R. Chen (Ed.): ICICIS 2011, Part II, CCIS 135, pp. 66–71, 2011. © Springer-Verlag Berlin Heidelberg 2011
Detection of Attention-to-Rest Transition from EEG Signals with the Help of EMD
67
The obtained SSVEP signals are decomposed into IMF based on the EMD method. EMD has been demonstrated as a method for the data processing of nonlinear and non-stationary signals. From the oscillatory activities of the decomposed SSVEP, it is noticed that the attention-to-rest transitions are obviously shown in the 6th IMF. Due to this observation, we will focus on examining the 6th IMF so as to lead to the detection of the attention-to-rest transitions. As a consequence, this may be used for detecting the idle period of a SSVEP based BCI system.
2 Methodology 2.1 Data Acquisition The signal of the SSVEP based BCI system is obtained from 7 volunteers at the ages of 18–30. Each volunteer was stimulated with a series of flashing lights, corresponding to 20Hz, 15Hz, 10Hz, 8Hz and 7.5Hz, by the use of electrodes PO3, PO4, POz, Oz, O1 and O2. The signals were recorded with a sampling rate of 600Hz. Firstly, the volunteer looked at the flashing light attentively, with the first stimulus frequency of 20Hz for 6s, and then rested for 4s. Secondly, the volunteer looked at the flashing lights at stimulus frequency of 15Hz for the next 6s, and rested for 4s, and so on. The above 5 stimulus frequencies were repeated for 1 time, resulting in a total experiment time of 100s. Signal processing technology is used to obtain the EEG signals. Fig.1 offers a complete set of the original SSVEP-EEG signals. The red areas refer to the time when the volunteer is gazing at the flickering lights of the specified stimulus frequency. Every volunteer repeats the experiment for 6 times. Therefore, the EEG database is composed of a total of 42 full-set signals. 2.2 EMD Application to the SSVEP Signals EMD is applied to decompose the SSVEP signals. In Fig. 2, it denotes 11 IMFs and one residue decomposed from the second channel data (PO4) of the original EEG signal. From the oscillatory activities of the 5th IMF and the 6th IMF, each time after the volunteer gazed at the flickering light and turned into a rest condition, the amplitudes are greatly raised in each transition period. All the experiments show that this transition phenomenon is most obviously shown in the 6th IMF. Fig. 3 depicts the enlargement of the 6th IMF from the corresponding EEG signal. The red dotted lines indicate the locations of 6s, 16s, 26s, 36s, 46s, 56s, 66s, 76s, 86s and 96s. We can see clearly high amplitudes are found at the start of each transition. Therefore, it may be useful to look more closely at some of the more important features of the 6th IMF. The 6th IMF is further analyzed by Fast Fourier Transform (FFT). Fig. 4 denoted the corresponding Fourier Spectrum of the 6th IMF, showing that there is a peak at 1Hz. The frequency contents of the 6th IMF from all the signals in our EEG database are found to be at a very low frequency, between 0.5Hz – 2Hz. In this way, we try to extend this observation into the idea that during the period of attention-to-rest transition, there is a very low frequency occurs in EEG.
68
C.M. Ng and M.I. Vai
Fig. 1. Six channels of the original SSVEP signals
Fig. 2. EMD decomposed signals of channel PO4 of EEG signal with 11 IMFs and residue
Fig. 3. Enlargement of the 6th IMF
Fig. 4. Fourier Spectrum of the 6th IMF
Detection of Attention-to-Rest Transition from EEG Signals with the Help of EMD
69
2.3 Detection of the Attention-to-Rest Transition A finite impulse response (FIR) equiripple band-pass filter (with low frequency at 0.5Hz and high frequency at 2 Hz) is therefore designed and applied to the original EEG signal in order to preserve the frequency content of the 6th IMF. The power spectrum of the filtered EEG signal is performed by an application of window with length 500 ms moving along the signal. The filtered EEG signal is then divided into 10 segments of 10s duration (including 6s of time focusing on the flickering lights and 4s of time resting). The highest power of each 10s duration are found to be located at 6.832s, 17.03s, 26.77s, 36.99, 46.74s, 56.82s, 66.89s, 77.78s, 86.58s and 96.88s. All of them belong to the resting durations, the time is within 0.58s – 1.78s right after the volunteer stop gazing at the flickering lights. Fig. 5 illustrates the power spectrum of the EEG signal after the band-pass filter is applied, in which the highest power locations of each 10s duration are also marked.
Fig. 5. Power Spectrum of the filtered EEG signal
3 Experimental Results 3.1 Accuracy Fig. 6 indicates a better demonstration on the locations of the highest powers for the filtered EEG signal. In this figure, the original SSVEP-EEG signal is shown in blue color, and the green areas are the 6s durations of gazing at the flickering lights, finally the red dotted lines are the occurrences of the highest power found in the filtered EEG signal. As expected, all the highest powers are located in the resting duration and they occur right after the volunteer stop watching the flickering lights. It can be concluded that a very low frequency occurs during the attention-to-rest transition. The same analysis procedures are applied to all the SSVEP signals in the EEG database. Table 1 summarizes the results of the accuracy for detecting the attention-to-rest transition point. The mean accuracy is 82.6%. Accordingly, our method is able to detect the idle period of the SSVEP based BCI system.
70
C.M. Ng and M.I. Vai
Fig. 6. Original EEG signal with (i) green areas are the time of watching flickering lights. (ii) the red lines are the occurrences of the highest power from the filtered EEG signal. Table 1. Accuracy of detecting the attention-to-rest transition on all volunteers Volunteers Trial 1 Trial 2 Trial 3 Trial 4 Trial 5 Trial 6 Accuracy
1
2
3
4
5
6
7
90% 80% 100% 90% 90% 100% 91.67%
90% 70% 70% 70% 90% 80% 78.33%
100% 70% 90% 80% 70% 80% 81.67%
80% 70% 80% 80% 70% 70% 75.00%
90% 80% 100% 100% 100% 100% 95.00%
70% 70% 70% 100% 60% 70% 73.33%
90% 80% 80% 90% 80% 80% 83.33%
3.2 Evoked Delta Waves The experimental results lead to the conclusion that a very low frequency occurs at the transition point of the idle period. Since this frequency band (less than 2Hz) belongs to the delta waves, it is reasonable to suppose that the attention-to-rest transition might be related to an increase in delta EEG activity. Delta activity has been found during some continuous attention task [1]. An increase in delta power has been reported in different types of mental tasks [2], it is neither due to the ocular movements nor to any other artifact. Research has been devoted that an increase in delta EEG activity may be related to attention to internal processing during the performance of a mental task [2]. Delta power will be increased in conditions such as attention, activation of working memory, letter identification etc [3][4]. It is pointed out in some Go/No-Go analysis, which are studied with event-related potentials (ERP), that there is a power increase at 1 Hz in both Go and No-Go conditions. The increase in delta activities during the No-Go conditions is related to the inhibition of non-relevant stimuli (Harmony et at., 1996), signal matching and decision making (Basar-Eroglu et at., 1992) [3]. On the other hand, delta power will become high during target relative to non-target processing, namely, in relation to the rest condition [5].
Detection of Attention-to-Rest Transition from EEG Signals with the Help of EMD
71
4 Discussion In this paper, we begin with the analysis of the SSVEP based BCI system by the EMD method. The transition response is found in the 6th IMF of the SSVEP signals. Therefore, a band-pass filter (0.5 – 2Hz) is used to preserve only the very low frequency of the original SSVEP signals. Consequently, the phenomenon of the occurrence of very low frequency during the attention-to-rest transition is demonstrated. This phenomenon is examined with different SSVEP signals obtained from different person. As a result, the attention-to-rest transitions are being successfully detected and the mean accuracy is found to be 82.6%. This result leads to the conclusion that during the attention-to-rest transition, a very low frequency occurs which means that delta waves are being evoked. To put it the other way round, when the volunteer turns from an attentively focusing stage to an unfocused attention stage, there is an increase in delta EEG activity. This phenomenon may be related to the inhibition of non-relevant stimuli, signal matching and in a state of non-target processing [3]. As a consequence, our method is able to detect the idle period of the SSVEP based BCI system.
5 Conclusion EMD method offers a powerful tool for analyzing nonlinear and non-stationary signal such as EEG. It offers the key to understand the components of the SSVEP signals, in which the attention-to-rest transition is able to be detected by means of the features of the chosen IMF. The most likely explanation is that the attention-to-rest transition is accompanied by the occurrence of delta activities. Since there is room for further improvement on the detection accuracy, we will further analyze the behavior of the EMD method, as well as the IMFs.
References 1. 2.
3.
4. 5.
Wikipedia, http://en.wikipedia.org/wiki/Electroencephalography Harmony, T., Fernández, T., Silva, J., Bernal, J., Díaz-Comas, L., Reyes, A., Marosi, E., Rodríguez, M., Rodríguez, M.: EEG Delta Activity: An Indicator of Attention to Internal Processing during Performance of Mental Tasks. International Journal of Psychophysiology 24(1-2), 161–171 (1996) Harmony, T., Alba, A., Marroquín, J.L., González-Frankenberger, B.: Time-FrequencyTopographic Analysis of Induced Power and Synchrony of EEG Signals during a Go/NoGo Task. International Journal of Psychophysiology 71(1), 9–16 (2009) Schroeder, C.E., Laktos, P.: Low-Frequency Neuronal Oscillations as Instruments of Sensory Selection. Trends in Neurosciences 32(1), 9–18 (2009) Doege, K., Bates, A.T., White, T.P., Das, D., Boks, M.P., Liddle, P.F.: Reduced EventRelated Low Frequency EEG Activity in Schizophrenia during an Auditory Oddball Task. Psychophysiology 46(3), 566–577 (2009)
A Traffic Information Estimation Model Using Periodic Location Update Events from Cellular Network Bon-Yeh Lin1,2, Chi-Hua Chen1, and Chi-Chun Lo1 1
Institute of Information Management, National Chiao-Tung University, 1001, University Road, Hsinchu, Taiwan 300, ROC 2 Telecommunication Laboratories, Chunghwa Telecom Co., Ltd, 12, Lane 551, Min-Tsu Road Sec. 5, Yang-Mei, Taoyuan, Taiwan 326, ROC
[email protected],
[email protected],
[email protected]
Abstract. In recent years considerable concerns have arisen over building Intelligent Transportation System (ITS) which focuses on efficiently managing the road network. One of the important purposes of ITS is to improve the usability of transportation resources so as extend the durability of vehicle, reduce the fuel consumption and transportation times. Before this goal can be achieved, it is vital to obtain correct and real-time traffic information, so that traffic information services can be provided in a timely and effective manner. Using Mobile Stations (MS) as probe to tracking the vehicle movement is a low cost and immediately solution to obtain the real-time traffic information. In this paper, we propose a model to analyze the relation between the amount of Periodic Location Update (PLU) events and traffic density. Finally, the numerical analysis shows that this model is feasible to estimate the traffic density. Keywords: Periodic Location Update, Intelligent Transportation System, Cellular Network, Traffic Density Estimation.
1 Introduction In recent years considerable concerns have arisen over building Intelligent Transportation System (ITS) which focuses on efficiently managing the road network. One of the important purposes of ITS is to improve the performance of transportation so as extend the durability of vehicle which can be reduced the fuel consumption and travel time. Before this goal can be achieved, it is to obtain the correct and real-time traffic information which includes traffic density, traffic flow, speed, travel time, traffic conditions, and traffic accidents so that traffic information services can be provided in a timely and effective manner. At present, the methods of collecting real-time traffic information can be classified into three categories as follows. (1). Stationary traffic information detectors [1] (2). Global Position System (GPS)-based probe car reporting [2] (3). Tracking the location of mobile users through the cellular network [3-9] R. Chen (Ed.): ICICIS 2011, Part II, CCIS 135, pp. 72–77, 2011. © Springer-Verlag Berlin Heidelberg 2011
A Traffic Information Estimation Model Using PLU Events from Cellular Network
73
By far the most intuitive way is to set up the stationary traffic information detectors on important road segments to gather the information, but this way need excessive setup and maintenance costs [1]. In addition, several researches using GPS-based cars as probes. But the sample size of GPS-based probe cars needs to be high enough to infer the traffic information accurately [2]. Additional costs are incurred when these GPS-based probe cars periodically report the traffic information through the air. To reduce the aforementioned building and maintenance costs, cost-effective and immediately alternatives need to be found. As we can see nearly everyone has his own Mobile Stations (MS), it would seem advisable to collect traffic information by using MS as a probe [3-9]. Cellular network has rigorous management processes to keep track of the movement of MSs. There are events triggered by mobility management for cellular network such as Location Update (LU). By grouping neighboring cells, Location Areas (LA) can be defined to describe high level locations of MSs. When a MS moves from a LA to another LA, a Normal LU (NLU) event is triggered to inform the cellular network the MS’s latest LA information. Besides, a Periodic LU (PLU) event is triggered to update the MS’s LA information periodically if the NLU event hasn’t been triggered in a period of time. Through the PLU and NLU process, the network always knows the current cell and LA of a MS. Therefore, the amount of PLU events is related with the density of MSs in specific cell. For this reasoning, analyzing the occurred time and related information of these mobility management events can infer the real-time traffic information. In this paper, we propose a model to analyze the relation between the amount of PLU events and traffic density information. We also derive a specific formula to describe this relation and provide a numeric analysis of it. The remainder of the paper is as follows. In Section 2, we propose the analytical model and the derived formula. The numeric analysis is provided in section 3. Finally, conclusions are given in Section 4.
2 A Traffic Information Estimation Model When considering the probability of a PLU event in a specific cell, we have to take the following two scenarios: (1). There is no call between two consecutive PLU events. (2). There are several calls between two consecutive PLU events. Finally, we consider and sum up the two scenarios about the probability of PLU event in a specific cell for traffic density estimation. 2.1 Scenario (1): No Call between Two Consecutive PLU Events Figure. 1 shows the space diagram for scenario (1). There is a car within a MS moves along the road. The first PLU event is triggered at time t0, and then the car enters the cell at time t1. The second PLU event is triggered at time t2, and then the car leaves the cell at time t3. The timing diagram is illustrated in Figure. 2. The following assumptions and parameters in the model are defined below. • There is only one road residing in the cell. • c (hr): The cycle time of the PLU.
74
B.-Y. Lin, C.-H. Chen, and C.-C. Lo
• x (hr): The time difference between the first PLU event and entering the cell. We assume the time function f(x) is an uniform distribution function as f(x) = 1/c. • d (km): The length of road segment covered by a cell. • v (km/hr): The average speed of a car crossing a cell. In this scenario, the probability of PLU triggered in the cell is as formula (1). d ⎛ ⎞ Pr( Scenario 1) = Pr ⎜ x + > c ⎟ v ⎝ ⎠ =
∫
c
c−
d v
f ( x ) dx = ∫
c
c−
d v
(1)
1 d dx = vc c
Cell
Road
1st Location Update enter Cell at t1 at t0
2nd Location Update at t2
leave Cell at t3
Fig. 1. The scenario diagram for vehicle movement and PLU events on the road when there is no call between two consecutive PLU events 1st Location Update
2nd Location Update c
enter Cell x t0
leave Cell d/v
t1
t2
t3
Fig. 2. The time diagram for vehicle movement and PLU events on the road when there is no call between two consecutive PLU events
2.2 Scenario (2): Several Calls between Two Consecutive PLU Events The first PLU event is triggered at time t0. There is a call arrived at time t1, and then the car enters the cell at time t2. The second PLU event is triggered at time t3, and then the car leaves the cell at time t4. After that, a second call arrives at time t5. The space diagram is illustrated in Figure. 3 and the timing diagram is illustrated in Figure. 4.
A Traffic Information Estimation Model Using PLU Events from Cellular Network
75
The following assumptions and parameters in the model are defined below. • The call arrivals to/from one MS per one car along the road can be evaluated. The call arrival rate to a cell is λ (call/hr). • The call inter-arrival time function g(t) is an exponential distribution function as g(t) = λ e−λ t. • The call inter-arrival time tCIA is exponentially distributed [10] with the mean 1/ λ. • y (hr): The time difference from first call arrival to entering cell. • The time function h(y) is an uniform distribution function so h(y) = 1/(2c). In this scenario, the probability of PLU triggered in the cell is as formula (2). d⎞ d ⎛ ⎞ ⎛ Pr(Scenario2) = Pr⎜ tCIA > c ∩ y + > c ⎟ = Pr(tCIA > c ) × Pr⎜ y > c − ⎟ v⎠ v ⎝ ⎠ ⎝ ∞ ∞ c d d = ∫ g (t )dt ×∫ d h( y)dy = ∫ λe − λt dt × = e − λc c c− c 2vc 2vc v
(2)
Cell
Road
1st Location Update 1stcall arrival at t1 at t0
2nd Location Update at t3
Enter Cell at t2
Leave Cell at t4
2nd call arrival at t5
Fig. 3. The scenario diagram for vehicle movement and PLU events on the road when there are several calls between two consecutive PLU events
1st Location Update 1st call arrival
2nd Location Update
enter Cell y t0
t1
c
2nd call arrival
tCIA leave Cell d/v
t2
t3
t4
t5
Fig. 4. The time diagram for vehicle movement and PLU events on the road when there are several calls between two consecutive PLU events
76
B.-Y. Lin, C.-H. Chen, and C.-C. Lo
2.3 Summary: Traffic Density Estimation We use the formula (3) to consider and sum up the two scenarios about the probability of PLU event in a specific cell for traffic density estimation. Pr( PLU ) = Pr (tCIA > c ) × Pr( Senario 1) + Pr (tCIA < c ) × Pr( Senario 2) = e − λc ×
(
)
(
)
d d ⎞ d ⎞ ⎛ ⎛ − λc + 1 − e − λc × ⎜ e − λc × ⎜ e − λc ⎟ = 3−e ⎟ vc 2 vc 2 vc ⎠ ⎝ ⎠ ⎝
(3)
Formula (3) is the probability of PLU event triggered in a specific cell of one car. To find the probabilities of PLU events triggered in a specific cell of all cars, we have to multiply formula (3) with the traffic flow f (car/hr). The amount of PLU events r (event/hr) on the road segment can be expressed as formula (4) to estimate the traffic density D (car/hr).
(
)
d ⎞ ⎛ r = f × Pr(PLU) = f × 3 − e −λc × ⎜ e − λc ⎟ 2vc ⎠ ⎝ d ⎞ ⎛ = D × 3 − e − λc × ⎜ e − λc ⎟ 2c ⎠ ⎝
(
(4)
)
3 Numeric Analysis
500
500
Density PLU
400
400
f = 5000 (car/hr) λ = 1 (call/hr) d = 1 (km) c = 1 (hr)
300 200
300 200
100
100
0
0 10
20
30
40
50
60
70
80
90
Amount of PLU (event/hr)
Traffic Density (car/km)
In this section, we analyze the relation between the amount of PLU events and traffic density to evaluate the feasibility of our traffic information estimation model. For the purpose of demonstration, we adopt some parameters as followings to estimate the traffic density and the amount of PLU events: f = 5000 car/hr, λ = 1 call/hr, d = 1 km, and c = 1 hr. Fig. 5 shows that a positive relationship with the amount of PLU events and traffic density. Therefore, this model can be used to estimate traffic information for ITS to analyze the traffic information.
100
Speed (km/hr)
Fig. 5. The relation between the amount of PLU events and traffic density with different vehicle speeds
A Traffic Information Estimation Model Using PLU Events from Cellular Network
77
4 Conclusions This paper studied an analytic model to analyze the speed report rate with considering communication behavior and traffic information for the feasibility evaluation of traffic information estimation from cellular data. In experiments, the results shows that a positive relationship with the amount of PLU events and traffic density. This model can be used to estimate traffic information for ITS to analyze the traffic congestion, accidents, transportation delays, and etc.
References 1. Middleton, D., Parker, R.: Vehicle Detector Evaluation. Report 2119-1. Project Number 02119. Texas Transportation Institute (2002) 2. Cheu, R.L., Xie, C., Lee, D.H.: Probe Vehicle Population and Sample Size for Arterial Speed Estimation. Computer-Aided Civil and Infrastructure Engineering (17), 53–60 (2002) 3. Ygnace, J., Drane, C., Yim, Y.B., de Lacvivier, R.: Travel time estimation on the SanFrancisco bay area network using cellular phones as probes. University of California, Berkeley, PATH Working Paper UCB-ITS-PWP-2000-18 (2000) 4. Fontaine, M.D., Smith, B.L.: Probe-based traffic monitoring systems with wireless location technology: an investigation of the relationship between system design and effectiveness. Transportation Research Record: Journal of the Transportation Research Board (1925), 3–11 (2005) 5. Bar-Gera, H.: Evaluation of a cellular phone-based system for measurements of traffic speeds and travel times: A case study from Israel. Transportation Research Part C (15), 380–391 (2007) 6. Caceres, N., Wideberg, J.P., Benitez, F.G.: Deriving origin-destination data from a mobile phone network. IET Intelligent Transport Systems 1(1), 15–26 (2007) 7. Logghe, S., Maerivoet, S.: Validation of travel times based on cellular floating vehicle data. In: Proceedings of the 6th European Congress and Exhibition on Intelligent Transportation Systems, Aalborg, Denmark (2007) 8. Caceres, N., Wideberg, J.P., Benitez, F.G.: Review of traffic data estimations extracted from cellular networks. IET Intelligent Transport Systems 2(3), 179–192 (2008) 9. Gundlegard, D., Karlsson, J.M.: Handover location accuracy for travel time estimation in GSM and UMTS. IET Intelligent Transport Systems 3(1), 87–94 (2009) 10. Bolotin, V.A.: Modeling call holding time distributions for CCS network design and performance analysis. IEEE Journal on Selected Areas in Communications 12(3), 433–438 (1994)
The Application of Virtual Reality on Distance Education Zehui Zhan Center of Educational Information Technology, South China Normal University, Guangzhou, 510631, China
[email protected]
Abstract. The features and classifications of Virtual Reality Techniques have been summarized and recommendation of applying Virtual Reality on distance education has been made. Future research is needed on the design and implementation of virtual classroom and courseware. Keywords: Virtual Reality; distance education; virtual classroom; application.
1 Introduction With the development of network technology such as broadband transport rate, Virtual Reality Techniques have been gradually taken consideration by distance education organizations. Modern educational technologies are making Virtual Reality a promising instructional means, where modeling and simulations can be used to display the structure and trends of natural, physics or social system, so as to provide an experiential and observable environment for students. The purpose of this paper is to analyze the applicability of Virtual Reality in Distance Education.
2 Virtual Reality As described on Wikipedia, Virtual Reality was first proposed by Jaron Lanier in 1989 [1]. It is also known as "Artificial Reality", "Cyberspace", "Artificial Environments", "Synthetic Environments" and "Virtual Environments". Virtual Reality is a kind of perceived environment usually simulated by computer. Most virtual reality environments are primarily visual experiences, displayed either on a computer screen or through special stereoscopic displays, but some simulations include additional sensory information, such as sound through speakers or headphones. Some advanced and experimental systems have included limited tactile information, known as force feedback. Virtual Reality is based on computer technology and hardware equipments, to implement a kind of illusional spaces that can be seen, listened, touched and smelled by users. It can be a set of computer simulation of 3D environment, which might be either entities exist in the world or those fictive characters never exist. In virtual reality environment, by dint of the computer hardware, network techniques, broadband and computer 3D calculating capacity, users can enter the virtual world through HumanComputer Interface. R. Chen (Ed.): ICICIS 2011, Part II, CCIS 135, pp. 78–83, 2011. © Springer-Verlag Berlin Heidelberg 2011
The Application of Virtual Reality on Distance Education
79
Besides, Virtual Reality is a subject that integrates human factors and information technology. Its main purpose is to denote information through artificial work and experience. Complex and abstract objects can be divided into sub-objects and expressed as specific symbols in virtual environment. VIRTUAL REALITY will introject many human factors, and intends to magnify the affects that it carries out to personal feelings. Therefore, it is built up on the integration of psychology, controlism, computer graphics, database design, real-time distributed system, electronics, robotization, multi-media techniques, etc. Moreover, distinguished from the static CAD model, Virtual Reality is a dynamic open Environment, which will response to the users' input such as gestures, sounds and keyboard commands. Through these interactions, users will feel themselves being immersing in this virtual space. Also, administer can supervise and control the environment by another interface as well.
3 Features of Virtual Reality The basic features of Virtual Reality have been sum up by Grigore Burdea in a model called "Virtual Reality Triangle", into three perspectives—Immersion, Interaction and Imagination[2]. 3.1 Immersion Immersion emphasizes the "real" experience. Ideally, users should totally fling themselves into the virtual system without feeling they are inside of it. This perfect illusional effect is a sense of presence, which should be contributed by three factors-Imagery, Interaction and Behavior. Imagery guarantees the High Fidelity of 3D effects. For example, we should control the parallax, vision scope, depth and angle to generate the feeling of "presence". Interaction is various in Virtual Reality, users should be able to feel natural when they execute an action in virtual environment. Behavior means that objects in virtual environment should be able to obey the order of nature or the regulation set by designers when they are moving or interacting. It is also called Autonomy of Virtual Reality system. For example, when an object receives a force, it will move to the opposite direction and give a force back at the same time, according to physics regulation. According to human cognitive theory, these three factors connect to as well as act on one another, and finally lead to the Immersion effect. 3.2 Interaction Interaction is a goal to provide convenient and vivid interactive means, which enable users to act inside virtual space and get real-time response; at the same time, enable the system to collect feedback from users as well. 3.3 Imagination Imagination is a factor to make the Virtual Reality system stand out. Most of the Virtual Reality system is not one kind of high-end interface, but the application focus on specific fields and question domain. Therefore, it requires not only the understanding and digesting of techniques, but also the brave imagination.
80
Z. Zhan
4 Classification of Virtual Reality 4.1 Desktop Virtual Reality Desktop Virtual Reality implements the simulation via personal computer and lowend work station. Usually, computer screen is used as the window for users to observe virtual space; the peripheral equipments are used to control the stand-ins and other interaction. In desktop Virtual Reality, 3D vision effects (such as using stereo-glasses) can enhance users' immersion. Besides, the CRT screen and stereo-image techniques lead to a high screen solution power and a low price. Therefore, this kind of virtual reality is the easiest to spread widely and has a strongest life force. 4.2 Immersive Virtual Reality Immersive Virtual Reality uses interaction equipments such as headset screen and data gloves to temporary block the users' vision and acoustical sensory perception into a close-up environment, so as to immerse deeply into the virtual system. There are three kinds of typical immersion Virtual Reality --cave immersion, cabin-seat immersion and screen projection immersion. Cave immersion is a 360 degree immersion system. Cabinet seat immersion makes the user sit in a cabinet, where there is a window-like screen entitle them to "look outside". So the user can turn around and browse in this space without wearing any Virtual Reality equipments. Projection immersion uses the projector to reflect the user him/herself to the screen, so that they can see themselves and interact with the virtual environment around them in the screen. 4.3 Distributed Virtual Reality Distributed Virtual Reality is to connect different users that stay in different location, let them share the same environment and work together in virtual space. Different from other Virtual Reality that just enable people to interact with virtual environment, it realizes the communication between different users as well. To sum up, Virtual Reality can display a rich and colorful space, enable users studying, working, living and entertaining inside. It brings a brand-new taste and view to the society and education. Now, some kinds of virtual digital world, such as virtual community, virtual family, virtual tourism and virtual language guide are already a part in our life that cannot be neglected. At the same time, modern education is trying to make good use of this technology and improve the education quality and learning effects.
5 Virtual Reality Applied in Online Learning Environment 5.1 Drawbacks of Today’s Online Learning Environment The drawbacks of the existing online learning environment can be sum up as follows: First, today's online education is short of the real experience. According to the constructivism theory mentioned earlier in this paper, knowledge should be organized within an environment, so that learners can link them actively and fulfill the process
The Application of Virtual Reality on Distance Education
81
of reconstruction. The learning outcome is combined with the specific situation, which can be met in real life or in learning environments. However, most of today's online learning are based on website and follow the HTTP protocol. They are lack of reality and fail to show the situation as authentic as it should be. Second, today's online education is not perceivable and natural enough. The collaborative learning environment base on internet should have at least three basic functions--sharable information resource, interactive tools and cooperative learning space. A multi-channel interaction with rich information and favorable effect is greatly needed. However, nowadays, the user interface and interactive modes are not friendly enough in online learning environment. It fails to satisfy the cooperators' emotional expression and collective apperceive, affects the quality of cooperation and communication. A good collaborative learning environment should be able to achieve individual improvement through the collective force. Anyone who acts excellent or falls behind will be noticed by his/her teacher and classmates, so as to build up a good psychological atmosphere to help everyone make progress together. Third, today's online education doesn't attach enough importance on the learners' nonintellective factors. Different learner will have different characteristic, different social and cultural background, and their original knowledge structure. So there are usually quite large gap on thinking patterns and learning styles differences. However, it is hard for us to identify the learners' differences on most of the online education website, because the only difference between learners is the ID that assigned to them automatically by the system. This shortage hinders the teaching in accordance of students' aptitude. Moreover, learners might not be able to learn more about each other as well. 5.2 Solution and Trend—Virtual Reality Applied in Online Learning Environment One of the best possible solutions for the drawbacks mentioned before is to combine cooperative learning techniques and virtual reality techniques, set up a distributed virtual learning environment, shows information by a three-dimension dynamic format, so as to achieve better reality, natural interaction and immersive effects. There are several advantages for applying Virtual Reality in online virtual classroom: First, virtual reality enriches the multimedia representation format in virtual classroom. 2D and 3D format take the place of the dull interaction. They can make the interface real and vivid, convenient for users to get information. An enjoyable feeling will be transferred to users and increase their cooperation efficiency. Second, virtual reality improves the cooperative users interface in virtual classroom. 3D distributed cooperative learning environment is much friendlier than the simple 2D software interface. Users can experience a deeper immersion, which make the interface more acceptable and easy to use. User’s status will be more transparent for others as well, so teachers and classmates will be able to know each other and collaborate better. Third, Virtual reality is good for the cultivation of learners' non-intellective factor. In virtual classroom, stand-ins will be used to stand for learners. Users can select the stand-in that similar to their own characteristic or the characteristic they would like to
82
Z. Zhan
cultivate. This step enables the system to identify user's personality, culture background and knowledge structure in the first stage. Everyone will use "first person" to communicate with classmates or teachers, and then the system will be able to record and analyze their inclination and interest, so as to choose the best way for them to learn. Fourth, virtual reality increases the whole system's efficiency. The reality threedimensional senses give students a quick entry to the study status and keep them concentrate inside. In this way, the learning efficiency is increased. In addition, the harmonious human computer interface transfers the real world interaction almost directly into virtual classroom, therefore, users don't have to passively adapt to the computer interface. In this way, Virtual Reality save the time and effort by avoid making cognitive burden for users. Actually, some countries have already pay attention on the Virtual learning environment. For example, United States is the first country that applies Virtual Reality onto education. In 1992, East Carolina University set up the Virtual Reality Educational Lab, aims to confirm the feasibility of Virtual Reality -Education, evaluate the hardware and software of Virtual Reality, study the effects on education generated by Virtual Reality and the application in reality, also, it compare the effects between Virtual Reality and other education medias. Also, the United Kingdom develops Virtual Reality-Education with great passion as well. The first Educational Virtual Reality project is set up in Newcastle-Upon-Type middle school, based on the Dimension International technology. Virtual Reality applied on language training and Industrial training has been explored here. Meanwhile, the VITART (Virtual Reality Application Research Team) project in Nottingham University is also doing the research on virtual learning system, which focuses on Virtual Reality input equipments and disable people training. 3D technique is much more complex than 2D. That’s the reason why it is not as prevail now. However, with the development of technology, when the data communication is more advanced and it is not going to take us as much effort to set up a 3D space, 3D virtual environment will certainly become popular for online education.
Summary This paper analyzed the possibility and necessity of applying Virtual Reality on distance education. The definition, features and classification of Virtual Reality have been sum up and merits of building up virtual classroom for distance education has been pointed out. Future research is needed on the design and implementation of virtual classroom and courseware, especially on the design of virtual classroom interface.
Acknowledgement This work is supported by the Natural Science Foundation of Guangdong province in China No. 8451063101000690, and the Foundation of Scientific and Technological Planning Project of Guangdong province in China No. 2009B070300109.
The Application of Virtual Reality on Distance Education
83
References [1] Information on, http://en.wikipedia.org/wiki/Virtual_reality [2] Burdea, G., Coiffet, P.: Virtual Reality Technology. John Wiley & Sons, New York (1994) [3] Robertson, G., Czeminski, M., van Dantzich, M.: Immersion in Desktop Virtual Reality, attrieved from http://www.research.microsoft.com/en-us/um/people/ marycz/uist97.pdf
Framework Design of Unified Cross-Authentication Based on the Fourth Platform Integrated Payment* Xu Yong and He Yujin School of Economics and Commerce, South China University of Technology, Guangzhou University City, Guangzhou, China
[email protected],
[email protected]
Abstract. The essay advances a unified authentication based on the fourth integrated payment platform. The research aims at improving the compatibility of the authentication in electronic business and providing a reference for the establishment of credit system by seeking a way to carry out a standard unified authentication on a integrated payment platform. The essay introduces the concept of the forth integrated payment platform and finally put forward the whole structure and different components. The main issue of the essay is about the design of the credit system of the fourth integrated payment platform and the PKI/CA structure design. Keyword: The fourth integrated payment platform, Unified authentication, PKI/CA.
1 Background The data released by iResearch, a professional consulting company, shows that the deal size in first quarter reached 2 trillion 12 billion and 100 million yuan, which increased 17.8% compared with the deal size in the last quarter and 93.5% compared with the same period of last year. It is obvious that the network payment industry remains in rapid development and it has become one of the fastest growing industries in the world of Internet [1].While the network payment industry is growing at a high speed, two main problems are still unsolved. One lies in the incompatibility of its rapid development and its related infrastructure. The other is contradiction between the massive need for online payment security and the poor compatibility of existing online payment tools [2]. According to the Computer Security Net, the number of government CA and licensed brand CA is 36 [3]. One of the key elements in protecting and securitizing the ID authentication is a stable and secured network; however, the over-sophisticated and duplicated net security instrument also negatively affects the efficiency and compatibility of network payment. *
The National Soft Science Research Program, 2010B070300016.
R. Chen (Ed.): ICICIS 2011, Part II, CCIS 135, pp. 84–88, 2011. © Springer-Verlag Berlin Heidelberg 2011
Framework Design of Unified Cross-Authentication
85
2 Introduction of Unified Cross-Authentication in TFPP 2.1 What Is the Fourth Integrated Payment Platform? The fourth integrated payment platform is also called the fourth party payment (TFPP for short). The fourth party payment is integrated service provider offering electronic payment and its value added service. As Figure 1 shows below. Integrated Accessing Interface For platform Of E-Business Merchant
Control Of Security And Risk
The Middleware Of Products Display Interface Of Payment
Integrated Accessing Interface For Added-value SP
Unified Payment Protocol Interface Of Banks
Credit Evaluation
Unified Cross-Authorization Protocol
Interface Of E-Payment Supervision
Unified Settlement
Interface Of Taxation
compreh ensive service informati on Manage ment
Taxation
Fig. 1. The Composition Of TFFP
Through its payment service, value added service, and by integrating different resources and technologies owned by different service providers, standardizing the process of electronic commerce and by offering electronic payment supervision interfaces. The fourth party payment consists of interface service module and support system service module. The interface service includes unified access interface for electronic business vendors, unified access interface for value added service provider, products show medium, payment interface, bank interface, electronic payment supervision interface, unified settlement, credit assessment, tax control inferface. Value added service includes security and risk management module and general information management module. 2.2 A PKI Framework for TFFP The new PKI/CA based on TFFP is very similar with the PKI/CA in structure. PKI is responsible for the part of user identity that fits the public key managed by PKI. CA is responsible for the management of certificate [5]. With its payment function, the authentication center of the fourth party payment based on PKI/CA has a structure as shown in the fig.2
86
X. Yong and H. Yujin
Fig. 2. Unified cross-authentication center framework of TFPP
As it is shown in the fig.2 that the fourth party payment unified cross-authentication is linked with six major substances Domain. Foreground requests for authentication are usually sent by authentication center of buyers and sellers, who initiate the authentication process. Between the buyers/sellers and the backgrounders are CAs of the intermediary service provider and third-party payment platform provider, which do not actually trade commodities but benefit by offering intermediary service. CAs of finance and government administration operates in the background and are responsible for supervision and control. Government administration CA links to the crossauthentication mainly because the current government online payment supervision facilities are not able to keep pace with the evolution of the online payment and because online trade tax issues. Government agencies are able to levy taxes, and work in cooperation with financial institutions to supervise and manage the deposit fund. The two main information flows can be categorized into two kinds. The first kind is the request information and authentication information that transports from the substance domain to the fourth party payment. The first kind of information stream is indicated by dotted lines in the above fig.2. The second, as shown by the real line, is the response from the fourth party payment.
3 Detail Design of TFPP Authentication Center 3.1 Detail PKI/CA Framework of TFPP In the fourth party payment platform, unified authentication need to get the point that a single user can achieve more identity. Using the way of “domain” and declaring the
Framework Design of Unified Cross-Authentication
87
attribute status can access the permissions after verification. The most important function of the fourth party payment center is carrying on the credit management to the participation entities and guaranteeing the participation gain the permission and information assigned by the role. Next is providing authentication service which is cross domain, cross system and cross application to the participation. 3.2 Functions of TFPP Authentication Center The fourth party payment PKI is similar to the traditional PKI in case of the system, but has more flexibility in the credit administration and the authentication. The framework of PKI in TFPP has shown below.
Fig. 3. Framework of PKI in TFPP
1. The fourth party payment CA The fourth party payment CA is the trust center of the whole authentication system and also the highest credit center. Credit administration's object include domain CA as well as the participation entity in the domain, the way of management is evaluating the credit line by initial registration to the status of entity and previous activity log and determining to permit, forbid or restore the cross domain application. 2. Domain CA Domain CA is similar to the secondary CA in the traditional PKI system, but for a single domain it is root CA. Domain CA is responsible for issuing certificate to the participation in every single domain, distributing, updating and restoring the key and managing the certificate.
88
X. Yong and H. Yujin
3. Attribute confirmation Just as the preceding text said, every domain has the sole attribute value. The attribute value is saved in the expand part of the certificates which make the X.509 V3 as the standard platform. So the fourth party payment need to verify the attribute values, one purpose is confirming the authenticity of the status, determining which domain it belong and assigning jurisdiction, another is transmitting information to the fourth party payment CA, which providing the data for the authentication. 4. Certificate warehouse Resembling the PKI, the fourth party payment PKI also use certificate to save and retrieval certificate, certificate cancelled list and so on. The ostensible certificate information in the certificate warehouse can be inquired by the participant and public, but regarding the information in the secret part, its authenticity and security can be safeguarded by effective reliable gathering to the certificate holder made by the organization issuing the certificate. We can see that the fourth party payment system includes two major functions: identity authentication and cross credit transmission.
4 Conclusion This article put forward the unified cross authentication of the fourth party payment based on PKI/CA by studying the problems in the network payment, especially the contradiction in the safe authentication aspect. Its characteristic lies in the ductibility of the trust relationship in the PKI system. Different domain and different participation establish mutual trust relationship by bridge CA the fourth party payment, reducing cross authentication certificate between each other, raising the efficiency.
References 1.
2. 3. 4. 5.
iResearch China, The market scale of China network payment has reached 212.1 billion Yuan in the first quarter of 2010 (2010), iResearch China in http://irs.irDEearch.com.cn Financial Times, A report on China integrated liquidation platform. Cio360 in, http://www.cio360.net/ The list of brand CA in China, http://www.infosec.org.cn/zydh/ca.html Xu, Y., Fang, C.: A theoretical framework of fourth party payment. In: The International Conference on E-Business and E-Government (ICEE 2010), May 7-9 (2010) Ming, Q.: Electronic commerce Security, 2nd edn. Higher Education Press (2006)
Analysis towards VMEM File of a Suspended Virtual Machine Zheng Song, Bo Jin, and Yongqing Sun* Key Laboratory of Information Network Security, Ministry of Public Security, People’s Republic of China (The Third Research Institute of Ministry of Public Security), Shanghai 201204, China
[email protected],
[email protected],
[email protected]
Abstract. With the popularity of virtual machines, forensic investigators are challenged with more complicated situations, among which discovering the evidences in virtualized environment is of significant importance. This paper mainly analyzes the file suffixed with .vmem in VMware Workstation, which stores all pseudo-physical memory into an image. The internal file structure of .vmem file is studied and disclosed. Key information about processes and threads of a suspended virtual machine is revealed. Further investigation into the Windows XP SP3 heap contents is conducted and a proof-of-concept tool is provided. Different methods to obtain forensic memory images are introduced, with both advantages and limits analyzed. We conclude with an outlook. Keywords: VMEM, Virtual Machine, Forensic.
1 Introduction Memory is an important basic component in modern computer architecture. Programs are generally loaded into memory and then executed by CPU, inputs and outputs are transferred via memory. Many sensitive information of a running system exists in memory. In the past, analyzing a memory image means using commands such as strings and grep to search the whole image for ASCII or UNICODE strings like passwords, IP addresses, or some other plain text contents [1]. As the result of the first forensics challenge issued before fifth annual conference of Digital Forensic Research Workshop (DFRWS 2005) [2], there are more tools and methods to Windows memory analysis. However, with the advent of virtualization era, traditional tools and methods may not work correctly any longer and memory image analysis faces more challenges. This paper mainly analyzes the file suffixed with .vmem in VMware Workstation, which stores all pseudo-physical memory into an image. The functionality of the .vmem file is explained as follows. By default, the .vmem file is enabled by the VMware Workstation product. Every time a user starts a virtual *
Corresponding author.
R. Chen (Ed.): ICICIS 2011, Part II, CCIS 135, pp. 89–97, 2011. © Springer-Verlag Berlin Heidelberg 2011
90
Z. Song, B. Jin, and Y. Sun
machine, a temporary file suffixed with .vmem is created. When the suspend button is pressed, the Virtual Machine Monitor (VMM) saves all the memory contents of the virtual machine’s pseudo-physical memory into this file, which has a size that is same to memory size in virtual machine’s configuration file (.vmx). So when the virtual machine is resumed, VMM fetches data from this file and can create an environment that is exactly the moment the virtual machine is suspended without any differences or modifications. So our investigation starts from this .vmem file. The next section discusses the VMEM structure. Section 3 studies the useful information that can be obtained from VMEM. The demos show the steps how we are able to find useful information from Windows XP SP3 heap structure.
2 Overview of VMEM Most contemporary general-purpose operating systems commonly adopts paging mechanisms to support multi-process environments hence allows the physical address space of a process to be noncontiguous. Each process is executed in its virtual address space, fetching or saving data according to its virtual addresses. However, there is only one physical address space to which multiple virtual address spaces are mapped. So bridging the gap between virtual and physical address is a prerequisite before deeper investigation. VMEM is a kind of memory image file that is slightly different from memory dump file (*.dmp) under Windows OS. It is identical to a dd-style memory image without any header in Windows dump files as we discovered in our experiments. The structure of .vmem file can be regarded as the same to pure physical memory, which depends on guest operating system.
3 Useful Information from VMEM An enormous number of useful information resides in memory image, such as kernel structures from the OS, processes and threads, heaps. Other sensitive information include user’s password input, records of instant messaging (IM), and lots of browser-related information. The whole world seems chaos before what every byte means in memory image is figured out, they will soon be viewed in order. The first thing to do is to identify the processes, which is represented by an executive process (EPROCESS) block in Windows OS. As long as all the processes are recognized in the memory image, it is easier to obtain information such as threads, heaps and various other attributes relating to a process. Because all of them have some relation with EPROCESS which can be illustrated as follows.
Analysis towards VMEM File of a Suspended Virtual Machine
91
_KPROCESS +0x000 Header : _DISPATCHER_HEADER
_EPROCESS +0x000 Pcb
: _KPROCESS
...
...
+0x018 DirectoryTableBase : [2] Uint4B
+0x084 UniqueProcessId : Ptr32 Void
...
+0x088 ActiveProcessLinks : _LIST_ENTRY ...
...
+0x174 ImageFileName UChar
: [16]
... : Uint4B
...
+0x018 ProcessHeap Void
: Ptr32
+0x000 Type UChar
:
+0x001 Absolute UChar
:
+0x002 Size UChar
:
+0x003 Inserted UChar
:
+0x004 SignalState Int4B
:
+0x008 WaitListHead : _LIST_ENTRY
... : Ptr32 _PEB
...
+0x008 ImageBaseAddress : Ptr32 Void ...
+0x1a0 ActiveThreads
+0x1b0 Peb
_PEB
_DISPATCHER_HEADER
+0x088 NumberOfHeaps
: Uint4B
+0x08c MaximumNumberOfHeaps : Uint4B +0x090 ProcessHeaps Ptr32 Void
: Ptr32
...
Fig. 1. EPROCESS and its internal substructures as KPROCESS, PEB and DISPATCH_ HEADER
Processes are synchronized objects so their control structure EPROCESS begins with a substructure known as DISPATCHER_HEADER (similar situation happens to threads). The header contains a Type field which is used for identification. It functions similarly to magic numbers in some file formats in forensic field (e.g., PE magic number, ZIP magic number). In our experiments under Windows XP SP3 guest, the starting 4 bytes are always 0x03,0x00,0x1b and 0x00 (0x001b0003 in little-endian). Getting to know the specific header characteristics is not enough, because there are false positives possible. A further check on the EPROCESS candidates is a must. A lot of useful information about a process is stored inside EPROCESS such as PID (process id), create time and exit time, its threads and handle table. Andreas Schuster [3] contributed experiences to searching for processes and threads in Windows memory dumps, which is useful here. Besides, there are lsproc, lspi toolkit series which is suitable only for Windows 2000 [1]. As soon as each EPROCESS is located by its offset within the .vmem file, it is time to present more information. The 4 bytes beginning from offset 0x1b0 inside EPROCESS is a point to the PEB (Process Environment Block) structure. However, as this pointer is in virtual address space semantic, it does not work in the memory image in physical address space.
92
Z. Song, B. Jin, and Y. Sun
So the next step is to convert the virtual addresses to physical ones so we can know where it is located within the memory image. According to Intel’s publications [4], virtual address can be translated to physical address via segmentation and paging mechanisms. But we will only cover the paging because we can have two inputs and want only an output: Physical Address = TranslationFunc ( Virtual Address, CR3 ); Virtual address can be obtained obviously, while the value of CR3 register of each process is stored in the 4 bytes beginning from offset 0x018 inside EPROCESS (the first member of DirectoryTableBase array). But the conversion progress is different: this conversion is done by hardware (MMU in CPU) under real machine, but achieved by software-MMU (functions from VMM) in virtual machine. So traditional paging translation mechanisms under x86 failed to output the correct physical address in our experiments and we struggled to figure out that it PAE mode through various tests. It seemed incredible to us at first because PAE is not turned on in BIOS in host machine, besides, there were no clues about PAE in Windows XP SP3 guest OS. But we soon got to know that either kind of paging mechanism is possible if it’s achieved by software. The following figure shows the paging mechanism adopted by VMware Workstation 7.0.0 build 203739.
Fig. 2. Linear Address Translation with PAE enabled (4-KByte Pages) [4]
With the gap from virtual to physical bridged, more information can be revealed by PEB. Executive files under Windows (e.g., *.exe) are organized as PE format, and some sections are loaded into memory from disk, while others are not statically stored and are dynamically created by Windows sub-system. Heap is an obvious example. The Windows Heap Manager is a sub-system used throughout Windows to provision dynamically allocated memory. It resides on top of the virtual memory interfaces
Analysis towards VMEM File of a Suspended Virtual Machine
93
provided by the kernel, which are typically accessed via VirtualAlloc() and VirtualFree(). Basically, the Heap Manager is responsible for providing a high-performance software layer such that software can request and release memory using the familiar malloc()/free()/new/delete idioms[5]. Each process typically has multiple heaps, and software can create new heaps as required. There is a default heap for the process, known as the process heap, and a pointer to this heap is stored in the PEB. All of the heaps in a process are kept in a linked list hanging off of the PEB. The 4 bytes beginning from offset 0x090 is a pointer to a pointer array of ProcessHeaps whose size is represented by NumberOfHeaps in PEB. The first member in this array is default heap for process which equals to ProcessHeap in PEB. Each member of the array points to a HEAP structure. The HEAP structure contains a pointer array with 64 elements, each of which points to a HEAP_SEGMENT structures or filled with NULL. The FirstEntry in HEAP_SEGMENT is a pointer to HEAP_ENTRY structure, which reveals size of current block, size of previous block and unused bytes in current block. The value of Size/PreviousSize is calculated as actual bytes divided by 8. Flags represents the block is in use, the last one, or a virtual one. _PEB
_HEAP_SEGMENT
_HEAP ...
+0x008 ImageBaseAddress : Ptr32 Void
+0x008 Signature Uint4B
... +0x018 ProcessHeap Ptr32 Void
:
ProcessHeaps Pointer Arrays
...
Pointer to Heap No.0 (+0x018 ProcessHeap)
+0x088 NumberOfHeaps : Uint4B
Pointer to Heap No.1
+0x08c MaximumNumberOfHeaps : Uint4B +0x090 ProcessHeaps Ptr32 Ptr32 Void ...
:
+0x000 Entry : _HEAP_ENTRY
+0x000 Entry : _HEAP_ENTRY
+0x00c Flags Uint4B ...
+0x058 Segments[0]: Ptr32 _HEAP_SEGMENT +0x05c Segments[1]: Ptr32 _HEAP_SEGMENT ...
Pointer to Heap No.(NumberOfHeaps - 1)
+0x154 Segments[63]: Ptr32 _HEAP_SEGMENT ...
: :
_HEAP_ENTRY
: Ptr32
+0x000 Size : Uint2B
+0x00c Flags Uint4B
:
Pointer to Heap No.2 ...
+0x008 Signature Uint4B
:
+0x010 Heap _HEAP
+0x002 PreviousSize : Uint2B
... +0x018 BaseAddress Ptr32 Void
:
+0x01c NumberOfPages Uint4B
:
+0x020 FirstEntry : Ptr32 _HEAP_ENTRY +0x024 LastValidEntry : Ptr32 _HEAP_ENTRY ... +0x038 LastEntryInSegment : Ptr32 _HEAP_ENTRY
+0x004 SmallTagIndex : UChar +0x005 Flags : UChar +0x006 UnusedBytes : UChar +0x007 SegmentIndex : UChar
Fig. 3. Heap Organization
Although there are some insightful researches into Windows heap exploitation [5], they are of few help here because their usages are all in live state but we see data in a static way. Bridging the gap between live and static is much more difficult than addresses translation.
4 Demos With the detailed description in last section, we use Perl scripts to analyze the .vmem file. The procedures can be summarized as follows.
94
Z. Song, B. Jin, and Y. Sun
1. 2. 3.
Indentify all the processes from the .vmem file by specific characteristics in DISPATCHER_HEADER. Find out physical location of a process’s PEB within .vmem file by address translation. Get detailed information directly or indirectly from PEB. For example, searching for heap contents by ProcessHeaps form PEB.
The following demo is done under VMWare Workstation 7.0.0 build 203739 with a guest OS of Window XP SP3. The guest virtual machine is configured with a memory size of 256MB. Scenario I Start the virtual machine, log in to Windows XP SP3 guest, and open the default notepad program in XP. Type in one line “This is a demo”, and DO NOT save it to any .txt files on disk. Then press the suspend button from the VMware Workstation control panel immediately. Now follow the steps below: 1.
Identify the processes from VMEM by using a lsproc-series Perl script that we modified from lsproc tools. From the picture captured below, we can see the offset of EPROCESS structure of process notepad.exe is 0x0186e1b8.
Fig. 4. Identify the processes from VMEM
2.
Use a Perl script named lsheap_xpsp3.pl to display the structures of heap organization and their physical offsets within the VMEM file. There are altogether 10 heaps in our demo, and we just showed 3 of them in the picture captured below (Fig. 5) due to the length of this paper.
Analysis towards VMEM File of a Suspended Virtual Machine
3.
95
By a deeper walk of the heap contents beginning from the first entry in the default heap (starting from 0x000a0000), we found that the UNICODE string of “This is a demo” locating at virtual address 0x000b1b08, which is offset 0x07e02b08 in VMEM file as showed in Fig. 6. Note that the 8 bytes from 0x0x07e02b00 is the HEAP_ENTRY part.
Fig. 5. Display the heap organizations of the process notepad.exe
Fig. 6. The contents of VMEM showed by WinHex
96
Z. Song, B. Jin, and Y. Sun
Scenario II This is a similar scenario, but the outcome of our findings is attractive. Start the virtual machine, log in to Windows XP SP3 guest, and open the latest Windows Live Messenger (version 14.0.8117.416) in XP. Type in the password of an account that is stored beforehand, and log in normally. Then press the suspend button from the VMware Workstation control panel immediately. This time when we are walking through the heap contents of the process msnmsgr.exe, we found the plain-text password in the context of the MSN account information accidentally. We assume that the password was used in the login process and released without cleaning the contents. For privacy reasons, the results will not be published here. This may become a potential vulnerability and users of MSN will risk privacy leakage.
5 Conclusion and Future Work The method of analysis to .vmem file proposed in this paper has several significances. 1. 2. 3.
It is a general method to search for useful information step by step, thus can be ported to different paging mechanism or different operating system. Other virtualization products with pause function by other vendors may have similar architectures thus some attention should be paid. As .vmem file is a binary file representing physical memory on the bottom of the guest operation system, tricks taken by rootkits to hide in OS does not work any longer. It is another way to detect whether there are hidden processed in your system that you do not know yet.
Our method of searching sensitive data in .vmem file still has some limits: 1.
2.
3.
Diversity. The actual structure of a .vmem file varies depending on the paging mechanism, different operating system version or service pack, and it is difficult to develop an all-in-one program to solve the diversity problem. Script language like Perl is more powerful here, and is agile and flexible to changes. Besides, the analysis to .vmem file depends on the ability of analyst, and more scripts can be prepared to deal with different situations (e.g., different versions and service packs of Windows). Efficiency. Identifying the specific bytes with characteristics from such a large file and then checking those candidates is a time-consuming process. It usually takes several minutes. However, the next steps can be done via scripts in seconds because no comparison is needed. So optimizing the scripts to improve efficiency is a future direction. Granularity. In our demo, the plain-text contents of the heap can be found by the process it belongs to, i.e., it is on process granularity. We hope future investigation can reveal more information so it can be used in forensic field without any question.
Analysis towards VMEM File of a Suspended Virtual Machine
97
Acknowledgement This paper is supported by the Special Basic Research, Ministry of Science and Technology of the People's Republic of China (No. 2008FY240200), the Key Project Funding, Ministry of Public Security of the People's Republic of China (No. 2008ZDXMSS003).
References 1. 2. 3. 4. 5.
Carvey, H.: Windows Forensic Analysis. Elsevier, Amsterdam (2007) DFRWS 2005 (2005), http://www.dfrws.org/2005/index.shtml Schuster, A.: Searching for process and threads in Microsoft Windows memory dumps. Digital Investigation (2006) Intel. Intel 64 and IA-32 Architectures Software Developer’s Manual, vol. 3A (2007) McDonald, J., Valasek, C.: Practical Windows XP/2003 Heap Exploitation. Blackhat (2009)
Optimization and Reconfiguration of Advanced Manufacturing Mode Based on Object-Based Knowledge Mesh and Improved Immune Genetic Algorithm Chaogai Xue1 and Haiwang Cao2 1
Department of Management Engineering, Zhengzhou University, Zhengzhou, China
[email protected] 2 Department of Electronic and Communication Engineering, Zhengzhou Institute of Aeronautical Industry Management, Zhengzhou, China
[email protected]
Abstract. This paper deals with an approach to the optimization and reconfiguration of advanced manufacturing mode based on the object-based knowledge mesh (OKM) and improved immune genetic algorithm (IGA). To explore the optimization and reconfiguration of the new OKM by the user’s function requirements, an optimization procedure of an OKM aiming at the user’s maximum function-satisfaction is proposed. Firstly, based on the definitions of the fuzzy function-satisfaction degree relationships of the users’ requirements for the OKM functions and the multiple fuzzy function-satisfaction degrees of the relationships, the optimization model of the OKM multiple set operation expression is constructed. And the OKM multiple set operation expression is optimized by the immune genetic algorithm, with the steps of the OKM optimization presented in detail as well. Based upon the above, the optimization and reconfiguration of an advanced manufacturing mode are illustrated by an actual OKM example. The proposed approach proves to be very effective. Keywords: Advanced manufacturing mode, optimization, user satisfaction degree, object-based knowledge mesh, improved immune genetic algorithm.
1 Introduction At present, various advanced manufacturing modes and new concepts emerge constantly. Though these advanced manufacturing modes are of different advantages, there has been no advanced manufacturing system that can contain all of the advanced manufacturing modes suitable for all kinds of manufacturing enterprises. If all kinds of complementary advanced manufacturing modes are transformed into their corresponding advanced manufacturing knowledge in the advanced manufacturing system, the enterprise can be allowed to select the most appropriate combination of advanced manufacturing modes or the best mode for operation. Therefore, a knowledge mesh (KM) was brought forward to formally represent complex knowledge such as advanced manufacturing modes, information systems. And to solve the information exploration in KM representation, OKM was brought forward [1~3]. R. Chen (Ed.): ICICIS 2011, Part II, CCIS 135, pp. 98–103, 2011. © Springer-Verlag Berlin Heidelberg 2011
Optimization and Reconfiguration of Advanced Manufacturing Mode
99
The reconfiguration technique provides an effective approach to the adaptation of the enterprises to outward conditions. The self-reconfiguration methods based on KM and AM are studied in Yan and Xue [2,3]. Only if an optimal OKM multiple set operation expression is obtained can the new optimal OKM be inferred from the expression to realize the optimal self-reconfiguration of the KMS. Thus, optimization of an OKM multiple set operation expression is the key to those of the reconfiguration. The optimization problem of an OKM multiple set operation expression is no longer the general linear, nonlinear or dynamic programming one. But it can be solved by connotative enumerative searching methods like genetic algorithm. Therefore, an improved IGA based on niche algorithm is adopted for optimization of OKM multiple set operation expressions, and the feasible OKM multiple set operation expression with user’s maximal fuzzy function-satisfaction degree is obtained. And then, reconfiguration is conducted to realize the new optimized advanced manufacturing modes.
2 OKM Multiple Set Operation Expression Optimization Since users usually focus attention on functions of a manufacturing mode, it is necessary to build the function-satisfaction degree model of an OKM and define its operations according to the relevant knowledge of fuzzy math [4], which can be referred in reference [5]. 2.1 Mapping Problem of the Solution Space To solve the optimization problem, relative evaluation criteria need to be established, and the optimization of function-satisfaction degree expressions for OKMs is realized. Then acquired function-satisfaction degree expressions are mapped into their OKM multiple set operation expressions. The optimization process is shown in Fig. 1. Evaluated OKM multiple sets
Function-satisfaction degrees for OKMs Combined with satisfaction degree operators
Combined with OKM multiple set operators
Function-satisfaction degree expression Perform immune genetic algorithm
OKM multiple set operation expression with optimal function-satisfaction degree
According to mapping rules
Function-satisfaction degree expression with optimal function-satisfaction degree
Fig. 1. Optimization process of OKM multiple set operation expression
Theorem 1: There is a one-to-one mapping between the OKM multiple set operation expression with brackets and N non-bracket operators and the function-satisfaction degree expression with N operators and the non-repetitive permutation of operator priorities.
100
C. Xue and H. Cao
2.2 Optimal Model of OKM Multiple Set Operation Expression The objective of optimization is to obtain the optimized chromosome with the best fitness vector. Thus, the objective function is
J = max ε ( f m'n' ( x ) , x 0 ) , f
Where,
m'n'
f m'n' is a fitness vector determined by the n ' th chromosome in the m' th
generation, which varies with the chromosomes. The notation some in the
x is the n ' th chromo-
m' th generation. x0 is the ideal fitness vector and a row vector made up
of 1 for the ideal satisfaction degree of each OKM-function is 1. 2.3 Immune Genetic Algorithm for OKM Multiple Set Operation Expression Optimization Compared with genetic algorithm based on immune principle and standard GA, IGA has the following advantages: (1) immune memory function; (2) maintaining antibody diversity function; (3) self-adjustment function. When fitness in IIGA is calculated, Niche algorithm can be used to select the best chromosome, and maintain the diversity of population. Improvements proposed in this paper are as follows: Each fitness is adjusted according to (1).
d ⎧ ⎪1 − sh ( d ) = ⎨ σ share ⎪0 ⎩ d=
d ≤ σ share
(1)
d > σ share
d ( opi, opj )
(2)
m × popsizel
Where, σ share is the radius of Niche, and generally σ share = 0.1 ; d ( opi , opj ) is Ham-
ming distance, m is the number of genes, popsize1 is the number of chromosomes in each sub-group. Then the new method of calculating fitness is shown in (3).
ε ( xopi ) =
ε ' ( x opi )
∑ sh ( x N
opi
opj =1
, xopj )
(3)
To overcome Niche algorithm’s deficiency of fast convergence, which leads to premature convergence, convergence function is introduced as follows.
⎛
f =
⎞
log ⎜ ∑ sh ( xopi , xopj ) ⎟ N
⎝ opj =1 ⎠ ⎛ N ⎞ log ⎜ ∑ sh ( xopi , xopj ) − 0.02 ⎟ ⎝ opj =1 ⎠
(4)
Optimization and Reconfiguration of Advanced Manufacturing Mode
101
ALGORITHM 1: OKM multiple set operation expression optimization algorithm: STEP 1 Initialize the parameters of IGA, and population size is
popsize .
STEP 2 Dividing population into qs sub-spaces uniformly, which includes: (1) Calculating and adjusting fitness according to above (1) and (2). (2) Taking the first five optimal chromosomes as initial vaccine bank. (3) Crossover operation. The Pc of any two chromosomes in popi ( i = 1, 2, L , s ) is calculated according to (3), then the pair with maximum Pm will be selected to perform crossover operation, and the first two optimal chromosomes will be reserved. (4) Mutation operation. Judging evolution generation, if the maximum generation is divisible by present generation, then one chromosome is selected from popi , and will be vaccinated. Or the chromosomes are selected via a simulated roulette wheel. (5) Adjusting vaccine bank. When the chromosomes’ fitness values are lower than a given threshold φ , then the corresponding chromosomes will be preserved, or will be excluded from the bank. (6) Updating sub-population and vaccine bank. Any chromosome’s fitness is higher than a given value δ in popi , the corresponding chromosome is submitted to vaccine bank, and when the size of vaccine bank has been reached, the chromosome being submitted will replace the one with the lowest fitness in the bank. STEP 3 After each sub-population is calculated in sequence, judging the present generation, if it’s greater than the maximum generation, then end the process, else n = n + 1 , and go to step 2. STEP 4 According to Theorem 1, the best chromosome obtained above is transformed into the bracket-including OKM multiple set operation expression with the highest function-satisfaction degree.
3 Optimization of Advanced Manufacturing Modes Given below is the procedure of advanced manufacturing mode optimization. PROCEDURE 1: The steps of optimization of advanced manufacturing modes STEP 1 The user’s function requirements are layered by modules and sub-modules to facilitate the evaluation and management. STEP 2 The existing advanced manufacturing modes are represented as OKM and ITRMs according to the representation approach. And according to the user’s requirement, other OKMs with complementary functions are selected from the base. STEP 3 Intensive selection is to select the OKMs satisfying the user’s function requirements from the OKMs selected preliminarily in STEP 2. The layer structure is adopted to evaluate the OKM functions, and the first two OKMs with the top evaluation of function i are selected for i = 1,L , n . STEP 4 The OKMs selected through STEP 3 are evaluated and the functionsatisfaction degree vectors for the OKMs are obtained by fuzzy evaluation methods.
102
C. Xue and H. Cao
STEP 5 The OKM multiple set operation expression is optimized by ALGORITHM 1. The chromosome with the best fitness vector and the OKM multiple set operation expression with the highest function-satisfaction degree is then obtained. STEP 6 A new OKM can be inferred from the step 5-obtained OKM multiple set operation expression with the highest function-satisfaction degree by the developed OKM-based inference engine so as to realize the reconfiguration of the OKM. STEP 7 The new OKM and its ITRMs are mapped into the new advanced manufacturing mode, and the optimized manufacturing mode is obtained.
4 Examples Following the steps in optimization of an advanced manufacturing mode, a simple example is given to show the optimization process. The user requirements are first transformed into layer structure according to step 1 of Procedure 1, as shown in Fig. 2. Production management Equipment management Material management
Function requirement of an enterprise
Quality management technic management Financial management Tool management
Production plan & schedule Production control Production record Equipment files Repair and maintenance Earlier stage management Equipment pre-check Bill management Part management Plate management Labor protection management Metering management Quality inspection Quality information Product route Product process Process change In-tally report Credence management Purchase audit Detailed tooling cost Detailed account Tooling historical card Process equipment list
Fig. 2. Function requirement layering
The OKMs corresponding to advanced manufacturing mode are represented according to step 2 of Procedure 1. Suppose that the OKMs are : 1 , : 2 , and they are conducted the union operation. Then they will be taken as operands of an OKM multiple set operation expression during the evaluation process. Following step 3 and step 4 of Procedure 1, the OKMs are evaluated and the function-satisfaction degree vectors for the OKMs are obtained. The final functionsatisfaction degree and the multiple function-satisfaction degree for OKM : 1 are T
⎛ ⎞ h1L = w L ⎜ H1 ⎟ = ( 0,0,0.6594,0, 0.6857, 0, 0.6535 ) ⎝ ~ ⎠
, (h )
L * w1
= ( 0, 0,1, 0,1, 0,1) .
Optimization and Reconfiguration of Advanced Manufacturing Mode
In the same way, other OKMs : 2 , : T
3
and :
4
103
are evaluated as follows.
h2L = w L ⎛⎜ H 2 ⎞⎟ = ( 0.832,0, 0, 0.642, 0,0.71, 0.538 ) ⎝ ~ ⎠
, (h )
L * w2
= (1, 0, 0,1,0,1,1) .
T
, (h )
L * w3
= ( 0,1,0,1,1, 0,1) ..
T
, (h )
= (1, 0,1,1,0,1, 0 ) .
⎛ ⎞ h3L = w L ⎜ H 3 ⎟ = ( 0,0.751, 0, 0.542,0.496,0, 0.816 ) ⎝ ~ ⎠ ⎛ ⎞ h4L = w L ⎜ H 4 ⎟ = ( 0.685, 0,0.579, 0.785, 0, 0.573,0 ) ⎝ ~ ⎠
L * w4
Following step 5 of Procedure 1, the best OKM multiple set operation expression is (( M 2 - ( M1 + M 3 )) + M 0 ) - M 3 , with best fitness vector {0.832, 0.751, 0.6594, 0.785, 0.6857, 0.71, 0.816}. We can see that after the reconfiguration of OKM, user satisfaction degree is improved compared with the original OKMs, because functions are more richened.
5 Conclusions The optimization of advanced manufacturing modes is studied based on OKM and IGA. Based on the user function requirements of OKM and the optimization of the OKM multiple set expressions, optimization problem of advanced manufacturing modes aiming at maximum user satisfaction is solved. As is verified, the method proposed can help the enterprise select the optimal combination of advanced manufacturing modes or the best mode for operation. Acknowledgments. This work is supported by National Natural Science Foundation of China Grant #70971119, #70901066 and Aviation Science Foundation of China Grant #2008ZG55020.
References 1. 2.
3. 4. 5.
Yan, H.S.: A new complicated-knowledge representation approach based on knowledge meshes. IEEE Transactions on Knowledge and Data Engineering 18, 47–62 (2006) Xue, C.G., Cao, H.W.: Formal representation approach to enterprise information system based on object knowledge mesh. In: 2008 Chinese Control and Decision Conference (2008) Cao, H.W., Xue, C.G.: A Study on reconfiguration of enterprise information system based on OKM. In: The 8th World Congress on Intelligent Control and Automation (2010) Yager, R.R.: Fuzzy modeling for intelligent decision making under uncertainty. IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics 30, 60–70 (2000) Xue, C.G., Cao, H.W.: Evaluation and Decision Making on Advanced Manufacturing Modes Based on Object-based Knowledge Mesh and User Satisfaction (in press)
Modeling and Simulation of Water Allocation System Based on Simulated Annealing Hybrid Genetic Algorithm Jiulong Zhu1 and Shijun Wang2 1
Zhongyuan University of Technology, 450007 Zhengzhou, China 2 HoHai University, 210098 Nanjing, China
[email protected]
Abstract. Presently water resource in most watersheds in China is distributed in terms of administrative instructions. This kind of allocation method has many disadvantages and hampers the instructional effect of market mechanism on water allocation. The paper studies South-to-North Water Transfer Project and discusses water allocation of the node lakes along the Project. Firstly, it advanced four assumptions. Secondly, it analyzed constraint conditions of water allocation in terms of present state of water allocation in China. Thirdly, it established a goal model of water allocation and set up a systematic model from the angle of comprehensive profits of water utilization and profits of the node lakes. Fourthly, it discussed calculation method of the model by means of Simulated Annealing Hybrid Genetic Algorithm (SHGA). Finally, it validated the rationality and validity of the model by a simulation testing. Keywords: water; allocation system; simulated hybrid genetic algorithm (SHGA); modeling.
1 Introduction By transferring water from upstream, midstream and downstream areas of the Changjiang River to North China, three transferring lines of South-to-North Water Transfer Project come into being [1,2]. At the same time, by connecting the Changjiang River, the Huaihe, the Yellow River and the Haihe River, total structure of water in China is formed. The construction of the first stage of eastern route has begun and how to allocate water reasonably and effectively causes public concern. To simplify research, we choose a simple node lake as object and discuss water allocation by means of product distribution theory [3,4]. In order to develop research, the following assumptions have been made: (1) Suppose water consumed to maintain ecological environments in areas around the node lake is provided by the Project and priority-of-guarantee principle is followed. (2) Suppose the distribution of water for residential living use follows population distribution pattern and water buying price is the same when the node lake allocates water. (3) When the node lake allocates water for other uses, idea and competitive mechanism of supply chain management (SCM) is used and water is distributed according to operational mode of quasi-market economy. (4) The conflict between the lake and node districts is solved by consultation, which is illustrated in [4]. R. Chen (Ed.): ICICIS 2011, Part II, CCIS 135, pp. 104–109, 2011. © Springer-Verlag Berlin Heidelberg 2011
Modeling and Simulation of Water Allocation System Based on SHGA
105
2 Water Allocation Model 2.1 Constraint Conditions The first condition is survival constraint condition which mainly refers that the living of the residents within the areas along the Project must be solved firstly during the process of water allocation. Survival constraint condition is defined as: Qis≥Kibi .
(1)
Where Qis denotes water quantity for living use allocated to the ith district, Ki denotes total population of the ith district, bi denotes per capita water shortage quantity for living use, n is the number of node districts. The second constraint condition is total water resource which is defined as:
∑ (Q n
i =1
is
+ Q ig + Q in + Q it ) ≤ Q .
(2)
Where Q is allocable water amount in the node lake, Qig, Qin, Qit are water quantities allocated to the ith district for industrial, agricultural and ecological uses. The third constraint condition is water demand ability which is defined as: Qis+Qig+Qin+Qit≤Qi max .
(3)
Qis+Qig+Qin+Qit≥Qi min .
(4)
Where Qi max and Qi min are maximum and minimum water shortage quantity in the ith district. The fourth constraint condition is development coordination degree. The paper introduces market operation mechanism into water allocation of the Project. According to [5], constraint of development coordination degree is defined as:
Ξ B1 (ℑ1 )Ξ B2 (ℑ 2 ) ≥ Ξ ∗ . n
Where
1
∑z
i 1
i
,
i 1
(5)
2 Qis Qig Qin Qit Qimin Qimax ,
i 1
B1
1
⎧ 1 ⎨ ⎩exp 4 1
n
2
∑z
i
i 2
,
2
.
i 1
1
,
1 2 1
1
i 2
!i !i0 "i2 "i20 ,
B2
2
exp 4
2
1
B1 is a fuzzy subset of coordination degree between water utilization and economic development, B2 is a fuzzy subset of coordination degree between economic development and environmental improvement, Ξ B1 (ℑ1 ) and Ξ B2 (ℑ 2 ) are membership
ℑ1∗ and ℑ∗2 are optimal ratios, Ξ* is optimal coori dination degree, zi is the ratio of the ith district and zi=1/n, and h is economic growth i i indexes during baseline period and planning period respectively, l 20 and l 2 are functions of coordination degree,
values of environmental improvement of the ith district during baseline period and planning period respectively.
106
J. Zhu and S. Wang
The fifth condition is constraint of water quantity for ecological use. According to the principle of guaranteeing water quantity, this constraint condition is: Qis≥Qismin .
(6)
Where Qismin denotes minimum water shortage quantity for ecological use in the ith district. The sixth condition is non-negative constraint of parameters, so there is: Qis≥0, Qig≥0, Qin≥0, Qit≥0 .
(7)
2.2 Objective Function The goals include comprehensive water utilization and income of the lake. The first goal is comprehensive water utilization. Comprehensive benefit of water utilization includes economic, environmental and social benefits. The paper only discusses economic benefits of water utilization which includes industrial and agricultural production benefits, living benefit and ecological benefit. This goal is defined as: n n n ⎧ n ⎫ f1 (Q ) = Max ⎨∑ eis Qis + ∑ eig Qig + ∑ ein Qin + ∑ eit Qit ⎬ . i =1 i =1 i =1 ⎩ i =1 ⎭
(8)
Where eis, eig, ein, eit is net benefit coefficient of water for living use, for industrial use, for agricultural use and for ecological use in the ith district respectively, n is the number of node districts. The second goal is income of the lake. According to [4,5], each node lake is an independent legal entity and plays the role of distributing water resource. Therefore, the goal of the node lake includes not only maximizing comprehensive benefit of water utilization but maximizing incomes of the node lake. Income goal of the lake is: n ⎫ ⎧ n p Q + ⎪ ∑ s is ∑ p i (Q ig + Q in + Q it )⎪ ⎪ . ⎪ i =1 i =1 f 2 (Q ) = max ⎨ ⎬ n ⎪ ⎪− C ( ) Q Q Q Q + + + c∑ is ig in it ⎪⎭ ⎪⎩ i =1
(9)
Where ps is price of water for living use. According to [4], water price for all districts is the same. In (8), ps is price of water resource for other uses expect living use and price information to all districts is asymmetrical, Cc is unit water cost.
3 Solving Method of the Model In this paper, the solving of the model includes the solving of net benefit coefficient of water utilization and the holistic model. Solving method of the former refers to [5]. This paper only discusses solving method of the latter. Based on [3], this paper adopts Simulated Annealing Hybrid Genetic Algorithm (SHGA) method to solve the model. SHGA mainly includes the following steps:
Modeling and Simulation of Water Allocation System Based on SHGA
107
The first step is encoding and decoding method. In the above model, there are many continuous variables and value ranges of the variables are broad. To improve operational efficiency and accuracy of solutions of SHGA method, we use decimal floating point number to encode tenderly [6,7]. Value ranges of continuous variables are divided into n aliquots and each genic value of chromosomes is denoted by the integers in [1,n+1]. Each variable is encoded according to floating point number. Transformation equation from genic value JYi to true value JCij of genic value of chromosome is as follows:
Where
[JC
[
(
)]
JYij = Qij min + (JYi −1) JCij max − JCij min n . k ij max
]
(10)
, JCijk min is value range of JCij.
The second step is construction of fitness degree function. This paper uses exactly non-differentiable penalty function to deal with constraint conditions: m1 + m2 ⎧ m1 ⎫ + ( ) S JM min (0, S i ( JM )) ⎪ ∑ ⎪∑ i i = m1 +1 ⎪ i =1 ⎪ . G ( JM ) = g ( JM ) ± ς 1 ⎨ m + m + m ⎬ 1 2 3 ⎪+ ⎪ max (0, S i ( JM )) ⎪ i = m∑ ⎪ ⎩ ⎭ 1 + m 2 +1
(11)
Where JM is decision variable after encoding, G(JM) is fitness degree, g(JM) is goal function. If the goal is a minimum one, g(JM) is negative; if the goal is a maximum one, g(JM) is positive. ζ1 is penalty factor, m1, m2 and m3 are the number of constraint conditions of “=”, “≥,>” and ““≤,0.8, which shows that the coordination extent between economic development and environmental improvement in areas around the lake. Thirdly, not all water resources in the node lake are distributed, because the lake must hold some buffer water. This is the reason why allocable water quantity is less than 2×108m3 in the case study. Acknowledgments. This work is supported by Ministry of Education of China (Human Social Science Fund, No.09YJC790069), Decision Bidding Project of Henan
Modeling and Simulation of Water Allocation System Based on SHGA
109
Government (No.B794)(No.B795), Technology Research and Development Project of Zhengzhou Science and Technology Bureau (No.0910SGYG25230-5).
References 1. 2.
3. 4.
5. 6.
7.
Hu, J.L., Ge, Y.X.: Research on the Water Distribute Mode and Harmonized System of Huanghe River. Management World 20, 43–53 (2004) (in Chinese) Zhou, L., Huang, Z.H.: Hybrid Genetic Algorithm for the Multi-objective Nonlinear Water Resources Optimization Model. Water Resources and Power 23, 22–26 (2005) (in Chinese) Zhao, J.S., Wang, J.Z.: Theory and Model of Water Resources Complex Adaptive Allocation System. Acta Geographica Sinica 69, 39–48 (2002) (in Chinese) Huang, F.: Optimal Operation Model for Lagerge-Scale Water Resources System Having Multiple Resources and Multiple Users. Journal of Hydraulic 47, 91–96 (2002) (in Chinese) Li, X.P.: Research Review on Water Configuration. Haihe Water Resource 21, 13–15 (2002) (in Chinese) Ren, C.X., Zhang, H., Fan, Y.Z.: Optimizing Dispatching of Public Transit Vehicles Using Genetic Simulated Annealing Algorithm. Journal of System Simulation 17, 40–44 (2005) (in Chinese) Wen, P.C., Xu, X.D., He, X.G.: Parallel Genetic Algorithm/Simulated Annealing Hybrid Algorithm and Its Applications. Computer Science 30, 21–25 (2003) (in Chinese)
Study on Feed-Forward MAP-Based Vector Control Method of Vehicle Drive Motor Yafu Zhou1, Xiaoyong Shen1, Jing Lian1, Xinhan Sun1, Jun Li2, Minghui Liu2, and Ziliang Zhao2 1
School of Automotive Engineering, Faculty of Vehicle Engineering and Mechanics, State Key Laboratory of Structural Analysis for Industrial Equipment, Dalian University of Technology, Dalian, 116024, P.R. China 2 China FAW Group Corporation R&D Center, Changchun, 130033, P.R. China
Abstract. Contraposing to the shortage of narrow efficient area and over current when vector control method is applied to vehicle drive motors, this paper proposes a feed-forward MAP-based vector control method of vehicle drive motor. According to required motor torque and speed, directly control the magnitude and direction of voltage space vector to realize the aim of motor torque control. So, the calculation of torque current component and field current component is no need, which not only avoids over current that the PID closed-loop control leads to, improving the reliability of controller, but also avoids the dependence on current measurement, improving control precision and motor efficiency. Finally, simulation results and motor bench test prove this method can significantly enlarge efficient area, and it is suitable for vehicle running conditions. Keywords: MAP-based; vector control; drive motor.
1 Introduction With the increase of automobile yield and quantities existed, increasingly pressure on oil demand and environment protection forces the global vehicle industry to seek new energy-saving power system, which accelerates the research progress of electric vehicle technology [1]. Nowadays, many technical problems still need to be solved, one of which is to seek for an efficient and reliable motor control method that is suitable for drive motor operating characteristics [2]. Vector control and direct torque control are two kinds of vehicle drive motor control methods widely used [3]. Vector control is a feed-back loop control. Obtain torque current component and magnetic current component by coordinating transform based on measuring the three-phase current, then carry out PID control according to the deviation between actual current component and demand current component to adjust voltage output vector to control motors [4,5]. However, because the integral link in PID control is hard to meet the rapid response, over current phenomena is inevitable, which will shorten the life of IGBT in motor controller [6]. In addition, current sensor’s measuring error is relatively bigger under small current operating R. Chen (Ed.): ICICIS 2011, Part II, CCIS 135, pp. 110–115, 2011. © Springer-Verlag Berlin Heidelberg 2011
Study on Feed-Forward MAP-Based Vector Control Method of Vehicle Drive Motor
111
condition, so the motor control performance is poor [7].Direct torque control uses the hysteresis control and switch choice list to control the power inverter to output reasonable voltage vector through observation on motor torque and stator flux to realize the purpose of stator flux linkage and torque control [8]. But the effect of coupling is needed to eliminate during magnetic flux control, so the decoupling model is necessary [9]. And because of obvious current and torque ripple, its dynamic response characteristic is poor [10]. Thus, this paper proposes an improved feed-forward MAP-based vector control method of vehicle drive motor. Directly control the magnitude and direction of voltage space vector to realize the magnetic directional control according to the demand torque and speed. Not only avoid current over caused by closed-loop control, but also avoid the dependence on current measurements, which improves the control precision and efficiency.
2 Control Principle and Process Motor vector control coordinate is shown as in figure1, in which α - β is static coordinate, d-q is synchronous rotation coordinate, U is voltage space vector amplitude, θ is voltage vector phase earlier than q axis, ϕ is rotor machine angle position. During the operating process, d-q coordinate synchronously rotates with the rotor. The magnitude and direction of magnetic field can be controlled by changing voltage amplitude U and phase θ .
q
E
U
d
T
M
D
Fig. 1. Motor vector control coordinate
Drive motor control system includes speed and angle position sensor, motor control three-dimensional MAP inquiring module, space voltage vector PWM module, inverter module, battery and motor, shown as in figure 2, in which T* is command torque, n* is motor speed, U* is optimal voltage amplitude, θ * is optimal voltage phase, ϕ * is rotor machine angle position. First, through calibration experiment form the optimal motor control threedimensional MAP which is stored in motor control program in format of tables. Second, MAP inquiring module builds curved surface differential model, Third, optimal voltage amplitude U*and optimal voltage phase θ * can be obtained by curved surface differential calculation according to T*, n* and parameters in each vertex of the model.
112
Y. Zhou et al.
Last, space voltage vector PWM module gives voltage vector phase θ *+ ϕ *+90° under α - β coordinate, according to θ *and ϕ *. Then produces six PWM control signals to control inverter module to work. battery
T*
motor control threedimensional MAP inquiring module
n*
U*
T*
space voltage vector PWM module
PWM control signals inverter module
motor
M* speed and angle position sensor
Fig. 2. Principle diagram of drive motor control system
3 Simulation Analysis Feed-forward MAP-based vector control simulation model for permanent magnet synchronous motor is built under Simulink, shown in figure 3. The model mainly includes permanent magnet synchronous motor module, inverter module, MAP inquiring module, space voltage vector PWM module, speed and position detection module, etc. MAP inquiring module is used for giving the optimal voltage and phase; space voltage vector PWM module is used for producing six PWM control signals.
Fig. 3. Simulation model
Simulation experiment is carried out under the model. Experimental conditions are as follows: initial speed is 700rpm, initial load is 6Nm, and load suddenly drops to 2Nm at 0.04s. Speed curve and torque curve are respectively shown in figure 4 and 5. Speed increases rapidly at first, and becomes maximum value 730rpm at 0.005. Then fluctuates around 700rpm, and quickly steady at 700rpm at 0.23s. In the case of load reduction suddenly at 0.04s, speed fluctuates, but soon stabilizes at 700rpm. Torque fluctuates greatly at first, and peak value is 33Nm. Soon it stabilizes at 6Nm at 0.23s. In the case of load reduction suddenly at 0.04s, torque fluctuates, but soon stabilizes at 2Nm. From simulation results we can see that the system has good speed and torque control performance.
Study on Feed-Forward MAP-Based Vector Control Method of Vehicle Drive Motor
Fig. 4. Speed curve
113
Fig. 5. Torque curve
4 Experiment Analysis 4.1 Drive Motor Experiment Platform Building In order to further verify the feasibility of vehicle drive motor control method and indepth study motor control method and calibration method, we build drive motor experiment platform. Figure 6 is experimental platform system diagram, in which 1 is host-computer, 2 is battery, 3 is power analyzer, 4 is on-line battery charger, 5 is eddy current dynamometer, 6 is bench, 7 is the tested motor, 8 is the tested motor controller, 9 is cooling system, 10 is CAN communication transceiver, 11 is dynamometer controller. The actual experimental platform is shown in figure 7.
Fig. 6. Experiment platform system
Fig. 7. Picture of experiment platform
4.2 Experimental Results and Analysis Motor calibration experiment, motor efficiency experiment and generator efficiency experiment are carried out under the built experimental platform. Motor Calibration Experiment. Motor parameters are very important to control performance. But the calculated parameters during motor design process often drift from the actual value as a result of material parameter errors, ignoring secondary
114
Y. Zhou et al.
factor, environmental temperature’s changing, machining precision influence, etc. Thus, motor calibration experiment has to be taken under different cycle conditions to form the optimal motor control three-dimensional MAP before high-performance motor control. Motor calibration experiment data are shown in Table 1. From the data we can find that motor efficiency at the same motor operating point is different with different voltage amplitude and angle, which is not considered by traditional motor control methods. If select optimal voltage amplitude and phase which obtain the highest efficiency at each motor operating point to form motor control MAP, then carry out motor control based on the MAP, advantages can be fully exerted and the highest efficiency can be obtained. Table 1. Motor MAP calibration experiment data Number Speed/r Torque/ Angle/° pm Nm
1 2 3 4 5 6 7
2048 2048 2048 2048 2048 2048 2048
48 48 48 48 48 48 48
26 27 29 30 31 32 33
Amplitude /V
Efficiency
158 156 154 152 149 147 144
0.89 0.90 0.89 0.89 0.88 0.87 0.87
Motor Efficiency and Generator Efficiency Experiment. Motor efficiency can be calculated by measuring motor’s input voltage, input current, output speed, output torque at each motor operating point on n-T map. The motor efficiency threedimensional surface is shown in figure 8. When the motor runs as a generator, generator efficiency can be calculated by measuring generator’s input speed, input torque, output voltage, output current at each motor operating point. The generator efficiency three-dimensional surface is shown in figure 9.
Fig. 8. Motor efficiency graphic
Fig. 9. Generator efficiency graphic
Study on Feed-Forward MAP-Based Vector Control Method of Vehicle Drive Motor
115
What can be seen from figures above is motor efficient area is enlarged, up to 80%, which can meet the demand of keeping high efficiency during large speed and torque range for vehicle drive motors.
5 Conclusions This paper studies MAP-based feed-forward vector control method deeply which is suitable for vehicle drive motor. Motor efficiency at the same motor operating point is different with different voltage amplitude and angle, so it is possible to improve motor efficiency based on MAP formed by the optimal voltage amplitude and angle. Simulation and bench experiments show that the motor control method significantly expands motors’ efficiency area. It is an efficient and reliable control method for vehicle drive motor. Acknowledgments. This project is supported by China Postdoctoral Science Foundation (20100471431) and 863 National High Technology Research and Development Program of China (2008AA11A140).
References 1. Haddoun, A., Benbouzid, M.H., Diallo, D.: A loss-minimization DTC scheme for EV induction motors. J. IEEE Transactions on Vehicular Technology 56(1), 81–88 (2007) 2. Timko, J., Zilková, J., Girovský, P.: Shaft sensorless vector control of an induction motor. J. Acta Technica CSAV (Ceskoslovensk Akademie Ved) 52(1), 81–91 (2007) 3. Kumar, R., Gupta, R.A., Bhangale, S.V.: Vector control techniques for induction motor drive: A review. J. International Journal of Automation and Control 3(4), 284–306 (2009) 4. Nait Seghir, A., Boucherit, M.S.: A new neural network based approach for speed control of PM synchronous motor. J. WSEAS Transactions on Circuits and Systems 6(1), 87–93 (2007) 5. Badsi, B., Masmoudi, A.: DTC of an FSTPI-fed induction motor drive with extended speed range. J. COMPEL - The International Journal for Computation and Mathematics in Electrical and Electronic Engineering 27(5), 1110–1127 (2008) 6. Vaez-Zadeh, S., Jalali, E.: Combined vector control and direct torque control method for high performance induction motor drives. J. Energy Conversion and Management 48(12), 3095–3101 (2007) 7. Trentin, A., Zanchetta, P., Gerada, C.: Optimized commissioning method for enhanced vector control of high-power induction motor drives. J. IEEE Transactions on Industrial Electronics 56(5), 1708–1717 (2009) 8. Kadjoudj, M., Taibi, S., Benbouzid, M.E.H.: Permanent-magnet-synchronous-motor speed control using fuzzy adaptive controller. J. Advances in Modeling and Analysis C 62(3-4), 43–55 (2007) 9. Vavrus, V., Vittek, J., Malek, M.: Velocity vector control of a linear permanent magnet synchronous motor. J. Komunikacie 9(4), 14–19 (2007) 10. Singh, B., Jain, P., Mittal, A.P.: Sensorless DTC IM drive for an EV propulsion system using a neural network. J. International Journal of Electric and Hybrid Vehicles 1(4), 403– 423 (2008)
Condition Monitoring and Fault Diagnosis of Wet-Shift Clutch Transmission Based on Multi-technology* Man Chen1, Liyong Wang2, and Biao Ma1 1
School of mechanical and vehicle engineering, Beijing Institute of Technology, Beijing 100081, China 2 School of Mechanical & Electrical engineering, Beijing Information Science & Technology University, Beijing 100192, China
Abstract. Based on the construction feature and operating principle of the wet-shift clutch transmission, the condition monitoring and fault diagnosis for the transmission of the tracklayer with wet-shift clutch were implemented with using the oil analysis technology, function parameter test method and vibration analysis technology. The new fault diagnosis methods were proposed, which are to build the gray modeling with the oil analysis data, and to test the function parameter of the clutch press, the rotate speed of each gear, the oil press of the steer system and lubrication system and the hydraulic torque converter. It’s validated that the representative function signals were chosen to execute the condition monitoring analysis, when the fault symptoms were found, and the oil analysis data were used to apply the gray modeling to forecast the fault occurs time can satisfy the demand of the condition monitoring and fault diagnosis for the transmission regular work. Keywords: Wet-shift Clutch, Transmission, Oil analysis, Condition Monitoring, Fault Diagnosis.
1 Introduction At present, wet shift clutch transmission is widely used in tracked armored vehicle and engineering machinery industry. This transmission device is also called wet-shift clutch transmission which is with a compact structure, a high transmission efficiency, and is easy to operate, However, to test and control the running state of the transmission quickly has been the most important issue that is imperative to be solve, which is also the key for ensuring the riding quality of the transmission and insuring to launch the maintenance in time[1].
,
*
This work were supported by national natural science foundation under Grant No. 50975020 and Key Laboratory foundation of BeiJing under Grant No. KF20091123205.
R. Chen (Ed.): ICICIS 2011, Part II, CCIS 135, pp. 116–123, 2011. © Springer-Verlag Berlin Heidelberg 2011
Condition Monitoring and Fault Diagnosis of Wet-Shift Clutch Transmission
117
1.1 Structural Principle of Wet-Shift Clutch Transmission Wet-shift clutch transmission mainly consists of non-stop speed-change mechanism and hydraulic steering mechanism. Non-stop mechanism includes six wet shift clutches and several gear pairs. Clutches are respectively placed on I axis and III axis, power is input from I axis, transmitted through II axis, and output from III axis, and the combination of clutches can shape several forward gears and reverse gears[2]. The construction features of the straight drive shift and steering equipment of the transmission of the tracklayer with wet-shift clutch are introduced firstly, as shown in Fig.1.
Fig. 1. Structural Principle Diagram of A Transmission Device
1.2 Hydraulic Lubrication System of Wet-Shift Steering Transmission The hydraulic lubrication system is an import part of wet-shift steering transmission, it mainly completes the following functions: (1) provide compensatory oil for hydraulic torque converter to transmit the power. (2) provide control oil for the transmission manipulation system of the transmission device. (3) provide cutting oil for cooling and friction elements and lubrication transmission clutch’s friction plates. (4) provide pressure oils for steering pump motors. See Figure 2 for the sketch map of oil circulation of hydraulic lubrication system.
118
M. Chen, L. Wang, and B. Ma
Fig. 2. Sketch Map of Hydraulic Lubrication System of Power-shift steering transmission
A shown in Figure 2, oil is mainly divided into three circulating subsystems: (1) hydraulic torque converter’s hydraulic transmission oil, radiator oil, and transmission lubrication oil; (2) transmission clutch control oil and transmission lubrication oil; (3) hydraulic pump motor system’s steering power flow transmission force oil and bearing lubrication and cooling oil. Three oil circulating systems above have different flows and pressure changes. The working process of Hydraulic lubrication system was analyzed in this paper, and pointed out that the oil analysis technology plays an important role in wet-shift clutch transmission wear site and process monitoring, wear failure type and wear mechanism studying, and oil evaluation; besides, it is an important means to perform condition monitoring and fault diagnosis on mechanical equipment without stopping and disassembling[3].
2 Fault Diagnose Method of Wet-Shift Clutch Transmission The method and steps of condition monitoring and fault diagnosis for the transmission of the tracklayer with wet-shift clutch with using the oil analysis technology, function parameter test method and vibration analysis technology were introduced, as shown in Fig.3. As show in fig.3, function parameter test , oil analysis and vibration test were used to monitoring wet-shift clutch trans- mission, and function parameter test is intuitive and high efficiency, but there are many kinds of function parameters of wet-shift clutch transmission, and it is impossible to test all the parameter. So it is very important to
Condition Monitoring and Fault Diagnosis of Wet-Shift Clutch Transmission
119
Fig. 3. Schematic drawing for state monitoring and fault diagnosis of wet-shift clutch transmission
chose representative signals to test. Because faults symptom can be catch by using oil analysis, so it is another efficiency method to monitor- ring and diagnose transmission fault. Vibration monitoring is the third method in transmission state monitoring, but because the influence of running, it is difficult to test and analysis the vibration of wet-shift clutch transmission, so vibration monitoring is only the supplementary means.
120
M. Chen, L. Wang, and B. Ma
3 Gray Modeling Fault Diagnose Based on Oil Analysis In this study, considering the finiteness of the data quantity and the randomness of the variety of the sample[4], the gray theory was selected to forecast the wear extent and the select method and modeling steps of the GM(1,1) gray modeling with using the oil analysis data was proposed, as shown in Fig.4.
Fig. 4. the gray modeling steps for fault diagnose by oil analysis data
As show in fig.4, as to the sampled data with unequal distance, judge whether the oil data and sampled data collected from each sensor meet the scale requirements. If not, judge again after calculating the logarithm of concentration of elements in oil and other data. If it meets the scale condition, continue to judge whether it meets the sampling
(
interval for modeling PD[ ΔW N scale condition is
:
)
(
N
. Δt k is the sampling interval. The
⎛ − ⎞ Q + Q + ⎟ ⎜ and δ is scale function, n is the δ (N ) ∈ H H ⎜ ⎟ ⎝ ⎠
,
number of sampled data. When it meets the
(
) PLQ(ΔW ) <
)
sampling
interval
requirements
for
modeling:
PD[ ΔW N PLQ ΔW N < , build the gray model through the difference quotient method. If it doesn’t meet the modeling condition, sampling intervals shall be optimized.
Condition Monitoring and Fault Diagnosis of Wet-Shift Clutch Transmission
121
After the optimization of sampling intervals, it should to judge whether the sampling rule is smooth or not. If it is, the model shall be built as per grey modeling in time-sequence fitting method. If there is data fluctuation, the grey model shall be built through the improved time-sequence fitting method based on the wear curve. After the grey model is built through the difference quotient method, time-sequence fitting method and time-sequence fitting method based on the wear curve, the fitting precision shall be checked. If it passes the check, grey prediction could proceed. If it doesn’t pass the check, it shall be remodeled by changing the modeling dimension until it meets the requirements for fitting precision.
4 Fault Diagnose Based on Function Parameter The test parameters for transmission in this study mainly include: control oil press, shift clutch press, rotate speed of each axis, oil system of the steering system and the hydraulic torque converter. The sequence and method to test each parameter were demonstrated as shown in Fig.5. As show in fig.5, check firstly the gear transmission pressure based on signals of control pressure provided by the front pump of gearbox, the pressure of gear shift clutch and lockup clutch. If the pressure of clutches at gears being tested is normal, determine the gear of existing gearbox. In case of any anomaly, record the amplitude of abnormal signals to indicate the anomaly of the existing gear. When the existing gear is determined, convert and display the current input of revolution speed and car speed based on the input revolution speed and three-axis revolution speed collected; calculate the transmission ratio of current gearbox based on the input and output revolution speed. If the calculated transmission ratio equals to that for this gear, it indicates “normal state” for the current gear. If the calculated transmission ratio doesn’t equal to that for this gear, it will diagnose and find the specific position for the faulty position and display the diagnostic result. After the current gear is displayed, check the pressure of the hydraulic circuit at the high-pressure outlet and low-pressure inlet of the steering system. If the pressure of the high/low-pressure hydraulic circuit is within the normal ranges, it will indicate “normal pressure” for the steering system. If the pressure of the high/low-pressure hydraulic circuit exceeds the range of technical indexes, it will record and indicate the faulty position and specific value. After the steering system is detected as normal, check whether the lubrication pressure in the gearbox’s lubrication system is normal, measure mainly the lubrication pressure at first, second and third transmission shafts. If the lubrication pressure of each shaft is within the range of normal technical indexes, it will indicate “normal lubrication pressure” for the corresponding shaft. If the lubrication pressure at each shaft exceeds the range of technical indexes, it will record and indicate the faulty position and specific value. The gearbox’s temperature sensor is installed inside the lubrication system’s hydraulic circuit. Before detecting the lubrication system’s pressure, the diagnosis system will display the gearbox’s temperature.
122
M. Chen, L. Wang, and B. Ma
Fig. 5. Test method for each function parameter
After the lubrication system is detected as normal, the hydraulic pressure at inlet and outlet of the hydraulic torque converter is detected. If the pressure difference between inlet and outlet of the torque converter is within the range of normal technical indexes,
Condition Monitoring and Fault Diagnosis of Wet-Shift Clutch Transmission
123
it will indicate “normal pressure” for the hydraulic torque converter. If the pressure exceeds the range of technical indexes, it will record and indicate the faulty position and specific value. At last, store signals and faulty messages collected, generate inspection report and print.
5 Conclusions In this study, it’s indicated that the oil analysis and function parameter are the mainly methods for wet-shift clutch transmission condition monitoring, and the vibration analysis is the assistant method. It’s validated that the representative function signals were chosen to execute the condition monitoring analysis, when the fault symptoms were found, and the oil analysis data were used to apply the gray modeling to forecast the fault occurs time can satisfy the demand of the condition monitoring and fault diagnosis for the transmission regular work.
References [1]
[2]
[3] [4]
Wang, L., Ma, B., Zheng, C., et al.: A Study on Running-in Quality Evaluation Method of Power-shift Steering Transmission based on Oil Monitoring. Lubrication Engineering 7(33), 35–38 (2008) Li, H.-y., Wang. L.-y.: A Study on no-load Running-in Wear of Power-shift Steering Transmission based on Spectrum Analysis Ma Biao. Spectroscopy and Spectral Analysis 29(4), 1013–1016 (2009) Wang, L., Ma, B., Li, H., et al.: A Study on Running-in QualityEvaluation Method of Power-shift. Steering Transmission based on Performance Parameter 3(33), 86–88 (2008) Deng, J.: Grey control system, Wu Han. Huazhong Institute of Technology Publisher, Chinia (1985)
Circulant Graph Modeling Deterministic Small-World Networks Chenggui Zhao* School of Information, Yunnan University of Finance and Economics, Kunming, 650221, China
[email protected]
Abstract. In recent years, many research works have revealed some technological networks including internet to be small-world networks, which is attracting attention from computer scientists. One can decide if or not a real network is Small-world by whether it has high local clustering and small average path distance which are the two distinguishing characteristics of small-world networks. So far, researchers have presented many small-world models by dynamically evolving a deterministic network into a small world one by stochastic adding vertices and edges to original networks. Rather few works focused on deterministic models. In this paper, as a important kind of Cayley graph, the circulant graph is proposed as models of deterministic small-world networks, thinking if its simple structures and significant adaptability. It shows circulant graph constructed in this document takes on the two expected characteristics of small word. This work should be useful because circulant graph has serviced as some models of communication and computer networks. The small world characteristic will be helpful to design and analysis of structure and performance. Keywords: Circulant graph, small-world networks, clustering coefficient average path length.
1 Introduction The research on small world networks has received a number of literatures in recent years. In 1998, Watts and Strogatz [3] called those real networks with phenomenon of six degrees of separation as small world networks. They described some stochastic models of small-world networks. These models have clustering coefficients much larger than those of random networks, but a small average path length. Some regular networks have large clustering coefficient and large average path length, while the random networks with the same size and average node degree have much smaller clustering coefficient and average path length. D.J. Watts et al. randomly rewire the edges with probability p on regular network such as a loop network to construct small world network such that average path length dramatically decrease as p increases but the clustering coefficient decreases slowly. *
Corresponding author.
R. Chen (Ed.): ICICIS 2011, Part II, CCIS 135, pp. 124–127, 2011. © Springer-Verlag Berlin Heidelberg 2011
Circulant Graph Modeling Deterministic Small-World Networks
125
Comellas and Sampels [2] discovered that constant-degree deterministic smallworld networks are also feasible. Deterministic models for small-world networks can facilitate the understanding of their behavior. This approach also permits a direct calculation of relevant network parameters and thus allows the design of specific small-world networks for applications such as new communication systems and computer architectures. In this paper we also begin with loop network to construct a small world network called circulant graph; but we rewire edges on loop networks according to a way of construction of Cayley graph other than stochastic way used in [3]. The results show circulant graph holds characteristics of small world networks and can be adapted to model them. For simple structures as well as small-world characteristics of our construction, this model can facilitates some members of Cayley graph family to be selected as technological network models.
2 A Cayley Graph Adapted to Model Small World Networks 2.1 Basic Definitions Most of Cayley-graph have been used to design interconnection networks. The circulant graph is a important class of Caylay graph family.A digraph X=(V,E) is defined by a set V of vertices and a set E={(u,v)| u, v∈V} of arcs. The subset E is symmetric, so we can identify two opposite arcs (u, v) and (v, u) by the undirected edge (u,v). Let G be a finite group and S a subset of G. If very element of G can be expressed as a finite product of the powers of the elements in S, the subset S is said to be a generating set for G and elements of S are called generators of G, In this case, we also say that G is generated by S. Let Cay (G, S) denotes a graph with vertices that are elements of G and arcs that are ordered pairs (g, gs) for g∈G, s∈S. Cay (G, S) is called Cayley digraph of group G and the subset S, If S is a generating set of G then Cay (G, S) is called the Cayley digraph of G generated by S. If the identity 1 element of G is not include in S and -1 S=S , then Cay (G, S) is a simple and undirected graph. Unless noted otherwise, all graphs in this paper are undirected graphs. 2.2 A Special Construction of Circulant Graph Firstly, let us have a special class of Cayley graph by following definition. It has been applied to model computer networks for many years. Definition. A circulant graph X (n, S) is a Cayley graph Cay (Zn, S) on Zn where n is a power of 2. That is, it is a graph whose vertices are labelled {0, 1,…,n − 1}, with two vertices labelled i and j adjacent if and only if i − j (mod n) ∈S, where S as a subset of Zn has S = −S and 0 ∉ S. Secondly, there will be constructed a particular circulant graph by a deliberate way to select generating set S of Zn. if |n|=dt, where d is a factor of n and you can select d
126
C. Zhao
to obtain different node degree of Cay(Zn, S). Let S={1,t, 2t,…, dt}.Then Cay (Zn, S) is a cayley graph because S is clearly a generating set of Zn by noting it includes the generator 1 of Zn . Together with S =− S, It is sure Cay (Zn, S) is undirected and connected. Let symbol X substitute for Cay (Zn, S) for simplicity. Next section shows X has the Small-World characteristics: large coefficient and small average path length.
3 The Small-World characteristics of Cay (Zn, S) 3.1 Clustering Coefficient Distinctly, X is a Cayley graph of constant degree | S|=d+1. Between d+1 neighbors of node v in X, the ratio Cv of actually existing edges to possible edges is known as the clustering coefficient of node v. The average of Cv over all node v of G is the clustering coefficient C of the graph X. For the symmetry of X, It holds Cv=C such that only the clustering coefficient of identity node e need to be considered. The set of neighbors of node e is S. There exists an edge between element s1 and s2 of S if and only if s1s2− 1 is also an element of S. If H is a subset of S and H {1} becomes a group then as long as s1, s2∈H and sequentially s1s2− 1∈H node s1, and s2 will be joining. Consequentially, there are at least |H|(|H|− 1) edges existing among the neighbors of 1, which leads to X has the clustering coefficient
∪
C ≥
| H | (| H | −1) | S | (| S | −1)
(1)
Now, for circulant graph constructed in before section, let H=S −{1} then |H|=d. By (1) we have C ≥(d− 1)/(d+1). It means one can get a large C by select a large d such that resulting circulant graph becomes small-world network. 3.2 Average Path Length Obviously, the undirected Cayley Graph X(G,S) of a group G with respect to the generating set S o is a regular graph of degree d. Babai et al. proved that every group of order n has log2 n+ O(log log n) elements x1,...,xt forms a generating set of G. It follows that G has a set of log2 n+ O(log log n) generators such that the resulting Cayley graph has a logarithmic diameter. So X has average path length no lager than log2n. For a general survey on Cayley graphs with small diameters see [4].
4 Conclusion We have constructed a good model for small-world network by a simple way. It can be believed that this model will improve some designs based on circulant graph in technological network according such that they become small-world networks. On the other way, this model may also service as model of deterministic small-world network.
Circulant Graph Modeling Deterministic Small-World Networks
127
References 1. 2. 3. 4. 5.
6.
Wenjun, X., Parhami, B.: Cayley graph as models of deterministic small-world networks. Information Processing Letters 97, 115–117 (2005) Comellas, F., Sampels, M.: Deterministric small-world networks. Physica A 309, 231–235 (2002) Watts, D.J., Strogatz, S.H.: Collective dynamic of small-world networks. Nature 393, 440– 442 (1998) Heydemann, M.C., Ducourthial, B.: Cayley graphs and interconnection networks. Graph Symmetry, Algebraic Methods and Applications. NATO ASI C 497, 167–226 (1997) Xiao, W.J., Chen, W.D., Parhami, B.: On Necessary Conditions for Scale-Freedom in Complex Networks, with Applications to Computer Communication Systems. Int’l J. Systems Science (to appear) (e-publication in March 2010) Xiao, W.J., Peng, L., Parhami, B.: On General Laws of Complex Networks. In: Zhou, J. (ed.) Proc. 1st Int’l Conf. Complex Sciences, Part 1, pp. 118–124. Springer, Heidelberg (2009)
Research on Risk Manage of Power Construction Project Based on Bayesian Network Zhengyuan Jia, Zhou Fan, and Yong Li School of Business Administration, North China Electric Power University, Baoding 071003, China
[email protected],
[email protected]
Abstract. With China's changing economic structure and increasingly fierce competition in the market, the uncertainty and risk factors in the projects of electric power construction are increasingly complex, the projects will face huge risks or even fail if we don't consider or ignore these risk factors. Therefore, risk management in the projects of electric power construction plays an important role. The paper emphatically elaborated the influence of cost risk in electric power projects through study overall risk management and the behavior of individual in risk management, and introduced the Bayesian network to the project risk management. The paper obtained the order of key factors according to both scene analysis and causal analysis for effective risk management. Keywords: power construction projects; risk management; Bayesian networks.
1 Introduction Risk management of power construction project is to identify, analyze, evaluate, predict and treat effectively the risk in construction project. It must deal with the uncertain factors and reduce the cost of project, so as to finish the project security and scientific. Because of the high input and high risk, the risk management is an important part of project management, and advanced technology is must be used in project management. This article discusses the risk management of power construction projects based on Bayesian network, and carry out the quantitative management for risk management.
2 The Bayesian Network As an important probability model, Bayesian networks is proposed by professor earl J.P, the university of California in 1986. Bayesian network usually consists of two parts, the first part is the Bayesian network structure, called a directed acyclic graph (DAG directed acyclic graph). Each node of structure represents a risk event, the condition of node is corresponding to the reliability of risk events, the arc represents a causal relationship between risk events. The second part is the probability set of Bayesian networks, and each node has a conditional probability that represents the relationship with the parent node. Bayesian network is shown in Figure 1. R. Chen (Ed.): ICICIS 2011, Part II, CCIS 135, pp. 128–134, 2011. © Springer-Verlag Berlin Heidelberg 2011
Research on Risk Manage of Power Construction Project Based on Bayesian Network
129
Fig. 1. Bayesian network
Figure 1, Node E1 , E 2 ,
E 3 represent the different risk events, P ( E 3 / E1 ) and P ( E 3 / E 2 ) denote the event in the E1 and E 2 with the probability of E3 , it indicate that exist certain causal relationship among events E1 , E 2 , E 3 . Use Bayesian networks for risk management, is to take the risk events for the center, detect the probability of events based on existing data and determine the probability according to the formula.
P(e1 , e2 ,LL , e n ) = P (ei P( E k )) P (e1 , e 2 ,LL , e n ) is the probability of corresponding of (e1 , e2 ,LL , en ) , P (ek ) is the status of parent node for E k . Where,
(1) state
3 Construction of Bayesian Network for Risk Management 3.1 The Relationship between Bayesian Network and the Power Risk Management The uncertain factors is the main problem of risk management for modern electrical engineering, and because of the advantage of the Bayesian network, it is more agile and scientific. Then, as building power projects important basis for risk management models, Bayesian networks is mainly carried out based on the following points: (1)Bayesian network has a solid theoretical foundation, and its reasoning result is more acceptable. At the same time, the independencies of Bayesian network can express the relationship between power engineering project and risk. (2)There is mature software and reasoning algorithm for Bayesian network, the key is to get the value of conditional probability. Application of the Bayesian networks, the probability of reasoning algorithm of information, can be required at low under the condition of incomplete information on reasoning. (3)The expression of Bayesian network is more suitable for risk prediction. We can improve the network structure and parameters through reasoning process, and update the information of probability.
130
Z. Jia, Z. Fan, and Y. Li
3.2 Construction of Bayesian Network for Cost Management of Power Project Bayesian network construction can study and artificial construct two ways. In the training sample fully circumstance, can learn from these data structure of the network. Construction of Bayesian network can be constructed by self learning and artificial. In the case of the full training sample, you can learn network structure from the data. For risk management system, the risk is uncertain, and there have no sufficient training data, therefore, it must be personally establishment and application for Bayesian network. Constructing Bayesian Networks for risk management is divided into the following three steps: (1)Determine the contents of the node Bayesian network composed of nodes, different nodes corresponds to different risk events. Therefore, we must determine the risk event exist in project implementation process. Project manage contain nine knowledge areas: scope management, time management, cost management, human resources management, risk management, quality management, purchasing management, communication management and integrated management. For the knowledge of the importance of the project area, depth analysis should be made to analyze the impact of factors at all levels and the corresponding factors of the properties, but little impact on project implementation to run the knowledge, can be used for shallow analysis. The hierarchical structure refers to a field of knowledge in risk events. (2)Determine the relationship between nodes Determine the node content need to follow a certain method to determine the relationship between each node and the Bayesian network inference. In Bayesian network inference, the common are 3 types: causal reasoning, diagnostic reasoning and support reasoning. Here, the hierarchical structure refers to a field of knowledge in this field. (A)Causal inference. The conclusion is obtained by reason from top to down, the objective is to get the result. Known for a reason (evidence), through using the Bayesian network inference, we can obtain the probability. (B)Diagnosis reasoning. By structure of reasoning from down to up, the purpose is to find the factors which may happen and find out the causes of risk as well as risk of probability. The purpose of using the reasoning is control the risk in time, find its source and prevent the recurrence when the risk occurs. (3)The probability distribution Probability distribution consists of two parts: determine the probability of the toplevel parent node P ( Ei ) , and determine the conditional probability P ( E i / Pb ( E i )) . Probability distribution between the events needs to have extensive knowledge of risk management, and the probability is determined by expert of risk management according to their experience. Therefore, in building Bayesian networks, the system already contains an authoritative expert knowledge. Because the feature of project is complex and reversible, the above step 3 can be alternately and repeatedly modified until the construction of Bayesian networks is finished.
Research on Risk Manage of Power Construction Project Based on Bayesian Network
131
4 Empirical Analysis There are so many risks in electrical construction project that the paper takes the risk management of cost for example. The cost risk is an important part of the management in electric power construction project, cost risk would lead to direct economic risk and the project will faces enormous economic losses, it will also cost large amounts of money if we do not take cost risk into account. 4.1 Establishing the Model of Bayesian Network for Cost Risk To establish a network, it needs to do the following steps: Because the power project risk management of historical data, and in lack of relations between nodes, according to expert knowledge of setting, causal inference and diagnosis reasoning, establishing risk two-way tracking. As the lack of historical data in determining the relationship between the nodes, most relationship is set based on expert’s knowledge, then, establish a two-way tracking map according to re-use causal reasoning and diagnostic reasoning.
Fig. 2. Bayesian network of cost control
In the Bayesian network of cost control, we can see the influence and relationship among different nodes. Determination of node status is still obtained by the experts, based on experience and knowledge, and it also can be characterized according to the node's own analysis of the data obtained. In our model, there are 3 status in each node 1, 2, 3, corresponding to low-level, intermediate, advanced.
132
Z. Jia, Z. Fan, and Y. Li
4.2 The Dynamic Assessment of Risk Based on Bayesian Network This figure is two-way tracking Bayesian due to the original acyclic graph on the basis of the development of risk, so the Bayesian reasoning is performed at the same time. According to the Figure 2, reason the result according to the expert knowledge, causal inference and diagnosis reasoning. When the technology factor risk rating is E = l, probabilistic relationship is as follows:
P( E = 1 K = 1, W = 1, C1 = 1, C 2 = 1, C 3 = 1, J = 1) P( E = 1 K = 2, W = 1, C1 = 1, C 2 = 1, C 3 = 1, J = 1) …
…
… …
…
… …
…
… …
P( E = 1 K = 3, W = 3, C1 = 3, C 2 = 3, C 3 = 3, J = 3) When the risk level is 2 or 3, the probability of relationships is as above. Thus, to C 3 = 1, E = 1 , for example, the probability of technical risk:
P = (C 3 = 1 E = 1) =
P (C 3 = 1, E = 1) P ( E = 1)
Other situations are similar. According to the assumption network diagram, the resources are composed of six overlapping part, each part can produce risk and the probability are P ( B 1 ) , P ( B 2 ) ,…, P ( B6 ) , P ( Bi ) there
P ( Bi ) > 0
are
(i = 1,L ,6)
and
>0
(i = 1,L ,6) and then,
Bi ∩ B j = φ (i ≠ j )
,
⎡ 6 ⎤ n P (Ω) = P ⎢∪ B ⎥ = ∑ P( Bi ) = 1 . ⎣ i =1 ⎦ i =1 P (K ) =0.1, P (W ) =0.2 P (C1 ) =0.1 P(C 2 ) =0.3 P(C 3 ) =0.2 and P (J ) =0.1, after further analysis , the error caused by the control and improvement measures is K , the incorrect in error analysis is W , inappropriate cost control is C1 , inappropriate cost forecasting methods is C 2 , the probability of C0 caused by misconduct of cost conRespectively, on the assumption that the probability of the above
,
,
,
,
trol C 3 and change records J are:
P(C 0 K ) = 0.2 , P(C 0 W ) = 0.1 , P(C 0 C1 ) = 0.25 , P(C 0 C 2 ) = 0.1 , P(C 0 C 3 ) = 0.15 , P(C 0 J ) = 0.2 .
Research on Risk Manage of Power Construction Project Based on Bayesian Network
133
Thus, according to the previous algorithm, the assessment result is the following: (1) Basic evaluation results If the cost control, the risk control and improvement measures "K" is caused by the possibility of risk for: In the event of risk control for cost, the probability of K is: P1 = P ( K C0 ) =
P( K ∩ C0 ) = P(C0 ) P(C0 K ) P( K )
P( K ) P(C0 K ) + P(W ) P (C0 W ) + P(C1 ) P(C0 C1 ) + P(C2 ) P(C0 C2 ) + P(C3 ) P(C0 C3 ) + P( J ) P(C0 J ) =
0.1× 0.2 = 0.14 0.1 × 0.2 + 0.2 × 0.1 + 0.1 × 0.25 + 0.3 × 0.1 + 0.2 × 0.15 + 0.1 × 0.2
Similarly, the probability of W is:
P2 = P (W C 0 ) =
P(W ∩ C 0 ) = 0.14 P (C 0 )
The probability of C1 is:
P3 = P (C1 C 0 ) =
P (C1 ∩ C 0 ) = 0.17 P (C 0 )
The probability of C2 is:
P4 = P (C 2 C 0 ) =
P (C 2 ∩ C 0 ) = 0.21 P (C 0 )
The probability of C3 is:
P5 = P (C 3 C 0 ) =
P (C 3 ∩ C 0 ) = 0.21 P (C 0 )
The probability of J is:
P6 = P ( J C 0 ) =
P( J ∩ C 0 ) = 0.14 P (C 0 )
134
Z. Jia, Z. Fan, and Y. Li
(2)Overall assessment According to the above analysis, we can draw the conclusion: the project cost control risks level:
P(C0 ) = P(K)P(C0 K) + P(W )P(C0 W ) + P(C1 )P(C0 C1 ) + P(C2 )P(C0 C2 ) + P(C3 )P(C0 C3 ) + P(J )P(C0 J ) = 0.1× 0.2 + 0.2 × 0.1 + 0.1× 0.25+ 0.3× 0.1 + 0.2 × 0.15+ 0.1× 0.2 = 0.145 Because there are many factors affect the cost control, the paper just study few factors of risk based on Bayesian networks, discussion of local risk factors can also evaluate the overall risk. Because the risk factors of overall cost are more complex, this article only gives the cost of local risk assessment model and corresponding algorithm. With reference to the example of calculation and analysis, the comprehensive assessment of actual cost can be completed.
5 Conclusion Risk management based on the application of Bayesian network model can solve the problem caused by lacking of historical data, and we also can get the order of key factors through scenario analysis and causal analysis, the aim is to control the project more effectively. However, the analytical method in the paper is hypothetical, we must use real data in practical work so as to get more valid results and make full use of the Bayesian network in risk management.
References 1. 2. 3. 4. 5. 6.
Li, D.J.: Based on Bayesian network serial decoding method. Communication Technology 115(4), 38–40 (2001) Zhang, S.: Bayesian Networks in Decision Support Systems. Computer Engineering (10), 1–3 (2004) Jia, Z., Fan, Z., Jiang, M.: Distribution Network Planning Based on Entropy Fuzzy Comprehensive Method. In: 2010 International Conference on AMM, pp. 26–28, p. 780 (2010) Evergreen, F.: Engineering factors affecting the cost of construction of the project. Shijiazhuang Railway Institute (11), 158–160 (2003) Zang, W.Y.: Bayesian Networks in stock index futures early warning of the risk. Science of Science and Technology Management (10), 122–125 (2003) Cooper, G.: Computational complexity of probabilistic inference using Bayesian belief networks. Artificial Intelligence 42(2), 393–405 (1990)
The Design of Logistics Information Matching Platform for Highway Transportation* Daqiang Chen1, Xiaoxiao Zhu1, Bing Tong1, Xiahong Shen1, and Tao Feng2 1
College of Computer Science & Information Engineering, Zhejiang Gongshang University, No.18, Xuezheng Str.,Xiasha University Town, Hangzhou, 310018, China 2 College of Economics and Business administration, China University of Geosciences, No. 388 Lumo Road, Wuhan, 430000, China
[email protected]
Abstract. The development status of logistics in the financial crisis requires the shippers and carriers’ overall goal focus on cost reduction. This paper firstly analyzes the problem of information mismatch between shipper and carrier in nowadays, and describes the shippers and carriers’ demand for information platform. Then based on requirement investigation and questionnaire statistics, the specific demands for logistics information matching platform are analyzed. Finally, logistics information matching platform system for highway transportation is designed. Keywords: logistics information matching platform; highway transportation; system design.
1 Introduction With the development of modern logistics industry, the shortcoming in establishment and application of the logistics information system has turned out to be the "bottleneck" of logistics development in China, which directly influences the communication and cooperation between logistics enterprises and users, logistics enterprises and related government departments, and hampers the development of logistics service quality [1]. The shortcoming in establishment and application of the logistics information system are also acts as a serious impact on the competitiveness of China’s logistics enterprises [2]. With modern information technology and logistics information matching platform, the horizontal integration between logistics enterprises and manufacturing companies can be achieved, the regional logistics information resources can be shared, the configuration of social logistics resources can be maximum optimized, logistics cost can be reduced, and the whole process of logistics operation can be upgraded. Because the optimization of logistics supply chain needs the participation of business partners in various types (especially the supplier and demander of related logistics service, for example the shipper and carrier in highway transportation) and involves complex and various types of operations. And functions, such as information *
This paper is supported by Zhejiang Provincial University Students Scientific Innovative Project and Zhejiang Gongshang University Students Scientific Innovative Project.
R. Chen (Ed.): ICICIS 2011, Part II, CCIS 135, pp. 135–141, 2011. © Springer-Verlag Berlin Heidelberg 2011
136
D. Chen et al.
release, exchange, and optimal matching between the relevant participants, which serve as a support logistics supply chain logistics service based on the Internet, can be easily accepted by the shipper and carrier. Therefore, making the best use of information of shipper and carrier, and constructing logistics information platform are of great significance in promoting the service level and efficiency of logistics industry. Based on the detailed analysis of the development status of logistics in the financial crisis with information demand analysis and questionnaire statistics, this paper analyze the problem of the mismatch of information between shipper and carrier in current domestic and their overall cost reduction goal and demand for information platform, and proposed a overall design framework for highway transportation logistics information matching platform. The organization of the paper is as follows. In section 2, the problem of the mismatch of information between shipper and carrier in highway transportation is described and analyzed, and the function demand of the logistics information matching platform for highway transportation is suggested. In section 3, the structure framework, system function and database of this information matching platform are designed. Section 4 accomplishes six main system functions according to its E-R diagram. The final section summarizes the major conclusions and suggests further application prospect of this system.
2 Analysis and Design of the Logistics Information Matching Platform's Function In order to integrate resources and realize the resource utilization, various forms of freight logistics platform appears, the main forms can be listed as: information website, information release, cargo distribution center of information. One of the outstanding performances is the "Bagualaiwang" logistics information website (http://www.8glw.com/) in Anyang city, Henan province, which is a carrier-shipper information providing website for free and can improve the vehicle real load rate. For its obvious energy saving effect, the system is classified by the Ministry of Transport as the second batch of "energy conservation and emission reduction demonstrative project throughout the national transportation industry"[3]. Another example is Huai’an logistics platform, zj56 (http://www.zj56. com.cn), and chinawutong (http://www. chinawutong. com) [4-6]. But these systems also have their shortcomings. Firstly, these systems only provide the collection function and release function of information without information processing and matching. As a result, the shipper and the carrier will be in trouble with looking for the right information. On the other hand, this system can not examine the provided information. Although there are registered memberships, but not being real name registered, anyone can register account and release relevant information, which makes it a doubt in the authenticity of information provided by "Bagalaiwang". For the purpose of information matching between shipper and carrier, we designed a questionnaire for a survey according to the market. In this survey, nearly one hundred questionnaires were distributed to logistics transport companies and 100 questionnaires were distributed to 100 manufacturing companies, and the response rate are 36% and 64% respectively (except 8 invalid questionnaires), .So as to ensure
The Design of Logistics Information Matching Platform for Highway Transportation
137
the quality and effectiveness of the questionnaire directly, 85 percents was proceeding by deep visits and sending out questionnaire face to face. The objects of the survey include professional carriers, the intermediary organizations of transportation, the transportation department of manufacturing enterprises, and large and medium-sized manufacturing enterprises. 2.1 Overall Demand These questionnaires separate the objects into the shipper and the carrier. Shipper investigation shows: 78% shippers were in trouble with too many goods to send; and 95% shippers are willing to share their information with the carriers. Carrier investigation shows: only 13% can find the freight demand information by Internet currently; and 92% of the carriers are willing to search freight demand information by Internet. The results show that the overall demand for shipper and carrier’s information by logistics information platform based on Internet is huge and urgent. 2.2 Functional Demand Functional demands of shipper and carrier have the same points: a) quickly searching the matching source, b) information release, c) member service, d) credit evaluation, e) online transactions, and f) intelligent distribution solutions. In addition, the shippers also want to gain functions of fast search and match enterprises’ true information source, shipping quote, preponderant routes and logistics chain coordinated guidance services.
3 The Design of Logistics Information Matching Platform 3.1 Structure Framework Design According to the basic demand of shipper and carrier, a B/S structure for modern logistics information matching management system (as showed in Fig. 1) is suggested, which integrates user browser, WEB server, MYSQL database, to achieves the purpose of nationwide logistics information registration, inquiry, optimized match, online transactions and feedback.
Fig. 1. B/S structure diagram
138
D. Chen et al.
The advantage of adopting this B/S structure is that all applications are in application servers, which can retain the superiorities of maintenance, management and cost reduction. Data updating in workstations can reduce the workload of system maintenance and modification, and is suitable for the Internet age's mobile applications. 3.2 System Function Design Logistics information matching platform should be excellent in compatibility, efficiency, accuracy, safety and stability, etc. It is an effective and efficient design method to adopt the modularized design to complete logistics information platform for matching and realizing the corresponding function, as Fig. 2 shows. Information release and query Information services module Basic function
Online transactions module
Online transactions Member credit management
Maintenance and management
Information matching platform
Information collection and maintenance
Maintenance and management Distribution route optimizing
Intelligent distribution
Information matching GIS GPS Vehicle tracking
Expand function
Enterprise logistics operation scheme Forecast decision supporting Logistics future prediction
Fig. 2. Information platform of matching function modules
3.3 Database Design The key of the database is the table structure design, and data modeling method which employ the E-R method. Thus the logistics information matching platform for highway transportation should mainly include the following four basic tables: z z z z
Car resource information tables, which are mainly used to record the basic information of carrier’s vehicle resource; Goods resource information tables, which are mainly used to record the basic information of shipper’s freight resource; Complain information tables, which can be divided into complain information of carrier’s vehicle and those of shipper’s freight; Feedback information tables, which are mainly used to record the feedback information of the platform.
Figure 3 is the system's E-R diagram, in which the user entity is involved in the processing of complain information of carrier’s vehicle, complain information of shipper’s freight, information of carrier’s vehicle resource, information of shipper’s freight resource and feedback information, and the information of carrier’s vehicle resource and those of shipper’s freight are correlate with each other by information matching.
The Design of Logistics Information Matching Platform for Highway Transportation
139
Fig. 3. Platform data relationship E-R chart
4 The Realization of the Function of System 4.1 Platform Login Interface To ensure the safety of platform, only inputting the correct username and password can the users be allowed to enter the system. "Register"--can be a new user to register, which is default to be an ordinary users. After registration, the user’s statue and its accessibility are in a locked position, only be used after unlocked by the super user or full administrator user of the system. 4.2 Information Input of Carrier’s Vehicle Resource and Shipper’s Freight Resource There is no difference between super users and ordinary users in this function. The owner's name, ownership, insurance, destination, start date, models, quantity, volume items of the carrier’s vehicle are required for information input, empty input would cause an error of incorrect information. The information input of shipper’s freight resource is in a similar setting. 4.3 Complain Information of Both Carrier’s Vehicle and Shipper’s Freight There is no difference between super users and ordinary users in this function as well. The carrier’s vehicle resource ID and reason are required; empty input would cause an error of incorrect information. The shipper’s freight resource complains information is in a similar setting.
140
D. Chen et al.
4.4 Feedback Information Submit There is no difference between super users and ordinary users in this function. The name and mailbox are required; the default username would be the login user, which can be changed. 4.5 Information Matching After information matching processing, the results would show up, if there is no suitable information matching between carrier’s vehicle and shipper’s freight. Otherwise, the system will pop up matching interface. The default matching method is a normal mode and scores are sorted by descend. The information of carrier’s vehicle resource or that of shipper’s freight resource has a highest score would be the optimal matching one, which can be inquired according to its ID. Fig.4 is an information matching result of carrier’s vehicle with shipper’s freight.
Fig. 4. Information matching result of carrier’s vehicle with shipper’s freight
4.6 User Management Function In this function, super user or full administrator user of the system can do operation such as add user, delete user, lock or unlock user, modify password and return. Add user operation can add super users and ordinary users. For the delete function, the super user can delete super user, ordinary users and also themselves (except full administrator user). The function of lock and unlock user depends on the current status of the object, i.e. super users can lock or unlock ordinary users and super users. All locked users can not be allowed to login the system.
5 Conclusion In the age of Internet economy, with the logistics information matching platform by Internet, the carrier and shipper can reduce their operative cost, reduce the empty rate of vehicle and improve the production capacity, to a certain extent avoid the resources waste in regional logistics operation, and can indirectly reduce traffic volume, release the traffic congestion, which is the key to improve operation efficiency.
The Design of Logistics Information Matching Platform for Highway Transportation
141
The information matching platform proposed in this paper has a strong faulttolerance, safety, convenient operation and the characteristics of stability and comprehensiveness, and is easy to expand and transplantation, which can enhance the cooperation between nodes enterprises in logistic chain and promote the development of logistics informalization, even would further promote e-business development in logistics industry. Although it is restrained from by the factors, such as fund, technology and enterprise reputation, etc., which make some insufficient information matching functions still exist in this platform, and remain to perfect further, we still believe it would have a significant application prospect.
References 1. 2.
3. 4. 5. 6.
Zhao, J.J., Yu, B.Q.: Modern logistics management. Peking University Press, Beijing (2004) Qin, W.Q., Wu, J.M.: New Access to Carries and Shipper Information: Logistics Information Real-time Intelligent Matchmaking Platform. Logistics Technology (210-211), 190– 193 (2010) Liu, C.: Analysis into the demands and Functions of Huai’An Logistics Information Platform. Logistics Engineering and Management 31(9), 30–31 (2009) Bagualaiwang logistics information, http://www.8glw.com Public Logistics Information Service Platform of Zhejiang Province, http://www.zj56.com.cn China Wutong Logistics Information Website, http://www.chinawutong.com
An Intelligent Prediction Method Based on Information Entropy Weighted Elman Neural Network* Tao Chen1, Xiao-li Xu1,2, and Shao-hong Wang1,2 1
Key Laboratory of Modern Measurement & Control Technology, Ministry of Education, Beijing Information Science & Technology University, Beijing, China 2 School of Mechanical Engineering, Beijing Institute of Technology, Beijing, China
Abstract. Neural network is an intelligent method in conditon trend prediction, while the condition trend prediction is important to guarantee the safe operation of large equipments. In order to overcome the deficiency of basically the same probability contribution of neural network input to output predicted, this paper proposes an intelligent prediction method based on information entropy weighted neural network, taking Elman neural network as the basis, combining with information entropy theory to construct the prediction model based on information entropy weighted Elman neural network. Condition trend prediction results of the flue gas turbine showed that the proposed new method has better prediction precision and real time performance. Keywords: intelligent, trend prediction, neural network, information entropy weighted.
1 Introduction Artificial neural network is an intelligent tool used to deal with complex nonlinear problems. Neural network has the characteristic of approximating the arbitrary continuous non-linear function and its all order derivatives with arbitrary precision by the appropriate selection of network layer and the cell number of hidden layers, thus being widely used in prediction during the industrial process. In fault prediction, the contribution of network input values to network output values has basically the same probability. In order to overcome the deficiency of basically the same probability contribution of neural network input to output predicted, this paper proposes a prediction method based on information entropy weighted Elman combing with information entropy theory and Elman neural network. *
National Natural Science Foundation of China (50975020) and Funding Project (PHR20090518) for Academic Human Resources Development in Institutions of Higher Learning under the Jurisdiction of Beijing Municipality.
R. Chen (Ed.): ICICIS 2011, Part II, CCIS 135, pp. 142–147, 2011. © Springer-Verlag Berlin Heidelberg 2011
An Intelligent Prediction Method
2
143
Information Entropy Weighted Elman Neural Network
2.1 Calculation of Information Entropy Weight The proposed information entropy weighted neural network prediction method in this paper makes use of information entropy to indicate the contribution weight of network input to the network output predicted. Information entropy is used to measure the average amount of uncertainty of information source from the overall and objective perspective. The smaller the information entropy is, the more definite the information is[1-3]. Suppose one condition monitoring and fault prediction system has n sources of information (sensors), i.e. x1,x2,…,xn, the probabilities of the required information provided by the information sources are p1,p2,…,pn, the information structure of the system is:
⎛ X ⎞ ⎛ x1 S = ⎜⎜ ⎟⎟ = ⎜⎜ ⎝ P ⎠ ⎝ p1
x2 p2
x3 L xn ⎞ ⎟ p3 L pn ⎟⎠
(1)
Where pi is the information probability provided by information source, the calculation is as follows:
pi =
xi
(i = 1,2,L , n )
n
∑x i =1
(2)
i
In this system, the information entropy Ei which characterizes various information source, is calculated as follows:
Ei = − pi log 2 pi
(i = 1,2,L, n)
(3)
Entropy weighted neural network prediction method conducts information entropy weight of the raw information from sensors. The information entropy weighted coefficient wi is calculated as follows:
wi =
Ei n
∑ Ei
(i = 1,2, L , n)
(4)
i =1
The weight coefficient calculated based on formula (4) reflects the information amount carried by neural network input. 2.2 Entropy-Weighted Elman Neural Network Structure Elman neural network used in information entropy weighted Elman neural network is a typical feedback neural network, which has simple structure and has stronger computing power and stronger ability to adapt to time-varying characteristics than the
144
T. Chen, X.-l. Xu, and S.-h. Wang
forward neural network [4]. Different from RBF, BP and other forward neural network, besides the input layer, hidden layer and output layer, Elman network still adds a context layer in the hidden layer. The context layer acts as one-step delay operator, and is used to memorize the output value at the previous moment for hidden layer unit[5,6]. The structure of Elman neural network is shown in Figure1.
Fig. 1. Structure of Elman Neural Network
,
As shown in Figure1 k stands for moment, y, x, u ,xc respectively represents output of the network, the output of the hidden layer, external input of network, and output of context layer. w1,w2,w3 respectively stands for the connection weight matrixes from the context layer to hidden layer, from the input layer to hidden layer, from the hidden layer to the output layer respectively. b1 and b2 are the threshold values of input layer and hidden layer. Information entropy weighted Elman neural network, based on the Elman neural network, adds an information entropy weighted processing layer between the input layer and hidden layer. The structure of information entropy weighted Elman neural network is shown in Figure 2, the information entropy weighted processing layer identifies the contribution of the network input to the network output predicted, and can gain consistent description of running condition of mechanical equipments.
Fig. 2. Structure of Information Entropy Weighted Elman Neural Network
An Intelligent Prediction Method
145
Information entropy weighted Elman neural network prediction method is an intelligent dynamic prediction method. The method calculates information entropy weight of network input value, and determines the contribution amount of network input value to network output prediction value.
3 Condition Trend Prediction of Flue Gas Turbine Based on Information Entropy Weighted Elman Neural Network 3.1 Parameter Setting in Information Entropy Weighted Neural Network This paper takes the flue gas turbine in large-scale petrochemical company as the research object. The flue gas turbine is a kind of key devices in the catalytic cracking energy recovery system. In order to ensure the safe operation and scientific maintenance, conducting fault prediction will effectively avoid the contingency, save a great deal of maintenance fees and increase the equipment utilization rate. In accordance with the operating characteristics for the flue gas turbine, we collect the historical vibration data measured at YT-7702A bearing point of the turbine, and extract the vibration attribute value of 1 double frequency component to build 3-layer information entropy weighted Elman to make condition trend prediction. In the constructed network, we select the vibration attribute for every five days as the information input into the neural network, and select the vibration attribute at the sixth day as the output, that is, the number of neurons at the input layer is 5, and the number of neurons at the output layer is 1. The iterative prediction way is used which is formed from single-step prediction iteration. The transfer function from the network input layer to hidden layer adopts the hyperbolic tangent S- function. In order to effectively use the S-function, and to ensure that the nonlinear approximation ability of neural network, we conduct the normalization processing to transform the sample data to the (-0.9,0.9)interval.
xˆi =
1.8( xi − x min ) − 0.9 x max − x min
(5)
After training, the actual value on network output result can be obtained by the inverse transformation, that is, the anti-normalized processing should be made on the prediction results, then the actual prediction result will be obtained. LM algorithm is used in neural network training. As LM algorithm is not strongly dependent on the initial value, it can greatly improve the inherent flaws and shortcomings of BP network; it has the speed and precision of Newton method while not calculating Hessian matrix. As for the number and accuracy of training times, LM algorithm is obviously superior to conjugate gradient method and BP algorithm with variable learning rate [7,8]. The optimal number of nodes in the hidden layer is determined by trial-and-error method. Table 1 shows the pediction performance of different numbers of neurons in hidden layer in the constructed neural network.
146
T. Chen, X.-l. Xu, and S.-h. Wang Table 1. Prediction performance of different numbers of neurons in hidden layer
Number of neurons in the hidden layer 9 10 11 12 13
training steps 50 40 36 34 34
MAPE
MSE
6.4354 × 10 −4 6.5183 × 10 −4 5.8701 × 10 −4 6.2309 × 10 −4 6.4452 × 10 −4
2.9346 × 10 −5 2.9587 × 10 −5 2.9134 × 10 −6 2.9294 × 10 −5 2.9629 × 10 −5
As can be seen from Table 1, when the number of neurons in hidden layer is 11, the prediction errot of MAPE and MSE are minimum, and the number of training steps is intermediate; after the comprehensive assessment of training steps and errors, and prior consideration of the error performance, the optimal number of nodes in the hidden layer in the neural network is finally determined to be 11. 3.2 Prediction Results and Analysis The information entropy weighted Elman neural network is used to predict the vibration attribute value of flue-gas turbine, and the comparison with Elman neural network is made. The prediction results of informaton entropy weighted Elman and Elman are shown in Figure 3. The following table 2 shows the prediction performance of information entropy weighted Elman and Elman prediction methods.
Fig. 3. Prediction results of Information Entropy Weighted Elman and Elman Table 2. Prediction Performance of Information Entropy Weighted Elman and Elman
Types of Neural network Elman Information Entropy Weighted Elman
Iterations Times 29 26
MSE
MAPE
4.5036 × 10 −4 3.1890 × 10 −4
3.9803 × 10 −3 2.8706 × 10 −3
An Intelligent Prediction Method
147
As shown in Figure 3 and Table 2, information entropy weighted Elman is superior to Elman in terms of the iteration times and the prediction error. The information entropy weighted Elman has stronger approximation to the actual value, and improves the prediction accuracy and real-time performace, which fully illustrates the prediction performance of the proposed prediction method.
4 Conclusion Information entropy weighted neural network is an intelligent prediction mthod combining with information entropy theory. It can overcome the deficiency of basically the same probability contribution of neural network input to output predicted. The prediction result shows that the Information entropy weighted Elman neural network has higher prediction accuracy, better prediction real time performance. The analysis indicates that the proposed method is feasible in the condition trend prediction for large equipments with a broad application prospect.
Acknowledgments The authors appreciate the comments of the anonymous reviewers. Thanks to the scholars listed in the references, for their wisdom and creative achievement giving us inspiration.
References 1. 2. 3. 4. 5. 6.
7.
8.
Barnum, H., Barrett, J., Clark, L.O., et al.: Entropy and information causality in general probabilistic theories. New Journal of Physics 3, 1–32 (2010) Zhang, Q.-R.: Information conservation, entropy increase and statistical irreversibility for an isolated system. Physica A (388), 4041–4044 (2009) Zhang, J., Mi, X.: Neural Network and Its Application in Engineering. China Machine Press, Bejing (1996) Elman, J.L.: Finding Structure in Time. Cognitive Sci. (14), 179–211 (1990) Raja, S., Toqeer, N., Suha, B.: Speed Estimation of an Induction Motor using Elman Neural Network. Neurocomputing (55), 727–730 (2003) Ciarlini, P., Maniscalco, U.: Wavelets and Elman Neural Networks for Monitoring Environmental Variables. Journal of Computational and Applied Mathematics (221), 302–309 (2008) Arab, C.M., Beglari, M., Bagherian, G.: Prediction of Cytotoxicity Data (CC50) of AntiHIV 5-pheny-l-phenylamino-1H-imidazole Derivatives by Artificial Neural Network Trained with Levenberg–Marquardt Algorithm. Journal of Molecular Graphics and Modelling (26), 360–367 (2007) Bahram, G.K., Susan, S.S., Troy, N.H.: Performance of the Levenberg–Marquardt Neural Network Training Method in Electronic Nose Applications. Sensors and Actuators B (110), 13–22 (2005)
A Multi-layer Dynamic Model for Coordination Based Group Decision Making in Water Resource Allocation and Scheduling Wei Huang1,2, Xingnan Zhang1,2, Chenming Li3, and Jianying Wang3 1
National Engineering Research Center of Water Resources Efficient Utilization and Engineering Safety Hohai University, Nanjing, P.R. China 2 College of Hydrology and Water Resources Hohai University, Nanjing, P.R. China 3 College of Computer and Information Engineering Hohai University, Nanjing, P.R. China
[email protected],
[email protected]
Abstract. Management of group decision-making is an important issue in water source management development. In order to overcome the defects in lacking of effective communication and cooperation in the existing decision-making models, this paper proposes a multi-layer dynamic model for coordination in water resource allocation and scheduling based group decision making. By introducing the scheme-recognized cooperative satisfaction index and scheme-adjusted rationality index, the proposed model can solve the problem of poor convergence of multi-round decision-making process in water resource allocation and scheduling. Furthermore, the problem about coordination of limited resources-based group decision-making process can be solved based on the effectiveness of distance-based group of conflict resolution. The simulation results show that the proposed model has better convergence than the existing models. Keywords: Group Decision-Making, Optimization, System Simulation, Water Resource Allocation and Scheduling.
1 Introduction The water management institutional reform in China is in the direction of basin water resource unified management and region water affair integration management, and requires building up cooperative mechanism of parts participant, democratic consultation, common decision, individual responsibility and efficient execution mechanism. However, the current water allocation and management and decision support system almost stay on the individual decision-making layer, the practical requirements of water resources regulation should transform individual decision-making mode to group decision-making mode. Many researchers such as the references [1-5] expatiate the selection of water resource decision-making scheme is not a individual decision-making problem but a R. Chen (Ed.): ICICIS 2011, Part II, CCIS 135, pp. 148–153, 2011. © Springer-Verlag Berlin Heidelberg 2011
A Multi-layer Dynamic Model for Coordination Based Group Decision Making
149
group decision-making problem, which mainly pay attention to water resource field such as water resource bearing capacity, instead of group decision-making problem of how to cooperate efficiently. According to the characteristic of water resource configuration, this paper proposes a multi-layer dynamic model of coordination based group decision making for water resource allocation and scheduling. This model is a multi-objection, multi-layer, multi-time interval, multi-restriction and multi-round decision-making process on the basis of cooperation. In order to solve the confliction problem of group scheme in the model, this paper proposes a conflict resolution scheme based on group utility distance optimization. At last, this model is preliminary validated on the Swarm simulation platform.
2 The Multi-layer Dynamic Model The essence of water resource transfer group decision-making is group opinions progressively converge into consistent for limited resource conflicted decision-making. The cooperative multi-layer dynamic group decision-making model needs introducing scheme-recognized cooperative satisfaction degree index and scheme-adjusted rationality index to impel multi-round convergence. The algorithm of this model is described as follows. Step1k According to the (K-1)th layer’s guidance restriction and the Kth layer’s
macroscopical objective concept, each decision maker’s scheme advices and so on, the cooperative group organizes layer K expert group to build up the Kth layer’s objective system, feasible scheme group and the Kth layer’s constraint conditions of each scheme. Stepk2 Adjustable threshold interval θ min ,θ ave of group satisfaction degree scheme recognized is set. Cooperators organize the round(i+1) negotiation. Stepk3 With the organization of cooperative group, each decision makers group begins to the round i scheme negotiation. If group satisfactory degree exceeds the threshold θ ave , then turn to Stepk5 , otherwise, turn to Stepk4 . Stepk4 Cooperative group organizes experts to analyze conflict and adjust objectives,
schemes and constraints. If the groups’ adjusting intension for objectives, schemes and constraints is unreasonable, then the threshold of satisfactory degree is adjusted. If it is no less than θ min , then turn to Stepk5 . Otherwise, turn to Stepk6 . Stepk5 According to the threshold of group’s satisfactory degree, satisfied schemes
are sorted in the group satisfied solution set, the optimal scheme is found, the lower decision-making’s constraint set is arranged, the approbatory protocol of decision-making groups’ scheme for this layer is impelled, and penalized cost μ protocol violated is promised. Then the algorithm comes into the layer(K+1), when this layer ends. Stepk6 The cooperative group of the Kth layer organizes experts to compute cost of choice scheme. If the whole utility of the scheme is lower than μ , then the scheme
150
W. Huang et al.
and constraints opinions for the upper (K-1)th layer come into being, which is fed back to (K-1)th layer’s cooperative group, otherwise, objectives, schemes and constraints should be adjusted, and bonus-penalty factor should be added, then turn to Stepk2 .
3 Evolved Cooperative Mechanism Based on Distance Optimization of Group Utility The scheme attribute sequencing globally observed by player is assumed as A = (a1 , a2 ,..., am ) , the attribute values is vai0 ∈ [min ai0 , max ai0 ] under global constraints, and the attribute values is vai0 ∈ [min ai0 , max ai0 ] under objective constraints of decision maker j. As well, the unit effectiveness concession on attribute ai is ΔU l* (ai ) . Definition 3-1: Normalized utility distance is boundary distance U t j (ai ) , denoted by U t j (ai ) =| vai0 − vaij | U t j (ai ) =|| min ai0 − max ai0 | / 2− | min aij − max aij | / 2 | .
(1)
where U t j (ai ) is the distance between center points of two normalized utility region, where t expresses the tth round adjusting. Definition 3-2: Group adjusting inclination is described as index vector distance optimization after group adjusting, and is denoted as B( ai ) N
N
j =1
j =1
B( ai ) =| ∑U t j ( ai ) | − | ∑U t j−1 ( ai ) |, i = 1..M .
(2)
Definition 3-3: Attribute value intersection function f 0 j ⎪⎧1 vai ∩ vai ≠ Φ f ( i, j ) = ⎨ . 0 j ⎪⎩0 vai ∩ vai = Φ
(3)
① Cooperators’ cooperative strategy
Rule 1: Sort attributes by the values of B( ai ) from big to small, abstract adjustable N
attributes from the sequence, if
∑ f (i, j ) > α
( α can choose most rules, such as N/2),
j =1
N
then find out the next attribute from the sequence, until the attribute of
∑ f (i, j ) > α j =1
can not be satisfied, which is taken as global optimized adjusting attribute, and do ΔU l* (ai ) adjusting. Rule 2: If the decision maker doesn’t do any adjusting, then give the penalty equals to K ΔU l* (ai ) , where K is more than 1.
A Multi-layer Dynamic Model for Coordination Based Group Decision Making
151
Rule 3: If the decision maker does the optimized adjusting, the judgment is the effects of the sharpen degree for current conflict inclined to smooth, i.e., B( ai ) has inclined trend, then preference compensated encouragement can be given. Rule 4: If the decision maker’s adjusting is not the optimized one, then no rewards and punishment is given.
② Decision makers’ cooperative strategy
Rule 1: Observe global optimized adjusting attribute, if property with its own strength in the tolerance range of adjustment of preferences. The preference sequence is adjusting according to global optimized adjusting attribute. Rule 2: If the utility is incompatible with attribute adjusting preference, i.e., loss utility is too much, then by observed other conflicted attributes, the most adjacent personal preference structural attributes is chosen, and yielded, which can help to bring about new optimized group inclination. Because group preference opinions embody in cooperators’ adjusting, decision makers’ game is implicated in decision makers and cooperators.
4 Simulations This paper does simulated experiment on Swarm simulated platform making use of parts statistic data published in references [6-9], which simulates group decision-making composed of three decision makers and a cooperator. (1) Satisfied concentration in preference independent Taking the initial configuration set in reference [10], the assumption that decision makers prefer the independence of decision-makers concerned only with the coordinator of all the constraints, the satisfaction depends on the coordination tendency of those. Simulated results are shown as Figure 1. From the Figure 1 we can see that if the cooperators consider mandatory step, i.e., prescriptive plan, the random distribution of satisfactory degree can hardly converge. Reference [10] configuration can cause high satisfactory degree upstream, but low satisfactory degree downstream, and the average satisfactory degree is not high. From the algorithm design idea, under independent assumption and mandatory strategy, the reference standard of decision makers is unique, without considering later effect. As well, each decision maker’s strategy is irrelevant, while the conditions are independent, which can not be interacting, thus, the random characteristic of satisfactory degree shows the rationality of algorithm function designing and implementation. (2) Satisfied concentration in harmony Taking the initial configuration set in [10], the decision maker and the cooperator are assumed to adopt correlated preference, that is, other participants’ preference are considered, and the personal strategy is modulated according to group preference inclination, and the simulated results are shown in Figure 2.
152
W. Huang et al.
Fig. 1. Satisfied concentration in preference independent
Fig. 2. Satisfied concentration in harmony
If the different price of water used in peak period and valley period is introducing, in the situation of complementary configuration in the time of water used, satisfactory degree in long term is high, and increases year by year, while the velocity of convergence is fast, which are shown in Figure 2. Meanwhile, the results accord with the long term benefit configuration of preference in the algorithm design.
5 Conclusion This paper proposes a group decision-making method which is MCGD (Multi-layer Cooperative Dynamic Group Decision) corresponding to the need of water resource allocation and scheduling, which combines multi-objective group decision-making, multi-layer group decision-making, multi-period group decision-making, multi-attribute group decision-making, multi-round group decision-making and so on. The characteristic of cooperative multi-layer dynamic group decision-making is adopting group decisions by the greatest extent, the results satisfying multi-part by cooperation, instead of non-completed compromised equivalent solution. By cooperation and compromise, the decision makers are impelled to develop avoiding conflicts, thus, the integral optimized solution is got on the condition of satisfactory to every party. This decision-making mode corresponds to the dynamic configuration of limited water resource. Acknowledgment. This work is supported by the National Nature Science Foundation of China (No.50479018), and the Fundamental Research Funds for the Central Universities of China (No. 2009B20414).
References 1. Wang, H., Qin, D.Y., Wang, J.H.: Concept of system and methodology for river basin water resources programming. Shuili Xuebao 2002(8), 1–6 (2002) (in Chinese) 2. Chen, S.Y., Huang, X.C., Li, D.F.: A multi-objective and group-decision-making model of water resources and macro-economic sustainable development in Dalian. Shuili Xuebao 2003(3), 42–48 (2003) (in Chinese)
A Multi-layer Dynamic Model for Coordination Based Group Decision Making
153
3. Xu, Z.M.: A Scenario-Based Framework for Multicriteria Decision Analysis in Water Carrying Capacity. Journal of Glaciolgy and Geocryology 21(2), 99–106 (1999) 4. Cheng, G.D.: Evolution of the Concept of Carrying Capacity and the Analysis Framework of Water Resources Carrying Capacity in Northwest of China. Journal of Glaciolgy and Geocryology 24(4), 361–366 (2002) 5. Hajkowicz, S.: Cutting the cake: Supporting environmental fund allocation decisions. Journal of Environmental Management 90(8), 2737–2745 (2009) 6. China National Bureau of Statistics Of. China City Statistical Yearbook. China Statistics Press (2007) (in Chinese) 7. China National Bureau of Statistics Of. Anhui Statistical Yearbook 2007 [ISO]. China Statistics Press (2007) (in Chinese) 8. China China National Bureau of Statistics Of. Jiangsu Statistical Yearbook 2007 [ISO]. China Statistics Press (2007) (in Chinese) 9. China National Bureau of Statistics Of. Shandong Statistical Yearbook 2007 [ISO]. China Statistics Press (2007) (in Chinese) 10. Wang, S.B.: Study on Rational Water Resources Allocation Oriented to User’s Demand. PhD thesis, Xi’an University of Technology (2007) (in Chinese)
About the Authors Wei Huang is a PhD student in National Engineering Research Center of Water Resources Efficient Utilization and Engineering Safety, and College of Hydrology and Water Resources, Hohai University, Nanjing, P.R. China. He received his MSc in Water Science and Engineering Department of UNESCO-IHE in the Netherlands in 2007. His current research interests include hydroinformatics, water resources system modeling and environmental assessment. Xingnan Zhang is a professor in National Engineering Research Center of Water Resources Efficient Utilization and Engineering Safety, and College of Hydrology and Water Resources, Hohai University, Nanjing, P.R. China. His current research areas include water science and engineering, hydroinformatics. Chenming Li is an associate professor in College of Computer and Information Engineering, Hohai University, Nanjing, P.R. China. He is a senior member of China Computer Federation, and Chinese Institute of Electronic, his current research interests include information processing system and its applications, complex system modelling and simulation. Jianying Wang received his PhD from Hohai University, P.R.China in 2008. He is an associate professor in College of Computer and Information Engineering, Hohai University.
Analysis of Mode Choice Performance among Heterogeneous Tourists to Expo Shanghai 2010 Shengchuan Jiang, Yuchuan Du*, and Lijun Sun Key Laboratory of Road and Traffic Engineering of the Ministry of Education, Tongji University, Shanghai, China
[email protected]
Abstract. Tourist is a conventional kind of commuters in the urban transport system. During some mega-events, such as Olympic Games or Expos, tourists would become the most important and sizable part of commuters in the host city. Expo 2010 Shanghai will attract 70 millions tourists during the whole 184 days duration. The large number of tourists expected to be carried, combined with the congested urban road network and limited parking spaces, will make it difficult for individual transport to be used during the Expo; as such, high rates of utilization of public transport will be necessary. Hence, exploring the trip mode choice behavior of Expo tourists is the keystone for traffic planning of Expo 2010 Shanghai, especially for the difference of heterogeneous tourists from various departure areas. A joint model system, in the form of associating clustering analysis and HL model, is developed in this paper to investigate the differences of trip mode choice behaviour among heterogeneous tourist groups. The clustering analysis method is used in this paper to distinguish the various types of Expo tourists for the choice sets are variable with the attributes of groups. Sorted by the attribute of departure area, tourists of Expo Shanghai could be divided into three kinds: local visitors, out-of-town one-day-trip visitor and out-of-town lodging visitors. The statistic parameters of three kind models constructed by this joint system show that this modeling method improves analytic precision effectively. Keywords: Expo Tourists, choice behaviour, clustering analysis.
1 Introduction Tourist is a conventional kind of commuters in the urban transport system. During some mega-events, such as Olympic Games or Expos, tourists would become the most important and sizable part of commuters in the host city. It is reported that Expo 2010 Shanghai will attract 70 millions tourists during the whole 184 days duration, namely 400,000 tourists daily and 800,000 tourists in peak day (Yin et al., 2007). Considering the location of the Expo Park is in the city center of Shanghai, this mega-event is regarded by many experts as one of the great, world-wide transport and logistics challenges. The large number of tourists expected to be carried, combined with the *
Corresponding author.
R. Chen (Ed.): ICICIS 2011, Part II, CCIS 135, pp. 154–164, 2011. © Springer-Verlag Berlin Heidelberg 2011
Analysis of Mode Choice Performance among Heterogeneous Tourists
155
congested urban road network and limited parking spaces, will make it difficult for individual transport to be used during the Expo; as such, high rates of utilization of public transport will be necessary. Hence, exploring the trip mode choice behavior of Expo tourists is the keystone for traffic planning of Expo 2010 Shanghai, especially for the difference of heterogeneous tourists from various departure areas. Over the past few decades, research interest in the link between travel choice behaviour and the contribution of various independent variables has blossomed. More recently, discrete choice models based on SP methods have become popular among academics, governments and consulting companies to explore many aspects of transportation, including mode choice behaviour, urban forms, levels of service, prices and so on (Fowkey and Preston 1991; Bhat 1997, 2005; Raney etl. 2000; Punj and Brookes 2001; Johansson et al. 2006; McMillan 2007; Lu and Peeta 2009). Tourists differ from daily commuters in several ways that suggest different analysis method may be necessary. First, tourists usually have no acquaintance with the urban transport system in the visited city, they may prefer direct and comfortable trip mode. Second, because of the budget difference in the aspect of tourist time and expense, the variability of tourists’ choice behaviours may be greater than urban commuters. Third, feature of tourist’s origins and destinations are more complicated than daily commuters, therefore tourist-oriented management strategies must be flexible in location as well as scale, to account for spatially shifting demand. There are many strategies have been proposed for distinguishing among groups of travellers, including ones based on attribute cutoffs, clusters of travel attitudes, motivations or preferences, behavioural repertoires for different activities and hierarchical information integration (Swait, 2001; Johansson et al., 2006; Steg, 2005; Van Exel et al., 2005; Anable and Gatersleben, 2005; Bamberg and Schmidt, 2001; Tam et al., 2008; Molin and Timmermans, 2009). This paper presents a joint model system to investigate the differences of trip mode choice behaviour among tourist groups. The model system takes the form of a joint clustering analysis and hierarchical logit (HL) model. The remainder of this paper is organised as follows. The next section describes the clustering analysis method is used to distinguish the various types of tourists for the choice sets are variable with the attributes of groups. This is followed by the structure of HL model is characterised by grouping all subsets of tourist-correlated options in hierarchies. Each nest of the HL model is represented by certain tourist features which are differ from the others. Then, the joint model system is used to estimate trip shares on a survey sample of potential tourists for Expo 2010 Shanghai, which have been conducted among tourists in an airport, a train station and highway service stations in Shanghai. The last section includes the concluding comments.
2 Cluster Analysis for Potential Expo Tourists The level of transport demand in Shanghai during Expo 2010 will be very high because of the great numbers of local and out-of-town visitors, including those from the Yangtze Delta, other regions of China including Hong Kong, Macao and Taiwan and foreign countries. The registration report of the Expo 2010 Shanghai Committee
156
S. Jiang, Y. Du, and L. Sun
indicates that Shanghai visitors will account for 25% of total visitors; visitors from the Yangtze Delta, 40%; visitors from other regions of China, 30%; and visitors from overseas, 5%, as shown in Figure 1.
Yangtze Delta, 40%
Overseas, 5%
Other Regions Domestic, 30%
Shanghai Local, 25%
Fig. 1. Distribution of Expo Tourists
Because of the range of tourists to Expo 2010 Shanghai and their various attributes, it will obviously be difficult to obtain satisfactory results putting all Expo tourists into a single group for analysis and modelling. In addition, as the World Expo has not previously been held in China, there is no reference to aid in the understanding or prediction of tourist trip mode choice behaviour over the duration of this mega-event. Given such a backdrop, this paper developed a two-stage gradual stated preference survey
Research into trip mode choice and design of stated preference survey
Trip mode choice behaviour without constraints
Stage 1
Data collection and homogeneity analysis
Cluster analysis and determine different groups
Survey of multi-scenario-comparison choice
Stage 2
Chose the structure of NL model by certain tourist features
Data collection and analysis
Parameter estimation and testing
Fig. 2. Procedure of the Two-Stage Gradual Stated Preference Survey