In designated verifier signature, only the designated verifier can confirm the validity of a signature and it is applied widely in many environments such as electronic voting. However, most of designated verifier signature schemes cannot distinguish the real signer when the signer and the designated verifier arises a dispute on a signature. In other words, most of existing designated verifier signature schemes have not the undeniable property, namely the signer can deny a generated signature or the designated verifier can deny a simulating signature. In this paper, two designated verifier signature schemes with undeniable property are proposed. The first designated verifier signature scheme with undeniable property is called DVSSWUP-1 and another is called DVSSWUP-2. The both schemes satisfy the unforgeability and non-transferability. What's more, when the signer or the designated verifier denies the signature, a third party can distinguish the signature. Therefore, the proposed two designated verifier signature schemes not only protect the privacy of the signer but also keep the undeniable property of the traditional digital signature schemes.
{"title":"A designated verifier signature scheme with undeniable property in the random oracle","authors":"Xiaoming Hu, Xiaojun Zhang, Chuang Ma, Huajie Xu, Jian Wang, Wenan Tan","doi":"10.1109/ICSESS.2016.7883225","DOIUrl":"https://doi.org/10.1109/ICSESS.2016.7883225","url":null,"abstract":"In designated verifier signature, only the designated verifier can confirm the validity of a signature and it is applied widely in many environments such as electronic voting. However, most of designated verifier signature schemes cannot distinguish the real signer when the signer and the designated verifier arises a dispute on a signature. In other words, most of existing designated verifier signature schemes have not the undeniable property, namely the signer can deny a generated signature or the designated verifier can deny a simulating signature. In this paper, two designated verifier signature schemes with undeniable property are proposed. The first designated verifier signature scheme with undeniable property is called DVSSWUP-1 and another is called DVSSWUP-2. The both schemes satisfy the unforgeability and non-transferability. What's more, when the signer or the designated verifier denies the signature, a third party can distinguish the signature. Therefore, the proposed two designated verifier signature schemes not only protect the privacy of the signer but also keep the undeniable property of the traditional digital signature schemes.","PeriodicalId":175933,"journal":{"name":"2016 7th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124773665","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 : 2016-08-01DOI: 10.1109/ICSESS.2016.7883121
Feifei Guo, Yu Liang
Big data technology plays a role in promoting the development of Internet video, and data has become an important carrier for users and network video platform to dig the effect of video communication, guide the video production, and master the user's behavior habits. This system establishes the conceptual process from data acquisition, data processing, data visualization. This article makes analysis and research from the following aspects: the URL extraction module, data acquisition module, data processing module, data visualization module and other functions. For the front page, the system adopts HTML+CSS+JavaScript, for data acquisition core module, the system uses DOM to operate the HTML page node to complete data crawling, and uses MVC architecture of CodeIgniter combined with Ajax technology to achieve the separation between the logical layer data acquisition program and application layer access page . For data visualization, Highcharts is used to display the data so that the data has a better interactivity and presentation capabilities.
{"title":"Design and implementation of the network video data acquisition system","authors":"Feifei Guo, Yu Liang","doi":"10.1109/ICSESS.2016.7883121","DOIUrl":"https://doi.org/10.1109/ICSESS.2016.7883121","url":null,"abstract":"Big data technology plays a role in promoting the development of Internet video, and data has become an important carrier for users and network video platform to dig the effect of video communication, guide the video production, and master the user's behavior habits. This system establishes the conceptual process from data acquisition, data processing, data visualization. This article makes analysis and research from the following aspects: the URL extraction module, data acquisition module, data processing module, data visualization module and other functions. For the front page, the system adopts HTML+CSS+JavaScript, for data acquisition core module, the system uses DOM to operate the HTML page node to complete data crawling, and uses MVC architecture of CodeIgniter combined with Ajax technology to achieve the separation between the logical layer data acquisition program and application layer access page . For data visualization, Highcharts is used to display the data so that the data has a better interactivity and presentation capabilities.","PeriodicalId":175933,"journal":{"name":"2016 7th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129462608","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 : 2016-08-01DOI: 10.1109/ICSESS.2016.7883069
Ying Li, Yuling Lu
The existed cloud data models can not well meet the management requirements of structured data including a great deal of relational data, therefore a two-layer cloud data model consisting of a presentation layer and a storage layer is proposed. In the presentation layer, the conception of composite class and composite object are defined to represent the structure and the data of structured data respectively. In the storage layer, a composite class in the presentation layer is transformed into a 3-tuple which preserves data structure in mappings between composite attributes and their sub-attributes by using a rule set; and a composite object in the presentation layer is transformed into another 3-tuple which preserves a structured data set in simple objects without embed objects by using a CAO (Component-Attribute-Object) set in which each element mainly consists of a simple object and the identification of its father object. In order to store data in key-value model, a method to convert a CAO to a pair of key-value is proposed. Furthermore, two algorithms were proposed to convert data between the representation layer and the storage layer. Data experiment shows the two conversion algorithms are effective. The proposed model is fit for the management requirements of structured data in the cloud because composite object can represent structured data and avoid join operation of relation data and CAO can be stored in key-value model.
{"title":"A two-layer cloud database model and its bidirectional conversion algorithms","authors":"Ying Li, Yuling Lu","doi":"10.1109/ICSESS.2016.7883069","DOIUrl":"https://doi.org/10.1109/ICSESS.2016.7883069","url":null,"abstract":"The existed cloud data models can not well meet the management requirements of structured data including a great deal of relational data, therefore a two-layer cloud data model consisting of a presentation layer and a storage layer is proposed. In the presentation layer, the conception of composite class and composite object are defined to represent the structure and the data of structured data respectively. In the storage layer, a composite class in the presentation layer is transformed into a 3-tuple which preserves data structure in mappings between composite attributes and their sub-attributes by using a rule set; and a composite object in the presentation layer is transformed into another 3-tuple which preserves a structured data set in simple objects without embed objects by using a CAO (Component-Attribute-Object) set in which each element mainly consists of a simple object and the identification of its father object. In order to store data in key-value model, a method to convert a CAO to a pair of key-value is proposed. Furthermore, two algorithms were proposed to convert data between the representation layer and the storage layer. Data experiment shows the two conversion algorithms are effective. The proposed model is fit for the management requirements of structured data in the cloud because composite object can represent structured data and avoid join operation of relation data and CAO can be stored in key-value model.","PeriodicalId":175933,"journal":{"name":"2016 7th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"135 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114698221","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 rapid expansion of user data and geographic location data in the location-based social networking applications, it is become increasingly difficult for users to quickly and accurately find the information they need. The characteristics of the traditional friend recommendation algorithm are analyzed and discussed in this paper. In order to improve the performance of friend recommendation, we proposed a linear framework combines the three traditional friend recommendation algorithms, which are recommendation based on the proportion of common friends, recommendation based on user-based collaborative filtering and recommendation based on normal check-in location, respectively. Real dataset are used to verify our new method. The experimental results show that compared with the existing algorithms, our improved adaptive recommendation algorithm has better result, which can effectively improve the accuracy and recall rate of friend recommendation.
{"title":"Friend recommendation algorithm based on location-based social networks","authors":"Kunhui Lin, Yating Chen, Xiang Li, Qingfeng Wu, Zhentuan Xu","doi":"10.1109/ICSESS.2016.7883056","DOIUrl":"https://doi.org/10.1109/ICSESS.2016.7883056","url":null,"abstract":"The rapid expansion of user data and geographic location data in the location-based social networking applications, it is become increasingly difficult for users to quickly and accurately find the information they need. The characteristics of the traditional friend recommendation algorithm are analyzed and discussed in this paper. In order to improve the performance of friend recommendation, we proposed a linear framework combines the three traditional friend recommendation algorithms, which are recommendation based on the proportion of common friends, recommendation based on user-based collaborative filtering and recommendation based on normal check-in location, respectively. Real dataset are used to verify our new method. The experimental results show that compared with the existing algorithms, our improved adaptive recommendation algorithm has better result, which can effectively improve the accuracy and recall rate of friend recommendation.","PeriodicalId":175933,"journal":{"name":"2016 7th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127888099","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 : 2016-08-01DOI: 10.1109/ICSESS.2016.7883103
Yuli Wang, Jiayin Tian, Cheng Yang, Yaping Zhu
Big data publishing anonymity technology is the main way to achieve privacy protection, it is a research hotspot of data publishing privacy protection. Applying anonymity protection to data is an effective way to protect the privacy of data subject in the process of micro data publishing. This paper analyzes the data publishing privacy protection technology in the anonymous models and main technologies, induces and summarizes the advantages and disadvantages of the anonymization algorithms and the existing problems. Finally, the development direction of privacy protection anonymity technology is prospected.
{"title":"Research on anonymous protection technology for big data publishing","authors":"Yuli Wang, Jiayin Tian, Cheng Yang, Yaping Zhu","doi":"10.1109/ICSESS.2016.7883103","DOIUrl":"https://doi.org/10.1109/ICSESS.2016.7883103","url":null,"abstract":"Big data publishing anonymity technology is the main way to achieve privacy protection, it is a research hotspot of data publishing privacy protection. Applying anonymity protection to data is an effective way to protect the privacy of data subject in the process of micro data publishing. This paper analyzes the data publishing privacy protection technology in the anonymous models and main technologies, induces and summarizes the advantages and disadvantages of the anonymization algorithms and the existing problems. Finally, the development direction of privacy protection anonymity technology is prospected.","PeriodicalId":175933,"journal":{"name":"2016 7th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130169609","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 : 2016-08-01DOI: 10.1109/ICSESS.2016.7883052
Li Ma, Yunxiang Ling, Yaohong Zhang
This paper establish the model of air defense and antimissile in uncertain environment based on fuzzy UML method containing fuzzy use case diagram, fuzzy class diagram and fuzzy activity diagram, which aims at the impact of uncertain environment factors on the system. Then model quantifies the uncertainty factors, and uncertain environment experimental verification is carried out for air defense and antimissile model. Finally, this paper explores the proper transforming rules, and verifies the possibility of this kind of method by calculation and analysis.
{"title":"Modeling of air defense and antimissile system based on FUML/FPN","authors":"Li Ma, Yunxiang Ling, Yaohong Zhang","doi":"10.1109/ICSESS.2016.7883052","DOIUrl":"https://doi.org/10.1109/ICSESS.2016.7883052","url":null,"abstract":"This paper establish the model of air defense and antimissile in uncertain environment based on fuzzy UML method containing fuzzy use case diagram, fuzzy class diagram and fuzzy activity diagram, which aims at the impact of uncertain environment factors on the system. Then model quantifies the uncertainty factors, and uncertain environment experimental verification is carried out for air defense and antimissile model. Finally, this paper explores the proper transforming rules, and verifies the possibility of this kind of method by calculation and analysis.","PeriodicalId":175933,"journal":{"name":"2016 7th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127432208","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 : 2016-08-01DOI: 10.1109/ICSESS.2016.7883138
Yongxin Feng, Qin Li
Aiming at the issues of the traditional centralized UDDI model, the distributed UDDI model was proposed. The model adopted the latest version specification of UDDI v3 and the management technology of key space, avoiding uneven service accessing, low processing efficiency and prone to single point of failure. Moreover, service publication and service discovery were elevated, and the good practicability of distributed UDDI system can be verified.
{"title":"The distributed UDDI system model based on service oriented architecture","authors":"Yongxin Feng, Qin Li","doi":"10.1109/ICSESS.2016.7883138","DOIUrl":"https://doi.org/10.1109/ICSESS.2016.7883138","url":null,"abstract":"Aiming at the issues of the traditional centralized UDDI model, the distributed UDDI model was proposed. The model adopted the latest version specification of UDDI v3 and the management technology of key space, avoiding uneven service accessing, low processing efficiency and prone to single point of failure. Moreover, service publication and service discovery were elevated, and the good practicability of distributed UDDI system can be verified.","PeriodicalId":175933,"journal":{"name":"2016 7th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"171 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124400293","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 : 2016-08-01DOI: 10.1109/ICSESS.2016.7883064
Guimin Huang, Zhi Zheng, Ya Zhou
In this paper, we design a high-performance data communication message-oriented protocol (ECP), which is based on asynchronous non-blocking I/O model, used reactor design mode, introduced pipeline, and is on top of TCP without modifying the operating system underlying API. It is very effective in the environment that has a great demand of network communication, especially in the case of large-scale data communication and high concurrent requests.
{"title":"A high performance asynchronous non-blocking data communication protocol","authors":"Guimin Huang, Zhi Zheng, Ya Zhou","doi":"10.1109/ICSESS.2016.7883064","DOIUrl":"https://doi.org/10.1109/ICSESS.2016.7883064","url":null,"abstract":"In this paper, we design a high-performance data communication message-oriented protocol (ECP), which is based on asynchronous non-blocking I/O model, used reactor design mode, introduced pipeline, and is on top of TCP without modifying the operating system underlying API. It is very effective in the environment that has a great demand of network communication, especially in the case of large-scale data communication and high concurrent requests.","PeriodicalId":175933,"journal":{"name":"2016 7th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124519100","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 : 2016-08-01DOI: 10.1109/ICSESS.2016.7883172
Sujie Zhong, Sheng Lin, Guangping Xu, Kai Shi
K-Means algorithm is one of the most popular clustering analysis algorithm. Since the algorithm can be easily understood and implemented, and its execution is more efficient than common clustering algorithm, it has been used widely. At the same time, with the increasing size of the data sets processed, CPU-based serial K-Means implementation has been unable to meet the people's needof data processing. Parallel computing is considered well with the large data sets tasks. GPU-based concurrent computation can accelerate common tasks, and especially for accelerating the compute-intensive tasks. CUDA (Compute Unified Device Architecture) is one of the methods that achieving the GPU-based concurrent computation. In the paper, the author hope to achieve a K-Means algorithm implementation can handle larger data sets via CUDA and the algorithm can be used on a common computer with NVIDIA graphics cards.
{"title":"The expansibility research of K-Means algorithm under the GPU","authors":"Sujie Zhong, Sheng Lin, Guangping Xu, Kai Shi","doi":"10.1109/ICSESS.2016.7883172","DOIUrl":"https://doi.org/10.1109/ICSESS.2016.7883172","url":null,"abstract":"K-Means algorithm is one of the most popular clustering analysis algorithm. Since the algorithm can be easily understood and implemented, and its execution is more efficient than common clustering algorithm, it has been used widely. At the same time, with the increasing size of the data sets processed, CPU-based serial K-Means implementation has been unable to meet the people's needof data processing. Parallel computing is considered well with the large data sets tasks. GPU-based concurrent computation can accelerate common tasks, and especially for accelerating the compute-intensive tasks. CUDA (Compute Unified Device Architecture) is one of the methods that achieving the GPU-based concurrent computation. In the paper, the author hope to achieve a K-Means algorithm implementation can handle larger data sets via CUDA and the algorithm can be used on a common computer with NVIDIA graphics cards.","PeriodicalId":175933,"journal":{"name":"2016 7th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114716348","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 : 2016-08-01DOI: 10.1109/ICSESS.2016.7883051
Lihong Dong, Weina Wang, Xiangyang She
The existing opinion mining method based on adverbs about Chinese comments has lower precision rate and recall rate. For this problem, this paper redefined the narrow opinion word, and proposed an improved algorithm of Chinese comments opinion mining based on adverbs: In the extraction process of the feature words and opinion words based on adverbs increased conjunctions and negative words judgment; Then using the Extended Version of Synonymy Thesaurus of information retrieval lab in university of Harbin technology to merge synonyms. And obtaining the final feature words and opinion words. Experiments proved the method in this paper is better than the existing method. In opinion words extraction work the recall rate increased by 10.45%, the precision rate increased by 5.11%, the value of F increased by 0.08. In feature words extraction work the recall rate increased by 6.61%, the precision rate increased by 1.73%, the value of F increased by 0.04; In synonyms merger work the recall rate increased by 19.08%, the precision rate increased by 21.96%, the value of F increased by 0.09.
{"title":"An improved algorithm of Chinese comments opinion mining based on adverbs","authors":"Lihong Dong, Weina Wang, Xiangyang She","doi":"10.1109/ICSESS.2016.7883051","DOIUrl":"https://doi.org/10.1109/ICSESS.2016.7883051","url":null,"abstract":"The existing opinion mining method based on adverbs about Chinese comments has lower precision rate and recall rate. For this problem, this paper redefined the narrow opinion word, and proposed an improved algorithm of Chinese comments opinion mining based on adverbs: In the extraction process of the feature words and opinion words based on adverbs increased conjunctions and negative words judgment; Then using the Extended Version of Synonymy Thesaurus of information retrieval lab in university of Harbin technology to merge synonyms. And obtaining the final feature words and opinion words. Experiments proved the method in this paper is better than the existing method. In opinion words extraction work the recall rate increased by 10.45%, the precision rate increased by 5.11%, the value of F increased by 0.08. In feature words extraction work the recall rate increased by 6.61%, the precision rate increased by 1.73%, the value of F increased by 0.04; In synonyms merger work the recall rate increased by 19.08%, the precision rate increased by 21.96%, the value of F increased by 0.09.","PeriodicalId":175933,"journal":{"name":"2016 7th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115055271","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
扫码关注我们
求助内容：
应助结果提醒方式：