Applied Mathematics and Computation最新文献

筛选
英文 中文
A modulus-based framework for weighted horizontal linear complementarity problems
IF 3.5 2区 数学
Applied Mathematics and Computation Pub Date : 2025-01-23 DOI: 10.1016/j.amc.2025.129313
Francesco Mezzadri
{"title":"A modulus-based framework for weighted horizontal linear complementarity problems","authors":"Francesco Mezzadri","doi":"10.1016/j.amc.2025.129313","DOIUrl":"10.1016/j.amc.2025.129313","url":null,"abstract":"<div><div>We develop a modulus-based framework to solve weighted horizontal linear complementarity problems (WHLCPs). First, we reformulate the WHLCP as a modulus-based system whose solution, in general, is not unique. We characterize the solutions by discussing their sign pattern and how they are linked to one another. After this analysis, we exploit the modulus-based formulation to develop new solution methods. In particular, we present a non-smooth Newton iteration and a matrix splitting method for solving WHLCPs. We prove the local convergence of both methods under some assumptions. Finally, we solve numerical experiments involving symmetric and non-symmetric matrices. In this context, we compare our approaches with a recently proposed smoothing Newton's method. The experiments include problems taken from the literature. We also provide numerical insights on relevant parts of the algorithms, such as convergence, attraction basin, and starting iterate.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"495 ","pages":"Article 129313"},"PeriodicalIF":3.5,"publicationDate":"2025-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143035317","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A note on sequences variant of irregularity strength for hypercubes
IF 3.5 2区 数学
Applied Mathematics and Computation Pub Date : 2025-01-23 DOI: 10.1016/j.amc.2025.129312
Anna Flaszczyńska, Aleksandra Gorzkowska, Mariusz Woźniak
{"title":"A note on sequences variant of irregularity strength for hypercubes","authors":"Anna Flaszczyńska,&nbsp;Aleksandra Gorzkowska,&nbsp;Mariusz Woźniak","doi":"10.1016/j.amc.2025.129312","DOIUrl":"10.1016/j.amc.2025.129312","url":null,"abstract":"<div><div>Let <span><math><mi>f</mi><mo>:</mo><mi>E</mi><mo>→</mo><mo>{</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mo>…</mo><mo>,</mo><mi>k</mi><mo>}</mo></math></span> be an edge-coloring of the <em>n</em>-dimension hypercube <span><math><msub><mrow><mi>H</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span>. By the palette at a vertex <em>v</em> we mean the sequence <span><math><mo>(</mo><mi>f</mi><mo>(</mo><msub><mrow><mi>e</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>(</mo><mi>v</mi><mo>)</mo><mo>)</mo><mo>,</mo><mi>f</mi><mo>(</mo><msub><mrow><mi>e</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>(</mo><mi>v</mi><mo>)</mo><mo>)</mo><mo>,</mo><mo>…</mo><mo>,</mo><mi>f</mi><mo>(</mo><msub><mrow><mi>e</mi></mrow><mrow><mi>n</mi></mrow></msub><mo>(</mo><mi>v</mi><mo>)</mo><mo>)</mo><mo>)</mo></math></span>, where <span><math><msub><mrow><mi>e</mi></mrow><mrow><mi>i</mi></mrow></msub><mo>(</mo><mi>v</mi><mo>)</mo></math></span> is the edge incident to <em>v</em> that connects vertices differing in the <em>i</em>th element. In this paper, we show that two colors are enough to distinguish all vertices of the <em>n</em>-dimensional hypercube <span><math><msub><mrow><mi>H</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span> (<span><math><mi>n</mi><mo>≥</mo><mn>2</mn></math></span>) by their palettes. We also show that if <em>f</em> is a proper edge-coloring of the hypercube <span><math><msub><mrow><mi>H</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span> (<span><math><mi>n</mi><mo>≥</mo><mn>5</mn></math></span>), then <em>n</em> colors suffice to distinguish all vertices by their palettes.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"495 ","pages":"Article 129312"},"PeriodicalIF":3.5,"publicationDate":"2025-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143035319","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Effective data reduction algorithm for topological data analysis
IF 3.5 2区 数学
Applied Mathematics and Computation Pub Date : 2025-01-23 DOI: 10.1016/j.amc.2025.129302
Seonmi Choi , Jinseok Oh , Jeong Rye Park , Seung Yeop Yang , Hongdae Yun
{"title":"Effective data reduction algorithm for topological data analysis","authors":"Seonmi Choi ,&nbsp;Jinseok Oh ,&nbsp;Jeong Rye Park ,&nbsp;Seung Yeop Yang ,&nbsp;Hongdae Yun","doi":"10.1016/j.amc.2025.129302","DOIUrl":"10.1016/j.amc.2025.129302","url":null,"abstract":"<div><div>One of the most interesting tools that have recently entered the data science toolbox is topological data analysis (TDA). With the explosion of available data sizes and dimensions, identifying and extracting the underlying structure of a given dataset is a fundamental challenge in data science, and TDA provides a methodology for analyzing the shape of a dataset using tools and prospects from algebraic topology. However, the computational complexity makes it quickly infeasible to process large datasets, especially those with high dimensions. Here, we introduce a preprocessing strategy called the Characteristic Lattice Algorithm (CLA), which allows users to reduce the size of a given dataset as desired while maintaining geometric and topological features in order to make the computation of TDA feasible or to shorten its computation time. In addition, we derive a stability theorem and an upper bound of the barcode errors for CLA based on the bottleneck distance.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"495 ","pages":"Article 129302"},"PeriodicalIF":3.5,"publicationDate":"2025-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143035322","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Computational aspects of hyperbolic curvature flow
IF 3.5 2区 数学
Applied Mathematics and Computation Pub Date : 2025-01-23 DOI: 10.1016/j.amc.2025.129301
Monika Suchomelová, Michal Beneš, Miroslav Kolář
{"title":"Computational aspects of hyperbolic curvature flow","authors":"Monika Suchomelová,&nbsp;Michal Beneš,&nbsp;Miroslav Kolář","doi":"10.1016/j.amc.2025.129301","DOIUrl":"10.1016/j.amc.2025.129301","url":null,"abstract":"<div><div>The article analyzes behavior of the solution of the hyperbolic curvature flow by means of a class of analytical solutions and by computational studies performed by a semi-discrete finite-volume scheme. A class of analytical solutions is derived and used for the verification of the computational algorithm by numerical convergence to it. An original tangential redistribution is proposed to stabilize the numerical scheme. Its derivation requires a four-dimensional transformation of the evolution law. The role of tangential redistribution is demonstrated on computational examples. Computational studies show evolution of the initially convex and non-convex curves, and include cases when singularities predicted by theory start to develop.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"495 ","pages":"Article 129301"},"PeriodicalIF":3.5,"publicationDate":"2025-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143035323","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A note on block-transitive 2 − (v,k,1) designs
IF 3.5 2区 数学
Applied Mathematics and Computation Pub Date : 2025-01-23 DOI: 10.1016/j.amc.2025.129314
Shangzhao Li , Xiran Zhang , Jing Chen , Shaojun Dai
{"title":"A note on block-transitive 2 − (v,k,1) designs","authors":"Shangzhao Li ,&nbsp;Xiran Zhang ,&nbsp;Jing Chen ,&nbsp;Shaojun Dai","doi":"10.1016/j.amc.2025.129314","DOIUrl":"10.1016/j.amc.2025.129314","url":null,"abstract":"<div><div>Let <em>G</em> act block-transitively on a <span><math><mn>2</mn><mo>−</mo><mo>(</mo><mi>v</mi><mo>,</mo><mn>12</mn><mo>,</mo><mn>1</mn><mo>)</mo></math></span> design. If <em>G</em> is solvable, then (1) if <span><math><mn>3</mn><mo>|</mo><mi>v</mi></math></span>, then <span><math><mi>v</mi><mo>=</mo><msup><mrow><mn>3</mn></mrow><mrow><mi>n</mi></mrow></msup></math></span>, <span><math><mi>G</mi><mo>≤</mo><mi>A</mi><mi>Γ</mi><mi>L</mi><mo>(</mo><mn>1</mn><mo>,</mo><msup><mrow><mn>3</mn></mrow><mrow><mi>n</mi></mrow></msup><mo>)</mo></math></span>, where <span><math><msup><mrow><mi>p</mi></mrow><mrow><mi>n</mi></mrow></msup><mo>≡</mo><mn>1</mn><mspace></mspace><mo>(</mo><mrow><mi>mod</mi></mrow><mspace></mspace><mn>44</mn><mo>)</mo></math></span>; (2) if <span><math><mn>3</mn><mo>∤</mo><mi>v</mi></math></span>, then <span><math><mi>v</mi><mo>=</mo><msup><mrow><mi>p</mi></mrow><mrow><mi>n</mi></mrow></msup></math></span>, <span><math><mi>G</mi><mo>≤</mo><mi>A</mi><mi>Γ</mi><mi>L</mi><mo>(</mo><mn>1</mn><mo>,</mo><msup><mrow><mi>p</mi></mrow><mrow><mi>n</mi></mrow></msup><mo>)</mo></math></span>, where <span><math><mi>p</mi><mo>≠</mo><mn>2</mn></math></span> and <span><math><msup><mrow><mi>p</mi></mrow><mrow><mi>n</mi></mrow></msup><mo>≡</mo><mn>1</mn><mspace></mspace><mo>(</mo><mrow><mi>mod</mi></mrow><mspace></mspace><mn>132</mn><mo>)</mo></math></span>.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"495 ","pages":"Article 129314"},"PeriodicalIF":3.5,"publicationDate":"2025-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143035316","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Distinguishing infinite star-free graphs
IF 3.5 2区 数学
Applied Mathematics and Computation Pub Date : 2025-01-23 DOI: 10.1016/j.amc.2025.129310
Marcin Stawiski
{"title":"Distinguishing infinite star-free graphs","authors":"Marcin Stawiski","doi":"10.1016/j.amc.2025.129310","DOIUrl":"10.1016/j.amc.2025.129310","url":null,"abstract":"<div><div>Call a vertex or an edge colouring of a graph <em>distinguishing</em>, if is not preserved by any non-identity automorphism. For a graph <em>H</em>, we say that a graph <em>G</em> is <em>H-free</em> if there is no induced subgraph of <em>G</em>, which is isomorphic to <em>H</em>. Gorzkowska, Kargul, Musiał and Pal proved that for every natural number <em>n</em> greater than 2 each finite connected <span><math><msub><mrow><mi>K</mi></mrow><mrow><mn>1</mn><mo>,</mo><mi>n</mi></mrow></msub></math></span>-free graph on at least six vertices has a distinguishing edge colouring using at most <span><math><mi>n</mi><mo>−</mo><mn>1</mn></math></span> colours. We extend this result to all locally finite connected <span><math><msub><mrow><mi>K</mi></mrow><mrow><mn>1</mn><mo>,</mo><mi>n</mi></mrow></msub></math></span>-free graphs on at least six vertices.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"495 ","pages":"Article 129310"},"PeriodicalIF":3.5,"publicationDate":"2025-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143035318","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
An asymptotic preserving and energy stable scheme for the Euler system with congestion constraint
IF 3.5 2区 数学
Applied Mathematics and Computation Pub Date : 2025-01-23 DOI: 10.1016/j.amc.2025.129306
K.R. Arun , A. Krishnamurthy, H. Maharna
{"title":"An asymptotic preserving and energy stable scheme for the Euler system with congestion constraint","authors":"K.R. Arun ,&nbsp;A. Krishnamurthy,&nbsp;H. Maharna","doi":"10.1016/j.amc.2025.129306","DOIUrl":"10.1016/j.amc.2025.129306","url":null,"abstract":"<div><div>In this work, we design and analyze an asymptotic preserving (AP), semi-implicit finite volume scheme for the scaled compressible isentropic Euler system with a singular pressure law known as the congestion pressure law. The congestion pressure law imposes a maximal density constraint of the form <span><math><mn>0</mn><mo>≤</mo><mi>ϱ</mi><mo>&lt;</mo><mn>1</mn></math></span>, and the scaling introduces a small parameter <em>ε</em> in order to control the stiffness of the density constraint. As <span><math><mi>ε</mi><mo>→</mo><mn>0</mn></math></span>, the solutions of the compressible system converge to solutions of the so-called free-congested Euler equations that couples compressible and incompressible dynamics. We show that the proposed scheme is positivity preserving and energy stable. In addition, we also show that the numerical densities satisfy a discrete variant of the constraint. By means of extensive numerical case studies, we verify the efficacy of the scheme and show that the scheme is able to capture the two dynamics in the limiting regime, thereby proving the AP property.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"495 ","pages":"Article 129306"},"PeriodicalIF":3.5,"publicationDate":"2025-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143035321","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Effects of an update mechanism based on combinatorial memory and high-reputation learning objects on the evolution of cooperation
IF 3.5 2区 数学
Applied Mathematics and Computation Pub Date : 2025-01-23 DOI: 10.1016/j.amc.2025.129309
Qianxi Yang, Yanlong Yang
{"title":"Effects of an update mechanism based on combinatorial memory and high-reputation learning objects on the evolution of cooperation","authors":"Qianxi Yang,&nbsp;Yanlong Yang","doi":"10.1016/j.amc.2025.129309","DOIUrl":"10.1016/j.amc.2025.129309","url":null,"abstract":"<div><div>In human society, various factors influence decision-making, including memory, reputation, aspiration, etc. In recent years, research has increasingly focused on considering these factors and designing mechanisms to promote cooperation. However, few previous studies have simultaneously considered the effects of memory and reputation on cooperative evolution. Additionally, research on cooperation evolution based on memory mechanisms often focuses either on the strategy stability of the players themselves or on the strategy stability of the learning objects, but not both. Our study introduces an update mechanism based on combinatorial memory and high-reputation learning objects. This mechanism accounts for reputation and memory, where the memory effect includes the strategy stability of both the players and the learning objects. Specifically, at the stage of selecting learning objects, players prefer high-reputation individuals. We introduce a global selection weight, <em>η</em>, which allows players to select learning objects not only locally but also globally. At the stage of updating the strategy, each player simultaneously considers their own historical memory and the memory of their learning objects, with the parameter <em>γ</em> representing the memory weight of the learning objects. Monte Carlo simulations show that update rules that simultaneously consider both combinatorial memory and high-reputation learning objects are more effective in promoting cooperation than considering either factor alone. Furthermore, a small memory weight of the learning objects and a small global selection weight create an optimal environment for cooperation. Our study offers a novel approach to addressing social dilemmas and mitigating defection, emphasizing the critical roles of reputation and memory in the propagation of altruistic behavior.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"495 ","pages":"Article 129309"},"PeriodicalIF":3.5,"publicationDate":"2025-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143035320","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Null controllability of an ODE-heat system with coupled boundary and internal terms
IF 3.5 2区 数学
Applied Mathematics and Computation Pub Date : 2025-01-22 DOI: 10.1016/j.amc.2025.129303
Idriss Boutaayamou , Fouad Et-tahri , Lahcen Maniar
{"title":"Null controllability of an ODE-heat system with coupled boundary and internal terms","authors":"Idriss Boutaayamou ,&nbsp;Fouad Et-tahri ,&nbsp;Lahcen Maniar","doi":"10.1016/j.amc.2025.129303","DOIUrl":"10.1016/j.amc.2025.129303","url":null,"abstract":"<div><div>This paper is devoted to the theoretical and numerical analysis of the null controllability of a coupled ODE-heat system internally and at the boundary with Neumann boundary control. First, we establish the null controllability of the ODE-heat with distributed control using Carleman estimates. Then, we conclude by the strategy of space domain extension. Finally, we illustrate the analysis with some numerical experiments.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"495 ","pages":"Article 129303"},"PeriodicalIF":3.5,"publicationDate":"2025-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143035229","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Observer-based non-fragile control for T-S fuzzy switched systems against cyber attacks: A double-layer PDT switching method
IF 3.5 2区 数学
Applied Mathematics and Computation Pub Date : 2025-01-22 DOI: 10.1016/j.amc.2025.129308
Pengcheng Zhang , Yajuan Liu , Shiyu Jiao , Chen Yang
{"title":"Observer-based non-fragile control for T-S fuzzy switched systems against cyber attacks: A double-layer PDT switching method","authors":"Pengcheng Zhang ,&nbsp;Yajuan Liu ,&nbsp;Shiyu Jiao ,&nbsp;Chen Yang","doi":"10.1016/j.amc.2025.129308","DOIUrl":"10.1016/j.amc.2025.129308","url":null,"abstract":"<div><div>This paper mainly investigates the observer-based non-fragile control issue for a class of T-S fuzzy switched systems under cyber attacks. Firstly, the system under consideration comprises a finite number of subsystems governed by the switching logic subject to the persistent dwell-time constraints, with each local subsystem represented by a T-S fuzzy model. Secondly, the switching logic with persistent dwell-time constraints is also used to make assumptions about the frequency and duration of attacks, and the system under cyber attacks is constructed as a double-layer switched system that satisfies two independent rules simultaneously. In addition, a non-fragile control strategy relying on observed states is developed, and the criterion for the global exponential stability and the synthesis conditions for the observer/controller are established by constructing a Lyapunov function associated with two switching signals. Finally, an electric circuit model is simulated to demonstrate the feasibility of the method.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"495 ","pages":"Article 129308"},"PeriodicalIF":3.5,"publicationDate":"2025-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143035327","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"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学术官方微信