2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)最新文献_第4页

On the Effectiveness of Extracting Important Words from Proxy Logs 从代理日志中提取重要词的有效性研究

2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW) Pub Date : 2018-11-01 DOI: 10.1109/CANDARW.2018.00084

M. Mimura

{"title":"On the Effectiveness of Extracting Important Words from Proxy Logs","authors":"M. Mimura","doi":"10.1109/CANDARW.2018.00084","DOIUrl":"https://doi.org/10.1109/CANDARW.2018.00084","url":null,"abstract":"Modern http-based malware imitates benign traffic to evade detection. To detect unseen malicious traffic, many methods using machine learning techniques have been proposed. These methods took advantage of the characteristic of malicious traffic, and usually require additional parameters which are not obtained from essential security devices such as a proxy server or IDS (Intrusion Detection System). Thus, most previous methods are not applicable to actual information systems. To tackle a realistic threat, a linguistic-based detection method for proxy logs has been proposed. This method extracts words as feature vectors automatically with natural language techniques, and discriminates between benign traffic and malicious traffic. The previous method generates a corpus from the whole extracted words which contain trivial words. To generate discriminative feature representation, a corpus has to be effectively summarized. This paper extracts important words from proxy logs to summarize the corpus. To define the word importance score, this paper uses term frequency and document frequency. Our method summarizes the corpus and improves the detection rate. We conducted cross-validation and timeline analysis with captured pcap files from Exploit Kit (EK) between 2014 and 2016. The experimental result shows that our method improves the accuracy. The best F-measure achieves 1.00 in the cross-validation and timeline analysis.","PeriodicalId":329439,"journal":{"name":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126663801","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

Fault Tolerance of Small World Network Architecture 小世界网络架构的容错性

2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW) Pub Date : 2018-11-01 DOI: 10.1109/CANDARW.2018.00070

H. Mori

{"title":"Fault Tolerance of Small World Network Architecture","authors":"H. Mori","doi":"10.1109/CANDARW.2018.00070","DOIUrl":"https://doi.org/10.1109/CANDARW.2018.00070","url":null,"abstract":"The most important elements in a massive VLSI parallel network are the component of networks. The key in the network is to execute the communication between a lot of nodes faultlessly while securing the scalability. Small World Network is a network which allows communication between two arbitrary nodes where hopping over a small number of nodes is possible, in a network with a huge number of nodes. Each connection path is selected as follows: The first node in the sequence is selected by a random number system by the node, under some constraints, such as choosing the smallest average passing length, or having a large clustering coefficient. There are a lot of examples of the small world network in action today, such as the neuronal connection, the metabolic pathway, social networks, and airline routes. A feature of small-world networks is that average path length is small. Thus the small-world network falls between regular and random networks. We introduced a parallel VLSI architecture featuring a random connection in Small World Network. The lower blocks are used for computation and the upper block is used for connection between every lower block. Both the upper block and lower blocks are randomly rewired using small world connection to get the shortest paths between all node pairs. In general, a link fault might negatively affect network dependability such as the no. of faulty network components, and also negatively affect network scalability such as the segmentation of the entire system, and the no. of faulty network segments. We concluded that small world connection helps to prevent the tendency to have faults.","PeriodicalId":329439,"journal":{"name":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"322 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122474465","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

Evaluation of Letter Reproduction System Using Cellular Neural Network and Oxide Semiconductor Synapses by Logic Simulation 基于细胞神经网络和氧化物半导体突触的字母复制系统的逻辑仿真评价

2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW) Pub Date : 2018-11-01 DOI: 10.1109/CANDARW.2018.00108

Hiroya Ikeda, H. Yamane, Yuki Shibayama, M. Kimura, Y. Nakashima

引用次数: 0

Verifiable Secret Sharing Scheme Using Hash Values 使用哈希值的可验证秘密共享方案

2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW) Pub Date : 2018-11-01 DOI: 10.1109/CANDARW.2018.00081

J. Imai, M. Mimura, Hidema Tanaka

引用次数: 7

Development of Generic CNN Deep Learning Method Using Feature Graph 基于特征图的通用CNN深度学习方法的开发

2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW) Pub Date : 2018-11-01 DOI: 10.1109/CANDARW.2018.00051

Kei Takahashi, Takumi Numajiri, Masaru Sogabe, K. Sakamoto, Koichi Yamaguchi, T. Sogabe

引用次数: 0

XY Based Fault-Tolerant Routing with the Passage of Faulty Nodes 基于故障节点通过的XY容错路由

2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW) Pub Date : 2018-11-01 DOI: 10.1109/CANDARW.2018.00027

Yota Kurokawa, Masaru Fukushi

引用次数: 5

An Analysis on Randomness of Path ORAM for Light-Weight Implementation 轻量化实现路径ORAM的随机性分析

2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW) Pub Date : 2018-11-01 DOI: 10.1109/CANDARW.2018.00037

Hiroki Fujita, Naoki Fujieda, S. Ichikawa

引用次数: 0

A Construction of Cramer-Shoup Like Encryption Protocols Based on the Anshel-Anshel-Goldfeld Key Exchange Protocol 基于anshell - anshell - goldfeld密钥交换协议的类Cramer-Shoup加密协议构造

2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW) Pub Date : 2018-11-01 DOI: 10.1109/CANDARW.2018.00082

Shuji Isobe, Jun-ya Iwazaki, E. Koizumi, Atsushi Suda

引用次数: 0

Experimental Evaluation of Information Dissemination Scheme Considering Mobile Network Base Station Load in Wireless Networks 无线网络中考虑移动网络基站负载的信息发布方案实验评估

2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW) Pub Date : 2018-11-01 DOI: 10.1109/CANDARW.2018.00019

Tatsuki Horai, T. Ohta, Y. Kakuda

引用次数: 0

Detection and Parameter Estimation of R Peaks in ECG Signal Using Optimization Algorithm 基于优化算法的心电信号R峰检测与参数估计

2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW) Pub Date : 2018-11-01 DOI: 10.1109/CANDARW.2018.00039

Sheng-Ta Hsieh, Chun-Ling Lin

{"title":"Detection and Parameter Estimation of R Peaks in ECG Signal Using Optimization Algorithm","authors":"Sheng-Ta Hsieh, Chun-Ling Lin","doi":"10.1109/CANDARW.2018.00039","DOIUrl":"https://doi.org/10.1109/CANDARW.2018.00039","url":null,"abstract":"Accurate R-peak detection is very important for arrhythmia diagnosis. Our previous effective R detection algorithm consisted of three strategies: band-pass filter, adaptive definition of interesting block and dynamic threshold. Then, it adopted the optimization algorithm to replace the knowledge-based theory and found out the suitable parameters (F1, F2, N, W1, W2, β and µ) in R detection algorithm quickly and obtained the high performance of detecting R peaks (99.77%). In order to improve the performance of the previous study, this study proposes to add the median filter in the algorithm to correct baseline wander components of electrocardiography (ECG) signals. It is necessary to defined two parameters (T1 and T2) in median filter. Therefore, this study adopts particle swarm optimization (PSO) to find the suitable parameters (T1, T2, F1, F2, N, W1, W2, β and µ) in the proposed method. The proposed method is applied to MIT-BIH arrhythmia database. The results show that PSO can find out the suitable parameters in R detection algorithm and have a higher accuracy (99.95%) than one of the previous study.","PeriodicalId":329439,"journal":{"name":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"130 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133902932","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