Lecture Notes in Computer Science Commenced Publication in 1973 Founding and Former Series Editors: Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen Editorial Board David Hutchison Lancaster University, UK Takeo Kanade Carnegie Mellon University, Pittsburgh, PA, USA Josef Kittler University of Surrey, Guildford, UK Jon M Kleinberg Cornell University, Ithaca, NY, USA Alfred Kobsa University of California, Irvine, CA, USA Friedemann Mattern ETH Zurich, Switzerland John C Mitchell Stanford University, CA, USA Moni Naor Weizmann Institute of Science, Rehovot, Israel Oscar Nierstrasz University of Bern, Switzerland C Pandu Rangan Indian Institute of Technology, Madras, India Bernhard Steffen TU Dortmund University, Germany Madhu Sudan Microsoft Research, Cambridge, MA, USA Demetri Terzopoulos University of California, Los Angeles, CA, USA Doug Tygar University of California, Berkeley, CA, USA Gerhard Weikum Max Planck Institute for Informatics, Saarbruecken, Germany 6987 Zhiguo Gong Xiangfeng Luo Junjie Chen Jingsheng Lei Fu Lee Wang (Eds.) Web Information Systems and Mining International Conference, WISM 2011 Taiyuan, China, September 24-25, 2011 Proceedings, Part I 13 Volume Editors Zhiguo Gong University of Macau, Department of Computer and Information Science Av Padre Tomás Pereira, Taipa, Macau, China E-mail: fstzgg@umac.mo Xiangfeng Luo Shanghai University, School of Computer Shanghai 200444, China E-mail: luoxf@shu.edu.cn Junjie Chen Taiyuan University of Technology, School of Computer and Software Taiyuan 030024, China E-mail: chenjj@tyut.edu.cn Jingsheng Lei Shanghai University of Electric Power School of Computer and Information Engineering Shanghai 200090, China E-mail: jshlei@126.com Fu Lee Wang Caritas Institute of Higher Education, Department of Business Administration 18 Chui Ling Road, Tseung Kwan O, Hong Kong, China E-mail: pwang@cihe.edu.hk ISSN 0302-9743 e-ISSN 1611-3349 ISBN 978-3-642-23970-0 e-ISBN 978-3-642-23971-7 DOI 10.1007/978-3-642-23971-7 Springer Heidelberg Dordrecht London New York Library of Congress Control Number: 2011936228 CR Subject Classification (1998): H.4, H.3, H.2, C.2.4, I.2.6, D.2 LNCS Sublibrary: SL – Information Systems and Application, incl Internet/Web and HCI © Springer-Verlag Berlin Heidelberg 2011 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 The use of general descriptive names, registered names, trademarks, etc in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use Typesetting: Camera-ready by author, data conversion by Scientific Publishing Services, Chennai, India Printed on acid-free paper Springer is part of Springer Science+Business Media (www.springer.com) Preface The 2011 International Conference on Web Information Systems and Mining (WISM 2011) was held during September 24–25, 2011 in Taiyuan, China WISM 2011 received 472 submissions from 20 countries and regions After rigorous reviews, 112 high-quality papers were selected for publication in the WISM 2011 proceedings The acceptance rate was 23% The aim of WISM 2011 was to bring together researchers working in many different areas of Web information systems and Web mining to foster the exchange of new ideas and promote international collaborations In addition to the large number of submitted papers and invited sessions, there were several internationally well-known keynote speakers On behalf of the Organizing Committee, we thank Taiyuan University of Technology for its sponsorship and logistics support We also thank the members of the Organizing Committee and the Program Committee for their hard work We are very grateful to the keynote speakers, session chairs, reviewers, and student helpers Last but not least, we thank all the authors and participants for their great contributions that made this conference possible September 2011 Gong Zhiguo Xiangfeng Luo Junjie Chen Jingsheng Lei Fu Lee Wang Organization Organizing Committee General Co-chairs Wendong Zhang Qing Li Taiyuan University of Technology, China City University of Hong Kong, Hong Kong Program Committee Co-chairs Gong Zhiguo Xiangfeng Luo Junjie Chen University of Macau, Macau Shanghai University, China Taiyuan University of Technology, China Steering Committee Chair Jingsheng Lei Shanghai University of Electric Power, China Local Arrangements Co-chairs Fu Duan Dengao Li Taiyuan University of Technology, China Taiyuan University of Technology, China Proceedings Co-chairs Fu Lee Wang Ting Jin Caritas Institute of Higher Education, Hong Kong Fudan University, China Sponsorship Chair Zhiyu Zhou Zhejiang Sci-Tech University, China VIII Organization Program Committee Ladjel Bellatreche Sourav Bhowmick Stephane Bressan Erik Buchmann Jinli Cao Jian Cao Badrish Chandramouli Akmal Chaudhri Qiming Chen Lei Chen Jinjun Chen Hong Cheng Reynold Cheng Bin Cui Alfredo Cuzzocrea Wanchun Dou Xiaoyong Du Ling Feng Cheng Fu Gabriel Fung Byron Gao Yunjun Gao Bin Gao Anandha Gopalan Stephane Grumbach Ming Hua Ela Hunt Renato Iannella Yan Jia Yu-Kwong Ricky Yoon Joon Lee Carson Leung Lily Li Tao Li Wenxin Liang Chao Liu Qing Liu Jie Liu JianXun Liu ENSMA - Poitiers University, France Nanyang Technological University, Singapore National University of Singapore, Singapore University of Karlsruhe, Germany La Trobe University, Australia Shanghai Jiao Tong University, China Microsoft Research, USA City University of London, UK Hewlett-Packard Laboratories, USA Hong Kong University of Science and Technology, China Swinburne University of Technology, Australia The Chinese University of Hong Kong, China Hong Kong Polytechnic University, China Peking University, China University of Calabria, Italy Nanjing University, China Renmin University of China, China Tsinghua University, China Nanyang Technological University, Singapore The University of Queensland, Australia University of Wisconsin, USA Zhejiang University, China Microsoft Research, China Imperial College, UK INRIA, France Simon Fraser University, Canada University of Strathclyde, UK National ICT, Australia National University of Defence Technology, China Colorado State University, USA KAIST, Korea The University of Manitoba, Canada CSIRO, Australia Florida International University, USA Dalian University of Technology, China Microsoft, USA CSIRO, Australia Chinese Academy of Sciences, China Hunan University of Science and Technology, China Organization Peng Liu Jiaheng Lu Weiyi Meng Miyuki Nakano Wilfred Ng Junfeng Pan Zhiyong Peng Xuan-Hieu Phan Tieyun Qian Kaijun Ren Dou Shen Peter Stanchev Xiaoping Su Jie Tang Zhaohui Tang Yicheng Tu Junhu Wang Hua Wang Guoren Wang Lizhe Wang Jianshu Weng Raymond Wong Jemma Wu Jitian Xiao Junyi Xie Wei Xiong Hui Xiong Jun Yan Xiaochun Yang Jian Yang Jian Yin Qing Zhang Shichao Zhang Yanchang Zhao Sheng Zhong Aoying Zhou Xingquan Zhu IX PLA University of Science and Technology, China University of California, Irvine Binghamton University, USA University of Tokyo, Japan Hong Kong University of Science and Technology, China Google, USA Wuhan University, China University of New South Wales (UNSW), Australia Wuhan University, China National University of Defense Technology, China Microsoft, USA Kettering University, USA Chinese Academy of Sciences, China Tsinghua University, China Microsoft, USA University of South Florida, USA Griffith University, Australia University of Southern Queensland, Australia Northeastern University, USA Research Center Karlsruhe, Germany Singapore Management University, Singapore Hong Kong University of Science and Technology, China CSIRO, Australia Edith Cowan University, Australia Oracle Corp., USA National University of Defence Technology, China Rutgers University, USA University of Wollongong, Australia Northeastern University, China Macquarie University, Australia Sun Yat-Sen University, China CSIRO, Australia University of Technology, Australia University of Technology, Australia State University of New York at Buffalo, USA East China Normal University, China Florida Atlantic University, USA Table of Contents – Part I Applications of Web Information Systems Research on Electromagnetic Wave Through-The-Earth Wireless Communication for Coal Mine Disaster Jinyi Tao The Investigation of WEB Software System Based on Domain-Driven Design Fei Wang, LiHua Yan, Peng Zhou, Wei Sun, and Yuan Ding 11 MediaCRM: Enabling Customer Relationship Management in the Broadcast Robbie De Sutter, Mike Matton, Niels Laukens, Dieter Van Rijsselbergen, and Rik Van de Walle Jordan Triple Multiplicative Maps on the Symmetric Matrices Haifeng Zhang and Yuying Li 19 27 International Collaborations in Brain-Computer Interface (BCI) Research Brahim Hamadicharef 35 A Classification of Cluster Validity Indexes Based on Membership Degree and Applications Nannan Xie, Liang Hu, Nurbol Luktarhan, and Kuo Zhao 43 Several Methods of Calculating the Distribution of Linear Combinations of Two-Dimensional Random Variables Yuying Li and Haifeng Zhang 51 Propagation in LHM Slab Loaded Rectangular Waveguide Rui-lian Li 59 The Study of Images Emotion Based on fMRI Xiaoyan Qiao, Haifang Li, Jie Xiang, and Hongxia Deng 66 The Communication Protocol Design of Electro-Hydraulic Control System for Hydraulic Supports at Coal Mine Jingguo Wen and Zisheng Lian 73 Temperature Characteristics and Compensation Method of Capacitive Ice Layer Thickness Sensor Dou Yinke and Chang Xiaomin 79 XII Table of Contents – Part I False Alarm Probability of the Digital Channelized Receiver Based CA-CFAR Detector Miao He, Kexin Jia, and Ting Cheng 86 Strong Solution of Initial-Boundary Value Problem for a Class of Nonlinear Thermoelastic Couple Beam Equations Cai-xian Wang and Jian-wen Zhang 92 Initial-Boundary Value Problem for Viscoelastic Rectangular Plate Equation Dongbao Wang and Yinzhu Wang 98 An Invariant Subspace Theorem for Sequentially Subdecomposable Operators Mingxue Liu 104 The Genetic Algorithm in the Test Paper Generation Jian-Jun Hu, Yue-Hong Sun, and Qing-Zhen Xu 109 Applications of Web Mining CDMA Mobile Internet User Behavior Analysis Based on RP Interface Kai Yu, Dazhong He, Yinan Dou, and Zhenming Lei 114 Personalizing Group Recommendation to Social Network Users Leila Esmaeili, Mahdi Nasiri, and Behrouz Minaei-Bidgoli 124 A Novel Frequent Trajectory Mining Method Based on GSP Junhuai Li, Jinqin Wang, Lei Yu, and Jing Zhang 134 Study of a Fuzzy Clustering Algorithm Based on Interval Value HaiZhou Du 141 The Influence of the Fourth-Order Dispersion Coefficient for the Information Transmission in Fiber Jiang Xingfang and Shao Kai 148 Distributed Systems A Research of Resource Scheduling Strategy with SLA Restriction for Cloud Computing Based on Pareto Optimality M×N Production Model Huixi Li and Hao Li A Distributed Processing Method for Design Patent Retrieval System Jiang-Zhong Cao, Jian-Wei Zhu, Xian-Wei Wang, and Qing-Yun Dai 155 166 436 L Yin and D Yang Moreover, in reality, it is often the case that the neural network may be disturbed by environmental noises, which affect the dynamical behaviors In this paper, with stochastic perturbations neural network can be described as follows: dy(t ) = [−Cy (t ) + Ag ( y (t )) + Bg ( y (t − τ (t )))]dt + σ (t , g ( y (t )), g ( y (t − τ (t ))dw(t ) Δy (t k ) = y (t k ) − y (t k− ) = − D k ( y (t k− )), t = t k , k ∈ Z + (3) where w(t ) = ( w1 (t ), w2 (t ), , wm (t )) T ∈ R m is a Brownian motion defined on (Ω, F , P) , and σ (t , x, y ) : R + × R n × R n → R n×m is locally Lipschitz continuous and satisfies the linear growth conditions, i.e., σ (t ,0,0) = For completeness, we first give the following definition and lemma Definition Suppose that μ (t ) is a nonnegative continuous function and satisfies μ (t ) → ∞ as t → ∞ If there exists a scalar M > such that when t > , E y (t ) ≤ M , μ (t ) then system (3) is said to μ (t ) − stable in the mean square Lemma ([4]) For a given matrix S S = 11 S 21 S12 T T > 0, S11 = S11 , S 22 = S 22 S 22 is equivalent to any one of the following conditions: −1 T T −1 (1) S 22 > 0, S11 − S12 S 22 S12 > ; (2) S11 > 0, S 22 − S12 S11 S12 > Main Results C 2,1 ( R n × R + → R + ) denotes the family of all nonnegative functions n + V ( y , t ) on R × R which are continuous once differentiable in t and twice differential in y For each V define an operator LV associated with (3) as Let ， LV = Vt ( y, t ) + V y ( y, t )[− Ay(t ) + Bg ( y(t )) + Cg( y(t − τ (t )))] + trace[σ T V yy ( y , t )σ ] (4) LMI Conditions for Stability of Impulsive Stochastic Neural Networks 437 where Vt ( y, t ) = ∂V ( y, t ) , ∂V ( y , t ) ∂V ( y, t ) T , V y ( y, t ) = ( , , ) ∂t ∂y1 ∂y n V yy ( y, t ) = ( ∂V ( y , t ) ) n×n , j = 1,2, , n ∂yi ∂y j Theorem: Assume that assumptions(H1) and (H2) hold Then the zero solution of system (3) is μ (t ) − stable in the mean square if there exist some constants β1 ≥ 0, ， T > ,two n×n matrices P > 0, Q > , Γ0 ≥ , Γ1 ≥ ,a diagonal positive definite n × n matrice U , and a nonnegative continuous differential function μ (t ) defined on [0,+∞) , such that (1) trace[σ T Pσ ] ≤ g T ( y (t ))Γ0 g ( y (t )) + g T ( y (t − τ (t )))Γ1 g ( y (t − τ (t ))) ; β2 > (2) for t ≥ T , μ (t ) ≤ β1 μ (t ) ， μ (t − τ (t )) ≥ β μ (t ) Σ PB + UΣ * Q + Γ0 − U * * and the following LMIs hold: , ≤0 Γ1 − β Q (1 − ρ ) PC (5) P ( I − Dk ) P * ≥ P where Σ = β1 P − PC − CP − UΣ1 Proof Consider the Lyapunov-Krasovski functional: V ( y, t ) = μ (t ) y T (t ) Py(t ) + t t −τ ( t ) μ ( s ) g T ( y ( s )) Qg ( y ( s )) ds (6) By Ito’s formula, dV ( y, t ) = LV ( y (t ), t )dt + V y ( y, t )σ (t , y (t ), y (t − τ (t )))dw(t ) T LV ( y(t ), t ) = μ (t ){2 y (t ) P[− Ay (t ) + Bg ( y (t )) + Cg ( y (t − τ (t )))]} + μ (t ) y T (t ) Py (t ) + trace[σ T V yy ( y , t )σ ] + μ (t ) g T ( y (t ))Qg ( y (t )) (7) 438 L Yin and D Yang − μ (t − τ (t )) g T ( y (t − τ (t )))Qg ( y (t − τ (t )))[1 − τ(t )] ≤ μ (t ) y T (t )[ μ (t ) u (t ) T P − PA − AP ] y (t ) + 2μ (t ) y (t ) PBg ( y (t )) + 2μ (t ) y T (t ) PCg ( y (t − τ (t ))) + μ (t ) g T ( y (t ))Qg ( y (t )) − μ (t − τ (t )) g T ( y (t − τ (t )))Qg ( y(t − τ (t )))(1 − ρ ) + μ (t )trace[σ T Pσ ] ≤ μ (t ) y T (t )[ μ (t ) u (t ) P − PA − AP ] y (t ) + 2μ (t ) y T (t ) PBg ( y (t )) + 2μ (t ) y T (t ) PCg ( y (t − τ (t ))) + μ (t ) g T ( y (t ))(Q + Γ0 ) g ( y (t )) + μ (t ){g T ( y (t − τ (t )))[Γ1 − Note that, for any n×n μ (t − τ (t )) Q(1 − ρ )]g ( y (t − τ (t )))} μ (t ) (8) diagonal matrices U > it follows that y (t ) μ (t ) g ( y (t )) T − UΣ1 UΣ y (t ) ≥ − U g ( y (t )) * (9) Substituting (9) to (8), we get, for t ≥ T LV ( y (t ), t ) ≤ μ (t ) ⋅ ξ T Ξξ Σ PB + UΣ * * y (t ) , ξ = g ( y(t )) g ( y(t − τ (t ))) Γ1 − α 2Q(1 − ρ ) PC where Ξ = * Q + Γ − U Therefore, from (6), we obtain dV ( y , t ) ≤ μ (t ) ⋅ ξ T Ξξdt + V y ( y, t )σ (t , y (t ), y (t − τ (t )))dw(t ) Taking the mathematical expectation, we get dEV ( y , t ) ≤ μ (t ) ⋅ ξ T Ξξ dt By (5) and (9), we have dEV ( y, t ) ≤ t ∈[tk −1 , tk ) ∩[T ,+∞), k ∈ Z + dt (10) LMI Conditions for Stability of Impulsive Stochastic Neural Networks 439 In addition, we note that P ( I − Dk ) P * ≥0 P I ⇔ 0 ( I − Dk ) P I 0 P P P −1 * ≥0 P −1 P I − Dk ≥0 ⇔ P −1 * which, together with assumption (5) and Lemma implies that P − ( I − Dk )T P( I − Dk ) ≥ Thus it yields − T − − V ( y, t k ) ≤ μ (t k ) y (t k ) Py (t k ) + t tk −τ ( t k ) k μ (s) g T ( y ( s )) Qg ( y ( s )) ds = V ( y, t k− ) Hence, we can deduce that V ( y, t k ) ≤ V ( y, t k− ) k ∈ Z+ (11) By (10) and (11), we know that V is monotonically nonincreasing for t ∈ [T , ∞) which implies that EV ( y, t ) ≤ EV ( y, T ) t ≥T It follows from the definition of V that μ (t )λmin ( P ) E y (t ) ≤ μ (t ) Ey T (t ) PEy (t ) ≤ EV ( y, t ) ≤ M < ∞ , t ≥ where M = max 0≤ s ≤T EV ( y, s ) It implies that E y (t ) ≤ M μ (t )λ ( P ) This completes the proof of Theorem Conclusion In this paper, a sufficient condition for μ -stable in the mean square criteria of impulsive stochastic neural networks with unbounded time-varying delays are 440 L Yin and D Yang derived The results are described in terms of LMIs, which can be easily checked by resorting to available software packages Acknowledgment This work is supported by the National Natural Science Foundation of China (11071276), the Natural Science Foundation of Shandong Province (Y2008A29, ZR2010AL016), the Science and Technology Programs of Shandong Province (2008GG30009008) References Chen, T., Wang, L.: Global mu-stability of delayed neural networks with unbounded timevarying delays IEEE Trans Neural Netw 18, 705–709 (2007) Lakshmikantham, V., Bainov, D., Simeonov, P.: Theory of Impulsive Differential Equations World Scientific, Singapore (1989) Li, X.: Uniform asymptotic stability and global stability of impulsive infinite delay differential equations Nonlinear Anal.: TMA 70, 1975–1983 (2009) Boyd, S., Ghaoui, L.E., Feron, E., Balakrishnan, V.: Linear Matrix Inequalities in System and Control Theory SIAM, Philadelphia (1994) Queuing System M/M/1/T with Priority Dropping Packets Mechanism Based on Living Time Wei Wen1,*, Yequn Wang2, and Henyang Zhang2 Faculty of Information Engineering, Jiangxi University of Science and Technology, Ganzhou, China School of Electronic Engineering, Air Force Engineering University, Xi’an, China ijlgbg@sina.com, hareedzhy@gmail.com Abstract The abstract should summarize the contents of the paper and should contain at least 70 and at most 150 words It should be set in 9-point font size and should be inset 1.0 cm from the right and left margins There should be two blank (10-point) lines before and after the abstract This document is in the required format The standard queuing system M/M/1/N with dropping packets mechanism is based on queue length, which is not an ideal model for air/ground data transmission On the basis of queue theory M/M/1 with priority, the dropping method is proposed according to living time and constructs the M/M/1/T model to improve the scheduling algorithm on the performances of the system’s channel ratio, packet-passing ratio and latency Keywords: Queuing System, priority, M/M/1/T, living time Introduction Ground-to-Air communication system transmit some important information such as flight parameters, weather information, on-vehicle management data from airplane to ground[1-3] Different type of information has different requires on delay For example, the priority of flying parameters are highest and must be transmitted to ground command system quickly, which are important for commander to awareness the state of airplane, and to make decision effectively In other hands, the priority of weather information is lower and its transmission-delay does least favor to terrestrial command system We compare different type of information to client which comes from source, and switch equipment which on the airplane to server, then the processing equipment can be considered as typical queuing system The queuing theory can be used to evaluate * Jiangxi Ganzhou, Master, Lecturer, research direction for the computer network, ad hoc network Z Gong et al (Eds.): WISM 2011, Part I, LNCS 6987, pp 441–446, 2011 © Springer-Verlag Berlin Heidelberg 2011 442 W Wen, Y Wang, and H Zhang the performance of the on-vehicle processing equipment, such as pass-through ratio, channel ratio, packet delay Queuing theory were used to analyze the performance of packet transmission, and some technical literature has made serious research [4-6] The paper [7] discussed the M/G/1 queuing system according to the waiting packet length The paper [8-10] researched priority-based queuing system There queuing mechanism are unsuitable for modeling on-vehicle processing equipment, because they not consider delay accurately The paper [11] considered that when waiting time exceeds special value, the queue drops the packet, and the basis of waiting time is maximizing throughput, other than self-delay M/M/1/T queuing system with priority dropping packets mechanism is proposed based on living time, and relevant important performance is analysis 2.1 Queuing System M/M/1/T with Priority Dropping Packets Mechanism Based on Living Standard M/M/1/N Queuing System and Priority-Based M/M/1 Queuing System In the queuing system, the newer packet comes to queue in given rule, and the corresponding processing equipment deal with these packet in another rule, so it can be thought that the queue carry out the function of receiving and switching When packets coming speed is close to or bigger than packets serving speed, and the maximum queue length can be infinite, the accumulation of packet results in infinite packet-delay To control the packet delay in certain range, there are two methods The first is controlling the waiting queue length When the queue length is bigger than certain value, then system drops the new coming packet[9,10], and the queuing model can be seem in figure The second method is controlling the waiting time When the new coming packet finds that the probable time to wait is bigger than a certain value, and then system drops the packet Because it is difficult to model and compute, the article about this field is few When the packet can be classified in nth level, and there are several packets in the queue, if a higher priority packet comes, then the queue reorders itself, and the queuing model can be seem in figure Fig Standard M/M/1/N queuing system Queuing System M/M/1/T with Priority Dropping Packets Mechanism 443 Fig Standard priority-based M/M/1 queuing system 2.2 M/M/1/T Queuing System The method of restrict the waiting queue length can not satisfy delay requirement of ground-to-air communication system, and the standard priority-based queuing system can not achieve high throughout So schedule mechanism is modified based on living time with priority For standard priority-based M/M/1 queuing system, assumes that two kinds of priority are exist in system, and the packet length is equal, the service time equals to T, and the living time equals to 3T In time T0, the state of queue can be seemed in figure stands for high priority and standards for lower priority Waiting or in service t = T0－ 1 t Living time = 3T t = T0 1 t Remain time = T t = (T0+2T) － t Remain time = T t = (T0+2T) Living time = 3T 1 Dropping packets Fig Standard priority based M/M/1 queuing system t 444 W Wen, Y Wang, and H Zhang － Assumes that there are three priority packets in the queue at time T0 , and a priority packet comes at time T0, and the living time of this packet is 3T, so its remain time is 3T-2T=T at time (T0+2T) A priority packet comes at time (T0+2T), because the newer packet’s priority is higher than 2, the state of reorder queue at time (T0+2T) can be seemed in figure This mechanism results in dropping of lower priority packets To assure better performance and assure the pass-through of higher priority packets, the paper adopts another kind of schedule mechanism, and it can be seemed in figure － Fig Queuing system M/M/1/T with priority dropping packets mechanism based on living time In figure 4, the living time of coming packet equals to 3T, and it will be dropped in FIFO mechanism, but it will continue in work in the new mechanism 2.3 M/M/1/T Queuing System To simplify the problem, the paper considers that there are two kinds of priority in the source, and the coming rates are λ1 and λ2, the packet length equals to L, the service time equals to T The Living times are T1 and T2 The pass-through ratios are SuccessNum1 and SuccessNum2, and the total packet num are TotalNum1 and TotalNum2 (1) Pass-though Ratio η packet = SuccessNum TotalNum (1) (2) Channel Ratio ηchannel = Twork Tall (2) Computing and Modeling The scheduling method of M/M/1/T queuing system is better than FIFO mechanism in the aspects of channel ratio, pass-through ratio Assumes that there are two kinds of priority, the coming rates areλ1 and λ2, The packet length equals to L The living time are T1 and T2 The service time equals to T (L = 100bit, T1 = 0.4s, T2 = 1s, λ1=λ2 = 5) The modeling of system can be seemed in figure Queuing System M/M/1/T with Priority Dropping Packets Mechanism ? ? ? ? ? ? ? ? ? ? ? ? ? FIFO? ? ? ? ? ? ? 0.8 0.6 0.4 0.2 0.1 0.2 0.3 0.4 ? ? ? ? ? ? (s) 0.5 (a) Pass-through ratio (priority 1) ? ? ? ? ? 0.8 0.6 0.4 0.2 ? ? ? ? ? ? ? ? ? ? ? ? ? FIFO? ? 0.1 0.2 0.3 0.4 ? ? ? ? ? ? (s) 0.5 (b) Pass-through ratio (priority 2) ? ? ? ? ? 0.9 0.8 0.7 0.6 ? ? ? ? ? ? ? ? ? ? ? ? ? FIFO? ? 0.5 0.05 0.1 0.15 0.2 0.25 ? ? ? ? ? ? (s) 0.3 (c) Channel ratio Fig The performance of M/M/1/T queuing system 445 446 W Wen, Y Wang, and H Zhang From the figure 5, we can conclude that the performance of M/M/1/T is better than FIFO queuing system Conclusion The paper propose a queuing system M/M/1/T with priority dropping packets mechanism based on living time, then model and analysis the performance of passthrough ratio, channel-ratio and packet delay The concept of living time and the new scheduling mechanism are characteristics of M/M/1/T queuing system Acknowledgment This research is funded by the Aeronautical Science Foundation of China under Grant No.20095596016 and Natural Science Foundation of Shaanxi Province under Grant No.2009JM8010, No.2010JQ8010 and University Doctor Foundation under Grant No.KDYBSQDJJ1002 References Signore, T.L., Girarol, M.: The Aeronautical Telecommunication Network (ATN) In: Proceedings of the Military Communication Conference, vol (1), pp 40–44 (1998) Chavez, P.G., Lamiano, D., Monticone, L., et al.: Spectrum and Capacity Analysis for Air/ground Air Traffic Management Communications In: Integrated Communications, Navigation and Surveillance Conference, ICNS, pp 1–8 (2007) Stacey, D.: Aeronautical Radio Communication Systems and Networks, pp 1–8 (2008) Guesmi, H., Bouallegue, B., Djemal, R., et al.: Advances in Computer, Information, and Systems Sciences, and Engineering, pp 259–267 (2007) Mehlhorn, K., Sanders, P.: Algorithms and Data Structures, pp 127–143 (2008) Lefebvre, M.: Queuing Theory, pp 315–356 (2007) Gray, G., Wang, W.P., Scott, M.: An M/G/1 type queuing model with service times depending on queue length Appl Math Model, 652–658 (1992) Hu, G.S.: The performance analysis of communication network switch on the M/M/s queue with two priorities Journal of Jiangsu University of Science and Technology 23(4), 91–94 (2002) Dai, W.-y.: Diffusion approximations for multiclass queuing networks under preemptive priority service discipline Applied Mathematics and Mechanics 28(10), 1331–1342 (2007) 10 Iravani, F., Balciog̃lu, B.: On priority queues with impatient customers Queueing Systems 58(4), 239–260 (2008) 11 Mason, L., Drwiega, T., Yan, J.: Managing Traffic Performance in Converged Networks, pp 743–753 (2007) 12 Kendall, D.G.: Stochastic Processes Occurring in the Theory of Queues and Their Analysis of by the Method of Imbedded Marov Chains Ann Math Statist 24, 338–354 (1953) 13 Vladimir, V.K.: Mathematical Methods in Queuing Theory Kluwer Academic Publishers, London (1994) Author Index Bai, Xiaolong I-312 Bao, Jian II-154 Bian, Jing II-87 Cai, Yiqing II-224 Cao, Jian I-390 Cao, Jiang-Zhong I-166 Cao, Lai-Cheng I-234 Chatterjee, Kakali I-368 Chen, Deren II-251 Chen, Dongjian II-311 Chen, Feiyan I-312 Chen, Hongda II-292 Chen, Hongqian I-390 Chen, Jun I-200 Chen, Junjie I-419, II-343, II-385 Chen, Qi II-393 Chen, Su-Fen II-139 Chen, Yi I-390 Cheng, Ming Shien II-122 Cheng, Ting I-86, II-335 Cheng, Yi II-204 Corchuelo, Rafael II-282 Cui, Delong I-336 Cui, Lizhen I-175 Cui, Xiaohong II-452 Dai, Qing-Yun I-166 De, Asok I-368 Deng, Hepu I-216 Deng, Hongxia I-66 Di, Haojun II-428, II-436 Ding, Shunli I-352 Ding, Yuan I-11 Dong, Guoqing II-302 Dong, Junping I-304 Dong, Xing II-219 Dong, Yongquan II-369 Dou, Wanchun II-393 Dou, Yinan I-114, I-411 Du, HaiZhou I-141 Duan, Cheng II-44 Duan, Liguo II-343 Esmaeili, Leila I-124 Fan, Hongdan II-219 Feng, Xuechen II-259 Feng, Zhiyong II-79 Fu, Xianghua II-131, II-311 Fu, Yongwei II-420 Fu, Youming I-200 Fujisaka, Tatsuya II-103 Gao, Baolu I-419 Gao, Chang II-292 Gu, Chengjie I-402 Gu, Yeong Hyeon II-242 Guo, Jianzhong II-204 Guo, Pengyu I-184 Guo, Wubiao II-131 Guo, Xueping II-311 Guo, Yanyan II-131 Gupta, Daya I-368 Haghighat, Abolfazl Toroghi I-208 Hamadicharef, Brahim I-35 He, Dazhong I-114 He, Miao I-86, II-335 He, Wei I-175 He, Zhiwei I-294, I-320 Hern´ andez, Inma II-282 Hong, Xiaoguang II-292 Hsu, Ping Yu II-122 Hu, Gang II-27 Hu, Jian-Jun I-109 Hu, Liang I-43, I-312 Hu, Ruimin I-200 Hu, Tianran II-259 Huang, Haiping I-344 Huang, Jian-hua I-271, I-283 Huang, Shilin II-251 Huang, Wenjiang I-251 Hung, Ping Ju II-122 Huo, Huan II-412 Huo, Zhanqiang I-426 Hwang, Doohong II-444 Isazadeh, Ayaz I-192 448 Author Index Jia, Junyao II-343 Jia, Kexin I-86, II-335 Jia, Yubo II-219 Jiang, Dandan II-188 Jiang, Jingjin II-377 Jiang, Kaizhong II-327 Jiang, Nan II-147 Jiang, Yuqian II-196 Jung, Changduk II-444 Kai, Shao I-148 Karimpour, Jaber I-192 Karunasena, Anuradha I-216 Karunasena, Kanishka I-216 Kim, Junghyun II-444 Kim, Kangseok II-444 Kim, Kyung Won II-361 Kim, Mijin I-259 Kim, Wonil II-444 Kwon, Changyoung I-259 Laukens, Niels I-19 Lee, Seok-Pil II-361 Lee, Yung-Cheng I-384 Lee, Yun Ju II-361 Lei, Zhenming I-114 Li, Baoan II-19 Li, Daniel LeZhi I-226 Li, Fachao II-188 Li, Guoqi II-51 Li, Haifang I-66 Li, Hao I-155 Li, Huixi I-155 Li, Junhuai I-134 Li, Lin I-328 Li, Lina II-169 Li, Liuqing II-79 Li, Lu II-327 Li, Peng I-304 Li, Qingzhong I-328, I-376 Li, Rui-lian I-59 Li, Shijin II-377 Li, Wanqi I-294, I-320 Li, Weigang I-226 Li, Xiang II-113 Li, Yanping II-211 Li, Yijun II-35 Li, Yuying I-27, I-51 Lian, Zisheng I-73 Liang, Po-Huei II-403 Lim, Tae-Beom II-361 Lin, Huaizhong II-196 Liu, Guo II-131 Liu, Jiren II-351 Liu, Li II-169 Liu, Mingxue I-104 Liu, Rong II-234 Liu, Xiaoke I-426 Liu, Yihe I-397 Lu, Chunsheng II-224 Lu, Dongming II-196 Lu, Jing II-412 Luktarhan, Nurbol I-43 Luo, Suhuai II-35 Ma, Haixia II-461 Ma, Kun II-11 Ma, Lina II-1 Matton, Mike I-19 Meng, Xiansen II-79 Minaei-Bidgoli, Behrouz Moon, Jae Won II-361 Mu, Xiao-fang I-360 Nasiri, Mahdi Niu, Rui-ping I-124 I-124 I-360 Pang, Qinghua II-27 Pang, Xuejiao II-11 Peng, Dunlu II-412 Peng, Xinguang II-87, II-420 Peng, Zhaohui II-224, II-272, II-292, II-302 Porshokooh, Vahide Rafati I-208 Qi, Lianyong II-393 Qiao, Xiaoyan I-66 Qiu, Lirong II-95 Qiu, Xiaoyu II-95 Rong, Mei II-428, II-436 Ruiz, David II-282 Salimi, Arash Jodeiri I-192 Sang, Lijun II-452 Shen, Junyi II-178 Shi, Dianxi II-113 Shi, Huijuan II-428, II-436 Shi, Yong-hong I-271 Shi, Yuliang I-328, I-376 Author Index Sleiman, Hassan A II-282 Song, Zixing I-312 Sumiya, Kazutoshi II-103 Sun, Gao-feng I-360 Sun, Jingyu II-385 Sun, Junfeng I-184 Sun, Shi-he II-65 Sun, Wei I-11 Sun, Yue-Hong I-109, I-390 Sutter, Robbie De I-19 Tang, Fangfang I-304 Tang, Xin I-344 Tao, Jinyi I-1 Tashtarian, Farzad I-208 Tian, Gang I-200 Tian, Kelun II-160 Tu, Xiao II-44 Van de Walle, Rik I-19 Van Rijsselbergen, Dieter I-19 Wang, Cai-xian I-92 Wang, Chao II-311 Wang, Chaofei II-178 Wang, Dacheng I-251 Wang, Dongbao I-98 Wang, Fei I-11 Wang, Fei-fei I-283 Wang, Heng I-294, I-320 Wang, Huaimin II-113 Wang, Jianfeng II-1 Wang, Jinqin I-134 Wang, Li I-242 Wang, Lijuan II-234 Wang, Ruchuan I-344 Wang, Shuli II-57 Wang, Xian-Wei I-166 Wang, Xiaowei II-251 Wang, Xin II-79, II-178 Wang, Xinjun II-224, II-272 Wang, Xuesong II-196 Wang, Yequn I-441 Wang, Yi II-461 Wang, Yinzhu I-98 Wang, Zhongyuan I-200 Wei, Yi-qiang II-147 Wen, Chih Hao II-122 Wen, Jingguo I-73 Wen, Junhao I-304 Wen, Wei I-441 Weng, Yu II-95 Won, Dongho I-259 Wu, Kehe II-44 Wu, Rui II-211 Wu, Yuanhao I-411 Xia, Guanghu II-219 Xia, ZhengYou II-319 Xiang, Jie I-66 Xiao, Jihai II-452 Xiao, Yang II-51 Xiaomin, Chang I-79 Xie, Mingxia II-204 Xie, Nannan I-43 Xing, Jinsheng II-211 Xingfang, Jiang I-148 Xiong, Shibo I-419 Xiong, Xiaoyan I-419 Xu, Bosheng II-327 Xu, Qing-Zhen I-109 Yan, LiHua I-11 Yan, Zhongmin II-224, II-302 Yang, Bo II-11 Yang, Dianwu I-434 Yang, Jiann-Min II-403 Yang, Jie I-411 Yang, Rutao II-393 Ye, Heming II-461 Yi, Shaojun II-412 Yin, Gang II-113 Yin, Lizi I-434 Yinke, Dou I-79 Yoo, Seong Joon II-242 Yoon, Kyoungro II-361 Yu, Guilan I-336 Yu, Jing II-72 Yu, Kai I-114 Yu, Lei I-134 Yu, Xueli II-385 Yu, Yufeng II-377 Yu, Zhengtao II-169 Yuan, Jingbo I-352 Yuan, Lin II-113 Yumoto, Takayuki II-103 Zeng, Xue-Qiang II-139 Zhan, Bu II-319 Zhang, Chao II-272 449 450 Zhang, Zhang, Zhang, Zhang, Zhang, Zhang, Zhang, Zhang, Zhang, Zhang, Zhang, Zhang, Zhang, Zhang, Zhang, Zhang, Zhang, Author Index Dongyan I-251 Gongjie II-369 Guangquan II-428, II-436 Hai II-87 Haifeng I-27, I-51 Henyang I-441 Jianming II-57 Jian-wen I-92 Jin I-242 Jing I-134 Juan II-51 Kun I-328, I-376, I-411 Shunyi I-402 Wei II-19 Weizhao II-461 Xinfeng I-184 Zhixiao II-302 Zhao, Dazhe II-351 Zhao, Jinling I-251 Zhao, Kuo I-43, I-312 Zhao, Meng II-72 Zhao, Xiangjun II-369 Zhao, Xiaobing II-95 Zheng, Fulan II-211 Zheng, Jianya I-226 Zheng, Xiaolin II-251 Zhong, Ning II-385 Zhou, Jingang II-351 Zhou, Juan II-27 Zhou, Peng I-11 Zhu, Jian-Wei I-166 Zhu, Yanxu II-113 Zou, Hua-Xing II-139 Zuo, Jinglong I-336 ... Conductivity σ (S / m) 1. 5 10 -2 2 10 -1 5 10 -4 10 -1 2 10 -2 0.5 10 -3 5 10 -2 5 10 -3 5 10 -1 2 10 -4 2 10 -2 2 10 -2 2 10 -1 10-3 3 10 -2 3 10 -3 10 -2 5 10 -2 2 10 -0 5 10 -3 10 -1 10 -1 103 It can be seen from... excellent book of Domain-Driven Design [1] In the Z Gong et al (Eds.): WISM 2 011 , Part I, LNCS 6987, pp 11 18 , 2 011 © Springer-Verlag Berlin Heidelberg 2 011 12 F Wang et al category of DDD, domain... (Eds.) Web Information Systems and Mining International Conference, WISM 2 011 Taiyuan, China, September 24-25, 2 011 Proceedings, Part I 13 Volume Editors Zhiguo Gong University of Macau, Department