Pub Date : 2012-11-01DOI: 10.1109/ISDA.2012.6416537
A. Andreica, Camelia Chira
Resource-Constrained Project Scheduling is an NP-hard problem very attractive for researchers due to its large area of applications. This paper concentrates on the evolutionary approaches to Resource-Constrained Project Scheduling based on permutation encoded individuals. A new recombination operator is proposed and a comparative analysis of several recombination operators is presented based on computational experiments for several project instances. Numerical results emphasize a good performance of the proposed crossover scheme which takes into account information from the global best individual besides the genetic material from parents.
{"title":"The role of crossover in evolutionary approaches to Resource-Constrained Project Scheduling","authors":"A. Andreica, Camelia Chira","doi":"10.1109/ISDA.2012.6416537","DOIUrl":"https://doi.org/10.1109/ISDA.2012.6416537","url":null,"abstract":"Resource-Constrained Project Scheduling is an NP-hard problem very attractive for researchers due to its large area of applications. This paper concentrates on the evolutionary approaches to Resource-Constrained Project Scheduling based on permutation encoded individuals. A new recombination operator is proposed and a comparative analysis of several recombination operators is presented based on computational experiments for several project instances. Numerical results emphasize a good performance of the proposed crossover scheme which takes into account information from the global best individual besides the genetic material from parents.","PeriodicalId":370150,"journal":{"name":"2012 12th International Conference on Intelligent Systems Design and Applications (ISDA)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128685224","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}
Pub Date : 2012-11-01DOI: 10.1109/ISDA.2012.6416626
B. P. Bruck, A. G. Santos, J. Arroyo
In this work we propose some metaheuristics to solve a routing problem with mandatory deliveries and selective pickups. There are two integer programming formulations proposed in the literature but they are able to solve to optimality only small-sized instances. Some greedy heuristics and metaheuristics have also been proposed: Tabu Search, General Variable Neighborhood Search and Evolutionary Algorithm. Here we proposed an Iterated Local Search and a Variable Neighborhood Search algorithms, and improve the performance of the previous Evolutionary Algorithm. We present experimental results on 68 instances and show that our methods outperforms the others in several cases, finding better solutions for 21 of them. Using a theoretical lower bound we prove the optimality of the solutions for 8 instances.
{"title":"Metaheuristics for the single vehicle routing problem with deliveries and selective pickups","authors":"B. P. Bruck, A. G. Santos, J. Arroyo","doi":"10.1109/ISDA.2012.6416626","DOIUrl":"https://doi.org/10.1109/ISDA.2012.6416626","url":null,"abstract":"In this work we propose some metaheuristics to solve a routing problem with mandatory deliveries and selective pickups. There are two integer programming formulations proposed in the literature but they are able to solve to optimality only small-sized instances. Some greedy heuristics and metaheuristics have also been proposed: Tabu Search, General Variable Neighborhood Search and Evolutionary Algorithm. Here we proposed an Iterated Local Search and a Variable Neighborhood Search algorithms, and improve the performance of the previous Evolutionary Algorithm. We present experimental results on 68 instances and show that our methods outperforms the others in several cases, finding better solutions for 21 of them. Using a theoretical lower bound we prove the optimality of the solutions for 8 instances.","PeriodicalId":370150,"journal":{"name":"2012 12th International Conference on Intelligent Systems Design and Applications (ISDA)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128459583","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}
Pub Date : 2012-11-01DOI: 10.1109/ISDA.2012.6416614
Narsimha Baddiri, B. N. K. Christu, B. Santhosh Kumar, Syed Zaheeruddin
In this paper we presented a color image enhancement model to overcome the drawbacks associated with illumination-reflectance model of color image enhancement. In this work a new color image enhancement technique based on the Principal Component Analysis (PCA) and singular value decomposition is proposed and comparative analysis is made with IR based model using discrete wavelet transform (DWT) & SVD and Retinex model. The real color image is transformed from RGB to HSV space which is an orthonormal transform between achromatic and chromatic components. The chromatic component is decomposed in to illumination and reflectance using Homomorphic filtering and the reflectance image is accounted for the variation in brightness and is decomposed into four Principal components using (PCA) which involves decomposition of an image into feature based low frequency and high frequency sub bands. Estimates of singular value matrix are carried on low frequency which accounts for contrast of the image, and then modified reflectance is achieved from SVD equalized principal component. The experiment results reveal that the proposed method shows that the color images are enhanced with details preserved and `halos' restrained. To indicate the impact of enhancement of true color images quantitative measurements like discrete entropy, relative entropy and quality metrics are computed.
{"title":"IR based color image preprocessing using PCA with SVD equalization","authors":"Narsimha Baddiri, B. N. K. Christu, B. Santhosh Kumar, Syed Zaheeruddin","doi":"10.1109/ISDA.2012.6416614","DOIUrl":"https://doi.org/10.1109/ISDA.2012.6416614","url":null,"abstract":"In this paper we presented a color image enhancement model to overcome the drawbacks associated with illumination-reflectance model of color image enhancement. In this work a new color image enhancement technique based on the Principal Component Analysis (PCA) and singular value decomposition is proposed and comparative analysis is made with IR based model using discrete wavelet transform (DWT) & SVD and Retinex model. The real color image is transformed from RGB to HSV space which is an orthonormal transform between achromatic and chromatic components. The chromatic component is decomposed in to illumination and reflectance using Homomorphic filtering and the reflectance image is accounted for the variation in brightness and is decomposed into four Principal components using (PCA) which involves decomposition of an image into feature based low frequency and high frequency sub bands. Estimates of singular value matrix are carried on low frequency which accounts for contrast of the image, and then modified reflectance is achieved from SVD equalized principal component. The experiment results reveal that the proposed method shows that the color images are enhanced with details preserved and `halos' restrained. To indicate the impact of enhancement of true color images quantitative measurements like discrete entropy, relative entropy and quality metrics are computed.","PeriodicalId":370150,"journal":{"name":"2012 12th International Conference on Intelligent Systems Design and Applications (ISDA)","volume":"1940 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129238496","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}
Pub Date : 2012-11-01DOI: 10.1109/ISDA.2012.6416669
Kazuhiko Takahashi
This paper investigates the application of quantum neural networks to control nonholonomic systems. In this study, the falling cat is treated as an example of a control object. The cat is modelled as two similar cylindrical rigid bodies that represent the front and rear half of its body and the motion of the falling cat is formulated by considering the law of conservation of angular momentum. Because of nonholonomic constraints, the motion control of the falling cat can be treated as a symmetrically affine system without a drift term. A quantum neural controller in which the quantum neural network uses qubit neurons as the information processing unit is designed to solve the control problem that brings the nonholonomic system from the initial to desired position. The computational experiments indicate the feasibility and characteristics of the quantum neural controller in dealing with a nonholonomic system.
{"title":"Remarks on motion control of nonholonomic system (falling cat) by using a quantum neural controller","authors":"Kazuhiko Takahashi","doi":"10.1109/ISDA.2012.6416669","DOIUrl":"https://doi.org/10.1109/ISDA.2012.6416669","url":null,"abstract":"This paper investigates the application of quantum neural networks to control nonholonomic systems. In this study, the falling cat is treated as an example of a control object. The cat is modelled as two similar cylindrical rigid bodies that represent the front and rear half of its body and the motion of the falling cat is formulated by considering the law of conservation of angular momentum. Because of nonholonomic constraints, the motion control of the falling cat can be treated as a symmetrically affine system without a drift term. A quantum neural controller in which the quantum neural network uses qubit neurons as the information processing unit is designed to solve the control problem that brings the nonholonomic system from the initial to desired position. The computational experiments indicate the feasibility and characteristics of the quantum neural controller in dealing with a nonholonomic system.","PeriodicalId":370150,"journal":{"name":"2012 12th International Conference on Intelligent Systems Design and Applications (ISDA)","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115455940","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}
Pub Date : 2012-11-01DOI: 10.1109/ISDA.2012.6416590
Christian Veenhuis
In recent years a number of web-technology supported communities of humans have been developed. Such a web community is able to let emerge a collective intelligence with a higher performance in solving problems than the single members of the community. Based on the successes of collective intelligence systems like Wikipedia, the web encyclopedia, the question arises, whether such a collaborative web community could also be capable of function optimization. This paper introduces an optimization algorithm called Community Optimization (CO), which optimizes a function by simulating a collaborative web community, which edits or improves an article-base, or, more general, a knowledge-base. In order to realize this, CO implements a behavioral model derived from the human behavior that can be observed within certain types of web communities (e.g., Wikipedia or open source communities). The introduced CO method is applied to four well-known benchmark problems. CO significantly outperformed the Fully Informed Particle Swarm Optimization as well as two Differential Evolution approaches in all four cases especially in higher dimensions.
{"title":"Community optimization: Function optimization by a simulated web community","authors":"Christian Veenhuis","doi":"10.1109/ISDA.2012.6416590","DOIUrl":"https://doi.org/10.1109/ISDA.2012.6416590","url":null,"abstract":"In recent years a number of web-technology supported communities of humans have been developed. Such a web community is able to let emerge a collective intelligence with a higher performance in solving problems than the single members of the community. Based on the successes of collective intelligence systems like Wikipedia, the web encyclopedia, the question arises, whether such a collaborative web community could also be capable of function optimization. This paper introduces an optimization algorithm called Community Optimization (CO), which optimizes a function by simulating a collaborative web community, which edits or improves an article-base, or, more general, a knowledge-base. In order to realize this, CO implements a behavioral model derived from the human behavior that can be observed within certain types of web communities (e.g., Wikipedia or open source communities). The introduced CO method is applied to four well-known benchmark problems. CO significantly outperformed the Fully Informed Particle Swarm Optimization as well as two Differential Evolution approaches in all four cases especially in higher dimensions.","PeriodicalId":370150,"journal":{"name":"2012 12th International Conference on Intelligent Systems Design and Applications (ISDA)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114462823","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}
Pub Date : 2012-11-01DOI: 10.1109/ISDA.2012.6416667
K. Gao, P. N. Suganthan, T. Chua
This paper proposes a pareto-based discrete harmony search (PDHS) algorithm to solve multi-objective FJSP. The objectives are the minimization of two criteria namely, the maximum of the completion time (Makespan) and the mean earliness and tardiness. Firstly, we develop a new method for the initial the machine assignment task. Some existing heuristics are also employed for initializing the harmony memory. Hence, harmony memory is filled with discrete machine permutation for machine assignment and job permutation for operation sequence. Secondly, we develop a new rule for the improvisation to produce a new harmony for FJSP. The machine assignment and operation sequence are processed respectively. Thirdly, several local search methods are embedded to enhance the algorithm's local exploitation ability. Finally, extensive computational experiments are carried out using well-known benchmark instances. Computational results and comparisons show the efficiency and effectiveness of the proposed pareto-based discrete harmony search algorithm for solving the multi-objective flexible job-shop scheduling problem.
{"title":"Pareto-based discrete harmony search algorithm for flexible job shop scheduling","authors":"K. Gao, P. N. Suganthan, T. Chua","doi":"10.1109/ISDA.2012.6416667","DOIUrl":"https://doi.org/10.1109/ISDA.2012.6416667","url":null,"abstract":"This paper proposes a pareto-based discrete harmony search (PDHS) algorithm to solve multi-objective FJSP. The objectives are the minimization of two criteria namely, the maximum of the completion time (Makespan) and the mean earliness and tardiness. Firstly, we develop a new method for the initial the machine assignment task. Some existing heuristics are also employed for initializing the harmony memory. Hence, harmony memory is filled with discrete machine permutation for machine assignment and job permutation for operation sequence. Secondly, we develop a new rule for the improvisation to produce a new harmony for FJSP. The machine assignment and operation sequence are processed respectively. Thirdly, several local search methods are embedded to enhance the algorithm's local exploitation ability. Finally, extensive computational experiments are carried out using well-known benchmark instances. Computational results and comparisons show the efficiency and effectiveness of the proposed pareto-based discrete harmony search algorithm for solving the multi-objective flexible job-shop scheduling problem.","PeriodicalId":370150,"journal":{"name":"2012 12th International Conference on Intelligent Systems Design and Applications (ISDA)","volume":"2013 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114877930","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}
Pub Date : 2012-11-01DOI: 10.1109/ISDA.2012.6416613
H. Veisi, H. Sameti
This paper studies a number of well-known noise estimation techniques and provides a comparative performance analysis of them in speech enhancement platform. Two types of evaluation data that simulate consistent and inconsistent noisy conditions are prepared in the presence of six noise types at different SNR levels. The performance of speech enhancement systems and the spectrum distance of the estimated and original noise spectrums are used as evaluation criteria. The evaluations indicate that a simple VAD method outperforms noise estimation methods in most of the consistent noisy conditions.
{"title":"A comparative study on single-channel noise estimation methods for speech enhancement","authors":"H. Veisi, H. Sameti","doi":"10.1109/ISDA.2012.6416613","DOIUrl":"https://doi.org/10.1109/ISDA.2012.6416613","url":null,"abstract":"This paper studies a number of well-known noise estimation techniques and provides a comparative performance analysis of them in speech enhancement platform. Two types of evaluation data that simulate consistent and inconsistent noisy conditions are prepared in the presence of six noise types at different SNR levels. The performance of speech enhancement systems and the spectrum distance of the estimated and original noise spectrums are used as evaluation criteria. The evaluations indicate that a simple VAD method outperforms noise estimation methods in most of the consistent noisy conditions.","PeriodicalId":370150,"journal":{"name":"2012 12th International Conference on Intelligent Systems Design and Applications (ISDA)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125362330","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}
Pub Date : 2012-11-01DOI: 10.1109/ISDA.2012.6416589
Narender Kumar, V. Kosse, A. Oloyede
At present, for mechanical power transmission, Cycloidal drives are most preferred - for compact, high transmission ratio speed reduction, especially for robot joints and manipulator applications. Research on drive-train dynamics of Cycloidal drives is not well-established. This paper presents a testing rig for Cycloidal drives, which would produce data for development of mathematical models and investigation of drive-train dynamics, further aiding in optimising its design.
{"title":"A novel testing system for a Cycloidal drive","authors":"Narender Kumar, V. Kosse, A. Oloyede","doi":"10.1109/ISDA.2012.6416589","DOIUrl":"https://doi.org/10.1109/ISDA.2012.6416589","url":null,"abstract":"At present, for mechanical power transmission, Cycloidal drives are most preferred - for compact, high transmission ratio speed reduction, especially for robot joints and manipulator applications. Research on drive-train dynamics of Cycloidal drives is not well-established. This paper presents a testing rig for Cycloidal drives, which would produce data for development of mathematical models and investigation of drive-train dynamics, further aiding in optimising its design.","PeriodicalId":370150,"journal":{"name":"2012 12th International Conference on Intelligent Systems Design and Applications (ISDA)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125984998","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}
Pub Date : 2012-11-01DOI: 10.1109/ISDA.2012.6416597
D. Chandrappa, M. Ravishankar
The objective of this work is the integration and optimization of an automatic face detection and recognition system for crowded scene. Face detection and recognition has many applications in a variety of fields such as authentication, security, video surveillance and human interaction systems. Identifying faces is quite simple for human beings because it comes naturally but it is not so easy to teach a computer to detect faces in an image and recognize them. In this paper new hybrid approach is proposed for face detection and recognition of faces in a given image, which is fully automated process. Face detection is performed by color segmentation, image segmentation and multi layered clutter filtering. The detected faces are given as input to Independent Component Analysis (ICA), which performs face recognition. The proposed approach has achieved high detection and Recognition rate for faces at cluttered background.
{"title":"Automatic face recognition in a crowded scene using multi layered clutter filtering and independent component analysis","authors":"D. Chandrappa, M. Ravishankar","doi":"10.1109/ISDA.2012.6416597","DOIUrl":"https://doi.org/10.1109/ISDA.2012.6416597","url":null,"abstract":"The objective of this work is the integration and optimization of an automatic face detection and recognition system for crowded scene. Face detection and recognition has many applications in a variety of fields such as authentication, security, video surveillance and human interaction systems. Identifying faces is quite simple for human beings because it comes naturally but it is not so easy to teach a computer to detect faces in an image and recognize them. In this paper new hybrid approach is proposed for face detection and recognition of faces in a given image, which is fully automated process. Face detection is performed by color segmentation, image segmentation and multi layered clutter filtering. The detected faces are given as input to Independent Component Analysis (ICA), which performs face recognition. The proposed approach has achieved high detection and Recognition rate for faces at cluttered background.","PeriodicalId":370150,"journal":{"name":"2012 12th International Conference on Intelligent Systems Design and Applications (ISDA)","volume":"173 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124245522","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}
Pub Date : 2012-11-01DOI: 10.1109/ISDA.2012.6416583
V. Aakanksha, Punam Bedi
Advancements in wireless technology, has led to the increased use of wireless handheld mobile devices. The proliferation of a vast number of these devices and the curiosity of the young generation about the information available on the internet anytime anywhere has resulted in a ubiquitous computing scenario. Ubiquitous computing consists of various kinds of computational devices, networks, collaborating software and hardware entities that are required to be interoperable and discoverable in order to communicate with each other. Interoperability is the ability of two or more systems or components to exchange information and to use the information that has been exchanged. In a highly dynamic and distributed environment like MANets, the basic issue is the discoverability of devices and services by the other entities in the system. This paper presents a framework that supports the discoverability and interoperability of the devices forming an ad-hoc network for ubiquitous applications. The proposed approach uses the Mobile Process (Agents) Group to allow devices on the network to interact with one another. It uses group communication semantics to discover devices and interoperate with those devices. The approach does not impose any constraints at device development time instead uses only run-time constraints.
{"title":"Mobile process groups based device/service discovery and interoperability in MANets","authors":"V. Aakanksha, Punam Bedi","doi":"10.1109/ISDA.2012.6416583","DOIUrl":"https://doi.org/10.1109/ISDA.2012.6416583","url":null,"abstract":"Advancements in wireless technology, has led to the increased use of wireless handheld mobile devices. The proliferation of a vast number of these devices and the curiosity of the young generation about the information available on the internet anytime anywhere has resulted in a ubiquitous computing scenario. Ubiquitous computing consists of various kinds of computational devices, networks, collaborating software and hardware entities that are required to be interoperable and discoverable in order to communicate with each other. Interoperability is the ability of two or more systems or components to exchange information and to use the information that has been exchanged. In a highly dynamic and distributed environment like MANets, the basic issue is the discoverability of devices and services by the other entities in the system. This paper presents a framework that supports the discoverability and interoperability of the devices forming an ad-hoc network for ubiquitous applications. The proposed approach uses the Mobile Process (Agents) Group to allow devices on the network to interact with one another. It uses group communication semantics to discover devices and interoperate with those devices. The approach does not impose any constraints at device development time instead uses only run-time constraints.","PeriodicalId":370150,"journal":{"name":"2012 12th International Conference on Intelligent Systems Design and Applications (ISDA)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123747713","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
扫码关注我们
求助内容：
应助结果提醒方式：