Complex Traffic Network Analysis Method Based on a Multiscale Aggregation Model

Identifying the aggregation characteristics of the geospatial network is an important aspect of analyzing highway traffic networks. Based on the complex network theory, this paper studies the block aggregation characteristics of the highway traffic network and proposes an Improved PageRank Spectral...
Ausführliche Beschreibung

Gespeichert in:

Autor*in:	Yingying Pei [verfasserIn] Xia Zhu [verfasserIn] Guohong Li [verfasserIn] Yongtao Jin [verfasserIn] Yuyan Liu [verfasserIn] Yuanping Liu [verfasserIn] Gang Liu [verfasserIn] Jiangxia Fan [verfasserIn]

Format:	E-Artikel
Sprache:	Englisch

Erschienen:	2022

Übergeordnetes Werk:	In: Journal of Sensors - Hindawi Limited, 2008, (2022)
Übergeordnetes Werk:	year:2022

Links:	Link aufrufen Link aufrufen Link aufrufen Journal toc

DOI / URN:	10.1155/2022/7311117

Katalog-ID:	DOAJ048874140

Internformat


LEADER	01000caa a22002652 4500
001	DOAJ048874140
003	DE-627
005	20230502143953.0
007	cr uuu---uuuuu
008	230227s2022 xx \|\|\|\|\|o 00\| \|\|eng c
024	7		\|a 10.1155/2022/7311117 \|2 doi
035			\|a (DE-627)DOAJ048874140
035			\|a (DE-599)DOAJace3be95ecb04464998db7cfef9af73a
040			\|a DE-627 \|b ger \|c DE-627 \|e rakwb
041			\|a eng
050		0	\|a T1-995
100	0		\|a Yingying Pei \|e verfasserin \|4 aut
245	1	0	\|a Complex Traffic Network Analysis Method Based on a Multiscale Aggregation Model
264		1	\|c 2022
336			\|a Text \|b txt \|2 rdacontent
337			\|a Computermedien \|b c \|2 rdamedia
338			\|a Online-Ressource \|b cr \|2 rdacarrier
520			\|a Identifying the aggregation characteristics of the geospatial network is an important aspect of analyzing highway traffic networks. Based on the complex network theory, this paper studies the block aggregation characteristics of the highway traffic network and proposes an Improved PageRank Spectral Clustering (IPSC) Algorithm to divide the functional blocks of highway traffic networks. Firstly, the theoretical model of a highway traffic network is constructed by adding location attribute weight, geographical distance weight, road grade weight, and dynamic traffic congestion weight. Secondly, the improved PageRank algorithm is used to get the ranking of key nodes of the highway traffic network. The clustering center and the number of clusters are determined by the ranking of key nodes and the shortest path distance. Then the improved spectral clustering algorithm is used to divide the functional blocks of the highway transportation network and identify the special common blocks of the highway transportation network. Finally, the IPSC Algorithm is used to analyze the aggregation mode of complex traffic networks at city and district scales. Crossing the limit of administrative division, the division results of special common blocks of highway transportation networks are obtained. Maintaining the connectivity between blocks can improve the overall efficiency of highway transportation networks.
653		0	\|a Technology (General)
700	0		\|a Xia Zhu \|e verfasserin \|4 aut
700	0		\|a Guohong Li \|e verfasserin \|4 aut
700	0		\|a Yongtao Jin \|e verfasserin \|4 aut
700	0		\|a Yuyan Liu \|e verfasserin \|4 aut
700	0		\|a Yuanping Liu \|e verfasserin \|4 aut
700	0		\|a Gang Liu \|e verfasserin \|4 aut
700	0		\|a Jiangxia Fan \|e verfasserin \|4 aut
773	0	8	\|i In \|t Journal of Sensors \|d Hindawi Limited, 2008 \|g (2022) \|w (DE-627)550736751 \|w (DE-600)2397931-8 \|x 1687725X \|7 nnns
773	1	8	\|g year:2022
856	4	0	\|u https://doi.org/10.1155/2022/7311117 \|z kostenfrei
856	4	0	\|u https://doaj.org/article/ace3be95ecb04464998db7cfef9af73a \|z kostenfrei
856	4	0	\|u http://dx.doi.org/10.1155/2022/7311117 \|z kostenfrei
856	4	2	\|u https://doaj.org/toc/1687-7268 \|y Journal toc \|z kostenfrei
912			\|a GBV_USEFLAG_A
912			\|a SYSFLAG_A
912			\|a GBV_DOAJ
912			\|a SSG-OLC-PHA
912			\|a GBV_ILN_11
912			\|a GBV_ILN_20
912			\|a GBV_ILN_22
912			\|a GBV_ILN_23
912			\|a GBV_ILN_24
912			\|a GBV_ILN_31
912			\|a GBV_ILN_39
912			\|a GBV_ILN_40
912			\|a GBV_ILN_60
912			\|a GBV_ILN_62
912			\|a GBV_ILN_63
912			\|a GBV_ILN_65
912			\|a GBV_ILN_69
912			\|a GBV_ILN_70
912			\|a GBV_ILN_73
912			\|a GBV_ILN_95
912			\|a GBV_ILN_105
912			\|a GBV_ILN_110
912			\|a GBV_ILN_151
912			\|a GBV_ILN_161
912			\|a GBV_ILN_165
912			\|a GBV_ILN_170
912			\|a GBV_ILN_171
912			\|a GBV_ILN_213
912			\|a GBV_ILN_224
912			\|a GBV_ILN_230
912			\|a GBV_ILN_285
912			\|a GBV_ILN_293
912			\|a GBV_ILN_370
912			\|a GBV_ILN_602
912			\|a GBV_ILN_636
912			\|a GBV_ILN_2003
912			\|a GBV_ILN_2004
912			\|a GBV_ILN_2005
912			\|a GBV_ILN_2006
912			\|a GBV_ILN_2007
912			\|a GBV_ILN_2010
912			\|a GBV_ILN_2011
912			\|a GBV_ILN_2014
912			\|a GBV_ILN_2026
912			\|a GBV_ILN_2027
912			\|a GBV_ILN_2034
912			\|a GBV_ILN_2037
912			\|a GBV_ILN_2038
912			\|a GBV_ILN_2044
912			\|a GBV_ILN_2048
912			\|a GBV_ILN_2050
912			\|a GBV_ILN_2055
912			\|a GBV_ILN_2056
912			\|a GBV_ILN_2057
912			\|a GBV_ILN_2059
912			\|a GBV_ILN_2061
912			\|a GBV_ILN_2064
912			\|a GBV_ILN_2068
912			\|a GBV_ILN_2088
912			\|a GBV_ILN_2106
912			\|a GBV_ILN_2108
912			\|a GBV_ILN_2110
912			\|a GBV_ILN_2111
912			\|a GBV_ILN_2118
912			\|a GBV_ILN_2122
912			\|a GBV_ILN_2143
912			\|a GBV_ILN_2144
912			\|a GBV_ILN_2147
912			\|a GBV_ILN_2148
912			\|a GBV_ILN_2152
912			\|a GBV_ILN_2153
912			\|a GBV_ILN_2232
912			\|a GBV_ILN_2470
912			\|a GBV_ILN_2507
912			\|a GBV_ILN_2522
912			\|a GBV_ILN_4012
912			\|a GBV_ILN_4035
912			\|a GBV_ILN_4037
912			\|a GBV_ILN_4046
912			\|a GBV_ILN_4112
912			\|a GBV_ILN_4125
912			\|a GBV_ILN_4126
912			\|a GBV_ILN_4242
912			\|a GBV_ILN_4249
912			\|a GBV_ILN_4251
912			\|a GBV_ILN_4305
912			\|a GBV_ILN_4306
912			\|a GBV_ILN_4307
912			\|a GBV_ILN_4313
912			\|a GBV_ILN_4322
912			\|a GBV_ILN_4323
912			\|a GBV_ILN_4324
912			\|a GBV_ILN_4325
912			\|a GBV_ILN_4326
912			\|a GBV_ILN_4333
912			\|a GBV_ILN_4334
912			\|a GBV_ILN_4335
912			\|a GBV_ILN_4336
912			\|a GBV_ILN_4338
912			\|a GBV_ILN_4367
912			\|a GBV_ILN_4700
951			\|a AR
952			\|j 2022

