Understanding the algorithmic behaviors that are in principle realizable in a chemical system is necessary for a rigorous understanding of the design principles of biological regulatory networks. Further, advances in synthetic biology herald the time when we'll be able to rationally engineer complex chemical systems, and when idealized formal models will become blueprints for engineering. Coupled chemical interactions in a well-mixed solution are commonly formalized as chemical reaction networks (CRNs). However, despite the widespread use of CRNs in the natural sciences, the range of computational behaviors exhibited by CRNs is not well understood. Here we study the following problem: what functions f : ∪k → ∪ can be computed by a chemical reaction network, in which the CRN eventually produces the correct amount of the "output" ∣ molecule, no matter the rate at which reactions proceed? This captures a previously unexplored, but very natural class of computations: for example, the reaction X1 + X2 → Y can be thought to compute the function y = min(x1, x2). Such a CRN is robust in the sense that it is correct whether its evolution is governed by the standard model of mass-action kinetics, alternatives such as Hill-function or Michaelis-Menten kinetics, or other arbitrary models of chemistry that respect the (fundamentally digital) stoichiometric constraints (what are the reactants and products?). We develop a formal definition of such computation using a novel notion of reachability, and prove that a function is computable in this manner if and only if it is continuous piecewise linear.
{"title":"Rate-independent computation in continuous chemical reaction networks","authors":"Ho-Lin Chen, David Doty, D. Soloveichik","doi":"10.1145/2554797.2554827","DOIUrl":"https://doi.org/10.1145/2554797.2554827","url":null,"abstract":"Understanding the algorithmic behaviors that are in principle realizable in a chemical system is necessary for a rigorous understanding of the design principles of biological regulatory networks. Further, advances in synthetic biology herald the time when we'll be able to rationally engineer complex chemical systems, and when idealized formal models will become blueprints for engineering. Coupled chemical interactions in a well-mixed solution are commonly formalized as chemical reaction networks (CRNs). However, despite the widespread use of CRNs in the natural sciences, the range of computational behaviors exhibited by CRNs is not well understood. Here we study the following problem: what functions f : ∪k → ∪ can be computed by a chemical reaction network, in which the CRN eventually produces the correct amount of the \"output\" ∣ molecule, no matter the rate at which reactions proceed? This captures a previously unexplored, but very natural class of computations: for example, the reaction X1 + X2 → Y can be thought to compute the function y = min(x1, x2). Such a CRN is robust in the sense that it is correct whether its evolution is governed by the standard model of mass-action kinetics, alternatives such as Hill-function or Michaelis-Menten kinetics, or other arbitrary models of chemistry that respect the (fundamentally digital) stoichiometric constraints (what are the reactants and products?). We develop a formal definition of such computation using a novel notion of reachability, and prove that a function is computable in this manner if and only if it is continuous piecewise linear.","PeriodicalId":382856,"journal":{"name":"Proceedings of the 5th conference on Innovations in theoretical computer science","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-01-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126954386","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}
We study the price of anarchy of coordination mechanisms for a scheduling problem where each job j has a weight wj, processing time pij, assignment cost hij, and communication delay (or release date) rij, on machine i. Each machine is free to declare its own scheduling policy. Each job is a selfish agent and selects a machine that minimizes its own disutility, which is equal to its weighted completion time plus its assignment cost. The goal is to minimize the total disutility incurred by all the jobs. Our model is general enough to capture scheduling jobs in a distributed environment with heterogeneous machines (or data centers) that are situated across different locations. Our main result is a characterization of scheduling policies that give a small (robust) Price of Anarchy. More precisely, we show that whenever each machine independently declares any scheduling policy that satisfies a certain bounded stretch condition introduced in this paper, the game induced between the jobs has a small Price of Anarchy. Our characterization is powerful enough to test almost all popular scheduling policies. On the technical side, to derive our results, we use a potential function whose derivative leads to an instantaneous smoothness condition, and linear programming and dual fitting. To the best of our knowledge, this is a novel application of these techniques in the context of coordination mechanisms, and we believe these tools will find more applications in analyzing PoA of games. We also extend our results to the lk-norms and l∞ norm (makespan) objectives.
{"title":"Coordination mechanisms from (almost) all scheduling policies","authors":"Sayan Bhattacharya, Sungjin Im, Janardhan Kulkarni, Kamesh Munagala","doi":"10.1145/2554797.2554811","DOIUrl":"https://doi.org/10.1145/2554797.2554811","url":null,"abstract":"We study the price of anarchy of coordination mechanisms for a scheduling problem where each job j has a weight wj, processing time pij, assignment cost hij, and communication delay (or release date) rij, on machine i. Each machine is free to declare its own scheduling policy. Each job is a selfish agent and selects a machine that minimizes its own disutility, which is equal to its weighted completion time plus its assignment cost. The goal is to minimize the total disutility incurred by all the jobs. Our model is general enough to capture scheduling jobs in a distributed environment with heterogeneous machines (or data centers) that are situated across different locations. Our main result is a characterization of scheduling policies that give a small (robust) Price of Anarchy. More precisely, we show that whenever each machine independently declares any scheduling policy that satisfies a certain bounded stretch condition introduced in this paper, the game induced between the jobs has a small Price of Anarchy. Our characterization is powerful enough to test almost all popular scheduling policies. On the technical side, to derive our results, we use a potential function whose derivative leads to an instantaneous smoothness condition, and linear programming and dual fitting. To the best of our knowledge, this is a novel application of these techniques in the context of coordination mechanisms, and we believe these tools will find more applications in analyzing PoA of games. We also extend our results to the lk-norms and l∞ norm (makespan) objectives.","PeriodicalId":382856,"journal":{"name":"Proceedings of the 5th conference on Innovations in theoretical computer science","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-01-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114462558","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}
{"title":"Session details: Session 7: 14:00--14:10","authors":"S. Irani","doi":"10.1145/3255059","DOIUrl":"https://doi.org/10.1145/3255059","url":null,"abstract":"","PeriodicalId":382856,"journal":{"name":"Proceedings of the 5th conference on Innovations in theoretical computer science","volume":"239 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-01-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132372889","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}
The papers in this volume were presented at the 5th Innovations in Theoretical Computer Science (ITCS 2014) conference, sponsored by the ACM Special Interest Group on Algorithms and Computation Theory (SIGACT). The conference was held in Princeton, New Jersey, USA, January 11--14, 2014. ITCS (previously known as ICS) seeks to promote research that carries a strong conceptual message, for instance, introducing a new concept or model, opening a new line of inquiry within traditional or cross-interdisciplinary areas, or introducing new techniques or new applications of known techniques). The call for papers welcomed all submissions, whether aligned with current theory of computation research directions or deviating from them. Altogether 116 submissions were received worldwide. Of these the program committee selected 48 papers. The accepted papers cover a wide range of topics in theoretical computer science, including algorithms, complexity, cryptography, learning, data privacy, quantum, physical and biological computing and relations between computing and social sciences. In addition to the selected papers the committee invited Professor Peter Winkler of Dartmouth to give an evening talk and we are grateful for his acceptance. Another evening was devoted to "Graduating Bits" - short talks by recent graduates. The program committee consisted of 24 members (plus the chair): Deeparnab Chakrabarty (Microsoft Research India), Timothy Chan (University of Waterloo), Costis Daskalakis (MIT), Yuval Emek (ETH and Technion), Kousha Etessami (University of Edinburgh), Yuval Filmus (University of Toronto and Simons Institute, Berkeley), Arpita Ghosh (Cornell University), Monika Henzinger (University of Vienna), Sandy Irani (University of California Irvine), Michael nKearns (University of Pennsylvania), Lap Chi Lau (The Chinese University of Hong Kong), Nati Linial (Hebrew University of Jerusalem), Kobbi Nissim (Ben-Gurion University), Rasmus Pagh (IT University of Copenhagen), Shubhangi Saraf (Rutgers University), Ola Svensson (EPFL), Vinod Vaikuntanathan (University of Toronto and MIT), Jan Vondrak (IBM Almaden Research Center), Manfred Warmuth (University of California, Santa Cruz), Daniel Wichs (Northeastern University), Udi Wieder (Microsoft Research SVC), Ryan Williams (Stanford University), Ronald de Wolf (CWI and University of Amsterdam), David Xiao (CNRS and Universite Paris 7). I wish to express my admiration for their hard work of reading, evaluating and debating the merits of the submissions. The many individuals who assisted the reviewing process as subreviewers and extended the expertise of the committee deserve acknowledgments as well.
{"title":"Proceedings of the 5th conference on Innovations in theoretical computer science","authors":"M. Naor","doi":"10.1145/2554797","DOIUrl":"https://doi.org/10.1145/2554797","url":null,"abstract":"The papers in this volume were presented at the 5th Innovations in Theoretical Computer Science (ITCS 2014) conference, sponsored by the ACM Special Interest Group on Algorithms and Computation Theory (SIGACT). The conference was held in Princeton, New Jersey, USA, January 11--14, 2014. ITCS (previously known as ICS) seeks to promote research that carries a strong conceptual message, for instance, introducing a new concept or model, opening a new line of inquiry within traditional or cross-interdisciplinary areas, or introducing new techniques or new applications of known techniques). \u0000 \u0000The call for papers welcomed all submissions, whether aligned with current theory of computation research directions or deviating from them. Altogether 116 submissions were received worldwide. Of these the program committee selected 48 papers. The accepted papers cover a wide range of topics in theoretical computer science, including algorithms, complexity, cryptography, learning, data privacy, quantum, physical and biological computing and relations between computing and social sciences. In addition to the selected papers the committee invited Professor Peter Winkler of Dartmouth to give an evening talk and we are grateful for his acceptance. Another evening was devoted to \"Graduating Bits\" - short talks by recent graduates. \u0000 \u0000The program committee consisted of 24 members (plus the chair): Deeparnab Chakrabarty (Microsoft Research India), Timothy Chan (University of Waterloo), Costis Daskalakis (MIT), Yuval Emek (ETH and Technion), Kousha Etessami (University of Edinburgh), Yuval Filmus (University of Toronto and Simons Institute, Berkeley), Arpita Ghosh (Cornell University), Monika Henzinger (University of Vienna), Sandy Irani (University of California Irvine), Michael nKearns (University of Pennsylvania), Lap Chi Lau (The Chinese University of Hong Kong), Nati Linial (Hebrew University of Jerusalem), Kobbi Nissim (Ben-Gurion University), Rasmus Pagh (IT University of Copenhagen), Shubhangi Saraf (Rutgers University), Ola Svensson (EPFL), Vinod Vaikuntanathan (University of Toronto and MIT), Jan Vondrak (IBM Almaden Research Center), Manfred Warmuth (University of California, Santa Cruz), Daniel Wichs (Northeastern University), Udi Wieder (Microsoft Research SVC), Ryan Williams (Stanford University), Ronald de Wolf (CWI and University of Amsterdam), David Xiao (CNRS and Universite Paris 7). I wish to express my admiration for their hard work of reading, evaluating and debating the merits of the submissions. The many individuals who assisted the reviewing process as subreviewers and extended the expertise of the committee deserve acknowledgments as well.","PeriodicalId":382856,"journal":{"name":"Proceedings of the 5th conference on Innovations in theoretical computer science","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-01-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133415411","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}
{"title":"Session details: Session 3: 14:00--14:10","authors":"Michael Kearns","doi":"10.1145/3255055","DOIUrl":"https://doi.org/10.1145/3255055","url":null,"abstract":"","PeriodicalId":382856,"journal":{"name":"Proceedings of the 5th conference on Innovations in theoretical computer science","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-01-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115764640","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}
We develop a new notion called tester of a class M of functions f : A → C that maps the elements α ∈ A in the domain A of the function to a finite number (the size of the tester) of elements b1,...,bt in a smaller sub-domain B ⊂ A where the property f(α) ≠ 0 is preserved for all f ∈ M. I.e., for all f ∈ M and - ∈ A if f(α) ≠ 0 then f(bi) ≠ 0 for some i. We use tools from elementary algebra and algebraic function fields to construct testers of almost optimal size in deterministic polynomial time in the size of the tester. We then apply testers to deterministically construct new set of objects with some combinatorial and algebraic properties that can be used to derandomize some algorithms. We show that those new constructions are almost optimal and for many of them meet the union bound of the problem. Constructions include, d-restriction problems, perfect hash, universal sets, cover-free families, separating hash functions, polynomial restriction problems, black box polynomial identity testing for polynomials and circuits over small fields and hitting sets.
{"title":"Testers and their applications","authors":"N. Bshouty","doi":"10.1145/2554797.2554828","DOIUrl":"https://doi.org/10.1145/2554797.2554828","url":null,"abstract":"We develop a new notion called tester of a class M of functions f : A → C that maps the elements α ∈ A in the domain A of the function to a finite number (the size of the tester) of elements b1,...,bt in a smaller sub-domain B ⊂ A where the property f(α) ≠ 0 is preserved for all f ∈ M. I.e., for all f ∈ M and - ∈ A if f(α) ≠ 0 then f(bi) ≠ 0 for some i. We use tools from elementary algebra and algebraic function fields to construct testers of almost optimal size in deterministic polynomial time in the size of the tester. We then apply testers to deterministically construct new set of objects with some combinatorial and algebraic properties that can be used to derandomize some algorithms. We show that those new constructions are almost optimal and for many of them meet the union bound of the problem. Constructions include, d-restriction problems, perfect hash, universal sets, cover-free families, separating hash functions, polynomial restriction problems, black box polynomial identity testing for polynomials and circuits over small fields and hitting sets.","PeriodicalId":382856,"journal":{"name":"Proceedings of the 5th conference on Innovations in theoretical computer science","volume":"94 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-01-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129826508","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}
{"title":"Session details: Session 8: 16:00--16:10","authors":"Yuval Filmus","doi":"10.1145/3255060","DOIUrl":"https://doi.org/10.1145/3255060","url":null,"abstract":"","PeriodicalId":382856,"journal":{"name":"Proceedings of the 5th conference on Innovations in theoretical computer science","volume":"82 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-01-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123142660","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}
{"title":"Session details: Session 9: 08:30--08:40","authors":"D. Wichs","doi":"10.1145/3255061","DOIUrl":"https://doi.org/10.1145/3255061","url":null,"abstract":"","PeriodicalId":382856,"journal":{"name":"Proceedings of the 5th conference on Innovations in theoretical computer science","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-01-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122916922","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}
A. Antoniadis, Neal Barcelo, Michael Nugent, K. Pruhs, Michele Scquizzato
We initiate the theoretical investigation of energy-efficient circuit design. We assume that the circuit design specifies the circuit layout as well as the supply voltages for the gates. To obtain maximum energy efficiency, the circuit design must balance the conflicting demands of minimizing the energy used per gate, and minimizing the number of gates in the circuit; If the energy supplied to the gates is small, then functional failures are likely, necessitating a circuit layout that is more fault-tolerant, and thus that has more gates. By leveraging previous work on fault-tolerant circuit design, we show general upper and lower bounds on the amount of energy required by a circuit to compute a given relation. We show that some circuits would be asymptotically more energy efficient if heterogeneous supply voltages were allowed, and show that for some circuits the most energy-efficient supply voltages are homogeneous over all gates.
{"title":"Energy-efficient circuit design","authors":"A. Antoniadis, Neal Barcelo, Michael Nugent, K. Pruhs, Michele Scquizzato","doi":"10.1145/2554797.2554826","DOIUrl":"https://doi.org/10.1145/2554797.2554826","url":null,"abstract":"We initiate the theoretical investigation of energy-efficient circuit design. We assume that the circuit design specifies the circuit layout as well as the supply voltages for the gates. To obtain maximum energy efficiency, the circuit design must balance the conflicting demands of minimizing the energy used per gate, and minimizing the number of gates in the circuit; If the energy supplied to the gates is small, then functional failures are likely, necessitating a circuit layout that is more fault-tolerant, and thus that has more gates. By leveraging previous work on fault-tolerant circuit design, we show general upper and lower bounds on the amount of energy required by a circuit to compute a given relation. We show that some circuits would be asymptotically more energy efficient if heterogeneous supply voltages were allowed, and show that for some circuits the most energy-efficient supply voltages are homogeneous over all gates.","PeriodicalId":382856,"journal":{"name":"Proceedings of the 5th conference on Innovations in theoretical computer science","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-01-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125246860","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}
Jonathan W. Berry, Luke Fostvedt, D. Nordman, C. Phillips, C. Seshadhri, Alyson G. Wilson
Triangle enumeration is a fundamental graph operation. Despite the lack of provably efficient (linear, or slightly super-linear) worst-case algorithms for this problem, practitioners run simple, efficient heuristics to find all triangles in graphs with millions of vertices. How are these heuristics exploiting the structure of these special graphs to provide major speedups in running time? We study one of the most prevalent algorithms used by practitioners. A trivial algorithm enumerates all paths of length 2, and checks if each such path is incident to a triangle. A good heuristic is to enumerate only those paths of length 2 where the middle vertex has the lowest degree. It is easily implemented and is empirically known to give remarkable speedups over the trivial algorithm. We study the behavior of this algorithm over graphs with heavy-tailed degree distributions, a defining feature of real-world graphs. The erased configuration model (ECM) efficiently generates a graph with asymptotically (almost) any desired degree sequence. We show that the expected running time of this algorithm over the distribution of graphs created by the ECM is controlled by the l4/3-norm of the degree sequence. As a corollary of our main theorem, we prove expected linear-time performance for degree sequences following a power law with exponent α ≥ 7/3, and non-trivial speedup whenever α ∈ (2,3).
{"title":"Why do simple algorithms for triangle enumeration work in the real world?","authors":"Jonathan W. Berry, Luke Fostvedt, D. Nordman, C. Phillips, C. Seshadhri, Alyson G. Wilson","doi":"10.1145/2554797.2554819","DOIUrl":"https://doi.org/10.1145/2554797.2554819","url":null,"abstract":"Triangle enumeration is a fundamental graph operation. Despite the lack of provably efficient (linear, or slightly super-linear) worst-case algorithms for this problem, practitioners run simple, efficient heuristics to find all triangles in graphs with millions of vertices. How are these heuristics exploiting the structure of these special graphs to provide major speedups in running time? We study one of the most prevalent algorithms used by practitioners. A trivial algorithm enumerates all paths of length 2, and checks if each such path is incident to a triangle. A good heuristic is to enumerate only those paths of length 2 where the middle vertex has the lowest degree. It is easily implemented and is empirically known to give remarkable speedups over the trivial algorithm. We study the behavior of this algorithm over graphs with heavy-tailed degree distributions, a defining feature of real-world graphs. The erased configuration model (ECM) efficiently generates a graph with asymptotically (almost) any desired degree sequence. We show that the expected running time of this algorithm over the distribution of graphs created by the ECM is controlled by the l4/3-norm of the degree sequence. As a corollary of our main theorem, we prove expected linear-time performance for degree sequences following a power law with exponent α ≥ 7/3, and non-trivial speedup whenever α ∈ (2,3).","PeriodicalId":382856,"journal":{"name":"Proceedings of the 5th conference on Innovations in theoretical computer science","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-01-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133998922","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：