Pub Date : 2010-11-01DOI: 10.1109/ICCIT.2010.5711115
JeaHoon Park, Eun-Young Park, S. Moon, Dooho Choi, Yousung Kang, JaeCheol Ha
This paper considers a secure and efficient CRT-RSA scheme resistant to fault attacks. Recently, Boscher et al. proposed a secure CRT-RSA scheme by verifying signature using a public exponent. However, it is almost two times slower compared to the classical CRT-RSA signature when the exponent is expected to be a long number. We present a low-cost and secure CRT-RSA scheme by generating a small exponent for checking the correctness of signature. Furthermore, since our scheme can use fast double exponentiation algorithm based on right-to-left binary method having two exponents, it has low computational load compared to other existing schemes.
{"title":"Fault resistant CRT-RSA scheme adopting a small exponent","authors":"JeaHoon Park, Eun-Young Park, S. Moon, Dooho Choi, Yousung Kang, JaeCheol Ha","doi":"10.1109/ICCIT.2010.5711115","DOIUrl":"https://doi.org/10.1109/ICCIT.2010.5711115","url":null,"abstract":"This paper considers a secure and efficient CRT-RSA scheme resistant to fault attacks. Recently, Boscher et al. proposed a secure CRT-RSA scheme by verifying signature using a public exponent. However, it is almost two times slower compared to the classical CRT-RSA signature when the exponent is expected to be a long number. We present a low-cost and secure CRT-RSA scheme by generating a small exponent for checking the correctness of signature. Furthermore, since our scheme can use fast double exponentiation algorithm based on right-to-left binary method having two exponents, it has low computational load compared to other existing schemes.","PeriodicalId":131337,"journal":{"name":"5th International Conference on Computer Sciences and Convergence Information Technology","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114784165","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 : 2010-11-01DOI: 10.1109/ICCIT.2010.5711086
H. Sug
RBF networks are good at prediction tasks of data mining, and k-means clustering algorithm is one of the mostly used clustering algorithms for basis functions of RBF networks. K-means clustering algorithm needs the number of clusters for initialization, and depending on the number of clusters, the accuracy of RBF networks change. But we cannot resort to increasing the number of clusters in the RBF networks in sequential manner, because we have limited computing resources. This paper suggests an objective and systematic approach using decision tree in determining a proper number of clusters to find good RBF networks with respect to accuracy. Experiments with two different data sets showed very promising results.
{"title":"An objective method to find better RBF networks in classification","authors":"H. Sug","doi":"10.1109/ICCIT.2010.5711086","DOIUrl":"https://doi.org/10.1109/ICCIT.2010.5711086","url":null,"abstract":"RBF networks are good at prediction tasks of data mining, and k-means clustering algorithm is one of the mostly used clustering algorithms for basis functions of RBF networks. K-means clustering algorithm needs the number of clusters for initialization, and depending on the number of clusters, the accuracy of RBF networks change. But we cannot resort to increasing the number of clusters in the RBF networks in sequential manner, because we have limited computing resources. This paper suggests an objective and systematic approach using decision tree in determining a proper number of clusters to find good RBF networks with respect to accuracy. Experiments with two different data sets showed very promising results.","PeriodicalId":131337,"journal":{"name":"5th International Conference on Computer Sciences and Convergence Information Technology","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128053711","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 : 2010-11-01DOI: 10.1109/ICCIT.2010.5711046
Divya Ranjan, A. Tripathi
Software frameworks, common and reusable to the development of a family of applications, are pre-implemented architectures having predefined points of variability. During framework reuse, implementation of one (or more than one) of the different possible alternatives of the variability take place. Variability is the number of possible variant implementations of hook methods, which are actually abstract or empty methods, in the framework. The reusability (number of opportunities of reuse) of a framework increases with the increase in abstractness or variability of the framework. High reusability is desired and therefore a framework developer may go on increasing the variability of a framework by providing more loose points, i.e. hot spots, to it. In the present paper, an experimental analysis has been carried out to understand the effect of variability possessed by a framework on the effort required to test the framework and it has been found that although the reusability of a framework increases with increase in the variability/abstractness of a framework but it does have adverse effects upon the testability of the framework. Hence, as a framework developer one has to restrain increasing the abstractness of a framework (while developing it) in order to put constraints over testing effort. The reusable framework demands stricter and rigorous testing in comparison to one-time use software artefacts. It is always advisable to guaranty the production of high quality reusable artefacts without incurring heavy costs for rigorous testing.
{"title":"Effect of variability of a framework upon its testing effort: An empirical evaluation","authors":"Divya Ranjan, A. Tripathi","doi":"10.1109/ICCIT.2010.5711046","DOIUrl":"https://doi.org/10.1109/ICCIT.2010.5711046","url":null,"abstract":"Software frameworks, common and reusable to the development of a family of applications, are pre-implemented architectures having predefined points of variability. During framework reuse, implementation of one (or more than one) of the different possible alternatives of the variability take place. Variability is the number of possible variant implementations of hook methods, which are actually abstract or empty methods, in the framework. The reusability (number of opportunities of reuse) of a framework increases with the increase in abstractness or variability of the framework. High reusability is desired and therefore a framework developer may go on increasing the variability of a framework by providing more loose points, i.e. hot spots, to it. In the present paper, an experimental analysis has been carried out to understand the effect of variability possessed by a framework on the effort required to test the framework and it has been found that although the reusability of a framework increases with increase in the variability/abstractness of a framework but it does have adverse effects upon the testability of the framework. Hence, as a framework developer one has to restrain increasing the abstractness of a framework (while developing it) in order to put constraints over testing effort. The reusable framework demands stricter and rigorous testing in comparison to one-time use software artefacts. It is always advisable to guaranty the production of high quality reusable artefacts without incurring heavy costs for rigorous testing.","PeriodicalId":131337,"journal":{"name":"5th International Conference on Computer Sciences and Convergence Information Technology","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124068707","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 : 2010-11-01DOI: 10.1109/ICCIT.2010.5711042
Mohammad Julashokri, M. Fathian, M. Gholamian
By the expanse of internet stores and products, recommender systems have emerged to increase store attractiveness and develop online customers. Recommender systems are systems which help customers to find product that they want. These systems recommend product to individual customer according to their preferences and interests. Recommender systems use several ways such as collaborative filtering and content-based filtering to create recommendation. In this study we proposed a recommender system based on collaborative filtering. In proposed model we endeavored to improve the customer profile in collaborative systems to enhance the recommender system efficiency. We do this improvement using time context and group preferences.
{"title":"Improving customer's profile in recommender systems using time context and group preferences","authors":"Mohammad Julashokri, M. Fathian, M. Gholamian","doi":"10.1109/ICCIT.2010.5711042","DOIUrl":"https://doi.org/10.1109/ICCIT.2010.5711042","url":null,"abstract":"By the expanse of internet stores and products, recommender systems have emerged to increase store attractiveness and develop online customers. Recommender systems are systems which help customers to find product that they want. These systems recommend product to individual customer according to their preferences and interests. Recommender systems use several ways such as collaborative filtering and content-based filtering to create recommendation. In this study we proposed a recommender system based on collaborative filtering. In proposed model we endeavored to improve the customer profile in collaborative systems to enhance the recommender system efficiency. We do this improvement using time context and group preferences.","PeriodicalId":131337,"journal":{"name":"5th International Conference on Computer Sciences and Convergence Information Technology","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122507736","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 : 2010-11-01DOI: 10.1109/ICCIT.2010.5711031
Xin Shi, Shijuan Su, Qingyu Xiong
As increasing research effort has been made, pervasive computing is on the step closer to realization. Recent technologies have allowed smaller-scale computational devices with characteristics such as low-cost production, low energy consumption and wireless communication to capture and manage information. The technologies of Wireless Sensor Networks (WSN) and Radio Frequency Identification (RFID) are gaining high attention for their promising applications in the field of pervasive computing. Integrating RFID and WSN has been researched extensively in recent years, and deployed in variety of applications. In this paper, WSN architecture, sensor node hardware and RFID system are discussed firstly. According to RFID and WSN architectures and taking into account the specific circumstances of pervasive computing, the integrations of RFID and WSN are classified into three main categories. Each category of integration is described in details through some prototypes.
{"title":"The integration of Wireless Sensor Networks and RFID for pervasive computing","authors":"Xin Shi, Shijuan Su, Qingyu Xiong","doi":"10.1109/ICCIT.2010.5711031","DOIUrl":"https://doi.org/10.1109/ICCIT.2010.5711031","url":null,"abstract":"As increasing research effort has been made, pervasive computing is on the step closer to realization. Recent technologies have allowed smaller-scale computational devices with characteristics such as low-cost production, low energy consumption and wireless communication to capture and manage information. The technologies of Wireless Sensor Networks (WSN) and Radio Frequency Identification (RFID) are gaining high attention for their promising applications in the field of pervasive computing. Integrating RFID and WSN has been researched extensively in recent years, and deployed in variety of applications. In this paper, WSN architecture, sensor node hardware and RFID system are discussed firstly. According to RFID and WSN architectures and taking into account the specific circumstances of pervasive computing, the integrations of RFID and WSN are classified into three main categories. Each category of integration is described in details through some prototypes.","PeriodicalId":131337,"journal":{"name":"5th International Conference on Computer Sciences and Convergence Information Technology","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122242824","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 : 2010-11-01DOI: 10.1109/ICCIT.2010.5711170
Chen-Hao Liu, P. Chang, Yen-Wen Wang
This research presents a two-stage AIS approach to solve the Grid scheduling problems. According to the literature survey, most researchers use the clone selection of B cells during the evolving processes and the function of B cells in AIS researches to solve various optimization problems. Instead, we try to implement the T helper cell and T suppressor cell in T cell combining B cell to solve the Grid Scheduling problems. The major differences of our method from other earlier approaches includes: 1. A two-stage approach is applied using B cell as a basis and then T cell is employed next. T helper cell is used to help improving the solution and then T suppressor cell is generated to increase the diversity of the population.2.A new formula is proposed to calculate the affinity of the Antibody. The total difference of completion time of each job is applied instead of the difference of makespan of the schedule. This new AIS method can supplement the flaw of GA using fitness as the basis and a new Lifespan which will keep good diversified chromosomes within the population to extend the searching spaces. The experimental tests show that this novel AIS method is very effective when compared with other Meta-heuristics such as GA and SA.
{"title":"Two-stage artificial immune system in Grid scheduling problems","authors":"Chen-Hao Liu, P. Chang, Yen-Wen Wang","doi":"10.1109/ICCIT.2010.5711170","DOIUrl":"https://doi.org/10.1109/ICCIT.2010.5711170","url":null,"abstract":"This research presents a two-stage AIS approach to solve the Grid scheduling problems. According to the literature survey, most researchers use the clone selection of B cells during the evolving processes and the function of B cells in AIS researches to solve various optimization problems. Instead, we try to implement the T helper cell and T suppressor cell in T cell combining B cell to solve the Grid Scheduling problems. The major differences of our method from other earlier approaches includes: 1. A two-stage approach is applied using B cell as a basis and then T cell is employed next. T helper cell is used to help improving the solution and then T suppressor cell is generated to increase the diversity of the population.2.A new formula is proposed to calculate the affinity of the Antibody. The total difference of completion time of each job is applied instead of the difference of makespan of the schedule. This new AIS method can supplement the flaw of GA using fitness as the basis and a new Lifespan which will keep good diversified chromosomes within the population to extend the searching spaces. The experimental tests show that this novel AIS method is very effective when compared with other Meta-heuristics such as GA and SA.","PeriodicalId":131337,"journal":{"name":"5th International Conference on Computer Sciences and Convergence Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130298452","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 : 2010-11-01DOI: 10.1109/ICCIT.2010.5711161
Haijun Bao, Hongdi Wang
To properly determine the concession period is one of the most important questions of BOT (Build-Operate-Transfer) projects. Project life and total investment are always pre-given in extant models such as ACM and RCM, which needs more discussion. Social benefit is one crucial factor for a host government to accelerate infrastructure construction by the BOT mechanism, which has been much more concerned by scholars. In this article, a determining model on total investment, project life, and concession period interval for BOT projects has been established. We unlock the premise that total investment and project life are pre-given, and aim to maximize the total benefit of the host government including economic and social benefit while ensuring that the private enterprises will receive a certain profit, finally determining the ideal project life and total investment, hence obtaining the concession period interval. The determining model enables a better progress of the negotiation between the host government and private enterprises.
{"title":"A determining model on total investment, project life, and concession period interval for BOT projects","authors":"Haijun Bao, Hongdi Wang","doi":"10.1109/ICCIT.2010.5711161","DOIUrl":"https://doi.org/10.1109/ICCIT.2010.5711161","url":null,"abstract":"To properly determine the concession period is one of the most important questions of BOT (Build-Operate-Transfer) projects. Project life and total investment are always pre-given in extant models such as ACM and RCM, which needs more discussion. Social benefit is one crucial factor for a host government to accelerate infrastructure construction by the BOT mechanism, which has been much more concerned by scholars. In this article, a determining model on total investment, project life, and concession period interval for BOT projects has been established. We unlock the premise that total investment and project life are pre-given, and aim to maximize the total benefit of the host government including economic and social benefit while ensuring that the private enterprises will receive a certain profit, finally determining the ideal project life and total investment, hence obtaining the concession period interval. The determining model enables a better progress of the negotiation between the host government and private enterprises.","PeriodicalId":131337,"journal":{"name":"5th International Conference on Computer Sciences and Convergence Information Technology","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130790964","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 : 2010-11-01DOI: 10.1109/ICCIT.2010.5711068
Taiyo Maeda, Y. Aoki, T. Murata
This paper reports a problem solving environments (PSE) to assist researchers who study stochastic simulations such as reinforcement learning algorithms. They have to run their programs many times to compare their algorithms and find better sets of parameters for their programs. In order to reduce the working time, this system has three sub-systems: a distributed computing system, a data management system and a graph generation system. Using this system, we conduct experiments with human subjects. They register their programs, run them on a distributed computing system, obtain results automatically, and compare them graphically. As a result, a user obtained five times speedup for the work time. We present a relationship between development of algorithms and the three sub-systems.
{"title":"A problem solving environment that assists model development for reinforcement learning algorithms","authors":"Taiyo Maeda, Y. Aoki, T. Murata","doi":"10.1109/ICCIT.2010.5711068","DOIUrl":"https://doi.org/10.1109/ICCIT.2010.5711068","url":null,"abstract":"This paper reports a problem solving environments (PSE) to assist researchers who study stochastic simulations such as reinforcement learning algorithms. They have to run their programs many times to compare their algorithms and find better sets of parameters for their programs. In order to reduce the working time, this system has three sub-systems: a distributed computing system, a data management system and a graph generation system. Using this system, we conduct experiments with human subjects. They register their programs, run them on a distributed computing system, obtain results automatically, and compare them graphically. As a result, a user obtained five times speedup for the work time. We present a relationship between development of algorithms and the three sub-systems.","PeriodicalId":131337,"journal":{"name":"5th International Conference on Computer Sciences and Convergence Information Technology","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130892665","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 : 2010-11-01DOI: 10.1109/ICCIT.2010.5711087
Jaumin Ajdari, F. Hoxha
Wavelet transform is an important mathematical tool with strong application in signal processing. From the mathematical point of view many different wavelet transforms are developed, where orthogonal wavelet transforms are more important. Also, various algorithms for their computations are developed. In this paper we present the parallel implementation of the orthogonal wavelet transform named Daubechies D4 transform, which consists of four taps filters. At the beginning, a short mathematical introduction of the Daubechies D4 transform is presented. After that the sequential and parallel algorithm implementations are analyzed. A parallel implementation for the PC cluster environment is done. We have analyzed two ways of parallel implementation, one with row mapping and the other with block mapping (mesh architecture of the processing elements). For practical implementation the C++ programming language and MPI paradigm (for parallel environment) are used. Finally, the mathematical complexity of these implementations is presented. In particular, we have analyzed separately the complexity of computations and communications. It is shown, also, that the complexity is between O(log2 n) and O(n2 / p). At the end, a comparison of sequential and parallel implementations is presented according to the results obtained by testing the practical implementations.
{"title":"Parallel implementation of 2D Daubechies - D4 transform in a cluster","authors":"Jaumin Ajdari, F. Hoxha","doi":"10.1109/ICCIT.2010.5711087","DOIUrl":"https://doi.org/10.1109/ICCIT.2010.5711087","url":null,"abstract":"Wavelet transform is an important mathematical tool with strong application in signal processing. From the mathematical point of view many different wavelet transforms are developed, where orthogonal wavelet transforms are more important. Also, various algorithms for their computations are developed. In this paper we present the parallel implementation of the orthogonal wavelet transform named Daubechies D4 transform, which consists of four taps filters. At the beginning, a short mathematical introduction of the Daubechies D4 transform is presented. After that the sequential and parallel algorithm implementations are analyzed. A parallel implementation for the PC cluster environment is done. We have analyzed two ways of parallel implementation, one with row mapping and the other with block mapping (mesh architecture of the processing elements). For practical implementation the C++ programming language and MPI paradigm (for parallel environment) are used. Finally, the mathematical complexity of these implementations is presented. In particular, we have analyzed separately the complexity of computations and communications. It is shown, also, that the complexity is between O(log2 n) and O(n2 / p). At the end, a comparison of sequential and parallel implementations is presented according to the results obtained by testing the practical implementations.","PeriodicalId":131337,"journal":{"name":"5th International Conference on Computer Sciences and Convergence Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131044893","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 : 2010-11-01DOI: 10.1109/ICCIT.2010.5711104
Ehsan Khojeh, M. Nor, Navid Aghakhani
Nowadays, the growth of small and medium sized enterprises (SMEs) is one of the important criteria for assessing the rate of success for each country and governments try to expand it among societies. At present, in the ongoing emphasis to be competitive and survive, organizations need to continuously improve the goods and services to meet customers' and stakeholders' needs. This study examines the importance of customer satisfaction for Malaysian SMEs in construction sector. Then it tries to understand the factors that are important for Malaysian customers in order to improve their satisfaction. Finally, it suggests a system to help companies' managers to understand the needs and points of view of their customers.
{"title":"Using ICT to improve customer satisfaction in small and medium sized construction companies: A study among malaysian construction SMEs","authors":"Ehsan Khojeh, M. Nor, Navid Aghakhani","doi":"10.1109/ICCIT.2010.5711104","DOIUrl":"https://doi.org/10.1109/ICCIT.2010.5711104","url":null,"abstract":"Nowadays, the growth of small and medium sized enterprises (SMEs) is one of the important criteria for assessing the rate of success for each country and governments try to expand it among societies. At present, in the ongoing emphasis to be competitive and survive, organizations need to continuously improve the goods and services to meet customers' and stakeholders' needs. This study examines the importance of customer satisfaction for Malaysian SMEs in construction sector. Then it tries to understand the factors that are important for Malaysian customers in order to improve their satisfaction. Finally, it suggests a system to help companies' managers to understand the needs and points of view of their customers.","PeriodicalId":131337,"journal":{"name":"5th International Conference on Computer Sciences and Convergence Information Technology","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134378962","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
扫码关注我们
求助内容：
应助结果提醒方式：