Pub Date : 2006-05-08DOI: 10.1109/ICACT.2006.205909
Tingrui Pei, Zhen Peng, Jiang-lian Cao, Zhi-qiang Yao
In this paper, a novel scheduling algorithm named time-fair selective scheduling (TFS) is proposed and the performance of TFS with multi-antenna opportunistic beamforming is investigated. Simulation shows that time-fair selective scheduling yields better time fairness and better system performance than proportional fair scheduling in TDM cellular system. Furthermore, time-fair scheduling can avoid the phenomena that the user on the border of the cell does not allocate slots more effectively. TFS combined with opportunistic beamforming can exploit multiuser diversity even in slow fading channel. It is shown that opportunistic beamforming with more antennas would induce larger and faster fluctuation, but the performance decreases with too much antennas. The optimal number of antennas can be determined according to the results in this paper
{"title":"A new scheduling algorithm and performance with opportunistic beamforming","authors":"Tingrui Pei, Zhen Peng, Jiang-lian Cao, Zhi-qiang Yao","doi":"10.1109/ICACT.2006.205909","DOIUrl":"https://doi.org/10.1109/ICACT.2006.205909","url":null,"abstract":"In this paper, a novel scheduling algorithm named time-fair selective scheduling (TFS) is proposed and the performance of TFS with multi-antenna opportunistic beamforming is investigated. Simulation shows that time-fair selective scheduling yields better time fairness and better system performance than proportional fair scheduling in TDM cellular system. Furthermore, time-fair scheduling can avoid the phenomena that the user on the border of the cell does not allocate slots more effectively. TFS combined with opportunistic beamforming can exploit multiuser diversity even in slow fading channel. It is shown that opportunistic beamforming with more antennas would induce larger and faster fluctuation, but the performance decreases with too much antennas. The optimal number of antennas can be determined according to the results in this paper","PeriodicalId":247315,"journal":{"name":"2006 8th International Conference Advanced Communication Technology","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125434596","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 : 2006-05-08DOI: 10.1109/ICACT.2006.206140
Sungjune Yang, Sung-Gon Choi, Se Yun Ban, Yoo-Jung Kim, J. Choi
Presence services allow individuals to interact with other people and to participate in new business opportunities such as on-line gaming, address book service, public chat, etc. Hence, we currently see an increased interest from presence service developers and providers in NGN. In this paper we propose a distributed service architecture and middleware platform to cope with the problems such as service provisioning, QoS, bandwidth provisioning which comes from distributed service architecture. This allows the presence services to utilize the features and capabilities that are inherent to the NGN. At the same time existing various interactive services can be flexibly adapted to this new type of network
{"title":"Presence service middleware architecture for NGN","authors":"Sungjune Yang, Sung-Gon Choi, Se Yun Ban, Yoo-Jung Kim, J. Choi","doi":"10.1109/ICACT.2006.206140","DOIUrl":"https://doi.org/10.1109/ICACT.2006.206140","url":null,"abstract":"Presence services allow individuals to interact with other people and to participate in new business opportunities such as on-line gaming, address book service, public chat, etc. Hence, we currently see an increased interest from presence service developers and providers in NGN. In this paper we propose a distributed service architecture and middleware platform to cope with the problems such as service provisioning, QoS, bandwidth provisioning which comes from distributed service architecture. This allows the presence services to utilize the features and capabilities that are inherent to the NGN. At the same time existing various interactive services can be flexibly adapted to this new type of network","PeriodicalId":247315,"journal":{"name":"2006 8th International Conference Advanced Communication Technology","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126927864","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 : 2006-05-08DOI: 10.1109/ICACT.2006.206197
Min-Gon Kim, Hongkyu Jeong, Jungyul Choi, Jihwan Kim, Minho Kang
Optical burst switching is a promising switching technology to exploit the potential benefits of optical communication for next generation optical networks. Edge nodes are able to support multiple priorities by assigning different offset time between control packets and data bursts. Data traffic having high priority is known to have better performance than that having low priority in terms of blocking probability. However, we found that the extra offset time-based QoS mechanism does not support the aforementioned benefits in viewpoint of TCP-level performance. Simulation results show the limitation of QoS support based on the extra offset-time
{"title":"Performance analysis of the extra offset-time based QoS mechanism in TCP over optical burst switching networks","authors":"Min-Gon Kim, Hongkyu Jeong, Jungyul Choi, Jihwan Kim, Minho Kang","doi":"10.1109/ICACT.2006.206197","DOIUrl":"https://doi.org/10.1109/ICACT.2006.206197","url":null,"abstract":"Optical burst switching is a promising switching technology to exploit the potential benefits of optical communication for next generation optical networks. Edge nodes are able to support multiple priorities by assigning different offset time between control packets and data bursts. Data traffic having high priority is known to have better performance than that having low priority in terms of blocking probability. However, we found that the extra offset time-based QoS mechanism does not support the aforementioned benefits in viewpoint of TCP-level performance. Simulation results show the limitation of QoS support based on the extra offset-time","PeriodicalId":247315,"journal":{"name":"2006 8th International Conference Advanced Communication Technology","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116163852","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 : 2006-05-08DOI: 10.1109/ICACT.2006.205984
I. Kim, Soojeon Lee, W. Jung, Jaehoon Kim
Communication, ocean, and meteorological satellite (COMS) is a geostationary satellite system which performs multi-mission such as communications services, ocean data acquisition, and meteorological data acquisition. Each mission is operated by different users, but it is the COMS satellite ground control system (SGCS) that practically controls all missions at an end. Therefore, all requests for performing the COMS mission have to be collected into COMS SGCS, and then the gathered mission requests shall be converted into the command to be transmitted to satellite after scheduling the requested mission in an optimal schedule. This paper introduces mission planning system and process which gathers mission requests, performs interactive mission scheduling, and generates command plan in order to carry out the various satellite missions of the COMS. First of all, we will see the system configuration and developing environment for mission planning. This paper will describe the main functions such as mission request gathering, mission scheduling, mission timeline reporting, and command planning. It deals with the role and design of each function in detail, and finally represents the operation concept to have the operator perform the mission planning efficiently when the COMS will be on orbit later on
{"title":"Preliminary design for satellite mission operation from mission request to command planning","authors":"I. Kim, Soojeon Lee, W. Jung, Jaehoon Kim","doi":"10.1109/ICACT.2006.205984","DOIUrl":"https://doi.org/10.1109/ICACT.2006.205984","url":null,"abstract":"Communication, ocean, and meteorological satellite (COMS) is a geostationary satellite system which performs multi-mission such as communications services, ocean data acquisition, and meteorological data acquisition. Each mission is operated by different users, but it is the COMS satellite ground control system (SGCS) that practically controls all missions at an end. Therefore, all requests for performing the COMS mission have to be collected into COMS SGCS, and then the gathered mission requests shall be converted into the command to be transmitted to satellite after scheduling the requested mission in an optimal schedule. This paper introduces mission planning system and process which gathers mission requests, performs interactive mission scheduling, and generates command plan in order to carry out the various satellite missions of the COMS. First of all, we will see the system configuration and developing environment for mission planning. This paper will describe the main functions such as mission request gathering, mission scheduling, mission timeline reporting, and command planning. It deals with the role and design of each function in detail, and finally represents the operation concept to have the operator perform the mission planning efficiently when the COMS will be on orbit later on","PeriodicalId":247315,"journal":{"name":"2006 8th International Conference Advanced Communication Technology","volume":"238 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116464863","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 : 2006-05-08DOI: 10.1109/ICACT.2006.206175
Hsiu-Mei Huang, G. You, Fu-Song Syu, S. Liaw
Pictures and video sequences showing human faces are of high importance in content-based retrieval systems. During flourishing Internet time, more and more human face image databases are stored on the Internet. They provide a great number of human face images to access. Therefore, considering the storage space and the network bandwidth, how to access human face image more efficiently has become an important topic. The primary goal of our method is to minimize the number of bits required to preserve the crucial facial features without any loss of information. In this paper, we propose a new technique based on JPEG2000 for the storage and retrieval of the human face images. We combine lossy and lossless image compression of JPEG2000 to reach our goal. Aiming at the feature of human face image data, we extract the facial features in the image as the most important information. The lossless image compression is used to retain the facial features of human face image. The background and the rest of the image are processed by lossy compression to further save the required storage space. The preliminary result has shown that our method can have higher compression ratio without loss of the crucial facial feature for low bandwidth communication applications, such as videophone and teleconferencing
{"title":"Designing a new storage technique for face images transmission using JPEG2000","authors":"Hsiu-Mei Huang, G. You, Fu-Song Syu, S. Liaw","doi":"10.1109/ICACT.2006.206175","DOIUrl":"https://doi.org/10.1109/ICACT.2006.206175","url":null,"abstract":"Pictures and video sequences showing human faces are of high importance in content-based retrieval systems. During flourishing Internet time, more and more human face image databases are stored on the Internet. They provide a great number of human face images to access. Therefore, considering the storage space and the network bandwidth, how to access human face image more efficiently has become an important topic. The primary goal of our method is to minimize the number of bits required to preserve the crucial facial features without any loss of information. In this paper, we propose a new technique based on JPEG2000 for the storage and retrieval of the human face images. We combine lossy and lossless image compression of JPEG2000 to reach our goal. Aiming at the feature of human face image data, we extract the facial features in the image as the most important information. The lossless image compression is used to retain the facial features of human face image. The background and the rest of the image are processed by lossy compression to further save the required storage space. The preliminary result has shown that our method can have higher compression ratio without loss of the crucial facial feature for low bandwidth communication applications, such as videophone and teleconferencing","PeriodicalId":247315,"journal":{"name":"2006 8th International Conference Advanced Communication Technology","volume":"148 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116568639","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 : 2006-05-08DOI: 10.1109/ICACT.2006.206393
O. Semanov, V. Pyattaev, V. Danilov
Nowadays several long-distance operators in the telecommunications market forces IRC to make their choice from services by one or another of them. These tasks are complicated mainly by obsolete switching equipment. Using of the signaling system (SS) network may help to solve this problem. Using of dedicated STP and application server allow significantly extend functional possibilities of IRC network
{"title":"Demonopolization of Russian long distance communication market using SS 7 network","authors":"O. Semanov, V. Pyattaev, V. Danilov","doi":"10.1109/ICACT.2006.206393","DOIUrl":"https://doi.org/10.1109/ICACT.2006.206393","url":null,"abstract":"Nowadays several long-distance operators in the telecommunications market forces IRC to make their choice from services by one or another of them. These tasks are complicated mainly by obsolete switching equipment. Using of the signaling system (SS) network may help to solve this problem. Using of dedicated STP and application server allow significantly extend functional possibilities of IRC network","PeriodicalId":247315,"journal":{"name":"2006 8th International Conference Advanced Communication Technology","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122328754","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 : 2006-05-08DOI: 10.1109/ICACT.2006.206411
Daejin Park, Suckchel Yang, Y. Shin
We propose a spatial resource grouping based beamforming scheme for performance improvement and feedback information reduction in MIMO-OFDM (multi-input multi-output-orthogonal frequency division multiplexing) systems with SBA (simple bit allocation). In the proposed scheme, to improve performance of MIMO-OFDM systems with the SBA, we consider an effective CSI (channel state information) calculation procedure based on spatial resource grouping, which is adequate for the combination of MRT (maximum ratio transmission) in the transmitter and MRC (maximum ratio combining) in the receiver. Moreover, to reduce feedback information for the beamforming, we also apply QEGT (quantized equal gain transmission) based on quantization of amplitudes and phases of beam weights that are multiplied by each data symbol for beamforming in the transmitter. Simulation results show that the proposed MIMO-OFDM system can achieve closely comparable performance of the ideal case, while effectively reducing the feedback information of the CSI for the SBA based on the beamforming
{"title":"A MIMO-OFDM System with Simple Bit Allocation and Spatial Resource Grouping Based Beamforming","authors":"Daejin Park, Suckchel Yang, Y. Shin","doi":"10.1109/ICACT.2006.206411","DOIUrl":"https://doi.org/10.1109/ICACT.2006.206411","url":null,"abstract":"We propose a spatial resource grouping based beamforming scheme for performance improvement and feedback information reduction in MIMO-OFDM (multi-input multi-output-orthogonal frequency division multiplexing) systems with SBA (simple bit allocation). In the proposed scheme, to improve performance of MIMO-OFDM systems with the SBA, we consider an effective CSI (channel state information) calculation procedure based on spatial resource grouping, which is adequate for the combination of MRT (maximum ratio transmission) in the transmitter and MRC (maximum ratio combining) in the receiver. Moreover, to reduce feedback information for the beamforming, we also apply QEGT (quantized equal gain transmission) based on quantization of amplitudes and phases of beam weights that are multiplied by each data symbol for beamforming in the transmitter. Simulation results show that the proposed MIMO-OFDM system can achieve closely comparable performance of the ideal case, while effectively reducing the feedback information of the CSI for the SBA based on the beamforming","PeriodicalId":247315,"journal":{"name":"2006 8th International Conference Advanced Communication Technology","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122676672","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 : 2006-05-08DOI: 10.1109/ICACT.2006.206338
E. Peytchev, T. Osman, D. Al-Dabass, M. Thomas, Shi Zhi
Traffic information systems have a highly centralized structure. Roadside sensors deliver traffic data to a central unit for processing and is then transmitted, with a significant delay, to drivers via broadcast or on demand via cellular phone. This paper describes the embedded communications and Java technologies essential to establishing pervasive computing networks to enable vehicles to communicate with one another while being part of a traffic system. An adhoc vehicle network is then put forward to enable vehicles to continuously add new nodes as vehicles comes within range. By keeping all nodes within pervasive adhoc network updated in real time, tactics and strategies can be formed and updated as traffic situation changes to ensure maximum flow of vehicles. We would like to offer the term "collaborative sensing and control" (CSC) as a term describing the purpose and phenomenon of new generation of wireless networks where the set of all traffic participants generates the data (not just a single node), processes the data and generates the first layer of local traffic control
{"title":"Communication Technologies for Collaborative Sensing and Control in Vehicular Ad-Hoc Networks","authors":"E. Peytchev, T. Osman, D. Al-Dabass, M. Thomas, Shi Zhi","doi":"10.1109/ICACT.2006.206338","DOIUrl":"https://doi.org/10.1109/ICACT.2006.206338","url":null,"abstract":"Traffic information systems have a highly centralized structure. Roadside sensors deliver traffic data to a central unit for processing and is then transmitted, with a significant delay, to drivers via broadcast or on demand via cellular phone. This paper describes the embedded communications and Java technologies essential to establishing pervasive computing networks to enable vehicles to communicate with one another while being part of a traffic system. An adhoc vehicle network is then put forward to enable vehicles to continuously add new nodes as vehicles comes within range. By keeping all nodes within pervasive adhoc network updated in real time, tactics and strategies can be formed and updated as traffic situation changes to ensure maximum flow of vehicles. We would like to offer the term \"collaborative sensing and control\" (CSC) as a term describing the purpose and phenomenon of new generation of wireless networks where the set of all traffic participants generates the data (not just a single node), processes the data and generates the first layer of local traffic control","PeriodicalId":247315,"journal":{"name":"2006 8th International Conference Advanced Communication Technology","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122711376","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 : 2006-05-08DOI: 10.1109/ICACT.2006.205999
C.R. Dow, R. Hsuan, S.F. Hwang
In mobile ad-hoc networks, anycast techniques can be used to find the nearest service through the anycast address. Although some anycast schemes have been designed and developed for mobile ad-hoc networks, few of them have been practically implemented on real mobile ad-hoc networks, especially for IPv6 based mobile ad-hoc networks. This work designs and implements an anycast scheme which consists of two parts, an anycast address mapper and a clustering scheme. The anycast address mapper is used to resolve the anycast address. The clustering scheme is used to manage the overhead of the anycast requests. In order to make the clustering scheme be able to support IPv6, the message formats and schemes must be modified to support the features of the IPv6. Experiments are conducted and experimental results demonstrate that our anycast schemes can resolve the anycast address via the anycast address mapper and our schemes can effectively operate on IPv6 mobile ad-hoc networks
{"title":"Design and Implementation of Anycast Protocols for Mobile Ad-hoc Networks","authors":"C.R. Dow, R. Hsuan, S.F. Hwang","doi":"10.1109/ICACT.2006.205999","DOIUrl":"https://doi.org/10.1109/ICACT.2006.205999","url":null,"abstract":"In mobile ad-hoc networks, anycast techniques can be used to find the nearest service through the anycast address. Although some anycast schemes have been designed and developed for mobile ad-hoc networks, few of them have been practically implemented on real mobile ad-hoc networks, especially for IPv6 based mobile ad-hoc networks. This work designs and implements an anycast scheme which consists of two parts, an anycast address mapper and a clustering scheme. The anycast address mapper is used to resolve the anycast address. The clustering scheme is used to manage the overhead of the anycast requests. In order to make the clustering scheme be able to support IPv6, the message formats and schemes must be modified to support the features of the IPv6. Experiments are conducted and experimental results demonstrate that our anycast schemes can resolve the anycast address via the anycast address mapper and our schemes can effectively operate on IPv6 mobile ad-hoc networks","PeriodicalId":247315,"journal":{"name":"2006 8th International Conference Advanced Communication Technology","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114419219","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 : 2006-05-08DOI: 10.1109/ICACT.2006.206066
R. Casaquite, In-Yeup Kong, Myung-Hyun Yoon, W. Hwang
To exploit the multiuser diversity in the CSMA/CA based wireless ad hoc networks, this paper proposes a new algorithm for opportunistic scheduling that will take advantage of both multiuser diversity and power control. The scheduling scheme is performed first before power control to further enhance throughput. The scheduling scheme ensures that the transmission is successful since a best candidate receiver is chosen for transmission and hence minimizes retransmissions. Likewise, the power control algorithm helps reduce interference between links and maximizes spatial reuse. In our study, we provided the scheduling scheme and the power control algorithm. We also showed optimal solutions for minimizing power consumption and maximizing net utility
{"title":"Opportunistic Scheduling with Power Control in Ad Hoc Wireless Networks","authors":"R. Casaquite, In-Yeup Kong, Myung-Hyun Yoon, W. Hwang","doi":"10.1109/ICACT.2006.206066","DOIUrl":"https://doi.org/10.1109/ICACT.2006.206066","url":null,"abstract":"To exploit the multiuser diversity in the CSMA/CA based wireless ad hoc networks, this paper proposes a new algorithm for opportunistic scheduling that will take advantage of both multiuser diversity and power control. The scheduling scheme is performed first before power control to further enhance throughput. The scheduling scheme ensures that the transmission is successful since a best candidate receiver is chosen for transmission and hence minimizes retransmissions. Likewise, the power control algorithm helps reduce interference between links and maximizes spatial reuse. In our study, we provided the scheduling scheme and the power control algorithm. We also showed optimal solutions for minimizing power consumption and maximizing net utility","PeriodicalId":247315,"journal":{"name":"2006 8th International Conference Advanced Communication Technology","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122159456","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
扫码关注我们
求助内容：
应助结果提醒方式：