Pub Date : 2004-05-10DOI: 10.1109/ISPAN.2004.1300470
Frank Hsu, X.-D Hu, H.-J Huang, X.-H Jia
This paper discusses two optimal data replica placement problems in linear bus networks, one is to maximize data availability and the other to minimize data access cost. The optimal placements are constructed for these two problems under read-any/write-all and majority voting protocols, respectively. The obtained results show that these two problems have the same optimal solutions under read dominant, write dominant, and majority voting systems.
{"title":"Optimal data replica placements in linear bus networks","authors":"Frank Hsu, X.-D Hu, H.-J Huang, X.-H Jia","doi":"10.1109/ISPAN.2004.1300470","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300470","url":null,"abstract":"This paper discusses two optimal data replica placement problems in linear bus networks, one is to maximize data availability and the other to minimize data access cost. The optimal placements are constructed for these two problems under read-any/write-all and majority voting protocols, respectively. The obtained results show that these two problems have the same optimal solutions under read dominant, write dominant, and majority voting systems.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":"62 7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129377153","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-05-10DOI: 10.1109/ISPAN.2004.1300549
Han-Kuen Liang, Chia-Mao Huang, Jenn-Kang Hwang, M. Ko
The amino acid-coupling sequence patterns deduced from 74 mesophilic and 15 thermophilic genomes were analyzed. The amino acid-coupling sequence patterns are defined as any two types of amino acids separated apart by one or more amino acids. We found that there exists significantly different distributions of amino acid-coupling sequence patterns between thermophilic and mesophilic proteomes. For example, patterns favored to form local salt bridges (such as KX/sub n/E) are usually preferred by thermophiles; patterns containing glutamate and valine are usually favored by thermophiles, but only some of them are statistically significant; most patterns containing cysteine appear to occur more in mesophiles, but most of them are statistically insignificant except patterns like CX/sub n/P or CX/sub n/C, which is favored by thermophiles. Though previous studies based on global amino acid compositions indicate that glutamate is one of the most favored amino acids by thermophiles, we found that EX/sub n/T, EX/sub n/H and EX/sub n/Q are statistically significant patterns favored by mesophiles. We also identified sequence patterns that can effectively distinguish between thermophilic and mesophilic genomes. By combining the statistically significant amino acid-coupling sequence patterns (of lowest p-values), we find a good linear relationship between these sequence patterns and the optimal growth temperatures of the genomes.
{"title":"The amino acid-coupling sequence patterns in thermophilic and mesophilic proteomes","authors":"Han-Kuen Liang, Chia-Mao Huang, Jenn-Kang Hwang, M. Ko","doi":"10.1109/ISPAN.2004.1300549","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300549","url":null,"abstract":"The amino acid-coupling sequence patterns deduced from 74 mesophilic and 15 thermophilic genomes were analyzed. The amino acid-coupling sequence patterns are defined as any two types of amino acids separated apart by one or more amino acids. We found that there exists significantly different distributions of amino acid-coupling sequence patterns between thermophilic and mesophilic proteomes. For example, patterns favored to form local salt bridges (such as KX/sub n/E) are usually preferred by thermophiles; patterns containing glutamate and valine are usually favored by thermophiles, but only some of them are statistically significant; most patterns containing cysteine appear to occur more in mesophiles, but most of them are statistically insignificant except patterns like CX/sub n/P or CX/sub n/C, which is favored by thermophiles. Though previous studies based on global amino acid compositions indicate that glutamate is one of the most favored amino acids by thermophiles, we found that EX/sub n/T, EX/sub n/H and EX/sub n/Q are statistically significant patterns favored by mesophiles. We also identified sequence patterns that can effectively distinguish between thermophilic and mesophilic genomes. By combining the statistically significant amino acid-coupling sequence patterns (of lowest p-values), we find a good linear relationship between these sequence patterns and the optimal growth temperatures of the genomes.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129025850","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-05-10DOI: 10.1109/ISPAN.2004.1300530
Wei Yu
Communication service over the Internet has become an active research area, as the next generation Internet applications are requiring the integration of voice, video and data in the single IP infrastructure. In this paper, we propose a P2P-based architecture to efficiently provide communication service in large scale IP networks. By demonstrating the efficiency, two features are studied: one is the efficient communication software distribution feature and the other is the efficient conference feature.
{"title":"P2P-based infrastructure for efficient communication service in large scale IP networks","authors":"Wei Yu","doi":"10.1109/ISPAN.2004.1300530","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300530","url":null,"abstract":"Communication service over the Internet has become an active research area, as the next generation Internet applications are requiring the integration of voice, video and data in the single IP infrastructure. In this paper, we propose a P2P-based architecture to efficiently provide communication service in large scale IP networks. By demonstrating the efficiency, two features are studied: one is the efficient communication software distribution feature and the other is the efficient conference feature.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126466329","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-05-10DOI: 10.1109/ISPAN.2004.1300531
Amarnath K. Koundinya, A. Negi, V. N. Sastry
Quality of service (QoS) is an important network service requirement to support various real time applications such as video on demand, remote-meeting systems, etc. While QoS parameters are specified by the applications it appears QoS support at routing level would be more appropriate. Here we consider an on-demand source routing modification to the Dijkstra's algorithm, which supports multi-parameter routing to find an optimal path according to the given optimality condition. The modified algorithm is analyzed with respect to its computational requirements and we prove that this algorithm finds a loop-free optimal path, if it exists.
{"title":"Unicast routing algorithm with multiple quality-of-service parameters","authors":"Amarnath K. Koundinya, A. Negi, V. N. Sastry","doi":"10.1109/ISPAN.2004.1300531","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300531","url":null,"abstract":"Quality of service (QoS) is an important network service requirement to support various real time applications such as video on demand, remote-meeting systems, etc. While QoS parameters are specified by the applications it appears QoS support at routing level would be more appropriate. Here we consider an on-demand source routing modification to the Dijkstra's algorithm, which supports multi-parameter routing to find an optimal path according to the given optimality condition. The modified algorithm is analyzed with respect to its computational requirements and we prove that this algorithm finds a loop-free optimal path, if it exists.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126001141","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-05-10DOI: 10.1109/ISPAN.2004.1300520
A. Sharma, A. Goswami, D. Gupta
Recent trends in the database paradigm are to incorporate fuzzy sets to tackle imprecise and ambiguous information of real world problems. In this paper, using the concepts of fuzzy sets and possibility theory, a FTS relational model is developed to extend the TS-relational model by Ee Peng Lilm et al. (1999). The extended model integrates local fuzzy databases by merging the respective export fuzzy databases to generate a set of FTS relations of fuzzy multidatabase. A set of algebraic operations is defined to manipulate the FTS relations and their correctness is established. A set of algebraic rules is also presented to optimize FTS algebraic expressions.
数据库范式的最新趋势是结合模糊集来处理现实世界问题的不精确和模糊信息。本文利用模糊集和可能性理论的概念，Ee Peng Lilm et al.(1999)对TS-relational model进行了FTS关系模型的扩展。扩展模型通过合并各自的导出模糊数据库来集成本地模糊数据库，生成一组模糊多数据库的FTS关系。定义了一组处理FTS关系的代数运算，并证明了其正确性。提出了一套优化FTS代数表达式的代数规则。
{"title":"An extended relational algebra for fuzzy multidatabases","authors":"A. Sharma, A. Goswami, D. Gupta","doi":"10.1109/ISPAN.2004.1300520","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300520","url":null,"abstract":"Recent trends in the database paradigm are to incorporate fuzzy sets to tackle imprecise and ambiguous information of real world problems. In this paper, using the concepts of fuzzy sets and possibility theory, a FTS relational model is developed to extend the TS-relational model by Ee Peng Lilm et al. (1999). The extended model integrates local fuzzy databases by merging the respective export fuzzy databases to generate a set of FTS relations of fuzzy multidatabase. A set of algebraic operations is defined to manipulate the FTS relations and their correctness is established. A set of algebraic rules is also presented to optimize FTS algebraic expressions.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125816736","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-05-10DOI: 10.1109/ISPAN.2004.1300534
Xiao Chen, Jian Shen
Broadcasting is an important communication mechanism in ad hoc wireless networks. The simplest way to do broadcasting is pure flooding, in which each node retransmits a packet after receiving it, thus generates many redundant retransmissions. The rule based on dominating sets can reduce the number of retransmissions. A dominating set is a set of nodes such that any node in the network is a neighbor of some element in the set. However, computing a minimum size connected dominating set is NP hard. Several existing algorithms use the idea of multipoint relays to reduce the size of the connected dominating set. The authors of this paper observed that these algorithms can be further improved. Thus, three improvements are introduced here. It is proved that these improvements can compute a connected dominating set of the network, and simulation results show that they can further reduce the size of the dominating set. Also, extensions to power-aware broadcasting algorithms are discussed.
{"title":"Reducing connected dominating set size with multipoint relays in ad hoc wireless networks","authors":"Xiao Chen, Jian Shen","doi":"10.1109/ISPAN.2004.1300534","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300534","url":null,"abstract":"Broadcasting is an important communication mechanism in ad hoc wireless networks. The simplest way to do broadcasting is pure flooding, in which each node retransmits a packet after receiving it, thus generates many redundant retransmissions. The rule based on dominating sets can reduce the number of retransmissions. A dominating set is a set of nodes such that any node in the network is a neighbor of some element in the set. However, computing a minimum size connected dominating set is NP hard. Several existing algorithms use the idea of multipoint relays to reduce the size of the connected dominating set. The authors of this paper observed that these algorithms can be further improved. Thus, three improvements are introduced here. It is proved that these improvements can compute a connected dominating set of the network, and simulation results show that they can further reduce the size of the dominating set. Also, extensions to power-aware broadcasting algorithms are discussed.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129275293","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-05-10DOI: 10.1109/ISPAN.2004.1300541
Eric Y. K. Chan, H. Chan, K. M. Chan, Vivien P. S. Chan, S. Chanson, M. Cheung, C. Chong, Kam-pui Chow, Albert K. T. Hui, L.C.K. Hui, Luke C. K. Lam, W. C. Lau, K. Pun, Anthony Y. F. Tsang, W. Tsang, Sam C. W. Tso, D. Yeung, KY Yu
Distributed denial-of-service (DDoS) attack has turned into one of the major security threats in recent years. Usually the only solution is to stop the services or shut down the victim and then discard the attack traffic only after the DDoS attack characteristics (such as the destination ports of the attack packets) are known. In this paper, we introduce a generic DDoS attack detection mechanism as well as the design and setup of a testbed for performing experiments and analysis. Our results showed that the mechanism can detect DDoS attack. This enables us to proceed to the next steps of packet classification and traffic control.
{"title":"IDR: an intrusion detection router for defending against distributed denial-of-service (DDoS) attacks","authors":"Eric Y. K. Chan, H. Chan, K. M. Chan, Vivien P. S. Chan, S. Chanson, M. Cheung, C. Chong, Kam-pui Chow, Albert K. T. Hui, L.C.K. Hui, Luke C. K. Lam, W. C. Lau, K. Pun, Anthony Y. F. Tsang, W. Tsang, Sam C. W. Tso, D. Yeung, KY Yu","doi":"10.1109/ISPAN.2004.1300541","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300541","url":null,"abstract":"Distributed denial-of-service (DDoS) attack has turned into one of the major security threats in recent years. Usually the only solution is to stop the services or shut down the victim and then discard the attack traffic only after the DDoS attack characteristics (such as the destination ports of the attack packets) are known. In this paper, we introduce a generic DDoS attack detection mechanism as well as the design and setup of a testbed for performing experiments and analysis. Our results showed that the mechanism can detect DDoS attack. This enables us to proceed to the next steps of packet classification and traffic control.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130066385","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-05-10DOI: 10.1109/ISPAN.2004.1300465
Xuerong Feng, Z. Meng, I. H. Sudborough
We consider the problem of sorting an arbitrary permutation of length n using substring reversals of length 2 or 3. This has been called "short swaps ". We give an upper bound of (5/24) n/sup 2/ + O(nlogn), improving the previous ( 1/4 ) n/sup 2/ upper bound. We also show that there is a short swap sorting network with ( 1/4 ) n/sup 2/ +O(nlogn) comparators and depth n.
{"title":"Improved upper bound for sorting by short swaps","authors":"Xuerong Feng, Z. Meng, I. H. Sudborough","doi":"10.1109/ISPAN.2004.1300465","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300465","url":null,"abstract":"We consider the problem of sorting an arbitrary permutation of length n using substring reversals of length 2 or 3. This has been called \"short swaps \". We give an upper bound of (5/24) n/sup 2/ + O(nlogn), improving the previous ( 1/4 ) n/sup 2/ upper bound. We also show that there is a short swap sorting network with ( 1/4 ) n/sup 2/ +O(nlogn) comparators and depth n.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127523823","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-05-10DOI: 10.1109/ISPAN.2004.1300461
Chi-Yin Chow, H. Leong, A. Chan
In a conventional mobile environment, mobile clients retrieve data items from database servers via mobile support stations, by downloading the items over scalable broadcast channels (push-based), requesting them over shared point-to-point channels (pull-based), or making use of both types of channels to retrieve them (hybrid). Caching is a key technique for improving data retrieval performance of mobile clients, regardless of the data delivery mechanism. The emergence of robust peer-to-peer technologies now brings to reality what we call "cooperative caching" in which mobile clients can access data items from the cache in their neighboring peers, thereby adding a new dimension for data caching. This paper studies the system performance of a cooperative caching scheme, called COCA, in a hybrid data delivery environment, and proposes a cooperative cache replacement scheme, called CORE, for mobile systems. The performance of COCA and CORE schemes is evaluated through a number of simulated experiments. The experiment results show that COCA effectively improves the system performance in push-based and hybrid-data delivery environments, especially in a heavily-loaded environment. The results also indicate that CORE can further improve on the access latency and reduce the number of expensive server requests, which consume scarce pull-based bandwidth.
{"title":"Peer-to-peer cooperative caching in a hybrid data delivery environment","authors":"Chi-Yin Chow, H. Leong, A. Chan","doi":"10.1109/ISPAN.2004.1300461","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300461","url":null,"abstract":"In a conventional mobile environment, mobile clients retrieve data items from database servers via mobile support stations, by downloading the items over scalable broadcast channels (push-based), requesting them over shared point-to-point channels (pull-based), or making use of both types of channels to retrieve them (hybrid). Caching is a key technique for improving data retrieval performance of mobile clients, regardless of the data delivery mechanism. The emergence of robust peer-to-peer technologies now brings to reality what we call \"cooperative caching\" in which mobile clients can access data items from the cache in their neighboring peers, thereby adding a new dimension for data caching. This paper studies the system performance of a cooperative caching scheme, called COCA, in a hybrid data delivery environment, and proposes a cooperative cache replacement scheme, called CORE, for mobile systems. The performance of COCA and CORE schemes is evaluated through a number of simulated experiments. The experiment results show that COCA effectively improves the system performance in push-based and hybrid-data delivery environments, especially in a heavily-loaded environment. The results also indicate that CORE can further improve on the access latency and reduce the number of expensive server requests, which consume scarce pull-based bandwidth.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116949961","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-05-10DOI: 10.1109/ISPAN.2004.1300536
Cheng-Kuan Lin, Hua-Min Huang, D. Hsu, Lih-Hsing Hsu
Assume that u and v are any two distinct vertices of different partite sets of S/sub n/ with n /spl ges/ 5. We prove that there are (n - 1) internally disjoint paths P/sub 1/, P/sub 2/, ..., P/sub n-i/ joining u to v such that /spl cup//sup n = 1//sub i = 2/ P/sub i/ spans S/sub n/ and l(P/sub i/) /spl les/ (n - 1)! + 2(n - 2)! + 2(n - 3)! + 1 = n!/(n - 2) + 1. We also prove that there are two internally disjoint paths Q/sub 1/ and Q/sub 2/ joining u to v such that Q/sub 1/ /spl cup/ Q/sub 2/ spans S/sub n/ and l(Q/sub i/) /spl les/ n!/2 + l for i = 1,2.
{"title":"The spanning diameter of the star graphs","authors":"Cheng-Kuan Lin, Hua-Min Huang, D. Hsu, Lih-Hsing Hsu","doi":"10.1109/ISPAN.2004.1300536","DOIUrl":"https://doi.org/10.1109/ISPAN.2004.1300536","url":null,"abstract":"Assume that u and v are any two distinct vertices of different partite sets of S/sub n/ with n /spl ges/ 5. We prove that there are (n - 1) internally disjoint paths P/sub 1/, P/sub 2/, ..., P/sub n-i/ joining u to v such that /spl cup//sup n = 1//sub i = 2/ P/sub i/ spans S/sub n/ and l(P/sub i/) /spl les/ (n - 1)! + 2(n - 2)! + 2(n - 3)! + 1 = n!/(n - 2) + 1. We also prove that there are two internally disjoint paths Q/sub 1/ and Q/sub 2/ joining u to v such that Q/sub 1/ /spl cup/ Q/sub 2/ spans S/sub n/ and l(Q/sub i/) /spl les/ n!/2 + l for i = 1,2.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":"2012 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114450226","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
扫码关注我们
求助内容：
应助结果提醒方式：