Ermanno Battista, V. Casola, N. Mazzocca, M. Ficco, M. Rak
Today the main limit to Cloud adoption is related to the perception of a security loss the users have. Indeed, the existing solutions to provide security are mainly focused on Cloud Provider prospective in order to securely integrate frameworks and Infrastructures as a Services (IaaS) in a Cloud datacenter. There is no way to monitor and evaluate the provided security. In fact, Service Level Agreements mainly focus on performance related terms and no guarantees are given for security mechanisms. Users are interested in tools to verify and monitor the implemented security requirements. On the other side, developers need tools to deploy Cloud application offering measurable security grants to end users. In this paper we will propose an approach to implement security mechanisms as components in the application design process. We modeled security interactions according to the specific threat, the specific security requirements and user/application capabilities trying to improve security and enable a Service Provider to offer security guarantees to customers. The approach has been designed to fit with different Cloud platforms, but to demonstrate its applicability, we will present a case study on the mOSAIC Platform.
{"title":"Developing Secure Cloud Applications: A Case Study","authors":"Ermanno Battista, V. Casola, N. Mazzocca, M. Ficco, M. Rak","doi":"10.1109/SYNASC.2013.63","DOIUrl":"https://doi.org/10.1109/SYNASC.2013.63","url":null,"abstract":"Today the main limit to Cloud adoption is related to the perception of a security loss the users have. Indeed, the existing solutions to provide security are mainly focused on Cloud Provider prospective in order to securely integrate frameworks and Infrastructures as a Services (IaaS) in a Cloud datacenter. There is no way to monitor and evaluate the provided security. In fact, Service Level Agreements mainly focus on performance related terms and no guarantees are given for security mechanisms. Users are interested in tools to verify and monitor the implemented security requirements. On the other side, developers need tools to deploy Cloud application offering measurable security grants to end users. In this paper we will propose an approach to implement security mechanisms as components in the application design process. We modeled security interactions according to the specific threat, the specific security requirements and user/application capabilities trying to improve security and enable a Service Provider to offer security guarantees to customers. The approach has been designed to fit with different Cloud platforms, but to demonstrate its applicability, we will present a case study on the mOSAIC Platform.","PeriodicalId":293085,"journal":{"name":"2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127711716","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 have often seen how malware families evolve over time: the malware authors add new features, change the order of functions, modify some strings or add random useless code. They do all that to evade detection. In a similar way, computer science students that copy homework will change variable and function names, rephrase comments or even replace some small portions of the code. In both cases, the essence remains the same and it is easy for one to see it, by comparing two samples or two source codes. The challenge however, is to automatically find groups of similar items in a large collection. Our research shows that we can apply the same techniques in order to cluster new malicious samples into malware families and detect plagiarized students work. The paper proposes a novel approach for computing the similarity between two items, based not only on their features, but also based on the frequencies of those features in a given population. The new similarity function was tested in a clustering algorithm and it proved better than other approaches. Also, the nature of the method allows it to be used in other document classification tasks.
{"title":"From Plagiarism to Malware Detection","authors":"Ciprian Oprișa, George Cabau, Adrian Colesa","doi":"10.1109/SYNASC.2013.37","DOIUrl":"https://doi.org/10.1109/SYNASC.2013.37","url":null,"abstract":"We have often seen how malware families evolve over time: the malware authors add new features, change the order of functions, modify some strings or add random useless code. They do all that to evade detection. In a similar way, computer science students that copy homework will change variable and function names, rephrase comments or even replace some small portions of the code. In both cases, the essence remains the same and it is easy for one to see it, by comparing two samples or two source codes. The challenge however, is to automatically find groups of similar items in a large collection. Our research shows that we can apply the same techniques in order to cluster new malicious samples into malware families and detect plagiarized students work. The paper proposes a novel approach for computing the similarity between two items, based not only on their features, but also based on the frequencies of those features in a given population. The new similarity function was tested in a clustering algorithm and it proved better than other approaches. Also, the nature of the method allows it to be used in other document classification tasks.","PeriodicalId":293085,"journal":{"name":"2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127821312","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}
Although static metaprogramming is not a new technique and is present in some of the most popular programming languages today, it is still considered an esoteric feature. This is mainly because writing metaprograms requires syntactic constructs and programming abstractions different from those used for writing regular programs. We propose in this paper the concept of hyper-metaprogramming, a new kind of Turing-complete compile-time metaprogramming, which allows metaprograms to be written in the same way as traditional programs: with the same abstractions, syntax, and semantics. Using this feature, programmers can easily implement any complex algorithms and data structures at compile-time, before producing the final run-time program. The paper focuses on discussing the main mechanisms involved in implementing hyper-metaprogramming.
{"title":"Compiler Design for Hyper-metaprogramming","authors":"Lucian Radu Teodorescu, R. Potolea","doi":"10.1109/SYNASC.2013.34","DOIUrl":"https://doi.org/10.1109/SYNASC.2013.34","url":null,"abstract":"Although static metaprogramming is not a new technique and is present in some of the most popular programming languages today, it is still considered an esoteric feature. This is mainly because writing metaprograms requires syntactic constructs and programming abstractions different from those used for writing regular programs. We propose in this paper the concept of hyper-metaprogramming, a new kind of Turing-complete compile-time metaprogramming, which allows metaprograms to be written in the same way as traditional programs: with the same abstractions, syntax, and semantics. Using this feature, programmers can easily implement any complex algorithms and data structures at compile-time, before producing the final run-time program. The paper focuses on discussing the main mechanisms involved in implementing hyper-metaprogramming.","PeriodicalId":293085,"journal":{"name":"2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130890461","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}
Termination of Evolutionary Algorithms (EA) at its steady state so that useless iterations are not performed is a main point for its efficient application to black-box problems. Many EA algorithms evolve while there is still diversity in their population and, thus, they could be terminated by analyzing the behavior some measures of EA population diversity. This paper presents a numeric approximation to steady states that can be used to detect the moment EA population has lost its diversity for EA termination. Our condition has been applied to 3 EA paradigms based on diversity and a selection of functions covering the properties most relevant for EA convergence. Experiments show that our condition works regardless of the search space dimension and function landscape.
{"title":"Detecting Loss of Diversity for an Efficient Termination of EAs","authors":"D. Roche, D. Gil, J. Giraldo","doi":"10.1109/SYNASC.2013.79","DOIUrl":"https://doi.org/10.1109/SYNASC.2013.79","url":null,"abstract":"Termination of Evolutionary Algorithms (EA) at its steady state so that useless iterations are not performed is a main point for its efficient application to black-box problems. Many EA algorithms evolve while there is still diversity in their population and, thus, they could be terminated by analyzing the behavior some measures of EA population diversity. This paper presents a numeric approximation to steady states that can be used to detect the moment EA population has lost its diversity for EA termination. Our condition has been applied to 3 EA paradigms based on diversity and a selection of functions covering the properties most relevant for EA convergence. Experiments show that our condition works regardless of the search space dimension and function landscape.","PeriodicalId":293085,"journal":{"name":"2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123787738","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}
Resource identification in massive deployed distributed systems, like the cloud environments, is a common problem when multiple types of resources need to be managed. This is the case of platform as a service (PaaS) where the platform offers different types resources that are deployed in heterogeneous systems. While most of the solutions on the market follow a predefined architecture using common naming services in a centralized manner this paper proposes a new approach based on a distributed naming and resource identification service. The proposed solution allows a client to consume or communicate with a resource without having to deal with resource location or discovery protocols.
{"title":"Distributed Resource Identification Service for Cloud Environments","authors":"S. Panica, D. Petcu","doi":"10.1109/SYNASC.2013.65","DOIUrl":"https://doi.org/10.1109/SYNASC.2013.65","url":null,"abstract":"Resource identification in massive deployed distributed systems, like the cloud environments, is a common problem when multiple types of resources need to be managed. This is the case of platform as a service (PaaS) where the platform offers different types resources that are deployed in heterogeneous systems. While most of the solutions on the market follow a predefined architecture using common naming services in a centralized manner this paper proposes a new approach based on a distributed naming and resource identification service. The proposed solution allows a client to consume or communicate with a resource without having to deal with resource location or discovery protocols.","PeriodicalId":293085,"journal":{"name":"2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127918418","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 continue and complete a Coxeter spectral study (presented in our talk given in SYNASC11 and SYNASC12) of the root systems in the sense of Bourbaki, the mesh geometries Γ(RΔ, ΦA) of roots of Δ in the sense of [J. Pure Appl. Algebra, 215 (2010), 13-34], and matrix morsifications A ∈ MorΔ, for simply laced Dynkin diagrams Δ ∈ {An, Dn, E6, E7, E8}. Here we report on algorithmic and morsification technique for the Coxeter spectral analysis of connected loop-free edge-bipartite graphs Δ with n ≥ 2 vertices by means of the Coxeter matrix CoxΔ ∈ Mn(Z), the Coxeter spectrum speccΔ, and an inflation algorithm associating to any connected loop-free positive bigraph Δ a simply laced Dynkin diagram DΔ, and defining a Z-congruence of the symmetric Gram matrices GΔ and GDΔ. We also present a computer aided technique that allows us to construct a Z-congruence of the non-symmetric Gram matrices ĞΔ and ĞΔ', if the Coxeter spectra speccΔ and speccΔ' coincide. A complete Coxeter spectral classification of positive edge-bipartite graphs Δ of Coxeter-Dynkin types DΔ ∈ {An, Dn, E6, E7}, with n ≤ 7, is obtained by a reduction to computer calculation of Gl(n, Z)DΔ-orbits in the set MorDΔ, where Gl(n, Z)DΔ is the isotropy group of the Dynkin diagram DΔ.
{"title":"On Coxeter Type Classification of Loop-Free Edge-Bipartite Graphs and Matrix Morsifications","authors":"Rafal Bocian, Mariusz Felisiak, D. Simson","doi":"10.1109/SYNASC.2013.22","DOIUrl":"https://doi.org/10.1109/SYNASC.2013.22","url":null,"abstract":"We continue and complete a Coxeter spectral study (presented in our talk given in SYNASC11 and SYNASC12) of the root systems in the sense of Bourbaki, the mesh geometries Γ(R<sub>Δ</sub>, Φ<sub>A</sub>) of roots of Δ in the sense of [J. Pure Appl. Algebra, 215 (2010), 13-34], and matrix morsifications A ∈ Mor<sub>Δ</sub>, for simply laced Dynkin diagrams Δ ∈ {A<sub>n</sub>, D<sub>n</sub>, E<sub>6</sub>, E<sub>7</sub>, E<sub>8</sub>}. Here we report on algorithmic and morsification technique for the Coxeter spectral analysis of connected loop-free edge-bipartite graphs Δ with n ≥ 2 vertices by means of the Coxeter matrix Cox<sub>Δ</sub> ∈ M<sub>n</sub>(Z), the Coxeter spectrum specc<sub>Δ</sub>, and an inflation algorithm associating to any connected loop-free positive bigraph Δ a simply laced Dynkin diagram DΔ, and defining a Z-congruence of the symmetric Gram matrices G<sub>Δ</sub> and G<sub>DΔ</sub>. We also present a computer aided technique that allows us to construct a Z-congruence of the non-symmetric Gram matrices Ğ<sub>Δ</sub> and Ğ<sub>Δ'</sub>, if the Coxeter spectra specc<sub>Δ</sub> and specc<sub>Δ'</sub> coincide. A complete Coxeter spectral classification of positive edge-bipartite graphs Δ of Coxeter-Dynkin types DΔ ∈ {A<sub>n</sub>, D<sub>n</sub>, E<sub>6</sub>, E<sub>7</sub>}, with n ≤ 7, is obtained by a reduction to computer calculation of Gl(n, Z)<sub>DΔ</sub>-orbits in the set Mor<sub>DΔ</sub>, where Gl(n, Z)<sub>DΔ</sub> is the isotropy group of the Dynkin diagram DΔ.","PeriodicalId":293085,"journal":{"name":"2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"40 9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126177489","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}
Bounded bi-ideals are a subclass of uniformly recurrent words. We introduce the notion of completely bounded bi-ideals by imposing a restriction on their generating base sequences. We prove that a bounded bi-ideal is linearly recurrent if and only if it is completely bounded.
{"title":"Bounded Bi-ideals and Linear Recurrence","authors":"I. Berzina, J. Buls, Raivis Bēts","doi":"10.1109/SYNASC.2013.57","DOIUrl":"https://doi.org/10.1109/SYNASC.2013.57","url":null,"abstract":"Bounded bi-ideals are a subclass of uniformly recurrent words. We introduce the notion of completely bounded bi-ideals by imposing a restriction on their generating base sequences. We prove that a bounded bi-ideal is linearly recurrent if and only if it is completely bounded.","PeriodicalId":293085,"journal":{"name":"2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115805897","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 hash iteration technique takes as input a hash compression function which works on fixed length binary strings and outputs a hash function which works on arbitrary length binary strings. In this paper we introduce token-free bounded delay codes and then use them to define a hash iteration technique. The newly created schema, when applied to a hash compression function, preserves the following security properties: preimage resistance (Pre), always preimage-resistance (aPre), everywhere preimage-resistance (ePre) and collision-resistance (Coll). The proofs for the preservation of the second-preimage resistance (Sec), always second-preimage resistance (aSec), and everywhere second-preimage resistance (eSec) are part of our future work. Comparisons with other iteration techniques are also provided.
{"title":"Token Free Bounded Delay Codes and Hash Iteration","authors":"Sebastian Codrin Ditu","doi":"10.1109/SYNASC.2013.58","DOIUrl":"https://doi.org/10.1109/SYNASC.2013.58","url":null,"abstract":"A hash iteration technique takes as input a hash compression function which works on fixed length binary strings and outputs a hash function which works on arbitrary length binary strings. In this paper we introduce token-free bounded delay codes and then use them to define a hash iteration technique. The newly created schema, when applied to a hash compression function, preserves the following security properties: preimage resistance (Pre), always preimage-resistance (aPre), everywhere preimage-resistance (ePre) and collision-resistance (Coll). The proofs for the preservation of the second-preimage resistance (Sec), always second-preimage resistance (aSec), and everywhere second-preimage resistance (eSec) are part of our future work. Comparisons with other iteration techniques are also provided.","PeriodicalId":293085,"journal":{"name":"2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130366643","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}
Covering Arrays(CA) are combinatorial objects that have been used succesfully to automate the generation of test cases for software testing. The CAs have the features of being of minimal cardinality (i.e. minimize the number of test cases), and maximum coverage (i.e. they guarantee to cover all combinations of certain size between the input parameters). Only in few cases there is known an optimal solution to construct CAs, but in general the problem of constructing optimal CAs is a hard combinatorial optimization problem. For this reason, a number of methods to solve the construction of covering arrays have been developed. This paper gives a survey of the state of the art of the methods to construct covering arrays. The methods analyzed were grouped in four categories: exact methods (Section II), greedy methods (Section III), metaheuristic methods (Section IV), and algebraic methods (Section V). The paper ends with a summary of the methods analyzed.
{"title":"Survey of Covering Arrays","authors":"J. Torres-Jiménez, Idelfonso Izquierdo","doi":"10.1109/SYNASC.2013.10","DOIUrl":"https://doi.org/10.1109/SYNASC.2013.10","url":null,"abstract":"Covering Arrays(CA) are combinatorial objects that have been used succesfully to automate the generation of test cases for software testing. The CAs have the features of being of minimal cardinality (i.e. minimize the number of test cases), and maximum coverage (i.e. they guarantee to cover all combinations of certain size between the input parameters). Only in few cases there is known an optimal solution to construct CAs, but in general the problem of constructing optimal CAs is a hard combinatorial optimization problem. For this reason, a number of methods to solve the construction of covering arrays have been developed. This paper gives a survey of the state of the art of the methods to construct covering arrays. The methods analyzed were grouped in four categories: exact methods (Section II), greedy methods (Section III), metaheuristic methods (Section IV), and algebraic methods (Section V). The paper ends with a summary of the methods analyzed.","PeriodicalId":293085,"journal":{"name":"2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125642404","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}
M. Joldos, Octavian Vinteler, R. Peter, I. Muntean
Brain microcircuits exhibit an almost chaotic behavior. This is of high interest in developing new computational models or designing high capacity storage systems. Therefore, the simulation of such microcircuits must preserve the brain dynamic behavior. But investigating the dynamics analysis of such systems is a complex computational task due to the large number of neurons and synapses in the network, the large number of simulation scenarios that need to be computed, and to their model representation. To address the first challenge, we propose in this paper an MPI-based parallelization scheme of the asynchronous spiking neural network simulation algorithm. Due to the partitioning method, we can compute scenarios with more than 50.000 neurons and 300 millions synapses. The proposed solution has been evaluated on production HPC systems, employing up to 512 parallel processes. We contribute to the second challenge by extending the fACIBiNET framework with client-side capabilities for the Globus Online service. As such, scenarios with both high-throughput and high-performance computing requirements are managed in an efficient manner from within the framework, using grid technologies.
{"title":"MPI-Based Asynchronous Simulation of Spiking Neural Networks on the Grid","authors":"M. Joldos, Octavian Vinteler, R. Peter, I. Muntean","doi":"10.1109/SYNASC.2013.69","DOIUrl":"https://doi.org/10.1109/SYNASC.2013.69","url":null,"abstract":"Brain microcircuits exhibit an almost chaotic behavior. This is of high interest in developing new computational models or designing high capacity storage systems. Therefore, the simulation of such microcircuits must preserve the brain dynamic behavior. But investigating the dynamics analysis of such systems is a complex computational task due to the large number of neurons and synapses in the network, the large number of simulation scenarios that need to be computed, and to their model representation. To address the first challenge, we propose in this paper an MPI-based parallelization scheme of the asynchronous spiking neural network simulation algorithm. Due to the partitioning method, we can compute scenarios with more than 50.000 neurons and 300 millions synapses. The proposed solution has been evaluated on production HPC systems, employing up to 512 parallel processes. We contribute to the second challenge by extending the fACIBiNET framework with client-side capabilities for the Globus Online service. As such, scenarios with both high-throughput and high-performance computing requirements are managed in an efficient manner from within the framework, using grid technologies.","PeriodicalId":293085,"journal":{"name":"2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131606049","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
扫码关注我们
求助内容：
应助结果提醒方式：