{"title":"Network covert channel analysis based on the density multilevel two segment clustering","authors":"Xuyang, Zouchenpeng, Yangning","doi":"10.1109/ICSESS.2015.7339051","DOIUrl":"https://doi.org/10.1109/ICSESS.2015.7339051","url":null,"abstract":"On the problem of covert channel detection, the traditional detection algorithms exist specific covert channel blind area, or it is useful for some kind of covert channel detection but ignore other covert channels. In order to solve this problem, in this paper proposes network covert channel analysis method based on the density multilevel two segment clustering. Firstly, the problem of covert channel in complex network is studied, and its mathematical model and data feature extraction are presented; Secondly, based on hierarchical clustering and design its multilevel aggregation improved form using the given complex network channel coarsening clustering results, at the same time in each layer of coarse channel and the results of detection, using density clustering algorithm to implement complex network covert channel detection and thinning and improve the prediction accuracy. Finally, the proposed algorithm can detect the complex network covert channel quickly and accurately when the noise is no higher than 20%.","PeriodicalId":335871,"journal":{"name":"2015 6th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126195851","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}
{"title":"Block medical image fusion based on adaptive PCNN","authors":"Hengfen Yang, Xin Jin, Dongming Zhou","doi":"10.1109/ICSESS.2015.7339067","DOIUrl":"https://doi.org/10.1109/ICSESS.2015.7339067","url":null,"abstract":"We proposed an effective block medical image fusion method based on adaptive pulse coupled neural networks (PCNN) in this paper. Source images are divided into several blocks, and then we calculate the spatial frequency (SF) of the blocks as linking strength β of the PCNN, so it adjusts β of the PCNN adaptively. The block images are input into PCNN to get the oscillation frequency graph (OFG), which expresses the quality of the block images, so we can fuse the clear part of the source images. The experimental results show that the block medical image fusion algorithm is more efficient than other common image fusion algorithms, and prove the adaptive PCNN method is effectively as well.","PeriodicalId":335871,"journal":{"name":"2015 6th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127382196","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}
{"title":"Secure top-k query scheme in wireless sensor networks","authors":"Yunpeng Xiao, Yaru Zhang","doi":"10.1109/ICSESS.2015.7339110","DOIUrl":"https://doi.org/10.1109/ICSESS.2015.7339110","url":null,"abstract":"Data privacy preserving in wireless sensor network has attracted more and more attentions. This paper proposes a secure top-k query scheme in wireless sensor networks (STQ). STQ uses symmetric encryption to preserve data privacy. To verify completeness of query result, STQ uses the improved hashed message authentication coding function to create a chaining relationship by binding ordered adjacent data. Theoretical analysis and simulation results confirm the security and efficiency of STQ.","PeriodicalId":335871,"journal":{"name":"2015 6th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128019776","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}
{"title":"Analyst-oriented taint analysis by taint path slicing and aggregation","authors":"Jinkun Pan, Xiaoguang Mao, W. Li","doi":"10.1109/ICSESS.2015.7339024","DOIUrl":"https://doi.org/10.1109/ICSESS.2015.7339024","url":null,"abstract":"Taint analysis determines whether values from untrusted or private sources may flow into security-sensitive or public sinks, and can discover many common security vulnerabilities in both Web and mobile applications. Static taint analysis detects suspicious data flows without running the application and achieves a good coverage. However, most existing static taint analysis tools only focus on discovering taint paths from sources to sinks and do not concern about the requirements of analysts for sanitization check and exploration. The sanitization can make a taint path no more dangerous but should be checked or explored by analysts manually in many cases and the process is very costly. During our preliminary study, we found that many statements along taint paths are not relevant to the sanitization and there are a lot of redundancies among taint paths with the same source or sink. Based on these two observations, we have designed and implemented the taint path slicing and aggregation algorithms, aiming at mitigating the workload of the analysts and helping them get a better comprehension of the taint behaviors of target applications. Experimental evaluations on real-world applications show that our proposed algorithms can reduce the taint paths effectively and efficiently.","PeriodicalId":335871,"journal":{"name":"2015 6th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131622122","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}
{"title":"An improved Monte Carlo POMDPs online planning algorithm combined with RAVE heuristic","authors":"Peigen Liu, J. Chen, Hongfu Liu","doi":"10.1109/ICSESS.2015.7339109","DOIUrl":"https://doi.org/10.1109/ICSESS.2015.7339109","url":null,"abstract":"Partially observable Markov decision processes (POMDPs) provide a kind of general model that can deal with problems in uncertain environment efficiently. There are many different planning methods for POMDPs model. Partially Observable Monte Carlo planning (POMCP) method, using Monte Carlo Tree Search (MCTS) method, which can help break the curse of dimensionality and the curse of history. However, the method has strong dependence on the count of simulations. The POMCP algorithm was improved in this paper by combining Rapid Action Value Estimate (RAVE) method and MCTS. There's less dependence on the count of simulations and higher efficiency in the improved algorithm, which is a promising online planning algorithm. Experimental results on the benchmark problems indicate that efficiency of the improved algorithm is higher than the basic POMCP algorithm.","PeriodicalId":335871,"journal":{"name":"2015 6th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115606200","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}
{"title":"A distributed algorithm to constructing weighted minimum connected dominating set for routing in mobile wireless network","authors":"Zifen Yang, Lihua Han, Guoqiang Li","doi":"10.1109/ICSESS.2015.7339105","DOIUrl":"https://doi.org/10.1109/ICSESS.2015.7339105","url":null,"abstract":"A mobile ad-hoc network (MANET) which does not use a wired network and base station system is composed of a group of mobile and wireless nodes. In MANET, The device In MANET is not charging in time. Many method based on Connecting dominate set are utilizing to prolong the network lifetime. In this paper we propose a new greedy approach to obtain a stable routing path by integrating three factors such as energy, mobility and degree of nodes. The simulation results show that our approach is superior to other method in terms of prolonging the lifetime of MANET. While the time complexity of our algorithm is O(D), where D is the network diameter.","PeriodicalId":335871,"journal":{"name":"2015 6th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"466 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114001044","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}
Li Ma, Houyi Yan, Qun Zhang, Xueting Zhang, Yunxiang Ling
{"title":"The research of multi-person, collaborative and interactive mechanism of command post based on Brainstorming method","authors":"Li Ma, Houyi Yan, Qun Zhang, Xueting Zhang, Yunxiang Ling","doi":"10.1109/ICSESS.2015.7339016","DOIUrl":"https://doi.org/10.1109/ICSESS.2015.7339016","url":null,"abstract":"In the command post, multi-person discussion is an effective means to improve the efficiency of command decision-making. Based on the existing command collaborative interaction technology, we discussed the application of command post “Brainstorming” argument process and mind map in collaborative research, and then, standardized users' operation in the process of discussion. At last, S PIN is used to verify the users' operation in this mechanism.","PeriodicalId":335871,"journal":{"name":"2015 6th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114022224","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}
Ruizhang Yang, Dan Li, Yingsong Hu, Yin Han, Lingling Zhu
{"title":"A new polygon deformation algorithm based on flexible coordinate space","authors":"Ruizhang Yang, Dan Li, Yingsong Hu, Yin Han, Lingling Zhu","doi":"10.1109/ICSESS.2015.7339177","DOIUrl":"https://doi.org/10.1109/ICSESS.2015.7339177","url":null,"abstract":"Deformation is an important research problem in computer graphics. In the paper, a new concept of flexible coordinate space is proposed to successive deformation process between any two mutually elastically deformable planar polygons. Then a new morphing technique based on elastic coordinate space is proposed. By linear interpolation of \"coordinate basis points\", then we can reverse out the coordinate points of the middle interpolation graphics in the process of continuous deformation. Experimental results show that the algorithm's time and space complexity are linear, high efficiency, and its deformation effect is smooth and natural.","PeriodicalId":335871,"journal":{"name":"2015 6th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115901967","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}
{"title":"A review on text mining","authors":"Yu Zhang, Mengdong Chen, Lianzhong Liu","doi":"10.1109/ICSESS.2015.7339149","DOIUrl":"https://doi.org/10.1109/ICSESS.2015.7339149","url":null,"abstract":"Because of large amounts of unstructured text data generated on the Internet, text mining is believed to have high commercial value. Text mining is the process of extracting previously unknown, understandable, potential and practical patterns or knowledge from the collection of text data. This paper introduces the research status of text mining. Then several general models are described to know text mining in the overall perspective. At last we classify text mining work as text categorization, text clustering, association rule extraction and trend analysis according to applications.","PeriodicalId":335871,"journal":{"name":"2015 6th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122365001","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}
{"title":"Autonomous navigation scheme of lunar relay satellite based on weak GNSS signals","authors":"Yongfeng Ma, Xiao Jia, Hua Lei, Yuan Gao, Qiaoxian Gong, Xueping Zhang","doi":"10.1109/ICSESS.2015.7339019","DOIUrl":"https://doi.org/10.1109/ICSESS.2015.7339019","url":null,"abstract":"Lunar Relay Satellite plays a significant role in lunar science, manned lunar landing and lunar surface navigation. Compared with ground based telemetry and command methods, the approach applying GNSS (Global Navigation Satellite System) receiver to autonomous navigation system of lunar relay satellite has great application value. It can reduce the workloads of Deep Space Surveying Control Network and improve the coverage and navigation accuracy of lunar orbiter. In this paper, we investigate the autonomous navigation scheme of Lunar Polar Orbit Relay Constellation based on weak GNSS signals. The navigation accuracy of lunar orbiter exerted by GNSS constellation scale, constellation type and receiver sensitivity is discussed. The simulation result shows that lunar relay satellite has at least one-satellite visibility to GNSS constellation in 81.85% of its orbit period and has four-satellite visibility in 13.03% of its orbit period when combing the signals emitted by GPS, COMPASS, GALILEO and GLONASS and making full use of the side-lobe signals. The increase of receiver sensitivity further improves the satellite visibility. This makes contribution to the scheme of orbit control system in the subsequent series of lunar exploration satellites.","PeriodicalId":335871,"journal":{"name":"2015 6th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122712501","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}