Dynamic distributed systems like peer-to-peer systems, overlay networks and mobile ad hoc networks must execute their applications using distributed resources and in a decentralized way. The structure (composition and topology) of these systems changes frequently due to nodes joining or leaving the network, or due to mobility, faults and networks partitions. Distributed algorithms projected to this class of systems must be able to deal with the occurrence of these events and to self-adapt dynamically the application according to changes in its execution environment. In this paper, we propose a dynamic, self-adaptable and intrusion tolerant certificate authority (CA) designed to operate in mobile ad hoc networks. This CA is composed by a set of mobile devices present in the network, which forms a group of servers that supports CA functions. This architecture is based on a dynamic systems model and was conceived to manage changes in the membership of the servers group. This paper introduces an algorithmic base that allows the CA to reconfigure itself, guaranteeing the availability and the inviolability of the certification service.
{"title":"Self-Adaptable and Intrusion Tolerant Certificate Authority for Mobile Ad Hoc Networks","authors":"F. C. Pereira, J. Fraga, Ricardo Felipe Custódio","doi":"10.1109/AINA.2008.141","DOIUrl":"https://doi.org/10.1109/AINA.2008.141","url":null,"abstract":"Dynamic distributed systems like peer-to-peer systems, overlay networks and mobile ad hoc networks must execute their applications using distributed resources and in a decentralized way. The structure (composition and topology) of these systems changes frequently due to nodes joining or leaving the network, or due to mobility, faults and networks partitions. Distributed algorithms projected to this class of systems must be able to deal with the occurrence of these events and to self-adapt dynamically the application according to changes in its execution environment. In this paper, we propose a dynamic, self-adaptable and intrusion tolerant certificate authority (CA) designed to operate in mobile ad hoc networks. This CA is composed by a set of mobile devices present in the network, which forms a group of servers that supports CA functions. This architecture is based on a dynamic systems model and was conceived to manage changes in the membership of the servers group. This paper introduces an algorithmic base that allows the CA to reconfigure itself, guaranteeing the availability and the inviolability of the certification service.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123142109","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}
Among various signaling protocols designed for OBS networks, the most popular one is just-enough-time (JET) protocol. JET can utilize the network capacity efficiently and reduce end-to-end transmission delay effectively. However, it may suffer from an intrinsic deficiency -fairness problem. Fairness problem is a traditional problem existing in various kinds of networks. It not only results in a phenomenon that bursts with shorter hops are generally favored but also deteriorates the networks utilization. In this paper, we investigated this problem and proposed a fair channel scheduling algorithm as a solution. Generally speaking, there is usually a tradeoff between fairness and blocking performance. Hence, our objective is to keep balanced between the two conflicting metrics. It gives each burst a dynamic priority which is defined by several characteristics of the burst. When a contention occurs, the proposed scheme picks the preferable burst and drops the other one according to their priorities then. Simulation results show that our scheme can improve fairness without degrading dropping performance too much. In addition, it increases the effective link utilizations as well.
{"title":"A Fair Channel Scheduling Algorithm in Optical Burst-Switched Networks","authors":"Chingfang Hsu, Li-Cheng Yang, Ke-Kuan Hsu","doi":"10.1109/AINA.2008.30","DOIUrl":"https://doi.org/10.1109/AINA.2008.30","url":null,"abstract":"Among various signaling protocols designed for OBS networks, the most popular one is just-enough-time (JET) protocol. JET can utilize the network capacity efficiently and reduce end-to-end transmission delay effectively. However, it may suffer from an intrinsic deficiency -fairness problem. Fairness problem is a traditional problem existing in various kinds of networks. It not only results in a phenomenon that bursts with shorter hops are generally favored but also deteriorates the networks utilization. In this paper, we investigated this problem and proposed a fair channel scheduling algorithm as a solution. Generally speaking, there is usually a tradeoff between fairness and blocking performance. Hence, our objective is to keep balanced between the two conflicting metrics. It gives each burst a dynamic priority which is defined by several characteristics of the burst. When a contention occurs, the proposed scheme picks the preferable burst and drops the other one according to their priorities then. Simulation results show that our scheme can improve fairness without degrading dropping performance too much. In addition, it increases the effective link utilizations as well.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131943945","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}
This paper presents a new architecture for flexible and secure networking in battlefields. Our architecture is based on the combination of optical (fiber) and wireless links. Our objective is to be able to carry on undeterred communication without the attack/eavesdropping nodes being able to detect the presence of any communications. We combine the advantages of optical links, such as high bandwidth, low delays, low error rates, good security, with the advantages of wireless links such as mobility and flexibility. From security point of view, we also assume presence of red zones, which are the ones controlled by the adversary or where the adversary can trace wireless activities. The advantage of fiber optical links was demonstrated in various military conflicts. On the other hand, in a dynamic environment, such as those of battlefields, it is expected that fiber cabling will be limited or difficult to be extended. Based on these assumptions we develop our hybrid wireless-optical protocol. The wireless communications are also optimized by searching the best tradeoff among coverage, energy use and security, which means that the wireless propagation should avoid overlapping with red areas, controlled by the adversary. In order to achieve the required optimization among the above mentioned factors, in our wireless protocols we change the transmission power (range) and the selection of retransmitting nodes.
{"title":"Hybrid Stealthy Communication Protocol","authors":"A. Durresi, V. Paruchuri, L. Barolli","doi":"10.1109/AINA.2008.154","DOIUrl":"https://doi.org/10.1109/AINA.2008.154","url":null,"abstract":"This paper presents a new architecture for flexible and secure networking in battlefields. Our architecture is based on the combination of optical (fiber) and wireless links. Our objective is to be able to carry on undeterred communication without the attack/eavesdropping nodes being able to detect the presence of any communications. We combine the advantages of optical links, such as high bandwidth, low delays, low error rates, good security, with the advantages of wireless links such as mobility and flexibility. From security point of view, we also assume presence of red zones, which are the ones controlled by the adversary or where the adversary can trace wireless activities. The advantage of fiber optical links was demonstrated in various military conflicts. On the other hand, in a dynamic environment, such as those of battlefields, it is expected that fiber cabling will be limited or difficult to be extended. Based on these assumptions we develop our hybrid wireless-optical protocol. The wireless communications are also optimized by searching the best tradeoff among coverage, energy use and security, which means that the wireless propagation should avoid overlapping with red areas, controlled by the adversary. In order to achieve the required optimization among the above mentioned factors, in our wireless protocols we change the transmission power (range) and the selection of retransmitting nodes.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"61 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120842359","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}
Identity-based crypto system has many advantages over PKI-based cryptosystem in key distribution, but key escrow is always an inherent drawback. In order to solve the problem, certificateless public key cryptography was introduced by Al-Riyami and Paterson in [8]. In this paper, we first introduce a certificateless signature scheme secure against both malicious PKG attack and DOD attack without random oracle, which is the first scheme satisfying theses properties in the literature. Based on the certificateless signature scheme, we also present a constant-size group signature scheme against malicious group manager.
{"title":"A Certificateless Signature and Group Signature Schemes against Malicious PKG","authors":"Guoyan Zhang, Shaohui Wang","doi":"10.1109/AINA.2008.84","DOIUrl":"https://doi.org/10.1109/AINA.2008.84","url":null,"abstract":"Identity-based crypto system has many advantages over PKI-based cryptosystem in key distribution, but key escrow is always an inherent drawback. In order to solve the problem, certificateless public key cryptography was introduced by Al-Riyami and Paterson in [8]. In this paper, we first introduce a certificateless signature scheme secure against both malicious PKG attack and DOD attack without random oracle, which is the first scheme satisfying theses properties in the literature. Based on the certificateless signature scheme, we also present a constant-size group signature scheme against malicious group manager.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115081795","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}
W. Srichavengsup, S. Siwamogsatham, S. Nakpeerayuth, L. Wuttisittikulkij
In this paper, we propose a modified backoff mechanism that can be used in conjunction with the existing backoff algorithms for medium access sharing among wireless stations via the CSMA protocol. With a proper design, the resulting scheme can achieve better short-term throughput fairness performance without degradation in the average throughput performance. The main idea of the proposed scheme is to virtually create a transmission cycle for each wireless station. After getting a turn to access the medium, each wireless station is not allowed to start the backoff procedure for its next transmission until it has waited for some additional number of backoff slots. Moreover, the average throughput performance of the proposed scheme is analytically evaluated in this work via the Markov chain approach. The simulation results show that the performance analysis model derived here for the proposed scheme is valid and accurate. In addition, the proposed scheme noticeably improves the short-term throughput fairness performance of the conventional backoff scheme.
{"title":"On Improving WLAN Medium Access Control via Uniform Transmission Cycle and Performance Analysis","authors":"W. Srichavengsup, S. Siwamogsatham, S. Nakpeerayuth, L. Wuttisittikulkij","doi":"10.1109/AINA.2008.137","DOIUrl":"https://doi.org/10.1109/AINA.2008.137","url":null,"abstract":"In this paper, we propose a modified backoff mechanism that can be used in conjunction with the existing backoff algorithms for medium access sharing among wireless stations via the CSMA protocol. With a proper design, the resulting scheme can achieve better short-term throughput fairness performance without degradation in the average throughput performance. The main idea of the proposed scheme is to virtually create a transmission cycle for each wireless station. After getting a turn to access the medium, each wireless station is not allowed to start the backoff procedure for its next transmission until it has waited for some additional number of backoff slots. Moreover, the average throughput performance of the proposed scheme is analytically evaluated in this work via the Markov chain approach. The simulation results show that the performance analysis model derived here for the proposed scheme is valid and accurate. In addition, the proposed scheme noticeably improves the short-term throughput fairness performance of the conventional backoff scheme.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129893309","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}
For a ubiquitous multimedia streaming, an adaptive multimedia streaming scheme with multiple layered audiovisual (AV) coding is required over heterogeneous networks. This paper proposes a multiple layered audiovisual streaming scheme denoted ML-AVSS to deliver layered audiovisual data. Fine-granular scalability (FGS) and bit sliced arithmetic coding (BSAC) techniques are used to segment video and audio data into individual base-layer and multiple enhancement-layer bitstreams. With advantages of layered coding, two phases of streaming synchronization, including a human-perceptual based transmission scheme, de-jitter procedure, conditional retransmission and play- out synchronization, are proposed to transmit hybrid multiple layered audiovisual bitstreams. Experiment results show that the proposed ML-AVSS is a feasible streaming scheme to overcome challenges of the ubiquitous multimedia streaming, e.g., constrained available bandwidth, quality degradation, unsmooth playback, etc.
{"title":"A Multiple Layered Audiovisual Streaming System Using the Two-Phase Synchronization and FGS/BSAC Techniques","authors":"Chung-Ming Huang, Chung-Wei Lin, Cheng-Yen Chuang","doi":"10.1109/AINA.2008.56","DOIUrl":"https://doi.org/10.1109/AINA.2008.56","url":null,"abstract":"For a ubiquitous multimedia streaming, an adaptive multimedia streaming scheme with multiple layered audiovisual (AV) coding is required over heterogeneous networks. This paper proposes a multiple layered audiovisual streaming scheme denoted ML-AVSS to deliver layered audiovisual data. Fine-granular scalability (FGS) and bit sliced arithmetic coding (BSAC) techniques are used to segment video and audio data into individual base-layer and multiple enhancement-layer bitstreams. With advantages of layered coding, two phases of streaming synchronization, including a human-perceptual based transmission scheme, de-jitter procedure, conditional retransmission and play- out synchronization, are proposed to transmit hybrid multiple layered audiovisual bitstreams. Experiment results show that the proposed ML-AVSS is a feasible streaming scheme to overcome challenges of the ubiquitous multimedia streaming, e.g., constrained available bandwidth, quality degradation, unsmooth playback, etc.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129911433","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}
This paper describes an architecture for sharing data in XML format through a peer-to-peer (P2P) network, which interconnects devices ranging from high-end servers to mobile devices. The XOP architecture allows devices with low storage capacity and subject to disconnection to use other peers of the P2P network for storing data. Users are able to locate and access data in a friendly and flexible way. Shared data is described using an extensible ontology, built using the OWL language, in order to provide more precise search results. This paper also describes a prototype of this architecture and analyzes the obtained performance.
{"title":"XOP: Sharing XML Data Objects through Peer-to-Peer Networks","authors":"Itamar de Rezende, Frank Siqueira","doi":"10.1109/AINA.2008.37","DOIUrl":"https://doi.org/10.1109/AINA.2008.37","url":null,"abstract":"This paper describes an architecture for sharing data in XML format through a peer-to-peer (P2P) network, which interconnects devices ranging from high-end servers to mobile devices. The XOP architecture allows devices with low storage capacity and subject to disconnection to use other peers of the P2P network for storing data. Users are able to locate and access data in a friendly and flexible way. Shared data is described using an extensible ontology, built using the OWL language, in order to provide more precise search results. This paper also describes a prototype of this architecture and analyzes the obtained performance.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128881568","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}
The use of services, especially Web services, became a common practice. In Web services, standard communication protocols and simple broker-request architectures are needed to facilitate exchange of services, and this standardization simplifies interoperability. In the coming few years, services are expected to dominate software industry. There are increasing amount of Web services being made available in the Internet, and an efficient Web services composition algorithm would help to integrate different algorithm together to provide a variety of services. In this paper, we provide a dynamic Web service composition algorithm with verification of Petri-Nets. Each Web service is described by Web Service Definition Language (WSDL) and their interactions with other services are described by Web Service Choreography Interface (WSCI). Our algorithm compose the Web services with the information provided by these two descriptions. After the composition, we verify the Web service to be deadlock free with modeling the Web service as a Petri-Net. We conduct a series of experiments to evaluate the correctness and performance of the composed Web service.
{"title":"Dynamic Web Service Composition: A New Approach in Building Reliable Web Service","authors":"P. Chan, Michael R. Lyu","doi":"10.1109/AINA.2008.133","DOIUrl":"https://doi.org/10.1109/AINA.2008.133","url":null,"abstract":"The use of services, especially Web services, became a common practice. In Web services, standard communication protocols and simple broker-request architectures are needed to facilitate exchange of services, and this standardization simplifies interoperability. In the coming few years, services are expected to dominate software industry. There are increasing amount of Web services being made available in the Internet, and an efficient Web services composition algorithm would help to integrate different algorithm together to provide a variety of services. In this paper, we provide a dynamic Web service composition algorithm with verification of Petri-Nets. Each Web service is described by Web Service Definition Language (WSDL) and their interactions with other services are described by Web Service Choreography Interface (WSCI). Our algorithm compose the Web services with the information provided by these two descriptions. After the composition, we verify the Web service to be deadlock free with modeling the Web service as a Petri-Net. We conduct a series of experiments to evaluate the correctness and performance of the composed Web service.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130799173","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}
Hsuan-Pu Chang, J. C. Hung, Chun-Chia Wang, Meng-Ting Weng, T. Shih, Chen-Yu Lee
A large number of excellent digital learning materials have been created and distributed for e- learning. These contents are mostly designed for reading on regular PCs that have big screens, powerful computing, large storage and wide bandwidth compared to handheld devices. Therefore, a lot of studies about automatic content adaptation have been done and are proposed to overcome the drawbacks of browsing regular content with handheld devices such as pocket PCs and smartphones. But we argue that the total automatic adaptation algorithm designed by an engineer to transform Web Page presentation is still appropriate to be applied on educational content. We believe the quality of the result can not be assured and supervised by educators, and educational essence may be damaged during the real time adaptation process. This paper proposes a content adaptation tool that provides different adaptation templates to help the author automatically and efficiently reproduce high-quality learning content for specific handhelds. Furthermore, the author will not only be able to preview the adaptation result before publishing the course but also be able to adjust the template parameters manually to affect the process if they are not satisfied with the current result.
{"title":"A Learning Content Adaptation Tool with Templates for Different Handhelds","authors":"Hsuan-Pu Chang, J. C. Hung, Chun-Chia Wang, Meng-Ting Weng, T. Shih, Chen-Yu Lee","doi":"10.1109/AINA.2008.101","DOIUrl":"https://doi.org/10.1109/AINA.2008.101","url":null,"abstract":"A large number of excellent digital learning materials have been created and distributed for e- learning. These contents are mostly designed for reading on regular PCs that have big screens, powerful computing, large storage and wide bandwidth compared to handheld devices. Therefore, a lot of studies about automatic content adaptation have been done and are proposed to overcome the drawbacks of browsing regular content with handheld devices such as pocket PCs and smartphones. But we argue that the total automatic adaptation algorithm designed by an engineer to transform Web Page presentation is still appropriate to be applied on educational content. We believe the quality of the result can not be assured and supervised by educators, and educational essence may be damaged during the real time adaptation process. This paper proposes a content adaptation tool that provides different adaptation templates to help the author automatically and efficiently reproduce high-quality learning content for specific handhelds. Furthermore, the author will not only be able to preview the adaptation result before publishing the course but also be able to adjust the template parameters manually to affect the process if they are not satisfied with the current result.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133888680","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}
Recently, the exchange of data has increased with progress in information technology. The capacity of for storing data is also increasing. However, even if the capacity of global storage becomes extremely large, the capacity of local storage is always limited. Moreover, storage of files larger then the available local storage is impossible. This paper discusses use of a network to construct a cheap, high trust and PB class, decentralized storage system using many hundreds of PCs in an educational environment. The performance of this 'large-scale virtual disk' is investigated both during normal operation and in instances of failure.
{"title":"Evaluating Performance and Fault Tolerance in a Virtual Large-Scale Disk","authors":"E. Chai, M. Uehara, H. Mori","doi":"10.1109/AINA.2008.158","DOIUrl":"https://doi.org/10.1109/AINA.2008.158","url":null,"abstract":"Recently, the exchange of data has increased with progress in information technology. The capacity of for storing data is also increasing. However, even if the capacity of global storage becomes extremely large, the capacity of local storage is always limited. Moreover, storage of files larger then the available local storage is impossible. This paper discusses use of a network to construct a cheap, high trust and PB class, decentralized storage system using many hundreds of PCs in an educational environment. The performance of this 'large-scale virtual disk' is investigated both during normal operation and in instances of failure.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134402995","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
扫码关注我们
求助内容：
应助结果提醒方式：