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

Random Structures & Algorithms最新文献

筛选
英文 中文
Perancangan Sistem Informasi Pendaftaran Peserta Ibadah Onsite Di GKI Serpong Dimasa Pandemi Berbasis Web 设计网站信息系统注册在GKI Serpong在网络大流行
IF 1 3区 数学
Random Structures & Algorithms Pub Date : 2022-09-15 DOI: 10.31253/algor.v4i1.1508
Sandy Yoan, Yakub Yakub
{"title":"Perancangan Sistem Informasi Pendaftaran Peserta Ibadah Onsite Di GKI Serpong Dimasa Pandemi Berbasis Web","authors":"Sandy Yoan, Yakub Yakub","doi":"10.31253/algor.v4i1.1508","DOIUrl":"https://doi.org/10.31253/algor.v4i1.1508","url":null,"abstract":"Semenjak adanya pandemi virus corona, kegiatan beribadah di GKI Serpong menjadi terbatas, termasuk terbatasnya jumlah jemaat yang bisa datang beribadah di gereja. Sedangkan untuk membatasi jumlah jemaat yang hadir, GKI Serpong menggunakan sistem pendaftaran dengan menggunakan Google Form. Sistem Google Form untuk pendaftaran yang digunakan tidak efektif dan efisien, dikarena fitur-fitur yang diberikan oleh Google Form terlalu sedikit, sehinga data jemaat yang dibutuhkan gereja sedikit. Maka perlu dibuatkan sebuah sistem yang jauh lebih baik dalam hal manfaat dalam penggunaannya. Dengan menggunakan metodologi penelitian model Waterfall (Air Terjun), merupakan paradigma rekayasa software yang paling banyak dipakai dan sudah berusia tua. Metode Waterfall mengusulkan pendekatan perkembangan perangkat lunak yang bersifat sistematik dan sekuensial yang dimulai pada tahapan dan kemajuan sistem pada seluruh analisis, desain perancangan, kode, pengujian, dan pemeliharaan. Dengan mengunakan metode Waterfall dalam perancangan sistem pendaftaran, maka sistem yang dibuat jauh lebih mudah dan terarah. Dengan adanya sistem pendaftaran ibadah onsite, GKI Serpong bisa dengan mudah memantau dan membatasi jemaat yang akan hadir ke gereja untuk beribadah, serta jemaat bisa datang lagi beribadah secara onsite di gereja dengan mendaftarkan diri mereka dengan mudah melalui sistem yang dibuat. Sistem yang dibuat juga dapat digunakan gereja untuk banyak event selain ibadah umum seperti ibadah anak, pemuda dan persekutuan yang lainnya di gereja.","PeriodicalId":54523,"journal":{"name":"Random Structures & Algorithms","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2022-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72655608","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
ANALISIS DAN IMPLEMENTASI SISTEM INFORMASI ENDORSEMENT BERBASIS WEB MENGGUNAKAN METODE MULTI ATTRIBUTE UTILITY THEORY (MAUT) 基于WEB的ENDORSEMENT信息系统的分析和实施使用多功能性理论(死)方法
IF 1 3区 数学
Random Structures & Algorithms Pub Date : 2022-09-15 DOI: 10.31253/algor.v4i1.1519
Kelvin Tarta Winaga, Tugiman Tugiman
{"title":"ANALISIS DAN IMPLEMENTASI SISTEM INFORMASI ENDORSEMENT BERBASIS WEB MENGGUNAKAN METODE MULTI ATTRIBUTE UTILITY THEORY (MAUT)","authors":"Kelvin Tarta Winaga, Tugiman Tugiman","doi":"10.31253/algor.v4i1.1519","DOIUrl":"https://doi.org/10.31253/algor.v4i1.1519","url":null,"abstract":"Influencer atau selebriti adalah kepribadian yang terkenal di masyarakat baik karena kredibilitas mereka atau daya tarik mereka atau karena keduanya. Untuk memanfaatkan ini, banyak pelaku usaha menggunakan jasa selebriti dalam iklan mereka untuk meningkatkan penjualan atau jasa. Tujuan penelitian ini adalah untuk merancang sistem pemesanan jasa endorsement terutama yang bergerak dikuliner berbasis web agar dapat membantu pengusaha kuliner yang kesulitan mencari pelanggan. Metode MAUT adalah suatu metode pemeriksaan kuantitatif yang umumnya menggabungkan berbagai proporsi biaya, bahaya, dan surplus. Hasil yang didapat dari metode tersebut ialah bagaimana endorser yang bernama Yohana Candra menduduki ranking pertama dengan nilai referensi 0.8421. Penulis menggunakan metode (User Acceptance Test) UAT untuk penilaian aplikasinya itu sendiri, dan hasilnya adalah responden sangat puas menggunakan aplikasi food endorsement dengan jawaban setuju adalah 52% lalu jawaban sangat setuju ialah 33%, sisanya yaitu jawaban cukup setuju, dan nol yang memberikan jawaban tidak setuju","PeriodicalId":54523,"journal":{"name":"Random Structures & Algorithms","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2022-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82986605","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
On the clique number of noisy random geometric graphs 噪声随机几何图的团数
IF 1 3区 数学
Random Structures & Algorithms Pub Date : 2022-08-22 DOI: 10.1002/rsa.21134
Matthew Kahle, Minghao Tian, Yusu Wang
{"title":"On the clique number of noisy random geometric graphs","authors":"Matthew Kahle, Minghao Tian, Yusu Wang","doi":"10.1002/rsa.21134","DOIUrl":"https://doi.org/10.1002/rsa.21134","url":null,"abstract":"Let Gn$$ {G}_n $$ be a random geometric graph, and then for q,p∈[0,1)$$ q,pin left[0,1right) $$ we construct a (q,p)$$ left(q,pright) $$ ‐perturbed noisy random geometric graph Gnq,p$$ {G}_n^{q,p} $$ where each existing edge in Gn$$ {G}_n $$ is removed with probability q$$ q $$ , while and each non‐existent edge in Gn$$ {G}_n $$ is inserted with probability p$$ p $$ . We give asymptotically tight bounds on the clique number ωGnq,p$$ omega left({G}_n^{q,p}right) $$ for several regimes of parameter.","PeriodicalId":54523,"journal":{"name":"Random Structures & Algorithms","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2022-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90136056","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
The number of bounded‐degree spanning trees 有界度生成树的数目
IF 1 3区 数学
Random Structures & Algorithms Pub Date : 2022-07-29 DOI: 10.1002/rsa.21118
R. Yuster
{"title":"The number of bounded‐degree spanning trees","authors":"R. Yuster","doi":"10.1002/rsa.21118","DOIUrl":"https://doi.org/10.1002/rsa.21118","url":null,"abstract":"For a graph G$$ G $$ , let ck(G)$$ {c}_k(G) $$ be the number of spanning trees of G$$ G $$ with maximum degree at most k$$ k $$ . For k≥3$$ kge 3 $$ , it is proved that every connected n$$ n $$ ‐vertex r$$ r $$ ‐regular graph G$$ G $$ with r≥nk+1$$ rge frac{n}{k+1} $$ satisfies ck(G)1/n≥(1−on(1))r·zk,$$ {c}_k{(G)}^{1/n}ge left(1-{o}_n(1)right)rcdotp {z}_k, $$where zk>0$$ {z}_k>0 $$ approaches 1 extremely fast (e.g., z10=0.999971$$ {z}_{10}=0.999971 $$ ). The minimum degree requirement is essentially tight as for every k≥2$$ kge 2 $$ there are connected n$$ n $$ ‐vertex r$$ r $$ ‐regular graphs G$$ G $$ with r=⌊n/(k+1)⌋−2$$ r=leftlfloor n/left(k+1right)rightrfloor -2 $$ for which ck(G)=0$$ {c}_k(G)=0 $$ . Regularity may be relaxed, replacing r$$ r $$ with the geometric mean of the degree sequence and replacing zk$$ {z}_k $$ with zk∗>0$$ {z}_k^{ast }>0 $$ that also approaches 1, as long as the maximum degree is at most n(1−(3+ok(1))lnk/k)$$ nleft(1-left(3+{o}_k(1)right)sqrt{ln k/k}right) $$ . The same holds with no restriction on the maximum degree as long as the minimum degree is at least nk(1+ok(1))$$ frac{n}{k}left(1+{o}_k(1)right) $$ .","PeriodicalId":54523,"journal":{"name":"Random Structures & Algorithms","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2022-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83945251","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
Heilbronn triangle‐type problems in the unit square [0,1]2 单位平方中的Heilbronn三角形型问题[0,1
IF 1 3区 数学
Random Structures & Algorithms Pub Date : 2022-07-25 DOI: 10.1002/rsa.21109
F. Benevides, C. Hoppen, H. Lefmann, Knut Odermann
{"title":"Heilbronn triangle‐type problems in the unit square [0,1]2","authors":"F. Benevides, C. Hoppen, H. Lefmann, Knut Odermann","doi":"10.1002/rsa.21109","DOIUrl":"https://doi.org/10.1002/rsa.21109","url":null,"abstract":"The Heilbronn triangle problem is a classical geometrical problem that asks for a placement of n$$ n $$ points in the unit square [0,1]2$$ {left[0,1right]}^2 $$ that maximizes the smallest area of a triangle formed by three of those points. This problem has natural generalizations. For an integer k≥3$$ kge 3 $$ and a set 𝒫 of n$$ n $$ points in [0,1]2$$ {left[0,1right]}^2 $$ , let Ak(𝒫) be the minimum area of the convex hull of k$$ k $$ points in 𝒫 . Here, instead of considering the supremum of Ak(𝒫) over all such choices of 𝒫 , we consider its average value, Δ˜k(n)$$ {tilde{Delta}}_k(n) $$ , when the n$$ n $$ points in 𝒫 are chosen independently and uniformly at random in [0,1]2$$ {left[0,1right]}^2 $$ . We prove that Δ˜k(n)=Θn−kk−2$$ {tilde{Delta}}_k(n)=Theta left({n}^{frac{-k}{k-2}}right) $$ , for every fixed k≥3$$ kge 3 $$ .","PeriodicalId":54523,"journal":{"name":"Random Structures & Algorithms","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2022-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79762642","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
Voter models on subcritical scale‐free random graphs 亚临界无标度随机图上的选民模型
IF 1 3区 数学
Random Structures & Algorithms Pub Date : 2022-07-23 DOI: 10.1002/rsa.21107
J. Fernley, Marcel Ortgiese
{"title":"Voter models on subcritical scale‐free random graphs","authors":"J. Fernley, Marcel Ortgiese","doi":"10.1002/rsa.21107","DOIUrl":"https://doi.org/10.1002/rsa.21107","url":null,"abstract":"The voter model is a classical interacting particle system modelling how consensus is formed across a network. We analyze the time to consensus for the voter model when the underlying graph is a subcritical scale‐free random graph. Moreover, we generalize the model to include a “temperature” parameter controlling how the graph influences the speed of opinion change. The interplay between the temperature and the structure of the random graph leads to a very rich phase diagram, where in the different phases different parts of the underlying geometry dominate the time to consensus. Finally, we also consider a discursive voter model, where voters discuss their opinions with their neighbors. Our proofs rely on the well‐known duality to coalescing random walks and a detailed understanding of the structure of the random graphs.","PeriodicalId":54523,"journal":{"name":"Random Structures & Algorithms","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2022-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85329357","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}
引用次数: 2
Expansion of random 0/1 polytopes 随机0/1多面体的展开
IF 1 3区 数学
Random Structures & Algorithms Pub Date : 2022-07-08 DOI: 10.1002/rsa.21184
Brett Leroux, Luis Rademacher
{"title":"Expansion of random 0/1 polytopes","authors":"Brett Leroux, Luis Rademacher","doi":"10.1002/rsa.21184","DOIUrl":"https://doi.org/10.1002/rsa.21184","url":null,"abstract":"A conjecture of Milena Mihail and Umesh Vazirani (Proc. 24th Annu. ACM Symp. Theory Comput., ACM, Victoria, BC, 1992, pp. 26–38.) states that the edge expansion of the graph of every polytope is at least one. Any lower bound on the edge expansion gives an upper bound for the mixing time of a random walk on the graph of the polytope. Such random walks are important because they can be used to generate an element from a set of combinatorial objects uniformly at random. A weaker form of the conjecture of Mihail and Vazirani says that the edge expansion of the graph of a polytope in is greater than one over some polynomial function of . This weaker version of the conjecture would suffice for all applications. Our main result is that the edge expansion of the graph of a random polytope in is at least with high probability.","PeriodicalId":54523,"journal":{"name":"Random Structures & Algorithms","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2022-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90923425","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
Cycle lengths in randomly perturbed graphs 随机摄动图中的周期长度
IF 1 3区 数学
Random Structures & Algorithms Pub Date : 2022-06-24 DOI: 10.1002/rsa.21170
Elad Aigner-Horev, Dan Hefetz, M. Krivelevich
{"title":"Cycle lengths in randomly perturbed graphs","authors":"Elad Aigner-Horev, Dan Hefetz, M. Krivelevich","doi":"10.1002/rsa.21170","DOIUrl":"https://doi.org/10.1002/rsa.21170","url":null,"abstract":"Let G$$ G $$ be an n$$ n $$ ‐vertex graph, where δ(G)≥δn$$ delta (G)ge delta n $$ for some δ:=δ(n)$$ delta := delta (n) $$ . A result of Bohman, Frieze and Martin from 2003 asserts that if α(G)=Oδ2n$$ alpha (G)=Oleft({delta}^2nright) $$ , then perturbing G$$ G $$ via the addition of ωlog(1/δ)δ3$$ omega left(frac{log left(1/delta right)}{delta^3}right) $$ random edges, a.a.s. yields a Hamiltonian graph. We prove several improvements and extensions of the aforementioned result. In particular, keeping the bound on α(G)$$ alpha (G) $$ as above and allowing for δ=Ω(n−1/3)$$ delta =Omega left({n}^{-1/3}right) $$ , we determine the correct order of magnitude of the number of random edges whose addition to G$$ G $$ a.a.s. yields a pancyclic graph. Moreover, we prove similar results for sparser graphs, and assuming the correctness of Chvátal's toughness conjecture, we handle graphs having larger independent sets. Finally, under milder conditions, we determine the correct order of magnitude of the number of random edges whose addition to G$$ G $$ a.a.s. yields a graph containing an almost spanning cycle.","PeriodicalId":54523,"journal":{"name":"Random Structures & Algorithms","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2022-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74130827","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}
引用次数: 4
A fourth‐moment phenomenon for asymptotic normality of monochromatic subgraphs 单色子图渐近正态性的一个四矩现象
IF 1 3区 数学
Random Structures & Algorithms Pub Date : 2022-05-09 DOI: 10.1002/rsa.21166
Sayan Das, Z. Himwich, Nitya Mani
{"title":"A fourth‐moment phenomenon for asymptotic normality of monochromatic subgraphs","authors":"Sayan Das, Z. Himwich, Nitya Mani","doi":"10.1002/rsa.21166","DOIUrl":"https://doi.org/10.1002/rsa.21166","url":null,"abstract":"Given a graph sequence {Gn}n≥1$$ {left{{G}_nright}}_{nge 1} $$ and a simple connected subgraph H$$ H $$ , we denote by T(H,Gn)$$ Tleft(H,{G}_nright) $$ the number of monochromatic copies of H$$ H $$ in a uniformly random vertex coloring of Gn$$ {G}_n $$ with c≥2$$ cge 2 $$ colors. We prove a central limit theorem for T(H,Gn)$$ Tleft(H,{G}_nright) $$ (we denote the appropriately centered and rescaled statistic as Z(H,Gn)$$ Zleft(H,{G}_nright) $$ ) with explicit error rates. The error rates arise from graph counts of collections formed by joining copies of H$$ H $$ which we call good joins. Good joins are closely related to the fourth moment of Z(H,Gn)$$ Zleft(H,{G}_nright) $$ , which allows us to show a fourth moment phenomenon for the central limit theorem. For c≥30$$ cge 30 $$ , we show that Z(H,Gn)$$ Zleft(H,{G}_nright) $$ converges in distribution to 𝒩(0,1) whenever its fourth moment converges to 3. We show the convergence of the fourth moment is necessary to obtain a normal limit when c≥2$$ cge 2 $$ .","PeriodicalId":54523,"journal":{"name":"Random Structures & Algorithms","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2022-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91143161","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
Independence number of hypergraphs under degree conditions 度条件下超图的独立数
IF 1 3区 数学
Random Structures & Algorithms Pub Date : 2022-05-05 DOI: 10.1002/rsa.21151
V. Rödl, M. Sales, Yi Zhao
{"title":"Independence number of hypergraphs under degree conditions","authors":"V. Rödl, M. Sales, Yi Zhao","doi":"10.1002/rsa.21151","DOIUrl":"https://doi.org/10.1002/rsa.21151","url":null,"abstract":"A well‐known result of Ajtai Komlós, Pintz, Spencer, and Szemerédi (J. Combin. Theory Ser. A 32 (1982), 321–335) states that every k$$ k $$ ‐graph H$$ H $$ on n$$ n $$ vertices, with girth at least five, and average degree tk−1$$ {t}^{k-1} $$ contains an independent set of size cn(logt)1/(k−1)/t$$ cn{left(log tright)}^{1/left(k-1right)}/t $$ for some c>0$$ c>0 $$ . In this paper we show that an independent set of the same size can be found under weaker conditions allowing certain cycles of length 2, 3, and 4. Our work is motivated by a problem of Lo and Zhao, who asked for k≥4$$ kge 4 $$ , how large of an independent set a k$$ k $$ ‐graph H$$ H $$ on n$$ n $$ vertices necessarily has when its maximum (k−2)$$ left(k-2right) $$ ‐degree Δk−2(H)≤dn$$ {Delta}_{k-2}(H)le dn $$ . (The corresponding problem with respect to (k−1)$$ left(k-1right) $$ ‐degrees was solved by Kostochka, Mubayi, and Verstraëte (Random Struct. & Algorithms 44 (2014), 224–239).) In this paper we show that every k$$ k $$ ‐graph H$$ H $$ on n$$ n $$ vertices with Δk−2(H)≤dn$$ {Delta}_{k-2}(H)le dn $$ contains an independent set of size cndloglognd1/(k−1)$$ c{left(frac{n}{d}mathrm{loglog}frac{n}{d}right)}^{1/left(k-1right)} $$ , and under additional conditions, an independent set of size cndlognd1/(k−1)$$ c{left(frac{n}{d}log frac{n}{d}right)}^{1/left(k-1right)} $$ . The former assertion gives a new upper bound for the (k−2)$$ left(k-2right) $$ ‐degree Turán density of complete k$$ k $$ ‐graphs.","PeriodicalId":54523,"journal":{"name":"Random Structures & Algorithms","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2022-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83050585","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学术官方微信