The edge feature extraction of image is one of the research fields of image processing theory and application. The traditional methods of image feature extraction are simple and proficient, but the accurate performance of the feature extracted is not even higher. As such, a new method for extracting image edge feature was proposed by using the two-dimensional Empirical Mode Decomposition (2-D EMD) and Riesz Transform. Firstly, the image was decomposed to multi-level Intrinsic) Mode Function (IMF) by 2-D EMD, and then the Riesz Transform with stronger local preserving ability was used for analyzing their local properties instead of the Hilbert Transform, by which the edge feature extraction with higher resolution was carried on. Finally, simulation shows that the proposed method is feasible and valid.
{"title":"Simulation Research of Applying Two-dimensional Empirical Mode Decomposition on Image Feature Extraction","authors":"Qin Wang, Ran Jin, Kun Gao","doi":"10.1109/SKG.2010.70","DOIUrl":"https://doi.org/10.1109/SKG.2010.70","url":null,"abstract":"The edge feature extraction of image is one of the research fields of image processing theory and application. The traditional methods of image feature extraction are simple and proficient, but the accurate performance of the feature extracted is not even higher. As such, a new method for extracting image edge feature was proposed by using the two-dimensional Empirical Mode Decomposition (2-D EMD) and Riesz Transform. Firstly, the image was decomposed to multi-level Intrinsic) Mode Function (IMF) by 2-D EMD, and then the Riesz Transform with stronger local preserving ability was used for analyzing their local properties instead of the Hilbert Transform, by which the edge feature extraction with higher resolution was carried on. Finally, simulation shows that the proposed method is feasible and valid.","PeriodicalId":105513,"journal":{"name":"2010 Sixth International Conference on Semantics, Knowledge and Grids","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130396358","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}
Yi Zhao, Taoying Liu, Guanyuan Zhang, Jiangning Cui
As representative of container-level virtualization, the core idea of OpenVZ group scheduling is fairness. System ensures CPU time is shared fairly among virtual containers and among processes belonging to the same container. Thus processes may not be scheduled immediately when awakened by I/O, affecting their responsiveness and I/O throughput. If breaking this kind of absolute fairness and permitting processes to deal with current burst I/O events by borrowing their future time temporarily, I/O performance will be improved. The approach also does not destroy system fairness in the long run. The paper analyses OpenVZ group scheduling and points out factors that affect I/O performance of processes in virtual containers. To solve these problems, we make two layers of optimization. In virtual container layer, we implement container preemption based on I/O by priority queue, in bottom layer, we still permit optimized processes to take precedence over other processes to use CPU in the case of continuous I/O, also maintaining original time mechanism and minimizing system modification. We evaluate network response time, network throughput, block I/O throughput, test results demonstrate at the scheduling cost of 2.9% processes’ I/O performance is ameliorated remarkably.
{"title":"Optimization Research on Processes I/O Performance in Container-level Virtualization","authors":"Yi Zhao, Taoying Liu, Guanyuan Zhang, Jiangning Cui","doi":"10.1109/SKG.2010.20","DOIUrl":"https://doi.org/10.1109/SKG.2010.20","url":null,"abstract":"As representative of container-level virtualization, the core idea of OpenVZ group scheduling is fairness. System ensures CPU time is shared fairly among virtual containers and among processes belonging to the same container. Thus processes may not be scheduled immediately when awakened by I/O, affecting their responsiveness and I/O throughput. If breaking this kind of absolute fairness and permitting processes to deal with current burst I/O events by borrowing their future time temporarily, I/O performance will be improved. The approach also does not destroy system fairness in the long run. The paper analyses OpenVZ group scheduling and points out factors that affect I/O performance of processes in virtual containers. To solve these problems, we make two layers of optimization. In virtual container layer, we implement container preemption based on I/O by priority queue, in bottom layer, we still permit optimized processes to take precedence over other processes to use CPU in the case of continuous I/O, also maintaining original time mechanism and minimizing system modification. We evaluate network response time, network throughput, block I/O throughput, test results demonstrate at the scheduling cost of 2.9% processes’ I/O performance is ameliorated remarkably.","PeriodicalId":105513,"journal":{"name":"2010 Sixth International Conference on Semantics, Knowledge and Grids","volume":"12 9","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113990145","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}
In wireless sensor networks (WSNs), Energy consumption will be reduced by grouping all the sensor nodes into clusters and letting the data be aggregated at cluster heads(CHs). In this paper, we address the issue of how many tiers in a given clustering scheme are optimal in saving energy. We present a method to calculate the optimal tier number with consideration to the energy consumption both in data transmission and control overhead. We propose a clustering scheme with optimal tiers and energy efficiency for wireless sensor networks, which we term COTE for short. We theoretically analyze the energy consumption, computing complexity and network latency of COTE. COTE not only minimizes the energy consumption by hierarchically organizing clusters with an optimal tier but also has a low message overhead and preferable network lifetime. Simulation results demonstrate that COTE has less energy consumption and longer lifetime with comparison to the existing scheme.
{"title":"COTE: A Clustering Scheme with Optimal Tiers and Energy Efficiency in Wireless Sensor Networks","authors":"L. Tan, Y. Ying, W. Liu","doi":"10.1109/SKG.2010.26","DOIUrl":"https://doi.org/10.1109/SKG.2010.26","url":null,"abstract":"In wireless sensor networks (WSNs), Energy consumption will be reduced by grouping all the sensor nodes into clusters and letting the data be aggregated at cluster heads(CHs). In this paper, we address the issue of how many tiers in a given clustering scheme are optimal in saving energy. We present a method to calculate the optimal tier number with consideration to the energy consumption both in data transmission and control overhead. We propose a clustering scheme with optimal tiers and energy efficiency for wireless sensor networks, which we term COTE for short. We theoretically analyze the energy consumption, computing complexity and network latency of COTE. COTE not only minimizes the energy consumption by hierarchically organizing clusters with an optimal tier but also has a low message overhead and preferable network lifetime. Simulation results demonstrate that COTE has less energy consumption and longer lifetime with comparison to the existing scheme.","PeriodicalId":105513,"journal":{"name":"2010 Sixth International Conference on Semantics, Knowledge and Grids","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134463415","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}
In order to solve the problem of data integration and interoperation of heterogeneous XML sources, an ontology-based framework has been created at a semantic level in this paper. Because ontologies carries explicit semantics, In our approach, the global ontology is expressed in RDF Schema and constructed using the global-as-view approach by merging individual local ontologies, which represent XML source schemas. We provide a formal model for the mappings between XML schemas and local RDFS ontologies and those between local ontologies and the global RDFS ontology. Empirical results show that the query processing for data integration and interoperation is effective and speedy using this method . So the integration and interoperation of XML data is solved.
{"title":"Ontology-based Integration and Interoperation of XML Data","authors":"Ze Hua, JianMin Ban","doi":"10.1109/SKG.2010.77","DOIUrl":"https://doi.org/10.1109/SKG.2010.77","url":null,"abstract":"In order to solve the problem of data integration and interoperation of heterogeneous XML sources, an ontology-based framework has been created at a semantic level in this paper. Because ontologies carries explicit semantics, In our approach, the global ontology is expressed in RDF Schema and constructed using the global-as-view approach by merging individual local ontologies, which represent XML source schemas. We provide a formal model for the mappings between XML schemas and local RDFS ontologies and those between local ontologies and the global RDFS ontology. Empirical results show that the query processing for data integration and interoperation is effective and speedy using this method . So the integration and interoperation of XML data is solved.","PeriodicalId":105513,"journal":{"name":"2010 Sixth International Conference on Semantics, Knowledge and Grids","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126170415","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}
Minqi Zhou, Rong Zhang, W. Xie, Weining Qian, Aoying Zhou
Cloud Computing is becoming a well-known buzzword nowadays. Many companies, such as Amazon, Google, Microsoft and so on, accelerate their paces in developing Cloud Computing systems and enhancing their services to provide for a larger amount of users. However, security and privacy issues present a strong barrier for users to adapt into Cloud Computing systems. In this paper, we investigate several Cloud Computing system providers about their concerns on security and privacy issues. We find those concerns are not adequate and more should be added in terms of five aspects (i.e., availability, confidentiality, data integrity, control, audit) for security. Moreover, released acts on privacy are out of date to protect users' private information in the new environment (i.e., Cloud Computing system environment) since they are no longer applicable to the new relationship between users and providers, which contains three parties (i.e., Cloud service user, Cloud service provider/Cloud user, Cloud provider). Multi located data storage and services (i.e., applications) in the Cloud make privacy issues even worse. Hence, adapting released acts for new scenarios in the Cloud, it will result in more users to step into Cloud. We claim that the prosperity in Cloud Computing literature is to be coming after those security and privacy issues having be resolved.
{"title":"Security and Privacy in Cloud Computing: A Survey","authors":"Minqi Zhou, Rong Zhang, W. Xie, Weining Qian, Aoying Zhou","doi":"10.1109/SKG.2010.19","DOIUrl":"https://doi.org/10.1109/SKG.2010.19","url":null,"abstract":"Cloud Computing is becoming a well-known buzzword nowadays. Many companies, such as Amazon, Google, Microsoft and so on, accelerate their paces in developing Cloud Computing systems and enhancing their services to provide for a larger amount of users. However, security and privacy issues present a strong barrier for users to adapt into Cloud Computing systems. In this paper, we investigate several Cloud Computing system providers about their concerns on security and privacy issues. We find those concerns are not adequate and more should be added in terms of five aspects (i.e., availability, confidentiality, data integrity, control, audit) for security. Moreover, released acts on privacy are out of date to protect users' private information in the new environment (i.e., Cloud Computing system environment) since they are no longer applicable to the new relationship between users and providers, which contains three parties (i.e., Cloud service user, Cloud service provider/Cloud user, Cloud provider). Multi located data storage and services (i.e., applications) in the Cloud make privacy issues even worse. Hence, adapting released acts for new scenarios in the Cloud, it will result in more users to step into Cloud. We claim that the prosperity in Cloud Computing literature is to be coming after those security and privacy issues having be resolved.","PeriodicalId":105513,"journal":{"name":"2010 Sixth International Conference on Semantics, Knowledge and Grids","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124524170","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}
This paper addresses the problem of Ranking Internet service quality by taking a machine learning approach using multiple service features. Ranking helps find good services for applications that use services as building blocks. Unlike other ranking problems, the goodness of Internet service qualities is dependent upon multiple key features. The key features vary across different service categories and have unequally discriminative natures. This paper divides the ranking problem into four subtasks including categorizing services according to the service functionalities, identifying key features that determine the quality, denoising for feature measurement values and computing global ranking scores with multiple key features, which are cast into machine learning problems and solved using techniques classification, feature selection, clustering, and regression respectively. In particular, we propose in this paper an efficient dense-block based denoising method for subjective features, and a Supported Vector Regression based method for computing global ranking scores. Experimental results on both synthetic and real data show that the proposed approach can quantitatively identify the key features across service categories, discard noisy measurement values in 10 times faster, and compute the global ranking scores using multiple features with low mean squared errors for both linear and nonlinear ranking functions.
{"title":"Rank Internet Service Quality Using Multiple Features: A Machine Learning Approach","authors":"Dandan Tu, Chengchun Shu, Jingwei Shi, Tao Zhu, Shuang Wang, Haiyan Yu","doi":"10.1109/SKG.2010.27","DOIUrl":"https://doi.org/10.1109/SKG.2010.27","url":null,"abstract":"This paper addresses the problem of Ranking Internet service quality by taking a machine learning approach using multiple service features. Ranking helps find good services for applications that use services as building blocks. Unlike other ranking problems, the goodness of Internet service qualities is dependent upon multiple key features. The key features vary across different service categories and have unequally discriminative natures. This paper divides the ranking problem into four subtasks including categorizing services according to the service functionalities, identifying key features that determine the quality, denoising for feature measurement values and computing global ranking scores with multiple key features, which are cast into machine learning problems and solved using techniques classification, feature selection, clustering, and regression respectively. In particular, we propose in this paper an efficient dense-block based denoising method for subjective features, and a Supported Vector Regression based method for computing global ranking scores. Experimental results on both synthetic and real data show that the proposed approach can quantitatively identify the key features across service categories, discard noisy measurement values in 10 times faster, and compute the global ranking scores using multiple features with low mean squared errors for both linear and nonlinear ranking functions.","PeriodicalId":105513,"journal":{"name":"2010 Sixth International Conference on Semantics, Knowledge and Grids","volume":"197 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115970099","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 new formula for computing ST reliability of 2-State Stochastic Flow networks from Source to Terminal t was presented. The new formula contains terms which correspond one by one to a class Special sub networks, For a given networks, the terms of the new formula are fewer than those corresponding inclusion exclusion principle. An algorithm for computing ST reliability was presented, it computed ST reliability or produced a ST reliability expression by enumerating a class of Special networks of given networks. Because the structure of this class of new networks which need to be enumerated was relativity small, the new algorithm’s performance was better than inclusion exclusion principle. Finally an example illustrates our conclusion.
{"title":"Computing ST Reliability of 2-State Stochastic Flow Networks Using a New Topological Formula","authors":"Fei Gao, HaoLiang Hu","doi":"10.1109/SKG.2010.53","DOIUrl":"https://doi.org/10.1109/SKG.2010.53","url":null,"abstract":"A new formula for computing ST reliability of 2-State Stochastic Flow networks from Source to Terminal t was presented. The new formula contains terms which correspond one by one to a class Special sub networks, For a given networks, the terms of the new formula are fewer than those corresponding inclusion exclusion principle. An algorithm for computing ST reliability was presented, it computed ST reliability or produced a ST reliability expression by enumerating a class of Special networks of given networks. Because the structure of this class of new networks which need to be enumerated was relativity small, the new algorithm’s performance was better than inclusion exclusion principle. Finally an example illustrates our conclusion.","PeriodicalId":105513,"journal":{"name":"2010 Sixth International Conference on Semantics, Knowledge and Grids","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127419671","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 ontology layer of the semantic web is now mature enough (i.e. standards like RDF, RDFs, OWL, OWL 2) and the next step is to work on a logic layer for the development of advanced reasoning capabilities for knowledge extraction and efficient decision making. Adding logic to the web means using rules to make inferences. Rules are a means of expressing business processes, policies, contracts etc but most of the studies have focused on the use of monotonic logics in layered development of the semantic web which provides no mechanism for representing or handling incomplete or contradictory information respectively. This paper discusses argumentation, semantic web and defeasible logic programming with their distinct features and identifies the different research issues that need to be addressed in order to realize defeasible argumentative reasoning in the semantic web applications.
{"title":"Development of a Logic Layer in the Semantic Web: Research Issues","authors":"N. Janjua, F. Hussain","doi":"10.1109/SKG.2010.61","DOIUrl":"https://doi.org/10.1109/SKG.2010.61","url":null,"abstract":"The ontology layer of the semantic web is now mature enough (i.e. standards like RDF, RDFs, OWL, OWL 2) and the next step is to work on a logic layer for the development of advanced reasoning capabilities for knowledge extraction and efficient decision making. Adding logic to the web means using rules to make inferences. Rules are a means of expressing business processes, policies, contracts etc but most of the studies have focused on the use of monotonic logics in layered development of the semantic web which provides no mechanism for representing or handling incomplete or contradictory information respectively. This paper discusses argumentation, semantic web and defeasible logic programming with their distinct features and identifies the different research issues that need to be addressed in order to realize defeasible argumentative reasoning in the semantic web applications.","PeriodicalId":105513,"journal":{"name":"2010 Sixth International Conference on Semantics, Knowledge and Grids","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130520206","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}
There is much implicit semantic information hidden in ontology structure, which hasn’t been used in ontology matching. In this paper, we analyse the network characteristics of ontology. Propose a set of semantic and theoretical criterions to measure the different characteristics of nodes and edges. Use these quantitative characteristics to identify core concept nodes and assign weight to edges. Then, convert the ontology matching to Labelled Weighted Graph Matching problem, and use convex relaxation algorithm to solve this quadratic programming problem. We implement our prototype and experimentally evaluate our approach on data sets. The evaluation results demonstrate that structure information significant effect matching result and our approach can achieve good precision and recall.
{"title":"Approximate Ontology Matching Based on Structure Quantization","authors":"Shuai Liang, Qiang-Yi Luo, Zhenhong Huang","doi":"10.1109/SKG.2010.28","DOIUrl":"https://doi.org/10.1109/SKG.2010.28","url":null,"abstract":"There is much implicit semantic information hidden in ontology structure, which hasn’t been used in ontology matching. In this paper, we analyse the network characteristics of ontology. Propose a set of semantic and theoretical criterions to measure the different characteristics of nodes and edges. Use these quantitative characteristics to identify core concept nodes and assign weight to edges. Then, convert the ontology matching to Labelled Weighted Graph Matching problem, and use convex relaxation algorithm to solve this quadratic programming problem. We implement our prototype and experimentally evaluate our approach on data sets. The evaluation results demonstrate that structure information significant effect matching result and our approach can achieve good precision and recall.","PeriodicalId":105513,"journal":{"name":"2010 Sixth International Conference on Semantics, Knowledge and Grids","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116613426","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}
Wuqing Zhao, Xianbin Xu, Zhuowei Wang, Yuping Zhang, Shuibing He
Data grid, which provides the capability to store the mass data, has become one of the hottest topics in distributed storage research domains. However, the limited capacity of local storage devices and the high latency of network have become the bottlenecks for efficiently accessing the files in the data grids. These problems can be solved through introducing a replication strategy by which the overall performance of the system can be guaranteed. The replication strategy tries to creat multiple replicas in the distributed memory of data grid. In this paper, we propose a value-based replication strategy (VBRS) to decrease the network latency and meanwhile to improve the performance of the whole system. VBRS can be described as two steps. First, the threshold to decide whether a file should be replicated in the local storage device is introduced according to the access history and the storage capacity. Second, a measure, based on the values of the local replicas, is devised to choose the replica that should be replaced. The experiment results confirm the effectiveness of our proposed algorithm.
{"title":"Improve the Performance of Data Grids by Value-Based Replication Strategy","authors":"Wuqing Zhao, Xianbin Xu, Zhuowei Wang, Yuping Zhang, Shuibing He","doi":"10.1109/SKG.2010.48","DOIUrl":"https://doi.org/10.1109/SKG.2010.48","url":null,"abstract":"Data grid, which provides the capability to store the mass data, has become one of the hottest topics in distributed storage research domains. However, the limited capacity of local storage devices and the high latency of network have become the bottlenecks for efficiently accessing the files in the data grids. These problems can be solved through introducing a replication strategy by which the overall performance of the system can be guaranteed. The replication strategy tries to creat multiple replicas in the distributed memory of data grid. In this paper, we propose a value-based replication strategy (VBRS) to decrease the network latency and meanwhile to improve the performance of the whole system. VBRS can be described as two steps. First, the threshold to decide whether a file should be replicated in the local storage device is introduced according to the access history and the storage capacity. Second, a measure, based on the values of the local replicas, is devised to choose the replica that should be replaced. The experiment results confirm the effectiveness of our proposed algorithm.","PeriodicalId":105513,"journal":{"name":"2010 Sixth International Conference on Semantics, Knowledge and Grids","volume":"187 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132430086","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
扫码关注我们
求助内容：
应助结果提醒方式：