Pub Date : 2004-04-19DOI: 10.1109/CCNC.2004.1286900
C. Klimanee, D. T. Nguyen
The directional bandpass Gabor filter bank approach is one of the most effective and mathematically elegant techniques to date for fingerprint image enhancement. The filter output, however, is very sensitive to ridge orientation and the frequency that the filter is tuned to, and also to the spatial parameters of the Gaussian envelope. Unfortunately, filtering of a fingerprint image with an adaptive 2D Gabor filter bank is computationally expensive because ridge orientation and frequency vary significantly throughout the fingerprint. We propose to use an array of 8/spl times/4 two-dimensional Gabor filters tuned to eight directions and four ridge frequencies. Filtered fingerprint images at any combination of local ridge orientation and frequency can be calculated using a 2D interpolation algorithm The proposed technique produces a better image quality than current Gabor-based techniques. The results are compared using a goodness index measure of the reliability of the automatic minutiae detection.
{"title":"On the design of 2D Gabor filtering of fingerprint images","authors":"C. Klimanee, D. T. Nguyen","doi":"10.1109/CCNC.2004.1286900","DOIUrl":"https://doi.org/10.1109/CCNC.2004.1286900","url":null,"abstract":"The directional bandpass Gabor filter bank approach is one of the most effective and mathematically elegant techniques to date for fingerprint image enhancement. The filter output, however, is very sensitive to ridge orientation and the frequency that the filter is tuned to, and also to the spatial parameters of the Gaussian envelope. Unfortunately, filtering of a fingerprint image with an adaptive 2D Gabor filter bank is computationally expensive because ridge orientation and frequency vary significantly throughout the fingerprint. We propose to use an array of 8/spl times/4 two-dimensional Gabor filters tuned to eight directions and four ridge frequencies. Filtered fingerprint images at any combination of local ridge orientation and frequency can be calculated using a 2D interpolation algorithm The proposed technique produces a better image quality than current Gabor-based techniques. The results are compared using a goodness index measure of the reliability of the automatic minutiae detection.","PeriodicalId":316094,"journal":{"name":"First IEEE Consumer Communications and Networking Conference, 2004. CCNC 2004.","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130121711","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-04-19DOI: 10.1109/CCNC.2004.1286927
S. Cacciaguerra, M. Roccetti, M. Roffilli, A. Lomi
New technological developments in wireless networks and location-based information systems are greatly affecting the prominent scenarios represented by mobile markets, commercial and industrial organizations, and cooperative social environments. To model and control such complex organizational systems, the use of scientific methodologies, such as participatory simulation and agent-based modeling, is becoming increasingly common. Further, users of these collaborative systems demand the availability of sophisticated tools that are able to present visually the results of cooperative simulation activities on the screen of handheld devices. We have designed and developed a software architecture able to support the execution of agent-based participatory simulation activities, and to render them in a 3D virtual world over wireless devices. We report on several experiments, gathered in the field, showing that the architecture we have developed is able to render, in a timely fashion, on a wireless device, the results of cooperative simulation activities performed by agent-based programming platforms.
{"title":"A wireless software architecture for fast 3D rendering of agent-based multimedia simulations on portable devices","authors":"S. Cacciaguerra, M. Roccetti, M. Roffilli, A. Lomi","doi":"10.1109/CCNC.2004.1286927","DOIUrl":"https://doi.org/10.1109/CCNC.2004.1286927","url":null,"abstract":"New technological developments in wireless networks and location-based information systems are greatly affecting the prominent scenarios represented by mobile markets, commercial and industrial organizations, and cooperative social environments. To model and control such complex organizational systems, the use of scientific methodologies, such as participatory simulation and agent-based modeling, is becoming increasingly common. Further, users of these collaborative systems demand the availability of sophisticated tools that are able to present visually the results of cooperative simulation activities on the screen of handheld devices. We have designed and developed a software architecture able to support the execution of agent-based participatory simulation activities, and to render them in a 3D virtual world over wireless devices. We report on several experiments, gathered in the field, showing that the architecture we have developed is able to render, in a timely fashion, on a wireless device, the results of cooperative simulation activities performed by agent-based programming platforms.","PeriodicalId":316094,"journal":{"name":"First IEEE Consumer Communications and Networking Conference, 2004. CCNC 2004.","volume":"127 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133475116","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-04-19DOI: 10.1109/CCNC.2004.1286929
John V. Harrison, Anna Andrusiewicz
Digital signage networks are a newly emerging form of public space electronic media technology that offer significant advantages over traditional signage and enables a narrowcasting model. Due in part to the decreasing price of gas plasma, and other display technologies, digital signage networks are now rapidly growing in popularity and prevalence. Augmenting digital signage with wireless LAN technology enhances the narrowcasting model by enabling consumers to interact with the narrowcaster to obtain additional information from particular narrowcasters, e.g., advertisers, of interest. When explicitly permitted by the consumer, this enables the narrowcaster to obtain more information about the consumer. We describe the cost reduction and increased effectiveness of advertising that is displayed and managed using digital signage networks as opposed to traditional signage. We present an enhanced narrowcasting model created by augmenting the network with wireless LAN technology. We describe several scenarios where a system based on the model enables novel interaction between the narrowcaster and consumer. These features provide new support for mobile commerce. We then propose an architecture that implements the enhanced narrowcasting model that we have implemented in our system prototype.
{"title":"Using wireless networks to enhance narrowcasting in public spaces","authors":"John V. Harrison, Anna Andrusiewicz","doi":"10.1109/CCNC.2004.1286929","DOIUrl":"https://doi.org/10.1109/CCNC.2004.1286929","url":null,"abstract":"Digital signage networks are a newly emerging form of public space electronic media technology that offer significant advantages over traditional signage and enables a narrowcasting model. Due in part to the decreasing price of gas plasma, and other display technologies, digital signage networks are now rapidly growing in popularity and prevalence. Augmenting digital signage with wireless LAN technology enhances the narrowcasting model by enabling consumers to interact with the narrowcaster to obtain additional information from particular narrowcasters, e.g., advertisers, of interest. When explicitly permitted by the consumer, this enables the narrowcaster to obtain more information about the consumer. We describe the cost reduction and increased effectiveness of advertising that is displayed and managed using digital signage networks as opposed to traditional signage. We present an enhanced narrowcasting model created by augmenting the network with wireless LAN technology. We describe several scenarios where a system based on the model enables novel interaction between the narrowcaster and consumer. These features provide new support for mobile commerce. We then propose an architecture that implements the enhanced narrowcasting model that we have implemented in our system prototype.","PeriodicalId":316094,"journal":{"name":"First IEEE Consumer Communications and Networking Conference, 2004. CCNC 2004.","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132585245","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-04-19DOI: 10.1109/CCNC.2004.1286823
F. D. Hartog, M. Balm, C. M. Jong, J. Kwaaitaal
A new OSI (Open Systems Interconnection)-based model is described that can be used for the classification of residential gateways (RG). It is applied to analyze current gateway solutions and to draw evolutionary paths for the mid-to-long term. It is concluded that set-top boxes and broadband modems especially, in contrast to game consoles and PCs, have a strong potential to evolve towards gateways that deliver network services to the home on all OSI layers, though they will probably not converge. In the context of our model, we have not found any compelling reasons for the residential gateway industry to support concurrent multiple broadband access network connections on a single RG in the near future.
{"title":"Convergence of residential gateway technology: analysis of evolutionary paths","authors":"F. D. Hartog, M. Balm, C. M. Jong, J. Kwaaitaal","doi":"10.1109/CCNC.2004.1286823","DOIUrl":"https://doi.org/10.1109/CCNC.2004.1286823","url":null,"abstract":"A new OSI (Open Systems Interconnection)-based model is described that can be used for the classification of residential gateways (RG). It is applied to analyze current gateway solutions and to draw evolutionary paths for the mid-to-long term. It is concluded that set-top boxes and broadband modems especially, in contrast to game consoles and PCs, have a strong potential to evolve towards gateways that deliver network services to the home on all OSI layers, though they will probably not converge. In the context of our model, we have not found any compelling reasons for the residential gateway industry to support concurrent multiple broadband access network connections on a single RG in the near future.","PeriodicalId":316094,"journal":{"name":"First IEEE Consumer Communications and Networking Conference, 2004. CCNC 2004.","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115389734","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-04-19DOI: 10.1109/CCNC.2004.1286965
H. V. Kampen, G. Hiddink
This paper discusses requirements for streaming entertainment applications and explores solutions that meet these requirements in a wireless environment. It is shown that IEEE 802.11 technology, together with its enhancements for high-throughput and quality of service (QoS), in combination with proprietary algorithms for robust radio transmissions, offers an ideal framework for home networking.
{"title":"High-performance home entertainment networking with IEEE 802.11","authors":"H. V. Kampen, G. Hiddink","doi":"10.1109/CCNC.2004.1286965","DOIUrl":"https://doi.org/10.1109/CCNC.2004.1286965","url":null,"abstract":"This paper discusses requirements for streaming entertainment applications and explores solutions that meet these requirements in a wireless environment. It is shown that IEEE 802.11 technology, together with its enhancements for high-throughput and quality of service (QoS), in combination with proprietary algorithms for robust radio transmissions, offers an ideal framework for home networking.","PeriodicalId":316094,"journal":{"name":"First IEEE Consumer Communications and Networking Conference, 2004. CCNC 2004.","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115592788","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-04-19DOI: 10.1109/CCNC.2004.1286835
J. Al-Karaki, A. Kamal, R. Ul-Mustafa
A mobile ad hoc network (MANET) can be represented by a set of logical clusters with clusterheads (CHs) acting like virtual base-stations, hence forming a wireless virtual backbone. The role of clusterhead is a temporary one, which changes dynamically as the topology or other factors affecting it change. Finding the minimal set of CHs is an NP-complete problem. We study the performance tradeoffs between two clustering approaches. The first one is a simple clustering strategy, called virtual grid architecture (VGA), which is based on a fixed rectilinear virtual topology, while the second one is an optimal clustering strategy. We consider homogeneous as well as heterogeneous networks. First, for homogeneous MANETs with a large number of users and under the VGA clustering approach, we derive expressions for the number of CHs, worst case path length, and average case path length. We also derive expressions for the communication overhead. Second, we develop an integer linear program (ILP) that finds the optimal number of connected CHs in small to medium sized heterogeneous MANETs. Analytical and simulation results show that our proposed clustering algorithm (VGA), although being simple, is close to optimal.
{"title":"On the optimal clustering in mobile ad hoc networks","authors":"J. Al-Karaki, A. Kamal, R. Ul-Mustafa","doi":"10.1109/CCNC.2004.1286835","DOIUrl":"https://doi.org/10.1109/CCNC.2004.1286835","url":null,"abstract":"A mobile ad hoc network (MANET) can be represented by a set of logical clusters with clusterheads (CHs) acting like virtual base-stations, hence forming a wireless virtual backbone. The role of clusterhead is a temporary one, which changes dynamically as the topology or other factors affecting it change. Finding the minimal set of CHs is an NP-complete problem. We study the performance tradeoffs between two clustering approaches. The first one is a simple clustering strategy, called virtual grid architecture (VGA), which is based on a fixed rectilinear virtual topology, while the second one is an optimal clustering strategy. We consider homogeneous as well as heterogeneous networks. First, for homogeneous MANETs with a large number of users and under the VGA clustering approach, we derive expressions for the number of CHs, worst case path length, and average case path length. We also derive expressions for the communication overhead. Second, we develop an integer linear program (ILP) that finds the optimal number of connected CHs in small to medium sized heterogeneous MANETs. Analytical and simulation results show that our proposed clustering algorithm (VGA), although being simple, is close to optimal.","PeriodicalId":316094,"journal":{"name":"First IEEE Consumer Communications and Networking Conference, 2004. CCNC 2004.","volume":"172 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115719068","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-04-19DOI: 10.1109/CCNC.2004.1286958
Michael J. Johnson, Roger L. Adema
Collisions, collision avoidance, hidden terminals, and automatic rate selection in response to signal quality all reduce the effective bandwidth of the 802.11 wireless medium when many clients are active in proximity. To determine the resulting degraded bandwidth, experiments were conducted with 96 wireless clients operating simultaneously in a variety of signal quality conditions, each having traffic typical of a browser-interfaced Web service. The wireless medium was modeled as an M/M/1 queue with capacity a parameter determined by a nonlinear regression fit to the measurements. The analysis provides practical design guidelines for wireless bandwidth utilization and access point placement in settings having a large number of moving clients.
{"title":"Functional coexistence of many wireless clients","authors":"Michael J. Johnson, Roger L. Adema","doi":"10.1109/CCNC.2004.1286958","DOIUrl":"https://doi.org/10.1109/CCNC.2004.1286958","url":null,"abstract":"Collisions, collision avoidance, hidden terminals, and automatic rate selection in response to signal quality all reduce the effective bandwidth of the 802.11 wireless medium when many clients are active in proximity. To determine the resulting degraded bandwidth, experiments were conducted with 96 wireless clients operating simultaneously in a variety of signal quality conditions, each having traffic typical of a browser-interfaced Web service. The wireless medium was modeled as an M/M/1 queue with capacity a parameter determined by a nonlinear regression fit to the measurements. The analysis provides practical design guidelines for wireless bandwidth utilization and access point placement in settings having a large number of moving clients.","PeriodicalId":316094,"journal":{"name":"First IEEE Consumer Communications and Networking Conference, 2004. CCNC 2004.","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117231676","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-04-19DOI: 10.1109/CCNC.2004.1286852
Hui Tian, Hong Shen
The use of multicast inference on end-to-end measurement has recently been proposed as a means of obtaining the underlying multicast topology. We analyze the algorithm of binary loss tree classification with hop count (HBLT). We compare it with the binary loss tree classification algorithm (BLT) and show that the probability of misclassification of HBLT decreases more quickly than that of BLT as the number of probing packets increases. The inference accuracy of HBLT is always 1 (the inferred tree is identical to the physical tree) in the case of correct classification, whereas that of BLT is dependent on the shape of the physical tree and inversely proportional to the number of internal nodes with a single child. Our analytical result shows that HBLT is superior to BLT, not only on time complexity, but also on misclassification probability and inference accuracy.
{"title":"Analysis on binary loss tree classification with hop count for multicast topology discovery","authors":"Hui Tian, Hong Shen","doi":"10.1109/CCNC.2004.1286852","DOIUrl":"https://doi.org/10.1109/CCNC.2004.1286852","url":null,"abstract":"The use of multicast inference on end-to-end measurement has recently been proposed as a means of obtaining the underlying multicast topology. We analyze the algorithm of binary loss tree classification with hop count (HBLT). We compare it with the binary loss tree classification algorithm (BLT) and show that the probability of misclassification of HBLT decreases more quickly than that of BLT as the number of probing packets increases. The inference accuracy of HBLT is always 1 (the inferred tree is identical to the physical tree) in the case of correct classification, whereas that of BLT is dependent on the shape of the physical tree and inversely proportional to the number of internal nodes with a single child. Our analytical result shows that HBLT is superior to BLT, not only on time complexity, but also on misclassification probability and inference accuracy.","PeriodicalId":316094,"journal":{"name":"First IEEE Consumer Communications and Networking Conference, 2004. CCNC 2004.","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128231789","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-04-19DOI: 10.1109/CCNC.2004.1286925
Pradipta De, Srikant Sharma, Andrew Shuvalov, T. Chiueh
The ability to deliver digital video over wireless networks is an enabling technology for many useful applications, ranging from home entertainment and security monitoring to enterprise messaging and military reconnaissance, and thus represents the holy grail of wireless technology development. We describe a wireless video delivery system, WiVision, which uses IEEE 802.11 wireless LANs as the last mile for both real-time video distribution and on-demand video playback. WiVision can air both live events, such as on-campus seminars and sports activities, and prestored video streams, such as course lectures and financial analysis sessions, to mobile users, who can tune in to selected channels of their choice from their laptops or PDAs. An innovative feature of WiVision is the support for random video access based on keyword-search, where keywords are extracted from the closed-caption text embedded in TV programs. In addition, WiVision is able to broadcast video streams on the wireless link while seamlessly working with commercially available media players. The paper presents the implementation details of the real-time acquisition and network transport components of a fully operational WiVision prototype, and the results of a performance evaluation study on that prototype.
{"title":"WiVision: a wireless video system for real-time distribution and on-demand playback","authors":"Pradipta De, Srikant Sharma, Andrew Shuvalov, T. Chiueh","doi":"10.1109/CCNC.2004.1286925","DOIUrl":"https://doi.org/10.1109/CCNC.2004.1286925","url":null,"abstract":"The ability to deliver digital video over wireless networks is an enabling technology for many useful applications, ranging from home entertainment and security monitoring to enterprise messaging and military reconnaissance, and thus represents the holy grail of wireless technology development. We describe a wireless video delivery system, WiVision, which uses IEEE 802.11 wireless LANs as the last mile for both real-time video distribution and on-demand video playback. WiVision can air both live events, such as on-campus seminars and sports activities, and prestored video streams, such as course lectures and financial analysis sessions, to mobile users, who can tune in to selected channels of their choice from their laptops or PDAs. An innovative feature of WiVision is the support for random video access based on keyword-search, where keywords are extracted from the closed-caption text embedded in TV programs. In addition, WiVision is able to broadcast video streams on the wireless link while seamlessly working with commercially available media players. The paper presents the implementation details of the real-time acquisition and network transport components of a fully operational WiVision prototype, and the results of a performance evaluation study on that prototype.","PeriodicalId":316094,"journal":{"name":"First IEEE Consumer Communications and Networking Conference, 2004. CCNC 2004.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129658701","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-04-19DOI: 10.1109/CCNC.2004.1286934
Bo Yan, Kam-Wing Ng
Error concealment is an effective method to combat channel errors for video transmission. In video coding, motion vectors (MVs) are highly significant for the matching of the missing video block. Thus, how to recover the lost MV is an important issue for error concealment in video communications. Concerning the high block loss ratio (BLR) during video transmission and the matching of edge blocks in video frames, we proposed a selective motion vector matching (SMVM) algorithm for MV recovery. It incorporates the status flags of the neighboring pixels of the missing block and constructs new MV sets for block matching. Experimental results show that it significantly outperforms other existing MV recovery methods for error concealment at different BLRs.
{"title":"A novel motion vector recovery algorithm for error concealment in video transmission","authors":"Bo Yan, Kam-Wing Ng","doi":"10.1109/CCNC.2004.1286934","DOIUrl":"https://doi.org/10.1109/CCNC.2004.1286934","url":null,"abstract":"Error concealment is an effective method to combat channel errors for video transmission. In video coding, motion vectors (MVs) are highly significant for the matching of the missing video block. Thus, how to recover the lost MV is an important issue for error concealment in video communications. Concerning the high block loss ratio (BLR) during video transmission and the matching of edge blocks in video frames, we proposed a selective motion vector matching (SMVM) algorithm for MV recovery. It incorporates the status flags of the neighboring pixels of the missing block and constructs new MV sets for block matching. Experimental results show that it significantly outperforms other existing MV recovery methods for error concealment at different BLRs.","PeriodicalId":316094,"journal":{"name":"First IEEE Consumer Communications and Networking Conference, 2004. CCNC 2004.","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131038376","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
扫码关注我们
求助内容：
应助结果提醒方式：