{"title":"Information diffusion model for microblog","authors":"Kai Wu, Xinsheng Ji, Caixia Liu","doi":"10.1109/ICSESS.2013.6615290","DOIUrl":"https://doi.org/10.1109/ICSESS.2013.6615290","url":null,"abstract":"Most current propagation models ignore individual differences between users. To solve this problem, we extract the impact of retweeting behavior of four categories of characteristics, and propose a method to predict individual forwarding behavior using logistic regression model. Then, by integrating into the user individual differences, a behavior-prediction based information diffusion model is established. The experiments results show that the model can simulate the process of information diffusion in the real network well.","PeriodicalId":223115,"journal":{"name":"2013 IEEE 4th International Conference on Software Engineering and Service Science","volume":"368 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122448517","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":"Complex statistical analysis of big data: Implementation and application of Apriori and FP-Growth algorithm based on MapReduce","authors":"Z. Rong, Dawen Xia, Zili Zhang","doi":"10.1109/ICSESS.2013.6615467","DOIUrl":"https://doi.org/10.1109/ICSESS.2013.6615467","url":null,"abstract":"In the single machine environment, the problems of Apriori and FP-Growth algorithm in large-scale data association rules mining are high memory consumption, low computing performance, poor scalability and reliability and so on. Therefore, we put forward a new implementation method which is based on MapReduce parallel environment for mining frequent itemsets to generate association rules and is verified by using different sizes of real datasets with different nodes in the cluster, meanwhile, selecting “speedup, scalability and reliability” as an indicator. The results show that our method is feasible and valid and is able to improve the overall performance and efficiency of Apriori and FP-Growth algorithm to meet the needs of large-scale data association rules mining.","PeriodicalId":223115,"journal":{"name":"2013 IEEE 4th International Conference on Software Engineering and Service Science","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122986650","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}
Xiaorui Wang, Qingxian Wang, Yudong Guo, Jianping Lu
{"title":"Design of information flow in Collaborative-VMM","authors":"Xiaorui Wang, Qingxian Wang, Yudong Guo, Jianping Lu","doi":"10.1109/ICSESS.2013.6615270","DOIUrl":"https://doi.org/10.1109/ICSESS.2013.6615270","url":null,"abstract":"Information flow control is a key issue in the large-scale systems, it needs to consider the collaboration between multi-components, execution efficiency, system security, and other aspects, the complexity of information flow control is particularly prominent in the virtualization system. The current information flow control in virtualization system mainly use direct communication and asynchronous communication mode, but they have disadvantage such as complexity of VMM designing, increasing the risk of system security, low efficiency of data transmission. In this paper, we establish a synchronous communication mechanism based on the Collaborative-VMM, three key information flow control were designed in this VMM including I/O processing, interrupt processing, and user interface, it can eliminate the issue of processing delay between VMM and the I/O processing component. The experimental results show that the synchronous communication mechanism can simplify the design of virtualization system and does not reduce the performance of the system at the same time, it is a viable information flow control scheme.","PeriodicalId":223115,"journal":{"name":"2013 IEEE 4th International Conference on Software Engineering and Service Science","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124545329","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":"Protection of regional object and camera tampering","authors":"Zhihua Li, Qiuluan Li","doi":"10.1109/ICSESS.2013.6615396","DOIUrl":"https://doi.org/10.1109/ICSESS.2013.6615396","url":null,"abstract":"Protection of regional object and camera tampering is very important in video surveillance and security applications. This paper presents a novel technique for protection of regional object and camera tampering detection. The monitoring regions are set artificially in the surveillance background scenes for protecting regional object, and cameras positions are also selected for camera tampering. According to the motion segmentation results based on background substraction model, alarm is triggered in comparison with the monitoring regions. The multiple original background images are sent into buffer and stored for protecting camera tampering. In order to recognize the slight shake of the camera, the normalized histogram distribution is utilized to detect the camera tampering. Experimental results show that the proposed algorithms can efficiently detect the abnormal events for protection of regional object and camera tampering.","PeriodicalId":223115,"journal":{"name":"2013 IEEE 4th International Conference on Software Engineering and Service Science","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127755940","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":"Framwork for information security standards storage and retrieval using security patterns","authors":"Poramaporn Ruamjinda, N. Prompoon","doi":"10.1109/ICSESS.2013.6615309","DOIUrl":"https://doi.org/10.1109/ICSESS.2013.6615309","url":null,"abstract":"Establishing an information security policy that aligns with the business strategy of the organization usually depends on the stakeholders' expertise and experience. Due to the human factor constraint, this may lead to an incomplete and unclear policy. This research proposes a framework for the storage and retrieval of information security standards using information retrieval principles and security patterns based on security patterns, keyword search and the relationship among security patterns. The vector space model is used to compute the similarity between user queries and parts of security standard documents to present results relevant to the users' needs. Recall, precision and F-measure are used to evaluate the efficiency of the proposed methods.","PeriodicalId":223115,"journal":{"name":"2013 IEEE 4th International Conference on Software Engineering and Service Science","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127957504","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":"Data processing in Grid systems by using cluster algorithms","authors":"Monire Norouzi, Shahin Akbarpour","doi":"10.1109/ICSESS.2013.6615312","DOIUrl":"https://doi.org/10.1109/ICSESS.2013.6615312","url":null,"abstract":"One of the important factors in Grid computing is load balancing conditions on data processing. Also, one of the techniques and tools that we can influence on availability and ability of load balancing is Cluster computing. In this paper, we present some methods which we can divide one large network to some sub network. By this dividing, we can analyze load balancing conditions on data processing better. So, we use K-Means algorithm for clustering the processors for data processing in network and we investigate the conditions of load balancing on this algorithm. Also, we show that by executing this algorithm the speed of data processing becomes high and the process traffic are divided between the entire sub networks normally. By these results, cluster computing techniques such as K-Means algorithm are one of the effective and essential solutions for grid computing problems and load balancing.","PeriodicalId":223115,"journal":{"name":"2013 IEEE 4th International Conference on Software Engineering and Service Science","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121065078","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":"Combination recognition of face and ear based on two-dimensional fisher linear discriminant","authors":"Yahong Li, Wei-qi Yuan, Haifeng Sang, Xin Li","doi":"10.1109/ICSESS.2013.6615456","DOIUrl":"https://doi.org/10.1109/ICSESS.2013.6615456","url":null,"abstract":"Due to the impact of the factors such as age, cosmetics, beard and facial expressions, the performance of face recognition drops, while ear has rich and stable physiological features. A biometrics method combining face and ear is presented. Two-Dimensional Fisher Linear Discriminant (2DFLD) is applied respectively to recognition combining of facial and otic images and recognition combining of facial and otic features. On USTB ear database and ORL face database, the experimental results have shown that the recognition rate of combining facial and otic images reaches 97.5%, and is increased respectively 12.5% and 5% higher than that of face or ear; the recognition rate of combining facial and otic features is 95%, and is increased 10% and 2.5% higher than that of face or ear. The recognition of combination based on the 2DFLD method has a good recognition performance compared with PCA or 2DPCA. This indicates that the combined recognition of multi-biological features is an effective method of biometrics.","PeriodicalId":223115,"journal":{"name":"2013 IEEE 4th International Conference on Software Engineering and Service Science","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115935870","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}
Qin Futong, Meng Jie, Du Jing, Ao Fujiang, Zhou Ying
{"title":"Radar jamming effect evaluation based on AdaBoost combined classification model","authors":"Qin Futong, Meng Jie, Du Jing, Ao Fujiang, Zhou Ying","doi":"10.1109/ICSESS.2013.6615453","DOIUrl":"https://doi.org/10.1109/ICSESS.2013.6615453","url":null,"abstract":"The radar jamming effect evaluation can be solved by translating to multi-class classification problems. In this paper, we propose using the AdaBoost combined classification model to evaluate radar jamming effect. An evaluation model is designed, which uses Support Vector Machine as component classifiers and the AdaBoost M1 algorithm as combined classifier. The experiments show that, the model designed in this paper can be used to evaluate radar jamming effect, and its evaluation accuracy is much higher than some single classifiers, such as RBF neural network and Bayes.","PeriodicalId":223115,"journal":{"name":"2013 IEEE 4th International Conference on Software Engineering and Service Science","volume":"215 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115978739","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":"Hybrid particle swarm algorithm for assembly line balancing problem in complicated products","authors":"Changyi Liu, Haijun Wen","doi":"10.1109/ICSESS.2013.6615451","DOIUrl":"https://doi.org/10.1109/ICSESS.2013.6615451","url":null,"abstract":"At present, the assembly line balancing problem mainly lies in the fact that it is proceeded from the perspective of assembly time to conduct the study in time balance, which is difficult to cope with the dynamic changes occurring in the actual production. This paper, therefore, comes up with the optimized objective to minimize the assembly complexity relationship differentiation through the research into complexity of the assembly. Moreover, when combined with the optimization index multi-objective assembly line balancing research, it also puts forward the method of hybrid particle swarm algorithm to solve. The algorithm adopts topological sorting encoding based on operating elements of priority diagram, applies sorting and the number of niche to evaluate individuals, and it forms a new fitness function based on that. Besides, it introduces the thought of Simulated Annealing to expand the choice for Global Best to the entire procedure; the result of some cases can demonstrate the superiority of the algorithm.","PeriodicalId":223115,"journal":{"name":"2013 IEEE 4th International Conference on Software Engineering and Service Science","volume":"484 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116691278","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":"Network education video recommendation algorithm based on context and trust relationship","authors":"Chenyang Zhao, Junling Wang","doi":"10.1109/ICSESS.2013.6615366","DOIUrl":"https://doi.org/10.1109/ICSESS.2013.6615366","url":null,"abstract":"With the development of information technology and the internet, there are many education videos on the network for people to study in their spare time. However, it is difficult for people to choose education videos which they really need. To solve the problem, a personalized recommendation algorithm based on context and trust relationship is proposed in this paper. Under the help of this algorithm, education videos interested by users can be proactive recommended. The algorithm improves traditional filtering recommendation algorithm. It is divided into three parts. One candidate video set is firstly obtained according to user-rating matrix and context, and then another set is obtained according to trust relationships between users. Finally, the former two candidate sets are combined to determine the recommendation video set. Experiments indicate that the proposed algorithm is more accurate than traditional collaborative filtering algorithm.","PeriodicalId":223115,"journal":{"name":"2013 IEEE 4th International Conference on Software Engineering and Service Science","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115297298","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}