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

2017 Fifth International Symposium on Computing and Networking (CANDAR)最新文献

筛选
英文 中文
A Verified Accumulate Algorithmic Skeleton 一个经过验证的累积算法骨架
2017 Fifth International Symposium on Computing and Networking (CANDAR) Pub Date : 2017-11-19 DOI: 10.1109/CANDAR.2017.108
F. Loulergue
{"title":"A Verified Accumulate Algorithmic Skeleton","authors":"F. Loulergue","doi":"10.1109/CANDAR.2017.108","DOIUrl":"https://doi.org/10.1109/CANDAR.2017.108","url":null,"abstract":"This paper presents an extension of a library for the Coq interactive theorem prover that enables the development of correct functional parallel programs based on sequential program transformation and automatic parallelization using an algorithmic skeleton named accumulate. Such an algorithmic skeleton is a pattern of a parallel algorithm that is provided as a high-order function implemented in parallel. The use of this framework is illustrated with the bracket matching problem, including experiments on a parallel machine.","PeriodicalId":157467,"journal":{"name":"2017 Fifth International Symposium on Computing and Networking (CANDAR)","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124842828","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}
引用次数: 3
Optimal Representation for Right-to-Left Parallel Scalar Point Multiplication 从右到左并行标量点乘法的最优表示
2017 Fifth International Symposium on Computing and Networking (CANDAR) Pub Date : 2017-11-01 DOI: 10.1109/CANDAR.2017.14
Kittiphon Phalakarn, Kittiphop Phalakarn, Vorapong Suppakitpaisarn
{"title":"Optimal Representation for Right-to-Left Parallel Scalar Point Multiplication","authors":"Kittiphon Phalakarn, Kittiphop Phalakarn, Vorapong Suppakitpaisarn","doi":"10.1109/CANDAR.2017.14","DOIUrl":"https://doi.org/10.1109/CANDAR.2017.14","url":null,"abstract":"This paper introduces an optimal representation for a right-to-left parallel elliptic curve scalar point multiplication. The right-to-left approach is easier to parallelize than the conventional left-to-right approach. However, unlike the left-to-right approach, there is still no work considering number representations for the right-to-left parallel calculation. By simplifying the implementation by Robert, we devise a mathematical model to capture the computation time of the calculation. Then, for any arbitrary amount of doubling time and addition time, we propose algorithms to generate representations which minimize the time in that model. As a result, we can show a negative result that a conventional representation like NAF is almost optimal. The parallel computation time obtained from any representation cannot be better than NAF by more than 1%.","PeriodicalId":157467,"journal":{"name":"2017 Fifth International Symposium on Computing and Networking (CANDAR)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124431684","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}
引用次数: 3
Analysis of Multiple Darknet Focusing on Outbound Packets and its Application to Malware Analysis 基于出站数据包的多暗网分析及其在恶意软件分析中的应用
2017 Fifth International Symposium on Computing and Networking (CANDAR) Pub Date : 2017-11-01 DOI: 10.1109/CANDAR.2017.87
Keisuke Furumoto, Korehito Kashiki, M. Morii, Masato Ikegami, Tomohisa Hasegawa, Teiichi Ishikawa, K. Nakao
{"title":"Analysis of Multiple Darknet Focusing on Outbound Packets and its Application to Malware Analysis","authors":"Keisuke Furumoto, Korehito Kashiki, M. Morii, Masato Ikegami, Tomohisa Hasegawa, Teiichi Ishikawa, K. Nakao","doi":"10.1109/CANDAR.2017.87","DOIUrl":"https://doi.org/10.1109/CANDAR.2017.87","url":null,"abstract":"PRACTICE (Proactive Response Against Cyber-attacks Through International Collaborative Exchange) project was initiated with the aim of reducing the risk of cyber-attacks, by constructing a coordination system on cyber-attacks internationally and analyzing observed data of darknet sensors installed in 10 countries participating in PRACTICE. However, all of the previous studies related to PRACTICE are narrow-ranging results focusing on specific attacking hosts. In this paper, we analyzed the wide-ranging relationship between darknets sensors installed in countries participating in PRACTICE from the viewpoint of inbound packet and outbound packet for each port number. Inbound packet is a packet observed in countries participating in PRACTICE, and outbound packet is a summary of packets from a specific country observed in countries participating in PRACTICE. As a result, when attacking port 23 in countries participating in PRACTICE, it became clear that the attack tendency is clearly divided depending on the attacking country. Furthermore, assuming that Malware is involved in the difference in attack tendency by country, we conducted a correlation analysis of observed data of PRACTICE and observed data of Malware by country provided by ESET. As a result, it became clear that outbound packet for port 23 and downloader type malware related to botnet closely interlocked and this malware spreads infection by using Telnet (port 23). From the analysis results, as pointed out previously, it was revealed that the darknet packet for a specific port number is linked to Malware's activity.","PeriodicalId":157467,"journal":{"name":"2017 Fifth International Symposium on Computing and Networking (CANDAR)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124816010","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
Label Estimation Method with Modifications for Unreliable Examples in Taming 训练中不可靠样本的修正标签估计方法
2017 Fifth International Symposium on Computing and Networking (CANDAR) Pub Date : 2017-11-01 DOI: 10.1109/CANDAR.2017.43
Yasutake Koishi, Shuichi Ishida, T. Tabaru, Hiroyuki Miyamoto
{"title":"Label Estimation Method with Modifications for Unreliable Examples in Taming","authors":"Yasutake Koishi, Shuichi Ishida, T. Tabaru, Hiroyuki Miyamoto","doi":"10.1109/CANDAR.2017.43","DOIUrl":"https://doi.org/10.1109/CANDAR.2017.43","url":null,"abstract":"Methods for improving learning accuracy by utilizing a plurality of data sets having different reliabilities have been extensively studied. Unreliable data sets often include data with incorrect labels, and it is known that learning from such datasets adversely affects learning accuracy. In our study we focused on the learning problem, Taming which deals with two kinds of data sets with different reliabilities. We propose a label estimation method for use in data sets that include the data with incorrect labels. The proposed method is an extension of BaggTaming, which is proposed as a solution to Taming. We conducted experiments to verify the effectiveness of the proposed method using a benchmark data set which included the data with intentionally changed labels to incorrect. We confirmed that the learning accuracy can be improved by the proposed method when learning by using the data sets with modified labels.","PeriodicalId":157467,"journal":{"name":"2017 Fifth International Symposium on Computing and Networking (CANDAR)","volume":"65 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122904218","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
Designated-Senders Public-Key Searchable Encryption Secure against Keyword Guessing Attacks 指定发送方公钥可搜索加密，防止关键字猜测攻击
2017 Fifth International Symposium on Computing and Networking (CANDAR) Pub Date : 2017-11-01 DOI: 10.1109/CANDAR.2017.22
Takanori Saito, T. Nakanishi
{"title":"Designated-Senders Public-Key Searchable Encryption Secure against Keyword Guessing Attacks","authors":"Takanori Saito, T. Nakanishi","doi":"10.1109/CANDAR.2017.22","DOIUrl":"https://doi.org/10.1109/CANDAR.2017.22","url":null,"abstract":"To achieve keyword search in secure cloud storage, a public-key encryption with keyword search (PEKS) has been proposed. However, the PEKS is inherently vulnerable to the Keyword Guessing Attack (KGA): Using the public key, anyone including the server can compute the ciphertext of any keyword. Thus, a malicious server prepares the ciphertexts of possible keywords, and the server can test if the keyword of a trapdoor sent from the receiver is the same as one of the keywords of the prepared ciphertexts. In this paper, we introduce a new type of PEKS that is secure against KGA, designated-senders PEKS. In this type of PEKS, the receiver can designate a group of senders who can encrypt keywords. Thus, since the malicious server cannot encrypt any keyword, the server cannot launch KGA. Furthermore, we construct a designated-senders PEKS scheme using a broadcast encryption.","PeriodicalId":157467,"journal":{"name":"2017 Fifth International Symposium on Computing and Networking (CANDAR)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122931316","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
On a Triangular Brownian Cellular Automaton with 4 States and 6 Rules 四态六规则的三角形布朗元胞自动机
2017 Fifth International Symposium on Computing and Networking (CANDAR) Pub Date : 2017-11-01 DOI: 10.1109/CANDAR.2017.83
Yuta Yamatani, T. Isokawa, Jia Lee, F. Peper
{"title":"On a Triangular Brownian Cellular Automaton with 4 States and 6 Rules","authors":"Yuta Yamatani, T. Isokawa, Jia Lee, F. Peper","doi":"10.1109/CANDAR.2017.83","DOIUrl":"https://doi.org/10.1109/CANDAR.2017.83","url":null,"abstract":"This paper describes an asynchronous Cellular Automaton (CA) in which cells are triangular. The proposed CA has the capability of computational universality, which is proven by embedding computationally universal primitives, connections, and a signal of a Brownian circuit onto this CA. Computation on this CA is driven by fluctuations of cell configurations, which conduct a random walk in the circuit topology. The numbers of the state in each cell and transition rules for updating cell's state are respectively four and six for operating all functionalities.","PeriodicalId":157467,"journal":{"name":"2017 Fifth International Symposium on Computing and Networking (CANDAR)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117035728","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
Synchronizing Parallel Geometric Algorithms on Multi-core Machines 多核机器上的同步并行几何算法
2017 Fifth International Symposium on Computing and Networking (CANDAR) Pub Date : 2017-11-01 DOI: 10.1109/CANDAR.2017.59
J. Fuentes, F. Luo, I. Scherson
{"title":"Synchronizing Parallel Geometric Algorithms on Multi-core Machines","authors":"J. Fuentes, F. Luo, I. Scherson","doi":"10.1109/CANDAR.2017.59","DOIUrl":"https://doi.org/10.1109/CANDAR.2017.59","url":null,"abstract":"A thread synchronization mechanism called Spatial Locks for parallel geometric algorithms is presented. We demonstrate that Spatial Locks can ensure thread synchronization on geometric algorithms that perform concurrent operations over geometric surfaces and shapes in two-dimensional or three-dimensional space, considering also that these operations follow a certain order of processing. A parallel algorithm for mesh simplification was implemented using Spatial Locks to show its usefulness when parallelizing geometric algorithms with ease on multi-core machines. Experimental results illustrate the advantage of using this synchronization mechanism, where significant computational improvement can be achieved.","PeriodicalId":157467,"journal":{"name":"2017 Fifth International Symposium on Computing and Networking (CANDAR)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128293287","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}
引用次数: 3
Complex Dynamics, Evolution, Separation, Profile Modeling of Fire in 3D for Computer Animation 复杂动力学，演化，分离，轮廓建模的火在三维计算机动画
2017 Fifth International Symposium on Computing and Networking (CANDAR) Pub Date : 2017-11-01 DOI: 10.1109/CANDAR.2017.11
R. Durikovic, Jozef Hladky
{"title":"Complex Dynamics, Evolution, Separation, Profile Modeling of Fire in 3D for Computer Animation","authors":"R. Durikovic, Jozef Hladky","doi":"10.1109/CANDAR.2017.11","DOIUrl":"https://doi.org/10.1109/CANDAR.2017.11","url":null,"abstract":"In this paper, we present a system for modeling fire dynamics with emphasis on realistic behavior and spread as well as the extensive behavioral control system. Our system provides a wide range of parametric and procedural controls. Flame spread and motion is achieved using differential equations which take account of wind, buoyancy, diffusion and velocity of the burning surface. Realistic behavior is achieved using stochastic models of flickering and buoyant diffusion. We also implement wind fields for additional controllable motion. Flame behavior covers moving sources, flickering, separation and merging.","PeriodicalId":157467,"journal":{"name":"2017 Fifth International Symposium on Computing and Networking (CANDAR)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128736230","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
Hierarchical Motion Representation of 2-State Number Conserving Cellular Automata 二态保数元胞自动机的层次运动表示
2017 Fifth International Symposium on Computing and Networking (CANDAR) Pub Date : 2017-11-01 DOI: 10.1109/CANDAR.2017.105
G. Kong, Katsunobu Imai, T. Nakanishi
{"title":"Hierarchical Motion Representation of 2-State Number Conserving Cellular Automata","authors":"G. Kong, Katsunobu Imai, T. Nakanishi","doi":"10.1109/CANDAR.2017.105","DOIUrl":"https://doi.org/10.1109/CANDAR.2017.105","url":null,"abstract":"A one-dimensional two state number conserving cellular automaton (NCCA) is a cellular automaton whose states are 0 or 1 and whose transition keeps the sum of all cells constant throughout its evolution. It can be regarded as a kind of particle based modeling of physical systems and has another intuitive representation, motion representation, based on the movement of each particle. In this paper, we introduce hierarchical motion representation (HMR) to classify NCCA. We give an algorithm to compute the HMR from the transition rule of an NCCA. Employing the algorithm, we constructed a tree representation of HMRs of all NCCA up to five neighborhood.","PeriodicalId":157467,"journal":{"name":"2017 Fifth International Symposium on Computing and Networking (CANDAR)","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123232249","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}
引用次数: 3
Coded Caching for Hierarchical Networks with a Different Number of Layers 不同层数分层网络的编码缓存
2017 Fifth International Symposium on Computing and Networking (CANDAR) Pub Date : 2017-11-01 DOI: 10.1109/CANDAR.2017.85
Makoto Takita, M. Hirotomo, M. Morii
{"title":"Coded Caching for Hierarchical Networks with a Different Number of Layers","authors":"Makoto Takita, M. Hirotomo, M. Morii","doi":"10.1109/CANDAR.2017.85","DOIUrl":"https://doi.org/10.1109/CANDAR.2017.85","url":null,"abstract":"Coded caching is a technique to reduce network loads. Recent works have discussed single-layer caching systems, but many networks consist of multiple layers of cache. In this paper, we discuss coded caching problem for a hierarchical network that has a different number of layers of cache. The network has users who connect to an origin server via a mirror server and users who directly connect to the origin server. We provide lower bounds on this problem setting based on cut-set bound. In addition, we propose three basic caching schemes and characterize these schemes. Also, we propose a novel coded caching scheme by combining two basic schemes and provide achievable rates of the combination coded caching scheme. Finally, we show that proposed combination scheme demonstrates good performance by a numerical result.","PeriodicalId":157467,"journal":{"name":"2017 Fifth International Symposium on Computing and Networking (CANDAR)","volume":"24 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128172511","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
下一页 尾页
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学术官方微信
小红书