Pub Date : 2006-08-07DOI: 10.1109/WOCN.2006.1666640
E. Shivaleela, T. Srinivas
Two dimensional optical orthogonal codes (OOCs) named wavelength/time multiple-pulses-per-row (W/T MPR) codes suitable for use in incoherent fiber-optic code division multiple access (FO-CDMA) networks are reported in E.S. Shivaleela et al., (2005). In this paper, we report the construction of W/T MPR codes, using greedy algorithm (GA), with distinct 1-D OOCs as the row vectors. We present the W/T MPR codes obtained using the GA. Further, we verify the correlation properties of the generated W/T MPR codes using Matlab
{"title":"Wavelength/time multiple-pulses-per-row codes: construction and verification","authors":"E. Shivaleela, T. Srinivas","doi":"10.1109/WOCN.2006.1666640","DOIUrl":"https://doi.org/10.1109/WOCN.2006.1666640","url":null,"abstract":"Two dimensional optical orthogonal codes (OOCs) named wavelength/time multiple-pulses-per-row (W/T MPR) codes suitable for use in incoherent fiber-optic code division multiple access (FO-CDMA) networks are reported in E.S. Shivaleela et al., (2005). In this paper, we report the construction of W/T MPR codes, using greedy algorithm (GA), with distinct 1-D OOCs as the row vectors. We present the W/T MPR codes obtained using the GA. Further, we verify the correlation properties of the generated W/T MPR codes using Matlab","PeriodicalId":275012,"journal":{"name":"2006 IFIP International Conference on Wireless and Optical Communications Networks","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132890755","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2006-08-07DOI: 10.1109/WOCN.2006.1666677
K. Nallaperumal, R. Subban, K. Krishnaveni, L. Fred, R. Selvakumar
Human face detection techniques play an important role in applications like face recognition, video surveillance, human computer interface, face image database management, and querying image databases. Using color information in images is one of the various possible techniques used for face detection. This paper proposes a novel technique for detecting faces in color images using an adaptive threshold and template matching techniques. The goal of the technique is to segment the skin regions from the non-skin regions. Experimental results demonstrate successful face detection over a wide range of facial variations in color, position, scale, orientation, 3D pose, and expression in images from several photo collections (both indoors and outdoors). This method is quite practical and faster when compared to neural networks and other techniques especially suited well for multimedia applications on the Web
{"title":"Human face detection in color images using skin color and template matching models for multimedia on the Web","authors":"K. Nallaperumal, R. Subban, K. Krishnaveni, L. Fred, R. Selvakumar","doi":"10.1109/WOCN.2006.1666677","DOIUrl":"https://doi.org/10.1109/WOCN.2006.1666677","url":null,"abstract":"Human face detection techniques play an important role in applications like face recognition, video surveillance, human computer interface, face image database management, and querying image databases. Using color information in images is one of the various possible techniques used for face detection. This paper proposes a novel technique for detecting faces in color images using an adaptive threshold and template matching techniques. The goal of the technique is to segment the skin regions from the non-skin regions. Experimental results demonstrate successful face detection over a wide range of facial variations in color, position, scale, orientation, 3D pose, and expression in images from several photo collections (both indoors and outdoors). This method is quite practical and faster when compared to neural networks and other techniques especially suited well for multimedia applications on the Web","PeriodicalId":275012,"journal":{"name":"2006 IFIP International Conference on Wireless and Optical Communications Networks","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134478985","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2006-08-07DOI: 10.1109/WOCN.2006.1666649
K. Roy, M. K. Naskar, U. Biswas
In this article, an efficient heuristic approach for routing and wavelength assignment (RWA) in WDM optical networks is proposed. The method is based on the selection of shortest path or alternate shortest path depending on the number of overlaps of a new route with the non-terminated calls. Comparative studies with the previous work demonstrate the superiority of the proposed algorithm
{"title":"Adaptive dynamic wavelength routing for WDM optical networks","authors":"K. Roy, M. K. Naskar, U. Biswas","doi":"10.1109/WOCN.2006.1666649","DOIUrl":"https://doi.org/10.1109/WOCN.2006.1666649","url":null,"abstract":"In this article, an efficient heuristic approach for routing and wavelength assignment (RWA) in WDM optical networks is proposed. The method is based on the selection of shortest path or alternate shortest path depending on the number of overlaps of a new route with the non-terminated calls. Comparative studies with the previous work demonstrate the superiority of the proposed algorithm","PeriodicalId":275012,"journal":{"name":"2006 IFIP International Conference on Wireless and Optical Communications Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129813505","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2006-08-07DOI: 10.1109/WOCN.2006.1666554
L. Jayashree, S. Arumugam, N. Rajathi
Energy efficiency is of paramount interest to most of the wireless sensor network applications. In a clustered sensor network, some of the nodes become cluster heads, aggregate the data of their cluster members and transmit it to the sink. In this study, we assume a heterogeneous network setup, where a fixed percentage of the population of sensor nodes is equipped with additional energy resources thus acting as cluster heads (two level hierarchy). The behavior of such sensor networks becomes very unstable once the first head dies. Classical clustering techniques for wireless sensor networks pay much importance to reducing the per-node energy consumption, which may not always guarantee a globally efficient solution. We propose E2LBC, which considers energy efficiency as a system-wide issue that focuses on improving the overall stability of operation of a wireless sensor network. We prolong the stability period of the network by balancing the load at each cluster head. We prove the effectiveness of the proposed algorithm by comparing it against a hypothetical unbalanced clustering protocol
{"title":"E/sup 2/LBC: an energy efficient load balanced clustering technique for heterogeneous wireless sensor networks","authors":"L. Jayashree, S. Arumugam, N. Rajathi","doi":"10.1109/WOCN.2006.1666554","DOIUrl":"https://doi.org/10.1109/WOCN.2006.1666554","url":null,"abstract":"Energy efficiency is of paramount interest to most of the wireless sensor network applications. In a clustered sensor network, some of the nodes become cluster heads, aggregate the data of their cluster members and transmit it to the sink. In this study, we assume a heterogeneous network setup, where a fixed percentage of the population of sensor nodes is equipped with additional energy resources thus acting as cluster heads (two level hierarchy). The behavior of such sensor networks becomes very unstable once the first head dies. Classical clustering techniques for wireless sensor networks pay much importance to reducing the per-node energy consumption, which may not always guarantee a globally efficient solution. We propose E2LBC, which considers energy efficiency as a system-wide issue that focuses on improving the overall stability of operation of a wireless sensor network. We prolong the stability period of the network by balancing the load at each cluster head. We prove the effectiveness of the proposed algorithm by comparing it against a hypothetical unbalanced clustering protocol","PeriodicalId":275012,"journal":{"name":"2006 IFIP International Conference on Wireless and Optical Communications Networks","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132708643","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2006-08-07DOI: 10.1109/WOCN.2006.1666628
N. Meghanathan
We present an extensive ns-2 (K. Fall and K. Varadhan) simulation-based performance comparison of three widely known stability-oriented mobile ad hoc network routing protocols: associativity-based routing (ABR) protocol (C-K Toh, 1997), flow-oriented routing protocol (FORP) (W. Su et al., 2001) and route assessment based routing (RABR) protocol (S. Agarwal et al., 2000). The order of the ranking of the protocols in terms of the packet delivery ratio and the number of route transitions is as follows: FORP, RABR, and ABR. The order of ranking in terms of the average hop count per route and end-to-end delay per packet is: ABR, RABR, and FORP. Thus, we see a stability-delay tradeoff within the class of stability-oriented routing protocols
我们提出了一个广泛的ns-2 (K. Fall和K. Varadhan)基于仿真的性能比较三种广为人知的面向稳定性的移动自组织网络路由协议:基于关联的路由(ABR)协议(C-K Toh, 1997)，面向流的路由协议(FORP) (W. Su等人，2001)和基于路由评估的路由(RABR)协议(S. Agarwal等人，2000)。各协议的转发率和路由转换次数排序为:FORP、RABR、ABR。每条路由的平均跳数和每包的端到端时延排序为:ABR、RABR、FORP。因此，我们在面向稳定性的路由协议中看到了稳定性-延迟的权衡
{"title":"A simulation study on the stability-oriented routing protocols for mobile ad hoc networks","authors":"N. Meghanathan","doi":"10.1109/WOCN.2006.1666628","DOIUrl":"https://doi.org/10.1109/WOCN.2006.1666628","url":null,"abstract":"We present an extensive ns-2 (K. Fall and K. Varadhan) simulation-based performance comparison of three widely known stability-oriented mobile ad hoc network routing protocols: associativity-based routing (ABR) protocol (C-K Toh, 1997), flow-oriented routing protocol (FORP) (W. Su et al., 2001) and route assessment based routing (RABR) protocol (S. Agarwal et al., 2000). The order of the ranking of the protocols in terms of the packet delivery ratio and the number of route transitions is as follows: FORP, RABR, and ABR. The order of ranking in terms of the average hop count per route and end-to-end delay per packet is: ABR, RABR, and FORP. Thus, we see a stability-delay tradeoff within the class of stability-oriented routing protocols","PeriodicalId":275012,"journal":{"name":"2006 IFIP International Conference on Wireless and Optical Communications Networks","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114337728","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2006-08-07DOI: 10.1109/WOCN.2006.1666678
K. Nallaperumal, Krishnaveni K, J. Varghese, S. Saudia, R. K. Selvakumar, Ravi Subban, Jennifer J Ranjani
A new fuzzy based multiscale morphological segmentation is proposed in this paper. The technique works satisfactorily on gray scale images containing bright and dark features of various scales even in an impulse corrupted environment. The segmentation algorithm involves three passes. In the first pass, the image is preprocessed by using an iterative adaptive switching median filter which reduces the impact of impulse that causes over segmentation. In the second pass the multiple scales of bright and dark features of different objects are extracted by the respective opening and closing of the preprocessed image. The resultant image is binarized using an optimum threshold, obtained by the fuzzy Gaussian measure. The process is repeated for multiple scales of the structuring element until all the features are extracted. In the last pass, valid segments of the bright top-hat and dark bottom-hat images are detected and the contours of these images are combined to give the final segmented image. The scheme is implemented on a set of test images and the performance of the algorithm is proved better both objectively and subjectively than the standard methods. The problems of over segmentation and under segmentation are also addressed by the proposed segmentation technique
{"title":"Fuzzy optimal thresholded multiscale morphological segmentation of digital images","authors":"K. Nallaperumal, Krishnaveni K, J. Varghese, S. Saudia, R. K. Selvakumar, Ravi Subban, Jennifer J Ranjani","doi":"10.1109/WOCN.2006.1666678","DOIUrl":"https://doi.org/10.1109/WOCN.2006.1666678","url":null,"abstract":"A new fuzzy based multiscale morphological segmentation is proposed in this paper. The technique works satisfactorily on gray scale images containing bright and dark features of various scales even in an impulse corrupted environment. The segmentation algorithm involves three passes. In the first pass, the image is preprocessed by using an iterative adaptive switching median filter which reduces the impact of impulse that causes over segmentation. In the second pass the multiple scales of bright and dark features of different objects are extracted by the respective opening and closing of the preprocessed image. The resultant image is binarized using an optimum threshold, obtained by the fuzzy Gaussian measure. The process is repeated for multiple scales of the structuring element until all the features are extracted. In the last pass, valid segments of the bright top-hat and dark bottom-hat images are detected and the contours of these images are combined to give the final segmented image. The scheme is implemented on a set of test images and the performance of the algorithm is proved better both objectively and subjectively than the standard methods. The problems of over segmentation and under segmentation are also addressed by the proposed segmentation technique","PeriodicalId":275012,"journal":{"name":"2006 IFIP International Conference on Wireless and Optical Communications Networks","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133421067","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2006-08-07DOI: 10.1109/WOCN.2006.1666557
Md. Shahriar Karim, G. Sharma, R. Tripathi
TCP is an end to end transmission control protocol was originally tuned for wired network. As the random packet loss due to bit error is not negligible in wireless network, it causes a sever performance degradation of TCP under wireless environment. In the paper TCP is exclusively studied. Here in the paper a heterogeneous network have been considered. Challenges of TCP in such network have been well emphasized in the paper. Different versions of TCP have been explained and compared on the basis of simulation results
{"title":"Performance of TCP and the concept of heterogeneity in the future communication network","authors":"Md. Shahriar Karim, G. Sharma, R. Tripathi","doi":"10.1109/WOCN.2006.1666557","DOIUrl":"https://doi.org/10.1109/WOCN.2006.1666557","url":null,"abstract":"TCP is an end to end transmission control protocol was originally tuned for wired network. As the random packet loss due to bit error is not negligible in wireless network, it causes a sever performance degradation of TCP under wireless environment. In the paper TCP is exclusively studied. Here in the paper a heterogeneous network have been considered. Challenges of TCP in such network have been well emphasized in the paper. Different versions of TCP have been explained and compared on the basis of simulation results","PeriodicalId":275012,"journal":{"name":"2006 IFIP International Conference on Wireless and Optical Communications Networks","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122048818","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2006-08-07DOI: 10.1109/WOCN.2006.1666576
N. Duraipandian, C. Chellappan
The use of data classification schemes to secure information of an organization has been in use right from the day information has been stored in physical medium. Generally information is classified as public, internal use only, confidential, and highly confidential based on the value. Once classified into a particular classification level, it remains static. But in the current scenario, factors such as change in user hierarchy, addition of more projects requires a change in classification level which ensures better security. In this paper we propose a novel approach for monitoring & dynamically changing the classification level of information. The proposed approach utilizes a technique which takes into consideration the information usage data to make a decision on the new classification level
{"title":"Dynamic information security level reclassification","authors":"N. Duraipandian, C. Chellappan","doi":"10.1109/WOCN.2006.1666576","DOIUrl":"https://doi.org/10.1109/WOCN.2006.1666576","url":null,"abstract":"The use of data classification schemes to secure information of an organization has been in use right from the day information has been stored in physical medium. Generally information is classified as public, internal use only, confidential, and highly confidential based on the value. Once classified into a particular classification level, it remains static. But in the current scenario, factors such as change in user hierarchy, addition of more projects requires a change in classification level which ensures better security. In this paper we propose a novel approach for monitoring & dynamically changing the classification level of information. The proposed approach utilizes a technique which takes into consideration the information usage data to make a decision on the new classification level","PeriodicalId":275012,"journal":{"name":"2006 IFIP International Conference on Wireless and Optical Communications Networks","volume":"8 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130180238","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2006-08-07DOI: 10.1109/WOCN.2006.1666653
T. Subash, S. Indiragandhi
The performance of optical networks which carry traffic with a wide range of requirements is greatly influenced by the scheduling disciplines present in the routers and switches. In this work performance of scheduling disciplines like FIFO (first in first out), PQ (parity queuing), WFQ (weighted fairness queuing), MWRR (multiclass weighted round robin), CQ (custom queuing) and DWRR (deficit weighted round robin) in packet dropping and reception for a high speed network is simulated. OPNET IT GURU a network simulator from OPNET Technologies has been used for simulation. It has been observed that PQ, WFQ, MWRR, DWRR perform alike in dropping packets. The bursty nature of WFQ doesn't make it to receive any voice traffic over all intervals of time. Regarding video conferencing traffic a sharp fall in received data was observed for PQ and CQ
光网络承载的流量要求非常广泛，其性能受到路由器和交换机调度规则的极大影响。本文模拟了高速网络中FIFO(先进先出)、PQ(奇偶排队)、WFQ(加权公平排队)、MWRR(多类加权轮询)、CQ(自定义排队)和DWRR(亏损加权轮询)等调度原则在丢包和接收中的工作性能。使用OPNET技术公司的网络模拟器OPNET IT GURU进行仿真。已经观察到PQ、WFQ、MWRR、DWRR在丢包中的表现是相似的。WFQ的突发特性使它无法在所有时间间隔内接收任何语音流量。关于视频会议流量，PQ和CQ的接收数据急剧下降
{"title":"Performance analysis of scheduling disciplines in optical networks","authors":"T. Subash, S. Indiragandhi","doi":"10.1109/WOCN.2006.1666653","DOIUrl":"https://doi.org/10.1109/WOCN.2006.1666653","url":null,"abstract":"The performance of optical networks which carry traffic with a wide range of requirements is greatly influenced by the scheduling disciplines present in the routers and switches. In this work performance of scheduling disciplines like FIFO (first in first out), PQ (parity queuing), WFQ (weighted fairness queuing), MWRR (multiclass weighted round robin), CQ (custom queuing) and DWRR (deficit weighted round robin) in packet dropping and reception for a high speed network is simulated. OPNET IT GURU a network simulator from OPNET Technologies has been used for simulation. It has been observed that PQ, WFQ, MWRR, DWRR perform alike in dropping packets. The bursty nature of WFQ doesn't make it to receive any voice traffic over all intervals of time. Regarding video conferencing traffic a sharp fall in received data was observed for PQ and CQ","PeriodicalId":275012,"journal":{"name":"2006 IFIP International Conference on Wireless and Optical Communications Networks","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129283908","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2006-08-07DOI: 10.1109/WOCN.2006.1666599
A. Chowdhury, Sukumar Nandi
The absence of guaranteed static reference nodes in a dynamic MANET environment makes it almost impossible to control the propagation of a broadcast packet in a controlled fashion. Therefore, to offset the well documented inefficiencies of a simple flooding mechanism, we propose optimal reliability broadcast mechanism (ORBM). ORBM is a received signal strength based scheme to control temporal congestion (arising out of broadcast storms) and reducing rebroadcast redundancy. Our main focus has been the prioritization of retransmissions from nodes which cover maximum virgin territory. Moreover, ORBM is topology adaptive, in the sense that there is higher rebroadcast suppression in a dense neighborhood than in a sparse one. Our simulations show that ORBM is highly scalable and practically immune to neighbor density as well as mobility. The strength of ORBM lies in the cost of a flood growing linearly with the network diameter
{"title":"Received signal based minimization of broadcast storm in multi-hop MANET","authors":"A. Chowdhury, Sukumar Nandi","doi":"10.1109/WOCN.2006.1666599","DOIUrl":"https://doi.org/10.1109/WOCN.2006.1666599","url":null,"abstract":"The absence of guaranteed static reference nodes in a dynamic MANET environment makes it almost impossible to control the propagation of a broadcast packet in a controlled fashion. Therefore, to offset the well documented inefficiencies of a simple flooding mechanism, we propose optimal reliability broadcast mechanism (ORBM). ORBM is a received signal strength based scheme to control temporal congestion (arising out of broadcast storms) and reducing rebroadcast redundancy. Our main focus has been the prioritization of retransmissions from nodes which cover maximum virgin territory. Moreover, ORBM is topology adaptive, in the sense that there is higher rebroadcast suppression in a dense neighborhood than in a sparse one. Our simulations show that ORBM is highly scalable and practically immune to neighbor density as well as mobility. The strength of ORBM lies in the cost of a flood growing linearly with the network diameter","PeriodicalId":275012,"journal":{"name":"2006 IFIP International Conference on Wireless and Optical Communications Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129493174","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
扫码关注我们
求助内容：
应助结果提醒方式：