The context-aware calculation method is applied to the model of recommendation system in this paper. Based on context of scenario analysis and inference, we can implement recommendation for user group. This paper makes use of the context of scenarios aware technology, which fuses multi-source data from smart phones, sensor networks and social networks for the scenario modeling and inference, and then formats the context clues to build the perceptual model of the context scenarios to predict the behavior patterns of the user group for the group recommendation, which meet the needs of the user group. We have analyzed the recommendation process and performed a subjective test to show the usefulness of the proposed system.
{"title":"The Contextual Group Recommendation","authors":"Jing Wang, Hui Li, H Zhao","doi":"10.1109/INCoS.2013.27","DOIUrl":"https://doi.org/10.1109/INCoS.2013.27","url":null,"abstract":"The context-aware calculation method is applied to the model of recommendation system in this paper. Based on context of scenario analysis and inference, we can implement recommendation for user group. This paper makes use of the context of scenarios aware technology, which fuses multi-source data from smart phones, sensor networks and social networks for the scenario modeling and inference, and then formats the context clues to build the perceptual model of the context scenarios to predict the behavior patterns of the user group for the group recommendation, which meet the needs of the user group. We have analyzed the recommendation process and performed a subjective test to show the usefulness of the proposed system.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134283026","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The basic algorithm used in pairing computation was first described by Miller and this algorithm can be named double-and-add and line-and-tangle algorithm. We will describe, in detail sufficient, a variant of Miller's which will replace double-and-add method with Montgomery ladder method. In order to achieve better efficiency, parallel method will be used. We observe that, in many practical settings, affine coordinate are faster than projective coordinate in Miller algorithm. Therefore, we mainly discuss situations in affine coordinate. In affine coordinate, the cost comparison of our algorithm with previously basic algorithms shows an efficiency improvement of around 30% in general elliptic curves.
结对计算中使用的基本算法是由Miller首先描述的，该算法可命名为double and add和line and tangle算法。我们将充分详细地描述米勒的一种变体，它将用蒙哥马利阶梯法取代双加法。为了获得更好的效率，将采用并行方法。我们观察到，在许多实际设置中，仿射坐标比射影坐标在Miller算法中更快。因此，我们主要讨论仿射坐标下的情形。在仿射坐标下，我们的算法与以前的基本算法的成本比较表明，在一般椭圆曲线上，我们的算法的效率提高了30%左右。
{"title":"Efficient Implementation of Tate Pairing with Montgomery Ladder Method","authors":"Yulong Tian, Dawu Gu, Haihua Gu","doi":"10.1109/INCoS.2013.75","DOIUrl":"https://doi.org/10.1109/INCoS.2013.75","url":null,"abstract":"The basic algorithm used in pairing computation was first described by Miller and this algorithm can be named double-and-add and line-and-tangle algorithm. We will describe, in detail sufficient, a variant of Miller's which will replace double-and-add method with Montgomery ladder method. In order to achieve better efficiency, parallel method will be used. We observe that, in many practical settings, affine coordinate are faster than projective coordinate in Miller algorithm. Therefore, we mainly discuss situations in affine coordinate. In affine coordinate, the cost comparison of our algorithm with previously basic algorithms shows an efficiency improvement of around 30% in general elliptic curves.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132743773","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}
Ximeng Liu, Tao Zhang, Jianfeng Ma, Hui Zhu, Feng Cai
Attribute based signature scheme is an important cryptographic primitive providing a powerful way for user to control their privacy. In wireless environment, the capacity of wireless channel is valuable resources which is limited. More information can be transmitted through the wireless channel when the cost of using signature to verify the message become less. In order to reduce the bandwidth needed to transmit attribute based signatures and keep signer's privacy, attribute based multi-signature scheme(ABMS) was proposed in this paper. Moveover, We formalized and constructed the ABMS. Our scheme is existentially unforgeable against chosen message attack and on Computational Diffie-Hellman(CDH) problem in the standard model. Analysis shows that our ABMS is more appropriate for wireless network to guarantee integrity of the data.
{"title":"Efficient Data Integrity Verification Using Attribute Based Multi-signature Scheme in Wireless Network","authors":"Ximeng Liu, Tao Zhang, Jianfeng Ma, Hui Zhu, Feng Cai","doi":"10.1109/INCoS.2013.34","DOIUrl":"https://doi.org/10.1109/INCoS.2013.34","url":null,"abstract":"Attribute based signature scheme is an important cryptographic primitive providing a powerful way for user to control their privacy. In wireless environment, the capacity of wireless channel is valuable resources which is limited. More information can be transmitted through the wireless channel when the cost of using signature to verify the message become less. In order to reduce the bandwidth needed to transmit attribute based signatures and keep signer's privacy, attribute based multi-signature scheme(ABMS) was proposed in this paper. Moveover, We formalized and constructed the ABMS. Our scheme is existentially unforgeable against chosen message attack and on Computational Diffie-Hellman(CDH) problem in the standard model. Analysis shows that our ABMS is more appropriate for wireless network to guarantee integrity of the data.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130789534","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}
Image segmentation is a fundamental task in automatic image analysis. However, there is still no generally accepted effectiveness measure which is suitable for evaluating the segmentation quality in every application. In this paper, we propose an evaluation framework which benefits from multiple stand-alone measures. To this end, different segmentation evaluation measures are chosen to evaluate segmentation separately, and the results are effectively combined using machine learning methods. We train and implement this framework in the segmentation dataset which contains images of different contents with segmentation ground truth produced by human. In addition, we provide human evaluation of image segmentation pairs to benchmark the evaluation results of the measures. Experimental results show a better performance than the stand-alone methods.
{"title":"A Learning-Based Framework for Image Segmentation Evaluation","authors":"Jian Lin, Bo Peng, Tianrui Li, Qin Chen","doi":"10.1109/INCoS.2013.133","DOIUrl":"https://doi.org/10.1109/INCoS.2013.133","url":null,"abstract":"Image segmentation is a fundamental task in automatic image analysis. However, there is still no generally accepted effectiveness measure which is suitable for evaluating the segmentation quality in every application. In this paper, we propose an evaluation framework which benefits from multiple stand-alone measures. To this end, different segmentation evaluation measures are chosen to evaluate segmentation separately, and the results are effectively combined using machine learning methods. We train and implement this framework in the segmentation dataset which contains images of different contents with segmentation ground truth produced by human. In addition, we provide human evaluation of image segmentation pairs to benchmark the evaluation results of the measures. Experimental results show a better performance than the stand-alone methods.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131006330","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}
Wireless network has significantly affected human life. MAC protocols which already existed mostly transmit data without priority so that emergency event data cannot be sent quickly to destination nodes. In this paper, a new protocol called priority-and-activity-based QoS MAC (PAQMAC) protocol is proposed, in which not only the priority of data in transmission is considered, but also the active time is dynamical adjusted by recording the activity degree in a duty cycle. With the priority classified, it provides enough time to deal with emergency event, thus the security and management of network are also improved. Simulation results show that PAQMAC protocol can reduce transmission delay and decrease energy consumption of network.
无线网络已经极大地影响了人类的生活。现有的MAC协议在传输数据时大多没有优先级，导致紧急事件数据无法快速发送到目的节点。本文提出了一种新的基于优先级和活动的QoS MAC (PAQMAC)协议，该协议不仅考虑传输数据的优先级，而且通过记录一个占空比内的活动程度来动态调整活动时间。通过对优先级进行分类，为应急事件的处理提供了充足的时间，从而提高了网络的安全性和管理性。仿真结果表明，PAQMAC协议可以减少传输延迟，降低网络能耗。
{"title":"Improved Efficient Priority-and-Activity-Based QoS MAC Protocol","authors":"Xiaoyu Li, Nan Chen, Changhua Zhu, Changxing Pei","doi":"10.1109/INCoS.2013.56","DOIUrl":"https://doi.org/10.1109/INCoS.2013.56","url":null,"abstract":"Wireless network has significantly affected human life. MAC protocols which already existed mostly transmit data without priority so that emergency event data cannot be sent quickly to destination nodes. In this paper, a new protocol called priority-and-activity-based QoS MAC (PAQMAC) protocol is proposed, in which not only the priority of data in transmission is considered, but also the active time is dynamical adjusted by recording the activity degree in a duty cycle. With the priority classified, it provides enough time to deal with emergency event, thus the security and management of network are also improved. Simulation results show that PAQMAC protocol can reduce transmission delay and decrease energy consumption of network.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"37 9","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114006484","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}
A certificateless strong designated verifier signature (CL-SDVS) may provide more convenient deployment than other SDVS schemes since user's public keys can be published freely and no key-escrow problem needed to be worried about. However, there are only several CL-SDVS schemes and their security is doubtable. This paper provides general CL-SDVS schemes and instances, and discusses their security briefly.
{"title":"General Certificateless Strong Designated Verifier Signature Schemes","authors":"Haibo Tian","doi":"10.1109/INCoS.2013.74","DOIUrl":"https://doi.org/10.1109/INCoS.2013.74","url":null,"abstract":"A certificateless strong designated verifier signature (CL-SDVS) may provide more convenient deployment than other SDVS schemes since user's public keys can be published freely and no key-escrow problem needed to be worried about. However, there are only several CL-SDVS schemes and their security is doubtable. This paper provides general CL-SDVS schemes and instances, and discusses their security briefly.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115140786","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}
We presented a pedestrian classification method based on improved support vector machine in order to solve non-rigid objects are difficult to identify in intelligent monitoring system. The video activity in the prospect is represented by a series of spatio-temporal interest point. Since human posture has the characteristics of uncertainty and illegibility, the clustering centers of each class are computed by fuzzy clustering technique. Then a full-SVM decision tree is constructed based on conventional decision tree. At last, the method is evaluated on the Weizmann action dataset and received comparative high correct recognition rate.
{"title":"Pedestrian Classification Based on Improved Support Vector Machines","authors":"Hongmin Xue, Zhijing Liu","doi":"10.1109/INCoS.2013.140","DOIUrl":"https://doi.org/10.1109/INCoS.2013.140","url":null,"abstract":"We presented a pedestrian classification method based on improved support vector machine in order to solve non-rigid objects are difficult to identify in intelligent monitoring system. The video activity in the prospect is represented by a series of spatio-temporal interest point. Since human posture has the characteristics of uncertainty and illegibility, the clustering centers of each class are computed by fuzzy clustering technique. Then a full-SVM decision tree is constructed based on conventional decision tree. At last, the method is evaluated on the Weizmann action dataset and received comparative high correct recognition rate.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115354570","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}
Vehicular ad hoc networks (VANET) are characterized by the frequent changes and constrained by pre-existing roads in network topology compared with mobile ad hoc network (MANET). Therefore, the method of geocasting routing can not be widely applied to VANET. This paper proposes a geocasting routing based target region for VANET (GRTR) to make match road topology in VANET. That is setting a target region in the intersections from source node to destination region and using the method of VD-GREEDY (Voronoi diagram-greedy) builds forward zones to transmit information between the target regions. The method of VD-GREEDY expands forward zone to ensure the existence of next-hop nodes and limits the numbers of next Chop nodes to lower overhead. At the same time, to lower overload, we use the way of opportunistic routing in the target region where we choose the best node to go on transmitting for next target region. The proposed method matches the road conditions and lowers the overload in VANET.
{"title":"GRTR: A Geocasting Routing Based Target Region for VANET","authors":"Xiaoqing Li, Wei-dong Sun, Xuejun Li, Jicheng Liu","doi":"10.1109/INCoS.2013.92","DOIUrl":"https://doi.org/10.1109/INCoS.2013.92","url":null,"abstract":"Vehicular ad hoc networks (VANET) are characterized by the frequent changes and constrained by pre-existing roads in network topology compared with mobile ad hoc network (MANET). Therefore, the method of geocasting routing can not be widely applied to VANET. This paper proposes a geocasting routing based target region for VANET (GRTR) to make match road topology in VANET. That is setting a target region in the intersections from source node to destination region and using the method of VD-GREEDY (Voronoi diagram-greedy) builds forward zones to transmit information between the target regions. The method of VD-GREEDY expands forward zone to ensure the existence of next-hop nodes and limits the numbers of next Chop nodes to lower overhead. At the same time, to lower overload, we use the way of opportunistic routing in the target region where we choose the best node to go on transmitting for next target region. The proposed method matches the road conditions and lowers the overload in VANET.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"408 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116227448","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}
Based on ternary method, we proposed a new scalar multiplication with high performance and security. Fast computation formulae of 3P ±Q is developed for ternary method, balanced ternary coding is used to improve the efficiency of scalar multiplication, signed ternary with lowest hamming weight is used to further improve the efficiency. For the elliptic curves in GF(3m), compared with Binary Scalar Multiplication, the efficiency of the new scalar multiplication is improved with the increase of the ratio of inversion and multiplication without pre-computations and other registers.
{"title":"Ternary Method in Elliptic Curve Scalar Multiplication","authors":"Ning Zhang, Xiaotong Fu","doi":"10.1109/INCoS.2013.93","DOIUrl":"https://doi.org/10.1109/INCoS.2013.93","url":null,"abstract":"Based on ternary method, we proposed a new scalar multiplication with high performance and security. Fast computation formulae of 3P ±Q is developed for ternary method, balanced ternary coding is used to improve the efficiency of scalar multiplication, signed ternary with lowest hamming weight is used to further improve the efficiency. For the elliptic curves in GF(3m), compared with Binary Scalar Multiplication, the efficiency of the new scalar multiplication is improved with the increase of the ratio of inversion and multiplication without pre-computations and other registers.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116250578","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}
Rapid penetration of cloud computing has resulted in increasingly large file transfers among distributed data centers, leading to increased transmission delays. We propose a multipath multicast (MPMC) file transfer scheme to reduce transmission delays of one-to-many file transfers. The proposed scheme aims to (i) fully utilize the possible network bandwidth by transmitting segments (chunks) of a file simultaneously on multiple paths and (ii) reduce the bandwidth required to deliver a file to multiple receivers by multicasting the segments. On the basis of the maxflow problem, the scheme performs file segmentation, construction of multiple multicast trees, and segment transfer scheduling using multiple multicasts. To demonstrate the feasibility of MPMC file transfer, we develop a prototype system of our proposal for MPMC file transfers on OpenFlow networks.
{"title":"Delivering a File by Multipath-Multicast on OpenFlow Networks","authors":"Akira Nagata, Yoshiaki Tsukiji, M. Tsuru","doi":"10.1109/INCoS.2013.160","DOIUrl":"https://doi.org/10.1109/INCoS.2013.160","url":null,"abstract":"Rapid penetration of cloud computing has resulted in increasingly large file transfers among distributed data centers, leading to increased transmission delays. We propose a multipath multicast (MPMC) file transfer scheme to reduce transmission delays of one-to-many file transfers. The proposed scheme aims to (i) fully utilize the possible network bandwidth by transmitting segments (chunks) of a file simultaneously on multiple paths and (ii) reduce the bandwidth required to deliver a file to multiple receivers by multicasting the segments. On the basis of the maxflow problem, the scheme performs file segmentation, construction of multiple multicast trees, and segment transfer scheduling using multiple multicasts. To demonstrate the feasibility of MPMC file transfer, we develop a prototype system of our proposal for MPMC file transfers on OpenFlow networks.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121403898","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
扫码关注我们
求助内容：
应助结果提醒方式：