ACM Transactions on the Web最新文献

筛选
英文 中文
Introduction to the Special Issue on Advanced Graph Mining on the Web: Theory, Algorithms, and Applications: Part 2 网络高级图挖掘特刊简介:理论、算法和应用:第 2 部分
IF 3.5 4区 计算机科学
ACM Transactions on the Web Pub Date : 2024-01-08 DOI: 10.1145/3631941
Hao Peng, Jian Yang, Jia Wu, Philip S. Yu
{"title":"Introduction to the Special Issue on Advanced Graph Mining on the Web: Theory, Algorithms, and Applications: Part 2","authors":"Hao Peng, Jian Yang, Jia Wu, Philip S. Yu","doi":"10.1145/3631941","DOIUrl":"https://doi.org/10.1145/3631941","url":null,"abstract":"<p>No abstract available.</p>","PeriodicalId":50940,"journal":{"name":"ACM Transactions on the Web","volume":"83 1","pages":""},"PeriodicalIF":3.5,"publicationDate":"2024-01-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139397965","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
BNoteHelper: A Note-Based Outline Generation Tool for Structured Learning on Video Sharing Platforms BNoteHelper:基于笔记的提纲生成工具,用于视频共享平台上的结构化学习
IF 3.5 4区 计算机科学
ACM Transactions on the Web Pub Date : 2023-12-27 DOI: 10.1145/3638775
Fangyu Yu, Peng Zhang, Xianghua Ding, Tun Lu, Ning Gu
{"title":"BNoteHelper: A Note-Based Outline Generation Tool for Structured Learning on Video Sharing Platforms","authors":"Fangyu Yu, Peng Zhang, Xianghua Ding, Tun Lu, Ning Gu","doi":"10.1145/3638775","DOIUrl":"https://doi.org/10.1145/3638775","url":null,"abstract":"<p>Usually generated by ordinary users and often not particularly designed for learning, the videos on video sharing platforms are mostly not structured enough to support learning purposes, although they are increasingly leveraged for that. Most existing studies attempt to structure the video using video summarization techniques. However, these methods focus on extracting information from within the video and aiming to consume the video itself. In this paper, we design and implement BNoteHelper, a note-based video outline prototype which generates outline titles by extracting user-generated notes on Bilibili, using the BART model fine-tuned on a built dataset. As a browser plugin, BNoteHelper provides users with video overview and navigation as well as note-taking template, via two main features: outline table and navigation marker. The model and prototype are evaluated through automatic and human evaluations. The automatic evaluation reveals that, both before and after fine-tuning, the BART model outperforms T5-Pegasus in BLEU and Perplexity metrics. Also, the results from user feedback reveal that the generation outline sourced from notes is preferred by users than that sourced from video captions due to its more concise, clear, and accurate characteristics, but also too general with less details and diversities sometimes. Two features of the video outline are also found to have respective advantages specially in holistic and fine-grained aspects. Based on these results, we propose insights into designing a video summary from the user-generated creation perspective, customizing it based on video types, and strengthening the advantages of its different visual styles on video sharing platforms.</p>","PeriodicalId":50940,"journal":{"name":"ACM Transactions on the Web","volume":"64 1","pages":""},"PeriodicalIF":3.5,"publicationDate":"2023-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139053162","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Nudges to Mitigate Confirmation Bias during Web Search on Debated Topics: Support vs. Manipulation 在争议话题的网络搜索中减轻确认偏差的推动:支持与操纵
IF 3.5 4区 计算机科学
ACM Transactions on the Web Pub Date : 2023-11-30 DOI: 10.1145/3635034
Alisa Rieger, Tim Draws, Mariët Theune, Nava Tintarev
{"title":"Nudges to Mitigate Confirmation Bias during Web Search on Debated Topics: Support vs. Manipulation","authors":"Alisa Rieger, Tim Draws, Mariët Theune, Nava Tintarev","doi":"10.1145/3635034","DOIUrl":"https://doi.org/10.1145/3635034","url":null,"abstract":"<p>When people use web search engines to find information on debated topics, the search results they encounter can influence opinion formation and practical decision-making with potentially far-reaching consequences for the individual and society. However, current web search engines lack support for information-seeking strategies that enable responsible opinion formation, e.g., by mitigating confirmation bias and motivating engagement with diverse viewpoints. We conducted two preregistered user studies to test the benefits and risks of an intervention aimed at confirmation bias mitigation. In the first study, we tested the effect of warning labels, warning of the risk of confirmation bias, combined with obfuscations, hiding selected search results per default. We observed that obfuscations with warning labels effectively reduce engagement with search results. These initial findings did not allow conclusions about the extent to which the reduced engagement was caused by the warning label (reflective nudging element) versus the obfuscation (automatic nudging element). If obfuscation was the primary cause, this would raise concerns about harming user autonomy. We thus conducted a follow-up study to test the effect of warning labels and obfuscations separately. </p><p>According to our findings, obfuscations run the risk of manipulating behavior instead of guiding it, while warning labels without obfuscations (purely reflective) do not exhaust processing capacities but encourage users to actively choose to decrease engagement with attitude-confirming search results. Therefore, given the risks and unclear benefits of obfuscations and potentially other automatic nudging elements to guide engagement with information, we call for prioritizing interventions that aim to enhance human cognitive skills and agency instead.</p>","PeriodicalId":50940,"journal":{"name":"ACM Transactions on the Web","volume":"41 23","pages":""},"PeriodicalIF":3.5,"publicationDate":"2023-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138495113","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Bridging Performance of Twitter Users: A Predictor of Subjective Well-Being during the Pandemic Twitter用户的桥接性能:大流行期间主观幸福感的预测因子
IF 3.5 4区 计算机科学
ACM Transactions on the Web Pub Date : 2023-11-30 DOI: 10.1145/3635033
Ninghan Chen, Xihui Chen, Zhiqiang Zhong, Jun Pang
{"title":"Bridging Performance of Twitter Users: A Predictor of Subjective Well-Being during the Pandemic","authors":"Ninghan Chen, Xihui Chen, Zhiqiang Zhong, Jun Pang","doi":"10.1145/3635033","DOIUrl":"https://doi.org/10.1145/3635033","url":null,"abstract":"<p>The outbreak of the COVID-19 pandemic triggered the perils of misinformation over social media. By amplifying the spreading speed and popularity of trustworthy information, influential social media users have been helping overcome the negative impacts of such flooding misinformation. In this paper, we use the COVID-19 pandemic as a representative global health crisis and and examine the impact of the COVID-19 pandemic on these influential users’ subjective well-being (SWB), one of the most important indicators of mental health. We leverage Twitter as a representative social media platform and conduct the analysis with our collection of 37,281,824 tweets spanning almost two years. To identify influential Twitter users, we propose a new measurement called <i>user bridging performance</i> (UBM) to evaluate the speed and wideness gain of information transmission due to their sharing. With our tweet collection, we manage to reveal the more significant mental sufferings of influential users during the COVID-19 pandemic. According to this observation, through comprehensive <i>hierarchical multiple regression analysis</i>, we are the first to discover the <i>strong relationship</i> between individual social users’ subjective well-being and their bridging performance. We proceed to extend <i>bridging performance</i> from individuals to user subgroups. The new measurement allows us to conduct a subgroup analysis according to users’ multilingualism and confirm the bridging role of multilingual users in the COVID-19 information propagation. We also find that multilingual users not only suffer from a much lower SWB in the pandemic, but also experienced a more significant SWB drop.</p>","PeriodicalId":50940,"journal":{"name":"ACM Transactions on the Web","volume":"41 22","pages":""},"PeriodicalIF":3.5,"publicationDate":"2023-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138495114","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Multiresolution Local Spectral Attributed Community Search 多分辨率局部光谱属性社区搜索
4区 计算机科学
ACM Transactions on the Web Pub Date : 2023-11-03 DOI: 10.1145/3624580
Qingqing Li, Huifang Ma, Zhixin Li, Liang Chang
{"title":"Multiresolution Local Spectral Attributed Community Search","authors":"Qingqing Li, Huifang Ma, Zhixin Li, Liang Chang","doi":"10.1145/3624580","DOIUrl":"https://doi.org/10.1145/3624580","url":null,"abstract":"Community search has become especially important in graph analysis task, which aims to identify latent members of a particular community from a few given nodes. Most of the existing efforts in community search focus on exploring the community structure with a single scale in which the given nodes are located. Despite promising results, the following two insights are often neglected. First, node attributes provide rich and highly related auxiliary information apart from network interactions for characterizing the node properties. Attributes may indicate the community assignment of a node with very few links, which would be difficult to determine from the network structure alone. Second, the multiresolution community affords latent information to depict the hierarchical relation of the network and ensure that one of them is closest to the real one. It is essential for users to understand the underlying structure of the network and explore the community with strong structure and attribute cohesiveness at disparate scales. These aspects motivate us to develop a new community search framework called Multiresolution Local Spectral Attributed Community Search (MLSACS). Specifically, inspired by the local modularity, graph wavelets, and scaling functions, we propose a new Multiresolution Local modularity (MLQ) based on a reconstructed node attribute graph. Furthermore, to detect local communities with cohesive structures and attributes at different scales, a sparse indicator vector is developed based on MLQ by solving a linear programming problem. Extensive experimental results on both synthetic and real-world attributed graphs have demonstrated the detected communities are meaningful and the scale can be changed reasonably.","PeriodicalId":50940,"journal":{"name":"ACM Transactions on the Web","volume":"185 1‐6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135775908","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Triangle-oriented Community Detection considering Node Features and Network Topology 考虑节点特征和网络拓扑的面向三角形的社区检测
4区 计算机科学
ACM Transactions on the Web Pub Date : 2023-11-03 DOI: 10.1145/3626190
Guangliang Gao, Weichao Liang, Ming Yuan, Hanwei Qian, Qun Wang, Jie Cao
{"title":"Triangle-oriented Community Detection considering Node Features and Network Topology","authors":"Guangliang Gao, Weichao Liang, Ming Yuan, Hanwei Qian, Qun Wang, Jie Cao","doi":"10.1145/3626190","DOIUrl":"https://doi.org/10.1145/3626190","url":null,"abstract":"The joint use of node features and network topology to detect communities is called community detection in attributed networks. Most of the existing work along this line has been carried out through objective function optimization and has proposed numerous approaches. However, they tend to focus only on lower-order details, i.e., capture node features and network topology from node and edge views, and purely seek a higher degree of optimization to guarantee the quality of the found communities, which exacerbates unbalanced communities and free-rider effect. To further clarify and reveal the intrinsic nature of networks, we conduct triangle-oriented community detection considering node features and network topology. Specifically, we first introduce a triangle-based quality metric to preserve higher-order details of node features and network topology, and then formulate so-called two-level constraints to encode lower-order details of node features and network topology. Finally, we develop a local search framework based on optimizing our objective function consisting of the proposed quality metric and two-level constraints to achieve both non-overlapping and overlapping community detection in attributed networks. Extensive experiments demonstrate the effectiveness and efficiency of our framework and its potential in alleviating unbalanced communities and free-rider effect.","PeriodicalId":50940,"journal":{"name":"ACM Transactions on the Web","volume":"180 S451","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135775407","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Graph-Based Context-Aware Model to Understand Online Conversations 一个基于图的上下文感知模型来理解在线对话
4区 计算机科学
ACM Transactions on the Web Pub Date : 2023-11-03 DOI: 10.1145/3624579
Vibhor Agarwal, Anthony P. Young, Sagar Joglekar, Nishanth Sastry
{"title":"A Graph-Based Context-Aware Model to Understand Online Conversations","authors":"Vibhor Agarwal, Anthony P. Young, Sagar Joglekar, Nishanth Sastry","doi":"10.1145/3624579","DOIUrl":"https://doi.org/10.1145/3624579","url":null,"abstract":"Online forums that allow for participatory engagement between users have been transformative for the public discussion of many important issues. However, such conversations can sometimes escalate into full-blown exchanges of hate and misinformation. Existing approaches in natural language processing (NLP), such as deep learning models for classification tasks, use as inputs only a single comment or a pair of comments depending upon whether the task concerns the inference of properties of the individual comments or the replies between pairs of comments, respectively. However, in online conversations, comments and replies may be based on external context beyond the immediately relevant information that is input to the model. Therefore, being aware of the conversations’ surrounding contexts should improve the model’s performance for the inference task at hand. We propose GraphNLI , 1 a novel graph-based deep learning architecture that uses graph walks to incorporate the wider context of a conversation in a principled manner. Specifically, a graph walk starts from a given comment and samples “nearby” comments in the same or parallel conversation threads, which results in additional embeddings that are aggregated together with the initial comment’s embedding. We then use these enriched embeddings for downstream NLP prediction tasks that are important for online conversations. We evaluate GraphNLI on two such tasks - polarity prediction and misogynistic hate speech detection - and find that our model consistently outperforms all relevant baselines for both tasks. Specifically, GraphNLI with a biased root-seeking random walk performs with a macro- F 1 score of 3 and 6 percentage points better than the best-performing BERT-based baselines for the polarity prediction and hate speech detection tasks, respectively. We also perform extensive ablative experiments and hyperparameter searches to understand the efficacy of GraphNLI. This demonstrates the potential of context-aware models to capture the global context along with the local context of online conversations for these two tasks.","PeriodicalId":50940,"journal":{"name":"ACM Transactions on the Web","volume":"185 S499","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135775907","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
UNDERSTANDING RUG PULLS: AN IN-DEPTH BEHAVIORAL ANALYSIS OF FRAUDULENT NFT CREATORS 理解小伎俩:对欺诈性NFT创造者的深入行为分析
4区 计算机科学
ACM Transactions on the Web Pub Date : 2023-10-11 DOI: 10.1145/3623376
Trishie Sharma, Rachit Agarwal, Sandeep Kumar Shukla
{"title":"UNDERSTANDING RUG PULLS: AN IN-DEPTH BEHAVIORAL ANALYSIS OF FRAUDULENT NFT CREATORS","authors":"Trishie Sharma, Rachit Agarwal, Sandeep Kumar Shukla","doi":"10.1145/3623376","DOIUrl":"https://doi.org/10.1145/3623376","url":null,"abstract":"The explosive growth of non-fungible tokens (NFTs) on Web3 has created a new frontier for digital art and collectibles and an emerging space for fraudulent activities. This study provides an in-depth analysis of NFT rug pulls, the fraudulent schemes that steal investors’ funds. From a curated dataset of 760 rug pulls across 10 NFT marketplaces, we examine these schemes’ structural and behavioral properties, identify the characteristics and motivations of rug pullers, and classify NFT projects into 20 groups based on creators’ association with their accounts. Our findings reveal that repeated rug pulls account for a significant proportion of the rise in NFT-related cryptocurrency crimes, with one NFT creator attempting 37 rug pulls within 3 months. Additionally, we identify the largest group of creators influencing the majority of rug pulls and demonstrate the connection between rug pullers of different NFT projects using the same wallets to store and move money. Our study contributes to understanding NFT market risks and provides insights for designing preventative strategies to mitigate future losses.","PeriodicalId":50940,"journal":{"name":"ACM Transactions on the Web","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136057942","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Adoption of Recurrent Innovations: A Large-Scale Case Study on Mobile App Updates 采用循环创新:手机应用更新的大规模案例研究
4区 计算机科学
ACM Transactions on the Web Pub Date : 2023-10-10 DOI: 10.1145/3626189
Fuqi Lin, Xuan Lu, Wei Ai, Huoran Li, Yun Ma, Yulian Yang, Hongfei Deng, Qingxiang Wang, Qiaozhu Mei, Xuanzhe Liu
{"title":"Adoption of Recurrent Innovations: A Large-Scale Case Study on Mobile App Updates","authors":"Fuqi Lin, Xuan Lu, Wei Ai, Huoran Li, Yun Ma, Yulian Yang, Hongfei Deng, Qingxiang Wang, Qiaozhu Mei, Xuanzhe Liu","doi":"10.1145/3626189","DOIUrl":"https://doi.org/10.1145/3626189","url":null,"abstract":"The diffusion of innovations theory has been studied for years. Previous research efforts mainly focus on key elements, adopter categories, and the process of innovation diffusion. However, most of them only consider single innovations. With the development of modern technology, recurrent innovations gradually come into vogue. In order to reveal the characteristics of recurrent innovations, we present the first large-scale analysis of the adoption of recurrent innovations in the context of mobile app updates. Our analysis reveals the adoption behavior and new adopter categories of recurrent innovations as well as the features that have impact on the process of adoption.","PeriodicalId":50940,"journal":{"name":"ACM Transactions on the Web","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136352925","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
CLHHN: Category-aware Lossless Heterogeneous Hypergraph Neural Network for Session-based Recommendation 基于会话推荐的类别感知无损异构超图神经网络
4区 计算机科学
ACM Transactions on the Web Pub Date : 2023-10-04 DOI: 10.1145/3626569
Yutao Ma, Zesheng Wang, Liwei Huang, Jian Wang
{"title":"CLHHN: Category-aware Lossless Heterogeneous Hypergraph Neural Network for Session-based Recommendation","authors":"Yutao Ma, Zesheng Wang, Liwei Huang, Jian Wang","doi":"10.1145/3626569","DOIUrl":"https://doi.org/10.1145/3626569","url":null,"abstract":"In recent years, session-based recommendation (SBR), which seeks to predict the target user’s next click based on anonymous interaction sequences, has drawn increasing interest for its practicality. The key to completing the SBR task is modeling user intent accurately. Due to the popularity of graph neural networks (GNNs), most state-of-the-art (SOTA) SBR approaches attempt to model user intent from the transitions among items in a session with GNNs. Despite their accomplishments, there are still two limitations. Firstly, most existing SBR approaches utilize limited information from short user-item interaction sequences and suffer from the data sparsity problem of session data. Secondly, most GNN-based SBR approaches describe pairwise relations between items while neglecting complex and high-order data relations. Although some recent studies based on hypergraph neural networks (HGNNs) have been proposed to model complex and high-order relations, they usually output unsatisfactory results due to insufficient relation modeling and information loss. To this end, we propose a category-aware lossless heterogeneous hypergraph neural network (CLHHN) in this article to recommend possible items to the target users by leveraging the category of items. More specifically, we convert each category-aware session sequence with repeated user clicks into a lossless heterogeneous hypergraph consisting of item and category nodes as well as three types of hyperedges, each of which can capture specific relations to reflect various user intents. Then, we design an attention-based lossless hypergraph convolutional network to generate session-wise and multi-granularity intent-aware item representations. Experiments on three real-world datasets indicate that CLHHN can outperform the SOTA models in making a better trade-off between prediction performance and training efficiency. An ablation study also demonstrates the necessity of CLHHN’s key components.","PeriodicalId":50940,"journal":{"name":"ACM Transactions on the Web","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135645181","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信