Pub Date : 2013-03-18DOI: 10.1109/PerComW.2013.6529473
Atsushi Hiyama, Yuki Nagai, M. Hirose, Masatomo Kobayashi, Hironobu Takagi
We propose the "Question First" interaction model, which aims to reduce the barriers to accessing online mobile information transmission for the elderly and aggregate their useful experience and knowledge for younger generations. "Question First" helps elderly users to transfer their knowledge or experiences by simply answering questions through conventional mobile terminals. The proposed interaction model is based on extending conventional interaction modes of phone calls and em ails, helping elderly users become fam iliar with social networking, without the requirement of learning to use social networking service interfaces. Ultimately, we aim to expand the social participation of the elderly in both online communication and online work such as crowdsourcing. We report the results of a two-week user study on the crowdsourcing of participants' experience and knowledge through online communication, and analyze the information obtained to evaluate the efficiency of this interaction model by extracting features of each participant's knowledge and experience via the proposed method.
{"title":"Question first: Passive interaction model for gathering experience and knowledge from the elderly","authors":"Atsushi Hiyama, Yuki Nagai, M. Hirose, Masatomo Kobayashi, Hironobu Takagi","doi":"10.1109/PerComW.2013.6529473","DOIUrl":"https://doi.org/10.1109/PerComW.2013.6529473","url":null,"abstract":"We propose the \"Question First\" interaction model, which aims to reduce the barriers to accessing online mobile information transmission for the elderly and aggregate their useful experience and knowledge for younger generations. \"Question First\" helps elderly users to transfer their knowledge or experiences by simply answering questions through conventional mobile terminals. The proposed interaction model is based on extending conventional interaction modes of phone calls and em ails, helping elderly users become fam iliar with social networking, without the requirement of learning to use social networking service interfaces. Ultimately, we aim to expand the social participation of the elderly in both online communication and online work such as crowdsourcing. We report the results of a two-week user study on the crowdsourcing of participants' experience and knowledge through online communication, and analyze the information obtained to evaluate the efficiency of this interaction model by extracting features of each participant's knowledge and experience via the proposed method.","PeriodicalId":101502,"journal":{"name":"2013 IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops)","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132469787","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 : 2013-03-18DOI: 10.1109/PerComW.2013.6529530
Kirak Hong
Ubiquitous deployment of cameras and recent advances in video analytics enable a new class of applications, situation awareness using camera networks. The application class includes surveillance, traffic monitoring, and assisted living that autonomously generate actionable knowledge from a large number of camera streams. Despite technological advances, developing a large-scale situation awareness application still remains a challenge due to the programming complexity, highly dynamic workloads, and latency-sensitive quality of service. To solve the problem, my research topic concerns developing a programming model and a runtime system to support large-scale situation awareness applications on camera networks. The programming model requires a minimal set of domain-specific handlers from the domain experts, allowing them to focus on the algorithmic aspect of situation awareness applications rather than the details of distributed programming. The runtime system provides automatic resource management using smart cameras and the cloud for handling dynamic workloads and ensuring latency-sensitive quality of services.
{"title":"Toward large-scale situation awareness applications on camera networks","authors":"Kirak Hong","doi":"10.1109/PerComW.2013.6529530","DOIUrl":"https://doi.org/10.1109/PerComW.2013.6529530","url":null,"abstract":"Ubiquitous deployment of cameras and recent advances in video analytics enable a new class of applications, situation awareness using camera networks. The application class includes surveillance, traffic monitoring, and assisted living that autonomously generate actionable knowledge from a large number of camera streams. Despite technological advances, developing a large-scale situation awareness application still remains a challenge due to the programming complexity, highly dynamic workloads, and latency-sensitive quality of service. To solve the problem, my research topic concerns developing a programming model and a runtime system to support large-scale situation awareness applications on camera networks. The programming model requires a minimal set of domain-specific handlers from the domain experts, allowing them to focus on the algorithmic aspect of situation awareness applications rather than the details of distributed programming. The runtime system provides automatic resource management using smart cameras and the cloud for handling dynamic workloads and ensuring latency-sensitive quality of services.","PeriodicalId":101502,"journal":{"name":"2013 IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128106681","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 : 2013-03-18DOI: 10.1109/PerComW.2013.6529520
Chance Eary, Mohan J. Kumar, G. Záruba
Opportunistic networks (ONs) exploit mobility of wireless devices to route messages and distribute content independent of fixed network infrastructure. An inherent property of ONs is that the unpredictable mobility of devices results in brief and intermittent connections between networked nodes. This presents a challenge to implementing useful distributed system paradigms, such as distributed transactions. Transactions are a sequence of read and write operations that must be executed in a reliable and coherent fashion, even in the presence of multiple concurrent operations or process failures. Distributed transactions require the participation of multiple processes utilizing data available locally to collaborate with other processes. In this work in progress paper, we outline the requirements behind a novel cache-based mechanism for distributed transactions in ONs. The requirements are defined with the expectation that the proposed mechanism will be robust and energy efficient.
{"title":"DiTON: Towards facilitating distributed transactions in opportunistic networks","authors":"Chance Eary, Mohan J. Kumar, G. Záruba","doi":"10.1109/PerComW.2013.6529520","DOIUrl":"https://doi.org/10.1109/PerComW.2013.6529520","url":null,"abstract":"Opportunistic networks (ONs) exploit mobility of wireless devices to route messages and distribute content independent of fixed network infrastructure. An inherent property of ONs is that the unpredictable mobility of devices results in brief and intermittent connections between networked nodes. This presents a challenge to implementing useful distributed system paradigms, such as distributed transactions. Transactions are a sequence of read and write operations that must be executed in a reliable and coherent fashion, even in the presence of multiple concurrent operations or process failures. Distributed transactions require the participation of multiple processes utilizing data available locally to collaborate with other processes. In this work in progress paper, we outline the requirements behind a novel cache-based mechanism for distributed transactions in ONs. The requirements are defined with the expectation that the proposed mechanism will be robust and energy efficient.","PeriodicalId":101502,"journal":{"name":"2013 IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops)","volume":"123 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133388997","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 : 2013-03-18DOI: 10.1109/PerComW.2013.6529538
W. Su
This paper discusses the use of asynchronous low-cost sensors in distributed locations for sensing and classifying weak wireless signals. This weak signal may not be identified by using a single sensor alone, but can be detected and classified by fusing multiple weak signals collected by sensor networks. The asynchronous signal copies have unwanted offsets in time, frequency, and phase due to the diversities in local oscillators and unknown communication channels. This work proposes a post-synchronization method to estimate and compensate for offsets in the fusion process without adjusting the sensor parameters. The properly combined signal from the distributed sensors achieves a higher processing gain for reliable signal exploitation.
{"title":"Signal sensing and modulation classification using pervasive sensor networks","authors":"W. Su","doi":"10.1109/PerComW.2013.6529538","DOIUrl":"https://doi.org/10.1109/PerComW.2013.6529538","url":null,"abstract":"This paper discusses the use of asynchronous low-cost sensors in distributed locations for sensing and classifying weak wireless signals. This weak signal may not be identified by using a single sensor alone, but can be detected and classified by fusing multiple weak signals collected by sensor networks. The asynchronous signal copies have unwanted offsets in time, frequency, and phase due to the diversities in local oscillators and unknown communication channels. This work proposes a post-synchronization method to estimate and compensate for offsets in the fusion process without adjusting the sensor parameters. The properly combined signal from the distributed sensors achieves a higher processing gain for reliable signal exploitation.","PeriodicalId":101502,"journal":{"name":"2013 IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123986252","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 : 2013-03-18DOI: 10.1109/PerComW.2013.6529468
Maria Garcia Puyol, P. Robertson, M. Angermann
Pedestrian navigation in indoor environments without a pre-installed infrastructure still presents many challenges. There are different approaches that address the problem using prior knowledge about the environment when the building plans or similar are available. Since this is not always the case, a family of technologies based on the principle of Simultaneous Localization and Mapping (SLAM) has been proposed. In this paper we will present some estimates on how a mapping process based on FootSLAM - a form of SLAM for pedestrians - might scale for a large-scale collaborative effort eventually encompassing most of our public indoor space, where the mapping entities are humans. Our assumptions on pedestrian motion and area visiting rate together with calculations based on the computational requirements of pedestrian SLAM algorithms allow us to make estimates with regard to the feasibility, scalability and computational cost of wide-scale mapping of indoor areas by pedestrians.
{"title":"Managing large-scale mapping and localization for pedestrians using inertial sensors","authors":"Maria Garcia Puyol, P. Robertson, M. Angermann","doi":"10.1109/PerComW.2013.6529468","DOIUrl":"https://doi.org/10.1109/PerComW.2013.6529468","url":null,"abstract":"Pedestrian navigation in indoor environments without a pre-installed infrastructure still presents many challenges. There are different approaches that address the problem using prior knowledge about the environment when the building plans or similar are available. Since this is not always the case, a family of technologies based on the principle of Simultaneous Localization and Mapping (SLAM) has been proposed. In this paper we will present some estimates on how a mapping process based on FootSLAM - a form of SLAM for pedestrians - might scale for a large-scale collaborative effort eventually encompassing most of our public indoor space, where the mapping entities are humans. Our assumptions on pedestrian motion and area visiting rate together with calculations based on the computational requirements of pedestrian SLAM algorithms allow us to make estimates with regard to the feasibility, scalability and computational cost of wide-scale mapping of indoor areas by pedestrians.","PeriodicalId":101502,"journal":{"name":"2013 IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128662466","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 : 2013-03-18DOI: 10.1109/PerComW.2013.6529554
G. Loukas, D. Gan, Tuan Vuong
Emergency management is increasingly dependent on networks for information gathering, coordination and physical system control, and consequently is increasingly vulnerable to network failures. A cyber attack could cause such network failures intentionally, so as to impede the work of first responders and maximise the impact of a physical emergency. We propose a taxonomy of existing and potential research that is relevant in this setting, covering attack types that have already occurred or are likely to occur, and defence mechanisms that are already in use or would be applicable.
{"title":"A taxonomy of cyber attack and defence mechanisms for emergency management networks","authors":"G. Loukas, D. Gan, Tuan Vuong","doi":"10.1109/PerComW.2013.6529554","DOIUrl":"https://doi.org/10.1109/PerComW.2013.6529554","url":null,"abstract":"Emergency management is increasingly dependent on networks for information gathering, coordination and physical system control, and consequently is increasingly vulnerable to network failures. A cyber attack could cause such network failures intentionally, so as to impede the work of first responders and maximise the impact of a physical emergency. We propose a taxonomy of existing and potential research that is relevant in this setting, covering attack types that have already occurred or are likely to occur, and defence mechanisms that are already in use or would be applicable.","PeriodicalId":101502,"journal":{"name":"2013 IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops)","volume":"407 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116034593","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 : 2013-03-18DOI: 10.1109/PerComW.2013.6529517
Bastian Könings, F. Schaub, M. Weber
The combination and integration of sensing and interaction capabilities with almost ubiquitous inter-connectivity are basic requirements for context-aware systems to unobtrusively and invisibly support users in their daily activities. However, the invisible nature of such systems also threatens users' privacy. Users often lack awareness about a system's capabilities to gather data or to intervene in user activities, or even the system's presence. We propose a model to enhance user-centric privacy awareness by consistently modeling observations and disturbances of users. The model allows to capture who is affecting a user's privacy, how privacy is affected, and why it is affected. We further discuss how this model can be instantiated with discovery of channel policies.
{"title":"Who, how, and why? Enhancing privacy awareness in Ubiquitous Computing","authors":"Bastian Könings, F. Schaub, M. Weber","doi":"10.1109/PerComW.2013.6529517","DOIUrl":"https://doi.org/10.1109/PerComW.2013.6529517","url":null,"abstract":"The combination and integration of sensing and interaction capabilities with almost ubiquitous inter-connectivity are basic requirements for context-aware systems to unobtrusively and invisibly support users in their daily activities. However, the invisible nature of such systems also threatens users' privacy. Users often lack awareness about a system's capabilities to gather data or to intervene in user activities, or even the system's presence. We propose a model to enhance user-centric privacy awareness by consistently modeling observations and disturbances of users. The model allows to capture who is affecting a user's privacy, how privacy is affected, and why it is affected. We further discuss how this model can be instantiated with discovery of channel policies.","PeriodicalId":101502,"journal":{"name":"2013 IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops)","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117222415","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 : 2013-03-18DOI: 10.1109/PerComW.2013.6529460
Chuan-Chi Lai, Chuan-Ming Liu, Ying-Chi Su
As the mobile computing environment emerges, people can use different mobile devices to access information ubiquitously. This has shifted the researchers' sights to Mobile P2P (MP2P) systems, where the membership among peers is more dynamic and ad hoc. In the ubiquitous environments, the mobile devices generally are heterogeneous. In this paper, we consider the MP2P systems where the mobile peers are heterogeneous and propose a mechanism, named Heterogeneity-aware Overlay Technique (HOT), to build up an unstructured overlay. The proposed mechanism considers the overall ability, including power, network, CPU, and memory to set up the overlay. An ability equation is thus defined and the resulting overlay can ensure a good quality of service while the topology mismatching problem is alleviated. Last, we present our simulation for the proposed mechanism and compare the results with other related approaches. The simulation result shows that our proposed mechanism can effectively achieve a better service quality and mitigate the topology mismatching problem.
{"title":"A novel mechanism to construct a compatible overlay on heterogeneous mobile peers","authors":"Chuan-Chi Lai, Chuan-Ming Liu, Ying-Chi Su","doi":"10.1109/PerComW.2013.6529460","DOIUrl":"https://doi.org/10.1109/PerComW.2013.6529460","url":null,"abstract":"As the mobile computing environment emerges, people can use different mobile devices to access information ubiquitously. This has shifted the researchers' sights to Mobile P2P (MP2P) systems, where the membership among peers is more dynamic and ad hoc. In the ubiquitous environments, the mobile devices generally are heterogeneous. In this paper, we consider the MP2P systems where the mobile peers are heterogeneous and propose a mechanism, named Heterogeneity-aware Overlay Technique (HOT), to build up an unstructured overlay. The proposed mechanism considers the overall ability, including power, network, CPU, and memory to set up the overlay. An ability equation is thus defined and the resulting overlay can ensure a good quality of service while the topology mismatching problem is alleviated. Last, we present our simulation for the proposed mechanism and compare the results with other related approaches. The simulation result shows that our proposed mechanism can effectively achieve a better service quality and mitigate the topology mismatching problem.","PeriodicalId":101502,"journal":{"name":"2013 IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops)","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125387883","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 : 2013-03-18DOI: 10.1109/PerComW.2013.6529515
A. Najjar, P. Reignier
Building a smart home is a multi-disciplinary and challenging problem. Our goal is to build an agent that can propose context aware services to the users. High variability of users' needs and the uniqueness of every home are difficult to handle using “Classical AI”. We propose an alternative approach inspired by Developmental Artificial Intelligence and Constructivism Theory. Being constructivist means that the agent builds its knowledge in situ through user's interactions. This continuous interaction process enables the user to customize or bring up the system to meet his personal needs. We have made a first experiment by learning schemas from a simulated two-weeks home scenario. This preliminary experiment gives us indications that Constructivism is a promising approach for ambient intelligence.
{"title":"Constructivist ambient intelligent agent for smart environments","authors":"A. Najjar, P. Reignier","doi":"10.1109/PerComW.2013.6529515","DOIUrl":"https://doi.org/10.1109/PerComW.2013.6529515","url":null,"abstract":"Building a smart home is a multi-disciplinary and challenging problem. Our goal is to build an agent that can propose context aware services to the users. High variability of users' needs and the uniqueness of every home are difficult to handle using “Classical AI”. We propose an alternative approach inspired by Developmental Artificial Intelligence and Constructivism Theory. Being constructivist means that the agent builds its knowledge in situ through user's interactions. This continuous interaction process enables the user to customize or bring up the system to meet his personal needs. We have made a first experiment by learning schemas from a simulated two-weeks home scenario. This preliminary experiment gives us indications that Constructivism is a promising approach for ambient intelligence.","PeriodicalId":101502,"journal":{"name":"2013 IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125402267","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 : 2013-03-18DOI: 10.1109/PerComW.2013.6529485
Michela Papandrea, Matteo Zignani, S. Gaito, S. Giordano, G. P. Rossi
People mobility enormously augmented in the last decades. However, despite the increased possibilities of fast reaching far places, the places that a person commonly visits remain limited in number. The number of visited places of each person is regulated by some laws that are statistically similar among individuals. In our previous work, we firstly argued that a person visit most frequently always few places, and we confirmed that by some initial experiments. Here, in addition to further validating this result, we build a more sophisticate view of the places visited by the people. Namely, on top of our previous work, which identifies the class of Mostly Visited Points of Interest, we define two next classes: the Occasionally and the Exceptionally Visited Points of Interest classes. We argue and validate on real data, that also the occasional places are very limited in number, while the exceptional ones can grow at will, and by the analysis of the classes of visited points we can distinguish the type of users mobility. This paper firstly demonstrates this property in large experimental scenario, and put the basis for new understanding of people places in several areas as localization, social interactions and human mobility modelling.
{"title":"How many places do you visit a day?","authors":"Michela Papandrea, Matteo Zignani, S. Gaito, S. Giordano, G. P. Rossi","doi":"10.1109/PerComW.2013.6529485","DOIUrl":"https://doi.org/10.1109/PerComW.2013.6529485","url":null,"abstract":"People mobility enormously augmented in the last decades. However, despite the increased possibilities of fast reaching far places, the places that a person commonly visits remain limited in number. The number of visited places of each person is regulated by some laws that are statistically similar among individuals. In our previous work, we firstly argued that a person visit most frequently always few places, and we confirmed that by some initial experiments. Here, in addition to further validating this result, we build a more sophisticate view of the places visited by the people. Namely, on top of our previous work, which identifies the class of Mostly Visited Points of Interest, we define two next classes: the Occasionally and the Exceptionally Visited Points of Interest classes. We argue and validate on real data, that also the occasional places are very limited in number, while the exceptional ones can grow at will, and by the analysis of the classes of visited points we can distinguish the type of users mobility. This paper firstly demonstrates this property in large experimental scenario, and put the basis for new understanding of people places in several areas as localization, social interactions and human mobility modelling.","PeriodicalId":101502,"journal":{"name":"2013 IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127079238","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
扫码关注我们
求助内容：
应助结果提醒方式：