发布求助
文献互助 智能选刊 最新文献

2014 International Conference on Advanced Networking Distributed Systems and Applications最新文献

筛选
英文 中文
Handling Missing Data Problems with Sampling Methods 用抽样方法处理缺失数据问题
2014 International Conference on Advanced Networking Distributed Systems and Applications Pub Date : 2014-06-17 DOI: 10.1109/INDS.2014.25
Rima Houari, A. Bounceur, A. Tari, M. T. Kecha
{"title":"Handling Missing Data Problems with Sampling Methods","authors":"Rima Houari, A. Bounceur, A. Tari, M. T. Kecha","doi":"10.1109/INDS.2014.25","DOIUrl":"https://doi.org/10.1109/INDS.2014.25","url":null,"abstract":"Missing data cases are a problem in all types of statistical analyses and arise in almost all application domains. Several schemes have been studied in this paper to overcome the drawbacks produced by missing values in data mining tasks, one of the most well known is based on pre processing, formerly known as imputation. In this work, we propose a new multiple imputation approach based on sampling techniques to handle missing values problems, in order to improving the quality and efficiency of data mining process. The proposed method is favourably compared with some imputation techniques and outperforms the existing approaches using an experimental benchmark on a large scale, waveform dataset taken from machine learning repository and different rate of missing values (till 95%).","PeriodicalId":388358,"journal":{"name":"2014 International Conference on Advanced Networking Distributed Systems and Applications","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115204263","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}
引用次数: 20
Inertial Measurement Unit: Evaluation for Indoor Positioning 惯性测量单元:室内定位的评估
2014 International Conference on Advanced Networking Distributed Systems and Applications Pub Date : 2014-06-17 DOI: 10.1109/INDS.2014.12
Dalila Ksentini, A. Elhadi, Noureddine Lasla
{"title":"Inertial Measurement Unit: Evaluation for Indoor Positioning","authors":"Dalila Ksentini, A. Elhadi, Noureddine Lasla","doi":"10.1109/INDS.2014.12","DOIUrl":"https://doi.org/10.1109/INDS.2014.12","url":null,"abstract":"In this paper, we tackle the problem of indoor positioning, where the GPS signals are unavailable and the energy consumption of battery powered mobile devices should be carefully considered during the positioning process. For this purpose, we study the inertial navigation system (INS), which uses only a set of inertial sensors, that represent an Inertial Measurement Unit (IMU), attached to the mobile without referring to any external positioning system. This technique is characterized by its low cost and low energy consumption, while ensuring an effective positioning in indoor environments. The aim of this work is to evaluate the IMU in order to develop an indoor positioning application. A set of tests were made with the accelerometer to examine its accuracy and its use in the process of positioning. The obtained results are encouraging and allowed us to develop an android based positioning application with an acceptable degree of accuracy.","PeriodicalId":388358,"journal":{"name":"2014 International Conference on Advanced Networking Distributed Systems and Applications","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115252136","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 New Term-Term Similarity Measure for Selecting Expansion Features in Big Data 用于在大数据中选择扩展特征的新术语-术语相似性测量方法
2014 International Conference on Advanced Networking Distributed Systems and Applications Pub Date : 2014-06-17 DOI: 10.1109/INDS.2014.23
Ilyes Khennak, H. Drias
{"title":"A New Term-Term Similarity Measure for Selecting Expansion Features in Big Data","authors":"Ilyes Khennak, H. Drias","doi":"10.1109/INDS.2014.23","DOIUrl":"https://doi.org/10.1109/INDS.2014.23","url":null,"abstract":"The massive growth of information and the exponential increase in the number of documents published and uploaded online each day have led to led to the appearance of new words in the Internet. Due to the difficulty of reaching the meanings of these new terms, which play a central role in retrieving the desired information, it becomes necessary to give more importance to the sites and topics where these new words appear, or rather, to give value to the words that occur frequently with them. For this purpose, in this paper, we propose a new term-term similarity measure based on the co-occurrence and closeness of words. It relies on searching for each query feature the locations where it appears, then selecting from these locations the words which often neighbor and co-occur with the query features, and finally used the selected words in the retrieval process. Our experiments were performed using the OHSUMED test collection and show significant performance enhancement over the state-of-the-art.","PeriodicalId":388358,"journal":{"name":"2014 International Conference on Advanced Networking Distributed Systems and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128350649","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
Vectorial Signature for Matching Business Process Graphs 匹配业务流程图的向量签名
2014 International Conference on Advanced Networking Distributed Systems and Applications Pub Date : 2014-06-17 DOI: 10.1109/INDS.2014.24
F. Kacimi, A. Tari
{"title":"Vectorial Signature for Matching Business Process Graphs","authors":"F. Kacimi, A. Tari","doi":"10.1109/INDS.2014.24","DOIUrl":"https://doi.org/10.1109/INDS.2014.24","url":null,"abstract":"With the rapid proliferation of business process model collections, a fast and efficient systems to find process models from hundreds or thousands model is necessary. Similarity search or matching is one aspect needed to manage these collections, which consists to compare process models and select the fitted one to a query model. A graph based approaches for process model matching is very efficient in terms of accuracy. However, the complexity of graph matching algorithms grows exponentially with the size of graphs. In this paper, we propose an approach based on vectorial signatures to compare and evaluate the similarity of process models. To reduce the complexity of matching, we split the process graphs into paths, then calculate their similarity based on the similarity of the different vectorial signatures of their paths. Experimental evaluations show the performance of our approach using the precision and recall measures.","PeriodicalId":388358,"journal":{"name":"2014 International Conference on Advanced Networking Distributed Systems and Applications","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122450025","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
Using Performance Modelling for Self-Healing and Protection in Autonomic Multi-tier Systems 应用性能建模进行自主多层系统的自修复和保护
2014 International Conference on Advanced Networking Distributed Systems and Applications Pub Date : 2014-06-17 DOI: 10.1109/INDS.2014.14
Mehdi Sliem, Nabila Salmi, M. Ioualalen
{"title":"Using Performance Modelling for Self-Healing and Protection in Autonomic Multi-tier Systems","authors":"Mehdi Sliem, Nabila Salmi, M. Ioualalen","doi":"10.1109/INDS.2014.14","DOIUrl":"https://doi.org/10.1109/INDS.2014.14","url":null,"abstract":"We propose, in this paper, a general modelling technique of an autonomic multi-tier system implementing self-healing and self-protection properties. The modelling is based on stochastic Petri nets (SPN). Our objective is to forecast the most appropriate configuration for a multi-tier system and ensure the effectiveness of the autonomic manager. We consider in our modelling an autonomic diagnostic and recovery, with fault tolerance solutions. The diagnostic is directed by the workload intensity, possible attacks and failure frequency. Finally, we illustrate the effectiveness of our modelling through a set of experimental analysis results.","PeriodicalId":388358,"journal":{"name":"2014 International Conference on Advanced Networking Distributed Systems and Applications","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130001221","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
A New Robust Heuristic for Assigning Substrate Network Resources to Virtual Networks 为虚拟网络分配底层网络资源的一种新的鲁棒启发式算法
2014 International Conference on Advanced Networking Distributed Systems and Applications Pub Date : 2014-06-17 DOI: 10.1109/INDS.2014.16
Sarah Kareche, Sylvain Ductor, Z. Guessoum, M. Mezghiche
{"title":"A New Robust Heuristic for Assigning Substrate Network Resources to Virtual Networks","authors":"Sarah Kareche, Sylvain Ductor, Z. Guessoum, M. Mezghiche","doi":"10.1109/INDS.2014.16","DOIUrl":"https://doi.org/10.1109/INDS.2014.16","url":null,"abstract":"Actually used in the Cloud-Computing concept, network virtualization is a promising way to share distant resources, offer multiple services and architectures to multiple heterogeneous Virtual Networks (VNs) on a common Substrate Network (SN). The main challenge in the VN embedding problem is the efficient mapping of virtual nodes and links to the substrate network resources, avoiding network congestion and responding as well to the desired Service Level Agreement (SLA). Faced with this NP-Hard problem, research focused on designing algorithms, processes, and heuristics which had separate node's allocation and links allocation, where the load balancing on the substrate components is not reached. This paper provides a heuristic solution based on A-Star algorithm. The heuristic relies on constraints of both nodes and links, and aims to maintain a load balancing upon the SN. The solution is gradually built following this heuristic function values with the possibility of back-tracking to explore the maximum of solution components before selecting the suitable allocation. To validate the proposed solution, we carry out several experiments and compare our results with some classical result's works.","PeriodicalId":388358,"journal":{"name":"2014 International Conference on Advanced Networking Distributed Systems and Applications","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125443107","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}
引用次数: 5
Statistical Study of Imported APIs by PE Type Malware PE类型恶意软件导入api统计研究
2014 International Conference on Advanced Networking Distributed Systems and Applications Pub Date : 2014-06-17 DOI: 10.1109/INDS.2014.22
Mohamed Belaoued, S. Mazouzi
{"title":"Statistical Study of Imported APIs by PE Type Malware","authors":"Mohamed Belaoued, S. Mazouzi","doi":"10.1109/INDS.2014.22","DOIUrl":"https://doi.org/10.1109/INDS.2014.22","url":null,"abstract":"In this paper we introduce a statistical study which enable us to know which are Windows APIs that are most imported by malware codes. To do that, we have used a given number of infected Portable Executable (PE) files and another number of none infected ones. We used statistical Khi2 test to set if an API is likely used by malware or not. We guess that a given work is necessary and important for behavior-based malware detection, especially which use API importations to analyze PE codes. For experimentation purpose, we have used a large set of PE files extracted from known databases to perform our analysis and establish our conclusions.","PeriodicalId":388358,"journal":{"name":"2014 International Conference on Advanced Networking Distributed Systems and Applications","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124619277","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
Performance Analysis of a Novel Downlink Scheduling Algorithm for LTE Systems 一种新的LTE下行链路调度算法的性能分析
2014 International Conference on Advanced Networking Distributed Systems and Applications Pub Date : 2014-06-17 DOI: 10.1109/INDS.2014.10
M. Escheikh, H. Jouini, Kamel Barkaoui
{"title":"Performance Analysis of a Novel Downlink Scheduling Algorithm for LTE Systems","authors":"M. Escheikh, H. Jouini, Kamel Barkaoui","doi":"10.1109/INDS.2014.10","DOIUrl":"https://doi.org/10.1109/INDS.2014.10","url":null,"abstract":"Integration of efficient scheduling policies in radio resource management (RRM) strategies is nowadays, of a paramount importance for the success deployment of wireless Long Term Evolution (LTE) systems. This is particularly effective for downlink where data rates are important and where scheduling decision should enable to allocate, in each Transmission Time Interval (TTI), appropriate resource blocks (RBs) to each mobile user equipment (UE) taking into account several criteria such as channel quality and fairness requirements. In this paper we propose a novel packet scheduling algorithm developed for downlink LTE systems and we investigate its performances compared to three existing scheduling algorithms i.e. Time and Frequency Domain Round Robin (FDRR) Downlink, Best CQI and MY SCH Not Fair [1]. Performance analysis of these algorithms is investigated by simulation of different scenarios in order to evaluate and compare several metrics such as global cell throughput, achievable user throughput and the number of served users. Numerical results show that the implementation of our new proposed algorithm provides significant improvements of the overall system capacity. The main contribution of this algorithm is to enable a better trade off between throughput and fairness compared to the above algorithms.","PeriodicalId":388358,"journal":{"name":"2014 International Conference on Advanced Networking Distributed Systems and Applications","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126627056","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}
引用次数: 11
C-CP-ABE: Cooperative Ciphertext Policy Attribute-Based Encryption for the Internet of Things C-CP-ABE:基于属性的物联网协同密文策略加密
2014 International Conference on Advanced Networking Distributed Systems and Applications Pub Date : 2014-06-17 DOI: 10.1109/INDS.2014.19
Lyes Touati, Y. Challal, A. Bouabdallah
{"title":"C-CP-ABE: Cooperative Ciphertext Policy Attribute-Based Encryption for the Internet of Things","authors":"Lyes Touati, Y. Challal, A. Bouabdallah","doi":"10.1109/INDS.2014.19","DOIUrl":"https://doi.org/10.1109/INDS.2014.19","url":null,"abstract":"Cipher text Policy Attribute-Based Encryption (CP-ABE) is an extremely powerful asymmetric encryption mechanism, but its complexity and its overhead cannot be neglected in an Internet of Things environment. Indeed, Internet of Things, by its heterogeneous nature, may contains highly resource-constrained devices that are not able to support the heavy overhead due to CP-ABE. Further, constrained devices, like sensors, often need to encrypt data as they are usually led to send sensitive data they collect to more powerful devices like storage servers. This paper proposes a novel approach for employing CP-ABE on highly resource-constrained sensor nodes in the IoT environments. The proposed approach exploits collaboration between heterogeneous nodes, to make feasible the implementation of CP-ABE in an IoT environment, by delegating costly operations to a set of assisting nodes. An analysis is conducted to verify that the proposed solution accomplishes safely and efficiently its objective.","PeriodicalId":388358,"journal":{"name":"2014 International Conference on Advanced Networking Distributed Systems and Applications","volume":"213 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134019938","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}
引用次数: 69
A Parallel Implementation of the Durand-Kerner Algorithm for Polynomial Root-Finding on GPU 基于GPU的多项式寻根Durand-Kerner算法并行实现
2014 International Conference on Advanced Networking Distributed Systems and Applications Pub Date : 2014-06-17 DOI: 10.1109/INDS.2014.17
Kahina Ghidouche, Raphail Couturier, A. Sider
{"title":"A Parallel Implementation of the Durand-Kerner Algorithm for Polynomial Root-Finding on GPU","authors":"Kahina Ghidouche, Raphail Couturier, A. Sider","doi":"10.1109/INDS.2014.17","DOIUrl":"https://doi.org/10.1109/INDS.2014.17","url":null,"abstract":"In this article we present a parallel implementation of the Durand-Kerner algorithm to find roots of polynomials of high degree on a GPU architecture (Graphics Processing Unit). We have implemented both a CPU version in and a GPU compatible version with CUDA. The main result of our work is a parallel implementation that is 10 times as fast as its sequential counterpart on a single CPU for high degree polynomials that is greater than about 48,000.","PeriodicalId":388358,"journal":{"name":"2014 International Conference on Advanced Networking Distributed Systems and Applications","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122379786","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
下一页 尾页
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学术官方微信