空间信息处理的P2P分层网络模型的研究
|
摘要
随着空间信息需求的迅猛增长，空间信息处理已经步入集成化、网络化和产业化发展的新时期。现有空间信息处理的网络模型已经不能很好地适应空间信息的分布式处理和共享要求。随着对等网络技术的发展及其在分布式系统中广泛地应用，使用对等网络来解决大规模科学工程问题已成为一种趋势。为了对复杂的空间信息进行管理和维护，提高传输访问和处理效率，迫切需要有一种高效的空间信息处理网络模型。本文重点研究空间信息处理的P2P分层网络模型(SIPPLNM)和所涉及的空间信息分布、空间索引与查询、安全性技术。
由于海量空间信息的处理中往往存在逻辑覆盖网络和物理网络不一致的问题，本文根据空间信息处理的特点，提出一种适用空间信息处理的P2P分层网络模型(SIPPLNM)。该模型分为两层：超级节点层和区域节点层，超级节点层是由负责相应区域的超级节点组成的，区域节点层由一个区域内的所有节点组成。
根据空间信息的邻近性和非均匀分布特点，提出一种基于非均匀Hilbert曲线区域划分方法。通过非均匀Hilbert曲线保持空间对象之间的邻近性，提高空间信息划分区域的均匀性。区域内采用hash空间信息主题方式，实现空间信息在第二层节点的均衡分布。实验表明，本方法能够有效地克服现有空间信息区域划分和分布方法的不足，使其在SIPPLNM各节点中，均有良好的分布均衡性，并且能有效解决空间数据集在实际应用中不均匀分布的问题。
分布式环境中的信任问题是当前网络研究的一个热点问题，而且在SIPPLNM下，因为存在空间关系，导致已有的信任管理模型无法直接使用。本文在基于主观逻辑理论和空间信息实体行为的基础上，提出了一种适合于SIPPLNM的分层信任模型，来处理空间信息实体之间的信任关系。该模型对超级节点间信任关系和域内信任关系分别采取不同的方法进行处理。实验和分析结果表明，这种信任模型能精确地评估空间信息实体之间的信任关系，从而能更加有效地解决对等环境中存在的安全问题。
针对现有并行空间索引方法普遍存在的索引热点和访问瓶颈、以及空间索引结构一致性难以维护等主要缺点，提出了基于SIPPLNM的分布式、分层次的空间索引结构和空间查询算法。通过对索引结构的层次划分，将整个空间索引划分为多个子区域索引集合，从而将索引维护工作最大程度地限制在每个子区域内部，减小了分布式空间索引结构维护的复杂性；详细描述了SIPPLNM的索引操作算法和及其相关空间查询算法，并通过空间查询实验，验证了SIPPLNM索引结构的有效性及其快速的查询响应性能。应用实例分析表明，SIPPLNM能够有效处理非均匀空间信息，分层信任的机制也保证了SIPPLNM稳定运行。
With the rapid development of spatial information, spatial information processing hasentered the new period characterized as being more integrated, industrialized and networkedclosely with network. The existing network model of spatial information processing alreadycan't adapt to the request of distributed processing and sharing of spatial information.Meanwhile, with the development of peer-to-peer network and its comprehensive applicationin distributed system, people tend to solve large-scale scientific issues by using peer-to-peernetwork. In order to manage and maintain complex spatial information efficiently andimprove the efficiency of transmission and processing, there is an urgent need for a newnetwork model of spatial information processing. This paper deals with peer-to-peer layerednetwork model of spatial information processing(SIPPLNM) and involving technologies suchas spatial information distribution, spatial index and query, security.
As some characteristics of spatial information processing and the mismatch between theoverlay and physical network in the management of the magnanimous spatial data, the paperproposes the peer-to-peer layered network model of spatial information processing(SIPPLNM), which consists of super-node layer and inner-district-node layer. Every district isin charged of one super node in the district, and the super-node layer consists of super nodes;the inner-district-node layer consists of all nodes of one district.
According to adjacent relations and non-uniform distribution characteristics of spatialinformation, a geographic division method based on skewed Hilbert curve is presented. Byskewed Hilbert curve, the adjacent relations among objects are kept，and the balanceddistribution of spatial information among districts can be achieved. Inner the district, thebalanced distribution of spatial information in nodes of the second layer is achieved byhashing spatial information subject. Experiments show that this method can effectivelyovercome the drawbacks of existing geographic division and spatial information distributionmethods, and achieve a good storage balance in nodes of SIPPLNM. It is particularly suited tothe uneven distributed spatial data sets.
Trust in distributed environment is a hot topic in network research, while current trustmanagement model can't be used into SIPPLNM directly, for there are spatial relations inspatial information processing. Corresponding to SIPPLNM, the paper develops a layer trustmodel based on subject logic theory and spatial information entity behavior, which describestrust relationships between spatial information entities. It discriminates the trust relationshipsbetween spatial information entities in the same autonomous district and super nodes indifferent districts, and handles the two different trust relationships with different approaches. By simulated experiments, it can evaluate the trust relationships between spatial informationentities precisely, thus can resolve security problems existing in P2P environment effectively.
After analyzing the inherent problems in general distributed spatial index methods suchas index hotspots, access bottlenecks and the difficulty to maintain consistency of distributedspatial index structure, a distributed layer spatial indexing structure and query algorithmsbased on SIPPLNM are presented. By layer indexing structure, the entire spatial index will bedivided into a sets of district index, which helps to restrict the works of index maintaining ineach district itself as much as possible and can reduces the complexity of maintainingdistributed spatial index structure; the detail of the SIPPLNM indexing algorithms as well asrelated query algorithms are illustrated in this paper. Spatial query experiments also verify thevalidity of the SIPPLNM structure and its rapid query response performance.
By analyzing practical application, SIPPLNM can process non-uniform spatialinformation efficiently and run reliably after introducing layer trust model.
由于海量空间信息的处理中往往存在逻辑覆盖网络和物理网络不一致的问题，本文根据空间信息处理的特点，提出一种适用空间信息处理的P2P分层网络模型(SIPPLNM)。该模型分为两层：超级节点层和区域节点层，超级节点层是由负责相应区域的超级节点组成的，区域节点层由一个区域内的所有节点组成。
根据空间信息的邻近性和非均匀分布特点，提出一种基于非均匀Hilbert曲线区域划分方法。通过非均匀Hilbert曲线保持空间对象之间的邻近性，提高空间信息划分区域的均匀性。区域内采用hash空间信息主题方式，实现空间信息在第二层节点的均衡分布。实验表明，本方法能够有效地克服现有空间信息区域划分和分布方法的不足，使其在SIPPLNM各节点中，均有良好的分布均衡性，并且能有效解决空间数据集在实际应用中不均匀分布的问题。
分布式环境中的信任问题是当前网络研究的一个热点问题，而且在SIPPLNM下，因为存在空间关系，导致已有的信任管理模型无法直接使用。本文在基于主观逻辑理论和空间信息实体行为的基础上，提出了一种适合于SIPPLNM的分层信任模型，来处理空间信息实体之间的信任关系。该模型对超级节点间信任关系和域内信任关系分别采取不同的方法进行处理。实验和分析结果表明，这种信任模型能精确地评估空间信息实体之间的信任关系，从而能更加有效地解决对等环境中存在的安全问题。
针对现有并行空间索引方法普遍存在的索引热点和访问瓶颈、以及空间索引结构一致性难以维护等主要缺点，提出了基于SIPPLNM的分布式、分层次的空间索引结构和空间查询算法。通过对索引结构的层次划分，将整个空间索引划分为多个子区域索引集合，从而将索引维护工作最大程度地限制在每个子区域内部，减小了分布式空间索引结构维护的复杂性；详细描述了SIPPLNM的索引操作算法和及其相关空间查询算法，并通过空间查询实验，验证了SIPPLNM索引结构的有效性及其快速的查询响应性能。应用实例分析表明，SIPPLNM能够有效处理非均匀空间信息，分层信任的机制也保证了SIPPLNM稳定运行。
With the rapid development of spatial information, spatial information processing hasentered the new period characterized as being more integrated, industrialized and networkedclosely with network. The existing network model of spatial information processing alreadycan't adapt to the request of distributed processing and sharing of spatial information.Meanwhile, with the development of peer-to-peer network and its comprehensive applicationin distributed system, people tend to solve large-scale scientific issues by using peer-to-peernetwork. In order to manage and maintain complex spatial information efficiently andimprove the efficiency of transmission and processing, there is an urgent need for a newnetwork model of spatial information processing. This paper deals with peer-to-peer layerednetwork model of spatial information processing(SIPPLNM) and involving technologies suchas spatial information distribution, spatial index and query, security.
As some characteristics of spatial information processing and the mismatch between theoverlay and physical network in the management of the magnanimous spatial data, the paperproposes the peer-to-peer layered network model of spatial information processing(SIPPLNM), which consists of super-node layer and inner-district-node layer. Every district isin charged of one super node in the district, and the super-node layer consists of super nodes;the inner-district-node layer consists of all nodes of one district.
According to adjacent relations and non-uniform distribution characteristics of spatialinformation, a geographic division method based on skewed Hilbert curve is presented. Byskewed Hilbert curve, the adjacent relations among objects are kept，and the balanceddistribution of spatial information among districts can be achieved. Inner the district, thebalanced distribution of spatial information in nodes of the second layer is achieved byhashing spatial information subject. Experiments show that this method can effectivelyovercome the drawbacks of existing geographic division and spatial information distributionmethods, and achieve a good storage balance in nodes of SIPPLNM. It is particularly suited tothe uneven distributed spatial data sets.
Trust in distributed environment is a hot topic in network research, while current trustmanagement model can't be used into SIPPLNM directly, for there are spatial relations inspatial information processing. Corresponding to SIPPLNM, the paper develops a layer trustmodel based on subject logic theory and spatial information entity behavior, which describestrust relationships between spatial information entities. It discriminates the trust relationshipsbetween spatial information entities in the same autonomous district and super nodes indifferent districts, and handles the two different trust relationships with different approaches. By simulated experiments, it can evaluate the trust relationships between spatial informationentities precisely, thus can resolve security problems existing in P2P environment effectively.
After analyzing the inherent problems in general distributed spatial index methods suchas index hotspots, access bottlenecks and the difficulty to maintain consistency of distributedspatial index structure, a distributed layer spatial indexing structure and query algorithmsbased on SIPPLNM are presented. By layer indexing structure, the entire spatial index will bedivided into a sets of district index, which helps to restrict the works of index maintaining ineach district itself as much as possible and can reduces the complexity of maintainingdistributed spatial index structure; the detail of the SIPPLNM indexing algorithms as well asrelated query algorithms are illustrated in this paper. Spatial query experiments also verify thevalidity of the SIPPLNM structure and its rapid query response performance.
By analyzing practical application, SIPPLNM can process non-uniform spatialinformation efficiently and run reliably after introducing layer trust model.
引文
[1]边馥苓.空间信息导论[M].北京：测绘出版社，2006：7-10.
[2]陈述彭，鲁学军，周成虎.地理信息系统导论[M].北京：科学出版社，2006：1-10.
[3]王家耀.空间信息系统原理[M].北京：科学出版社，2001：25-38.
[4]龚健雅.当代GIS的若干理论与技术[M].武汉：测绘科技大学出版社，2004：164-187.
[5]Theseira M.Using Internet GIS technology for sharing health and health related data for the West Midlands Region[J].Health & Place，2002，(8)：37-46.
[6]周艳明，陈镇虎.分布式GIS软件体系结构[J].计算机工程，2001，9(27)：37~40.
[7]蔡希尧，刘西洋，边定平.分布系统与分布对象计算[J] .计算机科学，1995，3(22)：9-12.
[8]方裕，邬伦，谢昆青，等.分布式协同计算的GIS技术研究[J] .地理与地理信息科学，2006，22(3)：9 - 12.
[9]彭春华，刘建业，刘岳峰.分布式移动地理信息服务架构及关键技术研究[J] .武汉大学学报工学版.2007，40(2)：133-138.
[10]王方雄，边馥苓.从GISystem到GIService：GISystem发展的必然趋势[J].华中师范大学学报自然科学版，2004，38(4)：528-532.
[11]杨崇俊，王宇翔.万维网地理信息系统发展及前景[J].中国图像图形学报，2001，6(9)：886-894.
[12]边占新，赵占轻，聂振钢.浅谈地球空间信息科学进展及发展趋势[J].石家庄铁路职业技术学院学报，2009，8(1)：62-66.
[13]邬伦，刘瑜，张晶，等.地理信息系统—原理、方法和应用[M].北京：科学出版社，2004：454-462.
[14]Ghandeharizadeh S,Dewitt D J.Hybrid-range partitioning strategy:A new Declusteringstrategy for multip rocessor database Machines[C].Proceedings of the sixteenthinternational conference on Very large databases.Brisbane,Australia, 1990: 481-492.
[15]Li J Z,Srivastava J,Rotem D.CMD:A Multidimensional Ceclustering Method for ParallelDatabase System[C]．Proceedings of the 18th Internatioanl Conference on Very LargeDatabase Conference.Canda:1992.1-14.
[16]Faloutsos C,Bhagwat P.Declustering using fractals[C].Proceedings of the secondinternational conference on Parallel and Distributed Information Systems.San Diego,Californial, United States:1993.18-25.
[17]程学旗,余智华,陆天波,等. P2P技术与信息安全[J].信息技术快报,2004,2(3):1-16.
[18]刘永学,李满春,刘国洪.地理信息系统安全初探.遥感信息[J]，2007.02:71-76.
[18]Gamma E, Helm R, Johnson R, et al.Design Patterns: Elements of Reusable object-OrientedSoftware[M].Addison Wesley: Pearson Education,1995：35-38.
[20]Lua K,Crowcroft J,Pias M,et al.A survey and comparison of peer-to-peer overlay networkschemes[J].IEEE Communications Survey and Tutorial,2005,7(2):72-93.
[21]Zhao B Y,Huang L,Stribling J,et al.Tapestry:A resilient global-scale overlay forservice deployment[J].IEEE Journal on Selected Areas in Communication(JSAC),2004,22:41-53.
[22]Stoica I,Morris R,Liben-Nowell D,et al.Chord: a scalable peer-to-peer lookup protocolfor Internet applications[C].IEEE/ACM Trans Networking, 2003：17-32.
[23]Ratnasamy S,Francis P,Handley M,er al.A scalable content-addressable network[C].Govindan R.Proc of the ACM SIGCOMM.New York:ACM Press,2001:161-172.
[24]Rhea S C,Kubiatowicz J.Probabilistic Location and Routing[C].Proceedings of IEEEINFOCOM，2002:1248-1257.
[25]Saroiu S,Gummadi P K,Gribble S D.Measuring and analyzing the characteristics of napsterand gnutella hosts[J].Multimedia Systems Journal,2003,9(2):170-184.
[26]Handurukande S B,Kermarrec A M,Le Fessant F.Peer sharing behavior in the eDonkey network,and implications for the design of server-less file sharing systems[C]. ACM SIGOPSOperating Systems Review, 2006,40(4):359-371.
[27]Vishnu N,Anand K,Samir D.Design and Evaluation of iMesh:An Infrastructure-modeWireless Mesh Network[C]. Proceedings of the Sixth IEEE International Symposium on aWorld of Wireless Mobile and Multimedia Networks (WoWMoM’05)，2005：164-170.
[28]王珏,周莉. BitTorrent模型原理分析[J].华东交通大学学报. 2009，26(1):82-86.
[29] Korpela E,Werthimer D,Anderson D. SETI@home-massively distributed computing forSETI[J].Computing in Science & Engineering.2001,3(1): 78-83.
[30]Iamnitchi A,Ripeanu M and Foster I.Locating data in (small-world?)P2P scientificcollaborations[C].Proceedings of the 1st International Workshop on Peer-to-Peer Systems(IPTPS'02), 2002:232-241.
[31]Kubiatowicz J,Bindei D,Chen Y.OceanStore:An Architecture for Global-Scale PersistentStorage[C]. Proceedings of the 9th International Conference on Architectural Supportfor Programming Languages and Operating Systems, 2000: 190-201.
[32]Suel T,Mathur C,Wu J,et al. ODISSEA: A peer-to-peer architecture for scalable web searchand information retrieval[C]. Proceedings of the International Workshop on Web andDatabases (WebDB'03).San Diego,California，2003：67-72.
[33]张震，王晓明.对等网中Chord资源查找算法研究[J].计算机工程与应用.2006(11): 121-129.
[34]许斌.JXTA-Java P2P网络编程技术[M].北京：清华大学出版社.2003:261-305.
[35]杨建雄.JXTA平台下P2P网络安全信任模型的研究[D].长沙理工大学硕士论文.2008:2-15.
[36]聂荣，张洪欣，吕英华等.P2P网络的研究与进展[J].电信科学.2008(3):59-61.
[37]张文，赵子铭.P2P网络技术原理与C++开发案例[M].北京:人民邮电出版社.2008:3-30.
[38]Ralf Steinmetz.P2P系统及其应用[M].王玲芳，陈众译.北京:机械工业出版社.2008:12-35.
[39]Guan J H,Zhou S G,Wang L C, et al.Peer-to-Peer based GIS web services.IBM Systems Journal,2004, 41(2): 170-177.
[40]Gottschalk K,Graham S,Kreger H,et al.Introduction to Web services architecture.IBMSystems Journal, 2002, 41(2): 170-177.
[41]Wee S,Ng B,Chin O,et al.Bestpeer:A selfconfigurable peer-to-peer system.Proceedingsof ICDE2002. San Jose, CA: IEEE, 2002:272-272.
[42]马修军，刘晨，谢昆青等.P2P环境中的全局空间数据目录研究.地理与地理信息科学，2006, 5(2):22-25.
[43]Kothari A.Algorithmic issues for resource management in Internet centric computing[D].California: University of California, 2005: 176-219.
[44]Sripanidkulchai K,Maggs B ,Zhang H.Efficient content location using interest-basedlocality in peer-to-peer systems[J].IEEE Infocom on Computer and CommunicationsSocieties,2003:2166 - 2176.
[45]Xu Z Y,Hu Y M.Exploiting spatial locality to improve peer-to-peer system performance[C].Proceedings of The Third IEEE Workshop on Internet Applications[C].2003:121-125.
[46]Cai M,Chervena K A,Fran K M.A peer-to-peer replica location service based on adistributed hash table[C].Proceedings of the Super Computing Conferenc. 2004.
[47]Tanin E,Nayar D,Samet H.An efficient nearest neighbor algorit hm for P2P settings[C].Proceedings of the 5th National Conference on Digital Government Research.2005:21-28.
[48]Pitoura E,Abiteboul S,Pfoser D,et al.DBGlobe:A service-oriented P2P system for globalcomputing [C].ACM SIGMOD Record ,2003:77-82.
[49]王源,刘建永,江南,等.视点相关实时LoD地形模拟动态构网算法[J].测绘学报,2003,32:47-52.
[50]曹华,曹步清,金瓯.基于Web Services的分布式GIS集成的研究[J].电脑开发与应用,2006,19:140-142.
[51]陈静,龚健雅,朱欣焰,等.分布式虚拟地理环境体系结构研究[J].武汉大学学报(信息科学版),2003,28(Suppl):117-119.
[52]罗英伟等,分布式地理信息系统基础研究,计算机工程与应用. 2000,11(1):24-28.
[53]简广林,基于元数据体系的分布式空间数据模型的研究及其在WebGIS中的应用:[D].北京:华北电力大学,2003.
[54]Foster I,Kesselman C,Tuecke S.The Anatomy of the Grid：Enabling Scalable VirtualOrganizations[J].International Journal of High Performance Computing Applications(S1094-3420), 2001，15(3)：200-222.
[55]桂小林.基于Internet的信息网格的软件框架研究[J] .西安交通大学学学报，2004，38 (6)：551-554.
[56]林绍福.面向数字城市的空间信息Web服务互操作与共享平台—北京市信息资源网公众信息服务平台的设计与实现[D]，北京：北京大学，2002：12-15.
[57]Xu F Y,Fang Z Y,Han X.Gippy: Campus GIS Information System Supported by P2P[C].Proceedings of the SAINTW’07,2007：63-65.
[58]李春华,张玮.一种基于P2P网络的WebGIS体系结构[J].地理空间信息,2007,5 (2):22-24.
[59]Liu C,Ma X J,Sun Y F,et al.A peer-to-peer architecture for dynamic executing GIS Webservice composition[C].Proceedings of IGARSS,2005：979-982.
[60]Sun Y F,Ma X J,Xie K Q,et al.A compensation mechanism in GIS Web service composition[A].Proceedings of IGARSS,2005：940-943.
[61]Labovitz C A A,Bose A,Jahanian F.Delayed Internet Routing Convergence[J].IEEE/ ACMTransactionson Networking,2001,9(3):293-306.
[62]Egemen T, Aaron H, Hanan S, et al.A serverless 3D world[C].Proceedings of the 12th AnnualACM International Workshop on Geographic Information Systems. 2004：88-94.
[63]舒娱琴,祝国瑞,陈崇成.虚拟森林场景的构建[J].武汉大学学报(信息科学版),2004,29(6):540-543.
[64]Ganesan P, Yang B, Garcia H, One torus to rule them all:Multi-dimensional queries inp2p systems[C]. Seventh International Workshop on the Web and Databases,2004.
[65]Demirbas M,Ferhatosmanoglu H.Peer-to-peer spatial queries in sensor networks[C].Proceedings of the IEEE International Conference on Peer-to-Peer Computing,2003:32-39.
[66]Mondal A, Yi L, Kitsuregewa M. P2PR-tree: An R-tree Based Spatial Index for Peer-to-PeerEnvironments[C].Proc of the International Workshop on Peer-to-Peer Computing andDatabases.Heraklion, Greece, 2003: 516-525.
[67]Tanin E,Harwood A,Samet H.Using a distributed quadtree index in Peer-to-Peer networks[J].VLDB Journal, 2007,16(2):165-178.
[68]Zhao X H,Fang Y,Chen B.A Distributed Approach for Retrieving Spatial Data InGIS.IEEE,2007:4619-4622.
[69]Christos G,Milena M,Amin S.Random walks in peer-to-peer networks[C].In Proceedings ofIEEE INFOCOM, 2004：120-130.
[70]Faloutsos C,Roseman S.Fractals for Secondary Key Retrieval[A].In Proceedings of the8th ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems[C].Philadelphia,Pennsylvania,United States，1989:247-252.
[71]Abel D J,Mark D M.A comparative analysis of some two-dimensional orderings[J].International Jounal of Geographical Information Systems, 1990, 4(1):12-31.
[72]Moon B,Jagadish H V,Faloutsos C,et a1．Analysis of the clustering properties of theHilbert space-filling curve[J].IEEE Transactions on Knowledge and Data Engineering,2001,13(1):124-141.
[73]赵春宇，孟令奎，林志勇.一种面向并行空间数据库的数据划分算法研究[J].武汉大学学报（信息科学版），2006，31(11)：962-965.
[74]Ohnishi M,Tsuboi S,Hirayama M,et al.Distributive generation algorithm of long rangecontact for remote spatial-data access on P2P Delaunay network. Fifth InternationalConference on Creating, Connecting and Collaborating through Computing(C5'07), 2007:145-152.
[75]Kato H,Ohnishi M,Eguchi T,et al.Autonomous generation of spherical p2p delaunay networkfor global internet applications[C].3rd Proc Conference on Creating, Connecting andCollaborating through Computing (C5),2006:39-46.
[76]Ohnishi M,Nishide R,Ueshima S.Incremental construction of delaunay overlaid networkfor virtual collaborative space[C].3-rd Proc Conference on Creating, Connecting andCollaboratingthrough Computing (C5),2005:77-84.
[77]Yan C D,Zhang Y P,Bai J J.A Voronoi-Neighbor-Based method for measuring neighborobjects’distribution[C].Proceedings of information technology and environmentalsystem sciences,2008:304-309.
[78]沈斌,姚敏,温长洋.一种基于混合模型的时间序列数据挖掘系统[J].中国矿业大学学报,2003,3(3): 284-288.
[79]冯少荣,肖文俊. DBSCAN聚类算法的研究与改进[J].中国矿业大学学报, 2008,37(1): 105-111.
[80] Butz A R.Convergence with Hilbert’s space filling curve[J].Journal of Computer andSystem Sciences,1969,3(2):128-146.
[81]Faloutsos C,Roseman S.Fractals for secondary key retrieval [C].Proceedings of theeighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of Database Systems,1989:247-252.
[82]Lam W M,Shapiro J M.A class of fast algorithms for the Peano-Hilbert space-fillingCurve[M].IEEE Computer Society Press,1994:638-641
[83]曹忠升,张杨,李晨阳.一种基于分划思想的Hilbert曲线快速编码算法[J].计算机工程与科学,2006,28(11):63-65.
[84]高俊.地图学四面体——数字化时代地图学的诊释[J].军事地图制图与地理信息工程的发展与展望，2002,3(10):46-79.
[85]《中国地图学年鉴》编委会.中国地图学年鉴[M].北京:中国地图出版社，1990:49-83.
[86]梁前超.《专题地图》学习知道[J].高等函授学报,1994,6(2):36-39.
[87]高俊,万刚.空间认知的新窗日——地理虚拟空间十年回顾[M].成都:成都地图出版社，2002:56-73.
[88]马耀峰等.地图学原理[M].北京:科学出版社,2004:105-138.
[89]华一新.专题地图设计专家系统[J].郑州:解放军测绘学院,1991,6(12):63-71.
[90]王家耀.普通地图制图综合原理[M].北京:测绘出版社,1993:5-8.
[91]祝国瑞.地图学[M].武汉:武汉大学出版社,2004:157-165.
[92]罗广祥等.现代地图学特点及学科体系[J].西安工程学院学报,2002,9(6):55-57.
[93]祝国瑞，郭礼珍，尹贡白等.地图设计与编绘[M].武汉:武汉大学出版社，2000:205-236.
[94]周海燕.MGIS统计专题图子系统的设计与实现[D].郑州:解放军信息工程大学，2000.
[95]林闯，彭雪海.可信网络研究.计算机学报[J],2005,28(5):751-758.
[96]林闯，田立勤，王元桌.可信网络中用户行为可信的研究，计算机研究与发展[J], 2008,45(12):2033-2043.
[97]Elvis P,Bernd F.Managing Behaviour Trust in Grids Using Statistical Methods of QualityAssurance[C].Third International Symposium on Information Assurance and Security,2007.8:319-324.
[98]吕慧颖，曹元大，刘玉龙.协同商务环境中的主观信任模型研究.计算机集成制造系统[J].2007,13(8):1545-1551.
[99]Seredynski M,Bouvry P,Klopotek M A.Modelling the Evolution of Cooperative Behavior inAdHoc Networks using a Game Based Model.IEEE Symposium on Computational Intelligenceand Games,2007,CIG 2007,2007.4:96-103.
[100]Seredynski M,Bouvry P,Klopotek M A.Evolution of Strategy Driven Behavior in Ad HocNetworks Using a Genetic Algorithm[C].Parallel and Distributed Processing Symposium,2007,IPDPS 2007,2007.3:1-8.
[101]孟祥怡，张光卫，刘常等.基于云模型的主观信任管理模型研究.系统仿真学报[J]，2007.119(14):3310-3317.
[102]田立勤，林闯，杨扬.分布式网络环境下实体行为信任的评估方法.计算机工程与应用[J], 2008,44(17):1-5,48.
[103]Murphy C K.Combining belief functions when evidence conflicts[J].Decision SupportSystems，2000，29（1）：1-9.
[104]邓勇，施文康，朱振福.一种有效处理冲突证据的组合方法[J].红外与毫米波学报，2004，23（l）：27-32.
[105]张军.证据理论中冲突证据的处理及其应用[D].江西：南昌大学，2007:32-33.
[106]王一军,罗大庸,张航.采用信度分级的证据理论合成规则.计算机工程与应用,2009,45(15):41-43.
[107]桂劲松，陈志刚，邓晓衡，刘安丰.基于D-S证据理论的网格服务行为信任模型.计算机工程与应用[J],2007, 43(2) :25-28.
[108]唐文,陈钟.基于模糊集合理论的主观信任管理模型研究[J].软件学报,2003,14(8):1401-1408.
[109]王贞,胡义召.基于模糊处理的P2P信任和声望模型研究.计算机工程与科学, 2009,31(7):20-22
[110]桂劲松，陈志刚，邓晓衡，刘安丰.基于模糊集理论的网格服务行为信任管理模型.小型微型计算机系统[J], 2007.128(10):1779-1783.
[111]李德毅,孟海军,史雪梅.隶属云和隶属云发生器[J].计算机研究和发展,1995,32 (6):16-21.
[112]孟祥怡，张光卫，刘常等.基于云模型的主观信任管理模型研究.系统仿真学报[J]，2007.119(14):3310-3317.
[113]路峰，吴慧中.网格环境下基于云模型的信任评估与决策方法研究.系统仿真学报[J]，2009.21(2):421-426.
[114]胡冬萍.一种新的基于网格环境的行为信任管理模型.计算机应用与软件[J],2007.124(10):200-201.
[115]林齐宁.决策分析[M].北京:北京邮电大学出版社, 2003:102-115.
[116]冀铁果，田立勤，胡志兴，等.可信网络中一种基于AHP的实体行为评估方法.计算机工程与应用[J].2007,43(19) :123-126.
[117]张徐,高承实,戴青,等.网格环境下基于灰色理论多属性综合信任评价模型.计算机应用研究,2009,26(6):2148-2150.
[118] JΦsang A.A logic for uncertain probabilities[J].International Journal OfUncertainty Fuzziness and Knowledge-Based Systems,2001,9(3): 279-311.
[119]温浩宇、任小龙、徐国华，一种基于D-S理论的P2P网络信任模型[J].西安电子科技大大学学报，2005,32(3):400-402,451.
[120]Chong S K,Abawajy J H,Dew R A.A multilevel trust management framework[C].International Conference on Computer and Information Science,2007:776-781.
[121]Conrad M, French T, Huang Wei,et al.A lightweight model of trust propagation in amulti-client network environment[C]. First International Conference on Availability,Reliability and Security, ARES 2006, 2006:482-487.
[122]Hwang J,Lee C H, Kim S Y.Trust embedded grid system for the harmonization of practicalrequirements[C].IEEE International Conference onServices Computing,IEEE SCC2005:51-60.
[123]Azzedin F,Maheswaran M.Evolving and managing trust in grid computing systems[C].Conference on Electrical and Computer Engineering.Canada: IEEE Computer Society Press,2002:1424-1429.
[124]Grandison T,Sloman M.A survey of trust in internet applications[J].IEEECommunications Surveys, 2000,3(4): 2-16.
[125]Wang Y,Vassileva J.Bayesian network- based trust model Web Intelligence[C].IEEE WICInternational Conference on Web Intelligence,2003:372-378.
[126]刘玉龙，曹天元，李剑.一种新型推荐信任模型[J].计算机工程与应用，2004，29：47-49，80.
[127]何锐，牛建伟，胡建平.一种开放网络环境中的不确定信任模型[J].北京航空航天大学学报，2004,30(11):1125-1128.
[128]Bentley J L.Multidimensional binary search trees used for associative searching[J].Communications of the ACM, 1975, 18(9): 509-517.
[129]Robinson J T.The K-D-B-Tree: A Search Structure for Large Multidimensional DynamicIndexes[C].ACM-SIGMOD International Conference on Management of Data. New York: ACMPress,1981:10-18.
[130]Samet H. The quadtree and related hierarchical data structures[J].ACM Computer Surveys,1984, 16(2):187-260.
[131]Kedem C.The quad-CIF tree: a data structure for hierarchical on-line algorithms[C].Proceedings of the 19th Design Automation conference. New York: ACM Press, 1982: 352-357.
[132]Guttman A.R-trees a dynamic mdex structure for spatial searching[C]. ACM SIGMOD. NewYork: ACM Press, 1984: 47-57
[133]Sellis T K,Roussopoulos N.The R+-Tree: A dynamic index for mufti-dimensionalobjects[C].Proceeding of the 13th VLDB. Brighton,ACM Press, 1987:507-518.
[134]Beckman N,Kriegel H P.The R*-tree: An efficient and robust access method for pointsAnd rectangles[C].Proceedings of ACM SIGMOD Conference. New York,ACM Press, 1990:332-331.
[135]Kamel I,Faloutsos C.Parallel R-trees[C].Proceedings of SIGMOD.California,1992:195-204.
[136]Papadopoulos A,Manolopoulos Y.Similarity query processing using disk arrays[C].Proceedings of SIGMOD. Washington, 1998: 225-236.
[137]Koudas N,Faloutsos C,Kamel I.Declustering spatial databases on a multicomputerarchitecture[C].Proceedings of EDBT. London,1996: 592-614.
[138]Roussopoulos N, Leifker D.Direct spatial search on pictorial databases Using PackedR-Trees[C].SIGMOD 1985. New York, 1985: 7-31.
[139]Nieckau S,Buchner H.The Grid File: An adaptable, symmetric rnultikey file structure[J].CM Trans Database Syst, 1984, 9(1):38-71.
[140]Kim S W,Whang K Y, Kim J H.Linearity in directory growth of the multilevel grid file[J].Information and Software Technology, 1997, 39(13): 897-908.
[141]Harwood A,Tanin E.Hashing spatial content over peer-to-peer networks[C]. Proceedingsof ATNAC. Australian,2003: 1-5.
[142]Tanin E,Harwood A,Samet H.Indexing distributed complex data for complex queries[C].Proceedings of the 2004 annual national conference on Digital government research.Seattle, 2004:1-10.
[143]Tanin E,Harwood A.A distributed quadtree index for peer-to-peer settings[C].Proceedings of the 21 st International Conference on Data Engineering.Washington, DC:IEEE Computer Society, 2005:254-255.
[144]Samet H,Tanin E,Golubchik L.Scalable data collection infrastructure for digitalgovernment applications[C].Proceedings of the 5th National Conference on DigitalGovernment Research. New York,2004: 305-306.
[145]Tanin E,Nayar D,Samet H.An efficient nearest neighbor algorithm for P2P settings[C].Proceedings of the 2005 national conference on Digital government research,Atlanta,2005:21-28.
[146]Yao A C.Space-time tradeoff for answering range queries[C].Proceedings of thefourteenth annual ACM symposium on Theory of computing. San Francisc,1982:128-136.
[147]徐雷鸣,庞博,赵耀.NS与网格模拟[M].北京:人民邮电出版社. 2003：13-20.
[2]陈述彭，鲁学军，周成虎.地理信息系统导论[M].北京：科学出版社，2006：1-10.
[3]王家耀.空间信息系统原理[M].北京：科学出版社，2001：25-38.
[4]龚健雅.当代GIS的若干理论与技术[M].武汉：测绘科技大学出版社，2004：164-187.
[5]Theseira M.Using Internet GIS technology for sharing health and health related data for the West Midlands Region[J].Health & Place，2002，(8)：37-46.
[6]周艳明，陈镇虎.分布式GIS软件体系结构[J].计算机工程，2001，9(27)：37~40.
[7]蔡希尧，刘西洋，边定平.分布系统与分布对象计算[J] .计算机科学，1995，3(22)：9-12.
[8]方裕，邬伦，谢昆青，等.分布式协同计算的GIS技术研究[J] .地理与地理信息科学，2006，22(3)：9 - 12.
[9]彭春华，刘建业，刘岳峰.分布式移动地理信息服务架构及关键技术研究[J] .武汉大学学报工学版.2007，40(2)：133-138.
[10]王方雄，边馥苓.从GISystem到GIService：GISystem发展的必然趋势[J].华中师范大学学报自然科学版，2004，38(4)：528-532.
[11]杨崇俊，王宇翔.万维网地理信息系统发展及前景[J].中国图像图形学报，2001，6(9)：886-894.
[12]边占新，赵占轻，聂振钢.浅谈地球空间信息科学进展及发展趋势[J].石家庄铁路职业技术学院学报，2009，8(1)：62-66.
[13]邬伦，刘瑜，张晶，等.地理信息系统—原理、方法和应用[M].北京：科学出版社，2004：454-462.
[14]Ghandeharizadeh S,Dewitt D J.Hybrid-range partitioning strategy:A new Declusteringstrategy for multip rocessor database Machines[C].Proceedings of the sixteenthinternational conference on Very large databases.Brisbane,Australia, 1990: 481-492.
[15]Li J Z,Srivastava J,Rotem D.CMD:A Multidimensional Ceclustering Method for ParallelDatabase System[C]．Proceedings of the 18th Internatioanl Conference on Very LargeDatabase Conference.Canda:1992.1-14.
[16]Faloutsos C,Bhagwat P.Declustering using fractals[C].Proceedings of the secondinternational conference on Parallel and Distributed Information Systems.San Diego,Californial, United States:1993.18-25.
[17]程学旗,余智华,陆天波,等. P2P技术与信息安全[J].信息技术快报,2004,2(3):1-16.
[18]刘永学,李满春,刘国洪.地理信息系统安全初探.遥感信息[J]，2007.02:71-76.
[18]Gamma E, Helm R, Johnson R, et al.Design Patterns: Elements of Reusable object-OrientedSoftware[M].Addison Wesley: Pearson Education,1995：35-38.
[20]Lua K,Crowcroft J,Pias M,et al.A survey and comparison of peer-to-peer overlay networkschemes[J].IEEE Communications Survey and Tutorial,2005,7(2):72-93.
[21]Zhao B Y,Huang L,Stribling J,et al.Tapestry:A resilient global-scale overlay forservice deployment[J].IEEE Journal on Selected Areas in Communication(JSAC),2004,22:41-53.
[22]Stoica I,Morris R,Liben-Nowell D,et al.Chord: a scalable peer-to-peer lookup protocolfor Internet applications[C].IEEE/ACM Trans Networking, 2003：17-32.
[23]Ratnasamy S,Francis P,Handley M,er al.A scalable content-addressable network[C].Govindan R.Proc of the ACM SIGCOMM.New York:ACM Press,2001:161-172.
[24]Rhea S C,Kubiatowicz J.Probabilistic Location and Routing[C].Proceedings of IEEEINFOCOM，2002:1248-1257.
[25]Saroiu S,Gummadi P K,Gribble S D.Measuring and analyzing the characteristics of napsterand gnutella hosts[J].Multimedia Systems Journal,2003,9(2):170-184.
[26]Handurukande S B,Kermarrec A M,Le Fessant F.Peer sharing behavior in the eDonkey network,and implications for the design of server-less file sharing systems[C]. ACM SIGOPSOperating Systems Review, 2006,40(4):359-371.
[27]Vishnu N,Anand K,Samir D.Design and Evaluation of iMesh:An Infrastructure-modeWireless Mesh Network[C]. Proceedings of the Sixth IEEE International Symposium on aWorld of Wireless Mobile and Multimedia Networks (WoWMoM’05)，2005：164-170.
[28]王珏,周莉. BitTorrent模型原理分析[J].华东交通大学学报. 2009，26(1):82-86.
[29] Korpela E,Werthimer D,Anderson D. SETI@home-massively distributed computing forSETI[J].Computing in Science & Engineering.2001,3(1): 78-83.
[30]Iamnitchi A,Ripeanu M and Foster I.Locating data in (small-world?)P2P scientificcollaborations[C].Proceedings of the 1st International Workshop on Peer-to-Peer Systems(IPTPS'02), 2002:232-241.
[31]Kubiatowicz J,Bindei D,Chen Y.OceanStore:An Architecture for Global-Scale PersistentStorage[C]. Proceedings of the 9th International Conference on Architectural Supportfor Programming Languages and Operating Systems, 2000: 190-201.
[32]Suel T,Mathur C,Wu J,et al. ODISSEA: A peer-to-peer architecture for scalable web searchand information retrieval[C]. Proceedings of the International Workshop on Web andDatabases (WebDB'03).San Diego,California，2003：67-72.
[33]张震，王晓明.对等网中Chord资源查找算法研究[J].计算机工程与应用.2006(11): 121-129.
[34]许斌.JXTA-Java P2P网络编程技术[M].北京：清华大学出版社.2003:261-305.
[35]杨建雄.JXTA平台下P2P网络安全信任模型的研究[D].长沙理工大学硕士论文.2008:2-15.
[36]聂荣，张洪欣，吕英华等.P2P网络的研究与进展[J].电信科学.2008(3):59-61.
[37]张文，赵子铭.P2P网络技术原理与C++开发案例[M].北京:人民邮电出版社.2008:3-30.
[38]Ralf Steinmetz.P2P系统及其应用[M].王玲芳，陈众译.北京:机械工业出版社.2008:12-35.
[39]Guan J H,Zhou S G,Wang L C, et al.Peer-to-Peer based GIS web services.IBM Systems Journal,2004, 41(2): 170-177.
[40]Gottschalk K,Graham S,Kreger H,et al.Introduction to Web services architecture.IBMSystems Journal, 2002, 41(2): 170-177.
[41]Wee S,Ng B,Chin O,et al.Bestpeer:A selfconfigurable peer-to-peer system.Proceedingsof ICDE2002. San Jose, CA: IEEE, 2002:272-272.
[42]马修军，刘晨，谢昆青等.P2P环境中的全局空间数据目录研究.地理与地理信息科学，2006, 5(2):22-25.
[43]Kothari A.Algorithmic issues for resource management in Internet centric computing[D].California: University of California, 2005: 176-219.
[44]Sripanidkulchai K,Maggs B ,Zhang H.Efficient content location using interest-basedlocality in peer-to-peer systems[J].IEEE Infocom on Computer and CommunicationsSocieties,2003:2166 - 2176.
[45]Xu Z Y,Hu Y M.Exploiting spatial locality to improve peer-to-peer system performance[C].Proceedings of The Third IEEE Workshop on Internet Applications[C].2003:121-125.
[46]Cai M,Chervena K A,Fran K M.A peer-to-peer replica location service based on adistributed hash table[C].Proceedings of the Super Computing Conferenc. 2004.
[47]Tanin E,Nayar D,Samet H.An efficient nearest neighbor algorit hm for P2P settings[C].Proceedings of the 5th National Conference on Digital Government Research.2005:21-28.
[48]Pitoura E,Abiteboul S,Pfoser D,et al.DBGlobe:A service-oriented P2P system for globalcomputing [C].ACM SIGMOD Record ,2003:77-82.
[49]王源,刘建永,江南,等.视点相关实时LoD地形模拟动态构网算法[J].测绘学报,2003,32:47-52.
[50]曹华,曹步清,金瓯.基于Web Services的分布式GIS集成的研究[J].电脑开发与应用,2006,19:140-142.
[51]陈静,龚健雅,朱欣焰,等.分布式虚拟地理环境体系结构研究[J].武汉大学学报(信息科学版),2003,28(Suppl):117-119.
[52]罗英伟等,分布式地理信息系统基础研究,计算机工程与应用. 2000,11(1):24-28.
[53]简广林,基于元数据体系的分布式空间数据模型的研究及其在WebGIS中的应用:[D].北京:华北电力大学,2003.
[54]Foster I,Kesselman C,Tuecke S.The Anatomy of the Grid：Enabling Scalable VirtualOrganizations[J].International Journal of High Performance Computing Applications(S1094-3420), 2001，15(3)：200-222.
[55]桂小林.基于Internet的信息网格的软件框架研究[J] .西安交通大学学学报，2004，38 (6)：551-554.
[56]林绍福.面向数字城市的空间信息Web服务互操作与共享平台—北京市信息资源网公众信息服务平台的设计与实现[D]，北京：北京大学，2002：12-15.
[57]Xu F Y,Fang Z Y,Han X.Gippy: Campus GIS Information System Supported by P2P[C].Proceedings of the SAINTW’07,2007：63-65.
[58]李春华,张玮.一种基于P2P网络的WebGIS体系结构[J].地理空间信息,2007,5 (2):22-24.
[59]Liu C,Ma X J,Sun Y F,et al.A peer-to-peer architecture for dynamic executing GIS Webservice composition[C].Proceedings of IGARSS,2005：979-982.
[60]Sun Y F,Ma X J,Xie K Q,et al.A compensation mechanism in GIS Web service composition[A].Proceedings of IGARSS,2005：940-943.
[61]Labovitz C A A,Bose A,Jahanian F.Delayed Internet Routing Convergence[J].IEEE/ ACMTransactionson Networking,2001,9(3):293-306.
[62]Egemen T, Aaron H, Hanan S, et al.A serverless 3D world[C].Proceedings of the 12th AnnualACM International Workshop on Geographic Information Systems. 2004：88-94.
[63]舒娱琴,祝国瑞,陈崇成.虚拟森林场景的构建[J].武汉大学学报(信息科学版),2004,29(6):540-543.
[64]Ganesan P, Yang B, Garcia H, One torus to rule them all:Multi-dimensional queries inp2p systems[C]. Seventh International Workshop on the Web and Databases,2004.
[65]Demirbas M,Ferhatosmanoglu H.Peer-to-peer spatial queries in sensor networks[C].Proceedings of the IEEE International Conference on Peer-to-Peer Computing,2003:32-39.
[66]Mondal A, Yi L, Kitsuregewa M. P2PR-tree: An R-tree Based Spatial Index for Peer-to-PeerEnvironments[C].Proc of the International Workshop on Peer-to-Peer Computing andDatabases.Heraklion, Greece, 2003: 516-525.
[67]Tanin E,Harwood A,Samet H.Using a distributed quadtree index in Peer-to-Peer networks[J].VLDB Journal, 2007,16(2):165-178.
[68]Zhao X H,Fang Y,Chen B.A Distributed Approach for Retrieving Spatial Data InGIS.IEEE,2007:4619-4622.
[69]Christos G,Milena M,Amin S.Random walks in peer-to-peer networks[C].In Proceedings ofIEEE INFOCOM, 2004：120-130.
[70]Faloutsos C,Roseman S.Fractals for Secondary Key Retrieval[A].In Proceedings of the8th ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems[C].Philadelphia,Pennsylvania,United States，1989:247-252.
[71]Abel D J,Mark D M.A comparative analysis of some two-dimensional orderings[J].International Jounal of Geographical Information Systems, 1990, 4(1):12-31.
[72]Moon B,Jagadish H V,Faloutsos C,et a1．Analysis of the clustering properties of theHilbert space-filling curve[J].IEEE Transactions on Knowledge and Data Engineering,2001,13(1):124-141.
[73]赵春宇，孟令奎，林志勇.一种面向并行空间数据库的数据划分算法研究[J].武汉大学学报（信息科学版），2006，31(11)：962-965.
[74]Ohnishi M,Tsuboi S,Hirayama M,et al.Distributive generation algorithm of long rangecontact for remote spatial-data access on P2P Delaunay network. Fifth InternationalConference on Creating, Connecting and Collaborating through Computing(C5'07), 2007:145-152.
[75]Kato H,Ohnishi M,Eguchi T,et al.Autonomous generation of spherical p2p delaunay networkfor global internet applications[C].3rd Proc Conference on Creating, Connecting andCollaborating through Computing (C5),2006:39-46.
[76]Ohnishi M,Nishide R,Ueshima S.Incremental construction of delaunay overlaid networkfor virtual collaborative space[C].3-rd Proc Conference on Creating, Connecting andCollaboratingthrough Computing (C5),2005:77-84.
[77]Yan C D,Zhang Y P,Bai J J.A Voronoi-Neighbor-Based method for measuring neighborobjects’distribution[C].Proceedings of information technology and environmentalsystem sciences,2008:304-309.
[78]沈斌,姚敏,温长洋.一种基于混合模型的时间序列数据挖掘系统[J].中国矿业大学学报,2003,3(3): 284-288.
[79]冯少荣,肖文俊. DBSCAN聚类算法的研究与改进[J].中国矿业大学学报, 2008,37(1): 105-111.
[80] Butz A R.Convergence with Hilbert’s space filling curve[J].Journal of Computer andSystem Sciences,1969,3(2):128-146.
[81]Faloutsos C,Roseman S.Fractals for secondary key retrieval [C].Proceedings of theeighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of Database Systems,1989:247-252.
[82]Lam W M,Shapiro J M.A class of fast algorithms for the Peano-Hilbert space-fillingCurve[M].IEEE Computer Society Press,1994:638-641
[83]曹忠升,张杨,李晨阳.一种基于分划思想的Hilbert曲线快速编码算法[J].计算机工程与科学,2006,28(11):63-65.
[84]高俊.地图学四面体——数字化时代地图学的诊释[J].军事地图制图与地理信息工程的发展与展望，2002,3(10):46-79.
[85]《中国地图学年鉴》编委会.中国地图学年鉴[M].北京:中国地图出版社，1990:49-83.
[86]梁前超.《专题地图》学习知道[J].高等函授学报,1994,6(2):36-39.
[87]高俊,万刚.空间认知的新窗日——地理虚拟空间十年回顾[M].成都:成都地图出版社，2002:56-73.
[88]马耀峰等.地图学原理[M].北京:科学出版社,2004:105-138.
[89]华一新.专题地图设计专家系统[J].郑州:解放军测绘学院,1991,6(12):63-71.
[90]王家耀.普通地图制图综合原理[M].北京:测绘出版社,1993:5-8.
[91]祝国瑞.地图学[M].武汉:武汉大学出版社,2004:157-165.
[92]罗广祥等.现代地图学特点及学科体系[J].西安工程学院学报,2002,9(6):55-57.
[93]祝国瑞，郭礼珍，尹贡白等.地图设计与编绘[M].武汉:武汉大学出版社，2000:205-236.
[94]周海燕.MGIS统计专题图子系统的设计与实现[D].郑州:解放军信息工程大学，2000.
[95]林闯，彭雪海.可信网络研究.计算机学报[J],2005,28(5):751-758.
[96]林闯，田立勤，王元桌.可信网络中用户行为可信的研究，计算机研究与发展[J], 2008,45(12):2033-2043.
[97]Elvis P,Bernd F.Managing Behaviour Trust in Grids Using Statistical Methods of QualityAssurance[C].Third International Symposium on Information Assurance and Security,2007.8:319-324.
[98]吕慧颖，曹元大，刘玉龙.协同商务环境中的主观信任模型研究.计算机集成制造系统[J].2007,13(8):1545-1551.
[99]Seredynski M,Bouvry P,Klopotek M A.Modelling the Evolution of Cooperative Behavior inAdHoc Networks using a Game Based Model.IEEE Symposium on Computational Intelligenceand Games,2007,CIG 2007,2007.4:96-103.
[100]Seredynski M,Bouvry P,Klopotek M A.Evolution of Strategy Driven Behavior in Ad HocNetworks Using a Genetic Algorithm[C].Parallel and Distributed Processing Symposium,2007,IPDPS 2007,2007.3:1-8.
[101]孟祥怡，张光卫，刘常等.基于云模型的主观信任管理模型研究.系统仿真学报[J]，2007.119(14):3310-3317.
[102]田立勤，林闯，杨扬.分布式网络环境下实体行为信任的评估方法.计算机工程与应用[J], 2008,44(17):1-5,48.
[103]Murphy C K.Combining belief functions when evidence conflicts[J].Decision SupportSystems，2000，29（1）：1-9.
[104]邓勇，施文康，朱振福.一种有效处理冲突证据的组合方法[J].红外与毫米波学报，2004，23（l）：27-32.
[105]张军.证据理论中冲突证据的处理及其应用[D].江西：南昌大学，2007:32-33.
[106]王一军,罗大庸,张航.采用信度分级的证据理论合成规则.计算机工程与应用,2009,45(15):41-43.
[107]桂劲松，陈志刚，邓晓衡，刘安丰.基于D-S证据理论的网格服务行为信任模型.计算机工程与应用[J],2007, 43(2) :25-28.
[108]唐文,陈钟.基于模糊集合理论的主观信任管理模型研究[J].软件学报,2003,14(8):1401-1408.
[109]王贞,胡义召.基于模糊处理的P2P信任和声望模型研究.计算机工程与科学, 2009,31(7):20-22
[110]桂劲松，陈志刚，邓晓衡，刘安丰.基于模糊集理论的网格服务行为信任管理模型.小型微型计算机系统[J], 2007.128(10):1779-1783.
[111]李德毅,孟海军,史雪梅.隶属云和隶属云发生器[J].计算机研究和发展,1995,32 (6):16-21.
[112]孟祥怡，张光卫，刘常等.基于云模型的主观信任管理模型研究.系统仿真学报[J]，2007.119(14):3310-3317.
[113]路峰，吴慧中.网格环境下基于云模型的信任评估与决策方法研究.系统仿真学报[J]，2009.21(2):421-426.
[114]胡冬萍.一种新的基于网格环境的行为信任管理模型.计算机应用与软件[J],2007.124(10):200-201.
[115]林齐宁.决策分析[M].北京:北京邮电大学出版社, 2003:102-115.
[116]冀铁果，田立勤，胡志兴，等.可信网络中一种基于AHP的实体行为评估方法.计算机工程与应用[J].2007,43(19) :123-126.
[117]张徐,高承实,戴青,等.网格环境下基于灰色理论多属性综合信任评价模型.计算机应用研究,2009,26(6):2148-2150.
[118] JΦsang A.A logic for uncertain probabilities[J].International Journal OfUncertainty Fuzziness and Knowledge-Based Systems,2001,9(3): 279-311.
[119]温浩宇、任小龙、徐国华，一种基于D-S理论的P2P网络信任模型[J].西安电子科技大大学学报，2005,32(3):400-402,451.
[120]Chong S K,Abawajy J H,Dew R A.A multilevel trust management framework[C].International Conference on Computer and Information Science,2007:776-781.
[121]Conrad M, French T, Huang Wei,et al.A lightweight model of trust propagation in amulti-client network environment[C]. First International Conference on Availability,Reliability and Security, ARES 2006, 2006:482-487.
[122]Hwang J,Lee C H, Kim S Y.Trust embedded grid system for the harmonization of practicalrequirements[C].IEEE International Conference onServices Computing,IEEE SCC2005:51-60.
[123]Azzedin F,Maheswaran M.Evolving and managing trust in grid computing systems[C].Conference on Electrical and Computer Engineering.Canada: IEEE Computer Society Press,2002:1424-1429.
[124]Grandison T,Sloman M.A survey of trust in internet applications[J].IEEECommunications Surveys, 2000,3(4): 2-16.
[125]Wang Y,Vassileva J.Bayesian network- based trust model Web Intelligence[C].IEEE WICInternational Conference on Web Intelligence,2003:372-378.
[126]刘玉龙，曹天元，李剑.一种新型推荐信任模型[J].计算机工程与应用，2004，29：47-49，80.
[127]何锐，牛建伟，胡建平.一种开放网络环境中的不确定信任模型[J].北京航空航天大学学报，2004,30(11):1125-1128.
[128]Bentley J L.Multidimensional binary search trees used for associative searching[J].Communications of the ACM, 1975, 18(9): 509-517.
[129]Robinson J T.The K-D-B-Tree: A Search Structure for Large Multidimensional DynamicIndexes[C].ACM-SIGMOD International Conference on Management of Data. New York: ACMPress,1981:10-18.
[130]Samet H. The quadtree and related hierarchical data structures[J].ACM Computer Surveys,1984, 16(2):187-260.
[131]Kedem C.The quad-CIF tree: a data structure for hierarchical on-line algorithms[C].Proceedings of the 19th Design Automation conference. New York: ACM Press, 1982: 352-357.
[132]Guttman A.R-trees a dynamic mdex structure for spatial searching[C]. ACM SIGMOD. NewYork: ACM Press, 1984: 47-57
[133]Sellis T K,Roussopoulos N.The R+-Tree: A dynamic index for mufti-dimensionalobjects[C].Proceeding of the 13th VLDB. Brighton,ACM Press, 1987:507-518.
[134]Beckman N,Kriegel H P.The R*-tree: An efficient and robust access method for pointsAnd rectangles[C].Proceedings of ACM SIGMOD Conference. New York,ACM Press, 1990:332-331.
[135]Kamel I,Faloutsos C.Parallel R-trees[C].Proceedings of SIGMOD.California,1992:195-204.
[136]Papadopoulos A,Manolopoulos Y.Similarity query processing using disk arrays[C].Proceedings of SIGMOD. Washington, 1998: 225-236.
[137]Koudas N,Faloutsos C,Kamel I.Declustering spatial databases on a multicomputerarchitecture[C].Proceedings of EDBT. London,1996: 592-614.
[138]Roussopoulos N, Leifker D.Direct spatial search on pictorial databases Using PackedR-Trees[C].SIGMOD 1985. New York, 1985: 7-31.
[139]Nieckau S,Buchner H.The Grid File: An adaptable, symmetric rnultikey file structure[J].CM Trans Database Syst, 1984, 9(1):38-71.
[140]Kim S W,Whang K Y, Kim J H.Linearity in directory growth of the multilevel grid file[J].Information and Software Technology, 1997, 39(13): 897-908.
[141]Harwood A,Tanin E.Hashing spatial content over peer-to-peer networks[C]. Proceedingsof ATNAC. Australian,2003: 1-5.
[142]Tanin E,Harwood A,Samet H.Indexing distributed complex data for complex queries[C].Proceedings of the 2004 annual national conference on Digital government research.Seattle, 2004:1-10.
[143]Tanin E,Harwood A.A distributed quadtree index for peer-to-peer settings[C].Proceedings of the 21 st International Conference on Data Engineering.Washington, DC:IEEE Computer Society, 2005:254-255.
[144]Samet H,Tanin E,Golubchik L.Scalable data collection infrastructure for digitalgovernment applications[C].Proceedings of the 5th National Conference on DigitalGovernment Research. New York,2004: 305-306.
[145]Tanin E,Nayar D,Samet H.An efficient nearest neighbor algorithm for P2P settings[C].Proceedings of the 2005 national conference on Digital government research,Atlanta,2005:21-28.
[146]Yao A C.Space-time tradeoff for answering range queries[C].Proceedings of thefourteenth annual ACM symposium on Theory of computing. San Francisc,1982:128-136.
[147]徐雷鸣,庞博,赵耀.NS与网格模拟[M].北京:人民邮电出版社. 2003：13-20.