International Conference on Network, Communication and Computing最新文献

Two Step Clustering Model for K-Means Algorithm K-Means算法的两步聚类模型

International Conference on Network, Communication and Computing Pub Date : 2016-12-17 DOI: 10.1145/3033288.3033347

Narongsak Chayangkoon, A. Srivihok

{"title":"Two Step Clustering Model for K-Means Algorithm","authors":"Narongsak Chayangkoon, A. Srivihok","doi":"10.1145/3033288.3033347","DOIUrl":"https://doi.org/10.1145/3033288.3033347","url":null,"abstract":"In this paper, we propose Two Step Clustering Model for finding the number of clusters for K-Means Algorithm. The Hybrid Model solves the weakness of K-Means Algorithm especially for the general users who will try to find the number of the clusters for cluster analysis by K-Means Algorithm. In this research, we solve the problem by proposing a Hybrid Model. In the experiment, we used 10 datasets from UCI machine learning repository. In addition, for feature selection we used three algorithms. The first used Best First Search and Correction --Based Feature Subset Selection. The second used Ranker and Principal Component Analysis. The third used Best First Search and Wrapper Subset Evaluator, classification used Naïve Bayes Classifier. The determinants of the baseline model didn't use the searching method and feature selection. Moreover, we compared the performance of three algorithms for finding the k value. For the first we used EM, for the second, we used Cascade K-Means, and for the third, we used Canopy. We also evaluated performance testing of the Hybrid Model and we compared the criterion clustering by using the Sum of Squared Errors. Thus, our Hybrid Model includes searching used Ranker, the evaluator uses Principal Component Analysis. For clustering, Expectation Maximization for finding the number of clusters and the cluster analysis uses simple K-mean. Furthermore, our experimental results showed the best Hybrid Model approach achieves a higher performance that the algorithms available in our Hybrid Model had the lowest Sum of Squared Errors.","PeriodicalId":253625,"journal":{"name":"International Conference on Network, Communication and Computing","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116960832","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

Length-bounded Hybrid CPU/GPU Pattern Matching Algorithm for Deep Packet Inspection 深度包检测的CPU/GPU混合模式匹配算法

International Conference on Network, Communication and Computing Pub Date : 2016-12-17 DOI: 10.1145/3033288.3033346

Yi-Shan Lin, Chun-Liang Lee, Yaw-Chung Chen

{"title":"Length-bounded Hybrid CPU/GPU Pattern Matching Algorithm for Deep Packet Inspection","authors":"Yi-Shan Lin, Chun-Liang Lee, Yaw-Chung Chen","doi":"10.1145/3033288.3033346","DOIUrl":"https://doi.org/10.1145/3033288.3033346","url":null,"abstract":"Since frequent communication between the applications took place in high speed networks, deep packet inspection (DPI) plays an important role to the network application awareness. The signature-based network intrusion detection system (NIDS) contains the DPI technique that examines the incoming packet payloads by employing the pattern matching algorithm, which dominates the overall inspection performance. Existing studies focused on implementing efficient pattern matching algorithms by parallel programming on software platform because of the advantages of lower cost and higher scalability. Either the central processing unit (CPU) or the graphic processing unit (GPU) was involved. Our studies focused on designing a pattern matching algorithm based on the cooperation between both CPU and GPU. In this paper, we present an enhanced design for our previous work and introduce this novel method, a length-bounded hybrid CPU/GPU pattern matching algorithm (LHPMA). In the preliminary experiment, the performance and comparison with the previous work are displayed, and the results show that the LHPMA achieves higher throughput than other tested algorithms.","PeriodicalId":253625,"journal":{"name":"International Conference on Network, Communication and Computing","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127099729","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}

引用次数: 13

A Receiver-Initiated Big Slot Scheduling MAC Protocol for Reducing Collision in Wireless Sensor Networks 一种用于减少无线传感器网络碰撞的接收方发起的大槽调度MAC协议

International Conference on Network, Communication and Computing Pub Date : 2016-12-17 DOI: 10.1145/3033288.3033342

Zhenqiang Wei, H. Oh

{"title":"A Receiver-Initiated Big Slot Scheduling MAC Protocol for Reducing Collision in Wireless Sensor Networks","authors":"Zhenqiang Wei, H. Oh","doi":"10.1145/3033288.3033342","DOIUrl":"https://doi.org/10.1145/3033288.3033342","url":null,"abstract":"Two basic requirements in designing a MAC protocol for industrial wireless sensor networks (IWSNs) include the timeliness and the reliability of data transmission. For the former, the protocols in general rely on the use of TDMA. For the latter, they have to take into account various interfering factors existent in environment. One approach uses CSMA/CA in data transmission in which a sender acquires a channel using some control messages before sending data and then the receiver replies with an acknowledgement message for the successful reception, while guaranteeing the timeless of data transmission using TDMA. Since the size of control message is relatively big when considering the small size of data in WSNs, it is desirable to reduce the number of control messages. Thus, a receiver-initiated data transmission method is proposed to reduce the number of control messages as well as the number of competing nodes. Since the receiver-initiated approach works well when data transmission can be predicted, it is applied to the BigMAC protocol that uses a level-order transmission in a tree topology. Simulation results indicate that the proposed technique contributes to improving reliability clearly and reducing one round of data gathering time, leading to the reduced energy consumption.","PeriodicalId":253625,"journal":{"name":"International Conference on Network, Communication and Computing","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127775701","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

Throughput Performance Evaluation on Wired and Wireless Network Cooperation Quick Recovery System Employing IEEE 802.11 DCF 基于IEEE 802.11 DCF的有线与无线网络协同快速恢复系统吞吐量性能评估

International Conference on Network, Communication and Computing Pub Date : 2016-12-17 DOI: 10.1145/3033288.3033334

K. Maruta, Yu Nakayama, T. Tsutsumi

引用次数: 3

Data-Space Relocation to Improve Data Cache Performance for Embedded Multi-threaded Processor Systems 提高嵌入式多线程处理器系统数据缓存性能的数据空间重定位

International Conference on Network, Communication and Computing Pub Date : 2016-12-17 DOI: 10.1145/3033288.3033335

M. Wickramasinghe, Hui Guo

引用次数: 0

Ontology-Based Knowledge Management System Model for R3ST Software Maintenance Environment 基于本体的R3ST软件维护环境知识管理系统模型

International Conference on Network, Communication and Computing Pub Date : 2016-12-17 DOI: 10.1145/3033288.3033340

E. K. Budiardjo, E. M. Zamzami, Ganjar Ramadhan, Muh. Nur Musa

引用次数: 1

A New Modeling Approach using Genetic Algorithm for Transmission Performance Estimation in Complex Environment 基于遗传算法的复杂环境下传输性能估计建模新方法

International Conference on Network, Communication and Computing Pub Date : 2016-12-17 DOI: 10.1145/3033288.3033294

Qian Cui, K. Shuang

引用次数: 1

Generating Test Cases from UML Activity Diagram Based on Business Flow Constraints 基于业务流约束从UML活动图生成测试用例

International Conference on Network, Communication and Computing Pub Date : 2016-12-17 DOI: 10.1145/3033288.3033311

Walaithip Thanakorncharuwit, Suwatchai Kamonsantiroj, Luepol Pipanmaekaporn

引用次数: 10

Target Discovery: Using MUSIC with Optimized Angle-of-Arrival and Signal-Time-of-Flight 目标发现:使用音乐与优化的到达角和信号飞行时间

International Conference on Network, Communication and Computing Pub Date : 2016-12-17 DOI: 10.1145/3033288.3033333

A. Akbar, Zhuchuang Shao, Dong Wang

引用次数: 0

Query-Directed Probing LSH for Cosine Similarity 余弦相似度的查询定向探测LSH

International Conference on Network, Communication and Computing Pub Date : 2016-12-17 DOI: 10.1145/3033288.3033318

Shengyingjie Liu, Jianwen Sun, Zhi Liu, Xian Peng, Sanya Liu

{"title":"Query-Directed Probing LSH for Cosine Similarity","authors":"Shengyingjie Liu, Jianwen Sun, Zhi Liu, Xian Peng, Sanya Liu","doi":"10.1145/3033288.3033318","DOIUrl":"https://doi.org/10.1145/3033288.3033318","url":null,"abstract":"Locality-sensitive hashing (LSH) considered as an efficient algorithm for large-scale similarity search has become increasingly popular. Recently, many of its variants have been applied widely in high-dimensional similarity search. To overcome the drawback of requirement for a large number of hash tables, researchers proposed the famous Multi-Probe LSH (MP-LSH). It has been used to improve the utilization of hash tables. There are two major probing sequences mentioned in MP-LSH, i.e., Step-Wise Probing (SWP) sequence and Query-Directed Probing (QDP) sequence. It is verified that QDP sequence is better than SWP sequence in number of probes and query time. However, the proposed QDP sequence is based on the E2LSH. It means that the method is only adopted for Euclidean distance. For cosine similarity, SWP sequence is still the only feasible method to perform Multi-Probe LSH.\u0000 This paper proposes an approach based on QDP sequence for cosine similarity search. Moreover, we give a set of complete theories and the corresponding proof for our method. Several experiments are performed on two types of open data sets. The experiments demonstrate our algorithm requires a small amount of probes and less time to achieve a high query quality than SWP sequence for cosine similarity.","PeriodicalId":253625,"journal":{"name":"International Conference on Network, Communication and Computing","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127446522","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