Pub Date : 2007-09-24DOI: 10.1109/ICCCN.2007.4317972
Yao-Min Huang, Jin-Jang Leou, M. Cheng
For very low bit rate video coding, coarse-quantized DCT coefficients induce discontinuities at block boundaries, namely, blocking artifacts. Furthermore, motion-compensated prediction propagates blocking artifacts to inner-block regions of subsequent video frames. Blocking artifacts caused by motion-compensated prediction (MCP) can be solved by a loop-filter. The main drawback of loop-filter is its in-flexibility. In this study, a post deblocking filter for H.264 video is proposed. In this study, to estimate inner-block discontinuities, a motion-compensated based approach is proposed. A map of detected blocking artifacts within each video frame is stored. Combining motion vectors and blocking artifact maps of previous frames, possible locations of blocking artifacts can be estimated. Cooperating with oriented blocking artifact detection and filtering, a post deblocking filter having loop-filter performance is established. The proposed approach can also used in other DCT/MCP based codecs.
{"title":"A Post Deblocking Filter for H.264 Video","authors":"Yao-Min Huang, Jin-Jang Leou, M. Cheng","doi":"10.1109/ICCCN.2007.4317972","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317972","url":null,"abstract":"For very low bit rate video coding, coarse-quantized DCT coefficients induce discontinuities at block boundaries, namely, blocking artifacts. Furthermore, motion-compensated prediction propagates blocking artifacts to inner-block regions of subsequent video frames. Blocking artifacts caused by motion-compensated prediction (MCP) can be solved by a loop-filter. The main drawback of loop-filter is its in-flexibility. In this study, a post deblocking filter for H.264 video is proposed. In this study, to estimate inner-block discontinuities, a motion-compensated based approach is proposed. A map of detected blocking artifacts within each video frame is stored. Combining motion vectors and blocking artifact maps of previous frames, possible locations of blocking artifacts can be estimated. Cooperating with oriented blocking artifact detection and filtering, a post deblocking filter having loop-filter performance is established. The proposed approach can also used in other DCT/MCP based codecs.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128029503","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 : 2007-09-24DOI: 10.1109/ICCCN.2007.4317968
D. Messina, M. Ortolani, G. Re
This paper proposes a network-layer protocol for wireless sensor networks based on the IEEE 802.15.4 standard. Our protocol is devised to provide reliable data gathering in latency-constrained applications, and exploits both the flexibility of the IEEE 802.15.4 MAC layer and features of data aggregation techniques, such as implicit acknowledgment of reception. The proposed protocol acts as a routing module and a control entity for the MAC layer and provides reliable communication, while managing power saving and synchronization among nodes. Without relying on MAC-layer acknowledgments, the protocol implements caching and network-layer retransmissions, triggered upon detection of a link failure. The performance of the proposed approach is studied through simulations, in which we evaluate the achieved reliability and the energy consumption with varying network settings.
{"title":"Achieving Robustness through Caching and Retransmissions in IEEE 802.15.4-based WSNs","authors":"D. Messina, M. Ortolani, G. Re","doi":"10.1109/ICCCN.2007.4317968","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317968","url":null,"abstract":"This paper proposes a network-layer protocol for wireless sensor networks based on the IEEE 802.15.4 standard. Our protocol is devised to provide reliable data gathering in latency-constrained applications, and exploits both the flexibility of the IEEE 802.15.4 MAC layer and features of data aggregation techniques, such as implicit acknowledgment of reception. The proposed protocol acts as a routing module and a control entity for the MAC layer and provides reliable communication, while managing power saving and synchronization among nodes. Without relying on MAC-layer acknowledgments, the protocol implements caching and network-layer retransmissions, triggered upon detection of a link failure. The performance of the proposed approach is studied through simulations, in which we evaluate the achieved reliability and the energy consumption with varying network settings.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"67 11","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132782485","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 : 2007-09-24DOI: 10.1109/ICCCN.2007.4318009
Qingsheng Zhang, Yong Qi, Jizhong Zhao, Di Hou, Tianhai Zhao, Liang Liu
By using personal information in a pervasive computing environment, context-aware applications can provide appropriate services for people. This personal information is often involved in personal privacy. In order to protect personal privacy concerns about personal information, privacy role is proposed to control access personal information. We also construct an information system about the privacy decision of personal information disclosure based on people's interaction history. In the initial period of personal information disclosure, the privacy decision is made by people and the information system is constructed based on the decision data. Then privacy disclosure policies are extracted from this information system using rough set theory. According to deducing from the privacy disclosure policies and people's context information, the context-aware application is assigned to an adequate privacy role. It reduces the distraction of privacy decision for people. A case study further shows the proposed method is effective. Finally, it provides about the overload performance of privacy role analysis engine.
{"title":"A Study on Context-aware Privacy Protection for Personal Information","authors":"Qingsheng Zhang, Yong Qi, Jizhong Zhao, Di Hou, Tianhai Zhao, Liang Liu","doi":"10.1109/ICCCN.2007.4318009","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4318009","url":null,"abstract":"By using personal information in a pervasive computing environment, context-aware applications can provide appropriate services for people. This personal information is often involved in personal privacy. In order to protect personal privacy concerns about personal information, privacy role is proposed to control access personal information. We also construct an information system about the privacy decision of personal information disclosure based on people's interaction history. In the initial period of personal information disclosure, the privacy decision is made by people and the information system is constructed based on the decision data. Then privacy disclosure policies are extracted from this information system using rough set theory. According to deducing from the privacy disclosure policies and people's context information, the context-aware application is assigned to an adequate privacy role. It reduces the distraction of privacy decision for people. A case study further shows the proposed method is effective. Finally, it provides about the overload performance of privacy role analysis engine.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131769893","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 : 2007-09-24DOI: 10.1109/ICCCN.2007.4317780
V. Bhargava
The cognitive radio technology will allow a group of potential users to identify and access available spectrum resources provided that the interference to users for whom the band has been licensed is kept below a prescribed level. This research area is at an early stage because various research challenges have to be addressed and solved. In this talk we present an overview of some research issues for cognitive radio networks. Specifically, we present some research and developments in cognitive radio networks with focus on: i) information-theoretic aspects, ii) spectrum sensing, iii) link adaptation, iv) advanced transceiver design, and v) admission control. We discuss research problems related to these specific topics that need to be discussed before deployment of cognitive radio systems. The presentation concludes with a rendition of "Ya Moustafa, Ya Moustafa" and its relation to cognitive radios!
认知无线电技术将允许一组潜在用户识别和访问可用的频谱资源，前提是对已获得频段许可的用户的干扰保持在规定水平以下。这个研究领域还处于早期阶段，因为各种各样的研究挑战需要解决。在这次演讲中，我们概述了认知无线电网络的一些研究问题。具体来说，我们介绍了认知无线电网络的一些研究和发展，重点是:i)信息理论方面，ii)频谱感知，iii)链路自适应，iv)先进的收发器设计，以及v)准入控制。我们讨论了在部署认知无线电系统之前需要讨论的与这些特定主题相关的研究问题。演讲以“Ya Moustafa, Ya Moustafa”及其与认知无线电的关系结束!
{"title":"Research Challenges in Cognitive Radio Networks","authors":"V. Bhargava","doi":"10.1109/ICCCN.2007.4317780","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317780","url":null,"abstract":"The cognitive radio technology will allow a group of potential users to identify and access available spectrum resources provided that the interference to users for whom the band has been licensed is kept below a prescribed level. This research area is at an early stage because various research challenges have to be addressed and solved. In this talk we present an overview of some research issues for cognitive radio networks. Specifically, we present some research and developments in cognitive radio networks with focus on: i) information-theoretic aspects, ii) spectrum sensing, iii) link adaptation, iv) advanced transceiver design, and v) admission control. We discuss research problems related to these specific topics that need to be discussed before deployment of cognitive radio systems. The presentation concludes with a rendition of \"Ya Moustafa, Ya Moustafa\" and its relation to cognitive radios!","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"27 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132285834","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 : 2007-09-24DOI: 10.1109/ICCCN.2007.4317874
Rosanna Bova, Hye-young Paik, S. Hassas, S. Benbernou, B. Benatallah
With the proliferation of Web services, it is becoming increasingly important to support the users in selecting the most appropriate compositions of services for a task. We propose a new service discovery and selection framework that utilises the concept of task memories and a social network of task memories. A task memory captures the service composition history and their meta-data such as associated context and user rating. A network of task memories is formed to realise an effective task memory sharing platform among the users.
{"title":"WS-Advisor: A Task Memory for Service Composition Frameworks","authors":"Rosanna Bova, Hye-young Paik, S. Hassas, S. Benbernou, B. Benatallah","doi":"10.1109/ICCCN.2007.4317874","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317874","url":null,"abstract":"With the proliferation of Web services, it is becoming increasingly important to support the users in selecting the most appropriate compositions of services for a task. We propose a new service discovery and selection framework that utilises the concept of task memories and a social network of task memories. A task memory captures the service composition history and their meta-data such as associated context and user rating. A network of task memories is formed to realise an effective task memory sharing platform among the users.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134598558","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 : 2007-09-24DOI: 10.1109/ICCCN.2007.4317847
Mei Wang, L. Dunn, Wei Mao, Tao Chen
The scalability of Internet addressing and routing has been a serious issue and becomes a more urgent problem today because of driving factors like IPv6. A radical impacting element of the scalability is address allocation, as it directly affects routing table structure, hence, IP lookup and routing efficiency. A key problem in IPv4 today is address fragmentation, i.e., one entity is represented by multiple non-contiguous IP address blocks in the routing table. Address fragmentation increases routing table size, therefore degrades scalability. Existing address allocation practices are a major contributor to address fragmentation. In this paper, we demonstrate that the performance of address allocation can be dramatically improved. We propose a new address allocation algorithm called GAP: Growth-based Address Partitioning. Through real data, we show that GAP can reduce fragmentation by 90% compared to the existing allocation schemes. This is significant for reducing routing table size, increasing scalability, and improving the performance of the Internet. We also introduce a software tool being developed for address allocation.
{"title":"Reduce IP Address Fragmentation through Allocation","authors":"Mei Wang, L. Dunn, Wei Mao, Tao Chen","doi":"10.1109/ICCCN.2007.4317847","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317847","url":null,"abstract":"The scalability of Internet addressing and routing has been a serious issue and becomes a more urgent problem today because of driving factors like IPv6. A radical impacting element of the scalability is address allocation, as it directly affects routing table structure, hence, IP lookup and routing efficiency. A key problem in IPv4 today is address fragmentation, i.e., one entity is represented by multiple non-contiguous IP address blocks in the routing table. Address fragmentation increases routing table size, therefore degrades scalability. Existing address allocation practices are a major contributor to address fragmentation. In this paper, we demonstrate that the performance of address allocation can be dramatically improved. We propose a new address allocation algorithm called GAP: Growth-based Address Partitioning. Through real data, we show that GAP can reduce fragmentation by 90% compared to the existing allocation schemes. This is significant for reducing routing table size, increasing scalability, and improving the performance of the Internet. We also introduce a software tool being developed for address allocation.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131849669","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 : 2007-09-24DOI: 10.1109/ICCCN.2007.4317914
Tsern-Huei Lee
Because of its accuracy, signature matching is considered an important technique in anti-virus/worm applications. Among some famous pattern matching algorithms, the Aho-Corasick (AC) algorithm can match multiple patterns simultaneously and guarantee deterministic performance under all circumstances and thus is widely adopted in various systems, especially when worst-case performance such as wire speed requirement is a design factor. However, the AC algorithm was developed only for strings while virus/worm signatures could be specified by simple regular expressions. In this paper, we generalize the AC algorithm to systematically construct a finite state pattern matching machine which can indicate the ending position in a finite input string for the first occurrence of virus/worm signatures that are specified by strings or simple regular expressions. The regular expressions studied in this paper may contain the following operators: * (match any number of symbols), ? (match any symbol), and {min, max} (match minimum of min, maximum of max symbols), which are defined in ClamAV, a popular open source anti-virus/worm software module, for signature specification.
{"title":"Generalized Aho-Corasick Algorithm for Signature Based Anti-Virus Applications","authors":"Tsern-Huei Lee","doi":"10.1109/ICCCN.2007.4317914","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317914","url":null,"abstract":"Because of its accuracy, signature matching is considered an important technique in anti-virus/worm applications. Among some famous pattern matching algorithms, the Aho-Corasick (AC) algorithm can match multiple patterns simultaneously and guarantee deterministic performance under all circumstances and thus is widely adopted in various systems, especially when worst-case performance such as wire speed requirement is a design factor. However, the AC algorithm was developed only for strings while virus/worm signatures could be specified by simple regular expressions. In this paper, we generalize the AC algorithm to systematically construct a finite state pattern matching machine which can indicate the ending position in a finite input string for the first occurrence of virus/worm signatures that are specified by strings or simple regular expressions. The regular expressions studied in this paper may contain the following operators: * (match any number of symbols), ? (match any symbol), and {min, max} (match minimum of min, maximum of max symbols), which are defined in ClamAV, a popular open source anti-virus/worm software module, for signature specification.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131786387","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 : 2007-09-24DOI: 10.1109/ICCCN.2007.4317900
V. Pappas, V. Hilt, M. Hofmann
Overlay networks are widely used as a way to introduce novel Internet services and to improve the reliability and performance of today's Internet. Traditionally, overlay networks perform routing by mimicking the underlying IP routing protocols, which does not scale well with the system size. In this paper, we propose a fundamentally new approach to overlay routing that is based on network coordinates. Our evaluation shows that this approach is scalable to a large number of overlay nodes with a message complexity of O(N) while providing routing decisions that are close to optimal in terms of error resilience and path delay.
{"title":"Coordinate-Based Routing for Overlay Networks","authors":"V. Pappas, V. Hilt, M. Hofmann","doi":"10.1109/ICCCN.2007.4317900","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317900","url":null,"abstract":"Overlay networks are widely used as a way to introduce novel Internet services and to improve the reliability and performance of today's Internet. Traditionally, overlay networks perform routing by mimicking the underlying IP routing protocols, which does not scale well with the system size. In this paper, we propose a fundamentally new approach to overlay routing that is based on network coordinates. Our evaluation shows that this approach is scalable to a large number of overlay nodes with a message complexity of O(N) while providing routing decisions that are close to optimal in terms of error resilience and path delay.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132189299","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 : 2007-09-24DOI: 10.1109/ICCCN.2007.4317797
Kyunghwi Kim, Wonjun Lee
Localization is one of the critical issues on wireless sensor networks. Localization schemes are classified into range-based and range-free according to the method of whether to use range information. In this paper, we propose a novel range-based localization scheme which involves a movement strategy of mobile beacon, called mobile beacon-assisted localization (MBAL). Contrary to many research activities which have been carried out to design localization schemes using mobile beacons only based on random movement method, we consider totally a new scheme providing movement path selection with a low computational complexity. A new range check technique is also adopted into the MBAL as a useful solution to the position-ambiguity problem of bilateration in order to improve the performance of the proposed localization scheme. Simulation results verify that the MBAL impressively achieves energy efficiency because of its mobile beacon based approach using the proposed movement strategy and range check technique.
{"title":"MBAL: A Mobile Beacon-Assisted Localization Scheme for Wireless Sensor Networks","authors":"Kyunghwi Kim, Wonjun Lee","doi":"10.1109/ICCCN.2007.4317797","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317797","url":null,"abstract":"Localization is one of the critical issues on wireless sensor networks. Localization schemes are classified into range-based and range-free according to the method of whether to use range information. In this paper, we propose a novel range-based localization scheme which involves a movement strategy of mobile beacon, called mobile beacon-assisted localization (MBAL). Contrary to many research activities which have been carried out to design localization schemes using mobile beacons only based on random movement method, we consider totally a new scheme providing movement path selection with a low computational complexity. A new range check technique is also adopted into the MBAL as a useful solution to the position-ambiguity problem of bilateration in order to improve the performance of the proposed localization scheme. Simulation results verify that the MBAL impressively achieves energy efficiency because of its mobile beacon based approach using the proposed movement strategy and range check technique.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132628454","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 : 2007-09-24DOI: 10.1109/ICCCN.2007.4317877
S. Rangarajan, J. Garcia-Luna-Aceves
Many multipath routing protocols proposed to date have used destination sequence numbers to provide multiple loop-free paths to destinations. We present the first on-demand multipath routing protocol for ad hoc networks that uses source sequence numbers to maintain loop-free routes. We propose a novel load-balancing scheme that incurs very little control overhead. Extensive simulations illustrate that the proposed multipath protocol performs better than single-path approaches and that the proposed load-balancing scheme performs better than basic round-robin scheduling.
{"title":"Load-Balanced Routing in Ad hoc Networks","authors":"S. Rangarajan, J. Garcia-Luna-Aceves","doi":"10.1109/ICCCN.2007.4317877","DOIUrl":"https://doi.org/10.1109/ICCCN.2007.4317877","url":null,"abstract":"Many multipath routing protocols proposed to date have used destination sequence numbers to provide multiple loop-free paths to destinations. We present the first on-demand multipath routing protocol for ad hoc networks that uses source sequence numbers to maintain loop-free routes. We propose a novel load-balancing scheme that incurs very little control overhead. Extensive simulations illustrate that the proposed multipath protocol performs better than single-path approaches and that the proposed load-balancing scheme performs better than basic round-robin scheduling.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115974520","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
扫码关注我们
求助内容：
应助结果提醒方式：