Pub Date : 2015-05-27DOI: 10.1109/ISI.2015.7165961
Saike He, Xiaolong Zheng, D. Zeng, Bo Xu, Changliang Li, Guanhua Tian, Lei Wang, Hongwei Hao
Emotion entrainment accounts for the rhythmic convergence of human emotions through social interactions. This phenomenon abounds in various disciplines, i.e. effervescency in soccer games, anger proliferation in violence incidents, or anxiety diffusion in disasters. Although emotion entrainment is highly relevant to the quality of human daily life, the principles underpinning this phenomenon is still unclear. Previous dynamic models try to explain entrainment phenomenon by assuming symmetrical coupling among identical individuals. Yet this assumption clearly does not hold in real-world human interactions. As such, we propose an alternative model that captures asymmetric relationships. In depicting the coupling mechanism, the effect of social influence is also encoded. Experimental results on two emergent social events suggest that the proposed model characterizes emotion trends with high accuracy. Also, we explain the emotion dynamics by analyzing the reconstructed entrainment matrix. Our work may present practical implications for those who want to guide or regulate the emotion evolution in emergency events discussed online.
{"title":"Modeling emotion entrainment of online users in emergency events","authors":"Saike He, Xiaolong Zheng, D. Zeng, Bo Xu, Changliang Li, Guanhua Tian, Lei Wang, Hongwei Hao","doi":"10.1109/ISI.2015.7165961","DOIUrl":"https://doi.org/10.1109/ISI.2015.7165961","url":null,"abstract":"Emotion entrainment accounts for the rhythmic convergence of human emotions through social interactions. This phenomenon abounds in various disciplines, i.e. effervescency in soccer games, anger proliferation in violence incidents, or anxiety diffusion in disasters. Although emotion entrainment is highly relevant to the quality of human daily life, the principles underpinning this phenomenon is still unclear. Previous dynamic models try to explain entrainment phenomenon by assuming symmetrical coupling among identical individuals. Yet this assumption clearly does not hold in real-world human interactions. As such, we propose an alternative model that captures asymmetric relationships. In depicting the coupling mechanism, the effect of social influence is also encoded. Experimental results on two emergent social events suggest that the proposed model characterizes emotion trends with high accuracy. Also, we explain the emotion dynamics by analyzing the reconstructed entrainment matrix. Our work may present practical implications for those who want to guide or regulate the emotion evolution in emergency events discussed online.","PeriodicalId":292352,"journal":{"name":"2015 IEEE International Conference on Intelligence and Security Informatics (ISI)","volume":"208 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114317529","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 : 2015-05-27DOI: 10.1109/ISI.2015.7165972
Yuhao Zhang, W. Mao, Xiaochen Li
In security-related applications, it is of great need to construct topic hierarchies from the data automatically. It can help us better understand the contents and structure of information and benefit many applications in security informatics. The existing topic hierarchy construction methods either need to specify the structure manually, or are not robust enough for sparse social media data such as microblog. In this paper, we propose an approach to automatically construct topic hierarchies from microblog data in a bottom up manner. We first detect the fine grained topics and then build the topic structure based on a multi-branch hierarchical construction method. We conduct a preliminary empirical study based on Weibo data. The experimental results show that the hierarchical topic structure generated by our method can provide meaningful results.
{"title":"A bottom-up method for constructing topic hierarchies","authors":"Yuhao Zhang, W. Mao, Xiaochen Li","doi":"10.1109/ISI.2015.7165972","DOIUrl":"https://doi.org/10.1109/ISI.2015.7165972","url":null,"abstract":"In security-related applications, it is of great need to construct topic hierarchies from the data automatically. It can help us better understand the contents and structure of information and benefit many applications in security informatics. The existing topic hierarchy construction methods either need to specify the structure manually, or are not robust enough for sparse social media data such as microblog. In this paper, we propose an approach to automatically construct topic hierarchies from microblog data in a bottom up manner. We first detect the fine grained topics and then build the topic structure based on a multi-branch hierarchical construction method. We conduct a preliminary empirical study based on Weibo data. The experimental results show that the hierarchical topic structure generated by our method can provide meaningful results.","PeriodicalId":292352,"journal":{"name":"2015 IEEE International Conference on Intelligence and Security Informatics (ISI)","volume":"311 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132752136","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 : 2015-05-27DOI: 10.1109/ISI.2015.7165960
S. Ho, Jeffrey T. Hancock, Cheryl Booth, Xiuwen Liu, Shashanka Surya Timmarajus, M. Burmester
With an increasing number of online users, the potential danger of online deception grows accordingly - as does the importance of better understanding human behavior online to mitigate these risks. One critical element to address such online threat is to identify intentional deception in spontaneous online communication. For this study, we designed an interactive online game that creates player scenarios to encourage deception. Data was collected and analyzed in October 2014 to identify certain deceptive cues. Players' interactive dialogue was analyzed using linear regression analysis. The results reveal that certain language features are highly significant predictors of deception in synchronous, spontaneous online communication.
{"title":"Liar, Liar, IM on Fire: Deceptive language-action cues in spontaneous online communication","authors":"S. Ho, Jeffrey T. Hancock, Cheryl Booth, Xiuwen Liu, Shashanka Surya Timmarajus, M. Burmester","doi":"10.1109/ISI.2015.7165960","DOIUrl":"https://doi.org/10.1109/ISI.2015.7165960","url":null,"abstract":"With an increasing number of online users, the potential danger of online deception grows accordingly - as does the importance of better understanding human behavior online to mitigate these risks. One critical element to address such online threat is to identify intentional deception in spontaneous online communication. For this study, we designed an interactive online game that creates player scenarios to encourage deception. Data was collected and analyzed in October 2014 to identify certain deceptive cues. Players' interactive dialogue was analyzed using linear regression analysis. The results reveal that certain language features are highly significant predictors of deception in synchronous, spontaneous online communication.","PeriodicalId":292352,"journal":{"name":"2015 IEEE International Conference on Intelligence and Security Informatics (ISI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133092427","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 : 2015-05-27DOI: 10.1109/ISI.2015.7165970
Peng Su, W. Mao
Among the most important and distinctive actionable knowledge are actionable behavioral rules that can directly and explicitly suggest specific actions to take to influence (restrain or encourage) the behavior in the users' best interest. The problem of mining such rules is a search problem in a framework of support and expected utility. The previous definition of a rule's support assumes that each instance which supports a rule has the uniform contribution to the support. However, this assumption is usually violated in practice to some extent, and thus will hinder the performance of algorithms for mining such rules. In this paper, to handle this problem, a power-function-based observation-weighting model for support and corresponding mining algorithm are proposed. The experimental results strongly suggest the validity and the superiority of our approach.
{"title":"Power-function-based observation-weighting method for mining actionable behavioral rules","authors":"Peng Su, W. Mao","doi":"10.1109/ISI.2015.7165970","DOIUrl":"https://doi.org/10.1109/ISI.2015.7165970","url":null,"abstract":"Among the most important and distinctive actionable knowledge are actionable behavioral rules that can directly and explicitly suggest specific actions to take to influence (restrain or encourage) the behavior in the users' best interest. The problem of mining such rules is a search problem in a framework of support and expected utility. The previous definition of a rule's support assumes that each instance which supports a rule has the uniform contribution to the support. However, this assumption is usually violated in practice to some extent, and thus will hinder the performance of algorithms for mining such rules. In this paper, to handle this problem, a power-function-based observation-weighting model for support and corresponding mining algorithm are proposed. The experimental results strongly suggest the validity and the superiority of our approach.","PeriodicalId":292352,"journal":{"name":"2015 IEEE International Conference on Intelligence and Security Informatics (ISI)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133189929","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 : 2015-05-27DOI: 10.1109/ISI.2015.7165977
Garima Bajwa, R. Dantu, Ryan Aldridge
Conventional authentication methods utilizing alphanumeric username and passwords, PIN numbers, or any combination thereof have many weaknesses. On modern smart phones there are multiple ways users can authenticate. The traditional username password combination is used often as well as PIN passwords and pattern based passwords. The problem with these methods is that they are still vulnerable. A short password or to a much greater extent a PIN, or a pattern password can be defeated by various techniques such as smudge attacks, key loggers and so on. Our aim with Pass-Pic is to implement a picture based authentication system that is both more secure and easier for the user to both input and remember.
{"title":"Pass-pic: A mobile user authentication","authors":"Garima Bajwa, R. Dantu, Ryan Aldridge","doi":"10.1109/ISI.2015.7165977","DOIUrl":"https://doi.org/10.1109/ISI.2015.7165977","url":null,"abstract":"Conventional authentication methods utilizing alphanumeric username and passwords, PIN numbers, or any combination thereof have many weaknesses. On modern smart phones there are multiple ways users can authenticate. The traditional username password combination is used often as well as PIN passwords and pattern based passwords. The problem with these methods is that they are still vulnerable. A short password or to a much greater extent a PIN, or a pattern password can be defeated by various techniques such as smudge attacks, key loggers and so on. Our aim with Pass-Pic is to implement a picture based authentication system that is both more secure and easier for the user to both input and remember.","PeriodicalId":292352,"journal":{"name":"2015 IEEE International Conference on Intelligence and Security Informatics (ISI)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127819363","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 : 2015-05-27DOI: 10.1109/ISI.2015.7165979
J. Kar
The article proposes an Online/Off-line Ring Signature Scheme in random oracle model. Security of the scheme relies on both Computational Diffie-Hellman and k-CAA problems. In Online/Off-line signature scheme. The proposed scheme is secure against Existential Unforgeability. It has Signer Ambiguity and robustness property where the misbehavior of the signer can be detected.
{"title":"Online/off-line ring signature scheme with provable security","authors":"J. Kar","doi":"10.1109/ISI.2015.7165979","DOIUrl":"https://doi.org/10.1109/ISI.2015.7165979","url":null,"abstract":"The article proposes an Online/Off-line Ring Signature Scheme in random oracle model. Security of the scheme relies on both Computational Diffie-Hellman and k-CAA problems. In Online/Off-line signature scheme. The proposed scheme is secure against Existential Unforgeability. It has Signer Ambiguity and robustness property where the misbehavior of the signer can be detected.","PeriodicalId":292352,"journal":{"name":"2015 IEEE International Conference on Intelligence and Security Informatics (ISI)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123781848","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 : 2015-05-27DOI: 10.1109/ISI.2015.7165976
Theogene Hakiza Bucuti, R. Dantu
Confidentiality for DNS transactions has been a low-priority concern in DNS security for a long time due to performance requirements for the functionality of DNS and the fact that data in the DNS is considered public. However, the information carried in DNS transactions, if collected and analyzed, can pose real threats to personal privacy. This makes DNS a good target for passive eavesdropping to collect data for many purposes some of which may be malicious. The protocol described in this document is intended to facilitate an opportunistic negotiation of encryption in the DNS to provide confidentiality for the last mile of DNS resolution. It defines procedures to discover encryption-aware servers and how to establish a relationship with them with minimum overhead.
{"title":"An opportunistic encryption extension for the DNS protocol","authors":"Theogene Hakiza Bucuti, R. Dantu","doi":"10.1109/ISI.2015.7165976","DOIUrl":"https://doi.org/10.1109/ISI.2015.7165976","url":null,"abstract":"Confidentiality for DNS transactions has been a low-priority concern in DNS security for a long time due to performance requirements for the functionality of DNS and the fact that data in the DNS is considered public. However, the information carried in DNS transactions, if collected and analyzed, can pose real threats to personal privacy. This makes DNS a good target for passive eavesdropping to collect data for many purposes some of which may be malicious. The protocol described in this document is intended to facilitate an opportunistic negotiation of encryption in the DNS to provide confidentiality for the last mile of DNS resolution. It defines procedures to discover encryption-aware servers and how to establish a relationship with them with minimum overhead.","PeriodicalId":292352,"journal":{"name":"2015 IEEE International Conference on Intelligence and Security Informatics (ISI)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126375529","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 : 2015-05-27DOI: 10.1109/ISI.2015.7165955
Jinie Pak, Lina Zhou
This research aims to compare the performance of automatic deception detection in synchronous computer-mediated communication (CMC) with and without incorporating structural features. In addition, the development of deception detection models draws on the linguistic features that have been widely studied in the online deception literature. The results suggest that structural features can be effective in detecting deception and combining the structural features with linguistic features can improve the performance of detecting deception.
{"title":"A comparison of features for automatic deception detection in synchronous computer-mediated communication","authors":"Jinie Pak, Lina Zhou","doi":"10.1109/ISI.2015.7165955","DOIUrl":"https://doi.org/10.1109/ISI.2015.7165955","url":null,"abstract":"This research aims to compare the performance of automatic deception detection in synchronous computer-mediated communication (CMC) with and without incorporating structural features. In addition, the development of deception detection models draws on the linguistic features that have been widely studied in the online deception literature. The results suggest that structural features can be effective in detecting deception and combining the structural features with linguistic features can improve the performance of detecting deception.","PeriodicalId":292352,"journal":{"name":"2015 IEEE International Conference on Intelligence and Security Informatics (ISI)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132165468","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 : 2015-05-27DOI: 10.1109/ISI.2015.7165931
C. Giannella, E. Bloedorn
We develop a version of spectral clustering and empirically study its performance when applied to behavior-based malware clustering. In 2011, a behavior-based malware clustering algorithm was reported by Rieck et al. We hypothesize that, owing to the more complex nature of our algorithm, it will exhibit higher accuracy than Rieck's but will require greater run-time. Through experiments using three different malware datasets, we largely substantiate this hypothesis. Our approach had comparable or superior accuracy to Rieck's over all of its parameter settings examined and ours had higher run-times (nonetheless, ours had run-times of less than one minute on all datasets). We also found our algorithm had no clear accuracy advantage, but much smaller run-times than Hierarchical Agglomerative Clustering.
{"title":"Spectral malware behavior clustering","authors":"C. Giannella, E. Bloedorn","doi":"10.1109/ISI.2015.7165931","DOIUrl":"https://doi.org/10.1109/ISI.2015.7165931","url":null,"abstract":"We develop a version of spectral clustering and empirically study its performance when applied to behavior-based malware clustering. In 2011, a behavior-based malware clustering algorithm was reported by Rieck et al. We hypothesize that, owing to the more complex nature of our algorithm, it will exhibit higher accuracy than Rieck's but will require greater run-time. Through experiments using three different malware datasets, we largely substantiate this hypothesis. Our approach had comparable or superior accuracy to Rieck's over all of its parameter settings examined and ours had higher run-times (nonetheless, ours had run-times of less than one minute on all datasets). We also found our algorithm had no clear accuracy advantage, but much smaller run-times than Hierarchical Agglomerative Clustering.","PeriodicalId":292352,"journal":{"name":"2015 IEEE International Conference on Intelligence and Security Informatics (ISI)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132218589","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 : 2015-05-27DOI: 10.1109/ISI.2015.7165974
Kun Wang, Duoyong Sun
The Shanghai Cooperation Organization (SCO) has an extraordinary role to play in many aspects since its establishment. However, previous achievements of the organization were mainly under political and historical perspective, and quantitative study is scarce. The Social Network Analysis (SNA) is considered to be a powerful data mining tool, and it has become a new hotspot of international relations studies in recent years. This manuscript attempts to explore the relational structure of SCO though the SNA. We gathered some relevant data on Military Exercise of the SCO from the Internet. And then, we made a trial to construct the meta-network models, and obtain evolution of its relationship.
{"title":"Research on construction methods of the Shanghai cooperation organization meta-network model","authors":"Kun Wang, Duoyong Sun","doi":"10.1109/ISI.2015.7165974","DOIUrl":"https://doi.org/10.1109/ISI.2015.7165974","url":null,"abstract":"The Shanghai Cooperation Organization (SCO) has an extraordinary role to play in many aspects since its establishment. However, previous achievements of the organization were mainly under political and historical perspective, and quantitative study is scarce. The Social Network Analysis (SNA) is considered to be a powerful data mining tool, and it has become a new hotspot of international relations studies in recent years. This manuscript attempts to explore the relational structure of SCO though the SNA. We gathered some relevant data on Military Exercise of the SCO from the Internet. And then, we made a trial to construct the meta-network models, and obtain evolution of its relationship.","PeriodicalId":292352,"journal":{"name":"2015 IEEE International Conference on Intelligence and Security Informatics (ISI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128336758","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
扫码关注我们
求助内容：
应助结果提醒方式：