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

筛选
英文 中文
Extraction of expanded entity phrases 扩展实体短语的提取
James R. Johnson, Anita Miller, L. Khan, B. Thuraisingham, Murat Kantarcioglu
{"title":"Extraction of expanded entity phrases","authors":"James R. Johnson, Anita Miller, L. Khan, B. Thuraisingham, Murat Kantarcioglu","doi":"10.1109/ISI.2011.5984059","DOIUrl":"https://doi.org/10.1109/ISI.2011.5984059","url":null,"abstract":"This research is part of a larger integrated approach for extraction of information of interest from free text and the visualization of semantic relatedness between phrases of interest. This paper defines a new structure which is a key component, the expanded entity phrase (EPx). This paper also presents an approach for extracting EPx's from free text. The structure of the EPx's facilitates quantitative comparison with other EPx's. A combination of part of speech-based template matching and ontology-driven NLP provides an effective technique for extracting complex entity structures that cross clause boundaries. This approach also uses ontology-based inferences to lay the ground work for linking EPx's for semantic relatedness assessments involving different named entities not explicitly stated in the text. The real world data used in this research were derived from a collection of law enforcement email messages submitted by hundreds of investigators seeking information or posting information about crimes, incidents, requests, and announcements. Performance data on the approaches used for extracting EPx's and links from this data are presented.","PeriodicalId":220165,"journal":{"name":"Proceedings of 2011 IEEE International Conference on Intelligence and Security Informatics","volume":"9 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114001194","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}
引用次数: 8
The Geopolitical Web: Assessing societal risk in an uncertain world 地缘政治网络:在不确定的世界中评估社会风险
Hsinchun Chen, Catherine A. Larson, Theodore Elhourani, David Zimbra, David Ware
{"title":"The Geopolitical Web: Assessing societal risk in an uncertain world","authors":"Hsinchun Chen, Catherine A. Larson, Theodore Elhourani, David Zimbra, David Ware","doi":"10.1109/ISI.2011.5984051","DOIUrl":"https://doi.org/10.1109/ISI.2011.5984051","url":null,"abstract":"Country risk - the likelihood that a state will weaken or fail - and the methods of assessing it continue to be of serious concern to the international community. Country risk has traditionally been assessed by monitoring economic and financial indicators. However, social media (such as forums, blogs, and websites) are now important transporters of citizens' daily conversations and opinions, and as such may carry discernible indicators of risk, but they have been as yet little-used for this task. The Geopolitical Web project is a research effort with the ultimate goal of developing computational approaches for monitoring public opinion in regions of conflict, assessing country risk indicators in the social media of fragile or weakening states, and correlating these risk signals with commonly accepted quantitative geopolitical risk assessments. This paper presents the initial motivation for this data-driven project, collection procedures adopted, preliminary results of an automated topical analysis of the collection's content, and expected future work. By catching and deciphering possible signals of country risk in social discourse we hope to offer the international community an additional means of assessing the need for intervention in or support for fragile or weakening states.","PeriodicalId":220165,"journal":{"name":"Proceedings of 2011 IEEE International Conference on Intelligence and Security Informatics","volume":"263 1-2 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":"134628673","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
Bayesian reliability modeling of multi-level system with interdependent subsystems and components 具有相互依赖子系统和组件的多级系统的贝叶斯可靠性建模
Jian Liu, Jing Li, B. Kim
{"title":"Bayesian reliability modeling of multi-level system with interdependent subsystems and components","authors":"Jian Liu, Jing Li, B. Kim","doi":"10.1109/ISI.2011.5984092","DOIUrl":"https://doi.org/10.1109/ISI.2011.5984092","url":null,"abstract":"Modeling the reliability of multi-level engineering systems is critically important yet technically challenging. Existing methods have limited consideration of the failure interdependency caused by the interactions among subsystems and components. In this paper, a new Bayesian Network (BN) representation of system structure and component interactions is proposed. Based on the BN representation, a Bayesian framework is developed to fuse the information from different levels of a system for modeling the reliability of the components, subsystems and the system as a whole. A case study is conducted to demonstrate the effectiveness of the proposed methodology.","PeriodicalId":220165,"journal":{"name":"Proceedings of 2011 IEEE International Conference on Intelligence and Security Informatics","volume":"89 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":"134069062","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
Mining actionable behavioral rules from group data 从组数据中挖掘可操作的行为规则
Peng Su, W. Mao, D. Zeng, Huimin Zhao
{"title":"Mining actionable behavioral rules from group data","authors":"Peng Su, W. Mao, D. Zeng, Huimin Zhao","doi":"10.1109/ISI.2011.5983996","DOIUrl":"https://doi.org/10.1109/ISI.2011.5983996","url":null,"abstract":"Many security-related applications can benefit from constructing models to predict the behavior of an entity. However, such models do not provide the user with explicit knowledge that can be directly used to influence the behavior for his/her interest. This type of knowledge is called actionable knowledge. Actionability is a very important aspect of the interestingness of mined patterns. In this paper, we formally define a new problem of mining actionable behavioral rules from group data. We also propose an algorithm for solving the problem. Using terrorism group data, our experiment shows the validity of our approach as well as the practical value of our defined problem in security informatics.","PeriodicalId":220165,"journal":{"name":"Proceedings of 2011 IEEE International Conference on Intelligence and Security Informatics","volume":"37 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":"132628799","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
An optimal control algorithm based on Kalman filter for ARMA disturbances 基于卡尔曼滤波的ARMA扰动最优控制算法
Fangyi He
{"title":"An optimal control algorithm based on Kalman filter for ARMA disturbances","authors":"Fangyi He","doi":"10.1109/ISI.2011.5984111","DOIUrl":"https://doi.org/10.1109/ISI.2011.5984111","url":null,"abstract":"Harmonic rule is popularly used in machine setup adjustment problems introduced by Grubbs (1954). The algorithm is optimal when the disturbance process is white noise and the initial process bias is an unknown value. When the initial process bias is assumed to be a random variable with a priori distribution, Grubbs' extended rule is optimal when the disturbance process is white noise. This paper considers the case that the initial process bias is a random variable and the disturbance process is a general ARMA(p, q) process. Under the framework of state-space model and based on Bayesian rule, an optimal control algorithm is derived. Several illustrative numerical examples are given through Monte Carlo simulations.","PeriodicalId":220165,"journal":{"name":"Proceedings of 2011 IEEE International Conference on Intelligence and Security Informatics","volume":"5 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":"115610875","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
The polynomial representation of Gray map on Zp2 Zp2上灰度映射的多项式表示
Lanlan Liu, Meng Zhou
{"title":"The polynomial representation of Gray map on Zp2","authors":"Lanlan Liu, Meng Zhou","doi":"10.1109/ISI.2011.5984089","DOIUrl":"https://doi.org/10.1109/ISI.2011.5984089","url":null,"abstract":"In this work we describe cyclic code on ℤ<inf>p2</inf> by polynomial representation, we also discuss polynomial representation of Nechaev permutation and the Gray and Nechaev-Gray maps. Then we extend Gerardo Vega and Jacques Wolfman's result in [1] on ℤ<inf>4</inf> to ℤ<inf>p2</inf> by polynomial representation of Gray and Nechaev-Gray maps. We proved that from a linear code ℤ<inf>p2</inf> of length n a linear cyclic code on ℤ<inf>p</inf> of length pn can be obtained using the polynomial representation of Gray and Nechaev-Gray maps on ℤ<inf>p</inf>. So our results are a generalization of the results in [1],[3],[4] where they only thought about the case of on ℤ<inf>4</inf>.","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":"114655641","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
Design of logic processes for prognostics and health management in an avionics system 航空电子系统中预测和健康管理的逻辑过程设计
D. Shen, Shunong Zhang
{"title":"Design of logic processes for prognostics and health management in an avionics system","authors":"D. Shen, Shunong Zhang","doi":"10.1109/ISI.2011.5984098","DOIUrl":"https://doi.org/10.1109/ISI.2011.5984098","url":null,"abstract":"Avionics systems perform critical functions in modern aircrafts. Intelligent technologies of prognostics and health management (PHM) are necessary in avionics systems. This paper discussed the architecture of an avionics PHM system, and showed and explained the flowcharts of the logic processes in different levels of the avionics PHM system in detail. A database and a model library needed in the PHM system were designed.","PeriodicalId":220165,"journal":{"name":"Proceedings of 2011 IEEE International Conference on Intelligence and Security Informatics","volume":"32 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":"121464915","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
Logistic regression analysis for Predicting Methicillin-resistant Staphylococcus Aureus (MRSA) in-hospital mortality 预测耐甲氧西林金黄色葡萄球菌(MRSA)住院死亡率的Logistic回归分析
Yizhen Hai, V. Cheng, S. Wong, K. Tsui, K. Yuen
{"title":"Logistic regression analysis for Predicting Methicillin-resistant Staphylococcus Aureus (MRSA) in-hospital mortality","authors":"Yizhen Hai, V. Cheng, S. Wong, K. Tsui, K. Yuen","doi":"10.1109/ISI.2011.5984112","DOIUrl":"https://doi.org/10.1109/ISI.2011.5984112","url":null,"abstract":"Statistical models have been widely used in public health and made a difference in a wide range of applications. For example, they provide new ideas for efficient feature selection. This paper attempts to demonstrate how to apply regression-based methods to accurately predict in-hospital mortality of Methicillin-resistant Staphylococcus Aureus (MRSA) patients. Logistic regression is used to predict the in-hospital death. It is found that admission age, residency, solid tumor, hemic malignancy, COAD, Dementia, PLT, Lymphocyte, Urea, and ALP are the significant prognostic factors (P&#60;0.1) for in-hospital survival. Using cross validation and random splitting and the prediction accuracy is around 85%. The future research direction is to strengthen the robustness of the predictive model. Possible direction is to make use of other data mining “blackbox” methods, such as k-NN and SVM. These models also need further validation on their performance and feature selection.","PeriodicalId":220165,"journal":{"name":"Proceedings of 2011 IEEE International Conference on Intelligence and Security Informatics","volume":"39 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":"116028024","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
Publisher click fraud in the pay-per-click advertising market: Incentives and consequences 付费点击广告市场中的发行商点击欺诈:动机和后果
Xiarong Li, Yong Liu, D. Zeng
{"title":"Publisher click fraud in the pay-per-click advertising market: Incentives and consequences","authors":"Xiarong Li, Yong Liu, D. Zeng","doi":"10.1109/ISI.2011.5984082","DOIUrl":"https://doi.org/10.1109/ISI.2011.5984082","url":null,"abstract":"Pay-per-click (PPC) advertising is being seriously threatened by the click fraud (CF). In this paper, we report a game-theoretic analysis of the incentives and consequences of CF involving Web content publishers. We find that the publisher competition induces CF, harming the efficiency especially the publisher payoff allocation in the market.","PeriodicalId":220165,"journal":{"name":"Proceedings of 2011 IEEE International Conference on Intelligence and Security Informatics","volume":"20 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":"129752961","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
Extending the classification of nodes in social networks 扩展社交网络中节点的分类
R. Heatherly, Murat Kantarcioglu
{"title":"Extending the classification of nodes in social networks","authors":"R. Heatherly, Murat Kantarcioglu","doi":"10.1109/ISI.2011.5984054","DOIUrl":"https://doi.org/10.1109/ISI.2011.5984054","url":null,"abstract":"Because of computational concerns, social network analysis generally uses only directly connected nodes to perform classification tasks. However, recent research indicates that this method of classification may not consider that nodes in the graph could have different influence over other nodes near them in the graph. It is possible that well-selected nodes may have a stronger importance in a social graph. Here, we analyze methods by which these important nodes may be identified and used to improve the classification of nodes within the social graph. We also show the effect of incorporating these important nodes in social network classification.","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":"129949465","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
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学术官方微信