Pub Date : 2008-04-22DOI: 10.1109/ICACT.2008.4493846
Jong-Myoung Kim, Seon-Ho Park, Young-Ju Han, Tai M. Chung
In designing the wireless sensor networks, the energy is the most important consideration because the lifetime of the sensor node is limited by the battery of it. To overcome this demerit many research have been done. The clustering is the one of the representative approaches. In the clustering, the cluster heads gather data from nodes, aggregate it and send the information to the base station. In this way, the sensor nodes can reduce communication overheads that may be generated if each sensor node reports sensed data to the base station independently. LEACH is one of the most famous clustering mechanisms. It elects a cluster head based on probability model. This approach may reduce the network lifetime because LEACH does not consider the distribution of sensor nodes and the energy remains of each node. However, using the location and the energy information in the clustering can generate big overheads. In this paper we introduce CHEF - cluster head election mechanism using fuzzy logic. By using fuzzy logic, collecting and calculating overheads can be reduced and finally the lifetime of the sensor networks can be prolonged. To prove efficiency of CHEF, we simulated CHEF compared with LEACH using the matlab. Our simulation results show that CHEF is about 22.7% more efficient than LEACH.
{"title":"CHEF: Cluster Head Election mechanism using Fuzzy logic in Wireless Sensor Networks","authors":"Jong-Myoung Kim, Seon-Ho Park, Young-Ju Han, Tai M. Chung","doi":"10.1109/ICACT.2008.4493846","DOIUrl":"https://doi.org/10.1109/ICACT.2008.4493846","url":null,"abstract":"In designing the wireless sensor networks, the energy is the most important consideration because the lifetime of the sensor node is limited by the battery of it. To overcome this demerit many research have been done. The clustering is the one of the representative approaches. In the clustering, the cluster heads gather data from nodes, aggregate it and send the information to the base station. In this way, the sensor nodes can reduce communication overheads that may be generated if each sensor node reports sensed data to the base station independently. LEACH is one of the most famous clustering mechanisms. It elects a cluster head based on probability model. This approach may reduce the network lifetime because LEACH does not consider the distribution of sensor nodes and the energy remains of each node. However, using the location and the energy information in the clustering can generate big overheads. In this paper we introduce CHEF - cluster head election mechanism using fuzzy logic. By using fuzzy logic, collecting and calculating overheads can be reduced and finally the lifetime of the sensor networks can be prolonged. To prove efficiency of CHEF, we simulated CHEF compared with LEACH using the matlab. Our simulation results show that CHEF is about 22.7% more efficient than LEACH.","PeriodicalId":448615,"journal":{"name":"2008 10th International Conference on Advanced Communication Technology","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127724641","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 : 2008-04-22DOI: 10.1109/ICACT.2008.4493771
Do-Hyung Kim, Minhong Yun, Sunja Kim, Cheol-Hoon Lee
The paper describes the design and implementation of Qplus Smartphone Edition based on embedded Linux. Existing Smartphone platforms entailed royalty expenses and had customization difficulties due to the closure of their source codes. The Qplus Smartphone Edition requires no royalty because it is based on the embedded Linux. And, it supports key navigation functionality such as moving between folders or running applications with key-only operations. It also provides more user friendly environment through screen interfaces and indicators similar to those of the cellular phones.
{"title":"Design and Implementation of Smartphone Edition based on Embedded Linux","authors":"Do-Hyung Kim, Minhong Yun, Sunja Kim, Cheol-Hoon Lee","doi":"10.1109/ICACT.2008.4493771","DOIUrl":"https://doi.org/10.1109/ICACT.2008.4493771","url":null,"abstract":"The paper describes the design and implementation of Qplus Smartphone Edition based on embedded Linux. Existing Smartphone platforms entailed royalty expenses and had customization difficulties due to the closure of their source codes. The Qplus Smartphone Edition requires no royalty because it is based on the embedded Linux. And, it supports key navigation functionality such as moving between folders or running applications with key-only operations. It also provides more user friendly environment through screen interfaces and indicators similar to those of the cellular phones.","PeriodicalId":448615,"journal":{"name":"2008 10th International Conference on Advanced Communication Technology","volume":"133 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133187757","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 : 2008-04-22DOI: 10.1109/ICACT.2008.4493861
Il Jin Youn
In this paper, we apply the antenna selection to noncoherent Alamouti space-time coding for transmission over a Rayleigh fading channel. We investigated the effect of antenna selection on average bit error probability of noncoherent detection of Alamouti space-time coded orthogonal modulation. The performance is evaluated, through a simulation study, for the cases of a single receive antenna and a dual receive antenna. Results establish the degree of diversity gain that could be achieved with antenna selection.
{"title":"Noncoherent M-ary Orthogonal FSK Alamouti Space-Time Coding with Antenna Selection","authors":"Il Jin Youn","doi":"10.1109/ICACT.2008.4493861","DOIUrl":"https://doi.org/10.1109/ICACT.2008.4493861","url":null,"abstract":"In this paper, we apply the antenna selection to noncoherent Alamouti space-time coding for transmission over a Rayleigh fading channel. We investigated the effect of antenna selection on average bit error probability of noncoherent detection of Alamouti space-time coded orthogonal modulation. The performance is evaluated, through a simulation study, for the cases of a single receive antenna and a dual receive antenna. Results establish the degree of diversity gain that could be achieved with antenna selection.","PeriodicalId":448615,"journal":{"name":"2008 10th International Conference on Advanced Communication Technology","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133242749","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 : 2008-04-22DOI: 10.1109/ICACT.2008.4493805
Jisoo Park, Han-Sang Yoon
In this manuscript, we propose a mobile communication system having devices processing control and traffic calls in a radio access network and a method for controlling call processing load of the devices to evenly distribute call process load to respective devices and to process a call having the highest priority among priority-based quality of service(QoS) calls. With our proposed method, we present a different way of controlling call processing load from load control actions with respect to the processor device and the load control points of view based on software and hardware performance in the control station system of a radio access network.
{"title":"Radio Access Network Fairly Distributing Multimedia Calls and Method Controlling Call Process Load","authors":"Jisoo Park, Han-Sang Yoon","doi":"10.1109/ICACT.2008.4493805","DOIUrl":"https://doi.org/10.1109/ICACT.2008.4493805","url":null,"abstract":"In this manuscript, we propose a mobile communication system having devices processing control and traffic calls in a radio access network and a method for controlling call processing load of the devices to evenly distribute call process load to respective devices and to process a call having the highest priority among priority-based quality of service(QoS) calls. With our proposed method, we present a different way of controlling call processing load from load control actions with respect to the processor device and the load control points of view based on software and hardware performance in the control station system of a radio access network.","PeriodicalId":448615,"journal":{"name":"2008 10th International Conference on Advanced Communication Technology","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133336118","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 : 2008-04-22DOI: 10.1109/ICACT.2008.4493797
A. Kora, J. Cances, V. Meghdadi
This paper introduces a semi-blind channel estimation algorithm based on receiver diversity for Multiple Input Multiple Output (MIMO) systems using Orthogonal Frequency Division Multiplexing (OFDM) modulation. To enable the receiver to separate deterministically the preamble streams from each transmit antenna, a given set of subcarriers is attributed to each transmit antenna in the data block which is used as preamble. The receiver can extract the desired transmitted signal by using selectors. The problem is then reduced to a Single Input Multiple Output (SIMO) scheme. Our method consists firstly in separating the contributions of the different transmit antennas and secondly in a semi-blind SIMO channel estimation algorithm which uses SVD decomposition of a particular matrix. The scalar ambiguity of the estimated channel is removed by using a reduced number of pilots symbols.
{"title":"Semi-blind channel estimation based on receiver diversity","authors":"A. Kora, J. Cances, V. Meghdadi","doi":"10.1109/ICACT.2008.4493797","DOIUrl":"https://doi.org/10.1109/ICACT.2008.4493797","url":null,"abstract":"This paper introduces a semi-blind channel estimation algorithm based on receiver diversity for Multiple Input Multiple Output (MIMO) systems using Orthogonal Frequency Division Multiplexing (OFDM) modulation. To enable the receiver to separate deterministically the preamble streams from each transmit antenna, a given set of subcarriers is attributed to each transmit antenna in the data block which is used as preamble. The receiver can extract the desired transmitted signal by using selectors. The problem is then reduced to a Single Input Multiple Output (SIMO) scheme. Our method consists firstly in separating the contributions of the different transmit antennas and secondly in a semi-blind SIMO channel estimation algorithm which uses SVD decomposition of a particular matrix. The scalar ambiguity of the estimated channel is removed by using a reduced number of pilots symbols.","PeriodicalId":448615,"journal":{"name":"2008 10th International Conference on Advanced Communication Technology","volume":"61 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131850720","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 : 2008-04-22DOI: 10.1109/ICACT.2008.4494036
J. Ham, Myung-Bum Jung, Bo-Kyung Seong, Junhyung Park, Min-ho Park, Il-Ju Ko
Previous games including a scrolling shooter game lacked an emotional mechanism according to a personality of character. So characters could only express a simple and short emotion. If characters have emotions that is specialized their personality, they will show emotional response according to their personality. This effect will give emotional stimulus to players, so players' satisfaction and interactivity between characters and players will be improved. Therefore this paper purposes researching and developing an artificial emotion which can express emotions according to situations and character's personality in a scrolling shooter game. We will suggest three methods for our artificial emotions. First one is an emotion analyzing method which receives emotional stimulus and analyzes what kind of emotions have induced. Second one is an emotion controlling method which controls various emotions organically according to time and characters' personality. Last one is an emotion deciding method which decides emotional responses and actions according to emotions of present We made a scrolling shooter game based on an existing scrolling shooter game, and made another version which is applied our artificial emotion for estimating player's satisfaction And we compared and estimated two versions through a questionnaire.
{"title":"A Personality Specialized Artificial Emotion for a Scrolling Shooter game","authors":"J. Ham, Myung-Bum Jung, Bo-Kyung Seong, Junhyung Park, Min-ho Park, Il-Ju Ko","doi":"10.1109/ICACT.2008.4494036","DOIUrl":"https://doi.org/10.1109/ICACT.2008.4494036","url":null,"abstract":"Previous games including a scrolling shooter game lacked an emotional mechanism according to a personality of character. So characters could only express a simple and short emotion. If characters have emotions that is specialized their personality, they will show emotional response according to their personality. This effect will give emotional stimulus to players, so players' satisfaction and interactivity between characters and players will be improved. Therefore this paper purposes researching and developing an artificial emotion which can express emotions according to situations and character's personality in a scrolling shooter game. We will suggest three methods for our artificial emotions. First one is an emotion analyzing method which receives emotional stimulus and analyzes what kind of emotions have induced. Second one is an emotion controlling method which controls various emotions organically according to time and characters' personality. Last one is an emotion deciding method which decides emotional responses and actions according to emotions of present We made a scrolling shooter game based on an existing scrolling shooter game, and made another version which is applied our artificial emotion for estimating player's satisfaction And we compared and estimated two versions through a questionnaire.","PeriodicalId":448615,"journal":{"name":"2008 10th International Conference on Advanced Communication Technology","volume":"14 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133135592","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 : 2008-04-22DOI: 10.1109/ICACT.2008.4493982
Young Sun Lim, J. S. Park, Pansoo Kim, D. Chang, Hojin Lee, J. Kim
Phase estimation is a critical issue for turbo code implementation because good performance of turbo codes always implicitly assumes complete phase synchronization. Phase offset changes fast and must be treated on a symbol basis with much more complicated modeling. In this paper, we present and analyze an efficient phase synchronization method based on PSP (per-survivor processing) for modern satellite systems with multimedia services. When the PSP estimator is implemented by hardware, the complexity is significantly increased. To relieve this complexity, we propose novel synchronization method by changing the number of path according to condition of channels. The number of calculation is reduced consequently and the performance maintains similar to existing PSP because the number of path decrease for various kinds of scenarios of channel conditions. Both theoretical and simulated results are presented for varying simulation parameters. The proposed technique can be applied to the turbo coding-based satellite multimedia communication systems.
{"title":"Efficient Phase Estimation Using Turbo Decoding In Satellite Communications System","authors":"Young Sun Lim, J. S. Park, Pansoo Kim, D. Chang, Hojin Lee, J. Kim","doi":"10.1109/ICACT.2008.4493982","DOIUrl":"https://doi.org/10.1109/ICACT.2008.4493982","url":null,"abstract":"Phase estimation is a critical issue for turbo code implementation because good performance of turbo codes always implicitly assumes complete phase synchronization. Phase offset changes fast and must be treated on a symbol basis with much more complicated modeling. In this paper, we present and analyze an efficient phase synchronization method based on PSP (per-survivor processing) for modern satellite systems with multimedia services. When the PSP estimator is implemented by hardware, the complexity is significantly increased. To relieve this complexity, we propose novel synchronization method by changing the number of path according to condition of channels. The number of calculation is reduced consequently and the performance maintains similar to existing PSP because the number of path decrease for various kinds of scenarios of channel conditions. Both theoretical and simulated results are presented for varying simulation parameters. The proposed technique can be applied to the turbo coding-based satellite multimedia communication systems.","PeriodicalId":448615,"journal":{"name":"2008 10th International Conference on Advanced Communication Technology","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133814921","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 : 2008-04-22DOI: 10.1109/ICACT.2008.4493953
Kyoung-Sook Ryu, Byeong-Seog Choe
The various switch architectures have been proposed to switch the variable length packets between input and output port in recent Internet environments. The conventional switch architectures have considered two approaches to employ ATM switching fabric, i.e., An original packet segmentation/reassemble and reserve buffers at the cross point in the switching fabric. However, these add overhead time to the system. In this paper, we propose a new switch architecture, named APS (address pointer switch), which has separated the data memory plane and the address pointer switching plane. The original packet will be stored on the separated memory structure and simultaneously only the memory address pointers will be forwarded through the switching fabric. The small mini packets that carry address pointers and basic forwarding information will be passed through the address pointer switching fabric. It is possible to achieve remarkable switching performance compared to other switch fabrics with contending variable length packets.
{"title":"A novel address pointer switch architecture for variable length packets","authors":"Kyoung-Sook Ryu, Byeong-Seog Choe","doi":"10.1109/ICACT.2008.4493953","DOIUrl":"https://doi.org/10.1109/ICACT.2008.4493953","url":null,"abstract":"The various switch architectures have been proposed to switch the variable length packets between input and output port in recent Internet environments. The conventional switch architectures have considered two approaches to employ ATM switching fabric, i.e., An original packet segmentation/reassemble and reserve buffers at the cross point in the switching fabric. However, these add overhead time to the system. In this paper, we propose a new switch architecture, named APS (address pointer switch), which has separated the data memory plane and the address pointer switching plane. The original packet will be stored on the separated memory structure and simultaneously only the memory address pointers will be forwarded through the switching fabric. The small mini packets that carry address pointers and basic forwarding information will be passed through the address pointer switching fabric. It is possible to achieve remarkable switching performance compared to other switch fabrics with contending variable length packets.","PeriodicalId":448615,"journal":{"name":"2008 10th International Conference on Advanced Communication Technology","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133834736","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 : 2008-04-22DOI: 10.1109/ICACT.2008.4494187
S.N. Azar, A. Jalali, S. Falsafi
By integrating applications and resources, portals allow users access information in simple way. Portals are a single, integrated point of access to information and application. Portals are provided a comprehensive context and an aggregated view across all information. For this reason there are lots of vendors who provide the portal product and selecting of appropriate portal become very important for companies. In previous methods portals were compared according to the number of features that they have provided. In those methods was not considered functionality of enterprise. In this paper we evaluate portals with some criteria.
{"title":"Commercial Portals Evaluation","authors":"S.N. Azar, A. Jalali, S. Falsafi","doi":"10.1109/ICACT.2008.4494187","DOIUrl":"https://doi.org/10.1109/ICACT.2008.4494187","url":null,"abstract":"By integrating applications and resources, portals allow users access information in simple way. Portals are a single, integrated point of access to information and application. Portals are provided a comprehensive context and an aggregated view across all information. For this reason there are lots of vendors who provide the portal product and selecting of appropriate portal become very important for companies. In previous methods portals were compared according to the number of features that they have provided. In those methods was not considered functionality of enterprise. In this paper we evaluate portals with some criteria.","PeriodicalId":448615,"journal":{"name":"2008 10th International Conference on Advanced Communication Technology","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125161040","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 : 2008-04-22DOI: 10.1109/ICACT.2008.4493853
Euihyoung Lee, Seungsoo Yoo, Sun Yong Kim, Youngyoon Lee, Seokho Yoon, Seok-Pil Lee
The single delta delay lock loop is the most widely used code tracking scheme for the GALILEO system that employs the binary offset carrier modulated spreading signal. When only a line-of-sight signal is received, the single delta delay lock loop is the optimal code tracking scheme. However, when the multipath signals are received, the correlation values are distorted, and thus, the tracking bias arises, which is defined as the difference between correct and estimated synchronization points. To tackle this problem, many tracking schemes have been proposed, e.g. narrow correlator DLL, high resolution correlator DLL, and so on. These schemes use the correlation values nearby the offset of the peak correlation values. However, the coherent auto-correlation function of the binary offset carrier modulated spreading signal has additionally two locally minimum correlation values whose offsets are plusmnTc /2 , respectively, where Tc is the chip duration. In multipath environments, the correlation values nearby the locally minimum correlation value are less distorted compared with those nearby the one whose offset is plusmnTc /2 . From this observation, we propose a novel tracking scheme, and then, its tracking accuracy is assessed using Monte-Carlo simulation.
{"title":"A Novel Code Tracking Scheme using Correlation Outputs in Advanced Offset Region for GALILEO L1 Open Service","authors":"Euihyoung Lee, Seungsoo Yoo, Sun Yong Kim, Youngyoon Lee, Seokho Yoon, Seok-Pil Lee","doi":"10.1109/ICACT.2008.4493853","DOIUrl":"https://doi.org/10.1109/ICACT.2008.4493853","url":null,"abstract":"The single delta delay lock loop is the most widely used code tracking scheme for the GALILEO system that employs the binary offset carrier modulated spreading signal. When only a line-of-sight signal is received, the single delta delay lock loop is the optimal code tracking scheme. However, when the multipath signals are received, the correlation values are distorted, and thus, the tracking bias arises, which is defined as the difference between correct and estimated synchronization points. To tackle this problem, many tracking schemes have been proposed, e.g. narrow correlator DLL, high resolution correlator DLL, and so on. These schemes use the correlation values nearby the offset of the peak correlation values. However, the coherent auto-correlation function of the binary offset carrier modulated spreading signal has additionally two locally minimum correlation values whose offsets are plusmnTc /2 , respectively, where Tc is the chip duration. In multipath environments, the correlation values nearby the locally minimum correlation value are less distorted compared with those nearby the one whose offset is plusmnTc /2 . From this observation, we propose a novel tracking scheme, and then, its tracking accuracy is assessed using Monte-Carlo simulation.","PeriodicalId":448615,"journal":{"name":"2008 10th International Conference on Advanced Communication Technology","volume":"116 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131809301","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
扫码关注我们
求助内容：
应助结果提醒方式：