Exploiting mobile technologies for educational purposes has promises of realizing ubiquitous, unobtrusive, personal and situated learning, but is non-trivial due to the challenges in the process of designing, communicating and presenting traditional e-learning resources to mobile learners. In this paper, we propose a generic semantics-based service-oriented infrastructure and show how semantic technologies, when used together with an SOA, can provide mobile users with a fresh learning experience. The proposed architecture comprises a knowledge aggregation subsystem and a querying subsystem that are loosely coupled, and hence enables rapid deployment across domains with suitable domain ontologies. Furthermore, the service-oriented approach enables a pluggable platform that supports seamless integration of legacy content from possibly multiple vendors for customizable delivery. For illustration, we consider a mobile learning scenario in a zoo, and demonstrate how a mobile user can interact with the proposed system for mlearning.
{"title":"Context-Aware Mobile Learning with a Semantic Service-Oriented Infrastructure","authors":"Yilun Chia, F. S. Tsai, W. T. Ang, K. Rajaraman","doi":"10.1109/WAINA.2011.145","DOIUrl":"https://doi.org/10.1109/WAINA.2011.145","url":null,"abstract":"Exploiting mobile technologies for educational purposes has promises of realizing ubiquitous, unobtrusive, personal and situated learning, but is non-trivial due to the challenges in the process of designing, communicating and presenting traditional e-learning resources to mobile learners. In this paper, we propose a generic semantics-based service-oriented infrastructure and show how semantic technologies, when used together with an SOA, can provide mobile users with a fresh learning experience. The proposed architecture comprises a knowledge aggregation subsystem and a querying subsystem that are loosely coupled, and hence enables rapid deployment across domains with suitable domain ontologies. Furthermore, the service-oriented approach enables a pluggable platform that supports seamless integration of legacy content from possibly multiple vendors for customizable delivery. For illustration, we consider a mobile learning scenario in a zoo, and demonstrate how a mobile user can interact with the proposed system for mlearning.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133972646","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}
In general, JPEG2000 code streams have marker codes in the header, which define particular meanings such as start of packet and end of code stream. Marker codes do not exist in the data part of code streams. The selective encryption of the data part has been considered to avoid generating marker codes. Such encryption is effective in business content exchange. To handle this issue, some schemes have been proposed. However, the security of these schemes has not been evaluated yet. This paper shows that an existing scheme can be broken by cryptanalysis. We describe a secure encryption scheme and mode against cipher-text attacks, known plain-text attacks and chosen plain-text attacks.
{"title":"Selective Encryption Scheme and Mode to Avoid Generating Marker Codes in JPEG2000 Code Streams with Block Cipher","authors":"Hiroki Ikeda, Keiichi Iwamura","doi":"10.1109/WAINA.2011.109","DOIUrl":"https://doi.org/10.1109/WAINA.2011.109","url":null,"abstract":"In general, JPEG2000 code streams have marker codes in the header, which define particular meanings such as start of packet and end of code stream. Marker codes do not exist in the data part of code streams. The selective encryption of the data part has been considered to avoid generating marker codes. Such encryption is effective in business content exchange. To handle this issue, some schemes have been proposed. However, the security of these schemes has not been evaluated yet. This paper shows that an existing scheme can be broken by cryptanalysis. We describe a secure encryption scheme and mode against cipher-text attacks, known plain-text attacks and chosen plain-text attacks.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"53 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130253928","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 convergence of mobile networks and P2P systems has led to the deployment of a range of schemes for file storage over a network. This paper presents an approach to resilient file management and network storage through the design and implementation of a file dispersal system for a mobile P2P network, based on distributed hash tables (DHT). Inherent issues of security, reliability and efficiency are addressed by integrating two forms of data redundancy, pure replication and erasure coding. The functionality of the system and its configuration were enhanced at different levels by a variety of security-related techniques. Experimental results on the different stages of the file dispersal process were provided as validation of the proposed system.
{"title":"Resilient and Secure File Dispersal in a Mobile P2P System","authors":"K. Ashraf, R. Anane, Nick Blundell","doi":"10.1109/WAINA.2011.149","DOIUrl":"https://doi.org/10.1109/WAINA.2011.149","url":null,"abstract":"The convergence of mobile networks and P2P systems has led to the deployment of a range of schemes for file storage over a network. This paper presents an approach to resilient file management and network storage through the design and implementation of a file dispersal system for a mobile P2P network, based on distributed hash tables (DHT). Inherent issues of security, reliability and efficiency are addressed by integrating two forms of data redundancy, pure replication and erasure coding. The functionality of the system and its configuration were enhanced at different levels by a variety of security-related techniques. Experimental results on the different stages of the file dispersal process were provided as validation of the proposed system.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114874165","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}
Hakim Adhari, T. Dreibholz, M. Becke, E. Rathgeb, M. Tüxen
The steadily growing deployment of resilience-critical Internet services is leading to an increasing number of Multi-Homed network sites. Asymmetric Digital Subscriber Lines (ADSL) are an inexpensive way to add a secondary Internet access connection. With the development of Multi-Path Transport Layer protocols - like Multipath TCP (MPTCP) and the Stream Control Transmission Protocol (SCTP) furnished by a Concurrent Multipath Transfer (CMT-SCTP) extension - there is also a strong interest in utilising all access connections simultaneously to improve the data throughput of the applications. However, combining network paths over ADSL with paths over other access technologies like fibre optic links implies highly dissimilar paths with significantly different bandwidths, delays and queuing behaviours. Efficient Multi-Path transport over such dissimilar paths is a challenging task for the new Transport Layer protocols under development. In this paper, we show the difficulties of Multi-Path transport in a real-world dissimilar path setup which consists of a high-speed fibre optic link and an ADSL connection. After that, we present an optimised buffer handling technique which solves the transport efficiency issues in this setup. Our optimisation is first analysed by simulations. Finally, we also show the usefulness of our approach by experimental evaluation in a real Multi-Homed Internet setup.
{"title":"Evaluation of Concurrent Multipath Transfer over Dissimilar Paths","authors":"Hakim Adhari, T. Dreibholz, M. Becke, E. Rathgeb, M. Tüxen","doi":"10.1109/WAINA.2011.92","DOIUrl":"https://doi.org/10.1109/WAINA.2011.92","url":null,"abstract":"The steadily growing deployment of resilience-critical Internet services is leading to an increasing number of Multi-Homed network sites. Asymmetric Digital Subscriber Lines (ADSL) are an inexpensive way to add a secondary Internet access connection. With the development of Multi-Path Transport Layer protocols - like Multipath TCP (MPTCP) and the Stream Control Transmission Protocol (SCTP) furnished by a Concurrent Multipath Transfer (CMT-SCTP) extension - there is also a strong interest in utilising all access connections simultaneously to improve the data throughput of the applications. However, combining network paths over ADSL with paths over other access technologies like fibre optic links implies highly dissimilar paths with significantly different bandwidths, delays and queuing behaviours. Efficient Multi-Path transport over such dissimilar paths is a challenging task for the new Transport Layer protocols under development. In this paper, we show the difficulties of Multi-Path transport in a real-world dissimilar path setup which consists of a high-speed fibre optic link and an ADSL connection. After that, we present an optimised buffer handling technique which solves the transport efficiency issues in this setup. Our optimisation is first analysed by simulations. Finally, we also show the usefulness of our approach by experimental evaluation in a real Multi-Homed Internet setup.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114661956","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}
An accurate estimation of the available bandwidth of mesh nodes is the essential prerequisite of admission control mechanism, which provides QoS assurance in wireless mesh networks. Existing bandwidth estimation schemes do not accurately consider the influence of parallel transmission due to spatial reuse and act overly conservative. In this study, we proposed an accurate bandwidth estimation scheme, the BEPTC (Bandwidth Estimation with Parallel Transmission Consideration), to reduce the parallel transmission caused estimation accuracy by solving the maximum clique problem in graph theory. The scheme is integrated into an admission control mechanism used in a hop-by-hop routing protocol (AODV). The simulation results demonstrate that the admission control mechanism based on BEPTC can effectively control the traffic load and offer QoS guarantee for admitted new flows, which can lead the network to accommodate more flows with QoS guarantee and obtain higher system throughput compared with other conservative approaches.
准确估计mesh节点的可用带宽是无线mesh网络准入控制机制的必要前提，它为无线mesh网络提供了QoS保证。现有的带宽估计方案没有准确考虑空间复用对并行传输的影响，过于保守。在本研究中，我们提出了一种精确的带宽估计方案BEPTC (bandwidth estimation with Parallel Transmission Consideration)，通过解决图论中的最大团问题来降低并行传输引起的估计精度。该方案集成到AODV(逐跳路由协议)中使用的准入控制机制中。仿真结果表明，基于BEPTC的允许控制机制能够有效地控制流量负载，并为允许的新流提供QoS保证，使网络能够容纳更多具有QoS保证的流，获得比其他保守方法更高的系统吞吐量。
{"title":"A Novel Bandwidth Estimation Scheme Used in Admission Control for Wireless Mesh Networks","authors":"Chen Su, Kaiping Xue, P. Hong, Hanchen Lu","doi":"10.1109/WAINA.2011.57","DOIUrl":"https://doi.org/10.1109/WAINA.2011.57","url":null,"abstract":"An accurate estimation of the available bandwidth of mesh nodes is the essential prerequisite of admission control mechanism, which provides QoS assurance in wireless mesh networks. Existing bandwidth estimation schemes do not accurately consider the influence of parallel transmission due to spatial reuse and act overly conservative. In this study, we proposed an accurate bandwidth estimation scheme, the BEPTC (Bandwidth Estimation with Parallel Transmission Consideration), to reduce the parallel transmission caused estimation accuracy by solving the maximum clique problem in graph theory. The scheme is integrated into an admission control mechanism used in a hop-by-hop routing protocol (AODV). The simulation results demonstrate that the admission control mechanism based on BEPTC can effectively control the traffic load and offer QoS guarantee for admitted new flows, which can lead the network to accommodate more flows with QoS guarantee and obtain higher system throughput compared with other conservative approaches.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114762128","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}
Providing confidentiality, integrity, and availability is indispensable for secure systems. In particular, almost every commerce application requires that integrity be provided in a secure manner, such that the integrity of data is retained even if the owner of the data is malicious. However, providing secure integrity in mobile environments, where participating nodes and their communication channels are unstable, is not a simple task. This is mainly because of the difficulty of solving the agreement problem securely in these environments due to the unreliability of channels, and the passivity of smartcards that complicates the implementation of distributed protocols among them. In this paper, we propose an optimistic approach to address these problems. This approach introduces an optimistic non-blocking atomic commitment (NBAC) protocol for smartcards to secure reliable agreements, and implements the protocol on a distributed framework for inter-smartcard communication to relax the implementation complexity. Our implementation results show the feasibility of this approach: current smartcards can conduct the protocol in no more than about a half second, which should be enough performance to support commerce transactions, the application most likely to need secure integrity.
{"title":"Providing Secure Integrity in Peer-to-Peer Oriented Mobile Environments","authors":"Masayuki Terada, Takayasu Yamaguchi, S. Hongo","doi":"10.1109/WAINA.2011.17","DOIUrl":"https://doi.org/10.1109/WAINA.2011.17","url":null,"abstract":"Providing confidentiality, integrity, and availability is indispensable for secure systems. In particular, almost every commerce application requires that integrity be provided in a secure manner, such that the integrity of data is retained even if the owner of the data is malicious. However, providing secure integrity in mobile environments, where participating nodes and their communication channels are unstable, is not a simple task. This is mainly because of the difficulty of solving the agreement problem securely in these environments due to the unreliability of channels, and the passivity of smartcards that complicates the implementation of distributed protocols among them. In this paper, we propose an optimistic approach to address these problems. This approach introduces an optimistic non-blocking atomic commitment (NBAC) protocol for smartcards to secure reliable agreements, and implements the protocol on a distributed framework for inter-smartcard communication to relax the implementation complexity. Our implementation results show the feasibility of this approach: current smartcards can conduct the protocol in no more than about a half second, which should be enough performance to support commerce transactions, the application most likely to need secure integrity.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115034507","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 contemporary business environment can be seen as a logical effect of eBusiness, advanced integrated networks, and software services. In such an environment application deployment models have revolutionized the way businesses interact, collaborate and transact with customers, suppliers, partners, employees and shareholders. The purpose of our work is to develop a generic model for performance analysis of software services in order to facilitate enterprises to attach their customers more tightly by an effective service delivery which in turn optimizes business processes at different steps. This communications enablement allows not only greater synergy and velocity among vendors, suppliers and partners within the value creation and delivery chain of the business, but also, creates responsive and seamless customer service.
{"title":"A Generic Approach to the Services Delivery in Enterprise eBusiness Platforms","authors":"N. Kryvinska, C. Strauss, M. Younas, D. Thanh","doi":"10.1109/WAINA.2011.29","DOIUrl":"https://doi.org/10.1109/WAINA.2011.29","url":null,"abstract":"The contemporary business environment can be seen as a logical effect of eBusiness, advanced integrated networks, and software services. In such an environment application deployment models have revolutionized the way businesses interact, collaborate and transact with customers, suppliers, partners, employees and shareholders. The purpose of our work is to develop a generic model for performance analysis of software services in order to facilitate enterprises to attach their customers more tightly by an effective service delivery which in turn optimizes business processes at different steps. This communications enablement allows not only greater synergy and velocity among vendors, suppliers and partners within the value creation and delivery chain of the business, but also, creates responsive and seamless customer service.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131919286","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}
Commonly, two main classes of formal testing techniques are applied to check the conformance of protocols and software: active and passive testing (monitoring) techniques. Because of many industrial constraints such as the necessity to achieve implementation black box testing, passive testing techniques become highly relevant in several cases. Besides, most of the passive testing techniques only consider control portions of exchanged packets and ignores data parts. However, since systems become more complex, testing for data constraints and relations between packets is now essential. In this paper we propose a novel approach for defining data oriented invariants and show how they can be tested in a trace set by using logic programming. Experimental results on SIP protocol traces are provided.
{"title":"Protocol Data Parts Inclusion in a Formal Passive Testing Approach","authors":"F. Lalanne, S. Maag","doi":"10.1109/WAINA.2011.21","DOIUrl":"https://doi.org/10.1109/WAINA.2011.21","url":null,"abstract":"Commonly, two main classes of formal testing techniques are applied to check the conformance of protocols and software: active and passive testing (monitoring) techniques. Because of many industrial constraints such as the necessity to achieve implementation black box testing, passive testing techniques become highly relevant in several cases. Besides, most of the passive testing techniques only consider control portions of exchanged packets and ignores data parts. However, since systems become more complex, testing for data constraints and relations between packets is now essential. In this paper we propose a novel approach for defining data oriented invariants and show how they can be tested in a trace set by using logic programming. Experimental results on SIP protocol traces are provided.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133116856","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}
Delay Tolerant Networks formed by mobile devices users carry in their everyday life are starting to be an interesting alternative for message transmissions between users. However, the reliability of the DTNs is an important research topic, one of the main causes of poor DTN reliability being the selfishness of the network nodes. In this paper, we evaluate the impact of selfishness on the efficiency of several types of DTN routing protocols and determine what are the conditions that have to be met in order to provide some level of QoS in a DTN architecture. We also investigate which is the most suitable routing protocol, given a realistic scenario in which nodes move in a non-random way and manifest a typical human movement model (home-work-home/evening activity). We also suggest two ways for the improvement of the performance of such a protocol: the use of monetary incentives and the use of social incentives.
{"title":"Quality of Service in Large Scale Mobile Distributed Systems Based on Opportunistic Networks","authors":"Mihai Tanase, V. Cristea","doi":"10.1109/WAINA.2011.122","DOIUrl":"https://doi.org/10.1109/WAINA.2011.122","url":null,"abstract":"Delay Tolerant Networks formed by mobile devices users carry in their everyday life are starting to be an interesting alternative for message transmissions between users. However, the reliability of the DTNs is an important research topic, one of the main causes of poor DTN reliability being the selfishness of the network nodes. In this paper, we evaluate the impact of selfishness on the efficiency of several types of DTN routing protocols and determine what are the conditions that have to be met in order to provide some level of QoS in a DTN architecture. We also investigate which is the most suitable routing protocol, given a realistic scenario in which nodes move in a non-random way and manifest a typical human movement model (home-work-home/evening activity). We also suggest two ways for the improvement of the performance of such a protocol: the use of monetary incentives and the use of social incentives.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"179 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133258085","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}
State-of-the-art supercomputers consist of a huge number of computing nodes that are connected by an interconnection network. Although such large-scale systems have regular organizations, scaling study on the network is not sufficient so far. This paper focuses on two-dimensional torus network with two typical routing algorithms, i.e., dimension-order and Duato's protocol, and presents steady and unsteady performance results. We introduce quantitative evaluation methodology and discuss scaling issues quantitatively. Evaluation results by our parallelized simulator reveal that any size of networks have similar performance features when the performance metrics are properly normalized. This paper gives a scaling view of the interconnection network for future huge-scale systems.
{"title":"Steady/Unsteady Communication Performance in Large-Scale Regular Networks","authors":"T. Yokota, K. Ootsu, T. Baba","doi":"10.1109/WAINA.2011.37","DOIUrl":"https://doi.org/10.1109/WAINA.2011.37","url":null,"abstract":"State-of-the-art supercomputers consist of a huge number of computing nodes that are connected by an interconnection network. Although such large-scale systems have regular organizations, scaling study on the network is not sufficient so far. This paper focuses on two-dimensional torus network with two typical routing algorithms, i.e., dimension-order and Duato's protocol, and presents steady and unsteady performance results. We introduce quantitative evaluation methodology and discuss scaling issues quantitatively. Evaluation results by our parallelized simulator reveal that any size of networks have similar performance features when the performance metrics are properly normalized. This paper gives a scaling view of the interconnection network for future huge-scale systems.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132445713","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
扫码关注我们
求助内容：
应助结果提醒方式：