Pub Date : 2022-06-17DOI: 10.1142/S0219525922400033
Vincent Labatut
The task of extracting and analyzing character networks from works of fiction, such as novels and movies, has been the object of a number of recent publications. However, only a very few of them focus on graphic novels, and even fewer on European graphic novels. In this article, we focus on Thorgal, a bande dessin{'e}e, i.e. a comic of the French-Belgian tradition. We manually annotate all the volumes of this series, in order to constitute a corpus allowing us to extract its character network. We perform a descriptive analysis of the network structure and compare it to real-world and fictional social networks. We also study the effect of character filtering over the network structure. Finally, we leverage complex network analysis tools to answer two research questions from the literature, related to the similarity between Thorgal and the Saga of Icelanders; and to the position of women in the series. Our data and source code are both publicly available online.
{"title":"Complex Network Analysis of a Graphic Novel: The Case of the Bande Dessinée Thorgal","authors":"Vincent Labatut","doi":"10.1142/S0219525922400033","DOIUrl":"https://doi.org/10.1142/S0219525922400033","url":null,"abstract":"The task of extracting and analyzing character networks from works of fiction, such as novels and movies, has been the object of a number of recent publications. However, only a very few of them focus on graphic novels, and even fewer on European graphic novels. In this article, we focus on Thorgal, a bande dessin{'e}e, i.e. a comic of the French-Belgian tradition. We manually annotate all the volumes of this series, in order to constitute a corpus allowing us to extract its character network. We perform a descriptive analysis of the network structure and compare it to real-world and fictional social networks. We also study the effect of character filtering over the network structure. Finally, we leverage complex network analysis tools to answer two research questions from the literature, related to the similarity between Thorgal and the Saga of Icelanders; and to the position of women in the series. Our data and source code are both publicly available online.","PeriodicalId":50871,"journal":{"name":"Advances in Complex Systems","volume":"28 1","pages":"2240003:1-2240003:34"},"PeriodicalIF":0.4,"publicationDate":"2022-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83720798","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}
Pub Date : 2022-06-15DOI: 10.25088/complexsystems.31.2.165
S. Wolfram
This is the first of a series of pieces I’m planning in connection with the upcoming 20th anniversary [1] of the publication of A New Kind of Science [2] (September 23, 2021).
{"title":"Charting a Course for \"Complexity\": Metamodeling, Ruliology and More","authors":"S. Wolfram","doi":"10.25088/complexsystems.31.2.165","DOIUrl":"https://doi.org/10.25088/complexsystems.31.2.165","url":null,"abstract":"This is the first of a series of pieces I’m planning in connection with the upcoming 20th anniversary [1] of the publication of A New Kind of Science [2] (September 23, 2021).","PeriodicalId":50871,"journal":{"name":"Advances in Complex Systems","volume":"36 1","pages":"165-190"},"PeriodicalIF":0.4,"publicationDate":"2022-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75284636","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}
Pub Date : 2022-06-15DOI: 10.25088/complexsystems.32.1.1
R. Beer
Garden of Eden (GOE) states in cellular automata are grid configurations that have no precursors; that is, they can only occur as initial conditions. Finding individual configurations that minimize or maximize some criterion of interest (e.g., grid size, density, etc.) has been a popular sport in recreational mathematics, but systematic studies of the set of GOEs for a cellular automaton have been rare. This paper presents the current results of an ongoing computational study of GOE configurations in Conway’s Game of Life (GoL) cellular automaton. Specifically, we describe the current status of a map of the layout of GOEs and non-GOEs in 1-density/size space, characterize how the density-dependent structure of the number of precursors varies with increasing grid size as we approach the point where GOEs begin to occur, provide a catalog of all known GOE configurations up to a grid size of 11×11, and initiate a study of the structure of the network of constraints that characterize GOE versus non-GOE configurations.
{"title":"Cultivating the Garden of Eden","authors":"R. Beer","doi":"10.25088/complexsystems.32.1.1","DOIUrl":"https://doi.org/10.25088/complexsystems.32.1.1","url":null,"abstract":"Garden of Eden (GOE) states in cellular automata are grid configurations that have no precursors; that is, they can only occur as initial conditions. Finding individual configurations that minimize or maximize some criterion of interest (e.g., grid size, density, etc.) has been a popular sport in recreational mathematics, but systematic studies of the set of GOEs for a cellular automaton have been rare. This paper presents the current results of an ongoing computational study of GOE configurations in Conway’s Game of Life (GoL) cellular automaton. Specifically, we describe the current status of a map of the layout of GOEs and non-GOEs in 1-density/size space, characterize how the density-dependent structure of the number of precursors varies with increasing grid size as we approach the point where GOEs begin to occur, provide a catalog of all known GOE configurations up to a grid size of 11×11, and initiate a study of the structure of the network of constraints that characterize GOE versus non-GOE configurations.","PeriodicalId":50871,"journal":{"name":"Advances in Complex Systems","volume":"64 1","pages":"1-17"},"PeriodicalIF":0.4,"publicationDate":"2022-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83393680","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}
Pub Date : 2022-06-15DOI: 10.25088/complexsystems.31.2.247
Furkan Semih Dündar
This paper explores the idea of a toy model universe as a character string where each character is either X or -. The string makes a transition between states that are of maximal variety. The definition of variety given by Barbour and Smolin is used in this paper. An interpretation of the toy model universe is given in terms of Everett’s many-worlds interpretation. The paper also discusses whether new maximal variety strings can be obtained by addition or subtraction of maximal variety strings. A few comments are included about the use of quantum computers, which may help find the maximal variety strings more quickly.
{"title":"A Use of Variety as a Law of the Universe","authors":"Furkan Semih Dündar","doi":"10.25088/complexsystems.31.2.247","DOIUrl":"https://doi.org/10.25088/complexsystems.31.2.247","url":null,"abstract":"This paper explores the idea of a toy model universe as a character string where each character is either X or -. The string makes a transition between states that are of maximal variety. The definition of variety given by Barbour and Smolin is used in this paper. An interpretation of the toy model universe is given in terms of Everett’s many-worlds interpretation. The paper also discusses whether new maximal variety strings can be obtained by addition or subtraction of maximal variety strings. A few comments are included about the use of quantum computers, which may help find the maximal variety strings more quickly.","PeriodicalId":50871,"journal":{"name":"Advances in Complex Systems","volume":"127 1","pages":"247-260"},"PeriodicalIF":0.4,"publicationDate":"2022-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76710197","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}
Pub Date : 2022-06-15DOI: 10.25088/complexsystems.31.2.219
Thomas Bärecke, Marcin Detyniecki
Graph models are fundamental to any kind of application on structured real-world problems. Any comparison between graphs by a graph distance measure requires the solution of the inexact graph matching problem, which constitutes a hard combinatorial optimization problem. An inexact matching problem includes in its formulation robustness to any type of perturbation, such as, for instance, noise, inherently present in real-world environments. In this paper, we introduce the concept of distance-preserving crossover operators for genetic algorithms for this task. For large graphs, our algorithm outperforms any state-of-the-art approximate algorithm—in particular, genetic algorithms with alternative crossover operators, which are to the best of our knowledge currently limited to no more than 50 nodes. We use a two-level local search heuristic to further enhance the results, pushing the limits to up to 300 nodes: a first local search step is directly integrated into the crossover operator; another one is applied independently during offspring generation.
{"title":"Graph Matching with Distance-Preserving Crossover","authors":"Thomas Bärecke, Marcin Detyniecki","doi":"10.25088/complexsystems.31.2.219","DOIUrl":"https://doi.org/10.25088/complexsystems.31.2.219","url":null,"abstract":"Graph models are fundamental to any kind of application on structured real-world problems. Any comparison between graphs by a graph distance measure requires the solution of the inexact graph matching problem, which constitutes a hard combinatorial optimization problem. An inexact matching problem includes in its formulation robustness to any type of perturbation, such as, for instance, noise, inherently present in real-world environments. In this paper, we introduce the concept of distance-preserving crossover operators for genetic algorithms for this task. For large graphs, our algorithm outperforms any state-of-the-art approximate algorithm—in particular, genetic algorithms with alternative crossover operators, which are to the best of our knowledge currently limited to no more than 50 nodes. We use a two-level local search heuristic to further enhance the results, pushing the limits to up to 300 nodes: a first local search step is directly integrated into the crossover operator; another one is applied independently during offspring generation.","PeriodicalId":50871,"journal":{"name":"Advances in Complex Systems","volume":"11 1","pages":"219-246"},"PeriodicalIF":0.4,"publicationDate":"2022-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79117143","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}
Pub Date : 2022-06-10DOI: 10.1142/s021952592150017x
A. García‐Rodríguez, T. Govezensky, C. Gershenson, G. Naumis, R. Barrio
Twitter is a popular social medium for sharing opinions and engaging in topical debates, yet presents a wide spread of misinformation, especially in political debates, from bots and adversarial attacks. The current state-of-the-art methods for detecting humans and bots in Twitter often lack generalizability beyond English. Here, a language-agnostic method to detect real users and their interactions by leveraging network topology from retweets is presented. To that end, the chosen topic is COVID-19 policies in Mexico, which has been considered by users as polemic. Two kinds of network are built: a directed network of retweets;and the co-event network, where a non-directed link between two users exists if they have retweeted the same post in a given time window (projection of a bipartite network). Then, single node properties of these networks, such as the clustering coefficient and the degree, are studied. Three kinds of users are observed: some with a high clustering coefficient but a very small degree, a second group with zero clustering coefficient and a variable degree, and a third group in which the clustering coefficient as a function of the degree decays as a power law. This third group represents ∼2% of the users and is characteristic of dynamical networks with feedback. The latter seems to represent strongly interacting followers/followed in a real social network as confirmed by an inspection of such nodes. A percolation analysis of the resulting co-retweet and co-hashtag network reveals the relevance of such weak links, typical of real social human networks. The presented methods are simple to implement in other social media platforms and can be used to mitigate misinformation and conflicts. [ FROM AUTHOR] Copyright of Advances in Complex Systems is the property of World Scientific Publishing Company and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full . (Copyright applies to all s.)
Twitter是一个流行的社交媒体，用于分享观点和参与话题辩论，但它也存在广泛传播的错误信息，尤其是在政治辩论中，这些信息来自机器人和对抗性攻击。目前在Twitter上检测人类和机器人的最先进方法往往缺乏英语以外的通用性。本文提出了一种与语言无关的方法，通过利用来自转发的网络拓扑来检测真实用户及其交互。为此，选择的主题是墨西哥的COVID-19政策，这被用户认为是争议性的。建立了两种网络:一种是转发的定向网络;另一种是共同事件网络，如果两个用户在给定的时间窗口内转发了同一篇帖子，则存在一个非定向链接(二部网络的投影)。然后，研究了这些网络的单节点特性，如聚类系数和程度。我们观察到三种用户:一类用户的聚类系数很高，但程度很小;另一类用户的聚类系数为零，但程度是可变的;第三类用户的聚类系数作为程度的函数呈幂律衰减。这第三组代表了约2%的用户，是带有反馈的动态网络的特征。后者似乎代表了在一个真实的社交网络中强烈互动的追随者/追随者，通过对这些节点的检查证实了这一点。对由此产生的共同转发和共同标签网络的渗透分析揭示了这种弱链接的相关性，这是真实社会人际网络的典型特征。所提出的方法很容易在其他社交媒体平台上实施，可以用来减少错误信息和冲突。【来自作者】Advances in Complex Systems的版权是World Scientific Publishing Company的财产，未经版权所有者的明确书面许可，其内容不得复制或通过电子邮件发送到多个网站或发布到listserv。但是，用户可以打印、下载或通过电子邮件发送文章供个人使用。这可以删节。对副本的准确性不作任何保证。用户应参阅原始出版版本的材料的完整。(版权适用于所有人。)
{"title":"Extracting Real Social Interactions from a Debate of CoViD-19 Policies on Twitter: the Case of Mexico","authors":"A. García‐Rodríguez, T. Govezensky, C. Gershenson, G. Naumis, R. Barrio","doi":"10.1142/s021952592150017x","DOIUrl":"https://doi.org/10.1142/s021952592150017x","url":null,"abstract":"Twitter is a popular social medium for sharing opinions and engaging in topical debates, yet presents a wide spread of misinformation, especially in political debates, from bots and adversarial attacks. The current state-of-the-art methods for detecting humans and bots in Twitter often lack generalizability beyond English. Here, a language-agnostic method to detect real users and their interactions by leveraging network topology from retweets is presented. To that end, the chosen topic is COVID-19 policies in Mexico, which has been considered by users as polemic. Two kinds of network are built: a directed network of retweets;and the co-event network, where a non-directed link between two users exists if they have retweeted the same post in a given time window (projection of a bipartite network). Then, single node properties of these networks, such as the clustering coefficient and the degree, are studied. Three kinds of users are observed: some with a high clustering coefficient but a very small degree, a second group with zero clustering coefficient and a variable degree, and a third group in which the clustering coefficient as a function of the degree decays as a power law. This third group represents ∼2% of the users and is characteristic of dynamical networks with feedback. The latter seems to represent strongly interacting followers/followed in a real social network as confirmed by an inspection of such nodes. A percolation analysis of the resulting co-retweet and co-hashtag network reveals the relevance of such weak links, typical of real social human networks. The presented methods are simple to implement in other social media platforms and can be used to mitigate misinformation and conflicts. [ FROM AUTHOR] Copyright of Advances in Complex Systems is the property of World Scientific Publishing Company and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full . (Copyright applies to all s.)","PeriodicalId":50871,"journal":{"name":"Advances in Complex Systems","volume":"92 1","pages":"2150017:1-2150017:19"},"PeriodicalIF":0.4,"publicationDate":"2022-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83494111","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}
Pub Date : 2022-05-20DOI: 10.1142/s021952592240001x
Michael Neuner, Christian R. Proaño, Alberto Russo
{"title":"Countercyclical Capital buffers, Bank concentration and Macrofinancial stability in an Agent-based Macro-Financial Framework","authors":"Michael Neuner, Christian R. Proaño, Alberto Russo","doi":"10.1142/s021952592240001x","DOIUrl":"https://doi.org/10.1142/s021952592240001x","url":null,"abstract":"","PeriodicalId":50871,"journal":{"name":"Advances in Complex Systems","volume":"106 1","pages":"2240001:1-2240001:19"},"PeriodicalIF":0.4,"publicationDate":"2022-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73693114","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}
Pub Date : 2022-05-07DOI: 10.1142/s0219525922500047
G. Bottazzi, Daniele Giachini
We consider a market economy where two rational agents are able to learn the distribution of future events. In this context, we study whether moving away from the standard Bayesian belief updating, in the sense of under-reaction to some degree to new information, may be strategically convenient for traders. We show that, in equilibrium, strong under-reaction occurs, thus rational agents may strategically want to bias their learning process. Our analysis points out that the underlying mechanism driving exante strategical decisions is diversity seeking. Finally, we show that, even if robust with respect to strategy selection, strong under-reaction can generate low realized welfare levels because of a long transient phase in which the agent makes poor predictions. JEL Classification: C60, D53, D81, D83, G11, G12
{"title":"Strategically biased Learning in Market Interactions","authors":"G. Bottazzi, Daniele Giachini","doi":"10.1142/s0219525922500047","DOIUrl":"https://doi.org/10.1142/s0219525922500047","url":null,"abstract":"We consider a market economy where two rational agents are able to learn the distribution of future events. In this context, we study whether moving away from the standard Bayesian belief updating, in the sense of under-reaction to some degree to new information, may be strategically convenient for traders. We show that, in equilibrium, strong under-reaction occurs, thus rational agents may strategically want to bias their learning process. Our analysis points out that the underlying mechanism driving exante strategical decisions is diversity seeking. Finally, we show that, even if robust with respect to strategy selection, strong under-reaction can generate low realized welfare levels because of a long transient phase in which the agent makes poor predictions. JEL Classification: C60, D53, D81, D83, G11, G12","PeriodicalId":50871,"journal":{"name":"Advances in Complex Systems","volume":"1963 1","pages":"2250004:1-2250004:18"},"PeriodicalIF":0.4,"publicationDate":"2022-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91345521","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}
Pub Date : 2022-03-19DOI: 10.1142/S0219525922400070
P. Sarkanych, N. Fedorak, Y. Holovatch, Pádraig MacCarron, Joseph Yose, R. Kenna
method allows to bolster hypotheses from humanities literature — such as the position of Prince Volodymyr — and to generate new ones We show how the Kyiv cycle of bylyny fits very well with narrative networks from other nations — especially heroic ones. We anticipate that, besides delivering new narratological insights, this study will aid future scholars and interested public to navigate their way through Ukraine’s epic story and identify its heroes.
{"title":"Network analysis of the Kyiv bylyny cycle - east Slavic epic narratives","authors":"P. Sarkanych, N. Fedorak, Y. Holovatch, Pádraig MacCarron, Joseph Yose, R. Kenna","doi":"10.1142/S0219525922400070","DOIUrl":"https://doi.org/10.1142/S0219525922400070","url":null,"abstract":"method allows to bolster hypotheses from humanities literature — such as the position of Prince Volodymyr — and to generate new ones We show how the Kyiv cycle of bylyny fits very well with narrative networks from other nations — especially heroic ones. We anticipate that, besides delivering new narratological insights, this study will aid future scholars and interested public to navigate their way through Ukraine’s epic story and identify its heroes.","PeriodicalId":50871,"journal":{"name":"Advances in Complex Systems","volume":"24 1","pages":"2240007:1-2240007:25"},"PeriodicalIF":0.4,"publicationDate":"2022-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75302247","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}
Pub Date : 2022-03-15DOI: 10.25088/complexsystems.31.1.1
A. Abiad, Merit Geldmacher, Alexander Grigoriev
Several image rotation operators are introduced as novel rotation variants of John Conway’s Game of Life. The main idea of the Game of Life is to simulate real-life processes such as birth, survival and death. The discrete model operates on a two-dimensional array of black and white square cells. In this paper, we study the development of patterns in image rotation using different rotation methods. Moreover, the quality of the rotation and the applicability of image rotation to the Game of Life are investigated.
介绍了几种图像旋转算子，作为John Conway的Game of Life的新颖旋转变体。生命游戏的主要思想是模拟现实生活中的过程，如出生、生存和死亡。离散模型在一个由黑白正方形单元组成的二维阵列上运行。本文研究了不同旋转方法下图像旋转模式的发展。此外，还研究了图像旋转的质量以及图像旋转在生命游戏中的适用性。
{"title":"The Kaleidoscopic Game of Life","authors":"A. Abiad, Merit Geldmacher, Alexander Grigoriev","doi":"10.25088/complexsystems.31.1.1","DOIUrl":"https://doi.org/10.25088/complexsystems.31.1.1","url":null,"abstract":"Several image rotation operators are introduced as novel rotation variants of John Conway’s Game of Life. The main idea of the Game of Life is to simulate real-life processes such as birth, survival and death. The discrete model operates on a two-dimensional array of black and white square cells. In this paper, we study the development of patterns in image rotation using different rotation methods. Moreover, the quality of the rotation and the applicability of image rotation to the Game of Life are investigated.","PeriodicalId":50871,"journal":{"name":"Advances in Complex Systems","volume":"82 3","pages":"1-58"},"PeriodicalIF":0.4,"publicationDate":"2022-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72444966","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：