Pub Date : 2014-06-27DOI: 10.1109/ICSESS.2014.6933769
Sui Bo, Li Lin, Dan Feng
The combination of different networks adopting various wireless access technologies can improve the wireless transmission performance. Vertical handoff is the basis of mutual integration of heterogeneous wireless networks, and handoff decision is a critical part in the vertical handoff process, which determines handoff performance. Multi-attribute vertical handoff algorithm based on node mobility is proposed in this paper, and the mobility model is built based on node mobility characteristics. The current access point pre-switch to the adjacent access points, and when the signal coverage rate of the access point is below a pre-set threshold, handoff is triggered. The experimental results show that: compared with the traditional multi-attribute decision making, the proposed algorithm has obvious advantages in handoff performance.
{"title":"The multi-attribute vertical handoff algorithm based on node mobility","authors":"Sui Bo, Li Lin, Dan Feng","doi":"10.1109/ICSESS.2014.6933769","DOIUrl":"https://doi.org/10.1109/ICSESS.2014.6933769","url":null,"abstract":"The combination of different networks adopting various wireless access technologies can improve the wireless transmission performance. Vertical handoff is the basis of mutual integration of heterogeneous wireless networks, and handoff decision is a critical part in the vertical handoff process, which determines handoff performance. Multi-attribute vertical handoff algorithm based on node mobility is proposed in this paper, and the mobility model is built based on node mobility characteristics. The current access point pre-switch to the adjacent access points, and when the signal coverage rate of the access point is below a pre-set threshold, handoff is triggered. The experimental results show that: compared with the traditional multi-attribute decision making, the proposed algorithm has obvious advantages in handoff performance.","PeriodicalId":6473,"journal":{"name":"2014 IEEE 5th International Conference on Software Engineering and Service Science","volume":"68 1","pages":"1146-1149"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87803299","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 : 2014-06-27DOI: 10.1109/ICSESS.2014.6933701
Weiling Chen, G. Wang, Fengxia Yin
CSLN is a citation semantic link network with semantic representation and reasoning abilities. The documents in citation semantic link network (CSLN) is a set of many objects. The similarity calculation of a single object can't accurately calculate the document similarity of citation semantic link network. This paper analyzes in depth the characteristics of each part of the document, and puts forward the document similarity calculation model of the citation semantic link network. This model not only improves the accuracy of document similarity calculation of the citation semantic link network, but also lays a foundation for the community discovery of citation semantic link network and the hot prediction of research.
{"title":"Document similarity calculation model of CSLN","authors":"Weiling Chen, G. Wang, Fengxia Yin","doi":"10.1109/ICSESS.2014.6933701","DOIUrl":"https://doi.org/10.1109/ICSESS.2014.6933701","url":null,"abstract":"CSLN is a citation semantic link network with semantic representation and reasoning abilities. The documents in citation semantic link network (CSLN) is a set of many objects. The similarity calculation of a single object can't accurately calculate the document similarity of citation semantic link network. This paper analyzes in depth the characteristics of each part of the document, and puts forward the document similarity calculation model of the citation semantic link network. This model not only improves the accuracy of document similarity calculation of the citation semantic link network, but also lays a foundation for the community discovery of citation semantic link network and the hot prediction of research.","PeriodicalId":6473,"journal":{"name":"2014 IEEE 5th International Conference on Software Engineering and Service Science","volume":"136 1","pages":"859-862"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86889972","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 : 2014-06-27DOI: 10.1109/ICSESS.2014.6933733
X. Zou, Na Li, Nawei Ji
In this paper, we present a robust watermarking algorithm for digital image using SIFT (Scale-invariant feature transform) feature points and realizes the blind detection. The algorithm uses SIFT feature points on the host image to decide the embedding location and capacity, and adjusts the size of the binary watermark with Neighbor interpolation, and embeds the watermark into DCT low-frequency coefficients of some qualified sub-blocks for the host image. The algorithm has the following characteristics: (1) the watermark is embedded in the DCT coefficient based on scale-invariant feature points, which can effectively resist common attacks, such as Gaussian noise-adding, salt and pepper noise-adding, cropping, Wiener filtering; (2) the watermarking detection does not require original digital image. The experiments show that the algorithm has good invisibility and strong robustness.
{"title":"Robust watermarking algorithm for digital image based on SIFT feature points","authors":"X. Zou, Na Li, Nawei Ji","doi":"10.1109/ICSESS.2014.6933733","DOIUrl":"https://doi.org/10.1109/ICSESS.2014.6933733","url":null,"abstract":"In this paper, we present a robust watermarking algorithm for digital image using SIFT (Scale-invariant feature transform) feature points and realizes the blind detection. The algorithm uses SIFT feature points on the host image to decide the embedding location and capacity, and adjusts the size of the binary watermark with Neighbor interpolation, and embeds the watermark into DCT low-frequency coefficients of some qualified sub-blocks for the host image. The algorithm has the following characteristics: (1) the watermark is embedded in the DCT coefficient based on scale-invariant feature points, which can effectively resist common attacks, such as Gaussian noise-adding, salt and pepper noise-adding, cropping, Wiener filtering; (2) the watermarking detection does not require original digital image. The experiments show that the algorithm has good invisibility and strong robustness.","PeriodicalId":6473,"journal":{"name":"2014 IEEE 5th International Conference on Software Engineering and Service Science","volume":"14 1","pages":"996-1000"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88228279","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 : 2014-06-27DOI: 10.1109/ICSESS.2014.6933514
Ali Tizkar Sadabadi, Nazri Kama
Decision making for software project management encompasses a critical role for effective management. Decisions stem from constraints considered over definition of a project. Decision making of this practice considered with many challenges ranged based on intangible nature of software projects to the deficiency of strategy-model employed. In this paper a conceptual multi-method simulation based framework will be introduced in a modality to cover multiple levels of the decision structure over software project management process. The methods used are integrated towards a multi-method simulation model. Each of These methods exclusively realizes distinct aspect of software project management. The framework evolves the manner of decision making by a paradigm which establishes the foundation for a strategic level understanding and tactical decision support for practitioners. At the results section an optimal policy for the framework will be presented.
{"title":"Generating policy for software project management decision support paradigm","authors":"Ali Tizkar Sadabadi, Nazri Kama","doi":"10.1109/ICSESS.2014.6933514","DOIUrl":"https://doi.org/10.1109/ICSESS.2014.6933514","url":null,"abstract":"Decision making for software project management encompasses a critical role for effective management. Decisions stem from constraints considered over definition of a project. Decision making of this practice considered with many challenges ranged based on intangible nature of software projects to the deficiency of strategy-model employed. In this paper a conceptual multi-method simulation based framework will be introduced in a modality to cover multiple levels of the decision structure over software project management process. The methods used are integrated towards a multi-method simulation model. Each of These methods exclusively realizes distinct aspect of software project management. The framework evolves the manner of decision making by a paradigm which establishes the foundation for a strategic level understanding and tactical decision support for practitioners. At the results section an optimal policy for the framework will be presented.","PeriodicalId":6473,"journal":{"name":"2014 IEEE 5th International Conference on Software Engineering and Service Science","volume":"1 1","pages":"58-63"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89162537","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 : 2014-06-27DOI: 10.1109/ICSESS.2014.6933695
Guangyi Zhang, Fangzhen Li
The intelligent transportation system has demonstrated its strong advantages in solving the urban transport problem. One of its important roles is able to reflect the traffic conditions timely through the floating car. The key problem is to find out the candidate road sections from the vast road network quickly. Then we make the floating car match to the corresponding road by the map-matching algorithm. So we can get the real location of the floating car on the map. Every floating car needs to select candidate road sections from the whole road network, so the computing time is an important factor in affecting the real-time performance of the whole system. The commonly used method is to build an ellipse according to the probability criterion. It needs to determine the size of the ellipse, which is based on the statistic theory. It also needs to find these road sections which are in the ellipse from the whole road network. The whole process is complicated and time-consuming. Therefore, this paper proposes the k-nearest neighbors algorithm based on KD tree to get the candidate road sections.
{"title":"Application of the KNN algorithm based on KD tree in intelligent transportation system","authors":"Guangyi Zhang, Fangzhen Li","doi":"10.1109/ICSESS.2014.6933695","DOIUrl":"https://doi.org/10.1109/ICSESS.2014.6933695","url":null,"abstract":"The intelligent transportation system has demonstrated its strong advantages in solving the urban transport problem. One of its important roles is able to reflect the traffic conditions timely through the floating car. The key problem is to find out the candidate road sections from the vast road network quickly. Then we make the floating car match to the corresponding road by the map-matching algorithm. So we can get the real location of the floating car on the map. Every floating car needs to select candidate road sections from the whole road network, so the computing time is an important factor in affecting the real-time performance of the whole system. The commonly used method is to build an ellipse according to the probability criterion. It needs to determine the size of the ellipse, which is based on the statistic theory. It also needs to find these road sections which are in the ellipse from the whole road network. The whole process is complicated and time-consuming. Therefore, this paper proposes the k-nearest neighbors algorithm based on KD tree to get the candidate road sections.","PeriodicalId":6473,"journal":{"name":"2014 IEEE 5th International Conference on Software Engineering and Service Science","volume":"1 1","pages":"832-835"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83063759","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 : 2014-06-27DOI: 10.1109/ICSESS.2014.6933623
Han-Ru Pei, Yu Wang, Zhijian Wang
There are numerous efforts to measure the degree of anonymity. Among which the entropy anonymity is a popular one. However in practice entropy anonymity is hardly used because one of its assumptions is difficult to meet. In this paper we propose a method to tackle this problem. Our method is based on Bayesian statistics and can be used to compare the entropy anonymity of different anonymous communication systems. We use this method to analyze Threshold Mix to show its effectiveness and usefulness.
{"title":"The application of Bayesian statistics in measuring anonymity","authors":"Han-Ru Pei, Yu Wang, Zhijian Wang","doi":"10.1109/ICSESS.2014.6933623","DOIUrl":"https://doi.org/10.1109/ICSESS.2014.6933623","url":null,"abstract":"There are numerous efforts to measure the degree of anonymity. Among which the entropy anonymity is a popular one. However in practice entropy anonymity is hardly used because one of its assumptions is difficult to meet. In this paper we propose a method to tackle this problem. Our method is based on Bayesian statistics and can be used to compare the entropy anonymity of different anonymous communication systems. We use this method to analyze Threshold Mix to show its effectiveness and usefulness.","PeriodicalId":6473,"journal":{"name":"2014 IEEE 5th International Conference on Software Engineering and Service Science","volume":"21 1","pages":"533-536"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83204433","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 : 2014-06-27DOI: 10.1109/ICSESS.2014.6933692
Fei Jiang, Xiaoguang Hong, Zhaohui Peng, Qingzhong Li
We propose an approach applicable in the problem of multi dimensions text mining that finds out several sets of phrases which were referred to as the text dimension. Based on the dimensions of text found by the proposed approach, a network could be built by similarities between documents. A method is proposed to transform the network from a coarse-grained one to a fine-grained one. By repeatedly mining phrases sets from the networks of different granularities, we could get a refined text dimensions set. We provide experimental results on text mining showing the computational feasibility and effectiveness for finding text dimensions which combines text mining with network mining and can be used for learning interesting knowledge.
{"title":"Finding dimensions for text based on heterogeneous information network","authors":"Fei Jiang, Xiaoguang Hong, Zhaohui Peng, Qingzhong Li","doi":"10.1109/ICSESS.2014.6933692","DOIUrl":"https://doi.org/10.1109/ICSESS.2014.6933692","url":null,"abstract":"We propose an approach applicable in the problem of multi dimensions text mining that finds out several sets of phrases which were referred to as the text dimension. Based on the dimensions of text found by the proposed approach, a network could be built by similarities between documents. A method is proposed to transform the network from a coarse-grained one to a fine-grained one. By repeatedly mining phrases sets from the networks of different granularities, we could get a refined text dimensions set. We provide experimental results on text mining showing the computational feasibility and effectiveness for finding text dimensions which combines text mining with network mining and can be used for learning interesting knowledge.","PeriodicalId":6473,"journal":{"name":"2014 IEEE 5th International Conference on Software Engineering and Service Science","volume":"36 1","pages":"819-823"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84771228","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 : 2014-06-27DOI: 10.1109/ICSESS.2014.6933706
Xin-chao Qu, Yue Zhang
With the developing trend of healthcare monitoring instruments becoming miniaturized and intelligent, more and more embedded healthcare monitoring devices are being used in hospitals. It is necessary to develop an integrated management platform for a variety of monitoring data. This paper presents a software application tool to manage multiple physiological parameters monitor data including Holter, static ECG, oxygen saturation and blood pressure. First, the system provides an automated medical monitoring procedure. Second, a clinical multi-parameter monitoring database stores user information, monitoring data, etc. Third, the system enables off-site doctors to operate diagnosis reports using a PC or smartphone through the Internet. The system effectively enhances the efficiency of health care monitoring, and the network delay of the system is small enough to meet the requirements of users.
{"title":"Design and implementation of multi-physiological parameters information management system","authors":"Xin-chao Qu, Yue Zhang","doi":"10.1109/ICSESS.2014.6933706","DOIUrl":"https://doi.org/10.1109/ICSESS.2014.6933706","url":null,"abstract":"With the developing trend of healthcare monitoring instruments becoming miniaturized and intelligent, more and more embedded healthcare monitoring devices are being used in hospitals. It is necessary to develop an integrated management platform for a variety of monitoring data. This paper presents a software application tool to manage multiple physiological parameters monitor data including Holter, static ECG, oxygen saturation and blood pressure. First, the system provides an automated medical monitoring procedure. Second, a clinical multi-parameter monitoring database stores user information, monitoring data, etc. Third, the system enables off-site doctors to operate diagnosis reports using a PC or smartphone through the Internet. The system effectively enhances the efficiency of health care monitoring, and the network delay of the system is small enough to meet the requirements of users.","PeriodicalId":6473,"journal":{"name":"2014 IEEE 5th International Conference on Software Engineering and Service Science","volume":"169 1","pages":"881-884"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80645685","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 : 2014-06-27DOI: 10.1109/ICSESS.2014.6933667
Won Shin, Doo-Ho Park, Tae-Wan Kim, Chun-Hyon Chang
As Android is an open-source operating system, numerous device-specific updates are frequently published by various developers. Thus, in order to increase the portability of an application, the development of an Android application requires an efficient porting process. However, many analytical time-consuming problems arise when developers convert the application for other versions of platform. In this paper, we propose a behavior-based portability analysis methodology for Android applications. Using this methodology, a developer can extract the ideal behavior of an application and use it to compare the similarity of application flows. We study Android applications to determine whether the proposed methodology can be adopted to detect potential errors. The principal contribution of this paper is to enable developers to use behavior-based analysis for detecting potential errors related to portability by utilizing the porting process easily and quickly.
{"title":"Behavior-based portability analysis methodology for Android applications","authors":"Won Shin, Doo-Ho Park, Tae-Wan Kim, Chun-Hyon Chang","doi":"10.1109/ICSESS.2014.6933667","DOIUrl":"https://doi.org/10.1109/ICSESS.2014.6933667","url":null,"abstract":"As Android is an open-source operating system, numerous device-specific updates are frequently published by various developers. Thus, in order to increase the portability of an application, the development of an Android application requires an efficient porting process. However, many analytical time-consuming problems arise when developers convert the application for other versions of platform. In this paper, we propose a behavior-based portability analysis methodology for Android applications. Using this methodology, a developer can extract the ideal behavior of an application and use it to compare the similarity of application flows. We study Android applications to determine whether the proposed methodology can be adopted to detect potential errors. The principal contribution of this paper is to enable developers to use behavior-based analysis for detecting potential errors related to portability by utilizing the porting process easily and quickly.","PeriodicalId":6473,"journal":{"name":"2014 IEEE 5th International Conference on Software Engineering and Service Science","volume":"1 1","pages":"714-717"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81953521","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 : 2014-06-27DOI: 10.1109/ICSESS.2014.6933659
Jiantao Zhao, Liujie Qin
Static server is a type of busy I/O application, traditional server wastes computer resource on waiting for I/O owing to using synchronous I/O. Its concurrency and timeliness are very poor. This paper uses event-driven model to design and implement a static server. The server composes of event dispatcher and several processing modules. Event dispatcher is the core component, using a high performance multiplexing I/O epoll in implementation so that server can being running all out in response to new requests. In the end, by comparing the web load tests, verify that event-driven model improves massive performance for static server.
{"title":"Design and implementation of static server based on event-driven","authors":"Jiantao Zhao, Liujie Qin","doi":"10.1109/ICSESS.2014.6933659","DOIUrl":"https://doi.org/10.1109/ICSESS.2014.6933659","url":null,"abstract":"Static server is a type of busy I/O application, traditional server wastes computer resource on waiting for I/O owing to using synchronous I/O. Its concurrency and timeliness are very poor. This paper uses event-driven model to design and implement a static server. The server composes of event dispatcher and several processing modules. Event dispatcher is the core component, using a high performance multiplexing I/O epoll in implementation so that server can being running all out in response to new requests. In the end, by comparing the web load tests, verify that event-driven model improves massive performance for static server.","PeriodicalId":6473,"journal":{"name":"2014 IEEE 5th International Conference on Software Engineering and Service Science","volume":"1 1","pages":"679-682"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89823646","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
扫码关注我们
求助内容：
应助结果提醒方式：