2018 International Symposium on Programming and Systems (ISPS)最新文献

An improved QoE estimation method based on QoS and affective computing 一种改进的基于QoS和情感计算的QoE估计方法

2018 International Symposium on Programming and Systems (ISPS) Pub Date : 2018-04-24 DOI: 10.1109/ISPS.2018.8379009

Lamine Amour, Mohamed-Ikbel Boulabiar, Sami Souihi, A. Mellouk

引用次数: 12

Defending against common cyber attacks: Phishing and cross-site scripting 防御常见的网络攻击:网络钓鱼和跨站点脚本

2018 International Symposium on Programming and Systems (ISPS) Pub Date : 2018-04-24 DOI: 10.1109/ISPS.2018.8378960

A. Pathan

{"title":"Defending against common cyber attacks: Phishing and cross-site scripting","authors":"A. Pathan","doi":"10.1109/ISPS.2018.8378960","DOIUrl":"https://doi.org/10.1109/ISPS.2018.8378960","url":null,"abstract":"Social engineering is a very common method of deceiving people in the Cyberspace. Phishing is one of the most common attacks that the social engineers use to trick the users to reveal their confidential information. While various types of security schemes and Intrusion Detection Systems (IDSs) may be employed to mitigate other types of cyber-attacks, phishing cannot be thwarted only by using those, even if the techniques are sophisticated. This is because, often the human mistakes are involved in the process of leakage of confidential data and information. Hence, awareness of the issue and controlled cyber behavior would be key to defending against phishing type attack. Another cyber-attack, Cross-Site Scripting (XSS) could also be tackled efficiently by using some Content Security Policy (CSP) which would work alongside the traditionally used security and defense mechanisms. The purpose of this talk is to share some research findings in these and relevant areas. Also, some information would be shared for the general readers of the topic. We would like to explore how the major portion of these types of attacks could be thwarted or mitigated just by observing some precautions while interacting in the Cyberspace.","PeriodicalId":294761,"journal":{"name":"2018 International Symposium on Programming and Systems (ISPS)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126871780","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

Alliance based approach for reducing saturation and congestion in VANETs 基于联盟的减少VANETs饱和和拥塞的方法

2018 International Symposium on Programming and Systems (ISPS) Pub Date : 2018-04-24 DOI: 10.1109/ISPS.2018.8379003

Kahina Ouazine, Hachem Slimani, Hassina Nacer, Jugurta Oudia, Nadira Maouche

{"title":"Alliance based approach for reducing saturation and congestion in VANETs","authors":"Kahina Ouazine, Hachem Slimani, Hassina Nacer, Jugurta Oudia, Nadira Maouche","doi":"10.1109/ISPS.2018.8379003","DOIUrl":"https://doi.org/10.1109/ISPS.2018.8379003","url":null,"abstract":"Vehicular Ad hoc Networks (VANETs) have received special attention from scientists because of their importance in daily life. In VANETs, we mainly find fixed entities (Road Side Units “RSUs”) and mobile entities (vehicles). In order to exchange information and data relating to the safety and comfort of road users, these different entities must establish communications between them. In these communications, one of the main problems is related to congestion and saturation of RSUs. To solve this problem, we propose in this paper a new approach of cooperation between the RSUs of a VANET in order to reduce its congestion and thus to avoid as much as possible the saturation of these RSUs. This approach, called “D2A2RS” (Defensive Alliance based Approach for Reducing RSUs Saturation), is based on the concept of defensive alliances in graphs that ensures efficient collaboration between the RSUs. Furthermore, we propose two analytical models based on Markov chains to compare our D2A2RS protocol with a concurrent protocol (IAGR). The obtained comparaison results have shown the efficiency and the performance of our approach in terms of packet loss.","PeriodicalId":294761,"journal":{"name":"2018 International Symposium on Programming and Systems (ISPS)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126165002","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

Identity theft on e-government/e-governance & digital forensics 电子政务/电子治理和数字取证中的身份盗窃

2018 International Symposium on Programming and Systems (ISPS) Pub Date : 2018-04-24 DOI: 10.1109/ISPS.2018.8378961

Ameer Al-Nemrat

{"title":"Identity theft on e-government/e-governance & digital forensics","authors":"Ameer Al-Nemrat","doi":"10.1109/ISPS.2018.8378961","DOIUrl":"https://doi.org/10.1109/ISPS.2018.8378961","url":null,"abstract":"In the context of the rapid technological progress, the cyber-threats become a serious challenge that requires immediate and continuous action. As cybercrime poses a permanent and increasing threat, governments, corporate and individual users of the cyber-space are constantly struggling to ensure an acceptable level of security over their assets. Maliciousness on the cyber-space spans identity theft, fraud, and system intrusions. This is due to the benefits of cyberspace-low entry barriers, user anonymity, and spatial and temporal separation between users, make it a fertile field for deception and fraud. Numerous, supervised and unsupervised, techniques have been proposed and used to identify fraudulent transactions and activities that deviate from regular patterns of behaviour. For instance, neural networks and genetic algorithms were used to detect credit card fraud in a dataset covering 13 months and 50 million credit card transactions. Unsupervised methods, such as clustering analysis, have been used to identify financial fraud or to filter fake online product reviews and ratings on e-commerce websites. Blockchain technology has demonstrated its feasibility and relevance in e-commerce. Its use is now being extended to new areas, related to electronic government. The technology appears to be the most appropriate in areas that require storage and processing of large amounts of protected data. The question is what can blockchain technology do and not do to fight malicious online activity?","PeriodicalId":294761,"journal":{"name":"2018 International Symposium on Programming and Systems (ISPS)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114967703","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

Depth estimation from a single 2D image 从单个2D图像进行深度估计

2018 International Symposium on Programming and Systems (ISPS) Pub Date : 2018-04-01 DOI: 10.1109/ISPS.2018.8379021

Naoual El-Djouher Mebtouche, Abdelkrim Boumahdi, N. Baha

引用次数: 4

Maximizing profit in cloud computing using M/G/c/k queuing model 基于M/G/c/k排队模型的云计算利润最大化

2018 International Symposium on Programming and Systems (ISPS) Pub Date : 2018-04-01 DOI: 10.1109/ISPS.2018.8379008

Assia Outamazirt, Kamel Barkaoui, D. Aïssani

{"title":"Maximizing profit in cloud computing using M/G/c/k queuing model","authors":"Assia Outamazirt, Kamel Barkaoui, D. Aïssani","doi":"10.1109/ISPS.2018.8379008","DOIUrl":"https://doi.org/10.1109/ISPS.2018.8379008","url":null,"abstract":"The economics of cloud computing is more and more a crucial issue. To maximize the profit, a service provider should understand both service charges and business costs, and how they are determined by the characteristics of the applications and the configuration of a multiserver system. In this work, we treat a multiserver system as an M/G/c/k queuing model with impatient customers, such that our optimization problem can be formulated and solved. There are no analytical formulas to calculate performance measures of M/G/c/k queue. Therefore, we provide new analytical formulas to compute the mean waiting time of new service request arrival to the system and the delay probability, i.e., the probability that a newly submitted service request must wait because all servers are busy. We focus on the calculation of these latter, because our performance metric in this work is the task waiting time. Then, expected revenue of a service provider is calculated. Numerical calculations of the optimal server size and the optimal server speed are demonstrated. Finally, the expected profit in one unit of time for a cloud provider is obtained.","PeriodicalId":294761,"journal":{"name":"2018 International Symposium on Programming and Systems (ISPS)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114118504","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

Verifiable outsourced computation integrity in cloud-assisted big data processing 云辅助大数据处理中的可验证外包计算完整性

2018 International Symposium on Programming and Systems (ISPS) Pub Date : 2018-04-01 DOI: 10.1109/ISPS.2018.8379019

Bouleghlimat Imene, Hacini Salima

引用次数: 2

OL-BaS: Efficient data load-balancing for skewed data with approximate load statistics ol -ba:使用近似负载统计数据对倾斜数据进行有效的数据负载平衡

2018 International Symposium on Programming and Systems (ISPS) Pub Date : 2018-04-01 DOI: 10.1109/ISPS.2018.8379005

Djahida Belayadi, Khaled-Walid Hidouci, Khadidja Midoun

{"title":"OL-BaS: Efficient data load-balancing for skewed data with approximate load statistics","authors":"Djahida Belayadi, Khaled-Walid Hidouci, Khadidja Midoun","doi":"10.1109/ISPS.2018.8379005","DOIUrl":"https://doi.org/10.1109/ISPS.2018.8379005","url":null,"abstract":"Data skew can significantly deteriorate query performance in distributed systems. More concretely, when the data is range partitioned, usually it may be unequally distributed across the partitions. When tuples are inserted and deleted continuously, some of these data shall be moved from the hot nodes to the least loaded ones in order to satisfy the storage balance requirement. These movements have an important impact in terms of maintaining the load statistics related to each node, such as the partition boundaries and the load size. Efficient solutions from the state-of-art that address the data skew problem require global load statistics with a cost of O(log n) messages. In this paper, we propose an efficient online load-balancing algorithm for the range-partitioned data. Our solution is based on the fuzzy image (FZIM) concept. The basic idea about the FZIM is that both clients and nodes have an approximate knowledge about the effective partition statistics. They can nevertheless locate any data with almost the same efficiency as using exact partition statistics. Furthermore, maintaining load distribution statistics do not require exchanging additional messages as opposed to the cost of efficient solutions from the state-of-art (which requires at least O(log n) messages).","PeriodicalId":294761,"journal":{"name":"2018 International Symposium on Programming and Systems (ISPS)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131119667","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

Lévy walk-based search strategy: Application to destructive foraging 基于lsamvy步行的搜索策略:在破坏性觅食中的应用

2018 International Symposium on Programming and Systems (ISPS) Pub Date : 2018-04-01 DOI: 10.1109/ISPS.2018.8379010

Ouarda Zedadra, Meysa Idiri, Nicolas Jouandeau, Hamid Seridi, G. Fortino

引用次数: 3

Adaptive content based image retrieval based on RICE algorithm selection model 基于RICE算法选择模型的自适应内容图像检索

2018 International Symposium on Programming and Systems (ISPS) Pub Date : 2018-04-01 DOI: 10.1109/ISPS.2018.8379022

Safa Hamreras, Bachir Boucheham

引用次数: 2