Pub Date : 2005-12-19DOI: 10.1109/COLCOM.2005.1651258
B. Prabhakar
Over the past 10-15 years the area of Network Algorithms has grown from a collection of isolated algorithms and analysis methods into a cohesive body of research and development. The problems in this area are characterized by several requirements, of which speed, scalability and simplicity are the most important. For algorithms designed to operate in high-speed router hardware, there is the additional stringent constraint of low heat dissipation. We overview the development of Network Algorithms, emphasizing algorithms designed for high-speed hardware implementations. Specifically, we describe the algorithms and analysis methods developed for bandwidth partitioning, routing and security applications. We highlight the crucial role of randomization and probabilistic techniques in simplifying the implementation while delivering high performance.
{"title":"Network Hardware Algorithms","authors":"B. Prabhakar","doi":"10.1109/COLCOM.2005.1651258","DOIUrl":"https://doi.org/10.1109/COLCOM.2005.1651258","url":null,"abstract":"Over the past 10-15 years the area of Network Algorithms has grown from a collection of isolated algorithms and analysis methods into a cohesive body of research and development. The problems in this area are characterized by several requirements, of which speed, scalability and simplicity are the most important. For algorithms designed to operate in high-speed router hardware, there is the additional stringent constraint of low heat dissipation. We overview the development of Network Algorithms, emphasizing algorithms designed for high-speed hardware implementations. Specifically, we describe the algorithms and analysis methods developed for bandwidth partitioning, routing and security applications. We highlight the crucial role of randomization and probabilistic techniques in simplifying the implementation while delivering high performance.","PeriodicalId":365186,"journal":{"name":"2005 International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125324288","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 : 2005-12-19DOI: 10.1109/COLCOM.2005.1651207
C. Pu
{"title":"Collaborative Enterprise Applications","authors":"C. Pu","doi":"10.1109/COLCOM.2005.1651207","DOIUrl":"https://doi.org/10.1109/COLCOM.2005.1651207","url":null,"abstract":"","PeriodicalId":365186,"journal":{"name":"2005 International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122814055","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 : 2005-12-19DOI: 10.1109/COLCOM.2005.1651247
T. M. Kwan, K. Yeung
Overlay multicast tree construction and maintenance is a major challenge in designing application layer multicast protocols. In this paper, we focus on improving the joining and maintenance procedures of an overlay multicast tree. Unlike the existing direct-tree protocols, our proposed overlay multicast tree protocol (OMTP) has the following characteristics. First, by leveraging on the IP hierarchical addressing locality, we can speed up the formation of overlay multicast tree and enhance the efficiency of the tree maintenance. Second, we take both bandwidth availability and round-trip-time (RTT) into consideration when a newcomer selects its parent node. Finally, an effective mechanism is designed to disperse the simultaneous rejoin crowds in the tree repair phase. Simulation results show that with our proposed protocol, the join latency can be reduced by as large as 50% as compared with a popular direct-tree protocol HMTP
{"title":"On overlay multicast tree construction and maintenance","authors":"T. M. Kwan, K. Yeung","doi":"10.1109/COLCOM.2005.1651247","DOIUrl":"https://doi.org/10.1109/COLCOM.2005.1651247","url":null,"abstract":"Overlay multicast tree construction and maintenance is a major challenge in designing application layer multicast protocols. In this paper, we focus on improving the joining and maintenance procedures of an overlay multicast tree. Unlike the existing direct-tree protocols, our proposed overlay multicast tree protocol (OMTP) has the following characteristics. First, by leveraging on the IP hierarchical addressing locality, we can speed up the formation of overlay multicast tree and enhance the efficiency of the tree maintenance. Second, we take both bandwidth availability and round-trip-time (RTT) into consideration when a newcomer selects its parent node. Finally, an effective mechanism is designed to disperse the simultaneous rejoin crowds in the tree repair phase. Simulation results show that with our proposed protocol, the join latency can be reduced by as large as 50% as compared with a popular direct-tree protocol HMTP","PeriodicalId":365186,"journal":{"name":"2005 International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131870067","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 : 2005-12-19DOI: 10.1109/COLCOM.2005.1651240
S. Banik, S. Radhakrishnan, T. Zheng, C. Sekharan
Computer supported collaborative applications on overlay networks are gaining popularity among users who are geographically dispersed. Examples of these kinds of applications include video-conferencing, collaborative design and simulation, distance learning, and online games. One of the important issues in collaborative applications is floor control wherein the end-users coordinate among themselves to gain exclusive access to the communication channel. An end-user who wins the floor, sends message to all other participating end-users. In this paper, to solve the floor control problem we present an implementation and evaluation of ALOHA and distributed queue dual bus (DQDB) distributed MAC (medium access control) protocols on overlay networks. As an initial step in the implementation of these MAC protocols, we propose an algorithm to construct an efficient communication channel among the Network Service Nodes (NSNs) in the overlay network. We also show that our implementation scheme (first one among decentralized floor control protocols) preserves the causal ordering of messages. We compare the efficiencies of the proposed implementation of floor control protocols using an analytical model that is verified using extensive simulation experiments
{"title":"Distributed floor control protocols for computer collaborative applications on overlay networks","authors":"S. Banik, S. Radhakrishnan, T. Zheng, C. Sekharan","doi":"10.1109/COLCOM.2005.1651240","DOIUrl":"https://doi.org/10.1109/COLCOM.2005.1651240","url":null,"abstract":"Computer supported collaborative applications on overlay networks are gaining popularity among users who are geographically dispersed. Examples of these kinds of applications include video-conferencing, collaborative design and simulation, distance learning, and online games. One of the important issues in collaborative applications is floor control wherein the end-users coordinate among themselves to gain exclusive access to the communication channel. An end-user who wins the floor, sends message to all other participating end-users. In this paper, to solve the floor control problem we present an implementation and evaluation of ALOHA and distributed queue dual bus (DQDB) distributed MAC (medium access control) protocols on overlay networks. As an initial step in the implementation of these MAC protocols, we propose an algorithm to construct an efficient communication channel among the Network Service Nodes (NSNs) in the overlay network. We also show that our implementation scheme (first one among decentralized floor control protocols) preserves the causal ordering of messages. We compare the efficiencies of the proposed implementation of floor control protocols using an analytical model that is verified using extensive simulation experiments","PeriodicalId":365186,"journal":{"name":"2005 International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127686047","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 : 2005-12-19DOI: 10.1109/COLCOM.2005.1651266
Xinjie Li, M. Brockmeyer
Many applications need to pick servers with some desired distribution. For example, in probabilistic quorum systems, one method to generate quorums with high probability of intersection is to randomly pick kradicn nodes with a fixed probability distribution. Load balancing applications may need to take several samples of the servers with some desired distribution. Existing approaches realize a fixed stationary distribution by controlling the topology of the overlay graph and conducting random walks on it. In particular, existing approaches focus on achieving a uniform distribution. This paper proposes using the distributed Hastings-Metropolis algorithm to achieve any desired stationary distribution without control or global knowledge of the overlay graph. The new method facilitates good load balancing, since heterogeneous server capacity or other factors can be considered in deciding the appropriate distribution by which to pick servers
{"title":"Server selection with arbitrary distribution","authors":"Xinjie Li, M. Brockmeyer","doi":"10.1109/COLCOM.2005.1651266","DOIUrl":"https://doi.org/10.1109/COLCOM.2005.1651266","url":null,"abstract":"Many applications need to pick servers with some desired distribution. For example, in probabilistic quorum systems, one method to generate quorums with high probability of intersection is to randomly pick kradicn nodes with a fixed probability distribution. Load balancing applications may need to take several samples of the servers with some desired distribution. Existing approaches realize a fixed stationary distribution by controlling the topology of the overlay graph and conducting random walks on it. In particular, existing approaches focus on achieving a uniform distribution. This paper proposes using the distributed Hastings-Metropolis algorithm to achieve any desired stationary distribution without control or global knowledge of the overlay graph. The new method facilitates good load balancing, since heterogeneous server capacity or other factors can be considered in deciding the appropriate distribution by which to pick servers","PeriodicalId":365186,"journal":{"name":"2005 International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117011291","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 : 2005-12-19DOI: 10.1109/COLCOM.2005.1651268
J. Dowling, D. Dahlem, J. Sacha
In contrast to a large body of theoretical work on computer systems, distributed systems are not idealised constructions, unconstrained by physical world limitations. They must be designed to account for limiting, real-world properties such as network latency, varying node capabilities, varying application behaviour and unexpected failures. These real-world properties that we describe under the general area of a system's environment have regularities or heterogeneities that can often be modelled as a stochastic process, often using well-known distributions. This paper proposes dissipative structures as a model to capture information about properties of these stochastic processes. In dissipative systems, agents (or nodes) sample information from their local environments and collectively build structures that capture knowledge of recent regularities or heterogeneities in the system's environment. Dissipative structures are a promising technique for transferring knowledge of the system's environment among agents without requiring excessive message passing. This approach offers the promise of building more efficient search algorithms based on reduced uncertainty of the system's environment
{"title":"Matching distributed systems to their environment using dissipative structures","authors":"J. Dowling, D. Dahlem, J. Sacha","doi":"10.1109/COLCOM.2005.1651268","DOIUrl":"https://doi.org/10.1109/COLCOM.2005.1651268","url":null,"abstract":"In contrast to a large body of theoretical work on computer systems, distributed systems are not idealised constructions, unconstrained by physical world limitations. They must be designed to account for limiting, real-world properties such as network latency, varying node capabilities, varying application behaviour and unexpected failures. These real-world properties that we describe under the general area of a system's environment have regularities or heterogeneities that can often be modelled as a stochastic process, often using well-known distributions. This paper proposes dissipative structures as a model to capture information about properties of these stochastic processes. In dissipative systems, agents (or nodes) sample information from their local environments and collectively build structures that capture knowledge of recent regularities or heterogeneities in the system's environment. Dissipative structures are a promising technique for transferring knowledge of the system's environment among agents without requiring excessive message passing. This approach offers the promise of building more efficient search algorithms based on reduced uncertainty of the system's environment","PeriodicalId":365186,"journal":{"name":"2005 International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122706693","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 : 2005-12-19DOI: 10.1109/COLCOM.2005.1651245
R. Egashira, A. Enomoto, T. Suda, Hiroshi Sasaki, H. Iwasaki
Distributed collaborative applications will be widely used in a future large-scale and dynamic network. Such applications require the capability of locating distributed network objects that better match query originator's criteria. In this paper, a discovery mechanism utilizing query originator's preference is proposed in order to locate objects preferred by query originators. The proposed mechanism allows query originators to return feedbacks that describe the degree of the preference for discovered objects. The preference of query originators is utilized to guide subsequent queries in a distributed manner, enhancing efficiency of discovery. The preference of query originators is also utilized to adaptively change forwarding paths of queries corresponding to varying network environments. Extensive simulation work shows that the proposed mechanism is efficient and adaptive to dynamics of the peer-to-peer network environment where transient objects often join and leave
{"title":"Distributed service discovery using preference","authors":"R. Egashira, A. Enomoto, T. Suda, Hiroshi Sasaki, H. Iwasaki","doi":"10.1109/COLCOM.2005.1651245","DOIUrl":"https://doi.org/10.1109/COLCOM.2005.1651245","url":null,"abstract":"Distributed collaborative applications will be widely used in a future large-scale and dynamic network. Such applications require the capability of locating distributed network objects that better match query originator's criteria. In this paper, a discovery mechanism utilizing query originator's preference is proposed in order to locate objects preferred by query originators. The proposed mechanism allows query originators to return feedbacks that describe the degree of the preference for discovered objects. The preference of query originators is utilized to guide subsequent queries in a distributed manner, enhancing efficiency of discovery. The preference of query originators is also utilized to adaptively change forwarding paths of queries corresponding to varying network environments. Extensive simulation work shows that the proposed mechanism is efficient and adaptive to dynamics of the peer-to-peer network environment where transient objects often join and leave","PeriodicalId":365186,"journal":{"name":"2005 International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134429389","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 : 2005-12-19DOI: 10.1109/COLCOM.2005.1651254
Hassan Mahmood, C. Comaniciu
CDMA technology represents an attractive choice for various wireless ad hoc networks applications, due to its appealing properties, such as resistance to jamming and interference, low probability of intercept, and potential for energy savings. On the other hand, ad hoc CDMA network performance is severely limited by strong interferers, and for peer-to-peer communications the near-far effect problem cannot be mitigated through power control as in cellular systems. In this paper, we propose a location assisted routing solution to alleviate the near-far problem at the network level. The novelty of the solution resides in using a composite cost function for route optimization, which accounts for an estimate of the near-far effect generated by each relaying node. This estimate is determined based on node locations information. The tradeoff performance-complexity is investigated, and we show that a throughput improvement of up to 45% can be obtained using the new proposed near-far effect aware routing metric
{"title":"Location assisted routing for near-far effect mitigation in wireless networks","authors":"Hassan Mahmood, C. Comaniciu","doi":"10.1109/COLCOM.2005.1651254","DOIUrl":"https://doi.org/10.1109/COLCOM.2005.1651254","url":null,"abstract":"CDMA technology represents an attractive choice for various wireless ad hoc networks applications, due to its appealing properties, such as resistance to jamming and interference, low probability of intercept, and potential for energy savings. On the other hand, ad hoc CDMA network performance is severely limited by strong interferers, and for peer-to-peer communications the near-far effect problem cannot be mitigated through power control as in cellular systems. In this paper, we propose a location assisted routing solution to alleviate the near-far problem at the network level. The novelty of the solution resides in using a composite cost function for route optimization, which accounts for an estimate of the near-far effect generated by each relaying node. This estimate is determined based on node locations information. The tradeoff performance-complexity is investigated, and we show that a throughput improvement of up to 45% can be obtained using the new proposed near-far effect aware routing metric","PeriodicalId":365186,"journal":{"name":"2005 International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134557188","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 : 2005-12-19DOI: 10.1109/COLCOM.2005.1651215
J. Chan, V. Li, K. Lui
Peer-to-peer file sharing applications on the Internet, such as BitTorrent, Gnutella, etc., have been immensely popular prior research mainly focuses on peer and content discovery, overlay topology formation, fairness and incentive issues, etc, but seldom investigates the data distribution problem which is also a core component of any file sharing application. In this paper, we present the first effort in addressing this collaborative file distribution problem and formally define the scheduling problem in a simplified context. We suggest several types of algorithms, including a novel bipartite matching algorithm, for solving the problem. Simulation results show that our weighted bipartite algorithm finds an optimal solution for all cases tested. Therefore, we believe our algorithm is a promising solution to be employed as the core scheduling module in P2P file sharing applications, shortening the total download time experienced by users
{"title":"Scheduling algorithms for peer-to-peer collaborative file distribution","authors":"J. Chan, V. Li, K. Lui","doi":"10.1109/COLCOM.2005.1651215","DOIUrl":"https://doi.org/10.1109/COLCOM.2005.1651215","url":null,"abstract":"Peer-to-peer file sharing applications on the Internet, such as BitTorrent, Gnutella, etc., have been immensely popular prior research mainly focuses on peer and content discovery, overlay topology formation, fairness and incentive issues, etc, but seldom investigates the data distribution problem which is also a core component of any file sharing application. In this paper, we present the first effort in addressing this collaborative file distribution problem and formally define the scheduling problem in a simplified context. We suggest several types of algorithms, including a novel bipartite matching algorithm, for solving the problem. Simulation results show that our weighted bipartite algorithm finds an optimal solution for all cases tested. Therefore, we believe our algorithm is a promising solution to be employed as the core scheduling module in P2P file sharing applications, shortening the total download time experienced by users","PeriodicalId":365186,"journal":{"name":"2005 International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134020705","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 : 2005-12-19DOI: 10.1109/COLCOM.2005.1651248
Lorenzo Lazzari, M. Mari, A. Poggi
CAFE (collaborative agents for filtering e-mails) is a multi-agent system to collaboratively filter spam and classify legitimate messages in users' mail stream. CAFE associates a proxy agent with each user, and this agent represents a sort of interface between the user's e-mail client and the e-mail server. With the support of other types of agents, the proxy agent makes a classification of new messages into three categories: ham (good messages), spam and spam-presumed. Ham messages can be in their turn divided on the basis of the sender's identity and reputation. The reputation is collaboratively inferred from users' ratings. The filtering process is performed using three kinds of approach: a first approach based on the usage of an hash function, a static approach using DNSBL (DNS-based black lists) databases and a dynamic approach based on a Bayesian filter. We give a mathematical representation of the system, showing that if users collaborate, the fault probability decreases in proportion to the number of active users
CAFE (collaborative agents for filtering e-mail)是一个多代理系统，用于协同过滤垃圾邮件并对用户邮件流中的合法消息进行分类。CAFE为每个用户关联一个代理代理，该代理代表用户的电子邮件客户机和电子邮件服务器之间的某种接口。在其他类型代理的支持下，代理代理将新消息分为三类:ham(正常消息)、spam(垃圾邮件)和spam- suppose(垃圾邮件)。根据发送者的身份和声誉，可以对虚假信息进行分类。声誉是从用户的评分中协同推断出来的。过滤过程使用三种方法执行:第一种方法基于散列函数的使用，静态方法使用DNSBL(基于dns的黑名单)数据库，动态方法基于贝叶斯过滤器。我们给出了系统的数学表示，表明如果用户协作，故障概率与活跃用户数量成比例地降低
{"title":"A collaborative and multi-agent system for e-mail filtering and classification","authors":"Lorenzo Lazzari, M. Mari, A. Poggi","doi":"10.1109/COLCOM.2005.1651248","DOIUrl":"https://doi.org/10.1109/COLCOM.2005.1651248","url":null,"abstract":"CAFE (collaborative agents for filtering e-mails) is a multi-agent system to collaboratively filter spam and classify legitimate messages in users' mail stream. CAFE associates a proxy agent with each user, and this agent represents a sort of interface between the user's e-mail client and the e-mail server. With the support of other types of agents, the proxy agent makes a classification of new messages into three categories: ham (good messages), spam and spam-presumed. Ham messages can be in their turn divided on the basis of the sender's identity and reputation. The reputation is collaboratively inferred from users' ratings. The filtering process is performed using three kinds of approach: a first approach based on the usage of an hash function, a static approach using DNSBL (DNS-based black lists) databases and a dynamic approach based on a Bayesian filter. We give a mathematical representation of the system, showing that if users collaborate, the fault probability decreases in proportion to the number of active users","PeriodicalId":365186,"journal":{"name":"2005 International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114083340","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
扫码关注我们
求助内容：
应助结果提醒方式：