基于非并行布朗运动的土壤胶体分形凝聚模拟算法改进
耗时长是目前进行大规模体系分形凝聚模拟的主要障碍。该文采用优化存储结构来降低时间复杂度的思路,对传统On-lattice集团凝聚模型算法进行了改进。用三维数组表征模拟体系,用链表表征团簇结构,实现了在体系中直接访问任意团簇,以及确定组成团簇单粒在三维数组中对应数组元素具体位置的新方法。论文基于新的存储结构重新设计了集团凝聚模型中布朗运动、碰撞检测和凝聚的算法,使得模拟算法的总时间复杂度从立方阶变为了线性阶。该改进算法为研究人员进行大规模体系分形凝聚模拟提供了技术支撑。...
Saved in:
| Published in | 农业工程学报 Vol. 31; no. 6; pp. 129 - 134 |
|---|---|
| Main Author | |
| Format | Journal Article |
| Language | Chinese |
| Published |
西南大学三峡库区生态环境教育部重点实验室，重庆400715
2015
西南大学土壤多尺度界面过程与调控重庆市重点实验室，重庆400715%西南大学资源环境学院，重庆400715 西南大学三峡库区生态环境教育部重点实验室，重庆400715%西南大学土壤多尺度界面过程与调控重庆市重点实验室，重庆400715 西南大学计算机与信息科学学院，重庆400715 |
| Subjects | |
| Online Access | Get full text |
| ISSN | 1002-6819 |
| DOI | 10.3969/j.issn.1002-6819.2015.06.018 |
Cover
| Abstract | 耗时长是目前进行大规模体系分形凝聚模拟的主要障碍。该文采用优化存储结构来降低时间复杂度的思路,对传统On-lattice集团凝聚模型算法进行了改进。用三维数组表征模拟体系,用链表表征团簇结构,实现了在体系中直接访问任意团簇,以及确定组成团簇单粒在三维数组中对应数组元素具体位置的新方法。论文基于新的存储结构重新设计了集团凝聚模型中布朗运动、碰撞检测和凝聚的算法,使得模拟算法的总时间复杂度从立方阶变为了线性阶。该改进算法为研究人员进行大规模体系分形凝聚模拟提供了技术支撑。 |
|---|---|
| AbstractList | 耗时长是目前进行大规模体系分形凝聚模拟的主要障碍。该文采用优化存储结构来降低时间复杂度的思路,对传统On-lattice集团凝聚模型算法进行了改进。用三维数组表征模拟体系,用链表表征团簇结构,实现了在体系中直接访问任意团簇,以及确定组成团簇单粒在三维数组中对应数组元素具体位置的新方法。论文基于新的存储结构重新设计了集团凝聚模型中布朗运动、碰撞检测和凝聚的算法,使得模拟算法的总时间复杂度从立方阶变为了线性阶。该改进算法为研究人员进行大规模体系分形凝聚模拟提供了技术支撑。 TP391.9; 耗时长是目前进行大规模体系分形凝聚模拟的主要障碍。该文采用优化存储结构来降低时间复杂度的思路，对传统On-lattice集团凝聚模型算法进行了改进。用三维数组表征模拟体系，用链表表征团簇结构，实现了在体系中直接访问任意团簇，以及确定组成团簇单粒在三维数组中对应数组元素具体位置的新方法。论文基于新的存储结构重新设计了集团凝聚模型中布朗运动、碰撞检测和凝聚的算法，使得模拟算法的总时间复杂度从立方阶变为了线性阶。该改进算法为研究人员进行大规模体系分形凝聚模拟提供了技术支撑。 |
| Abstract_FL | The cluster-cluster aggregation (CCA) model bridges the study of colloid aggregation by computer simulation and laboratory experiment. Two distinct and limiting regimes of irreversible colloid aggregation have been identified by computer simulation with the CCA model. One regime is diffusion-limited cluster aggregation (DLCA) corresponding to the rapid colloid aggregation. The other is reaction-limited cluster aggregation (RLCA) corresponding to the slow colloid aggregation. The simulations of the two regimes are both start with N non-overlapping identical particles distributed randomly in a cubic box with side-lengths of L. A three dimensional array, hypothetically named Cube[L][L][L], was usually used to represent the cubic box. Each particle in the cubic box occupies an element of the three dimensional array and are labeled with a different integer. When particles and/or clusters collide and aggregate, all particles in the resulting cluster are modified with the same label (one of them). The progression of Brownian movement and aggregation are realized by updating the labels of the corresponding array elements. However, a critical issue in this kind of simulation is how to efficiently distinguish all of the particles in any selected cluster only based on the three dimensional array Cube[L][L][L] when the cluster is to be moved. Similarly, there are difficulties in the process of collision detection to locate all neighboring positions of the cluster. The traditional method must perform exhaustive search in the whole system, what’s more, this kind of exhaustive search will repeated over and over again in the simulation progression. In this paper, the traditional on-lattice CCA algorithm is optimized by improving the storage structure to reduce the time complexity, in which the simulation system is represented by a three dimensional array, while the clusters in the system are simultaneously stored by the linked lists respectively in programming. Another one dimensional array Cluster[N] is used to organize the linked lists and store the basic attributes of the clusters in the system. Initially, N linked lists, each only has one node, are created for the N randomly placed particles. After a cluster is moved, its particles is examined to determine whether any other clusters have been contacted via nearest neighbor occupancy. If aggregation does occur after the collision detection, the simple operation is to link the corresponding clusters. After an aggregation, the array Cluster should be indexed simultaneously because there may be some vacant linked lists. In the later random selection for the potential movement, these vacant linked lists should not be in the candidate lists. For the indexing, a one dimensional array Index[N] is used to store the non-vacant linked list subscripts of the array Cluster[N]. The current length of the Index is the number of the remaining clusters in the system. For example, if the new generated random number for the random selection is k, the label of the next moving cluster should be Index [k], and the linked list of this cluster is exactly linked by Cluster [Index[k]]. From this entry, all the particles in the cluster can be easily accessed. And then, the positions of the six neighboring boxes of each particle in the cluster can also be accessed by the element subscripts of the array Cube, which is needed for the collision detection. Brownian motion, collision detection and aggregation as the basic operations in the CCA simulation are all improved based on the compounded data structure. The results show that the new algorithm achieves linear time complexity from three cubed time complexity. This is a great contribution for researchers in large scale simulation of fractal aggregation. |
| Author | 熊海灵 杨志敏 李航 |
| AuthorAffiliation | 西南大学计算机与信息科学学院,重庆400715 西南大学土壤多尺度界面过程与调控重庆市重点实验室,重庆400715 西南大学资源环境学院,重庆400715 西南大学三峡库区生态环境教育部重点实验室,重庆400715 |
| AuthorAffiliation_xml | – name: 西南大学计算机与信息科学学院，重庆400715; 西南大学土壤多尺度界面过程与调控重庆市重点实验室，重庆400715%西南大学资源环境学院，重庆400715; 西南大学三峡库区生态环境教育部重点实验室，重庆400715%西南大学土壤多尺度界面过程与调控重庆市重点实验室，重庆400715; 西南大学三峡库区生态环境教育部重点实验室，重庆400715 |
| Author_FL | Li Hang Xiong Hailing Yang Zhimin |
| Author_FL_xml | – sequence: 1 fullname: Xiong Hailing – sequence: 2 fullname: Yang Zhimin – sequence: 3 fullname: Li Hang |
| Author_xml | – sequence: 1 fullname: 熊海灵 杨志敏 李航 |
| BookMark | eNo9j81LAkEAxedgkJn_RASddpuP3dmdY0hfIHTxLrMfYys1lkuUxzAqKiKoEEwTq4OnLoGkIP4zzrr9F60YwYMHjx_v8ZZASlakD8AqgjphlK2X9SAMpY4gxBq1EdMxRKYOqQ6RnQLp_3wRZMMwcKCJiAWhgdJgR3WGk-H9T_tVDfpx905916NWIx4_qJvetHmhWh31_hHX-5PRo7q-VKM3ddWOz5tRrxvddqafjejrOXoaxOOXZbAg-EHoZ_88Awpbm4Xcjpbf297NbeQ112S25jBEiOdCnMhAnFuUesRFHhK2a7jYFQxDUxDqOSbDQhCf2bbl-JgJH3OHWyQD1ua1p1wKLkvFcuWkKpPBoqyV3DNndhzS5HZCrsxJd78iS8dBwh5Vg0NerRUpNYgxaya_CDt3yA |
| ClassificationCodes | TP391.9 |
| ContentType | Journal Article |
| Copyright | Copyright © Wanfang Data Co. Ltd. All Rights Reserved. |
| Copyright_xml | – notice: Copyright © Wanfang Data Co. Ltd. All Rights Reserved. |
| DBID | 2RA 92L CQIGP W95 ~WA 2B. 4A8 92I 93N PSX TCJ |
| DOI | 10.3969/j.issn.1002-6819.2015.06.018 |
| DatabaseName | 维普期刊资源整合服务平台 中文科技期刊数据库-CALIS站点 维普中文期刊数据库 中文科技期刊数据库-农业科学 中文科技期刊数据库- 镜像站点 Wanfang Data Journals - Hong Kong WANFANG Data Centre Wanfang Data Journals 万方数据期刊 - 香港版 China Online Journals (COJ) China Online Journals (COJ) |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Agriculture |
| DocumentTitleAlternate | Improved simulation algorithm for soil colloid fractal aggregation based on unparallel Brownian motion |
| DocumentTitle_FL | Improved simulation algorithm for soil colloid fractal aggregation based on unparallel Brownian motion |
| EndPage | 134 |
| ExternalDocumentID | nygcxb201506018 664349887 |
| GrantInformation_xml | – fundername: 国家自然科学基金资助项目; 中央高校基本科研业务费专项资金资助 funderid: (41271292); (XDJK2013C154) |
| GroupedDBID | -04 2B. 2B~ 2RA 5XA 5XE 92G 92I 92L ABDBF ABJNI ACGFO ACGFS AEGXH AIAGR ALMA_UNASSIGNED_HOLDINGS CCEZO CHDYS CQIGP CW9 EOJEC FIJ IPNFZ OBODZ RIG TCJ TGD TUS U1G U5N W95 ~WA 4A8 93N ACUHS PSX |
| ID | FETCH-LOGICAL-c598-b9133dc02c0241aa766d3c1d1f8c4c2cf9205f36db592ff3e9887be29fe2aba73 |
| ISSN | 1002-6819 |
| IngestDate | Thu May 29 04:04:19 EDT 2025 Wed Feb 14 10:30:18 EST 2024 |
| IsPeerReviewed | false |
| IsScholarly | true |
| Issue | 6 |
| Keywords | 分形凝聚 models 集团凝聚 时间复杂度 模型 data structure time complexity soil fractal aggregation colloids 数据结构 土壤 胶体 cluster-cluster aggregation |
| Language | Chinese |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c598-b9133dc02c0241aa766d3c1d1f8c4c2cf9205f36db592ff3e9887be29fe2aba73 |
| Notes | 11-2047/S soil; models; colloids; fractal aggregation; cluster-cluster aggregation; data structure; time complexity The cluster-cluster aggregation（CCA） model bridges the study of colloid aggregation by computer simulation and laboratory experiment. Two distinct and limiting regimes of irreversible colloid aggregation have been identified by computer simulation with the CCA model. One regime is diffusion-limited cluster aggregation（DLCA） corresponding to the rapid colloid aggregation. The other is reaction-limited cluster aggregation（RLCA） corresponding to the slow colloid aggregation. The simulations of the two regimes are both start with N non-overlapping identical particles distributed randomly in a cubic box with side-lengths of L. A three dimensional array, hypothetically named Cube[L][L][L], was usually used to represent the cubic box. Each particle in the cubic box occupies an element of the three dimensional array and are labeled with a different integer. When particles and/or clusters collide and aggre |
| PageCount | 6 |
| ParticipantIDs | wanfang_journals_nygcxb201506018 chongqing_primary_664349887 |
| PublicationCentury | 2000 |
| PublicationDate | 2015 |
| PublicationDateYYYYMMDD | 2015-01-01 |
| PublicationDate_xml | – year: 2015 text: 2015 |
| PublicationDecade | 2010 |
| PublicationTitle | 农业工程学报 |
| PublicationTitleAlternate | Transactions of the Chinese Society of Agricultural Engineering |
| PublicationTitle_FL | Transactions of the Chinese Society of Agricultural Engineering |
| PublicationYear | 2015 |
| Publisher | 西南大学三峡库区生态环境教育部重点实验室，重庆400715 西南大学土壤多尺度界面过程与调控重庆市重点实验室，重庆400715%西南大学资源环境学院，重庆400715 西南大学三峡库区生态环境教育部重点实验室，重庆400715%西南大学土壤多尺度界面过程与调控重庆市重点实验室，重庆400715 西南大学计算机与信息科学学院，重庆400715 |
| Publisher_xml | – name: 西南大学三峡库区生态环境教育部重点实验室，重庆400715%西南大学土壤多尺度界面过程与调控重庆市重点实验室，重庆400715 – name: 西南大学计算机与信息科学学院，重庆400715 – name: 西南大学三峡库区生态环境教育部重点实验室，重庆400715 – name: 西南大学土壤多尺度界面过程与调控重庆市重点实验室，重庆400715%西南大学资源环境学院，重庆400715 |
| SSID | ssib051370041 ssib017478172 ssj0041925 ssib001101065 ssib023167668 |
| Score | 2.0947454 |
| Snippet | 耗时长是目前进行大规模体系分形凝聚模拟的主要障碍。该文采用优化存储结构来降低时间复杂度的思路,对传统On-lattice集团凝聚模型算法进行了改进。用三维数组表征模拟体系,... TP391.9; 耗时长是目前进行大规模体系分形凝聚模拟的主要障碍。该文采用优化存储结构来降低时间复杂度的思路，对传统On-lattice集团凝聚模型算法进行了改进。用三维数组表征... |
| SourceID | wanfang chongqing |
| SourceType | Aggregation Database Publisher |
| StartPage | 129 |
| SubjectTerms | 分形凝聚 土壤 数据结构 时间复杂度 模型 胶体 集团凝聚 |
| Title | 基于非并行布朗运动的土壤胶体分形凝聚模拟算法改进 |
| URI | http://lib.cqvip.com/qk/90712X/201506/664349887.html https://d.wanfangdata.com.cn/periodical/nygcxb201506018 |
| Volume | 31 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVEBS databaseName: EBSCOhost Academic Search Ultimate issn: 1002-6819 databaseCode: ABDBF dateStart: 20140101 customDbUrl: https://search.ebscohost.com/login.aspx?authtype=ip,shib&custid=s3936755&profile=ehost&defaultdb=asn isFulltext: true dateEnd: 99991231 titleUrlDefault: https://search.ebscohost.com/direct.asp?db=asn omitProxy: true ssIdentifier: ssj0041925 providerName: EBSCOhost – providerCode: PRVALS databaseName: IngentaConnect Open Access Journals issn: 1002-6819 databaseCode: FIJ dateStart: 20090101 customDbUrl: isFulltext: true dateEnd: 20151231 titleUrlDefault: http://www.ingentaconnect.com/content/title?j_type=online&j_startat=Aa&j_endat=Af&j_pagesize=200&j_page=1 omitProxy: true ssIdentifier: ssj0041925 providerName: Ingenta |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3Na9RAFB9qC6IH8RNrVXronGTrTmYmmTlOdrMUQU8VeluSbLL1stXagvYmFRUVEVQKtbVUPfTkRSi2UPrPNNv1v_C92el2_aCoEMLwZvJ7v8wLb14mmTeEjMXCS1TGs5JSOi8JnUIJJCUee7FKpefndh-ym7f8idvixpScGhgo-v5amp9LxtOFP64r-R-rggzsiqtk_8GyPVAQQBnsC2ewMJz_ysY0klTXaGhoJPCsIhppqqtUR1gVahr6NFLUMKoqVqKo4jTyqa5QHWBVWKO6jFXKUKNoFFANOMIiVxAcCoZTI7AxXIuAoAtUcHsVCH2LXKXGs5IACWBjhlCgy1gCUFChBQyoiax2n4acamn5CGTr-IT9EbPFtIRRr7KYoA5ApIVSCIskgYBvtcCNyIPnCJsoK0Nt9jqUMChfs3qr9q6l1WspAR9VO6jDDlV4k8b0T490l4Y6X47O3lfOIztn74acO795buYmXrpBAOvOsP46vnDtazu-oILxngL8Q1DaNLBuLPk5g7cPUZ_Q4M2PkSEPp40GyZAJq2HtMG5l-Grec6wMNzVghwuaPUxX4B--F0rGcVeC3r9M-CVf2s_6jtBxMubYXj-KK-YTmZ5pNe9BlGQXrbXyuNXsi68mT5NT7sVo1HSf8jNkYGH6LDlpmrMuOUx2jkwUa9t726--r34otjY76y-Lb4vtlaXO7uvi-cb-8uNiZa349LmzuLm386Z49qTY-Vg8Xe08Wm5vrLdfrO1_WWp_fdd-u9XZfX-eTNaiycpEye0EUkqlVqVEM84badmDQ7A4hr5o8JQ1WK5SkXpprr2yzLnfSKT28pxn2NlJ5uk88-IkDvgFMtiaaWUXyWiq46TMZcYFT4UWSczSOCg3AqHKvkq1HCYjvS6p3-0mfKn3DDhMRl0n1Z0buF9vPWymDxKvm6qTqUtHAoyQE9iyO4d3mQzOzc5nVyCqnUuuumfiB6ECg4Q |
| linkProvider | EBSCOhost |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=%E5%9F%BA%E4%BA%8E%E9%9D%9E%E5%B9%B6%E8%A1%8C%E5%B8%83%E6%9C%97%E8%BF%90%E5%8A%A8%E7%9A%84%E5%9C%9F%E5%A3%A4%E8%83%B6%E4%BD%93%E5%88%86%E5%BD%A2%E5%87%9D%E8%81%9A%E6%A8%A1%E6%8B%9F%E7%AE%97%E6%B3%95%E6%94%B9%E8%BF%9B&rft.jtitle=%E5%86%9C%E4%B8%9A%E5%B7%A5%E7%A8%8B%E5%AD%A6%E6%8A%A5&rft.au=%E7%86%8A%E6%B5%B7%E7%81%B5+%E6%9D%A8%E5%BF%97%E6%95%8F+%E6%9D%8E%E8%88%AA&rft.date=2015&rft.issn=1002-6819&rft.volume=31&rft.issue=6&rft.spage=129&rft.epage=134&rft_id=info:doi/10.3969%2Fj.issn.1002-6819.2015.06.018&rft.externalDocID=664349887 |
| thumbnail_s | http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=http%3A%2F%2Fimage.cqvip.com%2Fvip1000%2Fqk%2F90712X%2F90712X.jpg http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=http%3A%2F%2Fwww.wanfangdata.com.cn%2Fimages%2FPeriodicalImages%2Fnygcxb%2Fnygcxb.jpg |