2016 IEEE International Conference on Software Science, Technology and Engineering (SWSTE)最新文献

筛选
英文 中文
An Improved MapReduce Algorithm for Mining Closed Frequent Itemsets 一种改进的MapReduce封闭频繁项集挖掘算法
Yaron Gonen, E. Gudes
{"title":"An Improved MapReduce Algorithm for Mining Closed Frequent Itemsets","authors":"Yaron Gonen, E. Gudes","doi":"10.1109/SWSTE.2016.19","DOIUrl":"https://doi.org/10.1109/SWSTE.2016.19","url":null,"abstract":"Mining closed frequent item sets is a key objective in the field of data mining due to its wide range of applications. Given a database of transactions, the task is to find closed subsets which appear frequently in different transactions. This subject has been studied thoroughly, and many efficient algorithms had been presented, however, most of them were designed for a non-distributed setting. The exponential growth of data in current times forces storing it in a distributed setting, meaning that most algorithms no longer apply. MapReduce is an acclaimed programming paradigm for processing large-scale, distributed data. In this paper we present an efficient algorithm for mining closed frequent item sets using the MapReduce paradigm. In addition to its novelty of running in a distributed setting, it also makes the duplication elimination step - a common step to all existing algorithms - redundant.","PeriodicalId":118525,"journal":{"name":"2016 IEEE International Conference on Software Science, Technology and Engineering (SWSTE)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130933196","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}
引用次数: 4
A Software Framework for PCa-Based Face Recognition 基于pca的人脸识别软件框架
Peng Peng, P. Alencar, D. Cowan
{"title":"A Software Framework for PCa-Based Face Recognition","authors":"Peng Peng, P. Alencar, D. Cowan","doi":"10.1109/SWSTE.2016.11","DOIUrl":"https://doi.org/10.1109/SWSTE.2016.11","url":null,"abstract":"This paper focuses on a software framework to support face recognition, a specific area of image processing. For the processing approach, we use principal component analysis (PCA), a data dimensionality reduction approach. The goal of this study is to understand the entire face recognition process with PCA and to present a software framework supporting multiple variations, which can be used to help users create customized face recognition applications efficiently.","PeriodicalId":118525,"journal":{"name":"2016 IEEE International Conference on Software Science, Technology and Engineering (SWSTE)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124548210","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
MaPE-K-Based Approach for Security @ Runtime 基于mape的运行时安全方法
Mohamed Amoud, O. Roudiès
{"title":"MaPE-K-Based Approach for Security @ Runtime","authors":"Mohamed Amoud, O. Roudiès","doi":"10.1109/SWSTE.2016.28","DOIUrl":"https://doi.org/10.1109/SWSTE.2016.28","url":null,"abstract":"Dynamic systems cause challenges for security because it is impossible to anticipate all the possible changes at design-time. Adaptive security is an applicable solution for this challenge. It is able to automatically select security mechanisms and their parameters at runtime in order to preserve the required security level in a changing environment. In this paper we describe an approach detailing key steps and activities to create an adaptive security solution. The architecture conforms to the MAPE-K reference model, which is a widely applied reference model in autonomic computing. Steps include: Establishing a control point to force control of the security decision process from the existing system. Identifying an environment parameter with which the security will trade off. Studying the interrelationship between security and the environment parameter in the existing system context by identifying measurable factors which influence their relationship. Formulation of a trade-off goal which is optimised based on multiple objectives, one of which is a security objective. Consequently, the proposed approach is capable of deploying mechanisms adaptive security to satisfy different security needs at different conditions.","PeriodicalId":118525,"journal":{"name":"2016 IEEE International Conference on Software Science, Technology and Engineering (SWSTE)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116939179","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
Study the Past If You Would Define the Future: Implementing Secure Multi-party SDN Updates 如果你想定义未来,研究过去:实现安全的多方SDN更新
Liron Schiff, S. Schmid
{"title":"Study the Past If You Would Define the Future: Implementing Secure Multi-party SDN Updates","authors":"Liron Schiff, S. Schmid","doi":"10.1109/SWSTE.2016.24","DOIUrl":"https://doi.org/10.1109/SWSTE.2016.24","url":null,"abstract":"A highly available and robust control plane is a critical prerequisite for any Software-Defined Network (SDN) providing dependability guarantees. While there is a wide consensus that the logically centralized SDN controller should be physically distributed, today, we do not have a good understanding of how to design such a distributed and robust control plane. This is problematic, given the potentially large influence an SDN controller has on the network state compared to the distributed legacy protocols: the control plane can be an attractive target for a malicious attack. This paper initiates the study of distributed SDN control planes which are resilient to malicious controllers, for example controllers which have been compromised by a cyber attack. We introduce an adversarial control plane model and observe that approaches based on redundancy or threshold cryptography are insufficient, as incomplete or out-dated information about the network state introduces vulnerabilities. The approach presented in this paper is based on the insight that a control plane resilient to malicious behavior requires a basic notion of memory, and must be history-aware. In particular, we propose an in band approach, implemented on the SDN switch, to efficiently coordinate the different controller actions, and guarantee correct network updates even in the presence of malicious behavior. In our approach, the switch maintains a digest of the controller state and history, and only implements the update after verifying that a majority of controllers agree to the change. Our solution is not only robust but also, compared to existing consensus protocols such as Paxos, light-weight.","PeriodicalId":118525,"journal":{"name":"2016 IEEE International Conference on Software Science, Technology and Engineering (SWSTE)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129516420","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}
引用次数: 4
Lessons and Experiences from the Design, Implementation, and Deployment of a Wildlife Tracking System 野生动物追踪系统设计、实施和部署的经验教训
Sivan Toledo, Oren Kishon, Yotam Orchan, Adi Shohat, Ran Nathan
{"title":"Lessons and Experiences from the Design, Implementation, and Deployment of a Wildlife Tracking System","authors":"Sivan Toledo, Oren Kishon, Yotam Orchan, Adi Shohat, Ran Nathan","doi":"10.1109/SWSTE.2016.16","DOIUrl":"https://doi.org/10.1109/SWSTE.2016.16","url":null,"abstract":"We describe software-engineering lessons we learned by building, deploying, and operating a large-scale distributed wildlife tracking system. The design started four years ago, the system has been operational for the past two years, but kept evolving during this time. The paper describes the structure of the system and then a series of interesting and well-documented lessons we learned. Most of the lessons surprised us, in spite of some of us being fairly experienced, some are not so surprising, but we felt that they are interesting enough to document here. Some of the lessons are particularly interesting because they are specific to computer systems built by computer scientists for collecting or processing experimental science data. These issues mostly revolve around the difficulty of building and maintaining complex systems in small teams in which junior members often leave well before the project is over.","PeriodicalId":118525,"journal":{"name":"2016 IEEE International Conference on Software Science, Technology and Engineering (SWSTE)","volume":"127 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128211019","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}
引用次数: 23
Identifying Attack Propagation Patterns in Honeypots Using Markov Chains Modeling and Complex Networks Analysis 基于马尔可夫链建模和复杂网络分析的蜜罐攻击传播模式识别
Ariel Bar, Bracha Shapira, L. Rokach, Moshe Unger
{"title":"Identifying Attack Propagation Patterns in Honeypots Using Markov Chains Modeling and Complex Networks Analysis","authors":"Ariel Bar, Bracha Shapira, L. Rokach, Moshe Unger","doi":"10.1109/SWSTE.2016.13","DOIUrl":"https://doi.org/10.1109/SWSTE.2016.13","url":null,"abstract":"Honey pots are computer resources that are used to detect and deflect network attacks on a protected system. The data collected from honey pots can be utilized to better understand cyber-attacks and provide insights for improving security measures, such as intrusion detection systems. In recent years, attackers' sophistication has increased significantly, thus additional and more advanced analytical models are required. In this paper we suggest several unique methods for detecting attack propagation patterns using Markov Chains modeling and complex networks analysis. These methods can be applied on attack datasets collected from honey pots. The results of these models shed light on different attack profiles and interaction patterns between the deployed sensors in the honey pot system. We evaluate the suggested methods on a massive data set which includes over 167 million observed attacks on a globally distributed honey pot system. Analyzing the results reveals interesting patterns regarding attack correlations between the honey pots. We identify central honey pots which enable the propagation of attacks, and present how attack profiles may vary according to the attacking country. These patterns can be used to better understand existing or evolving attacks, and may aid security experts to better deploy honey pots in their system.","PeriodicalId":118525,"journal":{"name":"2016 IEEE International Conference on Software Science, Technology and Engineering (SWSTE)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128321372","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}
引用次数: 32
Thinking Fast: Patterns of Cognitive Error in Software Engineering Education and Practice 快速思考:软件工程教育与实践中的认知错误模式
R. Gallant
{"title":"Thinking Fast: Patterns of Cognitive Error in Software Engineering Education and Practice","authors":"R. Gallant","doi":"10.1109/SWSTE.2016.15","DOIUrl":"https://doi.org/10.1109/SWSTE.2016.15","url":null,"abstract":"In this paper, the author utilizes typical mistakes of third year undergraduate Computer Science and Software Engineering students in advanced software engineering courses to categorize and anticipates errors in engineering practice. In elementary courses, the students learn and apply techniques locally to relatively simple problems. In advanced courses the students are trained to select and integrate a number of techniques to solve several interdependent problems encountered in the development of complex systems. In this context, the work of Daniel Kahneman on System 1 (intuitive) and System 2 (rational) thinking is quite relevant to analysis of the patterns leading to cognitive errors. Implications for engineering practice are explored.","PeriodicalId":118525,"journal":{"name":"2016 IEEE International Conference on Software Science, Technology and Engineering (SWSTE)","volume":"263 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114049575","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
Semantic-Security Capacity for the Physical Layer via Information Theory 基于信息论的物理层语义安全能力
Ziv Goldfeld, P. Cuff, H. Permuter
{"title":"Semantic-Security Capacity for the Physical Layer via Information Theory","authors":"Ziv Goldfeld, P. Cuff, H. Permuter","doi":"10.1109/SWSTE.2016.12","DOIUrl":"https://doi.org/10.1109/SWSTE.2016.12","url":null,"abstract":"Physical layer security can ensure secure communication over noisy channels in the presence of an eavesdropper with unlimited computational power. We adopt an information theoretic variant of semantic-security (SS) (a cryptographic gold standard), as our secrecy metric and study the open problem of the type II wiretap channel (WTC II) with a noisy main channel is, whose secrecy-capacity is unknown even under looser metrics than SS. Herein the secrecy-capacity is derived and shown to be equal to its SS capacity. In this setting, the legitimate users communicate via a discrete-memory less (DM) channel in the presence of an eavesdropper that has perfect access to a subset of its choosing of the transmitted symbols, constrained to a fixed fraction of the block length. The secrecy criterion is achieved simultaneously for all possible eavesdropper subset choices. On top of that, SS requires negligible mutual information between the message and the eavesdropper's observations even when maximized over all message distributions. A key tool for the achievability proof is a novel and stronger version of Wyner's soft covering lemma. Specifically, the lemma shows that a random codebook achieves the soft-covering phenomenon with high probability. The probability of failure is doubly-exponentially small in the block length. Since the combined number of messages and subsets grows only exponentially with the block length, SS for the WTC II is established by using the union bound and invoking the stronger soft-covering lemma. The direct proof shows that rates up to the weak-secrecy capacity of the classic WTC with a DM erasure channel (EC) to the eavesdropper are achievable. The converse follows by establishing the capacity of this DM wiretap EC as an upper bound for the WTC II. From a broader perspective, the stronger soft-covering lemma constitutes a tool for showing the existence of codebooks that satisfy exponentially many constraints, a beneficial ability for many other applications in information theoretic security.","PeriodicalId":118525,"journal":{"name":"2016 IEEE International Conference on Software Science, Technology and Engineering (SWSTE)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116917327","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
The Problem of the Lack of Benefit of a Document to Its Producer (PotLoBoaDtiP) 文件生产者利益缺失的问题(PotLoBoaDtiP)
D. Berry, K. Czarnecki, M. Antkiewicz, Mohamed AbdelRazik
{"title":"The Problem of the Lack of Benefit of a Document to Its Producer (PotLoBoaDtiP)","authors":"D. Berry, K. Czarnecki, M. Antkiewicz, Mohamed AbdelRazik","doi":"10.1109/SWSTE.2016.14","DOIUrl":"https://doi.org/10.1109/SWSTE.2016.14","url":null,"abstract":"The paper lists some of the quotations gathered during interviews and focus groups during a consulting engagement to help the client company improve its requirements engineering (RE) process. The paper describes in detail one of the phenomena observed, namely that of the problem of the lack of benefit of a document to its producer (PotLoBoaDtiP). It goes on to report other manifestations, including building and maintaining traces, of the PotLoBoaDtiP reported in the literature. It concludes by suggesting that the PotLoBoaDtiP cannot be solved with only technology, but that the motivational issue must be addressed.","PeriodicalId":118525,"journal":{"name":"2016 IEEE International Conference on Software Science, Technology and Engineering (SWSTE)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124601202","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
Towards Automated Measurements of Internet's Naming Infrastructure 迈向互联网命名基础设施的自动化测量
Andreas Borgwart, Haya Schulmann, M. Waidner
{"title":"Towards Automated Measurements of Internet's Naming Infrastructure","authors":"Andreas Borgwart, Haya Schulmann, M. Waidner","doi":"10.1109/SWSTE.2016.25","DOIUrl":"https://doi.org/10.1109/SWSTE.2016.25","url":null,"abstract":"Measuring and evaluating the Internet infrastructure is an important research area, with numerous proposals for sophisticated and novel ways to model traffic, infer networks' architectures and topology, or detect misconfigurations. An important requirement for such studies is the ability to reproduce the measurements in order to trace changes in the Internet over time, or to validate the reported results. Reproducibility is critical, for example, studying trends in configurations of services, adoption of patches and best practices, or fixes of misconfigurations. In this work we design automated tools for study of the architectures and configurations of the name servers in Domain Name System (DNS) and for evaluation of interoperability of unsigned domains with DNSSEC. Our measurement tools utilize wide-scale measurements of DNS servers in the forward and the reverse DNS trees, and conduct automated measurements, and provide reports with statistics. The tools are easy to use, with a convenient interface for clients and network operators. We provide access to the results collected with our tool, via a website.","PeriodicalId":118525,"journal":{"name":"2016 IEEE International Conference on Software Science, Technology and Engineering (SWSTE)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133155365","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
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学术官方微信