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

2018 3rd International Conference on Computer and Communication Systems (ICCCS)最新文献

筛选
英文 中文
Feature-Selection-Based Ransomware Detection with Machine Learning of Data Analysis 基于特征选择的勒索软件检测与数据分析的机器学习
2018 3rd International Conference on Computer and Communication Systems (ICCCS) Pub Date : 2018-04-27 DOI: 10.1109/CCOMS.2018.8463300
Yu-Lun Wan, Jen-Chun Chang, Rong-Jaye Chen, Shiuh-Jeng Wang
{"title":"Feature-Selection-Based Ransomware Detection with Machine Learning of Data Analysis","authors":"Yu-Lun Wan, Jen-Chun Chang, Rong-Jaye Chen, Shiuh-Jeng Wang","doi":"10.1109/CCOMS.2018.8463300","DOIUrl":"https://doi.org/10.1109/CCOMS.2018.8463300","url":null,"abstract":"Ransomwares are continuously produced in underground markets such that increasingly high-level and sophisticated ransomwares are spreading all over the world, significantly affecting individuals, businesses, governments, and countries. To prevent large-scale attacks, most companies buy intrusion detection systems to alert regarding any abnormal network behavior. However, they cannot be detected using conventional signature-based detection even though ransomwares belong to the same family. In this study, a method is provided to develop a network intrusion detection model that is based on big data technology. The system uses Argus for packet preprocessing, merging, and labeling the known malicious data. A concept of Biflow was proposed to replace the packet data. Further, we observe that the data size is reduced to 1000: 1. Additionally, the characteristics of a complete traffic are obtained. Six feature selection algorithms were combined to achieve a better accuracy in terms of classification. Finally, the decision tree model of the supervised machine learning was used to enhance the performance of intrusion detection system.","PeriodicalId":405664,"journal":{"name":"2018 3rd International Conference on Computer and Communication Systems (ICCCS)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133430713","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}
引用次数: 18
A Blockchain-Based Energy Trading Platform for Smart Homes in a Microgrid 基于区块链的微电网智能家居能源交易平台
2018 3rd International Conference on Computer and Communication Systems (ICCCS) Pub Date : 2018-04-27 DOI: 10.1109/CCOMS.2018.8463317
E. Kang, Seung Jae Pee, J. Song, J. Jang
{"title":"A Blockchain-Based Energy Trading Platform for Smart Homes in a Microgrid","authors":"E. Kang, Seung Jae Pee, J. Song, J. Jang","doi":"10.1109/CCOMS.2018.8463317","DOIUrl":"https://doi.org/10.1109/CCOMS.2018.8463317","url":null,"abstract":"The MicroGrid., as the need for renewable energy emerges, are becoming essential, renewable energy trading platforms are being developed and established in the microgrid. With the proliferation of technologies such as Smart home based of Internet of Things, interconnected networks, and Blockchain, microgrid has introduced a variety of applications and innovative solutions for efficient system maintenance. This paper, in a blockchain-based smart home, it is impossible to forge data called transaction generated by using blockchain. With this unforgeable transactions, home miner that centrally processes all the transactions generated in smart home know information about energy. Based on this information, we proposes renewable energy trading platform using ethereum's smart contract to ensure secure energy trading run automatically without the third party intervention in a microgrid.","PeriodicalId":405664,"journal":{"name":"2018 3rd International Conference on Computer and Communication Systems (ICCCS)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124824238","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}
引用次数: 67
Secured and High Performance Distributed Big Data Storage in Cloud Systems 云系统中的安全高性能分布式大数据存储
2018 3rd International Conference on Computer and Communication Systems (ICCCS) Pub Date : 2018-04-27 DOI: 10.1109/CCOMS.2018.8463340
Delwar Hossain, Muhammad Abdullah Adnan
{"title":"Secured and High Performance Distributed Big Data Storage in Cloud Systems","authors":"Delwar Hossain, Muhammad Abdullah Adnan","doi":"10.1109/CCOMS.2018.8463340","DOIUrl":"https://doi.org/10.1109/CCOMS.2018.8463340","url":null,"abstract":"Big Data Security and privacy are key concerns for cloud computing. At the initial stage, security was not considered for processing Big Data because of insufficient research and adequate security technology. Now researchers have to think new ways for cloud storage and Big Data security to overcome exiting security challenges of Big Data storage. For rapid Big Data processing, encryption is often considered as a big obstacle as clear data processing is much faster than encrypted data. But for cloud system, encrypted data processing is not a big deal because of massive processing power of cloud systems. So encryption will not be an obstacle and degrade the performance to process encrypted Big Data at cloud. There is a big challenge now to store and provide security in small chunk in cloud system and also key management. This paper provides novel approach for Big Data security over cloud namely Secured and High Performance Distributed Big Data Storage (SH-DBDS) model. Data will be split and uploaded for distributed cloud storage system. Single split data will be worthless until and unless joined with the other parts of the data. In this paper, an algorithm has been provided to split and join the data. Experimentation is performed with different data sets (10MB-1GB) at local system and AWS cloud and performance is measured. Evaluation is done considering the security and performance of Big Data.","PeriodicalId":405664,"journal":{"name":"2018 3rd International Conference on Computer and Communication Systems (ICCCS)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125881996","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
Data Hiding Using Multi-Pixel Difference Expansion 使用多像素差分扩展的数据隐藏
2018 3rd International Conference on Computer and Communication Systems (ICCCS) Pub Date : 2018-04-27 DOI: 10.1109/CCOMS.2018.8463244
Chin-Feng Lee, Jau Ji Shen, Yu Hua Lai
{"title":"Data Hiding Using Multi-Pixel Difference Expansion","authors":"Chin-Feng Lee, Jau Ji Shen, Yu Hua Lai","doi":"10.1109/CCOMS.2018.8463244","DOIUrl":"https://doi.org/10.1109/CCOMS.2018.8463244","url":null,"abstract":"This paper proposed a reversible multiple layer data hiding to improve the method proposed by Arham et al. Using the relevance of pixels to modify the block size and change the scan mode can enhance image embedded capacity so that the maximum embedding amount of the original block was increased from 3 bits to 8 bits. For multiple-layer embedding, we modified the multiple-layer embedding method proposed by Alattar by changing the quad permutations for recursive embedding to nine permutations to avoid the distortion and overflow/underflow. The experimental results showed that our method achieves higher hiding capacity and better image quality for stego-images.","PeriodicalId":405664,"journal":{"name":"2018 3rd International Conference on Computer and Communication Systems (ICCCS)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127680287","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}
引用次数: 12
A Study on the Optimization Algorithm for Solving the Supermarket Shopping Path Problem 求解超市购物路径问题的优化算法研究
2018 3rd International Conference on Computer and Communication Systems (ICCCS) Pub Date : 2018-04-27 DOI: 10.1109/CCOMS.2018.8463247
Jakkrit Kaewyotha, Wararat Songpan
{"title":"A Study on the Optimization Algorithm for Solving the Supermarket Shopping Path Problem","authors":"Jakkrit Kaewyotha, Wararat Songpan","doi":"10.1109/CCOMS.2018.8463247","DOIUrl":"https://doi.org/10.1109/CCOMS.2018.8463247","url":null,"abstract":"Finding shopping path is a key of solving customers who make decision to purchase items and spend time to shopping. The problem of store layout is the length of path for how long a customer walks around in the store. This paper studies the optimization algorithm to apply for solving the supermarket shopping path problem which comparison the popular optimization algorithms which are Genetic algorithm (GA) and Simulated Annealing (SA). The experimental result shows GA has been suitable in solving shopping path both of supermarket where have the single entry-exit door or single entry and multi-exit door. In addition, the processing time of GA is better than SA. The contribution of this study has been discovered as and effective optimization method in evaluating the shopping path for supermarket and consideration the item to allocate shelve planning.","PeriodicalId":405664,"journal":{"name":"2018 3rd International Conference on Computer and Communication Systems (ICCCS)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115489524","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
A New Hybrid Sampling Approach for Classification of Imbalanced Datasets 一种新的混合抽样方法用于不平衡数据集分类
2018 3rd International Conference on Computer and Communication Systems (ICCCS) Pub Date : 2018-04-27 DOI: 10.1109/CCOMS.2018.8463228
Anantaporn Hanskunatai
{"title":"A New Hybrid Sampling Approach for Classification of Imbalanced Datasets","authors":"Anantaporn Hanskunatai","doi":"10.1109/CCOMS.2018.8463228","DOIUrl":"https://doi.org/10.1109/CCOMS.2018.8463228","url":null,"abstract":"Nowadays it is an era of data driven. Many organizations around the world including bank, industry, commercial, and medical intend to extract knowledge from a huge of data. But in the real-word datasets, most of them occur class imbalance problems. This paper presents a new algorithm to handle an imbalanced classification. The proposed technique is a hybrid sampling approach which is the combination of a well know oversampling algorithm called SMOTE and the undersampling technique by removing the ambiguous instances from the majority class instances. The experimental results show that the new hybrid sampling method yields the better predictive performance in term of F-measure when compare with other sampling techniques. In addition, it can improve f-measure up to 59.73% and 412.26% when compare with the original dataset based on decision tree learning and naïve bayes classifiers respectively.","PeriodicalId":405664,"journal":{"name":"2018 3rd International Conference on Computer and Communication Systems (ICCCS)","volume":"149 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116731842","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}
引用次数: 12
The Probability Density Function for Network Coding with Three Input Flows 三输入流网络编码的概率密度函数
2018 3rd International Conference on Computer and Communication Systems (ICCCS) Pub Date : 2018-04-27 DOI: 10.1109/CCOMS.2018.8463313
Xiangrong Liu, Yaping Liang, Qing Chang, Xianxu Li
{"title":"The Probability Density Function for Network Coding with Three Input Flows","authors":"Xiangrong Liu, Yaping Liang, Qing Chang, Xianxu Li","doi":"10.1109/CCOMS.2018.8463313","DOIUrl":"https://doi.org/10.1109/CCOMS.2018.8463313","url":null,"abstract":"Now many researches have been studying the optimization between throughput/energy consuming and delay with a couple of independent input flows in network coding (NC). However, the implementation of network coding (NC) requires a thorough investigation of its impact on relevant queueing systems which little work focuses on. In this paper, the scenario with three independent Poisson input flows based on our previous work about the pdf with two independent Poisson input flows., and one output flow is considered. The asynchronous NC-based strategy is that a new arrival evicts a head packet holding in its queue when waiting for another packet from the other flow to encode. The three flows are divided into two parts for getting the probability density function (pdf) of the output flow. The pdf for the output flow which contains both coded and uncoded packets is derived. Besides, the statistic characteristics of this strategy are analyzed. These results are verified by numerical simulations.","PeriodicalId":405664,"journal":{"name":"2018 3rd International Conference on Computer and Communication Systems (ICCCS)","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115332401","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
Modeling and Forecasting Http Requests-Based Cloud Workloads Using Autoregressive Artificial Neural Networks 使用自回归人工神经网络对基于 Http 请求的云计算工作量进行建模和预测
2018 3rd International Conference on Computer and Communication Systems (ICCCS) Pub Date : 2018-04-27 DOI: 10.1109/CCOMS.2018.8463336
Yang Syu, Chien-Min Wang
{"title":"Modeling and Forecasting Http Requests-Based Cloud Workloads Using Autoregressive Artificial Neural Networks","authors":"Yang Syu, Chien-Min Wang","doi":"10.1109/CCOMS.2018.8463336","DOIUrl":"https://doi.org/10.1109/CCOMS.2018.8463336","url":null,"abstract":"For the proactive scalability/elasticity of a cloud computing platform, cloud workload forecasting is a key issue and has been studied by using conventional time series (TS) methods, such as autoregressive integrated moving average (ARIMA) models. In this paper, to modeling and forecasting http requests-based cloud workloads, we propose using autoregressive artificial neural networks (autoregressive ANNs), which are a machine learning (ML) technique widely used in diverse research problems and practical applications. Based on our empirical evaluation, compared with other representative TS methods and ML techniques, the proposed approach can achieve highest accuracy and stability for the addressed problem although it also consumes slightly more time to yield a predictor.","PeriodicalId":405664,"journal":{"name":"2018 3rd International Conference on Computer and Communication Systems (ICCCS)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127624244","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
Improvement of Partitioning and Merging Phase in Chameleon Clustering Algorithm 变色龙聚类算法中划分和合并阶段的改进
2018 3rd International Conference on Computer and Communication Systems (ICCCS) Pub Date : 2018-04-27 DOI: 10.1109/CCOMS.2018.8463288
Yuxin Dong, Ye Wang, Kai Jiang
{"title":"Improvement of Partitioning and Merging Phase in Chameleon Clustering Algorithm","authors":"Yuxin Dong, Ye Wang, Kai Jiang","doi":"10.1109/CCOMS.2018.8463288","DOIUrl":"https://doi.org/10.1109/CCOMS.2018.8463288","url":null,"abstract":"In view of the Chameleon algorithm is used to work with rough version hMetic library to partition the graph, each run may be slightly different as a result, difficulties in selecting the parameters of the merging phase, and similarity measure did not completely evaluate the similarity between clusters by density, the Chameleon algorithm which does not need human intervention is proposed. By introducing the recursive dichotomy, flood fill method and the quotient ϒ of cluster density on the traditional Chameleon proposed an improved scheme, also put forward a cutoff method that automatically selects the best clustering result from a modified chameleon dendrogram. Experimental results on artificial datasets and real datasets show that the Chameleon algorithm proposed in this paper has a good performance in NMI evaluation criteria, clustering accuracy and running time.","PeriodicalId":405664,"journal":{"name":"2018 3rd International Conference on Computer and Communication Systems (ICCCS)","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127736759","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
Sleep Stage Identification Using the Combination of ELM and PSO Based on ECG Signal and HRV 基于心电信号和心率波动的ELM与PSO相结合的睡眠阶段识别
2018 3rd International Conference on Computer and Communication Systems (ICCCS) Pub Date : 2018-04-27 DOI: 10.1109/CCOMS.2018.8463307
Tri Fennia Lesmana, S. M. Isa, N. Surantha
{"title":"Sleep Stage Identification Using the Combination of ELM and PSO Based on ECG Signal and HRV","authors":"Tri Fennia Lesmana, S. M. Isa, N. Surantha","doi":"10.1109/CCOMS.2018.8463307","DOIUrl":"https://doi.org/10.1109/CCOMS.2018.8463307","url":null,"abstract":"The aim of this research was to build a classification model with an optimal accuracy to identify human sleep stages using Heart Rate Variability (HRV) features based on Electrocardiogram (ECG) signal. The proposed method is the combination of Extreme Learning Machine (ELM) and Particle Swarm Optimization (PSO) for feature selection and hidden node number determination. The combination of ELM and PSO produces mean of testing accuracy of 82.1 %, 76.77%, 71.52 %, and 62.66% for 2, 3, 4, and 6 number of classes respectively. This paper also provides comparison to ELM and Support Vector Machine (SVM) methods whose testing accuracy is lower than the combination of ELM and PSO. Based on the results, can be concluded that the addition of PSO method is able to increase classification performance.","PeriodicalId":405664,"journal":{"name":"2018 3rd International Conference on Computer and Communication Systems (ICCCS)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131056015","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}
引用次数: 12
首页 上一页 下一页 尾页
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学术文献互助群
群 号：604180095
Book学术官方微信