It is necessary for the cloud server to allow multi-keyword query and provide result ranking to effectively retrieve data from the large number of encrypted data stored in the cloud storage. A related work that support privacy preserving ranked multi-keyword search over encrypted cloud data (MRSE) is not in public-key model. In this paper, the definition of an extension of PEKS called Public-Key Encryption with Ranked Multi-Keyword Search(PERMKS) is proposed, which means that the receiver could query any subset of keywords and the number of queried keywords appearing in the data can be provided which evaluate the similarity ranking of the data to the search query. Then, a construction of public-key encryption with ranked multikeyword search scheme with sub-linear cipher texts based on anonymous hierarchical identity-based encryption (AHIBE) is put forward and its security is analyzed.
为了从存储在云存储中的大量加密数据中有效检索数据，云服务器必须支持多关键字查询并提供结果排序。一项支持在加密云数据(MRSE)上保持隐私的排序多关键字搜索的相关工作没有采用公钥模型。本文提出了PEKS的一种扩展，即PERMKS (Public-Key Encryption with ranking Multi-Keyword Search)，即接收方可以查询任意关键字子集，并提供数据中出现的被查询关键字的个数，以评估数据与搜索查询的相似度排序。然后，提出了一种基于匿名分层身份加密(AHIBE)的亚线性密文分级多关键字搜索方案的公钥加密构造，并对其安全性进行了分析。
{"title":"Public Key Encryption with Ranked Multi-keyword Search","authors":"Chengyu Hu, Pengtao Liu","doi":"10.1109/INCoS.2013.24","DOIUrl":"https://doi.org/10.1109/INCoS.2013.24","url":null,"abstract":"It is necessary for the cloud server to allow multi-keyword query and provide result ranking to effectively retrieve data from the large number of encrypted data stored in the cloud storage. A related work that support privacy preserving ranked multi-keyword search over encrypted cloud data (MRSE) is not in public-key model. In this paper, the definition of an extension of PEKS called Public-Key Encryption with Ranked Multi-Keyword Search(PERMKS) is proposed, which means that the receiver could query any subset of keywords and the number of queried keywords appearing in the data can be provided which evaluate the similarity ranking of the data to the search query. Then, a construction of public-key encryption with ranked multikeyword search scheme with sub-linear cipher texts based on anonymous hierarchical identity-based encryption (AHIBE) is put forward and its security is analyzed.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131753032","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}
Space robot has important economic and applied value, and the autonomous operation of the space robot is an important development direction in the application of the space robot. We proposed the multi-level architecture of autonomous operation for the space robot. Design the modeling language and frame in operation planning to make the autonomous control easier to implement. The various elements such as relationships, constraints and actions in the autonomous operation are described and modeled. The method of planning and scheduling is put up based on the case reasoning and planning scheduling of the object. So that to reduce the burden of the operator and reinforce the space robot operation task.
{"title":"Research of Space Robot Autonomous Operation Architecture","authors":"Hang Yin, Yongming Gao, Guoqiang Zeng, Chao Wang","doi":"10.1109/INCoS.2013.45","DOIUrl":"https://doi.org/10.1109/INCoS.2013.45","url":null,"abstract":"Space robot has important economic and applied value, and the autonomous operation of the space robot is an important development direction in the application of the space robot. We proposed the multi-level architecture of autonomous operation for the space robot. Design the modeling language and frame in operation planning to make the autonomous control easier to implement. The various elements such as relationships, constraints and actions in the autonomous operation are described and modeled. The method of planning and scheduling is put up based on the case reasoning and planning scheduling of the object. So that to reduce the burden of the operator and reinforce the space robot operation task.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130704818","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}
The realization of an ultrahigh speed AES processor based on FPGA is proposed in this paper, which can generate secure information at a constant rate of dozens of Gbps. Having compared with some other researches in terms of structure of the processor, speed and latency, we develop ultrahigh speed architectures for a reformulated version of AES algorithm, which shows a greater superiority than other ones currently. The merit comes that: Firstly, the processor is able to process 128 bits data during each clock period, only bringing 10 clock periods latency and saving 4K storage space. Secondly, we used a same and symmetric pipelining structure but different connection order and stored different initial keys in inner register when designing decryption module. Thus, the processor seems to be an asymmetrical system. Thirdly, the method that data involved in multiplication in Galois field was stored in ROM is used as the key to guarantee the safety of data and prohibit tampering.
{"title":"An Ultrahigh Speed AES Processor Method Based on FPGA","authors":"Xin Cai, Rong Sun, Jingwei Liu","doi":"10.1109/INCoS.2013.123","DOIUrl":"https://doi.org/10.1109/INCoS.2013.123","url":null,"abstract":"The realization of an ultrahigh speed AES processor based on FPGA is proposed in this paper, which can generate secure information at a constant rate of dozens of Gbps. Having compared with some other researches in terms of structure of the processor, speed and latency, we develop ultrahigh speed architectures for a reformulated version of AES algorithm, which shows a greater superiority than other ones currently. The merit comes that: Firstly, the processor is able to process 128 bits data during each clock period, only bringing 10 clock periods latency and saving 4K storage space. Secondly, we used a same and symmetric pipelining structure but different connection order and stored different initial keys in inner register when designing decryption module. Thus, the processor seems to be an asymmetrical system. Thirdly, the method that data involved in multiplication in Galois field was stored in ROM is used as the key to guarantee the safety of data and prohibit tampering.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130693343","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}
Yuanyuan Cheng, Jin Zhang, Xiaowei Liu, Qingcheng Li, Zhenlu Chen
Nowadays, the issues such as the thin algorithm, attack sensitivity, narrow applications restrict the development of text watermark technology. This paper purposes to coordinate multi-watermarking algorithms to work collaboratively by polymorphism watermarking algorithm: on the one hand, this paper hopes to seek the positive direction of watermarking development by way of expanding the embedding space, on the other hand, this paper hopes to use polymorphism watermarking to enhance the robustness of the system. At first, we extract the relevant classification characteristics on the basis of summarizing the existing algorithms. Then we discuss the defining polymorphism watermarking algorithm, and focus on the cooperative relations of the watermark information. By algorithm design, implementation and verification, the polymorphism watermarking algorithm proves to be effective to solve the issues including both limitation of the watermark embedding space and the attack sensitivity of a single algorithm.
{"title":"Research on Polymorphism in Digital Text Watermarking","authors":"Yuanyuan Cheng, Jin Zhang, Xiaowei Liu, Qingcheng Li, Zhenlu Chen","doi":"10.1109/INCoS.2013.33","DOIUrl":"https://doi.org/10.1109/INCoS.2013.33","url":null,"abstract":"Nowadays, the issues such as the thin algorithm, attack sensitivity, narrow applications restrict the development of text watermark technology. This paper purposes to coordinate multi-watermarking algorithms to work collaboratively by polymorphism watermarking algorithm: on the one hand, this paper hopes to seek the positive direction of watermarking development by way of expanding the embedding space, on the other hand, this paper hopes to use polymorphism watermarking to enhance the robustness of the system. At first, we extract the relevant classification characteristics on the basis of summarizing the existing algorithms. Then we discuss the defining polymorphism watermarking algorithm, and focus on the cooperative relations of the watermark information. By algorithm design, implementation and verification, the polymorphism watermarking algorithm proves to be effective to solve the issues including both limitation of the watermark embedding space and the attack sensitivity of a single algorithm.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127897580","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}
Collaborative filtering is one of most important technologies in the field of recommender systems, the process of making predictions about user preferences for products or services by learning known user-item relationships. In this paper, slope one and item-based nearest neighbor collaborative filtering algorithms are analyzed on the Movie Lens dataset. In order to obtain better accuracy and rationality, a new combined approach is proposed that takes advantages of slope one and item-based nearest neighbor model. In addition, simple gradient descent and bias effects are used further to improve performance. Finally, some experiments are implemented on the dataset, and the experimental results show that the proposed final solution achieves great improvement of prediction accuracy when compared to the method of using slope one or item-based nearest neighbor model alone.
{"title":"A Combined Predictor for Item-Based Collaborative Filtering","authors":"Zhonghuo Wu, Jun Zheng, Su Wang, Hongfeng Feng","doi":"10.1109/INCoS.2013.46","DOIUrl":"https://doi.org/10.1109/INCoS.2013.46","url":null,"abstract":"Collaborative filtering is one of most important technologies in the field of recommender systems, the process of making predictions about user preferences for products or services by learning known user-item relationships. In this paper, slope one and item-based nearest neighbor collaborative filtering algorithms are analyzed on the Movie Lens dataset. In order to obtain better accuracy and rationality, a new combined approach is proposed that takes advantages of slope one and item-based nearest neighbor model. In addition, simple gradient descent and bias effects are used further to improve performance. Finally, some experiments are implemented on the dataset, and the experimental results show that the proposed final solution achieves great improvement of prediction accuracy when compared to the method of using slope one or item-based nearest neighbor model alone.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117246298","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}
For the existing problems of staircase effect, edge blur and uncertainty of parameter selection in the process of image denoising and recovery of variational partial differential equations, a novel total variation restoration model based on image structure tensor(STTV) is proposed. We introduce image structure tensor to construct the image structure control function instead of using Lagrange multiplier and local structure information to control Diffusion process, which has the performance of adjusting the balance of regular item and fidelity item in TV model according to different local structure information and keeping better detail features. Theoretical analysis and experiment comparing with other methods illustrate that STTV model is able to describe the image edges, textures and smooth areas more accurately and subtly, which has overcome staircase and over-smoothing effects brought by other TV models and removed the noise while preserving significant image details and important characteristics. the value of peak signal to noise ratio(PSNR) is also improved.
{"title":"Texture Image Denoising Algorithm Based on Structure Tensor and Total Variation","authors":"Caixia Li, Chanjuan Liu, Yilei Wang","doi":"10.1109/INCoS.2013.132","DOIUrl":"https://doi.org/10.1109/INCoS.2013.132","url":null,"abstract":"For the existing problems of staircase effect, edge blur and uncertainty of parameter selection in the process of image denoising and recovery of variational partial differential equations, a novel total variation restoration model based on image structure tensor(STTV) is proposed. We introduce image structure tensor to construct the image structure control function instead of using Lagrange multiplier and local structure information to control Diffusion process, which has the performance of adjusting the balance of regular item and fidelity item in TV model according to different local structure information and keeping better detail features. Theoretical analysis and experiment comparing with other methods illustrate that STTV model is able to describe the image edges, textures and smooth areas more accurately and subtly, which has overcome staircase and over-smoothing effects brought by other TV models and removed the noise while preserving significant image details and important characteristics. the value of peak signal to noise ratio(PSNR) is also improved.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"23 12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116183663","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}
A (t + 1, n) proactive secret sharing is to protect a secret in long-lived system by distributing it to a group of n participants and refreshing their shares periodically in this fixed group, while any t + 1 and more than t + 1 shares can reconstruct the secret. In this paper, we propose a proactive secret sharing scheme without a trusted party, who generates and distributes shares among the participants. Our scheme is uniformly efficient and tolerates t Byzantine faults in any single time interval, where the number of participants n>=3t + 1. We also prove that the proposed scheme is secure under the discrete logarithm intractability assumption.
{"title":"Proactive Secret Sharing without a Trusted Party","authors":"Xiuqun Wang, Changlu Lin, Yong Li","doi":"10.1109/INCoS.2013.96","DOIUrl":"https://doi.org/10.1109/INCoS.2013.96","url":null,"abstract":"A (t + 1, n) proactive secret sharing is to protect a secret in long-lived system by distributing it to a group of n participants and refreshing their shares periodically in this fixed group, while any t + 1 and more than t + 1 shares can reconstruct the secret. In this paper, we propose a proactive secret sharing scheme without a trusted party, who generates and distributes shares among the participants. Our scheme is uniformly efficient and tolerates t Byzantine faults in any single time interval, where the number of participants n>=3t + 1. We also prove that the proposed scheme is secure under the discrete logarithm intractability assumption.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129633058","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}
Intermittent Connected Mobile Sensor Networks (ICMSN) have emerged in recent studies, e.g. underwater sensor networks, wildlife tracking and human-oriented flu virus monitoring. In these networks, conventional routing protocols in WSN are not suitable for data gathering application in ICMSN since packets will be dropped when no complete route to the sink is available. In this paper, we propose an efficient data gathering scheme for ICMSN, which is composed of forwarding protocol and buffer management. Message forwarding makes decision on which sensors are qualified for next hop based on nodal delivery probability, which signifies the likelihood that the sensor can deliver the message to the sink successfully based on the nodal mobility pattern and residual energy. Buffer management consists of two related components: queuing mechanism and purging mechanism. The former determines priority of messages to transmit based on the importance factor, which indicates importance of the messages and QoS requirement of transmission. The latter utilizes a death vector generated by the sink to purge useless messages that have been delivered from the network. Our experimental results show that the proposed data gathering scheme supports the different transmission requirement of messages and achieves the good performance tradeoff between delivery ratio, delay and resource consumption.
{"title":"Efficient Data Gathering in Intermittent Connected Mobile Sensor Networks","authors":"Yongping Xiong, Shizhong Wu, Zhang Tao, Yubo Deng, Shiwu Chen","doi":"10.1109/INCoS.2013.86","DOIUrl":"https://doi.org/10.1109/INCoS.2013.86","url":null,"abstract":"Intermittent Connected Mobile Sensor Networks (ICMSN) have emerged in recent studies, e.g. underwater sensor networks, wildlife tracking and human-oriented flu virus monitoring. In these networks, conventional routing protocols in WSN are not suitable for data gathering application in ICMSN since packets will be dropped when no complete route to the sink is available. In this paper, we propose an efficient data gathering scheme for ICMSN, which is composed of forwarding protocol and buffer management. Message forwarding makes decision on which sensors are qualified for next hop based on nodal delivery probability, which signifies the likelihood that the sensor can deliver the message to the sink successfully based on the nodal mobility pattern and residual energy. Buffer management consists of two related components: queuing mechanism and purging mechanism. The former determines priority of messages to transmit based on the importance factor, which indicates importance of the messages and QoS requirement of transmission. The latter utilizes a death vector generated by the sink to purge useless messages that have been delivered from the network. Our experimental results show that the proposed data gathering scheme supports the different transmission requirement of messages and achieves the good performance tradeoff between delivery ratio, delay and resource consumption.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130941207","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}
On the basis of reviewing the current RMB-banknote crest number identification research literature, a real-time template generation algorithm to identify crest number in high-speed RMB-banknote moving environment is proposed. Firstly enough complete RMB images should be collected in currency detector equipped with CIS, then the area of crest number should be dug out and processed with tilt correction, binarization, morphology processing, character segmentation and highly normalization. Secondly corresponding template set should be generated to each character bitmap and then according to the principle of maximum difference, five character bitmap should be jetted out from the templates set, forming final template simplified set. Finally, the data and analysis of the real-time identification effect applied with this template are provided.
{"title":"A Real-Time Template Generation Algorithm to Identify RMB Crest Number","authors":"Gaoyu Zhang, Yingying Wang","doi":"10.1109/INCoS.2013.137","DOIUrl":"https://doi.org/10.1109/INCoS.2013.137","url":null,"abstract":"On the basis of reviewing the current RMB-banknote crest number identification research literature, a real-time template generation algorithm to identify crest number in high-speed RMB-banknote moving environment is proposed. Firstly enough complete RMB images should be collected in currency detector equipped with CIS, then the area of crest number should be dug out and processed with tilt correction, binarization, morphology processing, character segmentation and highly normalization. Secondly corresponding template set should be generated to each character bitmap and then according to the principle of maximum difference, five character bitmap should be jetted out from the templates set, forming final template simplified set. Finally, the data and analysis of the real-time identification effect applied with this template are provided.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"143 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127974688","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}
Single Sign-on (SSO) allows a user to obtain a single credential from a Trusted Third Party (TTP) once and then authenticates himself/herself to different service providers by using the same credential. Though different SSO schemes have been obtained from various primitives, user anonymity has not yet been studied formally. Motivated by the fact that anonymity is a very essential security requirement in certain scenarios, in this paper we first formalize a security model of anonymous single-sign on (ASSO). Subsequently, we present a generic ASSO scheme which is transformed from group signatures. Formal proofs are provided to show that the proposed ASSO is secure under the assumption that the underlying group signature is secure according to Bell are et al.'s model introduced at CT-RSA 2005. Compared to existing SSO schemes, our transformation not only implements the user's anonymity, but also reduces the trust level in TTP.
单点登录(Single Sign-on, SSO)允许用户从可信第三方(Trusted Third Party, TTP)获得一次证书，然后使用同一证书向不同的服务提供商验证自己的身份。尽管从各种原语中获得了不同的单点登录方案，但用户匿名性尚未得到正式的研究。鉴于匿名在某些情况下是一种非常重要的安全需求，本文首先形式化了匿名单点登录(aso)的安全模型。随后，我们提出了一种由群签名转化而来的通用aso方案。根据Bell等人在CT-RSA 2005中介绍的模型，在假定底层群签名是安全的情况下，给出了正式的证明来证明所提出的ASSO是安全的。与现有的单点登录方案相比，我们的转换不仅实现了用户的匿名性，而且降低了http中的信任级别。
{"title":"Anonymous Single Sign-On Schemes Transformed from Group Signatures","authors":"Jingquan Wang, Guilin Wang, W. Susilo","doi":"10.1109/INCoS.2013.104","DOIUrl":"https://doi.org/10.1109/INCoS.2013.104","url":null,"abstract":"Single Sign-on (SSO) allows a user to obtain a single credential from a Trusted Third Party (TTP) once and then authenticates himself/herself to different service providers by using the same credential. Though different SSO schemes have been obtained from various primitives, user anonymity has not yet been studied formally. Motivated by the fact that anonymity is a very essential security requirement in certain scenarios, in this paper we first formalize a security model of anonymous single-sign on (ASSO). Subsequently, we present a generic ASSO scheme which is transformed from group signatures. Formal proofs are provided to show that the proposed ASSO is secure under the assumption that the underlying group signature is secure according to Bell are et al.'s model introduced at CT-RSA 2005. Compared to existing SSO schemes, our transformation not only implements the user's anonymity, but also reduces the trust level in TTP.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"117 10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126399906","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
扫码关注我们
求助内容：
应助结果提醒方式：