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

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

筛选
英文 中文
An Extension of A Temperature Modeling Tool HotSpot 6.0 for Castle-of-Chips Stacking 芯片城堡堆叠温度建模工具HotSpot 6.0的扩展
2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW) Pub Date : 2018-11-01 DOI: 10.1109/CANDARW.2018.00073
Tomohiro Totoki, M. Koibuchi, H. Amano
{"title":"An Extension of A Temperature Modeling Tool HotSpot 6.0 for Castle-of-Chips Stacking","authors":"Tomohiro Totoki, M. Koibuchi, H. Amano","doi":"10.1109/CANDARW.2018.00073","DOIUrl":"https://doi.org/10.1109/CANDARW.2018.00073","url":null,"abstract":"HotSpot is an open source analysis tool for estimating temperature of both 2D and 3D chip stacks. It counts both the primary path of the heat transfer through the heat-sink and the secondary path through the print circuit board. It can estimate the temperature of chips. However, HotSpot-6.0 cannot treat a complicated chip stacking such as the castle of chips (CoC) with inductive wireless coupling through-chip interface (TCI). Therefore, in this report we have extended the HotSpot simulator and updated it in order to evaluate CoC. Compared to the original HotSpot, the extended version of HotSpot had an average execution time increase of about 6% when evaluating the same vertical stacking. The execution time of CoC with the same number of chips is shorter than when executing vertical stacking, but when the number of layers is the same, the execution time is almost equal. Moreover, our design considers high productivity, e.g. it can easily set air cooling, oil cooling, water cooling evaluation and chip rotation setting.","PeriodicalId":329439,"journal":{"name":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"48 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":"131743747","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
A Smaller-State Implementation of Real-Time Sequence Generator for {n^3 | n= 1, 2, 3,...} {n^3 | n= 1,2,3，…}实时序列生成器的小状态实现
2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW) Pub Date : 2018-11-01 DOI: 10.1109/CANDARW.2018.00012
N. Kamikawa, H. Umeo
{"title":"A Smaller-State Implementation of Real-Time Sequence Generator for {n^3 | n= 1, 2, 3,...}","authors":"N. Kamikawa, H. Umeo","doi":"10.1109/CANDARW.2018.00012","DOIUrl":"https://doi.org/10.1109/CANDARW.2018.00012","url":null,"abstract":"A cellular automaton (CA) is a well-studied non-linear computational model of complex systems in which an infinite one-dimensional array of finite state machines (cells) updates itself in a synchronous manner according to a uniform local rule. A sequence generation problem on the CA model has been studied for a long time and a lot of generation algorithms has been proposed for a variety of non-regular sequences such as {2^n | n = 1, 2, 3, ...}, prime, and Fibonacci sequences etc. In this paper, we study a real-time sequence generator for {n^3 | n=1, 2, 3,...}. In the previous studies, Kamikawa and Umeo(2018) showed that sequence {n^3 | n=1, 2, 3, ... } can be generated in real-time by an eight-state CA. We show a new six-state implementation of real-time sequence generator for {n^3 | n=1, 2, 3, ... } rather than reducing the internal state of the Kamikawa and Umeo's sequence generator and give a formal proof of the correctness of the generator.","PeriodicalId":329439,"journal":{"name":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"24 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":"124296465","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
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
{"title":"Evaluation of Letter Reproduction System Using Cellular Neural Network and Oxide Semiconductor Synapses by Logic Simulation","authors":"Hiroya Ikeda, H. Yamane, Yuki Shibayama, M. Kimura, Y. Nakashima","doi":"10.1109/CANDARW.2018.00108","DOIUrl":"https://doi.org/10.1109/CANDARW.2018.00108","url":null,"abstract":"A letter reproduction system has been developed by a cellular neural network and oxide semiconductor synapses and evaluated by logic simulation. A cellular neural network is utilized because it is suitable for large-scale integration of electronic devices, and oxide semiconductor devices are utilized as synapse elements because the characteristic deterioration can be employed as strength plasticity of synaptic connection with modified Hebbian learning. In this article, first, the structure and operation of the letter reproduction system are explained. Next, it is evaluated by logic simulation, where the dependence of the correction accuracy of the letter reproduction on the variation of deterioration rate of the oxide semiconductor synapses is analyzed.","PeriodicalId":329439,"journal":{"name":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"1 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":"129010000","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
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
{"title":"Verifiable Secret Sharing Scheme Using Hash Values","authors":"J. Imai, M. Mimura, Hidema Tanaka","doi":"10.1109/CANDARW.2018.00081","DOIUrl":"https://doi.org/10.1109/CANDARW.2018.00081","url":null,"abstract":"In this paper, we propose a method for secret sharing scheme to identify cheaters and verify reconstructed secret, using hash values calculated following 2×(m + n-k)-regular graph. Our purpose is to solve disadvantages to known previous methods and our contribution is as followings; (i) it can be applied to any secret sharing scheme, and (ii) the size of a share is related only to the number of cheaters that we set, even if the size of secret value increases. As the result, if the number of cheater is less than or equal to the setting number, we can certainly identify a malicious action, and also we can judge whether result of reconstruction is true or false. We conclude that our proposal method is sufficiently practical.","PeriodicalId":329439,"journal":{"name":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"43 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":"115774297","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}
引用次数: 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
{"title":"Development of Generic CNN Deep Learning Method Using Feature Graph","authors":"Kei Takahashi, Takumi Numajiri, Masaru Sogabe, K. Sakamoto, Koichi Yamaguchi, T. Sogabe","doi":"10.1109/CANDARW.2018.00051","DOIUrl":"https://doi.org/10.1109/CANDARW.2018.00051","url":null,"abstract":"we propose a method by applying Convolutional Neural Networks (CNN) to non-structured data. CNN has been successful in many fields such as image processing and speech recognition. On the other hand, it was difficult to adapt CNN to n non-structured data such as a csv file with multiple variables. The sequence of the data of the low dimensional grid structure such as the image has a meaning, and the CNN recognizes the order as the feature of the image and processes it. Due to this constraint, CNN could not perform feature recognition on non-structured data whose sequence can be reordered while leaving the meaning intact. In this work we developed a method to tackle this issue and make CNN applicable by endowing meaning to the sequence of non-structured data, and demonstrated its effectiveness by adding improvements.","PeriodicalId":329439,"journal":{"name":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"39 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":"126217944","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
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
{"title":"XY Based Fault-Tolerant Routing with the Passage of Faulty Nodes","authors":"Yota Kurokawa, Masaru Fukushi","doi":"10.1109/CANDARW.2018.00027","DOIUrl":"https://doi.org/10.1109/CANDARW.2018.00027","url":null,"abstract":"This paper addresses the problem of developing efficient fault-tolerant routing method for 2D mesh Network-on-Chips (NoCs) to realize dependable and high performance many core systems. Existing fault-tolerant routing methods have the two critical problems of high communication latency and low node utilization. Unlike almost all existing methods where packets always detour faulty nodes, we take a novel and unique approach that packets can pass through faulty nodes. For this approach, we enhance the common NoC architecture by adding switches and links around each node and propose a fault-tolerant routing method based on the well-known simple XY routing method. Simulation result shows that the proposed method reduces average communication latency by about 97.8% compared with the existing method, never sacrificing fault-free nodes.","PeriodicalId":329439,"journal":{"name":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"11 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":"126983342","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
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
{"title":"An Analysis on Randomness of Path ORAM for Light-Weight Implementation","authors":"Hiroki Fujita, Naoki Fujieda, S. Ichikawa","doi":"10.1109/CANDARW.2018.00037","DOIUrl":"https://doi.org/10.1109/CANDARW.2018.00037","url":null,"abstract":"Oblivious RAM (ORAM) is a technique to prevent not only the data but also their access pattern from being observed. Path ORAM is a recently proposed ORAM protocol, whose safety relies on the derived access pattern being observed as a sequence of accesses to random paths. In this paper, we analyze the effect of pseudorandom number generators (PRNGs) on the randomness of the derived path sequence. Our evaluation showed that, even with weak PRNGs that fail some of the diehard tests, the derived path sequences passed more tests. These results may open a new way to a light-weight implementation of Path ORAM.","PeriodicalId":329439,"journal":{"name":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"49 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":"124453783","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
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
{"title":"A Construction of Cramer-Shoup Like Encryption Protocols Based on the Anshel-Anshel-Goldfeld Key Exchange Protocol","authors":"Shuji Isobe, Jun-ya Iwazaki, E. Koizumi, Atsushi Suda","doi":"10.1109/CANDARW.2018.00082","DOIUrl":"https://doi.org/10.1109/CANDARW.2018.00082","url":null,"abstract":"We propose a secure encryption protocol on non-abelian groups. We follow the line of the construction of the Cramer-Shoup encryption protocol, which is proved to be indistinguishable against adaptive chosen ciphertext attack (IND-CCA, for short) by refining the ElGamal encryption protocol. In our protocol, the Anshel-Anshel-Goldfeld key exchange protocol plays the role of the Diffie-Hellman key exchange protocol in the Cramer-Shoup protocol. We then prove that the proposed protocol is indistinguishable against adaptive chosen ciphertext attacks in a slightly restricted sense, what we call the IND-rCCA security. The security notion of IND-rCCA is weaker than that of IND-CCA in a sense that the adversary's query is somewhat restricted in the security game.","PeriodicalId":329439,"journal":{"name":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"267 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":"131617642","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
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
{"title":"Experimental Evaluation of Information Dissemination Scheme Considering Mobile Network Base Station Load in Wireless Networks","authors":"Tatsuki Horai, T. Ohta, Y. Kakuda","doi":"10.1109/CANDARW.2018.00019","DOIUrl":"https://doi.org/10.1109/CANDARW.2018.00019","url":null,"abstract":"Most of mobile terminals such as smart phones are equipped with cellular connections (4G/LTE) and short range connections (WiFi/Bluetooth). In case that these nodes/devices use cellular connections simultaneously to access to the mobile core network, there is the possibility that many of them cannot establish the cellular connections due to the limited wireless resources of the cellular base stations. In this paper, we propose an information dissemination scheme which considers the load of mobile core network base station based on wireless network environments where we can utilize Mobile Ad-hoc NETwork (MANET) and wireless infrastructure communication. We evaluated the information dissemination scheme to share the sensing information of the monitoring system among residents in an area through simulation experiments.","PeriodicalId":329439,"journal":{"name":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"13 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":"123381404","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
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
首页 上一页 下一页 尾页
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学术官方微信