Ruinian Li, Tianyi Song, Nicholas Capurso, Jiguo Yu, Xiuzhen Cheng
We propose to design a smart shopping system based on RFID. The smart carts used in such a system can navigate the customers to the desired products, and they can calculate the billing information as the customer shops. Items that are put in a smart shopping cart can be automatically recognized and billed. In this way, customers can avoid long queuing time at the check-out points. The grocery management also becomes much easier: The sensors on the grocery shelf can keep updating the number of items to the central server so that the server is always aware of the items' status in the store. Furthermore, the inventory management also becomes much easier, because all the items can be automatically read by a RFID reader instead of manually scanned by a laborer. In this paper, we propose a smart shopping cart system with consideration of how this system can work functionally and securely.
{"title":"IoT Applications on Secure Smart Shopping","authors":"Ruinian Li, Tianyi Song, Nicholas Capurso, Jiguo Yu, Xiuzhen Cheng","doi":"10.1109/IIKI.2016.25","DOIUrl":"https://doi.org/10.1109/IIKI.2016.25","url":null,"abstract":"We propose to design a smart shopping system based on RFID. The smart carts used in such a system can navigate the customers to the desired products, and they can calculate the billing information as the customer shops. Items that are put in a smart shopping cart can be automatically recognized and billed. In this way, customers can avoid long queuing time at the check-out points. The grocery management also becomes much easier: The sensors on the grocery shelf can keep updating the number of items to the central server so that the server is always aware of the items' status in the store. Furthermore, the inventory management also becomes much easier, because all the items can be automatically read by a RFID reader instead of manually scanned by a laborer. In this paper, we propose a smart shopping cart system with consideration of how this system can work functionally and securely.","PeriodicalId":371106,"journal":{"name":"2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130394183","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}
This paper proposes a resource allocation strategy for fog computing based on Priced Timed Petri nets (PTPN), by which the user can choose the satisfied resources autonomously from a group of pre-allocated resources according to the price cost and time cost of task. We construct the PTPN models of tasks in fog computing in accordance with the features of fog resources. The algorithm of predicting task completion time and price is presented. In particular, we give the fog resources dynamic allocation algorithm. Simulation results demonstrate that our proposed algorithms can achieve the higher efficiency.
{"title":"Priced Timed Petri Nets Based Resource Allocation Strategy for Fog Computing","authors":"Lina Ni, Jinquan Zhang, Jiguo Yu","doi":"10.1109/IIKI.2016.87","DOIUrl":"https://doi.org/10.1109/IIKI.2016.87","url":null,"abstract":"This paper proposes a resource allocation strategy for fog computing based on Priced Timed Petri nets (PTPN), by which the user can choose the satisfied resources autonomously from a group of pre-allocated resources according to the price cost and time cost of task. We construct the PTPN models of tasks in fog computing in accordance with the features of fog resources. The algorithm of predicting task completion time and price is presented. In particular, we give the fog resources dynamic allocation algorithm. Simulation results demonstrate that our proposed algorithms can achieve the higher efficiency.","PeriodicalId":371106,"journal":{"name":"2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132867723","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}
Although regarded as a promising approach for indoor localization, WiFi fingerprint-based localization can lead to potential location privacy violations. In this work, we study the location privacy issues of WiFi fingerprint-based localization and propose a lightweight location privacy-preserving scheme that does not rely on any cryptographic primitive as the existing work does. In our scheme, a to-be-localized user sends the measured signal strength values and other k-1 dummy signal strength values to the service provider who accordingly replies with k locations. The service provider cannot distinguish the user's location from the other k-1 dummy locations. Compared with the existing work, the computational and communication overhead of the proposed scheme are much lower.
{"title":"A Lightweight Location Privacy-Preserving Scheme for WiFi Fingerprint-Based Localization","authors":"Hong Li, Yunhua He, Xiuzhen Cheng, Limin Sun","doi":"10.1109/IIKI.2016.41","DOIUrl":"https://doi.org/10.1109/IIKI.2016.41","url":null,"abstract":"Although regarded as a promising approach for indoor localization, WiFi fingerprint-based localization can lead to potential location privacy violations. In this work, we study the location privacy issues of WiFi fingerprint-based localization and propose a lightweight location privacy-preserving scheme that does not rely on any cryptographic primitive as the existing work does. In our scheme, a to-be-localized user sends the measured signal strength values and other k-1 dummy signal strength values to the service provider who accordingly replies with k locations. The service provider cannot distinguish the user's location from the other k-1 dummy locations. Compared with the existing work, the computational and communication overhead of the proposed scheme are much lower.","PeriodicalId":371106,"journal":{"name":"2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)","volume":"766 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133348591","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}
Luokai Hu, Zhenyu Huang, Fang Deng, Ke Yan, Jin Liu
With the development of mobile computing, a more intelligent location aware access control approach which can not only protect the privacy of location information but also reduce the frequency of access control decision is needed. This paper brought semantic access control approach into the Location Aware Access Control (LAAC). First, we used semantic area to substitute physical location for the authorization decision, reducing the frequency of authorization decisions. The exact physical location of the subject would not be exposed. Secondly, for the different representation of semantic area of different security domains, we used ontology cluster to represent semantic spatial information. We established security domain ontology (SDO) and bridge ontology (BO) between the security domains. And then we used such ontology cluster as knowledge base and added annotation to the physical areas of XACML language. Finally, the model and framework of location aware semantics based access control for mobile computing is proposed. The proposed location aware semantic access control(LASAC) approach provides a better solution for location aware access control in mobile network environment.
{"title":"Towards a Location Aware Semantic Access Control Approach for Mobile Computing","authors":"Luokai Hu, Zhenyu Huang, Fang Deng, Ke Yan, Jin Liu","doi":"10.1109/IIKI.2016.117","DOIUrl":"https://doi.org/10.1109/IIKI.2016.117","url":null,"abstract":"With the development of mobile computing, a more intelligent location aware access control approach which can not only protect the privacy of location information but also reduce the frequency of access control decision is needed. This paper brought semantic access control approach into the Location Aware Access Control (LAAC). First, we used semantic area to substitute physical location for the authorization decision, reducing the frequency of authorization decisions. The exact physical location of the subject would not be exposed. Secondly, for the different representation of semantic area of different security domains, we used ontology cluster to represent semantic spatial information. We established security domain ontology (SDO) and bridge ontology (BO) between the security domains. And then we used such ontology cluster as knowledge base and added annotation to the physical areas of XACML language. Finally, the model and framework of location aware semantics based access control for mobile computing is proposed. The proposed location aware semantic access control(LASAC) approach provides a better solution for location aware access control in mobile network environment.","PeriodicalId":371106,"journal":{"name":"2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132186458","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}
Risk concentration is used as a measurement of diversification benefits in the context of risk concentration. The tail distortion risk measure, which was introduced in Zhu and Li (2012), has attracted increasing interest recently. In this paper, We investigate the second-order asymptotics of the risk concentration based on the tail distortion risk measure, when the dependence structure is driven by the generalized copulas.
{"title":"Risk Concentration Based on the Tail Distortion Risk Measure under Generalized FGM Copula","authors":"Wenhua Lv, Liheng Sang, Guangjun Shen","doi":"10.1109/IIKI.2016.98","DOIUrl":"https://doi.org/10.1109/IIKI.2016.98","url":null,"abstract":"Risk concentration is used as a measurement of diversification benefits in the context of risk concentration. The tail distortion risk measure, which was introduced in Zhu and Li (2012), has attracted increasing interest recently. In this paper, We investigate the second-order asymptotics of the risk concentration based on the tail distortion risk measure, when the dependence structure is driven by the generalized copulas.","PeriodicalId":371106,"journal":{"name":"2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132672187","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}
N. Filipovic, Z. Milosevic, I. Šaveljić, D. Nikolić, N. Zdravković, A. Kos
Benign Paroxysmal Positional Vertigo (BPPV) is most common vestibular disorder influencing the quality of life to considerable percentage of population after the age of forty. In this study the three-dimensional biomechanical model of the semi-circular canal (SCC) is described with full 3D fluid-structure interaction of particles, wall, cupula deformation and endolymph fluid flow. Oculus Rift device was used for experimental results of head motion and eye tracking and correlation with biomechanical model. A full Navier-Stokes equations and continuity equations are used for fluid domain with Arbitrary-Lagrangian Eulerian (ALE) formulation for mesh motion. Fluid-structure interaction for fluid coupling with cupula deformation is used. Particle tracking algorithm has been used for particle motion. Different size and number of particles with their full interaction between themselves, wall and cupula deformation are used. Velocity distribution, shear stress and force from endolymph side are presented for parametric one SCC and patient specific three SCC. All the models are used for correlation with the same experimental protocols with head moving and nystagmus eye tracking. A good correlation was found with numerical simulation of membrane deflection and nystagmus response detected with tracking technology. It can be used for virtual games with detection of vestibular disorders to the users.
{"title":"Biomechanical Model for Detection of Vertigo Disease","authors":"N. Filipovic, Z. Milosevic, I. Šaveljić, D. Nikolić, N. Zdravković, A. Kos","doi":"10.1109/IIKI.2016.59","DOIUrl":"https://doi.org/10.1109/IIKI.2016.59","url":null,"abstract":"Benign Paroxysmal Positional Vertigo (BPPV) is most common vestibular disorder influencing the quality of life to considerable percentage of population after the age of forty. In this study the three-dimensional biomechanical model of the semi-circular canal (SCC) is described with full 3D fluid-structure interaction of particles, wall, cupula deformation and endolymph fluid flow. Oculus Rift device was used for experimental results of head motion and eye tracking and correlation with biomechanical model. A full Navier-Stokes equations and continuity equations are used for fluid domain with Arbitrary-Lagrangian Eulerian (ALE) formulation for mesh motion. Fluid-structure interaction for fluid coupling with cupula deformation is used. Particle tracking algorithm has been used for particle motion. Different size and number of particles with their full interaction between themselves, wall and cupula deformation are used. Velocity distribution, shear stress and force from endolymph side are presented for parametric one SCC and patient specific three SCC. All the models are used for correlation with the same experimental protocols with head moving and nystagmus eye tracking. A good correlation was found with numerical simulation of membrane deflection and nystagmus response detected with tracking technology. It can be used for virtual games with detection of vestibular disorders to the users.","PeriodicalId":371106,"journal":{"name":"2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122358655","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}
Multiscale fuzzy entropy (MFE) is an effective algorithm which has been successfully applied in many fields for measuring the complexity of a time series. Though, MFE can yield inaccurate entropy estimations as the coarse-graining procedure used by the algorithm reduces the length of the time series under investigation. A modified multiscale fuzzy entropy (MMFE) algorithm is presented in this paper to overcome this problem. In this new approach, the coarse-graining procedure is replaced by a moving-average procedure which constructs template vectors in calculating the fuzzy entropy. The effectiveness of the proposed MMFE algorithm is evaluated on several mixed data (i.e., data mixed with white noise) of various data length. The result shows that the MMFE algorithm can effectively reduce the deviation in entropy estimation as compared to that using MFE algorithm. The MMFE algorithm is further employed in the study to estimate the complexity and irregularity of vibration data of a roller element bearing for fault diagnosis. It is shown that the MMFE algorithm can effectively discriminate the four bearing operation conditions under study.
{"title":"Analysis of Complex Time Series Using a Modified Multiscale Fuzzy Entropy Algorithm","authors":"Tian Han, Cheng Cheng Shi, Z. Wei, T. Lin","doi":"10.1109/IIKI.2016.12","DOIUrl":"https://doi.org/10.1109/IIKI.2016.12","url":null,"abstract":"Multiscale fuzzy entropy (MFE) is an effective algorithm which has been successfully applied in many fields for measuring the complexity of a time series. Though, MFE can yield inaccurate entropy estimations as the coarse-graining procedure used by the algorithm reduces the length of the time series under investigation. A modified multiscale fuzzy entropy (MMFE) algorithm is presented in this paper to overcome this problem. In this new approach, the coarse-graining procedure is replaced by a moving-average procedure which constructs template vectors in calculating the fuzzy entropy. The effectiveness of the proposed MMFE algorithm is evaluated on several mixed data (i.e., data mixed with white noise) of various data length. The result shows that the MMFE algorithm can effectively reduce the deviation in entropy estimation as compared to that using MFE algorithm. The MMFE algorithm is further employed in the study to estimate the complexity and irregularity of vibration data of a roller element bearing for fault diagnosis. It is shown that the MMFE algorithm can effectively discriminate the four bearing operation conditions under study.","PeriodicalId":371106,"journal":{"name":"2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128666653","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}
To move the application software and data into the cloud has become a trend. To prevent the data from being lost, modified and corrupted, the data integrity needs to be verified. The provable data possession (PDP) protocol is used to solve this problem. However, users often do some dynamic operations, such as insertion, modification and deletion, and it increases the difficulty and complexity of verification. How to construct the PDP scheme supporting dynamic updating of data becomes a hot research topic. The technology of hash aggregation is considered as one of the solutions to reduce costs of verification due to data dynamic operation. We analyze Wang et al.'s dynamic provable data possession (DPDP) solution and identify its security flaws during hash aggregation phase. This paper proposes an improved scheme to resolve security problem in Wang et al.'s scheme.
{"title":"Dynamic Provable Data Possession Based on Ranked Merkle Hash Tree","authors":"Jing Zou, Yunchuan Sun, Shixian Li","doi":"10.1109/IIKI.2016.69","DOIUrl":"https://doi.org/10.1109/IIKI.2016.69","url":null,"abstract":"To move the application software and data into the cloud has become a trend. To prevent the data from being lost, modified and corrupted, the data integrity needs to be verified. The provable data possession (PDP) protocol is used to solve this problem. However, users often do some dynamic operations, such as insertion, modification and deletion, and it increases the difficulty and complexity of verification. How to construct the PDP scheme supporting dynamic updating of data becomes a hot research topic. The technology of hash aggregation is considered as one of the solutions to reduce costs of verification due to data dynamic operation. We analyze Wang et al.'s dynamic provable data possession (DPDP) solution and identify its security flaws during hash aggregation phase. This paper proposes an improved scheme to resolve security problem in Wang et al.'s scheme.","PeriodicalId":371106,"journal":{"name":"2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128256956","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 Global Data on Events, Location, and Tone (GDELT) is a real time large scale database of global human society for open research which monitors the worlds broadcast, print, and web news since 1979, creating a free open platform for computing on the entire world. In this paper, first, we designed and implemented a data crawler, which collects metadata of GDELT database in real time and stores them in Hadoop Distributed File System (HDFS). Then, we proposed a hashbased method to correlate "Event" table, "Mentions" table and "GKG" table in GDELT, in order to digest every detailed information of each event. Finally, we took South Korea as example to make spatiotemporal visualization analysis, such as event spatiotemporal heat map, distribution of media attention and event extraction confidence dot map.
Global Data on Events, Location, and Tone (GDELT)是一个用于开放研究的全球人类社会的实时大型数据库，它监测了自1979年以来世界广播，印刷和网络新闻，为整个世界创造了一个免费开放的计算平台。本文首先设计并实现了一个数据爬虫，实时收集GDELT数据库的元数据并存储在Hadoop分布式文件系统(HDFS)中。然后，我们提出了一种基于哈希的方法来关联GDELT中的“Event”表、“mention”表和“GKG”表，以消化每个事件的每个详细信息。最后，以韩国为例，进行事件时空热图、媒体关注度分布、事件提取置信度点图等时空可视化分析。
{"title":"Correlation and Visualization Analysis of Large Scale Dataset GDELT","authors":"Fengcai Qiao, Kedi Chen","doi":"10.1109/IIKI.2016.19","DOIUrl":"https://doi.org/10.1109/IIKI.2016.19","url":null,"abstract":"The Global Data on Events, Location, and Tone (GDELT) is a real time large scale database of global human society for open research which monitors the worlds broadcast, print, and web news since 1979, creating a free open platform for computing on the entire world. In this paper, first, we designed and implemented a data crawler, which collects metadata of GDELT database in real time and stores them in Hadoop Distributed File System (HDFS). Then, we proposed a hashbased method to correlate \"Event\" table, \"Mentions\" table and \"GKG\" table in GDELT, in order to digest every detailed information of each event. Finally, we took South Korea as example to make spatiotemporal visualization analysis, such as event spatiotemporal heat map, distribution of media attention and event extraction confidence dot map.","PeriodicalId":371106,"journal":{"name":"2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)","volume":"123 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122677812","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}
Huihui Wang, Zhongqiu Ji, Guiping Jiang, Xibian Jiao, Weitong Liu
Objective: To study the influence of Latin dance and Tai Chi on knee joint proprioception and balance. Method: All experiments were performed in the Beijing Normal University School of Physical Education and Sport Biomechanics Laboratory. An isokinetic test system (Biodex system 4, BS4) and a balance testing system (Biodex Balance System, BBS)from the United States Biodex medical system were used to test related indexes. Results: In the LOS test, the overall score of Latin group is much better than sedentary group. In the ASL test, Latin group have a better balance ability in anterior and posterior direction and overall score than sedentary group(p
目的:探讨拉丁舞和太极对膝关节本体感觉和平衡的影响。方法:实验在北京师范大学体育与运动学院生物力学实验室进行。采用美国Biodex医疗系统的等速测试系统(Biodex system 4, BS4)和平衡测试系统(Biodex balance system, BBS)对相关指标进行测试。结果:在LOS测试中，拉丁组的总分明显优于久坐组。在美国手语测试中，拉丁组的前后方向平衡能力和总分均优于久坐组(p
{"title":"A Study on the Influence of Latin Dance and Tai Chi Exercise on Balance and Knee Joint Proprioception","authors":"Huihui Wang, Zhongqiu Ji, Guiping Jiang, Xibian Jiao, Weitong Liu","doi":"10.1109/IIKI.2016.50","DOIUrl":"https://doi.org/10.1109/IIKI.2016.50","url":null,"abstract":"Objective: To study the influence of Latin dance and Tai Chi on knee joint proprioception and balance. Method: All experiments were performed in the Beijing Normal University School of Physical Education and Sport Biomechanics Laboratory. An isokinetic test system (Biodex system 4, BS4) and a balance testing system (Biodex Balance System, BBS)from the United States Biodex medical system were used to test related indexes. Results: In the LOS test, the overall score of Latin group is much better than sedentary group. In the ASL test, Latin group have a better balance ability in anterior and posterior direction and overall score than sedentary group(p","PeriodicalId":371106,"journal":{"name":"2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114626740","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
扫码关注我们
求助内容：
应助结果提醒方式：