Pub Date : 2016-09-01DOI: 10.1109/NICS.2016.7725664
P. Ngoc, Tran Trung Duy, Vo Nguyen Quoc Bao, Khuong Ho‐Van
In this paper, we evaluate performances of various transmit antenna selection (TAS) protocols in underlay cognitive radio network under impact of hardware impairments. In particular, a secondary base station (SB) selects one of available antennas to transmit its data to a secondary user (SU) that randomly appears in radio range of the SB. In the first proposed scheme (named RAND), the SB randomly selects one antenna to serve the SU. In the second proposed method (named MAXP), the antenna with maximum transmit power will be used to transmit the data. In the third proposal scheme, an optimal TAS method is proposed to maximize the instantaneous signal-to-noise ratio (SNR) of the SB-SU links. For performance evaluation, we derive exact and asymptotic closed-form expressions of average outage probability (AOP) for the proposed protocols over Rayleigh fading channel. Monte-Carlo simulations are then performed to verify the theoretical results.
{"title":"Transmit antenna selection protocols in random cognitive networks under impact of hardware impairments","authors":"P. Ngoc, Tran Trung Duy, Vo Nguyen Quoc Bao, Khuong Ho‐Van","doi":"10.1109/NICS.2016.7725664","DOIUrl":"https://doi.org/10.1109/NICS.2016.7725664","url":null,"abstract":"In this paper, we evaluate performances of various transmit antenna selection (TAS) protocols in underlay cognitive radio network under impact of hardware impairments. In particular, a secondary base station (SB) selects one of available antennas to transmit its data to a secondary user (SU) that randomly appears in radio range of the SB. In the first proposed scheme (named RAND), the SB randomly selects one antenna to serve the SU. In the second proposed method (named MAXP), the antenna with maximum transmit power will be used to transmit the data. In the third proposal scheme, an optimal TAS method is proposed to maximize the instantaneous signal-to-noise ratio (SNR) of the SB-SU links. For performance evaluation, we derive exact and asymptotic closed-form expressions of average outage probability (AOP) for the proposed protocols over Rayleigh fading channel. Monte-Carlo simulations are then performed to verify the theoretical results.","PeriodicalId":347057,"journal":{"name":"2016 3rd National Foundation for Science and Technology Development Conference on Information and Computer Science (NICS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133098781","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 : 2016-09-01DOI: 10.1109/NICS.2016.7725667
H. Binh, Bui The Duy
Most of the assessment systems are now using the Classical Test Theory (CTT), the real ability of students is not exactly revealed because they rely only on counting the number of true responses without awaring other characteristics like the difficulty of each item. Several testing software are applied weighted questions but they depend on the sentiment of teachers. The modern testing theories nowadays are built on a mathematical model which can calculate the latent trait of students. The Rasch model is the probability model which promotes interaction between an item and a student. We have constructed a system to estimate students' ability basing on Item Response Theory (IRT) and applying K-Means to classify student ranking. In this paper we present a model to categorize students' levels and compare them to traditional assessment methods. The results indicate that the methods we proposed have shown some significant improvement and they could be effectively applied for other tutoring systems. The result is also meaningful in customizing content and testing ways. Beside, the research is a guide line for teachers or test makers to give other testing approaches for various examinations.
{"title":"Student ability estimation based on IRT","authors":"H. Binh, Bui The Duy","doi":"10.1109/NICS.2016.7725667","DOIUrl":"https://doi.org/10.1109/NICS.2016.7725667","url":null,"abstract":"Most of the assessment systems are now using the Classical Test Theory (CTT), the real ability of students is not exactly revealed because they rely only on counting the number of true responses without awaring other characteristics like the difficulty of each item. Several testing software are applied weighted questions but they depend on the sentiment of teachers. The modern testing theories nowadays are built on a mathematical model which can calculate the latent trait of students. The Rasch model is the probability model which promotes interaction between an item and a student. We have constructed a system to estimate students' ability basing on Item Response Theory (IRT) and applying K-Means to classify student ranking. In this paper we present a model to categorize students' levels and compare them to traditional assessment methods. The results indicate that the methods we proposed have shown some significant improvement and they could be effectively applied for other tutoring systems. The result is also meaningful in customizing content and testing ways. Beside, the research is a guide line for teachers or test makers to give other testing approaches for various examinations.","PeriodicalId":347057,"journal":{"name":"2016 3rd National Foundation for Science and Technology Development Conference on Information and Computer Science (NICS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129344050","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 : 2016-09-01DOI: 10.1109/NICS.2016.7725647
Hang Dang, Trung Le, Khanh-Duy Nguyen, N. Ngo
In this paper, we apply Stochastic Gradient Descent framework to the problem of finding minimal enclosing ball for anomaly detection purpose. The main difficulty lies in the fact that the primal form of the optimization problem behind minimal enclosing ball is not convex and hence a convergence to a global minima with a good convergence rate is not guaranteed in theory. We address this issue by transforming the problem of finding a minimal enclosing ball to that of finding a largest margin hyperplane in the extended space. We validate the proposed method on several benchmark datasets. The experimental results point out that our proposed method gains higher testing accuracy while simultaneously achieving a significantly computational speedup.
{"title":"Stochastic gradient descent for minimal enclosing ball","authors":"Hang Dang, Trung Le, Khanh-Duy Nguyen, N. Ngo","doi":"10.1109/NICS.2016.7725647","DOIUrl":"https://doi.org/10.1109/NICS.2016.7725647","url":null,"abstract":"In this paper, we apply Stochastic Gradient Descent framework to the problem of finding minimal enclosing ball for anomaly detection purpose. The main difficulty lies in the fact that the primal form of the optimization problem behind minimal enclosing ball is not convex and hence a convergence to a global minima with a good convergence rate is not guaranteed in theory. We address this issue by transforming the problem of finding a minimal enclosing ball to that of finding a largest margin hyperplane in the extended space. We validate the proposed method on several benchmark datasets. The experimental results point out that our proposed method gains higher testing accuracy while simultaneously achieving a significantly computational speedup.","PeriodicalId":347057,"journal":{"name":"2016 3rd National Foundation for Science and Technology Development Conference on Information and Computer Science (NICS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127186308","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 : 2016-09-01DOI: 10.1109/NICS.2016.7725636
Minh Dang, Duc Duong
News articles serve the purpose of spreading company's information to the investors either consciously or unconsciously in their trading strategies on the stock market. Because of the immense growth of the internet in the last decade, the amount of financial articles have experienced a significant growth. It is important to analyze the information as fast as possible so they can support the investors in making the smart trading decisions before the market has had time to adjust itself to the effect of the information. This paper proposes an approach of using time series analysis and improved text mining techniques to predict daily stock market directions. Experiment results show that our system achieved high accuracy (up to 73%) in predicting the stock trends.
{"title":"Improvement methods for stock market prediction using financial news articles","authors":"Minh Dang, Duc Duong","doi":"10.1109/NICS.2016.7725636","DOIUrl":"https://doi.org/10.1109/NICS.2016.7725636","url":null,"abstract":"News articles serve the purpose of spreading company's information to the investors either consciously or unconsciously in their trading strategies on the stock market. Because of the immense growth of the internet in the last decade, the amount of financial articles have experienced a significant growth. It is important to analyze the information as fast as possible so they can support the investors in making the smart trading decisions before the market has had time to adjust itself to the effect of the information. This paper proposes an approach of using time series analysis and improved text mining techniques to predict daily stock market directions. Experiment results show that our system achieved high accuracy (up to 73%) in predicting the stock trends.","PeriodicalId":347057,"journal":{"name":"2016 3rd National Foundation for Science and Technology Development Conference on Information and Computer Science (NICS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132038419","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 : 2016-09-01DOI: 10.1109/NICS.2016.7725626
T. Le-Ngoc
Multiple-input multiple-output (MIMO) communications systems have been seriously considered in recent years to achieve substantial gains in spectral, power, and energy efficiency compared to conventional single-input single-output (SISO) systems. Various MIMO configurations based on Single-User (SU)-MIMO, Multi-User (MU)-MIMO, network-MIMO architectures have been proposed for LTE systems. To accommodate the ever-increasing demands of different multimedia services and applications, the evolving next-generation wireless access networks are envisioned to support 1,000-fold gains in capacity, connections for billions of diverse devices, and Gb/s individual user data rates. Massive MIMO has emerged as a promising technology to deal with such challenges. Through the use of an excessively large number of service antennas in a fully coherent and adaptive operation, transmission and reception of signal energy can be focused into small regions to offer large improvements in throughput and energy efficiency, especially when combined with multi-user scheduling and in mmWave bands. Furthermore, massive MIMO can enhance the robustness to interference and intentional jamming. The talk will provide an overview from MIMO, SU-MIMO, MU-MIMO, network-MIMO to massive MIMO developments applicable to next-generation wireless access communications, and highlight various technical issues and solutions.
{"title":"Keynote talk #1: 5G: From MIMO to massive MIMO","authors":"T. Le-Ngoc","doi":"10.1109/NICS.2016.7725626","DOIUrl":"https://doi.org/10.1109/NICS.2016.7725626","url":null,"abstract":"Multiple-input multiple-output (MIMO) communications systems have been seriously considered in recent years to achieve substantial gains in spectral, power, and energy efficiency compared to conventional single-input single-output (SISO) systems. Various MIMO configurations based on Single-User (SU)-MIMO, Multi-User (MU)-MIMO, network-MIMO architectures have been proposed for LTE systems. To accommodate the ever-increasing demands of different multimedia services and applications, the evolving next-generation wireless access networks are envisioned to support 1,000-fold gains in capacity, connections for billions of diverse devices, and Gb/s individual user data rates. Massive MIMO has emerged as a promising technology to deal with such challenges. Through the use of an excessively large number of service antennas in a fully coherent and adaptive operation, transmission and reception of signal energy can be focused into small regions to offer large improvements in throughput and energy efficiency, especially when combined with multi-user scheduling and in mmWave bands. Furthermore, massive MIMO can enhance the robustness to interference and intentional jamming. The talk will provide an overview from MIMO, SU-MIMO, MU-MIMO, network-MIMO to massive MIMO developments applicable to next-generation wireless access communications, and highlight various technical issues and solutions.","PeriodicalId":347057,"journal":{"name":"2016 3rd National Foundation for Science and Technology Development Conference on Information and Computer Science (NICS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127170984","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 : 2016-09-01DOI: 10.1109/NICS.2016.7725661
Do Dung Nguyen, Qingchun Chen
In this paper, we consider multiple-pair communication in massive MIMO relay network, wherein K single antenna source nodes deliver their messages to the corresponding K single antenna destination nodes with the help of one relay provisioned with N(N >> K) antenna array. And the energy efficient multiple-pair communication in Massive MIMO relay network through the precoding at both sources and relay is addressed. It is shown that, given the channel state information at the source nodes and the relay, the zero-forcing precoding at all source nodes, the zero-forcing reception and zero-forcing transmission (ZFR/ZFT) or the zero-forcing reception and maximum ratio transmission (ZFR/MRT) at relay can be employed to mitigate inter-pair interference. The asymptotical analysis shows that, the required transmit power at relay can be made inversely proportional to the number of relay antennas without sacrificing the achieved energy efficiency. And the optimal power allocation problem is further formulated to address the power allocation design at all source nodes and the relay according to the large-scale fading for a better energy efficiency, when fulfilling some predefined sum rate performance requirements.
{"title":"On the energy efficient multiple-pair communication in massive MIMO relay networks","authors":"Do Dung Nguyen, Qingchun Chen","doi":"10.1109/NICS.2016.7725661","DOIUrl":"https://doi.org/10.1109/NICS.2016.7725661","url":null,"abstract":"In this paper, we consider multiple-pair communication in massive MIMO relay network, wherein K single antenna source nodes deliver their messages to the corresponding K single antenna destination nodes with the help of one relay provisioned with N(N >> K) antenna array. And the energy efficient multiple-pair communication in Massive MIMO relay network through the precoding at both sources and relay is addressed. It is shown that, given the channel state information at the source nodes and the relay, the zero-forcing precoding at all source nodes, the zero-forcing reception and zero-forcing transmission (ZFR/ZFT) or the zero-forcing reception and maximum ratio transmission (ZFR/MRT) at relay can be employed to mitigate inter-pair interference. The asymptotical analysis shows that, the required transmit power at relay can be made inversely proportional to the number of relay antennas without sacrificing the achieved energy efficiency. And the optimal power allocation problem is further formulated to address the power allocation design at all source nodes and the relay according to the large-scale fading for a better energy efficiency, when fulfilling some predefined sum rate performance requirements.","PeriodicalId":347057,"journal":{"name":"2016 3rd National Foundation for Science and Technology Development Conference on Information and Computer Science (NICS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124936899","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 : 2016-09-01DOI: 10.1109/NICS.2016.7725674
Nga Le-Thi-Thu, Khoi Nguyen-Tan, Thuy Nguyen-Thanh
Surfaces over triangular domain are a powerful and flexible tool for modeling of complex objects with non-rectangular topology. Due to the particular advantages of triangular parametric surfaces, they have wide application and prospect in computer aided design and reverse engineering. The interpolation or approximation problem for reconstructing an arbitrary topological parametric surface from scattered data points or polygonal mesh is one of the significant research areas. This paper deals with the approximation of triangular B-spline surfaces based on a local geometric fitting algorithm and an inverse Loop subdivision scheme. The reconstructed triangular B-spline with the low degree crosses through most of the given data points of an initial triangular mesh. The accuracy of the obtained triangular B-spline surfaces can be carried out by changing the position of control points in the local geometric algorithm as well as a number of the inverse subdivision times. Finally, we demonstrate the effectiveness of the proposed method with some experimental examples.
{"title":"Approximation of triangular B-spline surfaces by local geometric fitting algorithm","authors":"Nga Le-Thi-Thu, Khoi Nguyen-Tan, Thuy Nguyen-Thanh","doi":"10.1109/NICS.2016.7725674","DOIUrl":"https://doi.org/10.1109/NICS.2016.7725674","url":null,"abstract":"Surfaces over triangular domain are a powerful and flexible tool for modeling of complex objects with non-rectangular topology. Due to the particular advantages of triangular parametric surfaces, they have wide application and prospect in computer aided design and reverse engineering. The interpolation or approximation problem for reconstructing an arbitrary topological parametric surface from scattered data points or polygonal mesh is one of the significant research areas. This paper deals with the approximation of triangular B-spline surfaces based on a local geometric fitting algorithm and an inverse Loop subdivision scheme. The reconstructed triangular B-spline with the low degree crosses through most of the given data points of an initial triangular mesh. The accuracy of the obtained triangular B-spline surfaces can be carried out by changing the position of control points in the local geometric algorithm as well as a number of the inverse subdivision times. Finally, we demonstrate the effectiveness of the proposed method with some experimental examples.","PeriodicalId":347057,"journal":{"name":"2016 3rd National Foundation for Science and Technology Development Conference on Information and Computer Science (NICS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124475128","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 : 2016-09-01DOI: 10.1109/NICS.2016.7725650
T. Phan, Van‐Phuc Hoang, V. Dao
This paper presents an efficient AES-CCM IP core by combining a compact 8-bit AES encryption core and iterative structure. The AES-CCM core is used for message security at the MAC level, e.g. message authentication and encryption, based on AES forward cipher function for 128-bit keys operating with counter mode and cipher block chaining mode. The implementation results on FPGA show that the proposed AES-CCM core has higher resource usage efficiency compared with other designs.
{"title":"An efficient FPGA implementation of AES-CCM authenticated encryption IP core","authors":"T. Phan, Van‐Phuc Hoang, V. Dao","doi":"10.1109/NICS.2016.7725650","DOIUrl":"https://doi.org/10.1109/NICS.2016.7725650","url":null,"abstract":"This paper presents an efficient AES-CCM IP core by combining a compact 8-bit AES encryption core and iterative structure. The AES-CCM core is used for message security at the MAC level, e.g. message authentication and encryption, based on AES forward cipher function for 128-bit keys operating with counter mode and cipher block chaining mode. The implementation results on FPGA show that the proposed AES-CCM core has higher resource usage efficiency compared with other designs.","PeriodicalId":347057,"journal":{"name":"2016 3rd National Foundation for Science and Technology Development Conference on Information and Computer Science (NICS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128304594","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 : 2016-09-01DOI: 10.1109/NICS.2016.7725631
Vo Nguyen Quoc Bao, Ho Van Cuu
In this paper, we derive the secure outage probability for secure distributed switch-and-stay combining (DSSC) networks over Rayleigh fading channels. Monte Carlo simulations are performed to verify the analysis and to confirm the secure advantage of the proposed DSSC networks over secure direct transmission and secure incremental relay networks.
{"title":"Secure distributed switch-and-stay combining networks: Secure outage probability analysis","authors":"Vo Nguyen Quoc Bao, Ho Van Cuu","doi":"10.1109/NICS.2016.7725631","DOIUrl":"https://doi.org/10.1109/NICS.2016.7725631","url":null,"abstract":"In this paper, we derive the secure outage probability for secure distributed switch-and-stay combining (DSSC) networks over Rayleigh fading channels. Monte Carlo simulations are performed to verify the analysis and to confirm the secure advantage of the proposed DSSC networks over secure direct transmission and secure incremental relay networks.","PeriodicalId":347057,"journal":{"name":"2016 3rd National Foundation for Science and Technology Development Conference on Information and Computer Science (NICS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120955280","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 : 2016-09-01DOI: 10.1109/NICS.2016.7725658
Dang Tran, Nhuan Tran, B. Nguyen, Hieu Hanh Le
In comparison with other scaling techniques, forecast of workload and resource consumption brings a great advantage to SaaS operations in cloud environment because system knows early and precisely the number of resources must be increased or decreased. However, the prediction accuracy still needs to be improved further even though there are many research works that have dealt with the problem. In this paper, we present a novel prediction model, which combines periodicity detection technique and neural network trained by genetic-back propagation algorithm to forecast the future values of time series data. The model is experimented with real workload dataset of a web application. The tests proved significant effectiveness of the model in improving the prediction accuracy. Our model thus can enhance the performance of applications running on cloud and distributed environment.
{"title":"PD-GABP — A novel prediction model applying for elastic applications in distributed environment","authors":"Dang Tran, Nhuan Tran, B. Nguyen, Hieu Hanh Le","doi":"10.1109/NICS.2016.7725658","DOIUrl":"https://doi.org/10.1109/NICS.2016.7725658","url":null,"abstract":"In comparison with other scaling techniques, forecast of workload and resource consumption brings a great advantage to SaaS operations in cloud environment because system knows early and precisely the number of resources must be increased or decreased. However, the prediction accuracy still needs to be improved further even though there are many research works that have dealt with the problem. In this paper, we present a novel prediction model, which combines periodicity detection technique and neural network trained by genetic-back propagation algorithm to forecast the future values of time series data. The model is experimented with real workload dataset of a web application. The tests proved significant effectiveness of the model in improving the prediction accuracy. Our model thus can enhance the performance of applications running on cloud and distributed environment.","PeriodicalId":347057,"journal":{"name":"2016 3rd National Foundation for Science and Technology Development Conference on Information and Computer Science (NICS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129982371","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
扫码关注我们
求助内容：
应助结果提醒方式：