Pub Date : 2005-04-04DOI: 10.1109/ISADS.2005.1452061
Yangdong Ye, Zundong Zhang, L. Jia, H. Dai
This paper focuses on intelligent attributes of railway intelligent transportation system (RITS) to use agent-oriented G-net approach to construct the model about stations and trains in the simulation system based on multi-agent, which is called agent-oriented G-net train operation model (AGNTOM). The model integrates object-oriented approach, multi-agent technique and Petri nets analysis method, so it embodies the object-oriented concepts including class, inheritance, encapsulation, and utilizes existed Petri nets analysis tools to ensure the design of the simulation system. Furthermore, we use Petri nets theory in agent structure design and analysis phases to make multi-agent simulation system developing efficiently. Compared with existed models, AGNTOM has some prominent features including asynchronous message-passing, better description for the frame of the system, better autonomous decision-making and self-adjustment abilities.
{"title":"Research on train group operation model in RITS","authors":"Yangdong Ye, Zundong Zhang, L. Jia, H. Dai","doi":"10.1109/ISADS.2005.1452061","DOIUrl":"https://doi.org/10.1109/ISADS.2005.1452061","url":null,"abstract":"This paper focuses on intelligent attributes of railway intelligent transportation system (RITS) to use agent-oriented G-net approach to construct the model about stations and trains in the simulation system based on multi-agent, which is called agent-oriented G-net train operation model (AGNTOM). The model integrates object-oriented approach, multi-agent technique and Petri nets analysis method, so it embodies the object-oriented concepts including class, inheritance, encapsulation, and utilizes existed Petri nets analysis tools to ensure the design of the simulation system. Furthermore, we use Petri nets theory in agent structure design and analysis phases to make multi-agent simulation system developing efficiently. Compared with existed models, AGNTOM has some prominent features including asynchronous message-passing, better description for the frame of the system, better autonomous decision-making and self-adjustment abilities.","PeriodicalId":120577,"journal":{"name":"Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.","volume":"938 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123067142","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 : 2005-04-04DOI: 10.1109/ISADS.2005.1452123
Dengyuan Xu, Wenjie Liu, Congcai Yi
The merging trend of three separate networks, i.e. telephone, cable TV and computer networks, demands simplifying network architecture, which has motivated the development of a single physical layer user-data transfer platform architecture network (SUPA-net) by Huaxin Zeng et al., (2004). For such a network the physical layer must be able to provide a mechanism over DWDM to transmit and switch bit streams at very high speed, and to satisfy different users' QoS requirements. As a result, a novel switching technique called physical frame time-slot switching (PFTS) was developed at our lab. This paper is devoted to fast switching technique of burst and non-burst data in PFTS node. The improved format of the switching field of PFTS frame is discussed. Bursting phenomenon is analyzed and tactics in dealing with such feature is discussed in some detail. Relevant issues such as the structure of switching table and fast switching algorithm are proposed based on hardware design to satisfy QoS requirements with respect to transit delay, jitters and etc. at the physical layer.
{"title":"On fast switching related to PFTS nodes","authors":"Dengyuan Xu, Wenjie Liu, Congcai Yi","doi":"10.1109/ISADS.2005.1452123","DOIUrl":"https://doi.org/10.1109/ISADS.2005.1452123","url":null,"abstract":"The merging trend of three separate networks, i.e. telephone, cable TV and computer networks, demands simplifying network architecture, which has motivated the development of a single physical layer user-data transfer platform architecture network (SUPA-net) by Huaxin Zeng et al., (2004). For such a network the physical layer must be able to provide a mechanism over DWDM to transmit and switch bit streams at very high speed, and to satisfy different users' QoS requirements. As a result, a novel switching technique called physical frame time-slot switching (PFTS) was developed at our lab. This paper is devoted to fast switching technique of burst and non-burst data in PFTS node. The improved format of the switching field of PFTS frame is discussed. Bursting phenomenon is analyzed and tactics in dealing with such feature is discussed in some detail. Relevant issues such as the structure of switching table and fast switching algorithm are proposed based on hardware design to satisfy QoS requirements with respect to transit delay, jitters and etc. at the physical layer.","PeriodicalId":120577,"journal":{"name":"Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116892876","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 : 2005-04-04DOI: 10.1109/ISADS.2005.1452147
W. Anhua, Tu Xuyan
In order to improve on the petroleum company trade ERP, intelligent autonomous decentralized enterprise resource planning (IADERP) is proposed. It is based on the combination of intelligent autonomous decentralized systems (IADS) and enterprise resource planning (ERP). The methodology and technology based on multi-agents and mobile agents for design and implementation of IADERP are discussed.
{"title":"Intelligent autonomous decentralized enterprise resource planning (IADERP)","authors":"W. Anhua, Tu Xuyan","doi":"10.1109/ISADS.2005.1452147","DOIUrl":"https://doi.org/10.1109/ISADS.2005.1452147","url":null,"abstract":"In order to improve on the petroleum company trade ERP, intelligent autonomous decentralized enterprise resource planning (IADERP) is proposed. It is based on the combination of intelligent autonomous decentralized systems (IADS) and enterprise resource planning (ERP). The methodology and technology based on multi-agents and mobile agents for design and implementation of IADERP are discussed.","PeriodicalId":120577,"journal":{"name":"Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.","volume":"201 1‐6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120851880","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 : 2005-04-04DOI: 10.1109/ISADS.2005.1452150
Yanqing Jiang, Xiaodong Lu, I. Luque, M. Kanda, K. Moriyama, Ryuji Takanuki, Yasushi Kuba
In order to meet the heterogeneous requirements from service providers and users simultaneously, there is an urgent need for a new information service system. After studying the characteristics of the user's access, it can be said that popularity of information utilization generally exists in information system. This paper introduces an access-based rating oriented distributed information system sustained by push/pull mobile agents for information service provision and utilization. In this environment, autonomous node adjustment technology is proposed to achieve load balance in the situation of changing users' preference. The effectiveness of our proposed technology is proved by simulation.
{"title":"Autonomous node reallocation for achieving load balance under changing users' preference","authors":"Yanqing Jiang, Xiaodong Lu, I. Luque, M. Kanda, K. Moriyama, Ryuji Takanuki, Yasushi Kuba","doi":"10.1109/ISADS.2005.1452150","DOIUrl":"https://doi.org/10.1109/ISADS.2005.1452150","url":null,"abstract":"In order to meet the heterogeneous requirements from service providers and users simultaneously, there is an urgent need for a new information service system. After studying the characteristics of the user's access, it can be said that popularity of information utilization generally exists in information system. This paper introduces an access-based rating oriented distributed information system sustained by push/pull mobile agents for information service provision and utilization. In this environment, autonomous node adjustment technology is proposed to achieve load balance in the situation of changing users' preference. The effectiveness of our proposed technology is proved by simulation.","PeriodicalId":120577,"journal":{"name":"Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121040659","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 : 2005-04-04DOI: 10.1109/ISADS.2005.1452095
Xiaoming Yao, Q. Qian
High-level representation of temporary traffic states is very crucial for intelligent traffic management applications, but a challenging task due to the complexity of the traffic states. In this paper, we present theoretically a high-level representation of temporary regional traffic states using Hasse graph and temporal change map under a grid-based site model. We first model the region within the monitoring range of the camera as an uncovered house and express it with a set of 4-tuples. Then we formulate a partial ordered relation with grid coordinates of the extracted objects in a specific site from which a Hasse graph is yielded. On the timeline, difference between two consecutive Hasse graphs makes a variable temporal change map. All temporary traffic states can be categorized into two types: one is the motion of a single object, represented simply with the Hasse graph of its location and the temporal change map; the other is the set of grouped patterns of all the extracted object, or the Hasse graph of the neighboring objects. With this representation and the fuzzy concept of neighborhood, key traffic states like collision and secure distance can be distinguished and determined using appropriate motion prediction based on the previous measurement to manipulate the undesirable cases on time.
{"title":"High-level representations of temporary traffic states using Hasse graph and temporal change map under a grid-based site model","authors":"Xiaoming Yao, Q. Qian","doi":"10.1109/ISADS.2005.1452095","DOIUrl":"https://doi.org/10.1109/ISADS.2005.1452095","url":null,"abstract":"High-level representation of temporary traffic states is very crucial for intelligent traffic management applications, but a challenging task due to the complexity of the traffic states. In this paper, we present theoretically a high-level representation of temporary regional traffic states using Hasse graph and temporal change map under a grid-based site model. We first model the region within the monitoring range of the camera as an uncovered house and express it with a set of 4-tuples. Then we formulate a partial ordered relation with grid coordinates of the extracted objects in a specific site from which a Hasse graph is yielded. On the timeline, difference between two consecutive Hasse graphs makes a variable temporal change map. All temporary traffic states can be categorized into two types: one is the motion of a single object, represented simply with the Hasse graph of its location and the temporal change map; the other is the set of grouped patterns of all the extracted object, or the Hasse graph of the neighboring objects. With this representation and the fuzzy concept of neighborhood, key traffic states like collision and secure distance can be distinguished and determined using appropriate motion prediction based on the previous measurement to manipulate the undesirable cases on time.","PeriodicalId":120577,"journal":{"name":"Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121369285","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 : 2005-04-04DOI: 10.1109/ISADS.2005.1452113
O. Drögehorn, Björn Wüst, K. David
Personalisation provides a convenient means to ease the use of pervasive computing systems and related services. Profiles are one of the major building blocks for making real personalisation happen. In the existing heterogeneous and upcoming pervasive computing environment typically numerous different profiles are used and maintained by the user or different services, devices or operators. In order to avoid multiple copies of the same data profile synchronisation and linking should be used and applied between the different locations and administrative domains, in which the different types of profiles reside. But keeping in mind the different contexts', in which these profiles have been constructed, it is mostly unknown how to match the meaning of one profile to another or how to harmonize the different kind of values in the different profiles. In this paper, mechanisms for efficient synchronisation of profiles based on semantic distinctions are introduced. By using ontology's to distinguish between semantic entities profiles can be kept synchronous even using low-bandwidth radio links and mobile devices like smart-phones and PDAs.
{"title":"Personalised applications and services for a mobile user","authors":"O. Drögehorn, Björn Wüst, K. David","doi":"10.1109/ISADS.2005.1452113","DOIUrl":"https://doi.org/10.1109/ISADS.2005.1452113","url":null,"abstract":"Personalisation provides a convenient means to ease the use of pervasive computing systems and related services. Profiles are one of the major building blocks for making real personalisation happen. In the existing heterogeneous and upcoming pervasive computing environment typically numerous different profiles are used and maintained by the user or different services, devices or operators. In order to avoid multiple copies of the same data profile synchronisation and linking should be used and applied between the different locations and administrative domains, in which the different types of profiles reside. But keeping in mind the different contexts', in which these profiles have been constructed, it is mostly unknown how to match the meaning of one profile to another or how to harmonize the different kind of values in the different profiles. In this paper, mechanisms for efficient synchronisation of profiles based on semantic distinctions are introduced. By using ontology's to distinguish between semantic entities profiles can be kept synchronous even using low-bandwidth radio links and mobile devices like smart-phones and PDAs.","PeriodicalId":120577,"journal":{"name":"Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127117360","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 : 2005-04-04DOI: 10.1109/ISADS.2005.1452025
Duo Zhao, Wei-dong Jin
An important study in multi-agent systems is the development of cooperative behavior between agents that have a shared goal. In this paper, an example of the predator-prey problem is studied in which four predator agents, using the reinforcement learning method, in an attempt to collectively achieve the task of surrounding one prey agent. First, we describe the structure of the predator agents and the prey agent with their state sensing capability, the action learning method and the action choosing mechanism. Next we study two cooperative behavior mechanisms between agents of multi-agent systems in predator-prey problem. Finally, we demonstrate that cooperative agents outperform agents without cooperative behavior according to simulations of the predator-prey problem and display the corresponding experimental results.
{"title":"The study of cooperative behavior in predator-prey problem of multi-agent systems","authors":"Duo Zhao, Wei-dong Jin","doi":"10.1109/ISADS.2005.1452025","DOIUrl":"https://doi.org/10.1109/ISADS.2005.1452025","url":null,"abstract":"An important study in multi-agent systems is the development of cooperative behavior between agents that have a shared goal. In this paper, an example of the predator-prey problem is studied in which four predator agents, using the reinforcement learning method, in an attempt to collectively achieve the task of surrounding one prey agent. First, we describe the structure of the predator agents and the prey agent with their state sensing capability, the action learning method and the action choosing mechanism. Next we study two cooperative behavior mechanisms between agents of multi-agent systems in predator-prey problem. Finally, we demonstrate that cooperative agents outperform agents without cooperative behavior according to simulations of the predator-prey problem and display the corresponding experimental results.","PeriodicalId":120577,"journal":{"name":"Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127883914","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 : 2005-04-04DOI: 10.1109/ISADS.2005.1452008
B. Li, X. Chai, Yanqiang Di, Haiyan Yu, Zhihui Du, Xiaoyuan Peng
This paper firstly concisely introduces the research background of simulation grid, then combined with authors' ongoing project on simulation grid, the phased research achievements of simulation grid project are introduced in detail, including completed simulation grid prototype named Cosim-Grid 0.1v, parts of solved key technologies and some typical application demonstration systems of simulation grid. It is shown from the primary practice that the simulation grid developed by authors has the following new features: (1) An architecture of service oriented simulation grid, based on HLA (high level architecture), PLM (product lifecycle management) and grid/Web service, is proposed. It overcomes shortcomings of HLA on dynamical share, autonomy, fault tolerant, capability of collaboration and security mechanism. (2) A simulation grid prototype named Cosim-Grid 0.1v has been developed, which has independent copyright and is suitable for simulation application. It consists of simulation grid portal, simulation application oriented service middleware, grid middleware GOS and the simulation grid resources including various encapsulated simulation model services. (3) It extends simulation application pattern and implements new simulation method based on Internet and grid. Finally, the conclusion and some further works are given.
{"title":"Research on service oriented simulation grid","authors":"B. Li, X. Chai, Yanqiang Di, Haiyan Yu, Zhihui Du, Xiaoyuan Peng","doi":"10.1109/ISADS.2005.1452008","DOIUrl":"https://doi.org/10.1109/ISADS.2005.1452008","url":null,"abstract":"This paper firstly concisely introduces the research background of simulation grid, then combined with authors' ongoing project on simulation grid, the phased research achievements of simulation grid project are introduced in detail, including completed simulation grid prototype named Cosim-Grid 0.1v, parts of solved key technologies and some typical application demonstration systems of simulation grid. It is shown from the primary practice that the simulation grid developed by authors has the following new features: (1) An architecture of service oriented simulation grid, based on HLA (high level architecture), PLM (product lifecycle management) and grid/Web service, is proposed. It overcomes shortcomings of HLA on dynamical share, autonomy, fault tolerant, capability of collaboration and security mechanism. (2) A simulation grid prototype named Cosim-Grid 0.1v has been developed, which has independent copyright and is suitable for simulation application. It consists of simulation grid portal, simulation application oriented service middleware, grid middleware GOS and the simulation grid resources including various encapsulated simulation model services. (3) It extends simulation application pattern and implements new simulation method based on Internet and grid. Finally, the conclusion and some further works are given.","PeriodicalId":120577,"journal":{"name":"Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134374254","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 : 2005-04-04DOI: 10.1109/ISADS.2005.1452184
L. Lefèvre
Programmable and active networks allow specified classes of users to deploy dynamic network services adapted to data streams requirements. Based on our experience in high performance active networking, this paper compares two alternative approaches for adding dynamic solutions in the network: heavy and lightweight dynamic network services. We propose and describe solutions to efficiently manage and deploy heavy services (requiring resources and closely linked with middleware or applications) and lightweight network services (generic and pragmatic solutions with limited impact on network infrastructure). Experiments on local and wide area platforms are presented.
{"title":"Heavy and lightweight dynamic network services : challenges and experiments for designing intelligent solutions in evolvable next generation networks","authors":"L. Lefèvre","doi":"10.1109/ISADS.2005.1452184","DOIUrl":"https://doi.org/10.1109/ISADS.2005.1452184","url":null,"abstract":"Programmable and active networks allow specified classes of users to deploy dynamic network services adapted to data streams requirements. Based on our experience in high performance active networking, this paper compares two alternative approaches for adding dynamic solutions in the network: heavy and lightweight dynamic network services. We propose and describe solutions to efficiently manage and deploy heavy services (requiring resources and closely linked with middleware or applications) and lightweight network services (generic and pragmatic solutions with limited impact on network infrastructure). Experiments on local and wide area platforms are presented.","PeriodicalId":120577,"journal":{"name":"Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133323828","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 : 2005-04-04DOI: 10.1109/ISADS.2005.1452171
Nodoka Mimura, K. Nakauchi, H. Morikawa, T. Aoyama
Application-level multicast (ALM) is a novel technology for multipoint applications, such as large scale file distribution, video and audio streaming, and video conference. Though several ALM systems have been proposed, all the multicast functions have been independently developed and integrated into individual applications. In such a situation, the development includes a lot of redundancy. Our goal is to develop RelayCast, the middleware which provides the common functions of ALM to eliminate the redundancy. RelayCast has some functional units which support fundamental and minimum functions respectively, and realizes one complete ALM system by cooperation of the units. The functional unit contains several components with different algorithms, and RelayCast meets the requirements of various applications by choosing the appropriate component. In this paper, we propose the RelayCast architecture, and present the implementation and experiment of a prototype.
{"title":"A middleware approach for supporting application-level multicast services","authors":"Nodoka Mimura, K. Nakauchi, H. Morikawa, T. Aoyama","doi":"10.1109/ISADS.2005.1452171","DOIUrl":"https://doi.org/10.1109/ISADS.2005.1452171","url":null,"abstract":"Application-level multicast (ALM) is a novel technology for multipoint applications, such as large scale file distribution, video and audio streaming, and video conference. Though several ALM systems have been proposed, all the multicast functions have been independently developed and integrated into individual applications. In such a situation, the development includes a lot of redundancy. Our goal is to develop RelayCast, the middleware which provides the common functions of ALM to eliminate the redundancy. RelayCast has some functional units which support fundamental and minimum functions respectively, and realizes one complete ALM system by cooperation of the units. The functional unit contains several components with different algorithms, and RelayCast meets the requirements of various applications by choosing the appropriate component. In this paper, we propose the RelayCast architecture, and present the implementation and experiment of a prototype.","PeriodicalId":120577,"journal":{"name":"Proceedings Autonomous Decentralized Systems, 2005. ISADS 2005.","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132654901","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
扫码关注我们
求助内容：
应助结果提醒方式：