Indexfelder

author_variant	y p yp x z xz g l gl y j yj y l yl y l yl g l gl j f jf
matchkey_str	article:1687725X:2022----::opetafcewraayimtobsdnmlic
hierarchy_sort_str	2022
callnumber-subject-code	T
publishDate	2022
allfields	10.1155/2022/7311117 doi (DE-627)DOAJ048874140 (DE-599)DOAJace3be95ecb04464998db7cfef9af73a DE-627 ger DE-627 rakwb eng T1-995 Yingying Pei verfasserin aut Complex Traffic Network Analysis Method Based on a Multiscale Aggregation Model 2022 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Identifying the aggregation characteristics of the geospatial network is an important aspect of analyzing highway traffic networks. Based on the complex network theory, this paper studies the block aggregation characteristics of the highway traffic network and proposes an Improved PageRank Spectral Clustering (IPSC) Algorithm to divide the functional blocks of highway traffic networks. Firstly, the theoretical model of a highway traffic network is constructed by adding location attribute weight, geographical distance weight, road grade weight, and dynamic traffic congestion weight. Secondly, the improved PageRank algorithm is used to get the ranking of key nodes of the highway traffic network. The clustering center and the number of clusters are determined by the ranking of key nodes and the shortest path distance. Then the improved spectral clustering algorithm is used to divide the functional blocks of the highway transportation network and identify the special common blocks of the highway transportation network. Finally, the IPSC Algorithm is used to analyze the aggregation mode of complex traffic networks at city and district scales. Crossing the limit of administrative division, the division results of special common blocks of highway transportation networks are obtained. Maintaining the connectivity between blocks can improve the overall efficiency of highway transportation networks. Technology (General) Xia Zhu verfasserin aut Guohong Li verfasserin aut Yongtao Jin verfasserin aut Yuyan Liu verfasserin aut Yuanping Liu verfasserin aut Gang Liu verfasserin aut Jiangxia Fan verfasserin aut In Journal of Sensors Hindawi Limited, 2008 (2022) (DE-627)550736751 (DE-600)2397931-8 1687725X nnns year:2022 https://doi.org/10.1155/2022/7311117 kostenfrei https://doaj.org/article/ace3be95ecb04464998db7cfef9af73a kostenfrei http://dx.doi.org/10.1155/2022/7311117 kostenfrei https://doaj.org/toc/1687-7268 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ SSG-OLC-PHA GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_165 GBV_ILN_170 GBV_ILN_171 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_636 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2007 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2037 GBV_ILN_2038 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2057 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2068 GBV_ILN_2088 GBV_ILN_2106 GBV_ILN_2108 GBV_ILN_2110 GBV_ILN_2111 GBV_ILN_2118 GBV_ILN_2122 GBV_ILN_2143 GBV_ILN_2144 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2232 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_4012 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4046 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4336 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 2022
spelling	10.1155/2022/7311117 doi (DE-627)DOAJ048874140 (DE-599)DOAJace3be95ecb04464998db7cfef9af73a DE-627 ger DE-627 rakwb eng T1-995 Yingying Pei verfasserin aut Complex Traffic Network Analysis Method Based on a Multiscale Aggregation Model 2022 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Identifying the aggregation characteristics of the geospatial network is an important aspect of analyzing highway traffic networks. Based on the complex network theory, this paper studies the block aggregation characteristics of the highway traffic network and proposes an Improved PageRank Spectral Clustering (IPSC) Algorithm to divide the functional blocks of highway traffic networks. Firstly, the theoretical model of a highway traffic network is constructed by adding location attribute weight, geographical distance weight, road grade weight, and dynamic traffic congestion weight. Secondly, the improved PageRank algorithm is used to get the ranking of key nodes of the highway traffic network. The clustering center and the number of clusters are determined by the ranking of key nodes and the shortest path distance. Then the improved spectral clustering algorithm is used to divide the functional blocks of the highway transportation network and identify the special common blocks of the highway transportation network. Finally, the IPSC Algorithm is used to analyze the aggregation mode of complex traffic networks at city and district scales. Crossing the limit of administrative division, the division results of special common blocks of highway transportation networks are obtained. Maintaining the connectivity between blocks can improve the overall efficiency of highway transportation networks. Technology (General) Xia Zhu verfasserin aut Guohong Li verfasserin aut Yongtao Jin verfasserin aut Yuyan Liu verfasserin aut Yuanping Liu verfasserin aut Gang Liu verfasserin aut Jiangxia Fan verfasserin aut In Journal of Sensors Hindawi Limited, 2008 (2022) (DE-627)550736751 (DE-600)2397931-8 1687725X nnns year:2022 https://doi.org/10.1155/2022/7311117 kostenfrei https://doaj.org/article/ace3be95ecb04464998db7cfef9af73a kostenfrei http://dx.doi.org/10.1155/2022/7311117 kostenfrei https://doaj.org/toc/1687-7268 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ SSG-OLC-PHA GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_165 GBV_ILN_170 GBV_ILN_171 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_636 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2007 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2037 GBV_ILN_2038 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2057 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2068 GBV_ILN_2088 GBV_ILN_2106 GBV_ILN_2108 GBV_ILN_2110 GBV_ILN_2111 GBV_ILN_2118 GBV_ILN_2122 GBV_ILN_2143 GBV_ILN_2144 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2232 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_4012 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4046 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4336 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 2022
allfields_unstemmed	10.1155/2022/7311117 doi (DE-627)DOAJ048874140 (DE-599)DOAJace3be95ecb04464998db7cfef9af73a DE-627 ger DE-627 rakwb eng T1-995 Yingying Pei verfasserin aut Complex Traffic Network Analysis Method Based on a Multiscale Aggregation Model 2022 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Identifying the aggregation characteristics of the geospatial network is an important aspect of analyzing highway traffic networks. Based on the complex network theory, this paper studies the block aggregation characteristics of the highway traffic network and proposes an Improved PageRank Spectral Clustering (IPSC) Algorithm to divide the functional blocks of highway traffic networks. Firstly, the theoretical model of a highway traffic network is constructed by adding location attribute weight, geographical distance weight, road grade weight, and dynamic traffic congestion weight. Secondly, the improved PageRank algorithm is used to get the ranking of key nodes of the highway traffic network. The clustering center and the number of clusters are determined by the ranking of key nodes and the shortest path distance. Then the improved spectral clustering algorithm is used to divide the functional blocks of the highway transportation network and identify the special common blocks of the highway transportation network. Finally, the IPSC Algorithm is used to analyze the aggregation mode of complex traffic networks at city and district scales. Crossing the limit of administrative division, the division results of special common blocks of highway transportation networks are obtained. Maintaining the connectivity between blocks can improve the overall efficiency of highway transportation networks. Technology (General) Xia Zhu verfasserin aut Guohong Li verfasserin aut Yongtao Jin verfasserin aut Yuyan Liu verfasserin aut Yuanping Liu verfasserin aut Gang Liu verfasserin aut Jiangxia Fan verfasserin aut In Journal of Sensors Hindawi Limited, 2008 (2022) (DE-627)550736751 (DE-600)2397931-8 1687725X nnns year:2022 https://doi.org/10.1155/2022/7311117 kostenfrei https://doaj.org/article/ace3be95ecb04464998db7cfef9af73a kostenfrei http://dx.doi.org/10.1155/2022/7311117 kostenfrei https://doaj.org/toc/1687-7268 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ SSG-OLC-PHA GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_165 GBV_ILN_170 GBV_ILN_171 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_636 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2007 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2037 GBV_ILN_2038 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2057 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2068 GBV_ILN_2088 GBV_ILN_2106 GBV_ILN_2108 GBV_ILN_2110 GBV_ILN_2111 GBV_ILN_2118 GBV_ILN_2122 GBV_ILN_2143 GBV_ILN_2144 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2232 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_4012 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4046 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4336 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 2022
allfieldsGer	10.1155/2022/7311117 doi (DE-627)DOAJ048874140 (DE-599)DOAJace3be95ecb04464998db7cfef9af73a DE-627 ger DE-627 rakwb eng T1-995 Yingying Pei verfasserin aut Complex Traffic Network Analysis Method Based on a Multiscale Aggregation Model 2022 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Identifying the aggregation characteristics of the geospatial network is an important aspect of analyzing highway traffic networks. Based on the complex network theory, this paper studies the block aggregation characteristics of the highway traffic network and proposes an Improved PageRank Spectral Clustering (IPSC) Algorithm to divide the functional blocks of highway traffic networks. Firstly, the theoretical model of a highway traffic network is constructed by adding location attribute weight, geographical distance weight, road grade weight, and dynamic traffic congestion weight. Secondly, the improved PageRank algorithm is used to get the ranking of key nodes of the highway traffic network. The clustering center and the number of clusters are determined by the ranking of key nodes and the shortest path distance. Then the improved spectral clustering algorithm is used to divide the functional blocks of the highway transportation network and identify the special common blocks of the highway transportation network. Finally, the IPSC Algorithm is used to analyze the aggregation mode of complex traffic networks at city and district scales. Crossing the limit of administrative division, the division results of special common blocks of highway transportation networks are obtained. Maintaining the connectivity between blocks can improve the overall efficiency of highway transportation networks. Technology (General) Xia Zhu verfasserin aut Guohong Li verfasserin aut Yongtao Jin verfasserin aut Yuyan Liu verfasserin aut Yuanping Liu verfasserin aut Gang Liu verfasserin aut Jiangxia Fan verfasserin aut In Journal of Sensors Hindawi Limited, 2008 (2022) (DE-627)550736751 (DE-600)2397931-8 1687725X nnns year:2022 https://doi.org/10.1155/2022/7311117 kostenfrei https://doaj.org/article/ace3be95ecb04464998db7cfef9af73a kostenfrei http://dx.doi.org/10.1155/2022/7311117 kostenfrei https://doaj.org/toc/1687-7268 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ SSG-OLC-PHA GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_165 GBV_ILN_170 GBV_ILN_171 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_636 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2007 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2037 GBV_ILN_2038 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2057 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2068 GBV_ILN_2088 GBV_ILN_2106 GBV_ILN_2108 GBV_ILN_2110 GBV_ILN_2111 GBV_ILN_2118 GBV_ILN_2122 GBV_ILN_2143 GBV_ILN_2144 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2232 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_4012 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4046 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4336 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 2022
allfieldsSound	10.1155/2022/7311117 doi (DE-627)DOAJ048874140 (DE-599)DOAJace3be95ecb04464998db7cfef9af73a DE-627 ger DE-627 rakwb eng T1-995 Yingying Pei verfasserin aut Complex Traffic Network Analysis Method Based on a Multiscale Aggregation Model 2022 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Identifying the aggregation characteristics of the geospatial network is an important aspect of analyzing highway traffic networks. Based on the complex network theory, this paper studies the block aggregation characteristics of the highway traffic network and proposes an Improved PageRank Spectral Clustering (IPSC) Algorithm to divide the functional blocks of highway traffic networks. Firstly, the theoretical model of a highway traffic network is constructed by adding location attribute weight, geographical distance weight, road grade weight, and dynamic traffic congestion weight. Secondly, the improved PageRank algorithm is used to get the ranking of key nodes of the highway traffic network. The clustering center and the number of clusters are determined by the ranking of key nodes and the shortest path distance. Then the improved spectral clustering algorithm is used to divide the functional blocks of the highway transportation network and identify the special common blocks of the highway transportation network. Finally, the IPSC Algorithm is used to analyze the aggregation mode of complex traffic networks at city and district scales. Crossing the limit of administrative division, the division results of special common blocks of highway transportation networks are obtained. Maintaining the connectivity between blocks can improve the overall efficiency of highway transportation networks. Technology (General) Xia Zhu verfasserin aut Guohong Li verfasserin aut Yongtao Jin verfasserin aut Yuyan Liu verfasserin aut Yuanping Liu verfasserin aut Gang Liu verfasserin aut Jiangxia Fan verfasserin aut In Journal of Sensors Hindawi Limited, 2008 (2022) (DE-627)550736751 (DE-600)2397931-8 1687725X nnns year:2022 https://doi.org/10.1155/2022/7311117 kostenfrei https://doaj.org/article/ace3be95ecb04464998db7cfef9af73a kostenfrei http://dx.doi.org/10.1155/2022/7311117 kostenfrei https://doaj.org/toc/1687-7268 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ SSG-OLC-PHA GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_165 GBV_ILN_170 GBV_ILN_171 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_636 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2007 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2037 GBV_ILN_2038 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2057 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2068 GBV_ILN_2088 GBV_ILN_2106 GBV_ILN_2108 GBV_ILN_2110 GBV_ILN_2111 GBV_ILN_2118 GBV_ILN_2122 GBV_ILN_2143 GBV_ILN_2144 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2232 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_4012 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4046 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4336 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 2022
language	English
source	In Journal of Sensors (2022) year:2022
sourceStr	In Journal of Sensors (2022) year:2022
format_phy_str_mv	Article
institution	findex.gbv.de
topic_facet	Technology (General)
isfreeaccess_bool	true
container_title	Journal of Sensors
authorswithroles_txt_mv	Yingying Pei @@aut@@ Xia Zhu @@aut@@ Guohong Li @@aut@@ Yongtao Jin @@aut@@ Yuyan Liu @@aut@@ Yuanping Liu @@aut@@ Gang Liu @@aut@@ Jiangxia Fan @@aut@@
publishDateDaySort_date	2022-01-01T00:00:00Z
hierarchy_top_id	550736751
id	DOAJ048874140
language_de	englisch
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">DOAJ048874140</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230502143953.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230227s2022 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1155/2022/7311117</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)DOAJ048874140</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DOAJace3be95ecb04464998db7cfef9af73a</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">T1-995</subfield></datafield><datafield tag="100" ind1="0" ind2=" "><subfield code="a">Yingying Pei</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Complex Traffic Network Analysis Method Based on a Multiscale Aggregation Model</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2022</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Identifying the aggregation characteristics of the geospatial network is an important aspect of analyzing highway traffic networks. Based on the complex network theory, this paper studies the block aggregation characteristics of the highway traffic network and proposes an Improved PageRank Spectral Clustering (IPSC) Algorithm to divide the functional blocks of highway traffic networks. Firstly, the theoretical model of a highway traffic network is constructed by adding location attribute weight, geographical distance weight, road grade weight, and dynamic traffic congestion weight. Secondly, the improved PageRank algorithm is used to get the ranking of key nodes of the highway traffic network. The clustering center and the number of clusters are determined by the ranking of key nodes and the shortest path distance. Then the improved spectral clustering algorithm is used to divide the functional blocks of the highway transportation network and identify the special common blocks of the highway transportation network. Finally, the IPSC Algorithm is used to analyze the aggregation mode of complex traffic networks at city and district scales. Crossing the limit of administrative division, the division results of special common blocks of highway transportation networks are obtained. Maintaining the connectivity between blocks can improve the overall efficiency of highway transportation networks.</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Technology (General)</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Xia Zhu</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Guohong Li</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Yongtao Jin</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Yuyan Liu</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Yuanping Liu</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Gang Liu</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Jiangxia Fan</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">Journal of Sensors</subfield><subfield code="d">Hindawi Limited, 2008</subfield><subfield code="g">(2022)</subfield><subfield code="w">(DE-627)550736751</subfield><subfield code="w">(DE-600)2397931-8</subfield><subfield code="x">1687725X</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">year:2022</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1155/2022/7311117</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doaj.org/article/ace3be95ecb04464998db7cfef9af73a</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://dx.doi.org/10.1155/2022/7311117</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/1687-7268</subfield><subfield code="y">Journal toc</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_DOAJ</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-PHA</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_11</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_165</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_170</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_171</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_224</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_636</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2003</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2004</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2006</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2007</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2010</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2011</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2026</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2027</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2034</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2038</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2044</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2048</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2050</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2055</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2056</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2057</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2059</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2061</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2064</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2068</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2088</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2106</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2108</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2111</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2118</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2122</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2143</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2144</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2147</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2148</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2152</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2153</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2232</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2470</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2507</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2522</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4035</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4046</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4242</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4251</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4326</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4333</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4334</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4336</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4367</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="j">2022</subfield></datafield></record></collection>
callnumber-first	T - Technology
author	Yingying Pei
spellingShingle	Yingying Pei misc T1-995 misc Technology (General) Complex Traffic Network Analysis Method Based on a Multiscale Aggregation Model
authorStr	Yingying Pei
ppnlink_with_tag_str_mv	@@773@@(DE-627)550736751
format	electronic Article
delete_txt_mv	keep
author_role	aut aut aut aut aut aut aut aut
collection	DOAJ
remote_str	true
callnumber-label	T1-995
illustrated	Not Illustrated
issn	1687725X
topic_title	T1-995 Complex Traffic Network Analysis Method Based on a Multiscale Aggregation Model
topic	misc T1-995 misc Technology (General)
topic_unstemmed	misc T1-995 misc Technology (General)
topic_browse	misc T1-995 misc Technology (General)
format_facet	Elektronische Aufsätze Aufsätze Elektronische Ressource
format_main_str_mv	Text Zeitschrift/Artikel
carriertype_str_mv	cr
hierarchy_parent_title	Journal of Sensors
hierarchy_parent_id	550736751
hierarchy_top_title	Journal of Sensors
isfreeaccess_txt	true
familylinks_str_mv	(DE-627)550736751 (DE-600)2397931-8
title	Complex Traffic Network Analysis Method Based on a Multiscale Aggregation Model
ctrlnum	(DE-627)DOAJ048874140 (DE-599)DOAJace3be95ecb04464998db7cfef9af73a
title_full	Complex Traffic Network Analysis Method Based on a Multiscale Aggregation Model
author_sort	Yingying Pei
journal	Journal of Sensors
journalStr	Journal of Sensors
callnumber-first-code	T
lang_code	eng
isOA_bool	true
recordtype	marc
publishDateSort	2022
contenttype_str_mv	txt
author_browse	Yingying Pei Xia Zhu Guohong Li Yongtao Jin Yuyan Liu Yuanping Liu Gang Liu Jiangxia Fan
class	T1-995
format_se	Elektronische Aufsätze
author-letter	Yingying Pei
doi_str_mv	10.1155/2022/7311117
author2-role	verfasserin
title_sort	complex traffic network analysis method based on a multiscale aggregation model
callnumber	T1-995
title_auth	Complex Traffic Network Analysis Method Based on a Multiscale Aggregation Model
abstract	Identifying the aggregation characteristics of the geospatial network is an important aspect of analyzing highway traffic networks. Based on the complex network theory, this paper studies the block aggregation characteristics of the highway traffic network and proposes an Improved PageRank Spectral Clustering (IPSC) Algorithm to divide the functional blocks of highway traffic networks. Firstly, the theoretical model of a highway traffic network is constructed by adding location attribute weight, geographical distance weight, road grade weight, and dynamic traffic congestion weight. Secondly, the improved PageRank algorithm is used to get the ranking of key nodes of the highway traffic network. The clustering center and the number of clusters are determined by the ranking of key nodes and the shortest path distance. Then the improved spectral clustering algorithm is used to divide the functional blocks of the highway transportation network and identify the special common blocks of the highway transportation network. Finally, the IPSC Algorithm is used to analyze the aggregation mode of complex traffic networks at city and district scales. Crossing the limit of administrative division, the division results of special common blocks of highway transportation networks are obtained. Maintaining the connectivity between blocks can improve the overall efficiency of highway transportation networks.
abstractGer	Identifying the aggregation characteristics of the geospatial network is an important aspect of analyzing highway traffic networks. Based on the complex network theory, this paper studies the block aggregation characteristics of the highway traffic network and proposes an Improved PageRank Spectral Clustering (IPSC) Algorithm to divide the functional blocks of highway traffic networks. Firstly, the theoretical model of a highway traffic network is constructed by adding location attribute weight, geographical distance weight, road grade weight, and dynamic traffic congestion weight. Secondly, the improved PageRank algorithm is used to get the ranking of key nodes of the highway traffic network. The clustering center and the number of clusters are determined by the ranking of key nodes and the shortest path distance. Then the improved spectral clustering algorithm is used to divide the functional blocks of the highway transportation network and identify the special common blocks of the highway transportation network. Finally, the IPSC Algorithm is used to analyze the aggregation mode of complex traffic networks at city and district scales. Crossing the limit of administrative division, the division results of special common blocks of highway transportation networks are obtained. Maintaining the connectivity between blocks can improve the overall efficiency of highway transportation networks.
abstract_unstemmed	Identifying the aggregation characteristics of the geospatial network is an important aspect of analyzing highway traffic networks. Based on the complex network theory, this paper studies the block aggregation characteristics of the highway traffic network and proposes an Improved PageRank Spectral Clustering (IPSC) Algorithm to divide the functional blocks of highway traffic networks. Firstly, the theoretical model of a highway traffic network is constructed by adding location attribute weight, geographical distance weight, road grade weight, and dynamic traffic congestion weight. Secondly, the improved PageRank algorithm is used to get the ranking of key nodes of the highway traffic network. The clustering center and the number of clusters are determined by the ranking of key nodes and the shortest path distance. Then the improved spectral clustering algorithm is used to divide the functional blocks of the highway transportation network and identify the special common blocks of the highway transportation network. Finally, the IPSC Algorithm is used to analyze the aggregation mode of complex traffic networks at city and district scales. Crossing the limit of administrative division, the division results of special common blocks of highway transportation networks are obtained. Maintaining the connectivity between blocks can improve the overall efficiency of highway transportation networks.
collection_details	GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ SSG-OLC-PHA GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_165 GBV_ILN_170 GBV_ILN_171 GBV_ILN_213 GBV_ILN_224 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_636 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2007 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2037 GBV_ILN_2038 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2056 GBV_ILN_2057 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2068 GBV_ILN_2088 GBV_ILN_2106 GBV_ILN_2108 GBV_ILN_2110 GBV_ILN_2111 GBV_ILN_2118 GBV_ILN_2122 GBV_ILN_2143 GBV_ILN_2144 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2232 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_4012 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4046 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4336 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700
title_short	Complex Traffic Network Analysis Method Based on a Multiscale Aggregation Model
url	https://doi.org/10.1155/2022/7311117 https://doaj.org/article/ace3be95ecb04464998db7cfef9af73a http://dx.doi.org/10.1155/2022/7311117 https://doaj.org/toc/1687-7268
remote_bool	true
author2	Xia Zhu Guohong Li Yongtao Jin Yuyan Liu Yuanping Liu Gang Liu Jiangxia Fan
author2Str	Xia Zhu Guohong Li Yongtao Jin Yuyan Liu Yuanping Liu Gang Liu Jiangxia Fan
ppnlink	550736751
callnumber-subject	T - General Technology
mediatype_str_mv	c
isOA_txt	true
hochschulschrift_bool	false
doi_str	10.1155/2022/7311117
callnumber-a	T1-995
up_date	2024-07-03T20:09:39.478Z
_version_	1803589915226669056
fullrecord_marcxml	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">DOAJ048874140</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230502143953.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230227s2022 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1155/2022/7311117</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)DOAJ048874140</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DOAJace3be95ecb04464998db7cfef9af73a</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">T1-995</subfield></datafield><datafield tag="100" ind1="0" ind2=" "><subfield code="a">Yingying Pei</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Complex Traffic Network Analysis Method Based on a Multiscale Aggregation Model</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2022</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Identifying the aggregation characteristics of the geospatial network is an important aspect of analyzing highway traffic networks. Based on the complex network theory, this paper studies the block aggregation characteristics of the highway traffic network and proposes an Improved PageRank Spectral Clustering (IPSC) Algorithm to divide the functional blocks of highway traffic networks. Firstly, the theoretical model of a highway traffic network is constructed by adding location attribute weight, geographical distance weight, road grade weight, and dynamic traffic congestion weight. Secondly, the improved PageRank algorithm is used to get the ranking of key nodes of the highway traffic network. The clustering center and the number of clusters are determined by the ranking of key nodes and the shortest path distance. Then the improved spectral clustering algorithm is used to divide the functional blocks of the highway transportation network and identify the special common blocks of the highway transportation network. Finally, the IPSC Algorithm is used to analyze the aggregation mode of complex traffic networks at city and district scales. Crossing the limit of administrative division, the division results of special common blocks of highway transportation networks are obtained. Maintaining the connectivity between blocks can improve the overall efficiency of highway transportation networks.</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Technology (General)</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Xia Zhu</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Guohong Li</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Yongtao Jin</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Yuyan Liu</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Yuanping Liu</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Gang Liu</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Jiangxia Fan</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">Journal of Sensors</subfield><subfield code="d">Hindawi Limited, 2008</subfield><subfield code="g">(2022)</subfield><subfield code="w">(DE-627)550736751</subfield><subfield code="w">(DE-600)2397931-8</subfield><subfield code="x">1687725X</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">year:2022</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1155/2022/7311117</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doaj.org/article/ace3be95ecb04464998db7cfef9af73a</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://dx.doi.org/10.1155/2022/7311117</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/1687-7268</subfield><subfield code="y">Journal toc</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_DOAJ</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-PHA</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_11</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_165</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_170</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_171</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_224</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_636</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2003</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2004</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2006</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2007</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2010</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2011</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2026</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2027</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2034</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2038</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2044</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2048</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2050</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2055</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2056</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2057</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2059</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2061</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2064</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2068</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2088</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2106</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2108</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2111</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2118</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2122</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2143</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2144</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2147</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2148</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2152</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2153</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2232</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2470</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2507</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2522</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4035</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4046</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4242</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4251</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4326</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4333</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4334</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4336</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4367</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="j">2022</subfield></datafield></record></collection>
score	7.399708

Nicht das Richtige dabei?

Schreiben Sie uns!

Complex Traffic Network Analysis Method Based on a Multiscale Aggregation Model

Nicht das Richtige dabei?

Zugang & Verfügbarkeit

Vorhandene Bände

Nicht das Richtige dabei?