Currently, there are many occasions to communicate with each other in the collaborative virtual environment. However, it is more difficult to keep high-motivation for participating in communication in such virtual environment than in face-to-face environment. It is considered that the reasons are 1) the difficulty of understanding how their own motivations are and 2) the boring expression due to the fixed view point. To address this issue, we display electroencephalogram information to a virtual space by forward-backward model - zoom in/out of whole virtual space. According to the results of experiment, our system successfully provides an environment in which people can keep high-motivations for participating in communication.
{"title":"Development and Evaluation of a Collaborative Virtual Environment Supporting Self Feedbacks of Electroencephalogram","authors":"Akihiro Miyata, Shota Yamamoto, Masaki Hayashi, Takefumi Hayashi, H. Shigeno, Ken-ichi Okada","doi":"10.1109/AINA.2008.99","DOIUrl":"https://doi.org/10.1109/AINA.2008.99","url":null,"abstract":"Currently, there are many occasions to communicate with each other in the collaborative virtual environment. However, it is more difficult to keep high-motivation for participating in communication in such virtual environment than in face-to-face environment. It is considered that the reasons are 1) the difficulty of understanding how their own motivations are and 2) the boring expression due to the fixed view point. To address this issue, we display electroencephalogram information to a virtual space by forward-backward model - zoom in/out of whole virtual space. According to the results of experiment, our system successfully provides an environment in which people can keep high-motivations for participating in communication.","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":"125837367","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}
One of the challenges to secure wireless sensor networks (WSNs) is to design secure pair-wise key agreement between any pair of resources-limited sensors while keeping strong connectivity. In this paper, we point out the fatal security weaknesses of Cheng-Agrawal's pair-wise key agreement scheme for WSNs, and then propose a new scheme. Compared to the existing schemes, the proposed scheme owns two outstanding merits- assurance of connectivity between any pair of nodes and security robustness against node capture attack.
{"title":"Efficient Key Pre-distribution for Sensor Nodes with Strong Connectivity and Low Storage Space","authors":"H. Chien, R. Chen, An-Ni Shen","doi":"10.1109/AINA.2008.24","DOIUrl":"https://doi.org/10.1109/AINA.2008.24","url":null,"abstract":"One of the challenges to secure wireless sensor networks (WSNs) is to design secure pair-wise key agreement between any pair of resources-limited sensors while keeping strong connectivity. In this paper, we point out the fatal security weaknesses of Cheng-Agrawal's pair-wise key agreement scheme for WSNs, and then propose a new scheme. Compared to the existing schemes, the proposed scheme owns two outstanding merits- assurance of connectivity between any pair of nodes and security robustness against node capture attack.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"5 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":"125261754","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}
Kazuya Odagiri, G. Marco, Nao Tanoue, Rihito Yaegashi, M. Tadauchi, N. Ishii
In standard IP networks, the control of communication of individual connections is an important aspect of network management. Generally, we distinguish two models of communication control. One is based on the exploitation of standard mechanisms, such as IP filtering, port blocking, routing rules, deployed along the path between the client and the server. We refer to these mechanisms as infrastructure-based management model. On the other hand, the control can be carried out by controlling the client machines of every user. This new model is a client-side management model, and it has been realized in our previous work, by means of a dedicated framework we called DACS. Essentially, DACS distributes the control within the client machines. Therefore, also the network management processing workload is distributed. While in our previous work we investigated functions of DACS scheme and network services, here we are more concerned with analyzing the processing workload due to communication control demanded to the client machines in practical networks. In this regard, we evaluate DACS performance from the point of view of the processing load and demonstrate by some preliminary experiments that DACS framework is better than infrastructure-based management models. From this result, we conclude that, DACS outperforms existing solutions for the communication control problem, because it can control a whole local area network by distributed control of client machines, with an acceptable increase of the processing workload.
{"title":"Evaluation of the Processing Workload for Two Models of Communication Control in IP Networks","authors":"Kazuya Odagiri, G. Marco, Nao Tanoue, Rihito Yaegashi, M. Tadauchi, N. Ishii","doi":"10.1109/AINA.2008.63","DOIUrl":"https://doi.org/10.1109/AINA.2008.63","url":null,"abstract":"In standard IP networks, the control of communication of individual connections is an important aspect of network management. Generally, we distinguish two models of communication control. One is based on the exploitation of standard mechanisms, such as IP filtering, port blocking, routing rules, deployed along the path between the client and the server. We refer to these mechanisms as infrastructure-based management model. On the other hand, the control can be carried out by controlling the client machines of every user. This new model is a client-side management model, and it has been realized in our previous work, by means of a dedicated framework we called DACS. Essentially, DACS distributes the control within the client machines. Therefore, also the network management processing workload is distributed. While in our previous work we investigated functions of DACS scheme and network services, here we are more concerned with analyzing the processing workload due to communication control demanded to the client machines in practical networks. In this regard, we evaluate DACS performance from the point of view of the processing load and demonstrate by some preliminary experiments that DACS framework is better than infrastructure-based management models. From this result, we conclude that, DACS outperforms existing solutions for the communication control problem, because it can control a whole local area network by distributed control of client machines, with an acceptable increase of the processing workload.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"47 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":"126961727","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}
Xinchao Zhao, Beihong Jin, Shuang Yu, Zhenyue Long
RFID technology facilitates monitoring and managing products. In most RFID applications, users pay much attention to temporal and logical event patterns, which is further strengthened by highly temporal RFID data. If RFID events or other kinds of events are disseminated to users through Pub/Sub service, visibility of product states will be greatly increased and fast processing these events will become possible. However, the traditional Pub/Sub systems cannot support composite events involving abundant temporal constraints. Therefore, they cannot fully meet the needs of RFID applications. Aiming at RFID-related application scenarios, this paper designs a composite subscription language embedded with diversified temporal operators and proposes a matching algorithm for detecting composite events which has been implemented in our Pub/Sub system OncePubSub. Performance evaluation results indicate our algorithm is more efficient than the two systems based on Siena and JESS respectively.
{"title":"Composite Subscription and Matching Algorithm for RFID Applications","authors":"Xinchao Zhao, Beihong Jin, Shuang Yu, Zhenyue Long","doi":"10.1109/AINA.2008.49","DOIUrl":"https://doi.org/10.1109/AINA.2008.49","url":null,"abstract":"RFID technology facilitates monitoring and managing products. In most RFID applications, users pay much attention to temporal and logical event patterns, which is further strengthened by highly temporal RFID data. If RFID events or other kinds of events are disseminated to users through Pub/Sub service, visibility of product states will be greatly increased and fast processing these events will become possible. However, the traditional Pub/Sub systems cannot support composite events involving abundant temporal constraints. Therefore, they cannot fully meet the needs of RFID applications. Aiming at RFID-related application scenarios, this paper designs a composite subscription language embedded with diversified temporal operators and proposes a matching algorithm for detecting composite events which has been implemented in our Pub/Sub system OncePubSub. Performance evaluation results indicate our algorithm is more efficient than the two systems based on Siena and JESS respectively.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"74 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":"122347916","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}
Trust has been recognized as an important factor for information security in open and dynamic environments, such as Internet applications, p2p systems etc. On the basis of analyzing existing trust management systems, this paper proposes a Distributed Trust Management based on Authorizing Negotiation (DTMAN). DTMAN presents a number of innovative features. First, it can authorize strangers by using authorizing negotiation, so it is very suitable for open and dynamic environments. Second, a high efficient algorithm for compliance checking is developed to support DTMAN, whose time complexity and space complexity are both O(n) (where n is the cardinality of the set of authorization credentials). The experimental result shows that the algorithm of DTMAN is more efficient than others.
{"title":"A Distributed Trust Management Based on Authorizing Negotiation in Open and Dynamic Environments","authors":"Shangyuan Guan, Xiaoshe Dong, Weiguo Wu, Yiduo Mei, Guofu Feng","doi":"10.1109/AINA.2008.25","DOIUrl":"https://doi.org/10.1109/AINA.2008.25","url":null,"abstract":"Trust has been recognized as an important factor for information security in open and dynamic environments, such as Internet applications, p2p systems etc. On the basis of analyzing existing trust management systems, this paper proposes a Distributed Trust Management based on Authorizing Negotiation (DTMAN). DTMAN presents a number of innovative features. First, it can authorize strangers by using authorizing negotiation, so it is very suitable for open and dynamic environments. Second, a high efficient algorithm for compliance checking is developed to support DTMAN, whose time complexity and space complexity are both O(n) (where n is the cardinality of the set of authorization credentials). The experimental result shows that the algorithm of DTMAN is more efficient than others.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"53 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":"122708421","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}
With the increasing growth of the Internet, the explosion of attacks and viruses significantly affects the network security. Network intrusion detection system (NIDS) is developed to identify these network attacks by a set of rules. However, searching for multiple patterns is a computationally expensive task in NIDS. Traditional software-based solutions can not meet the high bandwidth demanded in current high-speed networks. In the past, the pre-filtering designed for NIDS is an effective technique that can reduce the processing overhead significantly. A FNP- like TCAM searching engine (FTSE) is an example that uses an 2-stage architecture to detect whether an incoming string contains patterns. In this paper, we propose two techniques to improve the performance of FTSE that utilizes ternary content addressable memory (TCAM) as pre-filter to achieve gigabit performance. The first technique performs the w-byte suffix pattern match instead of using w-byte prefix. The second technique finds the matching results from all groups rather than first group. We finally present the simulation result using Snort pattern set and DEFCON packet traces.
{"title":"Improved TCAM-Based Pre-Filtering for Network Intrusion Detection Systems","authors":"Yeim-Kuan Chang, Ming-Li Tsai, Cheng-Chien Su","doi":"10.1109/AINA.2008.120","DOIUrl":"https://doi.org/10.1109/AINA.2008.120","url":null,"abstract":"With the increasing growth of the Internet, the explosion of attacks and viruses significantly affects the network security. Network intrusion detection system (NIDS) is developed to identify these network attacks by a set of rules. However, searching for multiple patterns is a computationally expensive task in NIDS. Traditional software-based solutions can not meet the high bandwidth demanded in current high-speed networks. In the past, the pre-filtering designed for NIDS is an effective technique that can reduce the processing overhead significantly. A FNP- like TCAM searching engine (FTSE) is an example that uses an 2-stage architecture to detect whether an incoming string contains patterns. In this paper, we propose two techniques to improve the performance of FTSE that utilizes ternary content addressable memory (TCAM) as pre-filter to achieve gigabit performance. The first technique performs the w-byte suffix pattern match instead of using w-byte prefix. The second technique finds the matching results from all groups rather than first group. We finally present the simulation result using Snort pattern set and DEFCON packet traces.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"77 4 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":"122450135","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}
Proxy mobile IPv6 is one of network-based mobility support protocols which does not require a mobile host to be involved in mobility support signaling. Even though proxy mobile IPv6 has many advantages than client-based mobility support protocols such as mobile IPv6, unfortunately, it may cause an out-of-sequence problem during its route optimization procedure. Thus, in this paper, we develop an estimation function for an out- of-sequence time period and reveal the out-of-sequence problem caused by the route optimization procedure. Then we propose a scheme which minimizes the arrival of out-of-sequence packets to the mobile host and analyze the impact of out-of-sequence packets. The performance evaluation results demonstrate that the traffic rate and out-of-sequence time period mainly have an effect on the out-of-sequence problem.
{"title":"Preventing Out-of-Sequence Packets on the Route Optimization Procedure in Proxy Mobile IPv6","authors":"Jong‐Hyouk Lee, Hyung-Jin Lim, Tai-Myung Chung","doi":"10.1109/AINA.2008.100","DOIUrl":"https://doi.org/10.1109/AINA.2008.100","url":null,"abstract":"Proxy mobile IPv6 is one of network-based mobility support protocols which does not require a mobile host to be involved in mobility support signaling. Even though proxy mobile IPv6 has many advantages than client-based mobility support protocols such as mobile IPv6, unfortunately, it may cause an out-of-sequence problem during its route optimization procedure. Thus, in this paper, we develop an estimation function for an out- of-sequence time period and reveal the out-of-sequence problem caused by the route optimization procedure. Then we propose a scheme which minimizes the arrival of out-of-sequence packets to the mobile host and analyze the impact of out-of-sequence packets. The performance evaluation results demonstrate that the traffic rate and out-of-sequence time period mainly have an effect on the out-of-sequence problem.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"38 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":"122977358","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}
Takumi Yamamoto, Atsushi Harada, T. Isarida, M. Nishigaki
A user authentication system using "unclear images" as pass-images has been proposed, in which only legitimate users can understand their meaning by viewing the original images corresponding to the unclear pass-images. These unclear images are meaningless to unauthorized users. Hence, it is difficult for attackers to memorize these unclear pass-images, even though they may have observed legitimate users' authentication trials. However, as long as the same pass-images are always used, it would not be completely impossible for unauthorized users to memorize unclear-images. Therefore, this paper discusses enhancement to the authentication system by permitting users to memorize a number of pass-images and using a different subset of pass-images at all authentication trials. To mitigate the burden imposed by memorizing additional pass-images in the enhanced system, we modified it by extracting a certain number of images from a video sequence. The pass-images were obtained by making the extracted images unclear. As only legitimate users were allowed to view the video sequence in their registration phase, only they could understand what the unclear pass-images meant. Thus, the unclear pass-images become easy for legitimate users to memorize. We verified the effectiveness of the enhanced system through comparative experiments.
{"title":"Improvement of User Authentication Using Schema of Visual Memory: Exploitation of \"Schema of Story\"","authors":"Takumi Yamamoto, Atsushi Harada, T. Isarida, M. Nishigaki","doi":"10.1109/AINA.2008.40","DOIUrl":"https://doi.org/10.1109/AINA.2008.40","url":null,"abstract":"A user authentication system using \"unclear images\" as pass-images has been proposed, in which only legitimate users can understand their meaning by viewing the original images corresponding to the unclear pass-images. These unclear images are meaningless to unauthorized users. Hence, it is difficult for attackers to memorize these unclear pass-images, even though they may have observed legitimate users' authentication trials. However, as long as the same pass-images are always used, it would not be completely impossible for unauthorized users to memorize unclear-images. Therefore, this paper discusses enhancement to the authentication system by permitting users to memorize a number of pass-images and using a different subset of pass-images at all authentication trials. To mitigate the burden imposed by memorizing additional pass-images in the enhanced system, we modified it by extracting a certain number of images from a video sequence. The pass-images were obtained by making the extracted images unclear. As only legitimate users were allowed to view the video sequence in their registration phase, only they could understand what the unclear pass-images meant. Thus, the unclear pass-images become easy for legitimate users to memorize. We verified the effectiveness of the enhanced system through comparative experiments.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"35 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":"114436248","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}
Song Xiao, Chengke Wu, Yunsong Li, Jianchao Du, C.-C. Jay Kuo
Scalable video representation of the state-of-art scalable extension of the H.264/MPEG-4 AVC (SVC) and its combined 3d scalability feature offer an excellent solution to flexible video multicast over IP network. In order to relieve the impact of the severe bandwidth fluctuations and packet loss to the reconstructed quality in heterogeneous networks like the internet, a GOP-adaptive layer-based priority ordering algorithm for SVC is proposed in this paper. The method ordered the SVC bit stream according to the rate distortion contribution of different layer to the whole performance within a GOP, which makes the transmission more efficient and robust under the same bandwidth condition. Simulation results of different sequences are given to demonstrate that the proposed algorithms offer better performance in video quality as compared the default SVC ordering method and the SNR-based ordering method.
{"title":"Priority Ordering Algorithm for Scalable Video Coding Transmission over Heterogeneous Network","authors":"Song Xiao, Chengke Wu, Yunsong Li, Jianchao Du, C.-C. Jay Kuo","doi":"10.1109/AINA.2008.149","DOIUrl":"https://doi.org/10.1109/AINA.2008.149","url":null,"abstract":"Scalable video representation of the state-of-art scalable extension of the H.264/MPEG-4 AVC (SVC) and its combined 3d scalability feature offer an excellent solution to flexible video multicast over IP network. In order to relieve the impact of the severe bandwidth fluctuations and packet loss to the reconstructed quality in heterogeneous networks like the internet, a GOP-adaptive layer-based priority ordering algorithm for SVC is proposed in this paper. The method ordered the SVC bit stream according to the rate distortion contribution of different layer to the whole performance within a GOP, which makes the transmission more efficient and robust under the same bandwidth condition. Simulation results of different sequences are given to demonstrate that the proposed algorithms offer better performance in video quality as compared the default SVC ordering method and the SNR-based ordering method.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"23 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":"129115333","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}
Z. Maamar, Philippe Thiran, N. Narendra, S. Subramanian
This paper presents a Web services-based framework for modeling business-to-business (B2B) applications. This framework consists of three levels namely strategic, application, and resource, with focus here on the first two levels. The strategic level is about the common vision that independent businesses define as part of their decision to join forces. And the application level is about the business processes that get virtually integrated as result of this common vision. To implement the strategic and application levels, this paper leverages from our earlier two projects referred to as context-aware Web services and coordination model for Web services, respectively. Hence in line with these projects we model B2B applications as context-aware Web services. Context-based modeling is used for modeling and tracking interactions among B2B applications, with emphasis on how conflicts among the applications are identified and managed. The application of our framework to a B2B scenario relies on a case study from the purchasing domain. We also present a prototype implementation of our framework on this domain.
{"title":"A Framework for Modeling B2B Applications","authors":"Z. Maamar, Philippe Thiran, N. Narendra, S. Subramanian","doi":"10.1109/AINA.2008.74","DOIUrl":"https://doi.org/10.1109/AINA.2008.74","url":null,"abstract":"This paper presents a Web services-based framework for modeling business-to-business (B2B) applications. This framework consists of three levels namely strategic, application, and resource, with focus here on the first two levels. The strategic level is about the common vision that independent businesses define as part of their decision to join forces. And the application level is about the business processes that get virtually integrated as result of this common vision. To implement the strategic and application levels, this paper leverages from our earlier two projects referred to as context-aware Web services and coordination model for Web services, respectively. Hence in line with these projects we model B2B applications as context-aware Web services. Context-based modeling is used for modeling and tracking interactions among B2B applications, with emphasis on how conflicts among the applications are identified and managed. The application of our framework to a B2B scenario relies on a case study from the purchasing domain. We also present a prototype implementation of our framework on this domain.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"23 2 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":"116312877","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
扫码关注我们
求助内容：
应助结果提醒方式：