Pub Date : 2007-07-09DOI: 10.1109/COMSWA.2007.382559
Raymond Peterkin, J. Solomon, D. Ionescu
Web services are commonly used by organizations for B2B integration and enterprise application integration. UDDI registries are widely used as mechanisms for businesses to list and discover available services. Businesses may want to limit the information of their services to certain users and businesses. However, UDDI provides no mechanisms to limit data inquiries to a particular subset of requesters. This paper presents a role-based access control implementation of UDDI so businesses may safely publish data and limit the organizations who may perform inquiries against their information.
{"title":"Role Based Access Control for UDDI Inquiries","authors":"Raymond Peterkin, J. Solomon, D. Ionescu","doi":"10.1109/COMSWA.2007.382559","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382559","url":null,"abstract":"Web services are commonly used by organizations for B2B integration and enterprise application integration. UDDI registries are widely used as mechanisms for businesses to list and discover available services. Businesses may want to limit the information of their services to certain users and businesses. However, UDDI provides no mechanisms to limit data inquiries to a particular subset of requesters. This paper presents a role-based access control implementation of UDDI so businesses may safely publish data and limit the organizations who may perform inquiries against their information.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"2245 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127473027","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-07-09DOI: 10.1109/COMSWA.2007.382422
Bin Cai, C. Xie, Guangxi Zhu
With the system scale keeping grown, the key challenge is to mask the failures that arise among the system components and to improve the performance of data-intensive applications. This paper designs and implements a cluster-based distributed replication file system EDRFS to meet these critical demands. EDRFS works with a single metadata server and multiple storage nodes, deploys whole-file replication scheme at the file level, and tracks what storage node a file is replicated on. We use a linear hash algorithm to evenly distribute data and load across multiple storage nodes so as to achieve balancing workload and incremental scalability of throughput and storage capacity as the system scale grows. In addition, we employ metadata caches and file data caches in clients to enhance system performance. Furthermore, we deploy a concurrency lock scheme to avoid namespace operation bottleneck and a replicas consistency method to keep a consistent mutation order among replicas of a file. We provide the initial experimental evaluations of our prototypical system on a small-file and data-intensive workload.
{"title":"EDRFS: An Effective Distributed Replication File System for Small-File and Data-Intensive Application","authors":"Bin Cai, C. Xie, Guangxi Zhu","doi":"10.1109/COMSWA.2007.382422","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382422","url":null,"abstract":"With the system scale keeping grown, the key challenge is to mask the failures that arise among the system components and to improve the performance of data-intensive applications. This paper designs and implements a cluster-based distributed replication file system EDRFS to meet these critical demands. EDRFS works with a single metadata server and multiple storage nodes, deploys whole-file replication scheme at the file level, and tracks what storage node a file is replicated on. We use a linear hash algorithm to evenly distribute data and load across multiple storage nodes so as to achieve balancing workload and incremental scalability of throughput and storage capacity as the system scale grows. In addition, we employ metadata caches and file data caches in clients to enhance system performance. Furthermore, we deploy a concurrency lock scheme to avoid namespace operation bottleneck and a replicas consistency method to keep a consistent mutation order among replicas of a file. We provide the initial experimental evaluations of our prototypical system on a small-file and data-intensive workload.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121507759","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-07-09DOI: 10.1109/COMSWA.2007.382564
K. Ravindran, K. Kwiat
Majority voting among replicated data collection devices enhances the trust-worthiness of data flowing from a hostile external environment. It allows a correct data fusion and dissemination by the end-users, in the presence of content corruptions and/or timing failures that may possibly occur during data collection. In addition, a device may operate on fuzzy inputs, thereby generating a data that occasionally deviates from the reference datum in physical world. In this paper, we provide a QoS-oriented approach to manage the data flow through various system elements. The application-level QoS parameters we consider are timeliness and accuracy of data. The underlying protocol-level parameters that influence data delivery performance are the data sizes, network bandwidth, device asynchrony, and data fuzziness. A replica voting protocol takes into account the interplay between these parameters as the faulty behavior of malicious devices unfolds in various forms during data collection. Our QoS-oriented approach casts the well-known fault-tolerance techniques, namely, 2-phase voting, with control mechanisms that adapt the data delivery to meet the end-to-end constraints - such as latency, data integrity, and resource cost. The paper describes a middleware architecture to realize our QoS-oriented approach to the management of replicated data flows.
{"title":"A Middleware Architecture for Replica Voting on Fuzzy Data in Dependable Real-time Systems","authors":"K. Ravindran, K. Kwiat","doi":"10.1109/COMSWA.2007.382564","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382564","url":null,"abstract":"Majority voting among replicated data collection devices enhances the trust-worthiness of data flowing from a hostile external environment. It allows a correct data fusion and dissemination by the end-users, in the presence of content corruptions and/or timing failures that may possibly occur during data collection. In addition, a device may operate on fuzzy inputs, thereby generating a data that occasionally deviates from the reference datum in physical world. In this paper, we provide a QoS-oriented approach to manage the data flow through various system elements. The application-level QoS parameters we consider are timeliness and accuracy of data. The underlying protocol-level parameters that influence data delivery performance are the data sizes, network bandwidth, device asynchrony, and data fuzziness. A replica voting protocol takes into account the interplay between these parameters as the faulty behavior of malicious devices unfolds in various forms during data collection. Our QoS-oriented approach casts the well-known fault-tolerance techniques, namely, 2-phase voting, with control mechanisms that adapt the data delivery to meet the end-to-end constraints - such as latency, data integrity, and resource cost. The paper describes a middleware architecture to realize our QoS-oriented approach to the management of replicated data flows.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"135 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131514594","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-07-09DOI: 10.1109/COMSWA.2007.382425
S. Vashistha, A. Azad, A. Chockalingam
In this paper, we are concerned with algorithms for scheduling the sensing activity of sensor nodes that are deployed to sense/measure point-targets in wireless sensor networks using information coverage. Defining a set of sensors which collectively can sense a target accurately as an information cover, we propose an algorithm to obtain disjoint set of information covers (DSIC), which achieves longer network life compared to the set of covers obtained using an exhaustive-greedy-equalized heuristic (EGEH) algorithm proposed in the literature. We also present a detailed complexity comparison between the DSIC and EGEH algorithms.
在本文中，我们关注的算法调度传感器节点的传感活动部署到无线传感器网络中使用信息覆盖的传感/测量点目标。将一组能够准确感知目标的传感器集合定义为信息覆盖，提出了一种获取不相交信息覆盖集(disjoint set of information covers, DSIC)的算法，该算法比文献中提出的穷尽贪婪均衡启发式(EGEH)算法获得的覆盖集具有更长的网络寿命。我们还详细比较了DSIC和EGEH算法的复杂度。
{"title":"Efficient Scheduling of Sensor Activity for Information Coverage in Wireless Sensor Networks","authors":"S. Vashistha, A. Azad, A. Chockalingam","doi":"10.1109/COMSWA.2007.382425","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382425","url":null,"abstract":"In this paper, we are concerned with algorithms for scheduling the sensing activity of sensor nodes that are deployed to sense/measure point-targets in wireless sensor networks using information coverage. Defining a set of sensors which collectively can sense a target accurately as an information cover, we propose an algorithm to obtain disjoint set of information covers (DSIC), which achieves longer network life compared to the set of covers obtained using an exhaustive-greedy-equalized heuristic (EGEH) algorithm proposed in the literature. We also present a detailed complexity comparison between the DSIC and EGEH algorithms.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121481938","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-07-09DOI: 10.1109/COMSWA.2007.382421
S. Joshi, V. Phoha
Traditional authentication systems employed on Internet are facing an acute problem of intrusions. In this context we propose a neural architecture for user authentication through keystroke dynamics. Proposed architecture consists of a set of self organizing maps where each user has a distinct map. Each map consists of n neurons in the input layer where n is the length of a keystroke pattern; however to determine the number of neurons in the output layer, a strategy is proposed. For authenticating claimed user, probable user(s) for a given pattern and the degree of similarity between the map of the claimed user and a given pattern are determined. Finally, a decision on the authenticity is made using threshold criteria. Evaluation results show the best false accept rate of 0.88% when false reject rate was 3.55% with authentication accuracy of 97.83%. An application scenario of the method in a computer network environment is also presented.
{"title":"Competition between SOM Clusters to Model User Authentication System in Computer Networks","authors":"S. Joshi, V. Phoha","doi":"10.1109/COMSWA.2007.382421","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382421","url":null,"abstract":"Traditional authentication systems employed on Internet are facing an acute problem of intrusions. In this context we propose a neural architecture for user authentication through keystroke dynamics. Proposed architecture consists of a set of self organizing maps where each user has a distinct map. Each map consists of n neurons in the input layer where n is the length of a keystroke pattern; however to determine the number of neurons in the output layer, a strategy is proposed. For authenticating claimed user, probable user(s) for a given pattern and the degree of similarity between the map of the claimed user and a given pattern are determined. Finally, a decision on the authenticity is made using threshold criteria. Evaluation results show the best false accept rate of 0.88% when false reject rate was 3.55% with authentication accuracy of 97.83%. An application scenario of the method in a computer network environment is also presented.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129542968","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-07-09DOI: 10.1109/COMSWA.2007.382452
Rajendra Singh, A. Chaturvedi
In this paper performance of four frequency hopping (FH) code sequences has been studied from the point of view of evaluating their suitability for time hopping (TH) UWB systems. Multiuser interference analysis and correlation properties of the code sequences have been considered as the tools to derive the final conclusions. The paper also provides the lower bound on the correlation measure of TH codes.
{"title":"Suitability of FH codes as TH codes for multiuser UWB Systems","authors":"Rajendra Singh, A. Chaturvedi","doi":"10.1109/COMSWA.2007.382452","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382452","url":null,"abstract":"In this paper performance of four frequency hopping (FH) code sequences has been studied from the point of view of evaluating their suitability for time hopping (TH) UWB systems. Multiuser interference analysis and correlation properties of the code sequences have been considered as the tools to derive the final conclusions. The paper also provides the lower bound on the correlation measure of TH codes.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"196 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134112930","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-07-09DOI: 10.1109/COMSWA.2007.382503
S. Gopal, S. Paul, D. Raychaudhuri
Cache and forward (CNF) Architecture is a novel architecture aimed at delivering content efficiently to potentially large number of intermittently connected mobile hosts. It uses a reliable hop-by-hop transport mechanism where in-network storage is leveraged to store the entire file in each node, before forwarding it towards the destination(s). Links between nodes may be wired, or wireless, 802.11 a/b/g, cellular, or satellite, or some other upcoming wired/wireless technology. A key aspect in the CNF architecture is to choose the link-layer protocol with parameters such that it optimizes the performance of the link between two CNF nodes. In this paper we propose cross-layer aware transport protocol (CLAP) as a potential candidate for a reliable link-layer protocol between two CNF nodes connected by 802.11 a/b/g link. Leveraging upon MAC layer status information, CLAP quickly adapts its flow control rate to bandwidth fluctuations and maximizes link utilization efficiency. Due to the self-interference problem in wireless links, where ACK packets corresponding to a given flow interfere with the DATA packets of the same flow, CLAP's error control algorithm is based on aggregate negative acknowledgements (NACKs) which reduce the reverse traffic and hence the interference with the data traffic. Since CLAP performs transport layer functionality, we compare it with TCP-SACK -a popular variation of TCP. CLAP significantly outperforms TCP-SACK in both noise-free and noise-prone wireless environments, with throughput gains upward of 150%. For multiple flows, CLAP leverages the fairness characteristics of the underlying MAC layer to achieve fair bandwidth sharing among flows.
{"title":"Leveraging MAC-layer information for single-hop wireless transport in the Cache and Forward Architecture of the Future Internet","authors":"S. Gopal, S. Paul, D. Raychaudhuri","doi":"10.1109/COMSWA.2007.382503","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382503","url":null,"abstract":"Cache and forward (CNF) Architecture is a novel architecture aimed at delivering content efficiently to potentially large number of intermittently connected mobile hosts. It uses a reliable hop-by-hop transport mechanism where in-network storage is leveraged to store the entire file in each node, before forwarding it towards the destination(s). Links between nodes may be wired, or wireless, 802.11 a/b/g, cellular, or satellite, or some other upcoming wired/wireless technology. A key aspect in the CNF architecture is to choose the link-layer protocol with parameters such that it optimizes the performance of the link between two CNF nodes. In this paper we propose cross-layer aware transport protocol (CLAP) as a potential candidate for a reliable link-layer protocol between two CNF nodes connected by 802.11 a/b/g link. Leveraging upon MAC layer status information, CLAP quickly adapts its flow control rate to bandwidth fluctuations and maximizes link utilization efficiency. Due to the self-interference problem in wireless links, where ACK packets corresponding to a given flow interfere with the DATA packets of the same flow, CLAP's error control algorithm is based on aggregate negative acknowledgements (NACKs) which reduce the reverse traffic and hence the interference with the data traffic. Since CLAP performs transport layer functionality, we compare it with TCP-SACK -a popular variation of TCP. CLAP significantly outperforms TCP-SACK in both noise-free and noise-prone wireless environments, with throughput gains upward of 150%. For multiple flows, CLAP leverages the fairness characteristics of the underlying MAC layer to achieve fair bandwidth sharing among flows.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134339044","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-07-09DOI: 10.1109/COMSWA.2007.382502
Guoqing Li, L. Yang
This paper presents a performance study of the deafness effect caused by the use of directional antenna in 802.11 networks. We show that different assumptions on antenna and channel model lead to different conclusions on the impact of deafness on network performance. Specifically, it is shown that in the presence of channel scatters between the transmitter and the receiver, directional antenna does not pose significant deafness and performance degradation. We also show that there always exists a CCA (clear-channel-assessment) threshold that eliminates deafness completely, even under existing 802.11 MAC protocols.
{"title":"On Utilizing Directional Antenna in 802.11 Networks: Deafness Study","authors":"Guoqing Li, L. Yang","doi":"10.1109/COMSWA.2007.382502","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382502","url":null,"abstract":"This paper presents a performance study of the deafness effect caused by the use of directional antenna in 802.11 networks. We show that different assumptions on antenna and channel model lead to different conclusions on the impact of deafness on network performance. Specifically, it is shown that in the presence of channel scatters between the transmitter and the receiver, directional antenna does not pose significant deafness and performance degradation. We also show that there always exists a CCA (clear-channel-assessment) threshold that eliminates deafness completely, even under existing 802.11 MAC protocols.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"135 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114107333","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-07-09DOI: 10.1109/COMSWA.2007.382443
Minas Gjoka, Vinayak Ram, Xiaowei Yang
With the increasing demand for low-latency applications in the Internet, the slow convergence of the existing routing protocols is a growing concern. A number of IP fast reroute mechanisms have been developed by the IETF to address the issue. The goal of the IPFRR mechanisms is to activate alternate routing paths which avoid micro loops under node or link failures. In this paper we present a comprehensive analysis of these proposals by evaluating their coverage for a variety of inferred and synthetic ISP topologies.
{"title":"Evaluation of IP Fast Reroute Proposals","authors":"Minas Gjoka, Vinayak Ram, Xiaowei Yang","doi":"10.1109/COMSWA.2007.382443","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382443","url":null,"abstract":"With the increasing demand for low-latency applications in the Internet, the slow convergence of the existing routing protocols is a growing concern. A number of IP fast reroute mechanisms have been developed by the IETF to address the issue. The goal of the IPFRR mechanisms is to activate alternate routing paths which avoid micro loops under node or link failures. In this paper we present a comprehensive analysis of these proposals by evaluating their coverage for a variety of inferred and synthetic ISP topologies.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114967302","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-07-09DOI: 10.1109/COMSWA.2007.382585
Sangwoo Han, N. Kim, Kiho Choi, JongWon Kim
With the advent of Gbps-range research and engineering networks, remote multi-party collaboration systems are getting more interest. However, most existing collaboration systems are limited in providing realistic and interactive quality of user experience. This paper introduces the design of a multiparty meeting system for advanced interactive collaboration. By extending the access grid (AG) multi-party collaboration system, an interactive meeting space is envisioned to enhance the quality of user experience. Several design considerations are reviewed from the integrated view of media, networking, display, and interaction service components. Thus, a prototype framework and realization will be discussed by combining user-friendly pointing/tracking interactions, high-resolution tiled displays, hybrid multicast-based networking, and high-quality HD media services.
{"title":"Design of Multi-party Meeting System for Interactive Collaboration","authors":"Sangwoo Han, N. Kim, Kiho Choi, JongWon Kim","doi":"10.1109/COMSWA.2007.382585","DOIUrl":"https://doi.org/10.1109/COMSWA.2007.382585","url":null,"abstract":"With the advent of Gbps-range research and engineering networks, remote multi-party collaboration systems are getting more interest. However, most existing collaboration systems are limited in providing realistic and interactive quality of user experience. This paper introduces the design of a multiparty meeting system for advanced interactive collaboration. By extending the access grid (AG) multi-party collaboration system, an interactive meeting space is envisioned to enhance the quality of user experience. Several design considerations are reviewed from the integrated view of media, networking, display, and interaction service components. Thus, a prototype framework and realization will be discussed by combining user-friendly pointing/tracking interactions, high-resolution tiled displays, hybrid multicast-based networking, and high-quality HD media services.","PeriodicalId":191295,"journal":{"name":"2007 2nd International Conference on Communication Systems Software and Middleware","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131787739","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
扫码关注我们
求助内容：
应助结果提醒方式：