Hidetoshi Kambe, Hiroko Nagamatsu, Hiroyasu Mitsui, H. Koizumi, J. Sawamoto
The demand for embedded software is growing, and the number of development steps tends to increase with shorter period for development. It becomes inevitable to re-use existing software resources. However, if the configuration management of the existing software for reuse is not sufficient, it becomes hard to predict which modules in a system would be affected by the reused software modules. This may result in generating new bugs in the system. In this paper, we propose a method to accomplish the effective reuse of software modules by managing dependency information among modules. The method analyzes mutual relations among existing modules and visually presents not only inter-module dependency but also a list of reusable modules based on the developer's demand. We evaluated the method by applying it to some actual developments.
{"title":"A Method of Visualizing Inter-Module Relations to Support Reuse-Based Embedded Software Development","authors":"Hidetoshi Kambe, Hiroko Nagamatsu, Hiroyasu Mitsui, H. Koizumi, J. Sawamoto","doi":"10.1109/AINA.2008.150","DOIUrl":"https://doi.org/10.1109/AINA.2008.150","url":null,"abstract":"The demand for embedded software is growing, and the number of development steps tends to increase with shorter period for development. It becomes inevitable to re-use existing software resources. However, if the configuration management of the existing software for reuse is not sufficient, it becomes hard to predict which modules in a system would be affected by the reused software modules. This may result in generating new bugs in the system. In this paper, we propose a method to accomplish the effective reuse of software modules by managing dependency information among modules. The method analyzes mutual relations among existing modules and visually presents not only inter-module dependency but also a list of reusable modules based on the developer's demand. We evaluated the method by applying it to some actual developments.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"134 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114696462","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}
Wireless sensor networks (WSNs) consist of miniature devices with sensing, computation and wireless communication capabilities. They are typically designed for hostile environments, where recharging a node is impractical. Thus, energy efficiency is vital. For substantial energy savings, cross-layer information sharing and in-network processing among sensors have emerged as promising solutions. In this paper, we propose an energy-aware cross-layer data-gathering protocol for WSNs, termed RMC. By integrating the routing, MAC and clustering protocols, RMC is a scalable collision-free protocol. RMC is designed to address the overhead caused by managing the transmissions schedule. To this end, RMC works by defining a dependence relation between a node's transmission schedule and its location. Therefore, each node can determine its schedule and forwarding path entirely locally. Its performance is extensively evaluated through simulations and is shown to have significant improvement over well-known comparable cross- layer scheme.
{"title":"RMC: An Energy-Aware Cross-Layer Data-Gathering Protocol for Wireless Sensor Networks","authors":"Khaled Almiani, S. Selvadurai, Anastasios Viglas","doi":"10.1109/AINA.2008.90","DOIUrl":"https://doi.org/10.1109/AINA.2008.90","url":null,"abstract":"Wireless sensor networks (WSNs) consist of miniature devices with sensing, computation and wireless communication capabilities. They are typically designed for hostile environments, where recharging a node is impractical. Thus, energy efficiency is vital. For substantial energy savings, cross-layer information sharing and in-network processing among sensors have emerged as promising solutions. In this paper, we propose an energy-aware cross-layer data-gathering protocol for WSNs, termed RMC. By integrating the routing, MAC and clustering protocols, RMC is a scalable collision-free protocol. RMC is designed to address the overhead caused by managing the transmissions schedule. To this end, RMC works by defining a dependence relation between a node's transmission schedule and its location. Therefore, each node can determine its schedule and forwarding path entirely locally. Its performance is extensively evaluated through simulations and is shown to have significant improvement over well-known comparable cross- layer scheme.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114790373","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 station (STA) has the demand of the basic service set (BSS) transition in the emergence of centralized wireless LAN (WLAN)architecture. The centralized WLAN architecture is a centralized hierarchical network and is suitable for large scale deployment. In this paper, we propose a context transfer mechanism using cluster-chain to reduce the BSS transition delay in the centralized WLAN architecture. Comparing with the existing context transfer schemes in terms of BSS transition, the proposed mechanism can have (i) lower signaling cost for context transfer and (ii) higher hit rate in term of STA's context.
随着集中式无线局域网(WLAN)体系结构的出现，STA (station)有了向BSS (basic service set)过渡的需求。集中式WLAN架构是一种集中式分层网络，适合大规模部署。本文提出了一种基于簇链的上下文传输机制，以降低集中式WLAN架构中BSS的传输延迟。在BSS转换方面，与现有的上下文转移方案相比，所提出的机制具有(i)更低的上下文转移信令成本和(ii)更高的STA上下文命中率。
{"title":"A Context Transfer Mechanism for IEEE 802.11r in the Centralized Wireless LAN Architecture","authors":"Chung-Ming Huang, Jian-Wei Li","doi":"10.1109/AINA.2008.68","DOIUrl":"https://doi.org/10.1109/AINA.2008.68","url":null,"abstract":"A station (STA) has the demand of the basic service set (BSS) transition in the emergence of centralized wireless LAN (WLAN)architecture. The centralized WLAN architecture is a centralized hierarchical network and is suitable for large scale deployment. In this paper, we propose a context transfer mechanism using cluster-chain to reduce the BSS transition delay in the centralized WLAN architecture. Comparing with the existing context transfer schemes in terms of BSS transition, the proposed mechanism can have (i) lower signaling cost for context transfer and (ii) higher hit rate in term of STA's context.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124342597","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}
Wireless mesh networks (WMNs) have recently received tremendous research attention in industry and academia. The application domain of WMN is expanding from experimental settings in academic research to practical implementations in community networking, public safety, transportation services, healthcare systems and other similar applications. While these applications are evolving, there are still key challenges in terms of network performance, flexibility and resource management. In this paper we study wireless mesh networks with mobile Internet gateways. We employ a multi-path routing scheme with a routing metric based on load balancing to reduce packet loss and delay. Unlike most existing multipath routing protocols, our approach supports the maintenance of parallel multiple paths. Simulation experiments are carried out to assess network performance in the presence of mobile gateways. Simulation results show that the use of mobile gateways with concurrent multipath routing can result in good performance at lower speed and multiple mobile gateways.
{"title":"Using Mobile Internet Gateways in Wireless Mesh Networks","authors":"M. Denko","doi":"10.1109/AINA.2008.146","DOIUrl":"https://doi.org/10.1109/AINA.2008.146","url":null,"abstract":"Wireless mesh networks (WMNs) have recently received tremendous research attention in industry and academia. The application domain of WMN is expanding from experimental settings in academic research to practical implementations in community networking, public safety, transportation services, healthcare systems and other similar applications. While these applications are evolving, there are still key challenges in terms of network performance, flexibility and resource management. In this paper we study wireless mesh networks with mobile Internet gateways. We employ a multi-path routing scheme with a routing metric based on load balancing to reduce packet loss and delay. Unlike most existing multipath routing protocols, our approach supports the maintenance of parallel multiple paths. Simulation experiments are carried out to assess network performance in the presence of mobile gateways. Simulation results show that the use of mobile gateways with concurrent multipath routing can result in good performance at lower speed and multiple mobile gateways.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"669 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124128296","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}
Web services are being adopted, more and more, as a viable means of accessing Web-based applications. At present, there is a trend towards deploying business processes as composite Web services, known as Web services compositions. Web services compositions are synthesized by researchers from elementary Web services, offering the opportunity for service providers and application developers to create value-added services, through Web services composition. However, a problem exists in the current distribution process of Web services compositions: the general analysis and selection of services can be overly complex and un-systemic. Genetic algorithms (GA) has been widely used to solve optimization problems for large scale and complex systems. However, when insufficient knowledge is incorporated, GA is less efficient in terms of searching for an optimal solution. This paper develops a generic genetic algorithm incorporating knowledge extracted from the rough set theory. The advantages of the proposed solution approach include improving the performance of the GA by reducing the domain range of initial population, rule constraining crossover process and rule constrained mutation process, using the rough set theory for composite Web services. Also by proposing the hybrid approach, the GA and rough set theory can operate effectively thus to produce an optimal solution (the best combination of Web services).
{"title":"Apply Rough Set Theory into the Web Services Composition","authors":"Wen-Yau Liang","doi":"10.1109/AINA.2008.52","DOIUrl":"https://doi.org/10.1109/AINA.2008.52","url":null,"abstract":"Web services are being adopted, more and more, as a viable means of accessing Web-based applications. At present, there is a trend towards deploying business processes as composite Web services, known as Web services compositions. Web services compositions are synthesized by researchers from elementary Web services, offering the opportunity for service providers and application developers to create value-added services, through Web services composition. However, a problem exists in the current distribution process of Web services compositions: the general analysis and selection of services can be overly complex and un-systemic. Genetic algorithms (GA) has been widely used to solve optimization problems for large scale and complex systems. However, when insufficient knowledge is incorporated, GA is less efficient in terms of searching for an optimal solution. This paper develops a generic genetic algorithm incorporating knowledge extracted from the rough set theory. The advantages of the proposed solution approach include improving the performance of the GA by reducing the domain range of initial population, rule constraining crossover process and rule constrained mutation process, using the rough set theory for composite Web services. Also by proposing the hybrid approach, the GA and rough set theory can operate effectively thus to produce an optimal solution (the best combination of Web services).","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127628011","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}
Indoor positioning technology and its accuracy are crucial research topics for ubiquitous computing. While the GSM-based approach has always been used to provide outdoor positioning to compensate the lost of GPS in urban area, we seldom see systems that utilize the GSM-based approach for indoor positioning. On the other hand, the WLAN-based approach is widely used to provide indoor positioning service. However, with its Ad hoc layout and signal fluctuation, it is hard to provide a good performance based on the WLAN-based approach. In this paper, we develop an indoor positioning system that makes use of both GSM and WLAN signals to do location estimation such that the resultant system is more accurate and more stable and thus enhancing the performance of the whole system. Experimental results show that our system is stable and can reach centimeter-level accuracy, which outperforms other existing indoor positioning systems that utilizes a single network only.
{"title":"Enhancing Indoor Positioning Accuracy by Utilizing Signals from Both the Mobile Phone Network and the Wireless Local Area Network","authors":"Junyang Zhou, W. M. Yeung, J. Ng","doi":"10.1109/AINA.2008.106","DOIUrl":"https://doi.org/10.1109/AINA.2008.106","url":null,"abstract":"Indoor positioning technology and its accuracy are crucial research topics for ubiquitous computing. While the GSM-based approach has always been used to provide outdoor positioning to compensate the lost of GPS in urban area, we seldom see systems that utilize the GSM-based approach for indoor positioning. On the other hand, the WLAN-based approach is widely used to provide indoor positioning service. However, with its Ad hoc layout and signal fluctuation, it is hard to provide a good performance based on the WLAN-based approach. In this paper, we develop an indoor positioning system that makes use of both GSM and WLAN signals to do location estimation such that the resultant system is more accurate and more stable and thus enhancing the performance of the whole system. Experimental results show that our system is stable and can reach centimeter-level accuracy, which outperforms other existing indoor positioning systems that utilizes a single network only.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114403044","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}
Next generation cellular mobile networks will support heterogeneous packet switching traffic. For packet switching networks, packet level quality of service (QoS) should also be guaranteed apart from the call level QoS. In this paper, we investigate the effects of user mobility on the queueing performances of self-similar network traffic under new call bounding call admission control (CAC) scheme. We assume a general distribution of the cell residence time (CRT) to model the users' mobility instead of the usually used exponential distribution. An easy-to-implement analytical method is employed to analyze the buffer overflow probability. Numerical results show that the expectation of CRT has great impact on the buffer overflow probability when the traffic load is high or the threshold of CAC scheme is low. And we also find that smaller variance of CRT has more significant impact on packet level performances.
{"title":"Analysis of User Mobility Effects on Packet Level Performances in Next Generation Mobile Communication Networks","authors":"Furong Wang, Yasha Liu, L. Tu, P. Zhang","doi":"10.1109/AINA.2008.121","DOIUrl":"https://doi.org/10.1109/AINA.2008.121","url":null,"abstract":"Next generation cellular mobile networks will support heterogeneous packet switching traffic. For packet switching networks, packet level quality of service (QoS) should also be guaranteed apart from the call level QoS. In this paper, we investigate the effects of user mobility on the queueing performances of self-similar network traffic under new call bounding call admission control (CAC) scheme. We assume a general distribution of the cell residence time (CRT) to model the users' mobility instead of the usually used exponential distribution. An easy-to-implement analytical method is employed to analyze the buffer overflow probability. Numerical results show that the expectation of CRT has great impact on the buffer overflow probability when the traffic load is high or the threshold of CAC scheme is low. And we also find that smaller variance of CRT has more significant impact on packet level performances.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122118865","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}
Peer-to-peer (P2P) technology provides an efficient way for resource distribution, and sharing. While most current P2P systems only support queries over a single attribute which limits the popularity of the P2P technology. Full-blown P2P applications require the efficient resource searching supporting multi-dimensional attributes. In this paper, we propose flabellate overlay network (FAN), a scalable P2P overlay supporting multi-dimensional attributes. In FAN, the peers are mapped into a d-dimensional Cartesian space. The resource management and searching are based on the peer's second moment to the origin of coordinates. The theoretical analyses and experimental results demonstrate that FAN has high routing efficiency and low network maintenance cost over the existing structured P2P systems by storing logarithmic routing messages in peers and achieving logarithmic-hop resource searching. And many improved routing algorithms supporting multi-attribute queries can be implemented over FAN and achieve better performance.
{"title":"FAN: A Scalable Flabellate P2P Overlay Supporting Multi-Dimensional Attributes","authors":"Wei Song, Ruixuan Li, Zhengding Lu, Guangcan Yu","doi":"10.1109/AINA.2008.66","DOIUrl":"https://doi.org/10.1109/AINA.2008.66","url":null,"abstract":"Peer-to-peer (P2P) technology provides an efficient way for resource distribution, and sharing. While most current P2P systems only support queries over a single attribute which limits the popularity of the P2P technology. Full-blown P2P applications require the efficient resource searching supporting multi-dimensional attributes. In this paper, we propose flabellate overlay network (FAN), a scalable P2P overlay supporting multi-dimensional attributes. In FAN, the peers are mapped into a d-dimensional Cartesian space. The resource management and searching are based on the peer's second moment to the origin of coordinates. The theoretical analyses and experimental results demonstrate that FAN has high routing efficiency and low network maintenance cost over the existing structured P2P systems by storing logarithmic routing messages in peers and achieving logarithmic-hop resource searching. And many improved routing algorithms supporting multi-attribute queries can be implemented over FAN and achieve better performance.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128530498","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}
Wenxing Peng, Taro Terao, Yoshihiro Masuda, Naofumi Yoshida, Jun Miyazaki
We present a design and implementation of tracing document history and its application to detecting abnormal document access patterns. We have been working on document history system, which enables us to trace complete access history of operations for both electronic and paper documents. Document history system organizes access pattern trees based on dependency of user operations on documents. We also present a new probabilistic model, multi-layered tree Markov model (MTMM), in order to analyze access pattern trees of documents. The main feature of MTMM is to conduct tree pattern summarization and multilevel structural abstraction for trees. Our contribution is multi-level structural abstraction by incorporating hierarchical inner-state structure of Markov model. Abnormal patterns, such as sending documents to unexpected users, can be detected by applying MTMM to access pattern trees of document history system. We clarify the feasibility and effectiveness of our MTMM by several experiments for synthetic trees and real document access pattern trees.
{"title":"Document History System and its Application to Abnormal Document Access Pattern Detection with a Probabilistic Model","authors":"Wenxing Peng, Taro Terao, Yoshihiro Masuda, Naofumi Yoshida, Jun Miyazaki","doi":"10.1109/AINA.2008.112","DOIUrl":"https://doi.org/10.1109/AINA.2008.112","url":null,"abstract":"We present a design and implementation of tracing document history and its application to detecting abnormal document access patterns. We have been working on document history system, which enables us to trace complete access history of operations for both electronic and paper documents. Document history system organizes access pattern trees based on dependency of user operations on documents. We also present a new probabilistic model, multi-layered tree Markov model (MTMM), in order to analyze access pattern trees of documents. The main feature of MTMM is to conduct tree pattern summarization and multilevel structural abstraction for trees. Our contribution is multi-level structural abstraction by incorporating hierarchical inner-state structure of Markov model. Abnormal patterns, such as sending documents to unexpected users, can be detected by applying MTMM to access pattern trees of document history system. We clarify the feasibility and effectiveness of our MTMM by several experiments for synthetic trees and real document access pattern trees.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129960931","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}
With wireless technologies extending to every part of our daily lives, mobile networking applications are becoming increasingly popular for accessing the Internet. In this paper, we propose a peer-to-peer approach, called M-FTP, for mobile FTP services. Unlike traditional approaches, the proposed scheme implements a Collaborative Forwarding algorithm that takes advantage of opportunistic wireless connections, thereby improving network capacity by exploiting the diversity of network mobility. Using simulations as well as real- world network scenarios, we demonstrate that the proposed scheme provides a better mobile FTP service than traditional schemes, and thus facilitates more effective data transfer on the go.
{"title":"A Peer-to-Peer Approach for Mobile File Transfer in Opportunistic People Networks","authors":"Ling-Jyh Chen, Ting-Kai Huang","doi":"10.1109/AINA.2008.58","DOIUrl":"https://doi.org/10.1109/AINA.2008.58","url":null,"abstract":"With wireless technologies extending to every part of our daily lives, mobile networking applications are becoming increasingly popular for accessing the Internet. In this paper, we propose a peer-to-peer approach, called M-FTP, for mobile FTP services. Unlike traditional approaches, the proposed scheme implements a Collaborative Forwarding algorithm that takes advantage of opportunistic wireless connections, thereby improving network capacity by exploiting the diversity of network mobility. Using simulations as well as real- world network scenarios, we demonstrate that the proposed scheme provides a better mobile FTP service than traditional schemes, and thus facilitates more effective data transfer on the go.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129124227","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
扫码关注我们
求助内容：
应助结果提醒方式：