2016 IEEE/ACM 9th International Conference on Utility and Cloud Computing (UCC)最新文献

筛选
英文 中文
Attribute-Based Solution with Time Restriction Delegate for Flexible and Scalable Access Control in Cloud Storage 基于属性和时间限制的云存储访问控制解决方案
2016 IEEE/ACM 9th International Conference on Utility and Cloud Computing (UCC) Pub Date : 2016-12-06 DOI: 10.1145/2996890.3007851
Shoukun Wang, Kaigui Wu, Changze Wu
{"title":"Attribute-Based Solution with Time Restriction Delegate for Flexible and Scalable Access Control in Cloud Storage","authors":"Shoukun Wang, Kaigui Wu, Changze Wu","doi":"10.1145/2996890.3007851","DOIUrl":"https://doi.org/10.1145/2996890.3007851","url":null,"abstract":"The development of cloud computing has brought a lot of advantages, such as reducing the hardware cost and a more convenient storage solution. Because of the convenient and cheap storage solution, a large number of users put their valuable data onto the cloud. There have been more and more outsourcing data security and privacy issues. Several schemes using attribute-based encryption (ABE) have been proposed in cloud computing outsourcing data access control, However, most of them have stubborn in complex access control policy. To implement scalable, flexible and fine-grained access control in cloud storage, this paper proposes an attribute-based solution with time restriction delegate by extending the Ciphertext-policy attribute-based encryption (CP-ABE). This scheme not only realizes the scalability and fine-grained access control, but also gives a solution for the data delegate. Our delegate mechanism can let the users entrusted the data which in their visit range to others, and the ability to set a time limit. Finally, we prove the security of our scheme based on the security of the Ciphertext-policy attribute-based encryption (CP-ABE) by Bethencourt et al. and analyze its performance and computational complexity. Experiments for our scheme are implemented and the result shows that it is both efficient and flexible in dealing with access control for outsourced data in cloud computing.","PeriodicalId":350701,"journal":{"name":"2016 IEEE/ACM 9th International Conference on Utility and Cloud Computing (UCC)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125123845","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}
引用次数: 3
Enrichment of Machine Learning Based Activity Classification in Smart Homes Using Ensemble Learning 使用集成学习的智能家居中基于机器学习的活动分类的丰富
2016 IEEE/ACM 9th International Conference on Utility and Cloud Computing (UCC) Pub Date : 2016-12-06 DOI: 10.1145/2996890.3007861
Bikash Agarwal, Antorweep Chakravorty, T. Wiktorski, Chunming Rong
{"title":"Enrichment of Machine Learning Based Activity Classification in Smart Homes Using Ensemble Learning","authors":"Bikash Agarwal, Antorweep Chakravorty, T. Wiktorski, Chunming Rong","doi":"10.1145/2996890.3007861","DOIUrl":"https://doi.org/10.1145/2996890.3007861","url":null,"abstract":"Data streams from various Internet-Of-Things (IOT) enabled sensors in smart homes provide an opportunity to develop predictive models to offer actionable insights in form of preventive care to its residence. This becomes particularly relevant for Aging-In-Place (AIP) solutions for the care of the elderly. Over the last decade, diverse stakeholders from practice, industry, education, research, and professional organizations have collaborated to furnish homes with a variety of IOT enabled sensors to record daily activities of individuals. Machine Learning on such streams allows for detection of patterns and prediction of activities which enables preventive care. Behavior patterns that lead to preventive care constitute a series of activities. Accurate labeling of activities is an extremely time-consuming process and the resulting labels are often noisy and error prone. In this paper, we analyze the classification accuracy of various activities within a home using machine learning models. We present that the use of an ensemble model that combines multiple learning models allows to obtain better classification of activities than any of the constituent learning algorithms.","PeriodicalId":350701,"journal":{"name":"2016 IEEE/ACM 9th International Conference on Utility and Cloud Computing (UCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121070024","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}
引用次数: 11
Reducing Packet Delay through Filter Merging 通过Filter合并减少包延迟
2016 IEEE/ACM 9th International Conference on Utility and Cloud Computing (UCC) Pub Date : 2016-12-06 DOI: 10.1145/2996890.3007854
P. Comerford, John N. Davies, V. Grout
{"title":"Reducing Packet Delay through Filter Merging","authors":"P. Comerford, John N. Davies, V. Grout","doi":"10.1145/2996890.3007854","DOIUrl":"https://doi.org/10.1145/2996890.3007854","url":null,"abstract":"The use of packet filters has increased considerably due to the growth of Internet users and network services. A number of header fields must be examined by the filter, causing delay for each packet processed. The problem is compounded when considering multiple filters across a network. To maximize network performance, it would be desirable to minimize the number of packet filters for each path across a domain. Due to the interactions of rules between filters, the underlying network topology and the actions of dynamic routing protocols, it is computationally infeasible to implement this strategy by collectively considering all packet filters across the network. A simpler approach is the elimination of a filter by merging two filters on a common network segment. This work presents a novel packet filter merging algorithm using decision diagrams. A large number of practical and simulated experimental results are provided to demonstrate the effectiveness of the technique and possible enhancements are considered in the conclusion. The results show an average 20% performance improvement can be obtained using the technique.","PeriodicalId":350701,"journal":{"name":"2016 IEEE/ACM 9th International Conference on Utility and Cloud Computing (UCC)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126962420","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}
引用次数: 4
Program Autotuning as a Service: Opportunities and Challenges 程序自动调优即服务:机遇与挑战
2016 IEEE/ACM 9th International Conference on Utility and Cloud Computing (UCC) Pub Date : 2016-12-06 DOI: 10.1145/2996890.2996903
O. Sukhoroslov, Sergey Volkov, A. Afanasiev
{"title":"Program Autotuning as a Service: Opportunities and Challenges","authors":"O. Sukhoroslov, Sergey Volkov, A. Afanasiev","doi":"10.1145/2996890.2996903","DOIUrl":"https://doi.org/10.1145/2996890.2996903","url":null,"abstract":"Program autotuning is becoming an increasingly valuable tool for improving performance portability across diverse target architectures, exploring trade-offs between several criteria, or meeting quality of service requirements. Recent work on general autotuning frameworks enabled rapid development of domain-specific autotuners reusing common libraries of parameter types and search techniques. In this work we explore the use of such frameworks to develop general-purpose online services for program autotuning using the Software as a Service model. Beyond the common benefits of this model, the proposed approach opens up a number of unique opportunities, such as collecting performance data and utilizing it to improve further runs, or enabling remote online autotuning. However, the proposed autotuning as a service approach also brings in several challenges, such as accessing target systems, dealing with measurement latency, and supporting execution of user-provided code. This paper presents the first step towards implementing the proposed approach and addressing these challenges. We describe an implementation of generic autotuning service that can be used for tuning arbitrary programs on user-provided computing systems. The service is based on OpenTuner autotuning framework and runs on Everest platform that enables rapid development of computational web services. In contrast to OpenTuner, the service doesn't require installation of the framework, allows users to avoid writing code and supports efficient parallel execution of measurement tasks across multiple machines. The performance of the service is evaluated by using it for tuning synthetic and real programs.","PeriodicalId":350701,"journal":{"name":"2016 IEEE/ACM 9th International Conference on Utility and Cloud Computing (UCC)","volume":"138 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115898476","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}
引用次数: 0
Towards a Software Product Line-Based Approach to Adapt IaaS Cloud Configurations 基于软件产品线的方法来适应IaaS云配置
2016 IEEE/ACM 9th International Conference on Utility and Cloud Computing (UCC) Pub Date : 2016-12-06 DOI: 10.1145/2996890.3007893
Carlos Ruiz, H. Duran-Limon, N. Parlavantzas
{"title":"Towards a Software Product Line-Based Approach to Adapt IaaS Cloud Configurations","authors":"Carlos Ruiz, H. Duran-Limon, N. Parlavantzas","doi":"10.1145/2996890.3007893","DOIUrl":"https://doi.org/10.1145/2996890.3007893","url":null,"abstract":"Cloud computing is nowadays one of the most promising IT technologies, since it provides seemingly unlimited resources on demand at low costs. Hence, different types of applications have been migrated to IaaS environments, e.g. multi-tier (distributed) applications. However, in order to benefit from such characteristics, cloud configurations (i.e. virtual resource configurations) should be designed accordingly to the necessities of the applications. Furthermore, such configurations have to provide the required resources not only at the application deployment-time, but also during the whole application execution time. Hence, adaptive paradigms are required when designing solutions to cloud applications with dynamic resource requirements. Software Product Lines (SPLs) provide great flexibility and a high level of abstraction to describe complete system configurations. Even though SPLs are not commonly used to describe changes after an initial product (configuration) has been created, their inherent characteristics can enable producing the required virtual resource configuration to adapt applications after their initial deployment, i.e., at runtime. In this paper, we present an approach to create and adapt cloud configurations at the IaaS level by using SPLs. We focus on the architectural design of our solution as well as on the possible implementation challenges we could face.","PeriodicalId":350701,"journal":{"name":"2016 IEEE/ACM 9th International Conference on Utility and Cloud Computing (UCC)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117127922","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}
引用次数: 3
Resource Boxing: Converting Realistic Cloud Task Utilization Patterns for Theoretical Scheduling 资源装箱:将现实的云任务利用模式转换为理论调度
2016 IEEE/ACM 9th International Conference on Utility and Cloud Computing (UCC) Pub Date : 2016-12-06 DOI: 10.1145/2996890.2996897
B. Primas, P. Garraghan, K. Djemame, N. V. Shakhlevich
{"title":"Resource Boxing: Converting Realistic Cloud Task Utilization Patterns for Theoretical Scheduling","authors":"B. Primas, P. Garraghan, K. Djemame, N. V. Shakhlevich","doi":"10.1145/2996890.2996897","DOIUrl":"https://doi.org/10.1145/2996890.2996897","url":null,"abstract":"Scheduling is a core component within distributed systems to determine optimal allocation of tasks within servers. This is challenging within modern Cloud computing systems – comprising millions of tasks executing in thousands of heterogeneous servers. Theoretical scheduling is capable of providing complete and sophisticated algorithms towards a single objective function. However, Cloud computing systems pursue multiple and oftentimes conflicting objectives towards provisioning high levels of performance, availability, reliability and energy-efficiency. As a result, theoretical scheduling for Cloud computing is performed by simplifying assumptions for applicability. This is especially true for task utilization patterns, which fluctuate in practice yet are modelled as piecewise constant in theoretical scheduling models. While there exists work for modelling dynamic Cloud task patterns for evaluating applied scheduling, such models are incompatible with the inputs needed for theoretical scheduling – which require such patterns to be represented as boxes. Presently there exist no methods capable of accurately converting real task patterns derived from empirical data into boxes. This results in a significant gap towards theoreticians understanding and proposing algorithms derived from realistic assumptions towards enhanced Cloud scheduling. This work proposes resource boxing – an approach for automated conversion of realistic task patterns in Cloud computing directly into box-inputs for theoretical scheduling. We propose four resource conversion algorithms capable of accurately representing real task utilization patterns in the form of scheduling boxes. Algorithms were evaluated using production Cloud trace data, demonstrating a difference between real utilization and scheduling boxes less than 5%. We also provide an application for how resource boxing can be exploited to directly translate research from the applied community into the theoretical community.","PeriodicalId":350701,"journal":{"name":"2016 IEEE/ACM 9th International Conference on Utility and Cloud Computing (UCC)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126338888","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}
引用次数: 2
(t,p)-Threshold Point Function Secret Sharing Scheme Based on Polynomial Interpolation and Its Application 基于多项式插值的(t,p)-阈值点函数秘密共享方案及其应用
2016 IEEE/ACM 9th International Conference on Utility and Cloud Computing (UCC) Pub Date : 2016-12-06 DOI: 10.1145/2996890.3007871
Dazeng Yuan, Mingxing He, Shengke Zeng, Xiao Li, Long Lu
{"title":"(t,p)-Threshold Point Function Secret Sharing Scheme Based on Polynomial Interpolation and Its Application","authors":"Dazeng Yuan, Mingxing He, Shengke Zeng, Xiao Li, Long Lu","doi":"10.1145/2996890.3007871","DOIUrl":"https://doi.org/10.1145/2996890.3007871","url":null,"abstract":"Point function secret sharing(PFSS)was a special kind of function secret sharing(FSS)that was a special case of secret sharing, that the shared secret was a point function instead of a value. Motivated by the reason that the PFSS has very good application in the secure multi-party computations by investigating, and the existing PFSS scheme without threshold and inefficient. A new (t, p)–PFSS scheme based on polynomial interpolation was proposed, and this PFSS scheme is secure and efficient by analyzing the correctness, the security and the efficiency of the scheme, and is the first threshold PFSS scheme. Then an example was given to demonstrate scheme has effectiveness. Lastly, we respectively construct a (t, p)–threshold multi-server PIR and secure keyword search protocol, and a (t, p)–threshold incremental secret sharing protocol, both based on the proposed (t, p)–PFSS scheme, and simple analysis the correctness and the security of the first protocol.","PeriodicalId":350701,"journal":{"name":"2016 IEEE/ACM 9th International Conference on Utility and Cloud Computing (UCC)","volume":"268 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114606969","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}
引用次数: 5
My Ever Changing Moods: Sentiment-Based Event Detection on the Cloud 我不断变化的情绪:基于情绪的云事件检测
2016 IEEE/ACM 9th International Conference on Utility and Cloud Computing (UCC) Pub Date : 2016-12-06 DOI: 10.1145/2996890.2996898
R. Sinnott, Natasha Thomas, Himanshu Bansal, Zeyu Zhao
{"title":"My Ever Changing Moods: Sentiment-Based Event Detection on the Cloud","authors":"R. Sinnott, Natasha Thomas, Himanshu Bansal, Zeyu Zhao","doi":"10.1145/2996890.2996898","DOIUrl":"https://doi.org/10.1145/2996890.2996898","url":null,"abstract":"Twitter is a globally used micro-blogging platformwith hundreds of millions of tweets sent every day. Manyresearchers have explored Twitter analytics across a wide rangeof areas such as topic modeling, sentiment analysis, eventdetection, as well as the application of Twitter for a variety ofdomain-specific application areas, e.g. disaster management. Onearea that has not been explored is how changes in sentiment canbe used to identify events. In this paper we present a scalableCloud-based platform for harvesting, processing, analyzing andvisualizing large-scale Twitter data. We focus especially on howchanges in sentiment can be used to identify events in givencontexts. What is novel is that the events that are detected are notdependent explicitly on the topic of any given tweet, but entirelyon the change in sentiment. This offers new capabilities for eventdetection that have hitherto not been explored. To illustrate theapproach, we present case studies related to sporting eventsidentified entirely through changing sentiment with specific focuson the 2014 FIFA World Cup of Soccer and the 2015 World Cupof Cricket.","PeriodicalId":350701,"journal":{"name":"2016 IEEE/ACM 9th International Conference on Utility and Cloud Computing (UCC)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125164526","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}
引用次数: 4
Reducing the VM Rental Cost in the Cloud Spot Market 降低云现货市场虚拟机租赁成本
2016 IEEE/ACM 9th International Conference on Utility and Cloud Computing (UCC) Pub Date : 2016-12-06 DOI: 10.1145/2996890.3007892
Jianxiong Wan, Gefei Zhang, X. Gui, Ran Zhang
{"title":"Reducing the VM Rental Cost in the Cloud Spot Market","authors":"Jianxiong Wan, Gefei Zhang, X. Gui, Ran Zhang","doi":"10.1145/2996890.3007892","DOIUrl":"https://doi.org/10.1145/2996890.3007892","url":null,"abstract":"In this work, we propose a bidding policy for cloud users to reduce the instance rental bill by using the spot instance. Our approach is based on the recently developed two-timescale Lyapunov Optimization framework. It is shown that our approach is effective to save the instance rental cost.","PeriodicalId":350701,"journal":{"name":"2016 IEEE/ACM 9th International Conference on Utility and Cloud Computing (UCC)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117224471","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}
引用次数: 2
Enhancing Cloud Capabilities for SLA Enforcement of Cloud Scheduled Applications 为云计划应用程序的SLA实施增强云功能
2016 IEEE/ACM 9th International Conference on Utility and Cloud Computing (UCC) Pub Date : 2016-12-06 DOI: 10.1145/2996890.3007876
M. Ait-Idir, N. Agoulmine
{"title":"Enhancing Cloud Capabilities for SLA Enforcement of Cloud Scheduled Applications","authors":"M. Ait-Idir, N. Agoulmine","doi":"10.1145/2996890.3007876","DOIUrl":"https://doi.org/10.1145/2996890.3007876","url":null,"abstract":"Cloud computing has become in few years one of the major and important research direction and development area in IT (Information Technology) and Computer Science because of the implication of both technology teams (Engineers, Researchers, etc.) and Business Stakeholders in several and various domains (Health, Communication, Finance and so forth). Lot of IT infrastructure, assets and business processes are in migration road-map from traditional IT to the cloud model taking benefit from this new paradigm advantages to reduce their cost (CAPEX and OPEX), pay-peruse plan and improve QoS (Quality of Service). Workflows are part of a scheduled applications as a day-to-day tasks and operations required by regular business processes that expect to meet a specific QoS from an IT service providers. This assurance should be explicitly written in a SLA (Service Level Agreement) document signed by both parties (Cloud Client and Provider). Fulfillment of the contractual SLA is in the cloud provider responsibility while the cloud Consumer should respect the SLA terms. This guarantee, part of the SLA Management, in a workflow provisioning and execution involves the coordination and cooperation of many services and components, a specific configuration and accurate monitoring data. In this paper, we propose an integrated approach based on the concept of SLA Enforcement for workflow application, as a good example of scheduled applications, by enhancing involved tasks and cloud capability to guarantee the QoS monitoring at provisioning phase. A simple and robust model and algorithm are presented to illustrate the relevance of our approach.","PeriodicalId":350701,"journal":{"name":"2016 IEEE/ACM 9th International Conference on Utility and Cloud Computing (UCC)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129512134","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}
引用次数: 1
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学术官方微信