发布求助
文献互助 智能选刊 最新文献

Random Structures & Algorithms最新文献

筛选
英文 中文
PEMANFAATAN LOCATION BASED SERVICE PADA WEBSITE RESERVASI PARKIR DENGAN MENGGUNAKAN ALGORITMA A* 使用基于“A*算法”的停车预订网站的位置服务
IF 1 3区 数学
Random Structures & Algorithms Pub Date : 2021-09-27 DOI: 10.31253/algor.v3i1.697
J. Ang, Dicky Septa Surya Putra
{"title":"PEMANFAATAN LOCATION BASED SERVICE PADA WEBSITE RESERVASI PARKIR DENGAN MENGGUNAKAN ALGORITMA A*","authors":"J. Ang, Dicky Septa Surya Putra","doi":"10.31253/algor.v3i1.697","DOIUrl":"https://doi.org/10.31253/algor.v3i1.697","url":null,"abstract":"Teknologi berkembang dengan pesat seiring berjalannya waktu. Perkembangan teknologi ini memberikan banyak dampak bagi manusia. Manusia juga dituntut untuk lebih kreatif dan bijaksana dalam menghadapi perkembangan teknologi ini. Dengan berkembangnya teknologi berkembang pula permasalahan yang dihadapi manusia. Salah satunya adalah berkembangnya kebutuhan akan fasilitas khususnya parkir. Seringkali manusia merasa kesulitan dan membutuhkan waktu yang cukup lama untuk mencari lokasi parkir. Berdasarkan permasalahan diatas maka diperlukan aplikasi yang dapat mencarikan lokasi parkir secara otomatis, dan tentunya membantu manusia untuk menemukan lokasi parkir tersebut. Aplikasi ini memerlukan bantuan dari google maps API untuk membantu memberikan gambaran dari lokasi parkir yang telah ditentukan oleh sistem. Hasil akhir yang diperoleh adalah sebuah sistem untuk menemukan lokasi parkir terdekat dan menunjukan letak serta arah/rute untuk mencapai lokasi parkir tersebut khususnya lokasi parkir yang terdapat di Apartment Permata Surya 1.","PeriodicalId":54523,"journal":{"name":"Random Structures & Algorithms","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2021-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81126870","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Penerapan Data Mining Pada Penjualan Pakaian Brand Expand Dengan Algoritma Apriori Menggunakan Metode Association Rules PT. Vidiaelok Lestari Garmindo 挖掘数据应用于杏色算法的杏色套装销售
IF 1 3区 数学
Random Structures & Algorithms Pub Date : 2021-09-27 DOI: 10.31253/algor.v3i1.647
Benny Lienata, Indah Fenriana, Andre Andre, R. Safitri
{"title":"Penerapan Data Mining Pada Penjualan Pakaian Brand Expand Dengan Algoritma Apriori Menggunakan Metode Association Rules PT. Vidiaelok Lestari Garmindo","authors":"Benny Lienata, Indah Fenriana, Andre Andre, R. Safitri","doi":"10.31253/algor.v3i1.647","DOIUrl":"https://doi.org/10.31253/algor.v3i1.647","url":null,"abstract":"Pada era saat ini kebutuhan masyarakat terhadap pakaian semakin meningkat dalam kasus ini yang dibutuhkan masyarakat adalah pakaian yang nyaman, dan mampu melindungi kulit dan tubuh manusia. Banyaknya persaingan dalam dunia bisnis khususnya dalam industri penjualan pakaian, menuntut para pengembang untuk menemukan suatu strategi yang dapat meningkatkan penjualan dan pemasaran produk yang dijual, salah satunya adalah dengan pemanfaatan data penjualan produk pakaian dengan salah satu teknik data mining, yaitu asosiasi. PT. Vidiaelok Lestari Garmindo adalah salah satu perusahaan yang rutin melakukan pencatatan data transaksi penjualan. Data tersebut dapat digunakan untuk menganalisa produk mana yang paling laku terjual yang dapat digunakan untuk kebutuhan strategi pemasaran atau promosi. Proses menganalisa produk mana yang paling laku terjual yang dilakukan secara manual tentu akan membutuhkan waktu dan tenaga yang lebih besar. Oleh karena itu, maka dilakukan penelitian serta perancangan sebuah aplikasi yang dapat mengetahui produk mana yang paling laku terjual dengan menggunakan metode asosiasi, serta menggunakan apriori sebagai algoritmanya. Tujuan dari penelitian ini adalah melakukan implementasi aturan asosiasi dengan algoritma apriori ke dalam sebuah aplikasi berbasis web yang diharapkan dapat membantu PT. Vidiaelok Lestari Garmindo dalam mengetahui produk mana yang paling laku terjual. Aplikasi berbasis web yang dihasilkan melakukan analisa produk yang paling banyak terjual dari data transaksi yang dimasukkan, selain itu pengguna dapat menentukan rentang tanggal pada data yang ingin dianalisa, serta minimum support dan minimum confidence yang diinginkan guna menentukkan strategi pemasaran agar produk yang lain dapat bersaing dengan kompetitor lainnya.","PeriodicalId":54523,"journal":{"name":"Random Structures & Algorithms","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2021-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88087344","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
IDENTIFIKASI PENYALAHGUNAAN JALUR SMS MARKETING DENGAN KONTEN SMS PREMIUM PADA PT DIAN PRIMA JAYARAYA DENGAN ALGORITMA NAIVE BAYES
IF 1 3区 数学
Random Structures & Algorithms Pub Date : 2021-09-27 DOI: 10.31253/algor.v3i1.658
William kohin Cikutra, S. Hariyanto, E. Kusuma, Raditya Rimbawan Oprasto
{"title":"IDENTIFIKASI PENYALAHGUNAAN JALUR SMS MARKETING DENGAN KONTEN SMS PREMIUM PADA PT DIAN PRIMA JAYARAYA DENGAN ALGORITMA NAIVE BAYES","authors":"William kohin Cikutra, S. Hariyanto, E. Kusuma, Raditya Rimbawan Oprasto","doi":"10.31253/algor.v3i1.658","DOIUrl":"https://doi.org/10.31253/algor.v3i1.658","url":null,"abstract":"","PeriodicalId":54523,"journal":{"name":"Random Structures & Algorithms","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2021-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82688376","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
PENERAPAN DASHBOARD BUSINESS INTELLIGENCE UNTUK MENAMPILKAN FUNDAMENTAL SAHAM LQ45
IF 1 3区 数学
Random Structures & Algorithms Pub Date : 2021-09-27 DOI: 10.31253/algor.v3i1.768
Khanti Kusuma Dewi, Aditiya Hermawan, L. Kusuma
{"title":"PENERAPAN DASHBOARD BUSINESS INTELLIGENCE UNTUK MENAMPILKAN FUNDAMENTAL SAHAM LQ45","authors":"Khanti Kusuma Dewi, Aditiya Hermawan, L. Kusuma","doi":"10.31253/algor.v3i1.768","DOIUrl":"https://doi.org/10.31253/algor.v3i1.768","url":null,"abstract":"Pada saat ini investai berkembang dengan pesat di khalayak orang banyak. Melalui investasi seseorang akan mendapatkan passive income, ada berbagai macam investasi yang ada di Indonesia, salah satunya adalah investasi saham. Dalam berinvestasi tidak bisa saham seseorang untuk berinvestasi dan menentukan mana yang akan dibeli oleh kita, orang yang akan berinvestasi atau bisa dibilang seorang investor. Dalam berinvestasi ada beberapa hal yang perlu diperhatikan dalam menentukan saham yang akan dibeli. Hal yang perlu diperhatikan dalam memilih saham perusahaan adalah dengan melakukan analisis fundamental saham pada perusahaan tertentu. Namun dalam menganalisis fundamental saham yang cukup memerlukan waktu yang lebih panjang. Untuk memudahkan investor membaca fundamental saham perusahaan tertentu yang akan diinvestasikan, maka dibuatlah Dashboard dengan menerapkan Business Intelligence menggunakan Single Page Application agar seorang investor mudah, cepat dan tepat mengambil keputusan dalam berinvestasi di pasar saham. Hasil yang diharapkan dari penelitian ini yaitu agar memudahkan seorang investor dalam menganalisis Kembali saham yang akan dibeli.","PeriodicalId":54523,"journal":{"name":"Random Structures & Algorithms","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2021-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84210473","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Approximately counting independent sets in bipartite graphs via graph containers 利用图容器对二部图中的独立集进行近似计数
IF 1 3区 数学
Random Structures & Algorithms Pub Date : 2021-09-08 DOI: 10.1002/rsa.21145
Matthew Jenssen, Will Perkins, Aditya Potukuchi
{"title":"Approximately counting independent sets in bipartite graphs via graph containers","authors":"Matthew Jenssen, Will Perkins, Aditya Potukuchi","doi":"10.1002/rsa.21145","DOIUrl":"https://doi.org/10.1002/rsa.21145","url":null,"abstract":"By implementing algorithmic versions of Sapozhenko's graph container methods, we give new algorithms for approximating the number of independent sets in bipartite graphs. Our first algorithm applies to d$$ d $$ ‐regular, bipartite graphs satisfying a weak expansion condition: when d$$ d $$ is constant, and the graph is a bipartite Ω(log2d/d)$$ Omega left({log}^2d/dright) $$ ‐expander, we obtain an FPTAS for the number of independent sets. Previously such a result for d>5$$ d>5 $$ was known only for graphs satisfying the much stronger expansion conditions of random bipartite graphs. The algorithm also applies to weighted independent sets: for a d$$ d $$ ‐regular, bipartite α$$ alpha $$ ‐expander, with α>0$$ alpha >0 $$ fixed, we give an FPTAS for the hard‐core model partition function at fugacity λ=Ω(logd/d1/4)$$ lambda =Omega left(log d/{d}^{1/4}right) $$ . Finally we present an algorithm that applies to all d$$ d $$ ‐regular, bipartite graphs, runs in time expOn·log3dd$$ exp left(Oleft(ncdotp frac{log^3d}{d}right)right) $$ , and outputs a (1+o(1))$$ left(1+o(1)right) $$ ‐approximation to the number of independent sets.","PeriodicalId":54523,"journal":{"name":"Random Structures & Algorithms","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2021-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76321074","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 10
Covering random graphs with monochromatic trees 用单色树覆盖随机图
IF 1 3区 数学
Random Structures & Algorithms Pub Date : 2021-09-06 DOI: 10.1002/rsa.21120
Domagoj Bradac, M. Buci'c
{"title":"Covering random graphs with monochromatic trees","authors":"Domagoj Bradac, M. Buci'c","doi":"10.1002/rsa.21120","DOIUrl":"https://doi.org/10.1002/rsa.21120","url":null,"abstract":"Given an r$$ r $$ ‐edge‐colored complete graph Kn$$ {K}_n $$ , how many monochromatic connected components does one need in order to cover its vertex set? This natural question is a well‐known essentially equivalent formulation of the classical Ryser's conjecture which, despite a lot of attention over the last 50 years, still remains open. A number of recent papers consider a sparse random analogue of this question, asking for the minimum number of monochromatic components needed to cover the vertex set of an r$$ r $$ ‐edge‐colored random graph 𝒢(n,p) . Recently, Bucić, Korándi, and Sudakov established a connection between this problem and a certain Helly‐type local to global question for hypergraphs raised about 30 years ago by Erdős, Hajnal, and Tuza. We identify a modified version of the hypergraph problem which controls the answer to the problem of covering random graphs with monochromatic components more precisely. To showcase the power of our approach, we essentially resolve the 3‐color case by showing that (logn/n)1/4$$ {left(log n/nright)}^{1/4} $$ is a threshold at which point three monochromatic components are needed to cover all vertices of a 3‐edge‐colored random graph, answering a question posed by Kohayakawa, Mendonça, Mota, and Schülke. Our approach also allows us to determine the answer in the general r$$ r $$ ‐edge colored instance of the problem, up to lower order terms, around the point when it first becomes bounded, answering a question of Bucić, Korándi, and Sudakov.","PeriodicalId":54523,"journal":{"name":"Random Structures & Algorithms","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2021-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73781965","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Corrigendum to “Online purchasing under uncertainty” “不确定性下的网上购物”的勘误表
IF 1 3区 数学
Random Structures & Algorithms Pub Date : 2021-09-01 DOI: 10.1002/rsa.21012
A. Frieze
{"title":"Corrigendum to “Online purchasing under uncertainty”","authors":"A. Frieze","doi":"10.1002/rsa.21012","DOIUrl":"https://doi.org/10.1002/rsa.21012","url":null,"abstract":"In “Online purchasing under uncertainty” we proved theorems concerning the cost of purchasing var-ious combinatorial structures (paths, cycles, etc.) in graphs with randomly weighted edges, which are examined and either purchased or discarded one-at-a-time by the purchaser. We discussed three models (POM, ROM, AOM) according to whether the edges were presented in a purchaser-selected order, a random order, or an (adaptive) adversarially selected order. The statements of Theorems 1.6–1.11 claim O(1) upper bounds in all three models but the proofs presented apply only to the ROM and POM models; as such we withdraw the claims of the AOM upper bounds from these results.","PeriodicalId":54523,"journal":{"name":"Random Structures & Algorithms","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87968921","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Self‐avoiding walk on the hypercube 在超立方体上自我避免行走
IF 1 3区 数学
Random Structures & Algorithms Pub Date : 2021-08-08 DOI: 10.1002/rsa.21117
G. Slade
{"title":"Self‐avoiding walk on the hypercube","authors":"G. Slade","doi":"10.1002/rsa.21117","DOIUrl":"https://doi.org/10.1002/rsa.21117","url":null,"abstract":"We study the number cn(N)$$ {c}_n^{(N)} $$ of n$$ n $$ ‐step self‐avoiding walks on the N$$ N $$ ‐dimensional hypercube, and identify an N$$ N $$ ‐dependent connective constant μN$$ {mu}_N $$ and amplitude AN$$ {A}_N $$ such that cn(N)$$ {c}_n^{(N)} $$ is O(μNn)$$ Oleft({mu}_N^nright) $$ for all n$$ n $$ and N$$ N $$ , and is asymptotically ANμNn$$ {A}_N{mu}_N^n $$ as long as n≤2pN$$ nle {2}^{pN} $$ for any fixed p<12$$ p<frac{1}{2} $$ . We refer to the regime n≪2N/2$$ nll {2}^{N/2} $$ as the dilute phase. We discuss conjectures concerning different behaviors of cn(N)$$ {c}_n^{(N)} $$ when n$$ n $$ reaches and exceeds 2N/2$$ {2}^{N/2} $$ , corresponding to a critical window and a dense phase. In addition, we prove that the connective constant has an asymptotic expansion to all orders in N−1$$ {N}^{-1} $$ , with integer coefficients, and we compute the first five coefficients μN=N−1−N−1−4N−2−26N−3+O(N−4)$$ {mu}_N=N-1-{N}^{-1}-4{N}^{-2}-26{N}^{-3}+Oleft({N}^{-4}right) $$ . The proofs are based on generating function and Tauberian methods implemented via the lace expansion, for which an introductory account is provided.","PeriodicalId":54523,"journal":{"name":"Random Structures & Algorithms","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2021-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77273697","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Site percolation on pseudo‐random graphs 伪随机图上的站点渗透
IF 1 3区 数学
Random Structures & Algorithms Pub Date : 2021-07-28 DOI: 10.1002/rsa.21141
Sahar Diskin, M. Krivelevich
{"title":"Site percolation on pseudo‐random graphs","authors":"Sahar Diskin, M. Krivelevich","doi":"10.1002/rsa.21141","DOIUrl":"https://doi.org/10.1002/rsa.21141","url":null,"abstract":"We consider vertex percolation on pseudo‐random d$$ d $$ ‐regular graphs. The previous study by the second author established the existence of phase transition from small components to a linear (in nd$$ frac{n}{d} $$ ) sized component, at p=1d$$ p=frac{1}{d} $$ . In the supercritical regime, our main result recovers the sharp asymptotic of the size of the largest component, and shows that all other components are typically much smaller. Furthermore, we consider other typical properties of the largest component such as the number of edges, existence of a long cycle and expansion. In the subcritical regime, we strengthen the upper bound on the likely component size.","PeriodicalId":54523,"journal":{"name":"Random Structures & Algorithms","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2021-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78711878","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
PENERAPAN METODE SIMPLE ADDITIVE WEIGHTING (SAW) DALAM PERANCANGAN APLIKASI PEMILIHAN PASANGAN BERBASIS WEB
IF 1 3区 数学
Random Structures & Algorithms Pub Date : 2021-07-15 DOI: 10.31253/algor.v2i2.545
Chrisantus Robert William Resi, Yusuf Kurnia, Hartana Wijaya, Dera Susilawati
{"title":"PENERAPAN METODE SIMPLE ADDITIVE WEIGHTING (SAW) DALAM PERANCANGAN APLIKASI PEMILIHAN PASANGAN BERBASIS WEB","authors":"Chrisantus Robert William Resi, Yusuf Kurnia, Hartana Wijaya, Dera Susilawati","doi":"10.31253/algor.v2i2.545","DOIUrl":"https://doi.org/10.31253/algor.v2i2.545","url":null,"abstract":"As social beings, humans have a desire to socialize, to build deeper relationships with individuals they like, and  also to get a spouse according to the criteria they like. However, there are often obstacles in finding a spouse, one of which is due to being too busy and an increasing workload. Luckily we live in an era of technology that makes it easier for us to interact with other people. The spouse selection application itself is quite common for several circles in Indonesia, but some of these applications are considered not fully providing services to recommend a spouse based on the criteria. Therefore, it is necessary to design an application that helps users find a spouse according to the criteria they like. In this application, the Simple Additive Weighting (SAW) method will be used to process data. The SAW method itself has the ability to find optimal alternatives from a number of alternatives with certain criteria.","PeriodicalId":54523,"journal":{"name":"Random Structures & Algorithms","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2021-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82236126","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"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学术官方微信