Pub Date : 2004-05-10DOI: 10.1109/ISPAN.2004.1300457
Qiaozhong Ke, D. Makrakis
Relay control ought to be performed when a direct communication link cannot be established between the source station and the target station. We propose in this paper how such function can be accomplished effectively in Wireless 1394 based networks. Simulation results yield the fact that the proposed scheme not only can optimize the data relay control from the perspectives of the premium (the lowest cost) relay path and relay station selection but also can improve the system's performance in terms of its higher packet delivery ratio and lower packet end-to-end delay in a shadowing prone home environment.
{"title":"Optimizing relay control in Wireless 1394 network","authors":"Qiaozhong Ke, D. Makrakis","doi":"10.1109/ISPAN.2004.1300457","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300457","url":null,"abstract":"Relay control ought to be performed when a direct communication link cannot be established between the source station and the target station. We propose in this paper how such function can be accomplished effectively in Wireless 1394 based networks. Simulation results yield the fact that the proposed scheme not only can optimize the data relay control from the perspectives of the premium (the lowest cost) relay path and relay station selection but also can improve the system's performance in terms of its higher packet delivery ratio and lower packet end-to-end delay in a shadowing prone home environment.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121481141","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2004-05-10DOI: 10.1109/ISPAN.2004.1300511
Michael Cho-Hoi Chek, Yu-Kwong Kwok
In contrast to traditional frequency hopping techniques, adaptive frequency hopping (AFH) is a low cost and low power solution to avoid interference dynamically. While each AFH algorithm proposed previously is shown to be efficient, a detailed performance analysis of various AFH mechanisms under realistic resource constraints is yet to be done. In particular, based on our performance study on Bluetooth systems presented in this paper, we have found that the AFH mechanism adopted by IEEE 802.15 task group 2 (TG2) is very sensitive to memory and power limitations. We then propose an interference source oriented adaptive frequency hopping (ISOAFH) approach based on a cross-layer design, in which the baseband layer of Bluetooth considers not only the instantaneous channels condition but also the physical layer transmission characteristics of potential interference sources in determining the hop sequence. In our simulations using detailed MATLAB Simulink modeling, we find that our proposed method is much more robust in that it is insensitive to memory and energy constraints. Indeed, our approach generally achieves a lower collision rate and higher ISM spectrum utilization.
{"title":"On adaptive frequency hopping to combat coexistence interference between Bluetooth and IEEE 802.11b with practical resource constraints","authors":"Michael Cho-Hoi Chek, Yu-Kwong Kwok","doi":"10.1109/ISPAN.2004.1300511","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300511","url":null,"abstract":"In contrast to traditional frequency hopping techniques, adaptive frequency hopping (AFH) is a low cost and low power solution to avoid interference dynamically. While each AFH algorithm proposed previously is shown to be efficient, a detailed performance analysis of various AFH mechanisms under realistic resource constraints is yet to be done. In particular, based on our performance study on Bluetooth systems presented in this paper, we have found that the AFH mechanism adopted by IEEE 802.15 task group 2 (TG2) is very sensitive to memory and power limitations. We then propose an interference source oriented adaptive frequency hopping (ISOAFH) approach based on a cross-layer design, in which the baseband layer of Bluetooth considers not only the instantaneous channels condition but also the physical layer transmission characteristics of potential interference sources in determining the hop sequence. In our simulations using detailed MATLAB Simulink modeling, we find that our proposed method is much more robust in that it is insensitive to memory and energy constraints. Indeed, our approach generally achieves a lower collision rate and higher ISM spectrum utilization.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121505600","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2004-05-10DOI: 10.1016/j.jpdc.2007.07.002
L. Higham, J. Kawash
{"title":"Implementing sequentially consistent programs on processor consistent platforms","authors":"L. Higham, J. Kawash","doi":"10.1016/j.jpdc.2007.07.002","DOIUrl":"https://doi.org/10.1016/j.jpdc.2007.07.002","url":null,"abstract":"","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120610310","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2004-05-10DOI: 10.1109/ISPAN.2004.1300465
Xuerong Feng, Z. Meng, I. H. Sudborough
We consider the problem of sorting an arbitrary permutation of length n using substring reversals of length 2 or 3. This has been called "short swaps ". We give an upper bound of (5/24) n/sup 2/ + O(nlogn), improving the previous ( 1/4 ) n/sup 2/ upper bound. We also show that there is a short swap sorting network with ( 1/4 ) n/sup 2/ +O(nlogn) comparators and depth n.
{"title":"Improved upper bound for sorting by short swaps","authors":"Xuerong Feng, Z. Meng, I. H. Sudborough","doi":"10.1109/ISPAN.2004.1300465","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300465","url":null,"abstract":"We consider the problem of sorting an arbitrary permutation of length n using substring reversals of length 2 or 3. This has been called \"short swaps \". We give an upper bound of (5/24) n/sup 2/ + O(nlogn), improving the previous ( 1/4 ) n/sup 2/ upper bound. We also show that there is a short swap sorting network with ( 1/4 ) n/sup 2/ +O(nlogn) comparators and depth n.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127523823","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2004-05-10DOI: 10.1109/ISPAN.2004.1300549
Han-Kuen Liang, Chia-Mao Huang, Jenn-Kang Hwang, M. Ko
The amino acid-coupling sequence patterns deduced from 74 mesophilic and 15 thermophilic genomes were analyzed. The amino acid-coupling sequence patterns are defined as any two types of amino acids separated apart by one or more amino acids. We found that there exists significantly different distributions of amino acid-coupling sequence patterns between thermophilic and mesophilic proteomes. For example, patterns favored to form local salt bridges (such as KX/sub n/E) are usually preferred by thermophiles; patterns containing glutamate and valine are usually favored by thermophiles, but only some of them are statistically significant; most patterns containing cysteine appear to occur more in mesophiles, but most of them are statistically insignificant except patterns like CX/sub n/P or CX/sub n/C, which is favored by thermophiles. Though previous studies based on global amino acid compositions indicate that glutamate is one of the most favored amino acids by thermophiles, we found that EX/sub n/T, EX/sub n/H and EX/sub n/Q are statistically significant patterns favored by mesophiles. We also identified sequence patterns that can effectively distinguish between thermophilic and mesophilic genomes. By combining the statistically significant amino acid-coupling sequence patterns (of lowest p-values), we find a good linear relationship between these sequence patterns and the optimal growth temperatures of the genomes.
{"title":"The amino acid-coupling sequence patterns in thermophilic and mesophilic proteomes","authors":"Han-Kuen Liang, Chia-Mao Huang, Jenn-Kang Hwang, M. Ko","doi":"10.1109/ISPAN.2004.1300549","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300549","url":null,"abstract":"The amino acid-coupling sequence patterns deduced from 74 mesophilic and 15 thermophilic genomes were analyzed. The amino acid-coupling sequence patterns are defined as any two types of amino acids separated apart by one or more amino acids. We found that there exists significantly different distributions of amino acid-coupling sequence patterns between thermophilic and mesophilic proteomes. For example, patterns favored to form local salt bridges (such as KX/sub n/E) are usually preferred by thermophiles; patterns containing glutamate and valine are usually favored by thermophiles, but only some of them are statistically significant; most patterns containing cysteine appear to occur more in mesophiles, but most of them are statistically insignificant except patterns like CX/sub n/P or CX/sub n/C, which is favored by thermophiles. Though previous studies based on global amino acid compositions indicate that glutamate is one of the most favored amino acids by thermophiles, we found that EX/sub n/T, EX/sub n/H and EX/sub n/Q are statistically significant patterns favored by mesophiles. We also identified sequence patterns that can effectively distinguish between thermophilic and mesophilic genomes. By combining the statistically significant amino acid-coupling sequence patterns (of lowest p-values), we find a good linear relationship between these sequence patterns and the optimal growth temperatures of the genomes.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129025850","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2004-05-10DOI: 10.1109/ISPAN.2004.1300529
Mohammad Mursalin Akon, D. Goswami, S. Jyoti
Swarm intelligence based algorithms for routing in telecommunication networks have gained considerable amount of attention in recent years. Swarm intelligence, demonstrated by natural biological swarms, exhibits numerous powerful features that are desirable in communication systems. Mobile agents having swarm intelligence similar to the real life ants have been employed to achieve a general, flexible and modular solution for routing in communication networks. In this paper, we propose mobile agents that are more advanced than those found in the previous literatures. Our proposal includes a new migration scheme for the ant-like mobile agents and a new routing table management scheme. Simulation results show that our proposed schemes can ultimately result in better load balancing and better performance within telecommunication networks.
{"title":"A new routing table update and ant migration scheme for ant based control in telecommunication networks","authors":"Mohammad Mursalin Akon, D. Goswami, S. Jyoti","doi":"10.1109/ISPAN.2004.1300529","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300529","url":null,"abstract":"Swarm intelligence based algorithms for routing in telecommunication networks have gained considerable amount of attention in recent years. Swarm intelligence, demonstrated by natural biological swarms, exhibits numerous powerful features that are desirable in communication systems. Mobile agents having swarm intelligence similar to the real life ants have been employed to achieve a general, flexible and modular solution for routing in communication networks. In this paper, we propose mobile agents that are more advanced than those found in the previous literatures. Our proposal includes a new migration scheme for the ant-like mobile agents and a new routing table management scheme. Simulation results show that our proposed schemes can ultimately result in better load balancing and better performance within telecommunication networks.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133615167","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2004-05-10DOI: 10.1109/ISPAN.2004.1300474
Hong-Chun Hsu, Liang-Chih Chiang, Jimmy J. M. Tan, Lih-Hsing Hsu
In this paper, we consider the fault hamiltonicity and the fault Hamiltonian connectivity of the augmented cubes AQ/sub n/. Assume that F /spl sube/ V(AQ/sub n/) /spl cup/ E(AQ/sub n/) and n /spl ges/ 4. We prove that AQ/sub n/ - F is Hamiltonian if |F| /spl les/ 2n-3 and that AQ/sub n/ - F is Hamiltonian connected if |F| /spl les/ 2n - 4. Moreover, these bounds are tight.
{"title":"Ring embedding in faulty augmented cubes","authors":"Hong-Chun Hsu, Liang-Chih Chiang, Jimmy J. M. Tan, Lih-Hsing Hsu","doi":"10.1109/ISPAN.2004.1300474","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300474","url":null,"abstract":"In this paper, we consider the fault hamiltonicity and the fault Hamiltonian connectivity of the augmented cubes AQ/sub n/. Assume that F /spl sube/ V(AQ/sub n/) /spl cup/ E(AQ/sub n/) and n /spl ges/ 4. We prove that AQ/sub n/ - F is Hamiltonian if |F| /spl les/ 2n-3 and that AQ/sub n/ - F is Hamiltonian connected if |F| /spl les/ 2n - 4. Moreover, these bounds are tight.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134478509","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2004-05-10DOI: 10.1109/ISPAN.2004.1300452
Zhang Li, W. Jia, Yan Wei, Li Xiao-ming
Anycast communication can be used to provide effective routing to server members in a replicated server group that is represented by an anycast address. This paper proposes a novel anycast routing protocol called anycast routing protocol based on multi-metrics (ARMM). ARMM protocol sets up the routing by taking hop number, data transmission delay, residual bandwidth, and server load as the server and path selection criteria. ARMM differs from other approaches as it uses values of bandwidth and delay on the direction from servers (anycast members) to clients, rather than the normal direction from clients to servers. So ARMM can select the best server/path with sufficient network resource (bandwidth, etc.) for server data transmission to clients. Simulation results demonstrated that our protocol performs better than those protocols using conventional client to server routing approach in case that the servers may require to transmit a large volume of flows to the clients.
{"title":"An efficient anycast routing protocol based on multi-metrics","authors":"Zhang Li, W. Jia, Yan Wei, Li Xiao-ming","doi":"10.1109/ISPAN.2004.1300452","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300452","url":null,"abstract":"Anycast communication can be used to provide effective routing to server members in a replicated server group that is represented by an anycast address. This paper proposes a novel anycast routing protocol called anycast routing protocol based on multi-metrics (ARMM). ARMM protocol sets up the routing by taking hop number, data transmission delay, residual bandwidth, and server load as the server and path selection criteria. ARMM differs from other approaches as it uses values of bandwidth and delay on the direction from servers (anycast members) to clients, rather than the normal direction from clients to servers. So ARMM can select the best server/path with sufficient network resource (bandwidth, etc.) for server data transmission to clients. Simulation results demonstrated that our protocol performs better than those protocols using conventional client to server routing approach in case that the servers may require to transmit a large volume of flows to the clients.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133370677","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2004-05-10DOI: 10.1109/ISPAN.2004.1300461
Chi-Yin Chow, H. Leong, A. Chan
In a conventional mobile environment, mobile clients retrieve data items from database servers via mobile support stations, by downloading the items over scalable broadcast channels (push-based), requesting them over shared point-to-point channels (pull-based), or making use of both types of channels to retrieve them (hybrid). Caching is a key technique for improving data retrieval performance of mobile clients, regardless of the data delivery mechanism. The emergence of robust peer-to-peer technologies now brings to reality what we call "cooperative caching" in which mobile clients can access data items from the cache in their neighboring peers, thereby adding a new dimension for data caching. This paper studies the system performance of a cooperative caching scheme, called COCA, in a hybrid data delivery environment, and proposes a cooperative cache replacement scheme, called CORE, for mobile systems. The performance of COCA and CORE schemes is evaluated through a number of simulated experiments. The experiment results show that COCA effectively improves the system performance in push-based and hybrid-data delivery environments, especially in a heavily-loaded environment. The results also indicate that CORE can further improve on the access latency and reduce the number of expensive server requests, which consume scarce pull-based bandwidth.
{"title":"Peer-to-peer cooperative caching in a hybrid data delivery environment","authors":"Chi-Yin Chow, H. Leong, A. Chan","doi":"10.1109/ISPAN.2004.1300461","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300461","url":null,"abstract":"In a conventional mobile environment, mobile clients retrieve data items from database servers via mobile support stations, by downloading the items over scalable broadcast channels (push-based), requesting them over shared point-to-point channels (pull-based), or making use of both types of channels to retrieve them (hybrid). Caching is a key technique for improving data retrieval performance of mobile clients, regardless of the data delivery mechanism. The emergence of robust peer-to-peer technologies now brings to reality what we call \"cooperative caching\" in which mobile clients can access data items from the cache in their neighboring peers, thereby adding a new dimension for data caching. This paper studies the system performance of a cooperative caching scheme, called COCA, in a hybrid data delivery environment, and proposes a cooperative cache replacement scheme, called CORE, for mobile systems. The performance of COCA and CORE schemes is evaluated through a number of simulated experiments. The experiment results show that COCA effectively improves the system performance in push-based and hybrid-data delivery environments, especially in a heavily-loaded environment. The results also indicate that CORE can further improve on the access latency and reduce the number of expensive server requests, which consume scarce pull-based bandwidth.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116949961","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2004-05-10DOI: 10.1109/ISPAN.2004.1300536
Cheng-Kuan Lin, Hua-Min Huang, D. Hsu, Lih-Hsing Hsu
Assume that u and v are any two distinct vertices of different partite sets of S/sub n/ with n /spl ges/ 5. We prove that there are (n - 1) internally disjoint paths P/sub 1/, P/sub 2/, ..., P/sub n-i/ joining u to v such that /spl cup//sup n = 1//sub i = 2/ P/sub i/ spans S/sub n/ and l(P/sub i/) /spl les/ (n - 1)! + 2(n - 2)! + 2(n - 3)! + 1 = n!/(n - 2) + 1. We also prove that there are two internally disjoint paths Q/sub 1/ and Q/sub 2/ joining u to v such that Q/sub 1/ /spl cup/ Q/sub 2/ spans S/sub n/ and l(Q/sub i/) /spl les/ n!/2 + l for i = 1,2.
{"title":"The spanning diameter of the star graphs","authors":"Cheng-Kuan Lin, Hua-Min Huang, D. Hsu, Lih-Hsing Hsu","doi":"10.1109/ISPAN.2004.1300536","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300536","url":null,"abstract":"Assume that u and v are any two distinct vertices of different partite sets of S/sub n/ with n /spl ges/ 5. We prove that there are (n - 1) internally disjoint paths P/sub 1/, P/sub 2/, ..., P/sub n-i/ joining u to v such that /spl cup//sup n = 1//sub i = 2/ P/sub i/ spans S/sub n/ and l(P/sub i/) /spl les/ (n - 1)! + 2(n - 2)! + 2(n - 3)! + 1 = n!/(n - 2) + 1. We also prove that there are two internally disjoint paths Q/sub 1/ and Q/sub 2/ joining u to v such that Q/sub 1/ /spl cup/ Q/sub 2/ spans S/sub n/ and l(Q/sub i/) /spl les/ n!/2 + l for i = 1,2.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114450226","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：