2016 IEEE Symposium Series on Computational Intelligence (SSCI)最新文献_第5页

Evolving random graph generators: A case for increased algorithmic primitive granularity 进化随机图生成器:增加算法原语粒度的一个例子

2016 IEEE Symposium Series on Computational Intelligence (SSCI) Pub Date : 2016-12-01 DOI: 10.1109/SSCI.2016.7849929

A. Pope, D. Tauritz, A. Kent

{"title":"Evolving random graph generators: A case for increased algorithmic primitive granularity","authors":"A. Pope, D. Tauritz, A. Kent","doi":"10.1109/SSCI.2016.7849929","DOIUrl":"https://doi.org/10.1109/SSCI.2016.7849929","url":null,"abstract":"Random graph generation techniques provide an invaluable tool for studying graph related concepts. Unfortunately, traditional random graph models tend to produce artificial representations of real-world phenomenon. Manually developing customized random graph models for every application would require an unreasonable amount of time and effort. In this work, a platform is developed to automate the production of random graph generators that are tailored to specific applications. Elements of existing random graph generation techniques are used to create a set of graph-based primitive operations. A hyper-heuristic approach is employed that uses genetic programming to automatically construct random graph generators from this set of operations. This work improves upon similar research by increasing the level of algorithmic sophistication possible with evolved solutions, allowing more accurate modeling of subtle graph characteristics. The versatility of this approach is tested against existing methods and experimental results demonstrate the potential to outperform conventional and state of the art techniques for specific applications.","PeriodicalId":120288,"journal":{"name":"2016 IEEE Symposium Series on Computational Intelligence (SSCI)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127594482","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}

引用次数: 14

Morwilog: an ACO-based system for outlining multi-step attacks Morwilog:一个基于aco的系统，用于概述多步骤攻击

2016 IEEE Symposium Series on Computational Intelligence (SSCI) Pub Date : 2016-12-01 DOI: 10.1109/SSCI.2016.7849902

Julio Navarro-Lara, A. Deruyver, P. Parrend

引用次数: 12

“BioVid Emo DB”: A multimodal database for emotion analyses validated by subjective ratings “BioVid Emo DB”:一个多模式的情感分析数据库，通过主观评分验证

2016 IEEE Symposium Series on Computational Intelligence (SSCI) Pub Date : 2016-12-01 DOI: 10.1109/SSCI.2016.7849931

Lin Zhang, Steffen Walter, Xueyao Ma, P. Werner, A. Al-Hamadi, H. Traue, Sascha Gruss

引用次数: 36

Automatic multi-step signature derivation from taint graphs 从污染图自动多步签名派生

2016 IEEE Symposium Series on Computational Intelligence (SSCI) Pub Date : 2016-12-01 DOI: 10.1109/SSCI.2016.7850076

M. Ussath, Feng Cheng, C. Meinel

{"title":"Automatic multi-step signature derivation from taint graphs","authors":"M. Ussath, Feng Cheng, C. Meinel","doi":"10.1109/SSCI.2016.7850076","DOIUrl":"https://doi.org/10.1109/SSCI.2016.7850076","url":null,"abstract":"An increasing number of attacks use advanced tactics, techniques and methods to compromise target systems and environments. Such multi-step attacks are often able to bypass existing prevention and detection systems, such as Intrusion Detection Systems (IDSs), firewalls and anti-virus solutions. These security systems either use an anomaly-based or a signature-based detection approach. For systems that utilize a signature-based approach, it is relevant to use precise detection signatures to identify attacks. The creation of signatures is often complex and time consuming, especially for multi-step attacks. In this paper, we propose a signature derivation approach that automatically creates multi-step detection signatures from taint graphs. The approach uses the recorded log events of an attack and the event attribute tainting approach to correlate the events and to create a taint graph. This graph, which provides comprehensive details about the attack, is then used to derive a precise multi-step detection signature. Therewith, this approach can reduce the needed time to create a multi-step signature as well as the complexity of this process. For the evaluation of the proposed approach, we simulated a multi-step attack with real world attack tools and methods. Based on the recorded log events and the implemented signature derivation system we automatically derived a multi-step detection signature that describes all relevant events and their relations.","PeriodicalId":120288,"journal":{"name":"2016 IEEE Symposium Series on Computational Intelligence (SSCI)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125987234","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}

引用次数: 6

Dempster-Shafer logical model for fuzzy Description Logics 模糊描述逻辑的Dempster-Shafer逻辑模型

2016 IEEE Symposium Series on Computational Intelligence (SSCI) Pub Date : 2016-12-01 DOI: 10.1109/SSCI.2016.7849960

Loukia Karanikola, Isambo Karali

引用次数: 1

Using a knowledge-based security orchestration tool to reduce the risk of browser compromise 使用基于知识的安全编排工具来降低浏览器泄露的风险

2016 IEEE Symposium Series on Computational Intelligence (SSCI) Pub Date : 2016-12-01 DOI: 10.1109/SSCI.2016.7849910

D. Leon, Venkata A. Bhandari, Ananth A. Jillepalli, Frederick T. Sheldon

{"title":"Using a knowledge-based security orchestration tool to reduce the risk of browser compromise","authors":"D. Leon, Venkata A. Bhandari, Ananth A. Jillepalli, Frederick T. Sheldon","doi":"10.1109/SSCI.2016.7849910","DOIUrl":"https://doi.org/10.1109/SSCI.2016.7849910","url":null,"abstract":"Today, web browsers are used to access and modify sensitive data and systems including intranets and critical control systems. Due to their computational capabilities and network connectivity, browsers are vulnerable to several types of attacks, even when fully patched. Browsers are also the main target of phishing attacks. Many browser attacks, including phishing, could be prevented or mitigated by using site-, user-, and device-specific security configurations in a diverse browsing ecosystem. However, in our research, we discovered that all major browsers expose disparate security configuration procedures, option names, values, and semantics. This results in an extremely hard to secure browsing ecosystem. We analyzed in detail more than a thousand browser security configuration options in three major browsers and found that only 17 had common names with common semantics. In this paper, we describe the results of this in-depth analysis. We also describe a knowledge-based solution, Open Browser GP, that would enable organizations to implement highly-granular secure configurations for their information and operational technology (IT/OT) browsing ecosystem.","PeriodicalId":120288,"journal":{"name":"2016 IEEE Symposium Series on Computational Intelligence (SSCI)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115819212","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

Padding the dimensions for knowledge transfer in the dynamic vector evaluated particle swarm optimisation algorithm 在动态向量中填充知识传递的维度，评估粒子群优化算法

2016 IEEE Symposium Series on Computational Intelligence (SSCI) Pub Date : 2016-12-01 DOI: 10.1109/SSCI.2016.7850236

Mardé Helbig

{"title":"Padding the dimensions for knowledge transfer in the dynamic vector evaluated particle swarm optimisation algorithm","authors":"Mardé Helbig","doi":"10.1109/SSCI.2016.7850236","DOIUrl":"https://doi.org/10.1109/SSCI.2016.7850236","url":null,"abstract":"Most real world problems have more than one objective, with at least two objectives in conflict with one another and at least one objective that is dynamic in nature. The dynamic vector evaluated particle swarm optimisation (DVEPSO) algorithm is a co-operative algorithm, where each sub-swarm solves only one objective function and therefore, each sub-swarm optimises only a sub-set of decision variables. Knowledge is shared amongst the sub-swarms when the particles' velocity is updated, by using the position of the global guide of the subswarm or of another sub-swarm. The global guide can only provide information about the decision variables that are applicable to the objective function that its sub-swarm is optimising. Therefore, padding is required for the other decision variables. This paper investigates various padding approaches, namely using the sub-swarm's global best, using the personal best (pbest) of another particle in the sub-swarm, using the global best (gbest) of another sub-swarm or performing parent-centric crossover on another particle's position, pbest and gbest. Results indicate that using a random gbest or pbest performed well in fast changing environments, and using the sub-swarm's gbest performed well in slowly changing environments.","PeriodicalId":120288,"journal":{"name":"2016 IEEE Symposium Series on Computational Intelligence (SSCI)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115861708","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

EvoBoids: Co-design of a physical and virtual game using Artificial Evolution EvoBoids:使用人工进化技术共同设计物理和虚拟游戏

2016 IEEE Symposium Series on Computational Intelligence (SSCI) Pub Date : 2016-12-01 DOI: 10.1109/SSCI.2016.7850281

David C. Alvarez-Charris, A. Pérez-Uribe, H. Satizábal, Jesús A. López

引用次数: 0

Induced aggregation operators in the ordered weighted average sum 有序加权平均和中的诱导聚合算子

2016 IEEE Symposium Series on Computational Intelligence (SSCI) Pub Date : 2016-12-01 DOI: 10.1109/SSCI.2016.7850148

J. Merigó, N. Alrajeh, M. Peris-Ortiz

引用次数: 2

Security analysis on InfiniBand protocol implementations ib协议实现的安全性分析

2016 IEEE Symposium Series on Computational Intelligence (SSCI) Pub Date : 2016-12-01 DOI: 10.1109/SSCI.2016.7849903

Kul Prasad Subedi, D. Dasgupta, Bo Chen

{"title":"Security analysis on InfiniBand protocol implementations","authors":"Kul Prasad Subedi, D. Dasgupta, Bo Chen","doi":"10.1109/SSCI.2016.7849903","DOIUrl":"https://doi.org/10.1109/SSCI.2016.7849903","url":null,"abstract":"The growing popularity of high performance computing has led to a new focus on bypassing or eliminating traditional I/O operations that are usually the bottlenecks for fast processing of large data volumes. One such solution uses a new network communication protocol called InfiniBand (IB) which supports remote direct memory access without making two copies of data (one in user space and the other in kernel space) and thus provides very low latency and very high throughput. To this end, for many industries, IB has now become a promising inter-connect protocol over Ethernet technologies. Ensuring the security of this new protocol is critical since more and more companies are moving towards it. To ensure the security of IB, the first step is to have a thorough understand of the vulnerabilities of its current implementations, which is unfortunately still missing in the literature. In this paper, we aim to fill this gap. In particular, we perform a static code analysis as well as protocol testing in order to examine security features in IB architecture from the implementation perspective. While our extensive penetration testing could not find any significant security loopholes; there are certain aspects in both the design and the implementations that need to be addressed. Our focus is in the implementation perspective. Specifically, we found there is a significant use for a number of vulnerable functions (e.g., memcpy, sprintf, and char) as well as obsolete functions (e.g., memalign) that we believe should be replaced with alternative functions such as memmove, snprintf, getline, and posix memalign. We believe our work will benefit both the protocol developers as well as the users by taking the first step to ensure the security of IB protocol.","PeriodicalId":120288,"journal":{"name":"2016 IEEE Symposium Series on Computational Intelligence (SSCI)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132044744","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