Pub Date : 2004-03-29DOI: 10.1109/AINA.2004.1283930
H. Inamura, O. Takahashi, Taro Ishikawa, H. Shigeno, Ken-ichi Okada
We propose a new environment for testing the behavior of TCP. We analyze existing test methodologies and show that there is still a need to reduce the loads imposed on both the worker and the expert. The Auto Detector is extensible and so well supports both the automation of predefined tasks and the communication tools needed to ensure gradual refinement by the participants. To show the effectiveness of our proposal, actual software flaws found in HP/UX and the Windows operating system are taken as examples of how to realize the automation of reproduction and detection tasks; it is flexible enough to resolve real-world issues.
{"title":"Automating detection of faults in TCP implementations","authors":"H. Inamura, O. Takahashi, Taro Ishikawa, H. Shigeno, Ken-ichi Okada","doi":"10.1109/AINA.2004.1283930","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283930","url":null,"abstract":"We propose a new environment for testing the behavior of TCP. We analyze existing test methodologies and show that there is still a need to reduce the loads imposed on both the worker and the expert. The Auto Detector is extensible and so well supports both the automation of predefined tasks and the communication tools needed to ensure gradual refinement by the participants. To show the effectiveness of our proposal, actual software flaws found in HP/UX and the Windows operating system are taken as examples of how to realize the automation of reproduction and detection tasks; it is flexible enough to resolve real-world issues.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125121488","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 : 2004-03-29DOI: 10.1142/S0219265904001167
S. Kwok, K. Chan
Although Gnutella is the most popular peer-to-peer protocol for file sharing, drawbacks are often found in searching and locating files. They include that (1) a limited number of hosts being searched leads to a limited number of hits; (2) the search result is not accurate due to the search by filename; and (3) an inefficient use of computer resource - spending too much resource on handling other peers' queries. In order to rectify these drawbacks, this paper proposes N-phase search and passive search mechanisms. Compared with the traditional search mechanism, N-phase search increases the number of received query hits by 55.41% and increases the host coverage by 41.23%. For the passive search, the average search time is reduced by 15.33%.
{"title":"An enhanced Gnutella P2P protocol: a search perspective","authors":"S. Kwok, K. Chan","doi":"10.1142/S0219265904001167","DOIUrl":"https://doi.org/10.1142/S0219265904001167","url":null,"abstract":"Although Gnutella is the most popular peer-to-peer protocol for file sharing, drawbacks are often found in searching and locating files. They include that (1) a limited number of hosts being searched leads to a limited number of hits; (2) the search result is not accurate due to the search by filename; and (3) an inefficient use of computer resource - spending too much resource on handling other peers' queries. In order to rectify these drawbacks, this paper proposes N-phase search and passive search mechanisms. Compared with the traditional search mechanism, N-phase search increases the number of received query hits by 55.41% and increases the host coverage by 41.23%. For the passive search, the average search time is reduced by 15.33%.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"53 8","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114002226","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 : 2004-03-29DOI: 10.1109/AINA.2004.1283980
A. Miyakawa, Kaoru Sugita, Tomoyuki Ishida, Y. Shibata
In Japan , there are traditional Japanese crafting such as fittings, furniture, textile, etc., which are closely related to Japanese culture and life. The design of Japanese houses and their rooms is very important problem to attract people. However, this design is not easy because people have different feelings. In order to deal with this problem, we have developed a digital traditional Japanese crafting system (DTJCS) which provides a presentation space for traditional Japanese crafting. In this paper, we analyze the effect of room change of fittings to people's feelings using the presentation system.
{"title":"Implementation and evaluation of a tradition search engine using sensitivity searching method","authors":"A. Miyakawa, Kaoru Sugita, Tomoyuki Ishida, Y. Shibata","doi":"10.1109/AINA.2004.1283980","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283980","url":null,"abstract":"In Japan , there are traditional Japanese crafting such as fittings, furniture, textile, etc., which are closely related to Japanese culture and life. The design of Japanese houses and their rooms is very important problem to attract people. However, this design is not easy because people have different feelings. In order to deal with this problem, we have developed a digital traditional Japanese crafting system (DTJCS) which provides a presentation space for traditional Japanese crafting. In this paper, we analyze the effect of room change of fittings to people's feelings using the presentation system.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127932174","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 : 2004-03-29DOI: 10.1109/AINA.2004.1283867
G. Capi, Y. Nasu
In emergency and hazardous environments, autonomous humanoid robots must make decisions based on the environment conditions. In addition, they must send information to human operator and receive high-level commands. In this paper, we apply intelligent algorithms in order to create an autonomous humanoid robot. In addition, a teleoperation system is developed to communicate with the humanoid robot in a long distance through Internet. The experiments using the 21 degree of freedom "Bonten-Maru" humanoid robot show a good performance of the proposed algorithm.
{"title":"Optimal control of humanoid robot in long distance","authors":"G. Capi, Y. Nasu","doi":"10.1109/AINA.2004.1283867","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283867","url":null,"abstract":"In emergency and hazardous environments, autonomous humanoid robots must make decisions based on the environment conditions. In addition, they must send information to human operator and receive high-level commands. In this paper, we apply intelligent algorithms in order to create an autonomous humanoid robot. In addition, a teleoperation system is developed to communicate with the humanoid robot in a long distance through Internet. The experiments using the 21 degree of freedom \"Bonten-Maru\" humanoid robot show a good performance of the proposed algorithm.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"190 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133788767","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 : 2004-03-29DOI: 10.1109/AINA.2004.1283969
Junqi Zhang, V. Varadharajan, Y. Mu
XML has been becoming popular for data store, document representation and exchange over the Web. Security mechanisms for the protection of XML document sources and their distribution are essential. Author-X is a Java based system specifically conceived for the protection of XML documents. It supports a range of protection granularity levels and subject credentials, but also supports push distribution for documents broadcast. However, the proposed system has certain disadvantages in terms of both security and dynamic key management. For example, a sender has to distribute the secret keys to all correspondent users for different XML documents. Also, if one of the users leave or a credential is changed, then the sender has to re-encrypt all related documents and redistribute the secret keys to all correspondent users. In this paper, we present a scheme for securing XML documents and their distribution. Our scheme has several advantages over Author-X such as: (a) one user needs only one private key; (b) even when the user leaves or a credential is changed, all the other users will be unaffected; (c) there is no need to establish a secure channel for key distribution; and (d) there is no need for checking the XML documents for access control policies applied. These make the security model more efficient and robust as well as simplifying the programming and the generation of the encrypted document base.
{"title":"Securing XML document sources and their distribution","authors":"Junqi Zhang, V. Varadharajan, Y. Mu","doi":"10.1109/AINA.2004.1283969","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283969","url":null,"abstract":"XML has been becoming popular for data store, document representation and exchange over the Web. Security mechanisms for the protection of XML document sources and their distribution are essential. Author-X is a Java based system specifically conceived for the protection of XML documents. It supports a range of protection granularity levels and subject credentials, but also supports push distribution for documents broadcast. However, the proposed system has certain disadvantages in terms of both security and dynamic key management. For example, a sender has to distribute the secret keys to all correspondent users for different XML documents. Also, if one of the users leave or a credential is changed, then the sender has to re-encrypt all related documents and redistribute the secret keys to all correspondent users. In this paper, we present a scheme for securing XML documents and their distribution. Our scheme has several advantages over Author-X such as: (a) one user needs only one private key; (b) even when the user leaves or a credential is changed, all the other users will be unaffected; (c) there is no need to establish a secure channel for key distribution; and (d) there is no need for checking the XML documents for access control policies applied. These make the security model more efficient and robust as well as simplifying the programming and the generation of the encrypted document base.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131257563","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 : 2004-03-29DOI: 10.1109/AINA.2004.1283821
Haw-Yun Shin, Jean-Lien C. Wu, Yi-Hsien Wu
A frame-based packet scheduling scheme, the pinwheel scheduling (PWS) scheme, is proposed and investigated at the medium access control (MAC) layer in broadband wireless networks. The objective of the proposed scheduling scheme is to provide, respectively, low delay and low jitter for real-time traffic and short queue length for nonreal-time traffic. We have demonstrated in this paper that the proposed PWS scheme not only satisfies the packet-level QoS requirements but also has low implementation cost. As the number of constant bit rate (CBR) connections increases, variable bit rate (VBR) traffic would suffer a larger jitter, the PWS with modular strategy (PWS/MS) scheme is proposed to further enhance the PWS scheme. We also introduce two different slot-reuse strategies named real-time traffic first (RTF) and longest queue first (LQF), respectively, to improve the resource utilization. In order to demonstrate the performance of the PWS and PWS/MS schemes, comparisons are made with existing schemes such as the round-robin (RR) and weighted-round-robin (WRR) by using the OPNET software. Simulation results show that the proposed schemes are capable of maintaining the lowest delay and jitter for VBR and CBR traffic while not sacrificing the available bit rate (ABR) traffic.
{"title":"A packet scheduling scheme for broadband wireless networks with heterogeneous services","authors":"Haw-Yun Shin, Jean-Lien C. Wu, Yi-Hsien Wu","doi":"10.1109/AINA.2004.1283821","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283821","url":null,"abstract":"A frame-based packet scheduling scheme, the pinwheel scheduling (PWS) scheme, is proposed and investigated at the medium access control (MAC) layer in broadband wireless networks. The objective of the proposed scheduling scheme is to provide, respectively, low delay and low jitter for real-time traffic and short queue length for nonreal-time traffic. We have demonstrated in this paper that the proposed PWS scheme not only satisfies the packet-level QoS requirements but also has low implementation cost. As the number of constant bit rate (CBR) connections increases, variable bit rate (VBR) traffic would suffer a larger jitter, the PWS with modular strategy (PWS/MS) scheme is proposed to further enhance the PWS scheme. We also introduce two different slot-reuse strategies named real-time traffic first (RTF) and longest queue first (LQF), respectively, to improve the resource utilization. In order to demonstrate the performance of the PWS and PWS/MS schemes, comparisons are made with existing schemes such as the round-robin (RR) and weighted-round-robin (WRR) by using the OPNET software. Simulation results show that the proposed schemes are capable of maintaining the lowest delay and jitter for VBR and CBR traffic while not sacrificing the available bit rate (ABR) traffic.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132102141","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 : 2004-03-29DOI: 10.1109/AINA.2004.1283811
S. Rejeb, Z. Choukair, S. Tabbane
The increase in the number of users and the development of their needs towards multimedia services with quality of service expectations set challenges to mobile radio network operators whose spectral resources are limited. A judicious resource allocation policy will limit call dropping due to handovers and improve bandwidth allocation between users, taking into account factors related to QoS expectations. QoS acceptance is defined by the SLA contract specifying the parameters of the different levels of acceptance. At global level, new call or handover call acceptance is based on a collective and consensual decision between the different participating networks. Such a consensus aims to take a consistent decision to reserve resources according to one of the levels of service predefined by the caller SLA and then to allow the caller to renegotiate the level of service QoS according to traffic load fluctuation, or to negotiate new resources for new applications requested during the session. The consensus algorithm is parametrized in accordance with the network configuration and take account of QoS constraints such as: new call blocking probability, handovers dropping probability, channels utilization rate...These parameters are deduced by applying Markovian chain with two dimensions. It is adopted to model the different service classes which negotiate the network.
{"title":"Combining Markovian chains and real time agreement protocols to allocate resources in wireless systems","authors":"S. Rejeb, Z. Choukair, S. Tabbane","doi":"10.1109/AINA.2004.1283811","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283811","url":null,"abstract":"The increase in the number of users and the development of their needs towards multimedia services with quality of service expectations set challenges to mobile radio network operators whose spectral resources are limited. A judicious resource allocation policy will limit call dropping due to handovers and improve bandwidth allocation between users, taking into account factors related to QoS expectations. QoS acceptance is defined by the SLA contract specifying the parameters of the different levels of acceptance. At global level, new call or handover call acceptance is based on a collective and consensual decision between the different participating networks. Such a consensus aims to take a consistent decision to reserve resources according to one of the levels of service predefined by the caller SLA and then to allow the caller to renegotiate the level of service QoS according to traffic load fluctuation, or to negotiate new resources for new applications requested during the session. The consensus algorithm is parametrized in accordance with the network configuration and take account of QoS constraints such as: new call blocking probability, handovers dropping probability, channels utilization rate...These parameters are deduced by applying Markovian chain with two dimensions. It is adopted to model the different service classes which negotiate the network.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"26 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114011818","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 : 2004-03-29DOI: 10.1109/AINA.2004.1283834
R. Samarasinghe, Y. Yasutake, Takeshi Kato, Takaichi Yoshida
New applications are being introduced for different areas such as commercial, education, and medical etc. A significant effort has been made in developing some of these applications considering the adaptability to the dynamically changing network and hosts' environments. In client-server applications, this adaptability is very important to enhance the reliability of the system and maintain the consistency of the objects. We describe a framework that can detect the changes in performance of the execution environment, and provide strategies in order to adapt such changes. Using these access strategies the client objects can access the server objects efficiently in a dynamically changing environment. We do not only consider the dynamic changes of the network characteristics but also consider the end-hosts performances before changing to the optimal strategy. Therefore the client objects can achieve the maximum usefulness of the environment. Here, we introduce three access strategies, namely client migration, direct access, and lazy access to impart an adaptive behavior to the client objects in the distributed environment. Advancing from the conventional static access models we propose algorithms to select the best-suited access strategy for the dynamic environment. Moreover the proposed model is to be implemented to the "juice" distributed object-oriented environment.
{"title":"Adaptable access strategies provide a high usefulness of the objects in an open distributed environment","authors":"R. Samarasinghe, Y. Yasutake, Takeshi Kato, Takaichi Yoshida","doi":"10.1109/AINA.2004.1283834","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283834","url":null,"abstract":"New applications are being introduced for different areas such as commercial, education, and medical etc. A significant effort has been made in developing some of these applications considering the adaptability to the dynamically changing network and hosts' environments. In client-server applications, this adaptability is very important to enhance the reliability of the system and maintain the consistency of the objects. We describe a framework that can detect the changes in performance of the execution environment, and provide strategies in order to adapt such changes. Using these access strategies the client objects can access the server objects efficiently in a dynamically changing environment. We do not only consider the dynamic changes of the network characteristics but also consider the end-hosts performances before changing to the optimal strategy. Therefore the client objects can achieve the maximum usefulness of the environment. Here, we introduce three access strategies, namely client migration, direct access, and lazy access to impart an adaptive behavior to the client objects in the distributed environment. Advancing from the conventional static access models we propose algorithms to select the best-suited access strategy for the dynamic environment. Moreover the proposed model is to be implemented to the \"juice\" distributed object-oriented environment.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116909279","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 : 2004-03-29DOI: 10.1109/AINA.2004.1283949
Hiroyasu Mitsui, H. Sugihara, H. Koizumi
Web-based distance education has attracted attention as what can replace partially, even extensively, conventional methods in university education. When distance education in engineering includes remote experiments, it can provide opportunities to study engineering anywhere and at any time. Scheduling the remote classes that feature remote experiments should solve students' preferences for taking classes, contentions such as experiment equipment and teaching staff resources, and prerequisite conditions of various subjects and lessons. This paper describes a scheduling method of distance learning classes including remote experiment, which can coordinate those conditions mentioned above.
{"title":"A scheduling method of distance learning classes including remote experiments","authors":"Hiroyasu Mitsui, H. Sugihara, H. Koizumi","doi":"10.1109/AINA.2004.1283949","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283949","url":null,"abstract":"Web-based distance education has attracted attention as what can replace partially, even extensively, conventional methods in university education. When distance education in engineering includes remote experiments, it can provide opportunities to study engineering anywhere and at any time. Scheduling the remote classes that feature remote experiments should solve students' preferences for taking classes, contentions such as experiment equipment and teaching staff resources, and prerequisite conditions of various subjects and lessons. This paper describes a scheduling method of distance learning classes including remote experiment, which can coordinate those conditions mentioned above.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116991818","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 : 2004-03-29DOI: 10.1109/AINA.2004.1283752
Hong-Sain Ooi
We propose a new stream cipher suitable for high-speed network applications, called HSSC (high-speed stream cipher). HSSC uses simple structure to allow detailed analysis and high software performance. The software implementation using C is about 2.07 cycles per byte on a Pentium II 450MHz platform. HSSC uses twelve 32-bit variables as internal states, four predefined constants, four key-derived constants and a set of rules to combine the internal states into 128-bit output per round.
本文提出了一种适用于高速网络应用的新型流密码，称为HSSC(高速流密码)。HSSC采用简单的结构，允许详细的分析和高的软件性能。使用C的软件实现在Pentium II 450MHz平台上每字节约2.07个周期。HSSC使用12个32位变量作为内部状态，4个预定义常量，4个密钥派生常量和一组规则将内部状态组合为每轮128位输出。
{"title":"High-speed stream cipher","authors":"Hong-Sain Ooi","doi":"10.1109/AINA.2004.1283752","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283752","url":null,"abstract":"We propose a new stream cipher suitable for high-speed network applications, called HSSC (high-speed stream cipher). HSSC uses simple structure to allow detailed analysis and high software performance. The software implementation using C is about 2.07 cycles per byte on a Pentium II 450MHz platform. HSSC uses twelve 32-bit variables as internal states, four predefined constants, four key-derived constants and a set of rules to combine the internal states into 128-bit output per round.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116773329","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
扫码关注我们
求助内容：
应助结果提醒方式：