2017 IEEE/ACS 14th International Conference on Computer Systems and Applications (AICCSA)最新文献_第8页

A Multi-agent Model Based on Hybrid Genetic Algorithm for Job Shop Scheduling Problem with Generic Time Lags 基于混合遗传算法的多智能体模型求解一般时滞作业车间调度问题

2017 IEEE/ACS 14th International Conference on Computer Systems and Applications (AICCSA) Pub Date : 2017-10-01 DOI: 10.1109/AICCSA.2017.66

M. Harrabi, O. Driss, K. Ghédira

引用次数: 2

Elliptic Curve Cryptography on E-Passport Authentication Protocol 电子护照认证协议中的椭圆曲线密码

2017 IEEE/ACS 14th International Conference on Computer Systems and Applications (AICCSA) Pub Date : 2017-10-01 DOI: 10.1109/AICCSA.2017.176

S. Saoudi, S. Yousfi, R. Robbana

{"title":"Elliptic Curve Cryptography on E-Passport Authentication Protocol","authors":"S. Saoudi, S. Yousfi, R. Robbana","doi":"10.1109/AICCSA.2017.176","DOIUrl":"https://doi.org/10.1109/AICCSA.2017.176","url":null,"abstract":"An electronic passport is a relatively new document type which many states are considering as a new form for travelling. E-passport is significantly more secure than a traditional passport. It promises the possibility of secure, simple and quick travel formalities. It is a relatively new feature and it deploys new technologies such as biometrics and Radio Frequency identification. We delve into security features and implications of this impending universal experiment of authentication technology. E-passport is involved in the improvement of travelling security. It is expected to protect data and guarantee authentication on inspection processes. International organizations are enhancing standards of E-passport security by implementation of new protocols. However, attackers still able to break them. In this paper, a new mechanism is presented to strengthen e-passport authentication process. We propose a new protocol based on Elliptic Curve, Identity-Based Encryption and Shared Secret between entities. We formally analyse the authentication of the protocol using the BAN Logic language, which is specially dedicated to describe and verify security protocols. This proposal aims to provide a secure data storage and authentication.","PeriodicalId":197301,"journal":{"name":"2017 IEEE/ACS 14th International Conference on Computer Systems and Applications (AICCSA)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128539146","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

Conditions to Have a Well-Disordered Dynamics in the CBC Mode of Operation 在CBC操作模式下具有良好无序动力学的条件

2017 IEEE/ACS 14th International Conference on Computer Systems and Applications (AICCSA) Pub Date : 2017-10-01 DOI: 10.1109/AICCSA.2017.84

Abdessalem Abidi, C. Guyeux, B. Bouallegue, Mohsen Machhout

引用次数: 2

Customer Relationship Management and Small Data — Application of Bayesian Network Elicitation Techniques for Building a Lead Scoring Model 客户关系管理与小数据——贝叶斯网络启发技术在建立潜在客户评分模型中的应用

2017 IEEE/ACS 14th International Conference on Computer Systems and Applications (AICCSA) Pub Date : 2017-10-01 DOI: 10.1109/AICCSA.2017.51

Y. Benhaddou, Philippe Leray

引用次数: 7

Performance Evaluation of a Parallel Algorithm for Determining All Optimal Solutions of the 1D Array Partitioning Problem 确定一维阵列划分问题所有最优解的并行算法的性能评价

2017 IEEE/ACS 14th International Conference on Computer Systems and Applications (AICCSA) Pub Date : 2017-10-01 DOI: 10.1109/AICCSA.2017.179

H. Salhi, Bchira Ben Mabrouk, Z. Mahjoub

{"title":"Performance Evaluation of a Parallel Algorithm for Determining All Optimal Solutions of the 1D Array Partitioning Problem","authors":"H. Salhi, Bchira Ben Mabrouk, Z. Mahjoub","doi":"10.1109/AICCSA.2017.179","DOIUrl":"https://doi.org/10.1109/AICCSA.2017.179","url":null,"abstract":"We address the parallelization of the determination of all optimal solutions (DAOS) for the 1D array partitioning problem, an easy combinatorial optimization problem that may be solved by dynamic programming. It turns out that the designed DAOS algorithm is a polyhedral algorithm (PA), i.e. a FOR-loop nest with affine loop bounds, whose iteration space that has to be scanned may be of exponential cardinality in the array size hence too time consuming. Thus, after a cardinality reducing procedure leading to an improved PA (IPA), we propose to parallelize the IPA through a specific approach. This latter first consists in a dependence analysis within the IPA leading to detect that all its loops are parallel. We then apply a loop interchange on the IPA in order to have a new IPA whose first loop has the largest number of parallel iterations. Another alternative consists in moving to the first position the loop whose number of iterations is the closest to the number of available processors. We detail an analysis of the theoretical performances of the derived parallel IPA by proposing several versions fitting the number of available processors and reducing the overhead due to processor synchronizations.","PeriodicalId":197301,"journal":{"name":"2017 IEEE/ACS 14th International Conference on Computer Systems and Applications (AICCSA)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117077492","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

Decentralized Tabu Searches in Multi Agent System for Distributed and Flexible Job Shop Scheduling Problem 分布式柔性作业车间调度问题的多智能体分散禁忌搜索

2017 IEEE/ACS 14th International Conference on Computer Systems and Applications (AICCSA) Pub Date : 2017-10-01 DOI: 10.1109/AICCSA.2017.133

Bilel Marzouki, O. Driss, K. Ghédira

{"title":"Decentralized Tabu Searches in Multi Agent System for Distributed and Flexible Job Shop Scheduling Problem","authors":"Bilel Marzouki, O. Driss, K. Ghédira","doi":"10.1109/AICCSA.2017.133","DOIUrl":"https://doi.org/10.1109/AICCSA.2017.133","url":null,"abstract":"Scheduling in production systems consists in assigning operations on a set of available resources in order to achieve defined objectives. The Flexible Job shop Scheduling Problem (FJSP) is one of the scheduling problems where each operation can be processed on different machine and its processing time depends on the used machine. But in the recent years, many companies decide to move towards the decentralization of their factories which allow it to gain advantages towards its customers. In the case of the classic Flexible Job shop Scheduling Problem, we assume that there is a single factory with a set of m machines and n jobs, but in Distributed and Flexible Job shop Scheduling Problem (DFJSP), there is a set of geographically distributed factories in different locations. Each factory contains m machines on which n jobs must be processed. The Distributed scheduling problems and more specifically the DFJSP are much more complicated than standard problems because they involve not only the problem of assigning jobs to machines but also the problem of distribution of jobs in different factories. So, the DFJSP is harder than the FJSP. The DFJSP is classified, as most of scheduling problems, NP-Hard in complexity theory. In this paper, we propose a decentralized model based on tabu search to solve the Distributed and Flexible Job shop Scheduling Problem in order to minimize the maximum completion time (makespan). To evaluate the performance of our model, a set of experiments are performed on benchmark instances well known in the literature.","PeriodicalId":197301,"journal":{"name":"2017 IEEE/ACS 14th International Conference on Computer Systems and Applications (AICCSA)","volume":"195 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115643287","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

Inter-VM Interference in Cloud Environments: A Survey 云环境中的虚拟机间干扰:一项调查

2017 IEEE/ACS 14th International Conference on Computer Systems and Applications (AICCSA) Pub Date : 2017-10-01 DOI: 10.1109/AICCSA.2017.122

Sabrine Amri, Hédi Hamdi, Zaki Brahmi

{"title":"Inter-VM Interference in Cloud Environments: A Survey","authors":"Sabrine Amri, Hédi Hamdi, Zaki Brahmi","doi":"10.1109/AICCSA.2017.122","DOIUrl":"https://doi.org/10.1109/AICCSA.2017.122","url":null,"abstract":"Cloud Computing paradigm has been a trend in the computational world. Thus, many service providers today are competing to enhance their features and attract more customers as they are offering them a bunch of services through a pay-asyou-go pricing model. However, despite their huge fame, cloud environments still suffer from some issues that are being studied by researchers from various perspectives. One of the controversial cloud issues nowadays is interference among virtual machines (VMs) sharing the same hardware platform called also physical machine (PM). This problem occurs due to contention on shared resources between co-hosted VMs which results in performance degradation. Resource contention happens when demand for shared resources exceeds the supply due to VMs cohosting. The co-hosting of VMs on the same PM, emerges from the ambition of server consolidation that cloud providers aim to reach in order to improve power efficiency and optimize resource utilization. Therefore, the key factor of successful server consolidation is to minimize performance interference among colocated VMs. In this paper, we are going to reveal the interference issue as well as its major cause, survey existing researchers' visions to detect and/or predict such issue and exhibit a comparative study between them. Then we will reveal some challenging points that require further consideration. Our comparative study may be helpful for people aiming to be involved in cloud environments research field, as it gathers different existing approaches dealing with performance interference detection and prediction in cloud environments.","PeriodicalId":197301,"journal":{"name":"2017 IEEE/ACS 14th International Conference on Computer Systems and Applications (AICCSA)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114699115","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

A New Mammogram Preprocessing Method for Computer-Aided Diagnosis Systems 一种用于计算机辅助诊断系统的乳腺x线图像预处理新方法

2017 IEEE/ACS 14th International Conference on Computer Systems and Applications (AICCSA) Pub Date : 2017-10-01 DOI: 10.1109/AICCSA.2017.40

Ilhame Ait Lbachir, Rachida Es-salhi, I. Daoudi, S. Tallal

引用次数: 11

IoT Security Framework for Smart Water System 智能水系统物联网安全框架

2017 IEEE/ACS 14th International Conference on Computer Systems and Applications (AICCSA) Pub Date : 2017-10-01 DOI: 10.1109/AICCSA.2017.85

J. Pacheco, Daniel Ibarra, Ashamsa Vijay, S. Hariri

{"title":"IoT Security Framework for Smart Water System","authors":"J. Pacheco, Daniel Ibarra, Ashamsa Vijay, S. Hariri","doi":"10.1109/AICCSA.2017.85","DOIUrl":"https://doi.org/10.1109/AICCSA.2017.85","url":null,"abstract":"The Internet of Things (IoT) will connect not only computers and mobile devices, but it will also interconnect smart buildings, homes, and cities. The IoT take advantage of the latest communication technologies in order to provide optimal and reliable services to Smart Cities (SC). The backbone of SC are the Critical Infrastructures such as the city's water system. In SC, the water system benefits from the development of automation and communication technologies to create smart environments which are more efficient in the use of the available resources; we call it Smart Water System (SWS). In this paper we present a multilayer architecture to integrate the SWS to the IoT, making it available from everywhere at any time. However, with the introduction of IoT we will be experiencing grand challenges to secure and protect its advanced information services due to the significant increase of the attack surface, complexity, heterogeneity, and number of interconnected resources. We also introduce an IoT Framework for SWSs to build trustworthy and secure applications and services. The framework enables developers to consider security issues at all IoT layers and integrate security algorithms with the functions and services offered in each layer instead of considering security in an ad-hoc and after thought manner. We show how this framework can be used to develop highly secure and trustworthy SWS services and how to apply our Anomaly Behavior Analysis methodology to secure and protect these services against any type of attacks.","PeriodicalId":197301,"journal":{"name":"2017 IEEE/ACS 14th International Conference on Computer Systems and Applications (AICCSA)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128058969","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

Survivability Analogy for Cloud Computing 云计算的生存能力类比

2017 IEEE/ACS 14th International Conference on Computer Systems and Applications (AICCSA) Pub Date : 2017-10-01 DOI: 10.1109/AICCSA.2017.219

Siyakha N. Mthunzi, E. Benkhelifa

{"title":"Survivability Analogy for Cloud Computing","authors":"Siyakha N. Mthunzi, E. Benkhelifa","doi":"10.1109/AICCSA.2017.219","DOIUrl":"https://doi.org/10.1109/AICCSA.2017.219","url":null,"abstract":"As cloud computing has become the most popular computing platform, and cloud-based applications a commonplace, the methods and mechanisms used to ensure their survivability is increasingly becoming paramount. One of the prevalent trends in recent times is a turn to nature for inspiration in developing and supporting highly survivable environments. This paper aims to address the problems of survivability in cloud environments through inspiration from nature. In particular, the community metaphor in nature’s predator-prey systems where autonomous individuals’ local decisions focus on ensuring the global survival of the community. Thus, we develop analogies for survivability in cloud computing based on a range of mechanisms which we view as key determinants of prey’s survival against predation. For this purpose we investigate some predator-prey systems that will form the basis for our analogical designs. Furthermore, due to a lack of a standardized definition of survivability, we propose a unified definition for survivability, which emphasizes as imperative, a high level of proactiveness to thwart black swan events, as well as high capacity to respond to insecurity in a timely and appropriate manner, inspired by prey’s avoidance and anti-predation approaches.","PeriodicalId":197301,"journal":{"name":"2017 IEEE/ACS 14th International Conference on Computer Systems and Applications (AICCSA)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126731969","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