Pub Date : 2009-05-11DOI: 10.1109/CIMSA.2009.5069963
A. Guerriero, C. Pasquale, F. Ragni
Grid computing allows integration of geographically distributed resources, belonging to different Organization, to obtain huge computational power and data management capability that usually cannot be owned by a single computational system. Utilization of this powerful technology is mainly conditioned by tricky management of different architectures and environments and by the difficulty to identify an efficient resources selection to map grid task into grid resources that dynamically vary their features. In this paper we discuss the design and implementation of a network computing prototype system based on Java technology. The proposed multi level architecture uses the Agent paradigm to manage different complex architectures and fuzzy similarity measures to find the appropriate resource that meets task needs.
{"title":"Resources and jobs fuzzy classification in a java based grid architecture","authors":"A. Guerriero, C. Pasquale, F. Ragni","doi":"10.1109/CIMSA.2009.5069963","DOIUrl":"https://doi.org/10.1109/CIMSA.2009.5069963","url":null,"abstract":"Grid computing allows integration of geographically distributed resources, belonging to different Organization, to obtain huge computational power and data management capability that usually cannot be owned by a single computational system. Utilization of this powerful technology is mainly conditioned by tricky management of different architectures and environments and by the difficulty to identify an efficient resources selection to map grid task into grid resources that dynamically vary their features. In this paper we discuss the design and implementation of a network computing prototype system based on Java technology. The proposed multi level architecture uses the Agent paradigm to manage different complex architectures and fuzzy similarity measures to find the appropriate resource that meets task needs.","PeriodicalId":178669,"journal":{"name":"2009 IEEE International Conference on Computational Intelligence for Measurement Systems and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130619522","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 : 2009-05-11DOI: 10.1109/CIMSA.2009.5069910
V. Hasu, H. Koivo
The growing market for wireless sensor networks causes challenges and opportunities for their maintenance in the future. In various applications, sensor networks spread out to wide areas, and therefore their maintenance is costly. This paper studies application of the quality assurance knowledge of observations for the sensor network maintenance. Firstly, quality assurance techniques determine whether observations are correct or suspicious. Secondly, specially designed performance indices are applied to describe the observation history. The key is to determine the accuracy of observations and if all of them are available in the database as they are supposed to. Thirdly, maintenance routes are determined based on performance indices. Since this route-planning problem is close to the travelling salesman problem, routes are solved using either heuristic or evolutionary computing methods using somewhat similar ideas. This paper demonstrates the approach using surface weather stations.
{"title":"Automatic maintenance route planning of large-scale sensor networks","authors":"V. Hasu, H. Koivo","doi":"10.1109/CIMSA.2009.5069910","DOIUrl":"https://doi.org/10.1109/CIMSA.2009.5069910","url":null,"abstract":"The growing market for wireless sensor networks causes challenges and opportunities for their maintenance in the future. In various applications, sensor networks spread out to wide areas, and therefore their maintenance is costly. This paper studies application of the quality assurance knowledge of observations for the sensor network maintenance. Firstly, quality assurance techniques determine whether observations are correct or suspicious. Secondly, specially designed performance indices are applied to describe the observation history. The key is to determine the accuracy of observations and if all of them are available in the database as they are supposed to. Thirdly, maintenance routes are determined based on performance indices. Since this route-planning problem is close to the travelling salesman problem, routes are solved using either heuristic or evolutionary computing methods using somewhat similar ideas. This paper demonstrates the approach using surface weather stations.","PeriodicalId":178669,"journal":{"name":"2009 IEEE International Conference on Computational Intelligence for Measurement Systems and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129352143","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 : 2009-05-11DOI: 10.1109/CIMSA.2009.5069939
Jinglin Yang, Han-Xiong Li
A probabilistic support vector machine (PSVM) is proposed for classification of data with uncertainties. Performance of the traditional SVM algorithm is very sensitive to uncertainties. The noises in input space will cause uncertainties of the mapping in feature space. The traditional SVM algorithm may not be effective when uncertainty is large. A new probabilistic optimization is proposed to determine the decision boundary. The minimal distance is described probabilistically by its probability distribution function. Finally an artificial dataset and a real life dataset from UCI machine learning database are used to demonstrate the effectiveness of the proposed PSVM.
{"title":"A probabilistic support vector machine for uncertain data","authors":"Jinglin Yang, Han-Xiong Li","doi":"10.1109/CIMSA.2009.5069939","DOIUrl":"https://doi.org/10.1109/CIMSA.2009.5069939","url":null,"abstract":"A probabilistic support vector machine (PSVM) is proposed for classification of data with uncertainties. Performance of the traditional SVM algorithm is very sensitive to uncertainties. The noises in input space will cause uncertainties of the mapping in feature space. The traditional SVM algorithm may not be effective when uncertainty is large. A new probabilistic optimization is proposed to determine the decision boundary. The minimal distance is described probabilistically by its probability distribution function. Finally an artificial dataset and a real life dataset from UCI machine learning database are used to demonstrate the effectiveness of the proposed PSVM.","PeriodicalId":178669,"journal":{"name":"2009 IEEE International Conference on Computational Intelligence for Measurement Systems and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129178162","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 : 2009-05-11DOI: 10.1109/CIMSA.2009.5069962
Mehran Ziadloo, Siamak Sobhany Ghamsary, N. Mozayani
Multi-objective optimization algorithms are designed to find Pareto frontier set. This set plays a major role in multi-agent systems' negotiations. Different applications might be interested in different parts of Pareto frontier. In this paper we present a framework to show how a multi-objective optimization algorithm is evaluated against others. We used eleven algorithms implemented in MOMHLib++ library to test our framework on a two agent negotiation of binary issues and binary dependency. But our framework is easily expandable to higher number of objectives and all types of negotiations. Our analysis shows that a single scalarization value of Pareto frontier is not enough to compare multi-objective optimization algorithms, as it is done in most cases.
{"title":"A framework to evaluate multi-objective optimization algorithms in multi-agent negotiations","authors":"Mehran Ziadloo, Siamak Sobhany Ghamsary, N. Mozayani","doi":"10.1109/CIMSA.2009.5069962","DOIUrl":"https://doi.org/10.1109/CIMSA.2009.5069962","url":null,"abstract":"Multi-objective optimization algorithms are designed to find Pareto frontier set. This set plays a major role in multi-agent systems' negotiations. Different applications might be interested in different parts of Pareto frontier. In this paper we present a framework to show how a multi-objective optimization algorithm is evaluated against others. We used eleven algorithms implemented in MOMHLib++ library to test our framework on a two agent negotiation of binary issues and binary dependency. But our framework is easily expandable to higher number of objectives and all types of negotiations. Our analysis shows that a single scalarization value of Pareto frontier is not enough to compare multi-objective optimization algorithms, as it is done in most cases.","PeriodicalId":178669,"journal":{"name":"2009 IEEE International Conference on Computational Intelligence for Measurement Systems and Applications","volume":"116 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117257417","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 : 2009-05-11DOI: 10.1109/CIMSA.2009.5069923
Chen Guangzhu, Zhu Zhencai, Lu Qian, Z. Lijuan, Cao Guohua
The sliding between the wire rope and the liner is the most dangerous accident of friction lifting, it is necessary to do work to avoid sliding accident. We analysis the friction lifting dynamics behavior firstly, then build a creep model of friction lifting, based on which, a sliding phenomenon can be detected through collecting the difference of the velocities between the friction wheel and the guide wheel of friction lifting system. Base on the presented detection method, a wireless sliding detection system is developed, which consists of a host node in a lifting monitor room and two child nodes installed on the friction wheel and the guide wheel respectively. In the system, two child nodes collects the velocity of friction wheel and the guide wheel respectively, and transmit data to the host node by the wireless communication, then host node calculates the difference of the velocities between the friction wheel and the guide wheel ,and detects the sliding phenomenon. In the end, a wireless communication test between the host node and child node is presented, the test results displays that the velocity of the friction wheel and the guide wheel can be detected in real-time, and the host node can receive the data sent by the child nodes through wireless transmission.
{"title":"Research on wireless detection policy of the friction lifting'sliding","authors":"Chen Guangzhu, Zhu Zhencai, Lu Qian, Z. Lijuan, Cao Guohua","doi":"10.1109/CIMSA.2009.5069923","DOIUrl":"https://doi.org/10.1109/CIMSA.2009.5069923","url":null,"abstract":"The sliding between the wire rope and the liner is the most dangerous accident of friction lifting, it is necessary to do work to avoid sliding accident. We analysis the friction lifting dynamics behavior firstly, then build a creep model of friction lifting, based on which, a sliding phenomenon can be detected through collecting the difference of the velocities between the friction wheel and the guide wheel of friction lifting system. Base on the presented detection method, a wireless sliding detection system is developed, which consists of a host node in a lifting monitor room and two child nodes installed on the friction wheel and the guide wheel respectively. In the system, two child nodes collects the velocity of friction wheel and the guide wheel respectively, and transmit data to the host node by the wireless communication, then host node calculates the difference of the velocities between the friction wheel and the guide wheel ,and detects the sliding phenomenon. In the end, a wireless communication test between the host node and child node is presented, the test results displays that the velocity of the friction wheel and the guide wheel can be detected in real-time, and the host node can receive the data sent by the child nodes through wireless transmission.","PeriodicalId":178669,"journal":{"name":"2009 IEEE International Conference on Computational Intelligence for Measurement Systems and Applications","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125487029","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 : 2009-05-11DOI: 10.1109/CIMSA.2009.5069906
Dong Ming, Yanru Bai, Cong Zhang, B. Wan, Yong Hu, K. Luk
Gait is a potential behavioral feature, and many allied studies have demonstrated that it can be served as a useful biometric feature for recognition. This paper described a novel gait recognition technique based on support vector machine fusion of contour projection and skeleton model features. A principal component analysis method was used to lower the dimension of contour projection after segmenting silhouettes from the background in the key frame of gait picture sequence and a skeleton model was built to produce other shape features. The combining features were fused by a support vector machine and tested on the CASIA database at the feature level and decision level based on posterior probability. Experimental results have demonstrated the effectiveness and advantages of the proposed algorithm.
{"title":"Novel gait recognition technique based on SVM fusion of PCA-processed contour projection and skeleton model features","authors":"Dong Ming, Yanru Bai, Cong Zhang, B. Wan, Yong Hu, K. Luk","doi":"10.1109/CIMSA.2009.5069906","DOIUrl":"https://doi.org/10.1109/CIMSA.2009.5069906","url":null,"abstract":"Gait is a potential behavioral feature, and many allied studies have demonstrated that it can be served as a useful biometric feature for recognition. This paper described a novel gait recognition technique based on support vector machine fusion of contour projection and skeleton model features. A principal component analysis method was used to lower the dimension of contour projection after segmenting silhouettes from the background in the key frame of gait picture sequence and a skeleton model was built to produce other shape features. The combining features were fused by a support vector machine and tested on the CASIA database at the feature level and decision level based on posterior probability. Experimental results have demonstrated the effectiveness and advantages of the proposed algorithm.","PeriodicalId":178669,"journal":{"name":"2009 IEEE International Conference on Computational Intelligence for Measurement Systems and Applications","volume":"123 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128054781","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 : 2009-05-11DOI: 10.1109/CIMSA.2009.5069918
V. Di Lecce, M. Calabrese, V. Piuri
Detecting human presence automatically is a challenging task since several environmental parameters may affect the quality and the continuity of detection. Although many techniques have been developed so far in the literature to solve this problem, they generally rely on well-defined operational context. Hence, they are sensitive to uncontrolled variables and unpredicted events. In this work an ontology-based approach to human telepresence detection is presented. Contrarily to classic sensor-driven techniques, a top-down methodology is applied. Starting from a formal description of the problem ontology, a set of high-response rate and low-response rate sensors is employed in a computational model. As a consequence of this model, a multi-sensor equipped device has been experimentally setup to conduct measurements on real scenarios. Experiments have been devised to estimate the robustness of the detection. In particular, some preliminary evaluations related to using a minimal set of chemical sensors are reported.
{"title":"An ontology-based approach to human telepresence","authors":"V. Di Lecce, M. Calabrese, V. Piuri","doi":"10.1109/CIMSA.2009.5069918","DOIUrl":"https://doi.org/10.1109/CIMSA.2009.5069918","url":null,"abstract":"Detecting human presence automatically is a challenging task since several environmental parameters may affect the quality and the continuity of detection. Although many techniques have been developed so far in the literature to solve this problem, they generally rely on well-defined operational context. Hence, they are sensitive to uncontrolled variables and unpredicted events. In this work an ontology-based approach to human telepresence detection is presented. Contrarily to classic sensor-driven techniques, a top-down methodology is applied. Starting from a formal description of the problem ontology, a set of high-response rate and low-response rate sensors is employed in a computational model. As a consequence of this model, a multi-sensor equipped device has been experimentally setup to conduct measurements on real scenarios. Experiments have been devised to estimate the robustness of the detection. In particular, some preliminary evaluations related to using a minimal set of chemical sensors are reported.","PeriodicalId":178669,"journal":{"name":"2009 IEEE International Conference on Computational Intelligence for Measurement Systems and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125870414","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 : 2009-05-11DOI: 10.1109/CIMSA.2009.5069933
K. Wang, S. Choi
Research on flow shop scheduling generally ignores uncertainties in real-world production because of the inherent difficulties of the problem. Scheduling problems with stochastic machine breakdown are difficult to solve optimally by a single approach. This paper considers makespan optimization of a flexible flow shop (FFS) scheduling problem with machine breakdown. It proposes a novel decomposition based approach (DBA) to decompose a problem into several sub-problems which can be solved more easily, while the neighbouring K-means clustering algorithm is employed to group the machines of an FFS into a few clusters. A back propagation network (BPN) is then adopted to assign either the shortest processing time (SPT) or the genetic algorithm (GA) to each cluster to solve the sub-problems. If two neighbouring clusters are allocated with the same approach, they are subsequently merged. After machine grouping and approach assignment, an overall schedule is generated by integrating the solutions to the sub-problems. Computation results reveal that the proposed approach is superior to SPT and GA alone for FFS scheduling with machine breakdown.
{"title":"A decomposition based algorithm for flexible flow shop scheduling with machine breakdown","authors":"K. Wang, S. Choi","doi":"10.1109/CIMSA.2009.5069933","DOIUrl":"https://doi.org/10.1109/CIMSA.2009.5069933","url":null,"abstract":"Research on flow shop scheduling generally ignores uncertainties in real-world production because of the inherent difficulties of the problem. Scheduling problems with stochastic machine breakdown are difficult to solve optimally by a single approach. This paper considers makespan optimization of a flexible flow shop (FFS) scheduling problem with machine breakdown. It proposes a novel decomposition based approach (DBA) to decompose a problem into several sub-problems which can be solved more easily, while the neighbouring K-means clustering algorithm is employed to group the machines of an FFS into a few clusters. A back propagation network (BPN) is then adopted to assign either the shortest processing time (SPT) or the genetic algorithm (GA) to each cluster to solve the sub-problems. If two neighbouring clusters are allocated with the same approach, they are subsequently merged. After machine grouping and approach assignment, an overall schedule is generated by integrating the solutions to the sub-problems. Computation results reveal that the proposed approach is superior to SPT and GA alone for FFS scheduling with machine breakdown.","PeriodicalId":178669,"journal":{"name":"2009 IEEE International Conference on Computational Intelligence for Measurement Systems and Applications","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122270691","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 : 2009-05-11DOI: 10.1109/CIMSA.2009.5069948
Yi-Xiang Zhao, Xin-Du Chen, Xin Chen
In tire manufacturing the vulcanizer has been widely used to squeeze the tire in a mould onto heat board with the high pressure and high temperature. For accurate control of the machine, it is vital to have a repeatable hydraulic cylinder system. However, due to the internal parameter inconsistency, the repeatability position accuracy of hydraulic cylinder system is hard to maintain. Using the fuzzy arithmetic, a hydraulic cylinder system with uncertain parameters can be developed. By taking into account of unstable oil behavior, hydraulic system leakage, working loads variation, this model can be used to describe the system repeatability position accuracy. Analysis of the simulation results shows that the repeatability is more sensitive to the hydraulic leakage than the other two factors.
{"title":"Repeatability analysis of a vulcanizer hydraulic cylinder system using fuzzy arithmetic","authors":"Yi-Xiang Zhao, Xin-Du Chen, Xin Chen","doi":"10.1109/CIMSA.2009.5069948","DOIUrl":"https://doi.org/10.1109/CIMSA.2009.5069948","url":null,"abstract":"In tire manufacturing the vulcanizer has been widely used to squeeze the tire in a mould onto heat board with the high pressure and high temperature. For accurate control of the machine, it is vital to have a repeatable hydraulic cylinder system. However, due to the internal parameter inconsistency, the repeatability position accuracy of hydraulic cylinder system is hard to maintain. Using the fuzzy arithmetic, a hydraulic cylinder system with uncertain parameters can be developed. By taking into account of unstable oil behavior, hydraulic system leakage, working loads variation, this model can be used to describe the system repeatability position accuracy. Analysis of the simulation results shows that the repeatability is more sensitive to the hydraulic leakage than the other two factors.","PeriodicalId":178669,"journal":{"name":"2009 IEEE International Conference on Computational Intelligence for Measurement Systems and Applications","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132932946","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 : 2009-05-11DOI: 10.1109/CIMSA.2009.5069938
Bai Hua, Ping Bai
Multimodal inspection is widely used in the diagnosis and evaluation for complex engineering systems. By the use of multiple sensors, a reasonable reasoning approach is required to fuse multi-data acquired over conventional single modality sensors in inspection. In this paper, an enhanced evidential reasoning algorithm to effectively combine uncertain information is presented. We begin with a summary of the relative strength and weakness of vague sets and D-S theory, then the similarity between them is discussed, thereafter an enhanced reasoning algorithm is proposed by combining vague sets and D-S theory to realize the diagnosis and evaluation under the situation in which the presented information from various source is not only uncertain but also imprecise and vague. An example is finally given to illustrate the discussion.
{"title":"An enhanced reasoning approach for multimodal inspection data fusion","authors":"Bai Hua, Ping Bai","doi":"10.1109/CIMSA.2009.5069938","DOIUrl":"https://doi.org/10.1109/CIMSA.2009.5069938","url":null,"abstract":"Multimodal inspection is widely used in the diagnosis and evaluation for complex engineering systems. By the use of multiple sensors, a reasonable reasoning approach is required to fuse multi-data acquired over conventional single modality sensors in inspection. In this paper, an enhanced evidential reasoning algorithm to effectively combine uncertain information is presented. We begin with a summary of the relative strength and weakness of vague sets and D-S theory, then the similarity between them is discussed, thereafter an enhanced reasoning algorithm is proposed by combining vague sets and D-S theory to realize the diagnosis and evaluation under the situation in which the presented information from various source is not only uncertain but also imprecise and vague. An example is finally given to illustrate the discussion.","PeriodicalId":178669,"journal":{"name":"2009 IEEE International Conference on Computational Intelligence for Measurement Systems and Applications","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115335640","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
扫码关注我们
求助内容：
应助结果提醒方式：