Pub Date : 2006-10-01DOI: 10.1109/COASE.2006.326872
Z. Qiu, Jingyuan Mao, Yong He
Precision agriculture is an informational agriculture, and is the developing direction of modern agriculture. How to acquire information is the key problem of precision agriculture. The objective of this research is to design a system to obtain information from field. This system consists of two parts. One is a portable instrument based on MSC-51, which can be used to measure multiple information of field. It includes longitude and latitude of the measurement position, moisture, pH value and electric conductivity (EC) of soil, temperature and humidity of atmosphere and intensity of illumination. The other part is a piece of software based on Visual Basic, which can be used to communicate with the portable instrument and process data. The validation results showed that this system could rapidly and accurately acquire information of filed
{"title":"The Design of Field Information Detection System Based on Microcomputer","authors":"Z. Qiu, Jingyuan Mao, Yong He","doi":"10.1109/COASE.2006.326872","DOIUrl":"https://doi.org/10.1109/COASE.2006.326872","url":null,"abstract":"Precision agriculture is an informational agriculture, and is the developing direction of modern agriculture. How to acquire information is the key problem of precision agriculture. The objective of this research is to design a system to obtain information from field. This system consists of two parts. One is a portable instrument based on MSC-51, which can be used to measure multiple information of field. It includes longitude and latitude of the measurement position, moisture, pH value and electric conductivity (EC) of soil, temperature and humidity of atmosphere and intensity of illumination. The other part is a piece of software based on Visual Basic, which can be used to communicate with the portable instrument and process data. The validation results showed that this system could rapidly and accurately acquire information of filed","PeriodicalId":116108,"journal":{"name":"2006 IEEE International Conference on Automation Science and Engineering","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126157636","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 : 2006-10-01DOI: 10.1109/COASE.2006.326865
Yingzhe Li, Zhong-qin Lin, Hao Wang, Yong Chen
A unified modelling and simulating integration is necessary to analyse multidisciplinary systems with an effective method, adapting to multiple disciplinary domains. In this process, it is well known that 2D or 3D mechanical multibody dynamic analysis is a bottleneck problem. Based on the linear graph theory and object-oriented module technology, we propose EELG (extensible element linear graph) method that can be applied to automatically generate component-level dynamic equations for describing multidisciplinary systems, first encapsulated linear graph into the element linear graph, defined element through and circuit matrixes respectively deserved from the across-graph and through-graph of an element linear graph, and made the member module with the hierarchy, reusing and extensibility. By linking these standard modules successively to model a particular system, the component-level dynamic equations would be automatically generated by topology matrixes operation. This approach provides greater modelling flexibility and supports the model's versatility
{"title":"Automatic Generation of Component-level Dynamic Equations Using Extensible Element Linear Graph Method","authors":"Yingzhe Li, Zhong-qin Lin, Hao Wang, Yong Chen","doi":"10.1109/COASE.2006.326865","DOIUrl":"https://doi.org/10.1109/COASE.2006.326865","url":null,"abstract":"A unified modelling and simulating integration is necessary to analyse multidisciplinary systems with an effective method, adapting to multiple disciplinary domains. In this process, it is well known that 2D or 3D mechanical multibody dynamic analysis is a bottleneck problem. Based on the linear graph theory and object-oriented module technology, we propose EELG (extensible element linear graph) method that can be applied to automatically generate component-level dynamic equations for describing multidisciplinary systems, first encapsulated linear graph into the element linear graph, defined element through and circuit matrixes respectively deserved from the across-graph and through-graph of an element linear graph, and made the member module with the hierarchy, reusing and extensibility. By linking these standard modules successively to model a particular system, the component-level dynamic equations would be automatically generated by topology matrixes operation. This approach provides greater modelling flexibility and supports the model's versatility","PeriodicalId":116108,"journal":{"name":"2006 IEEE International Conference on Automation Science and Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127726433","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 : 2006-10-01DOI: 10.1109/COASE.2006.326883
Y. Shang, Qifeng Yu, Zhiqiang Qiu
The problems of eye-hand calibration for robots and the two-step method are analyzed. An algorithm for two-step eye-hand calibration by resolving linear equations directly is presented and validated by simulated data experiments. Without using rotation axis or quaternion, the presented algorithm simplifies the procedure of two-step eye-hand calibration and is easy to understand
{"title":"Algorithm of Two-Step Eye-Hand Calibration by Resolving Linear Equations","authors":"Y. Shang, Qifeng Yu, Zhiqiang Qiu","doi":"10.1109/COASE.2006.326883","DOIUrl":"https://doi.org/10.1109/COASE.2006.326883","url":null,"abstract":"The problems of eye-hand calibration for robots and the two-step method are analyzed. An algorithm for two-step eye-hand calibration by resolving linear equations directly is presented and validated by simulated data experiments. Without using rotation axis or quaternion, the presented algorithm simplifies the procedure of two-step eye-hand calibration and is easy to understand","PeriodicalId":116108,"journal":{"name":"2006 IEEE International Conference on Automation Science and Engineering","volume":"290 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114337503","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 : 2006-10-01DOI: 10.1109/COASE.2006.326938
Yan Weixin, Z. Fu, Yingbin Liu, Ran Liu, Yanzheng Zhao, X. Y. Zhou, J. Tang, P. Yan
Up to now, most of people are still cooking in the kitchen, which makes them feel fatigued and also makes air polluted. With the development of the numerical control technology, it becomes more and more urgent to apply the related technology to the automatic cooking field. In this paper, the cooking techniques for the Chinese dishes is introduced and an automatic cooking machine is presented. The machine mainly consists of four parts: the wok mechanism, the stirring-fry and dispersing mechanism, the feeding mechanism, and the mechanism of leaving the material in the middle process. In order to adjust the temperature, the fire control system is also given in this paper. Experiments show that the new machine will be a milestone in the cooking automation science, because of its cooking techniques.
{"title":"A new automatic cooking machine for Chinese dishes","authors":"Yan Weixin, Z. Fu, Yingbin Liu, Ran Liu, Yanzheng Zhao, X. Y. Zhou, J. Tang, P. Yan","doi":"10.1109/COASE.2006.326938","DOIUrl":"https://doi.org/10.1109/COASE.2006.326938","url":null,"abstract":"Up to now, most of people are still cooking in the kitchen, which makes them feel fatigued and also makes air polluted. With the development of the numerical control technology, it becomes more and more urgent to apply the related technology to the automatic cooking field. In this paper, the cooking techniques for the Chinese dishes is introduced and an automatic cooking machine is presented. The machine mainly consists of four parts: the wok mechanism, the stirring-fry and dispersing mechanism, the feeding mechanism, and the mechanism of leaving the material in the middle process. In order to adjust the temperature, the fire control system is also given in this paper. Experiments show that the new machine will be a milestone in the cooking automation science, because of its cooking techniques.","PeriodicalId":116108,"journal":{"name":"2006 IEEE International Conference on Automation Science and Engineering","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122275889","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 : 2006-10-01DOI: 10.1109/COASE.2006.326913
Sung-Chul Cho, Kiyun Woo, K. Takamasu, S. Fujimura
This paper deals with the partial scheduling adjustment in the autonomous distributed scheduling method. The scheduling adjustment for the production system is required when uncertainty occurs. In that case, it does not need to adjust the whole schedule, but only the partial schedule which receives a direct influence by uncertainty according to the variable situation. From the viewpoint of the distributed system, to implement a function which adjusts such a partial schedule, each machine needs to manage schedule and exchange information. It has been studied by some researchers in recent years. However, the partial scheduling adjustment has not been controlled to change the processing sequence of operations in a machine, namely interchanging operations. Therefore, we propose realizing a function interchanging operations in a machine to diminish the influence occurred by a delay of a certain operation
{"title":"Autonomous Distributed Scheduling Adjustment Function with Interchanging Operations","authors":"Sung-Chul Cho, Kiyun Woo, K. Takamasu, S. Fujimura","doi":"10.1109/COASE.2006.326913","DOIUrl":"https://doi.org/10.1109/COASE.2006.326913","url":null,"abstract":"This paper deals with the partial scheduling adjustment in the autonomous distributed scheduling method. The scheduling adjustment for the production system is required when uncertainty occurs. In that case, it does not need to adjust the whole schedule, but only the partial schedule which receives a direct influence by uncertainty according to the variable situation. From the viewpoint of the distributed system, to implement a function which adjusts such a partial schedule, each machine needs to manage schedule and exchange information. It has been studied by some researchers in recent years. However, the partial scheduling adjustment has not been controlled to change the processing sequence of operations in a machine, namely interchanging operations. Therefore, we propose realizing a function interchanging operations in a machine to diminish the influence occurred by a delay of a certain operation","PeriodicalId":116108,"journal":{"name":"2006 IEEE International Conference on Automation Science and Engineering","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127591106","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 : 2006-10-01DOI: 10.1109/COASE.2006.326901
Fei Li, Liping Zhao, Yiyong Yao
Computing fault probability is an effective method of predicting the possible weakness of new product. Aiming at computing fault probability of each component of new product, and ensuring simplification of computational process and reasonableness of result, in the paper, according to design proposal and layering of new product, fault tree meta-model (FTMM) is established based on node-knowledge-representation method (NKRM) to express logical relation between each failure in different level of product and collaboration between each part. Secondly, RST and Bayes theory are applied to mining the decision rule of FTMM which is that fault of part in lower level causes fault of part in upper level, and joint probability of part is computed directly which avoids difficulty of computing because of unknown prior probability, then fault probability of part is computed. On this basis, weighted mean algorithm based on Bayes-and-RST (BRMA) is proposed to revise fault probability further, thus the result is more exact and reasonable, which can help product development personnel predict possible weakness of product in time and carrying out reliability design further in the design stage of new product development. Finally, an instance is analyzed
{"title":"Research on Computational Method of Fault Probability for New Product Development Based on Intelligence and Integration","authors":"Fei Li, Liping Zhao, Yiyong Yao","doi":"10.1109/COASE.2006.326901","DOIUrl":"https://doi.org/10.1109/COASE.2006.326901","url":null,"abstract":"Computing fault probability is an effective method of predicting the possible weakness of new product. Aiming at computing fault probability of each component of new product, and ensuring simplification of computational process and reasonableness of result, in the paper, according to design proposal and layering of new product, fault tree meta-model (FTMM) is established based on node-knowledge-representation method (NKRM) to express logical relation between each failure in different level of product and collaboration between each part. Secondly, RST and Bayes theory are applied to mining the decision rule of FTMM which is that fault of part in lower level causes fault of part in upper level, and joint probability of part is computed directly which avoids difficulty of computing because of unknown prior probability, then fault probability of part is computed. On this basis, weighted mean algorithm based on Bayes-and-RST (BRMA) is proposed to revise fault probability further, thus the result is more exact and reasonable, which can help product development personnel predict possible weakness of product in time and carrying out reliability design further in the design stage of new product development. Finally, an instance is analyzed","PeriodicalId":116108,"journal":{"name":"2006 IEEE International Conference on Automation Science and Engineering","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122539004","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 : 2006-10-01DOI: 10.1109/COASE.2006.326875
Guanghua Xu, J. Wang, Qing Zhang, Junming Zhu
Epileptic electroencephalogram data contains transient components and background activities. One of the transients is spike, which occurs randomly with short-duration. Spike detection in EEG is significant for clinical diagnosis of epilepsy. Since it is time consuming to scan spikes manually, an automatic spike detection method is necessary. In this paper, we introduce an automatic spike detection method in epileptic EEG based on morphological filter. Firstly, an average weighted combination of open-closing and close-opening morphological operator, which eliminates statistical deflection of amplitude, is utilized to extract spike component from epileptic EEG. Then, according to the characteristic of spike component, the structure elements are constructed with two parabolas, and a new criterion is put forward to optimize center amplitude and width of the structure elements. The proposed method is evaluated by simulated epileptic EEG data. Results show that background activity is fully restrained and spike component is well extracted. Finally, the method is applied to normal and epileptic EEG data which are actually recorded from nine testees. The average detection rate of spikes is 91.62% and no false detection for normal EEG signals
{"title":"An Automatic EEG Spike Detection Algorithm Using Morphological Filter","authors":"Guanghua Xu, J. Wang, Qing Zhang, Junming Zhu","doi":"10.1109/COASE.2006.326875","DOIUrl":"https://doi.org/10.1109/COASE.2006.326875","url":null,"abstract":"Epileptic electroencephalogram data contains transient components and background activities. One of the transients is spike, which occurs randomly with short-duration. Spike detection in EEG is significant for clinical diagnosis of epilepsy. Since it is time consuming to scan spikes manually, an automatic spike detection method is necessary. In this paper, we introduce an automatic spike detection method in epileptic EEG based on morphological filter. Firstly, an average weighted combination of open-closing and close-opening morphological operator, which eliminates statistical deflection of amplitude, is utilized to extract spike component from epileptic EEG. Then, according to the characteristic of spike component, the structure elements are constructed with two parabolas, and a new criterion is put forward to optimize center amplitude and width of the structure elements. The proposed method is evaluated by simulated epileptic EEG data. Results show that background activity is fully restrained and spike component is well extracted. Finally, the method is applied to normal and epileptic EEG data which are actually recorded from nine testees. The average detection rate of spikes is 91.62% and no false detection for normal EEG signals","PeriodicalId":116108,"journal":{"name":"2006 IEEE International Conference on Automation Science and Engineering","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121043489","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 : 2006-10-01DOI: 10.1109/COASE.2006.326912
A. Kobetski, D. Spensieri, Martin Fabian
Flexibility is the keyword in the modern industrial world. Automatic generation of collision- and blocking free, time optimal schedules for industrial robot cells is thus motivated. While a lot of attention has been paid to the control of industrial systems, as well as to the development of general optimization algorithms, there is still a need to properly combine these two research areas. This paper discusses two scheduling algorithms, designed for industrial robot cells, in terms of performance. A novel heuristic to an A*-based algorithm, operating on discrete event systems, is proposed and benchmarked against the well-known MILP algorithm
{"title":"Scheduling algorithms for optimal robot cell coordination - a comparison","authors":"A. Kobetski, D. Spensieri, Martin Fabian","doi":"10.1109/COASE.2006.326912","DOIUrl":"https://doi.org/10.1109/COASE.2006.326912","url":null,"abstract":"Flexibility is the keyword in the modern industrial world. Automatic generation of collision- and blocking free, time optimal schedules for industrial robot cells is thus motivated. While a lot of attention has been paid to the control of industrial systems, as well as to the development of general optimization algorithms, there is still a need to properly combine these two research areas. This paper discusses two scheduling algorithms, designed for industrial robot cells, in terms of performance. A novel heuristic to an A*-based algorithm, operating on discrete event systems, is proposed and benchmarked against the well-known MILP algorithm","PeriodicalId":116108,"journal":{"name":"2006 IEEE International Conference on Automation Science and Engineering","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129231021","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 : 2006-10-01DOI: 10.1109/COASE.2006.326894
A. Beghi, M. Liberati, S. Peron, Davide Sette
In the design process of complex systems, the use of physical prototypes presents many drawbacks in terms of both costs and time. Virtual prototyping tools allow instead the designer to extensively study the system behavior in a variety of configurations, providing the possibility of performing focussed tests and comparing the effectiveness of different solutions before the physical realization of the prototype. When building the virtual prototype, the choice of a suitable model for each of the interacting components is crucial for achieving reliable results. In the simulation of racing vehicles, such as cars or motorcycles, it is common practice to represent the engine torque by means of stationary maps depending on a finite number of constant values of the throttle fraction and the rotational speed of the crankshaft. Although simple to implement and characterize, such model cannot reproduce dynamic transients, and therefore may not be adequate when a detailed analysis of the vehicle behavior is required. In this paper we present the characterization and identification of a nonlinear dynamic model for a two-stroke internal combustion high-performance engine, to be used in the ADAMS multibody virtual prototyping environment. The model is obtained by using neural networks and validated on experimental data
{"title":"Black-box modeling of a Two-Stroke Racing Motorcycle Engine for Virtual Prototyping Applications","authors":"A. Beghi, M. Liberati, S. Peron, Davide Sette","doi":"10.1109/COASE.2006.326894","DOIUrl":"https://doi.org/10.1109/COASE.2006.326894","url":null,"abstract":"In the design process of complex systems, the use of physical prototypes presents many drawbacks in terms of both costs and time. Virtual prototyping tools allow instead the designer to extensively study the system behavior in a variety of configurations, providing the possibility of performing focussed tests and comparing the effectiveness of different solutions before the physical realization of the prototype. When building the virtual prototype, the choice of a suitable model for each of the interacting components is crucial for achieving reliable results. In the simulation of racing vehicles, such as cars or motorcycles, it is common practice to represent the engine torque by means of stationary maps depending on a finite number of constant values of the throttle fraction and the rotational speed of the crankshaft. Although simple to implement and characterize, such model cannot reproduce dynamic transients, and therefore may not be adequate when a detailed analysis of the vehicle behavior is required. In this paper we present the characterization and identification of a nonlinear dynamic model for a two-stroke internal combustion high-performance engine, to be used in the ADAMS multibody virtual prototyping environment. The model is obtained by using neural networks and validated on experimental data","PeriodicalId":116108,"journal":{"name":"2006 IEEE International Conference on Automation Science and Engineering","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116069414","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 : 2006-10-01DOI: 10.1109/COASE.2006.326876
M. Lamiri, Xiaolan Xie
This paper addresses the elective surgery planning problem when the operating rooms' capacity is shared between elective and emergency patients. The planning problem consists in determining the set of elective patients that would be operated in each period over a planning horizon in order to minimize patients related costs and overtime costs of operating rooms. A stochastic integer programming model is proposed. Lagrangian relaxation is used to decompose the planning problem into period-level sub-problems that are solved by a dynamic programming method. The dual problem is solved iteratively using a sub-gradient algorithm. Feasible plans are derived from relaxed solutions using a heuristic and improved with a "local search heuristic". This approach results in both near-optimal solution and a lower bound to assess the degree of optimality. Numerical experimentations show that solutions within 1% of the optimum are obtained in a short computation time for problems of practical sizes
{"title":"Operating Rooms Planning Using Lagrangian Relaxation Technique","authors":"M. Lamiri, Xiaolan Xie","doi":"10.1109/COASE.2006.326876","DOIUrl":"https://doi.org/10.1109/COASE.2006.326876","url":null,"abstract":"This paper addresses the elective surgery planning problem when the operating rooms' capacity is shared between elective and emergency patients. The planning problem consists in determining the set of elective patients that would be operated in each period over a planning horizon in order to minimize patients related costs and overtime costs of operating rooms. A stochastic integer programming model is proposed. Lagrangian relaxation is used to decompose the planning problem into period-level sub-problems that are solved by a dynamic programming method. The dual problem is solved iteratively using a sub-gradient algorithm. Feasible plans are derived from relaxed solutions using a heuristic and improved with a \"local search heuristic\". This approach results in both near-optimal solution and a lower bound to assess the degree of optimality. Numerical experimentations show that solutions within 1% of the optimum are obtained in a short computation time for problems of practical sizes","PeriodicalId":116108,"journal":{"name":"2006 IEEE International Conference on Automation Science and Engineering","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126060258","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
扫码关注我们
求助内容：
应助结果提醒方式：