Proceedings of 2011 IEEE International Conference on Intelligence and Security Informatics最新文献

筛选
英文 中文
heteroHarvest: Harvesting information from heterogeneous sources heteroHarvest:从异构源获取信息
Abdul Rasool Qureshi, N. Memon, U. Wiil, P. Karampelas, Jose Ignacio Nieto Sancheze
{"title":"heteroHarvest: Harvesting information from heterogeneous sources","authors":"Abdul Rasool Qureshi, N. Memon, U. Wiil, P. Karampelas, Jose Ignacio Nieto Sancheze","doi":"10.1109/ISI.2011.5984780","DOIUrl":"https://doi.org/10.1109/ISI.2011.5984780","url":null,"abstract":"The abundance of information regarding any topic makes the Internet a very good resource. Even though searching the Internet is very easy, what remains difficult is to automate the process of information extraction from the available online information due to the lack of structure and the diversity in the sharing methods. Most of the times, information is stored in different proprietary formats, complying with different standards and protocols which makes tasks like data mining and information harvesting very difficult. In this paper, an information harvesting tool (heteroHarvest) is presented with objectives to address these problems by filtering the useful information and then normalizing the information in a singular non hypertext format. Finally we describe the results of experimental evaluation. The results are found promising with an overall error rate equal to 6.5% across heterogeneous formats.","PeriodicalId":220165,"journal":{"name":"Proceedings of 2011 IEEE International Conference on Intelligence and Security Informatics","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130326075","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}
引用次数: 0
Lifespan and popularity measurement of online content on social networks 社交网络上在线内容的寿命和受欢迎程度测量
Beiming Sun, V. Ng
{"title":"Lifespan and popularity measurement of online content on social networks","authors":"Beiming Sun, V. Ng","doi":"10.1109/ISI.2011.5984118","DOIUrl":"https://doi.org/10.1109/ISI.2011.5984118","url":null,"abstract":"With rapid development and increased popularity of social networks, more interests have been made in obtaining information from such social networking websites. Analysis on the popularity of online contents is one of the hottest interests which has triggered intensive research. Our research focuses on measuring the popularity of online posts within specified topics, such as “drug abuse”, as it can be used to detect the crime and discover potential drug abusers. We measure the lifespan and the popularity of drug related posts in order to know the level of influence they made. Identifying popular posts online can help us reveal the trend, and also detect the latent danger and may prevent future crime. In this paper, the Comment Arrival Model is proposed to identify the lifespan and the comment frequency pattern of posts, which are considered the main factors to define post popularity. And we present 4 general models to measure the popularity of posts which can be applied in different social network platforms. We also did experiments and evaluated the performance of models in two popular social networks in Hong Kong, HK Discussion and Twitter.","PeriodicalId":220165,"journal":{"name":"Proceedings of 2011 IEEE International Conference on Intelligence and Security Informatics","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114631569","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}
引用次数: 9
Study on covert networks of terroristic organizations based on text analysis 基于文本分析的恐怖组织隐蔽网络研究
Sun Duo-yong, Guo Shu-quan, Zhang Hai, Liu Ben-xian
{"title":"Study on covert networks of terroristic organizations based on text analysis","authors":"Sun Duo-yong, Guo Shu-quan, Zhang Hai, Liu Ben-xian","doi":"10.1109/ISI.2011.5984117","DOIUrl":"https://doi.org/10.1109/ISI.2011.5984117","url":null,"abstract":"Text information on typical domestic terrorist organization released by domestic mainstream network media is collected, and network text analysis tools are adopted to extract the entities that reflect the social network structure of terroristic organizations and the associated data from text information, to construct the covert networks for social organization structure of terrorists. Network analysis tools are adopted to carry out a social network quantitative analysis to the terroristic network characteristics in both individual level and organizational level. The study shows, that text information on terroristic activities from various network media can be effectively processed by text data mining, and visual network models that reflect social organization structure of terrorists can be made accordingly, and this demonstrates that to combine data mining tools with social network analytical method is an effective approach to study the covert networks of terroristic organizations.","PeriodicalId":220165,"journal":{"name":"Proceedings of 2011 IEEE International Conference on Intelligence and Security Informatics","volume":"116 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121698142","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}
引用次数: 1
Session-wise private data exchange in eHealth peer-to-peer database management systems 电子健康点对点数据库管理系统中会话明智的私有数据交换
S. Rahman, Mehedi Masud, C. Adams, H. Mouftah, A. Inomata
{"title":"Session-wise private data exchange in eHealth peer-to-peer database management systems","authors":"S. Rahman, Mehedi Masud, C. Adams, H. Mouftah, A. Inomata","doi":"10.1109/ISI.2011.5984081","DOIUrl":"https://doi.org/10.1109/ISI.2011.5984081","url":null,"abstract":"In a peer-to-peer database management system(P2PDBMS) system, peers exchange data in a pair-wise fashion on-the-fly in response to a query without any centralized control. Generally, peers create a temporary session during data exchange. The data might be trapped and disclosed by the intruders while exchanged over an insecure communication network. As there is no centralized control for data exchange among peers, we cannot assume any central third party security infrastructure (e.g. PKI) to protect confidential data of an eHealth P2PDBMS. So far, there is currently no available/existing security protocol for secured data exchange in eHealth P2PDBMS. In this paper we propose a security protocol for data exchange in eHealth P2PDBMSs based on pairing-based cryptography and data exchange policy. The proposed protocol allows the peers to compute their secret session keys dynamically by computing pairing on elliptic curve based on the policies between them during data exchange. Our proposed protocol is robust against the man-in-the middle attack, the masquerade attack and the replay attack.","PeriodicalId":220165,"journal":{"name":"Proceedings of 2011 IEEE International Conference on Intelligence and Security Informatics","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129233604","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}
引用次数: 7
Multivariate process monitoring and fault identification model using decision tree learning techniques 基于决策树学习技术的多变量过程监测与故障识别模型
Shuguang He, Chenghang Xiao
{"title":"Multivariate process monitoring and fault identification model using decision tree learning techniques","authors":"Shuguang He, Chenghang Xiao","doi":"10.1109/ISI.2011.5984107","DOIUrl":"https://doi.org/10.1109/ISI.2011.5984107","url":null,"abstract":"A multivariate process monitoring and fault identification model using decision tree (DT) learning techniques is proposed. We Use one DT classifier for process monitoring and other p (p is the number of the variables) DT classifiers for fault identification. The Mahalanobis distance contours based method for selecting model training samples is proposed to decrease the number of training samples. Numerical experiments based on bivariate process show that the proposed model works well in different conditions considered. The results also show that the sample sizes have obvious effect on the performance of the model. The correlation coefficients have nearly no effects on the performance of the DT classifier for process monitoring, while have obvious effects on the performance of the DT classifiers for fault identification.","PeriodicalId":220165,"journal":{"name":"Proceedings of 2011 IEEE International Conference on Intelligence and Security Informatics","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129284952","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}
引用次数: 2
Integrating online social networks for enhancing reputation systems of e-commerce 整合网上社交网络,提升电子商务信誉体系
Xing Fang, J. Zhan, Nicholas Koceja, Kenneth Williams, J. Brewton
{"title":"Integrating online social networks for enhancing reputation systems of e-commerce","authors":"Xing Fang, J. Zhan, Nicholas Koceja, Kenneth Williams, J. Brewton","doi":"10.1109/ISI.2011.5984119","DOIUrl":"https://doi.org/10.1109/ISI.2011.5984119","url":null,"abstract":"Online shopping has been introduced to Internet users for decades. However, many people are still susceptible to the risks of online shopping. Multiple risk-mitigating solutions have been adopted by most online shopping sites. One such solution, the reputation system, is capable of providing an up-to-date reputation score for every online seller. Nevertheless, it is also vulnerable to fake reviews, which can, in turn, mislead prospective buyers. In order to quench the fire, previous research work mounted friendship annotations to certain reviews, so that the prospective buyers can choose to trust such particular reviews based on their close relationships with the reviewers. In this paper, we extend this friend-annotation scheme by integrating online social networks to online shopping sites. Our protocol is designed to provide three online review submission methods with different privacy-preserving requirements.","PeriodicalId":220165,"journal":{"name":"Proceedings of 2011 IEEE International Conference on Intelligence and Security Informatics","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129422205","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}
引用次数: 5
Improving the security of the distributed enterprise data warehouse system 提高分布式企业数据仓库系统的安全性
Yanzhen Qu, Weiwen Yang
{"title":"Improving the security of the distributed enterprise data warehouse system","authors":"Yanzhen Qu, Weiwen Yang","doi":"10.1109/ISI.2011.5984776","DOIUrl":"https://doi.org/10.1109/ISI.2011.5984776","url":null,"abstract":"System architecture of distributed enterprise data warehouse should ensure quality attributes such as separation, scalability, extensibility, security, and manageability. However, all existing distributed enterprise data warehouse system architectures have failed to address security at the architecture level. We propose that adding a virtualized proxy component to the system architecture will greatly enhance the security of the distributed enterprise data warehouse system.","PeriodicalId":220165,"journal":{"name":"Proceedings of 2011 IEEE International Conference on Intelligence and Security Informatics","volume":"329 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126937107","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}
引用次数: 2
Identifying Dark Web clusters with temporal coherence analysis 用时间相干性分析识别暗网集群
Christopher C. Yang, Xuning Tang, Xiajing Gong
{"title":"Identifying Dark Web clusters with temporal coherence analysis","authors":"Christopher C. Yang, Xuning Tang, Xiajing Gong","doi":"10.1109/ISI.2011.5983993","DOIUrl":"https://doi.org/10.1109/ISI.2011.5983993","url":null,"abstract":"Extremists are actively utilizing social media as propaganda to promote their ideologies. Online forums are ideal platforms to draw attention from worldwide Internet users to the timely issues and some opinions in these discussions can be threatening the public safety. It is of great interest for the intelligence to identify clusters on these forums and capture the topics of discussions and their development. Previous work in cluster identification focused on social networks constructed by the direct interactions between users utilizing link analysis techniques. However, the direct interactions between users may only capture one potential relationship between forum users. Users who share common interests may not necessarily interact with each other directly. On the other hand, they may be active in similar events simultaneously. In this paper, we propose a temporal coherence analysis approach to identify clusters of users from the Dark Web data. Users are represented as vectors of activeness and clusters are extracted with the support of temporal coherence analysis. We tested our proposed methods on both synthetic dataset and real world dataset. Using the real-world Dark Web dataset, three clusters were identified and each cluster was also associated with a specific theme. It shows that a cluster of users participating in a theme of discussion can be discovered without using any content analysis but only using temporal analysis.","PeriodicalId":220165,"journal":{"name":"Proceedings of 2011 IEEE International Conference on Intelligence and Security Informatics","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134238933","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}
引用次数: 13
Organization of social network messages to improve understanding of an evolving crisis 组织社交网络信息,以提高对不断演变的危机的理解
Alana Platt, C. Hood, Levi Citrin
{"title":"Organization of social network messages to improve understanding of an evolving crisis","authors":"Alana Platt, C. Hood, Levi Citrin","doi":"10.1109/ISI.2011.5984779","DOIUrl":"https://doi.org/10.1109/ISI.2011.5984779","url":null,"abstract":"In this work, we present a system that is implemented on top of a stream of social network messages to facilitate learning about an emerging crisis. This method automatically detects sub-topics of the topic (crisis), and populates the sub-topics with the relevant retrieved messages. In future work, we intend to reduce the repetitiveness of the generated sub-topics while maintaining high precision in our classification, and implementing other unsupervised learning versions of our method and comparing them to the KNN version.","PeriodicalId":220165,"journal":{"name":"Proceedings of 2011 IEEE International Conference on Intelligence and Security Informatics","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122862379","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}
引用次数: 3
An new approach for newsboy problem with fuzzy demand 模糊需求报童问题的一种新方法
Jinsong Hu, Ling Cui, Zengqiang Li, X. Hu, Haixiang Wu
{"title":"An new approach for newsboy problem with fuzzy demand","authors":"Jinsong Hu, Ling Cui, Zengqiang Li, X. Hu, Haixiang Wu","doi":"10.1109/ISI.2011.5984115","DOIUrl":"https://doi.org/10.1109/ISI.2011.5984115","url":null,"abstract":"A sufficient condition that the expected value of function of fuzzy variable can be expressed as Lebesgue-Stieltjes integral is given via the credibility measure of fuzzy event. Based on the proposed sufficient condition, the expected sales, inventory and shortage amounts are derived. Therefore, the expected profit is established, its concavity is revealed. The optimal order condition is obtained. The special optimal order quantity conditions associated with various types of fuzzy demand are deduced. Finally, a numerical example is given to illustrate the order quantity conditions.","PeriodicalId":220165,"journal":{"name":"Proceedings of 2011 IEEE International Conference on Intelligence and Security Informatics","volume":"222 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123974591","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}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信