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

2012 Third International Conference on Networking and Computing最新文献

筛选
英文 中文
HiCrypt: C to CUDA Translator for Symmetric Block Ciphers 用于对称块密码的C到CUDA转换器
2012 Third International Conference on Networking and Computing Pub Date : 2012-12-05 DOI: 10.1109/ICNC.2012.16
Keisuke Iwai, Naoki Nishikawa, T. Kurokawa
{"title":"HiCrypt: C to CUDA Translator for Symmetric Block Ciphers","authors":"Keisuke Iwai, Naoki Nishikawa, T. Kurokawa","doi":"10.1109/ICNC.2012.16","DOIUrl":"https://doi.org/10.1109/ICNC.2012.16","url":null,"abstract":"Many-core computer systems with GPUs are coming into mainstream use from high-end computing, including supercomputers, to embedded processors. Consequently, the implementation of cryptographic methods on GPGPU is also becoming popular because of such systems' performance. However, many factors affect the performance of GPUs. To cope with this problem, we developed a new translator, HiCrypt, which can generate an optimized CUDA program from a cipher program written in a standard C language with directives. Users need only annotate variables and an encoding/decoding function, which are characteristics of cipher programs, with directives. To evaluate HiCrypt, three representative cipher programs are translated into CUDA programs by HiCrypt translator prototype. Generated programs perform high throughput almost identical to hand optimized CUDA programs for all three cipher programs. HiCrypt will contribute to development of new and various symmetric block ciphers using a GPU accelerator.","PeriodicalId":442973,"journal":{"name":"2012 Third International Conference on Networking and Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116917964","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
Asynchronous P Systems for Graph Coloring Problems 图着色问题的异步P系统
2012 Third International Conference on Networking and Computing Pub Date : 2012-12-05 DOI: 10.1109/ICNC.2012.46
Kohei Tanaka, A. Fujiwara
{"title":"Asynchronous P Systems for Graph Coloring Problems","authors":"Kohei Tanaka, A. Fujiwara","doi":"10.1109/ICNC.2012.46","DOIUrl":"https://doi.org/10.1109/ICNC.2012.46","url":null,"abstract":"In the present paper, we consider fully asynchronous parallelism in membrane computing, and propose two asynchronous P systems for two graph coloring problems. We first propose an asynchronous P system that solves the k-coloring for a graph with n nodes, and show that the proposed P system works in O(k<sup>n</sup>n<sup>2</sup>) sequential steps or O(n<sup>2</sup>) parallel steps using O(n<sup>2</sup>) kinds of objects. We next propose an asynchronous P system that solves the minimum graph coloring for a graph with n nodes, and show that the proposed P system works in O(n<sup>n+2</sup>) sequential steps or O(n<sup>2</sup>) parallel steps using O(n<sup>2</sup>) kinds of objects.","PeriodicalId":442973,"journal":{"name":"2012 Third International Conference on Networking and Computing","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127540410","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
A Spatial Skyline Query for a Group of Users Having Different Positions 一组具有不同位置的用户的空间Skyline查询
2012 Third International Conference on Networking and Computing Pub Date : 2012-12-05 DOI: 10.1109/ICNC.2012.28
M. Arefin, Geng Ma, Y. Morimoto
{"title":"A Spatial Skyline Query for a Group of Users Having Different Positions","authors":"M. Arefin, Geng Ma, Y. Morimoto","doi":"10.1109/ICNC.2012.28","DOIUrl":"https://doi.org/10.1109/ICNC.2012.28","url":null,"abstract":"We consider a problem of skyline query of a spatial database. Assume that members of a multidisciplinary task force team located at different offices want to put together in a restaurant to hold a lunch-on meeting. In this situation, we should select a good restaurant whose location is convenient for each member. Skyline query is helpful for finding a good restaurant. We can compute a set of skyline restaurants based on non-spatial attributes such as price and rating by using conventional skyline queries. However, conventional skyline queries do not consider distance from each user, which must be important for selecting a restaurant in the example. If users' locations are different, the comparison of restaurant's location is complicated. For example, if one restaurant is very close to one user, it may be far from another user. In this paper, we consider a spatial skyline query for a group of users having different positions. The proposed method selects a set of spatial objects whose location for the group is not dominated by another spatial objects.","PeriodicalId":442973,"journal":{"name":"2012 Third International Conference on Networking and Computing","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114449032","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}
引用次数: 16
Using Particle Swarm Optimization for Enhancing the Hierarchical Cell Relay Routing Protocol 用粒子群算法改进分层小区中继路由协议
2012 Third International Conference on Networking and Computing Pub Date : 2012-12-05 DOI: 10.1109/ICNC.2012.26
Hung-Yi Chi, Ping-Cheng Chung, Tsung-Chuan Huang
{"title":"Using Particle Swarm Optimization for Enhancing the Hierarchical Cell Relay Routing Protocol","authors":"Hung-Yi Chi, Ping-Cheng Chung, Tsung-Chuan Huang","doi":"10.1109/ICNC.2012.26","DOIUrl":"https://doi.org/10.1109/ICNC.2012.26","url":null,"abstract":"In mobile ad hoc networks (MANETs), the maximum transmission radius is generally used for transmission. The advantage is that each mobile node can communicate with more mobile nodes within the transmission range and packets can reach the destination rapidly in fewer hops. However using the maximum transmission radius will induce high power consumption. We proposed the Hierarchical Cell Relay (HCR) scheme earlier, which is a hierarchical topology routing protocol for the MANETs. In order to enhance the performance of HCR, in this paper we use the Particle Swarm Optimization (PSO) algorithm to find a suitable transmission radius for each node. The nodes do not use maximum transmission radius in order to prolong the network lifetime. In addition to comparing the enhanced HCR with the original HCR, we also compare it to another hierarchical topology routing protocol - Adaptive Cell Relay (ACR). The comparison results show that using PSO in HCR can reduce energy consumption without sacrificing the packet transmission delay.","PeriodicalId":442973,"journal":{"name":"2012 Third International Conference on Networking and Computing","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121744513","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
Approximate Algorithms for Survivable Network Design 可生存网络设计的近似算法
2012 Third International Conference on Networking and Computing Pub Date : 2012-12-05 DOI: 10.1109/ICNC.2012.11
Hong Shen
{"title":"Approximate Algorithms for Survivable Network Design","authors":"Hong Shen","doi":"10.1109/ICNC.2012.11","DOIUrl":"https://doi.org/10.1109/ICNC.2012.11","url":null,"abstract":"Along with the rapid development of network communication technology and the explosive growth of the internet applications, network reliability appears increasingly important to both traditional areas such as defense, finance and power industry, and emerging areas such as trusted computing, cloud computing and next-generation Internet. An interesting subject that has attracted great effort is how to design network topologies with a minimum network resource usage in terms of cost that provides a relibility guarantee. As problems on this subject, like most other network optimization problems, are well-known NP-hard even in their simplest form, design of effective solutions with a guaranteed approximation ratio from the optimal solution has been a major research focus of great significance for both theory and applications. This survery summarizes major existing techniques and results for solving some central problems in designing survivable networks including the minimal connected sub graph problem, the survivable network design problem and the Steiner minimal network problem.","PeriodicalId":442973,"journal":{"name":"2012 Third International Conference on Networking and Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124356005","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
Reversible Computing Systems, Logic Circuits, and Cellular Automata 可逆计算系统、逻辑电路和元胞自动机
2012 Third International Conference on Networking and Computing Pub Date : 2012-12-05 DOI: 10.1109/ICNC.2012.10
K. Morita
{"title":"Reversible Computing Systems, Logic Circuits, and Cellular Automata","authors":"K. Morita","doi":"10.1109/ICNC.2012.10","DOIUrl":"https://doi.org/10.1109/ICNC.2012.10","url":null,"abstract":"Reversible computing is a paradigm of computation that reflects physical reversibility, and will become important when we develop future computing systems that directly utilize microscopic physical phenomena for logical operations. In this survey we discuss, from a theoretical point of view, how a reversible computer is implemented as a reversible logic circuit, how a reversible logic circuit is composed of reversible logic elements, and how a reversible logic element can be realized in a physically reversible system. We shall see that, in spite of the constraint of reversibility, universal reversible computers can be constructed by very simple reversible primitives, and that in these systems computation is often carried out in a very unique and different manner from conventional computing systems.","PeriodicalId":442973,"journal":{"name":"2012 Third International Conference on Networking and Computing","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125568127","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}
引用次数: 8
Ezilla Fast Deployment Cloud Toolkit with Network Infrastructure Service Ezilla快速部署云工具包与网络基础设施服务
2012 Third International Conference on Networking and Computing Pub Date : 2012-12-05 DOI: 10.1109/ICNC.2012.49
Hui-Shan Chen, Yi-Lun Pan, Chang-Hsing Wu, Hsi-En Yu, Kuo-Yang Cheng, Weicheng Huang
{"title":"Ezilla Fast Deployment Cloud Toolkit with Network Infrastructure Service","authors":"Hui-Shan Chen, Yi-Lun Pan, Chang-Hsing Wu, Hsi-En Yu, Kuo-Yang Cheng, Weicheng Huang","doi":"10.1109/ICNC.2012.49","DOIUrl":"https://doi.org/10.1109/ICNC.2012.49","url":null,"abstract":"Deployment of server virtualization almost becomes a universal basic concept of making full use of the data center resources. With the evolution trend for powerful multi-core servers, more memory capacity, and greater bandwidth network channel, it is necessary to think about the network I/O. To contribute this issue, Ezilla has been developed by Pervasive Computing Team at National Center for High-performance Computing (NCHC). Ezilla integrates the Cloud middleware, virtualization technology, and Web-based Operating System (WebOS) to build virtual machines in the distributed computing environment. The main character of Ezilla is simplifying a lot complexity of utilizing Clouds. Via the Ezilla with SR-IOV feature, Cloud users can create virtual clusters that are customized to meet the specific needs from the users. Our goal is to make scientists or users painlessly run their works on Clouds, and greatly improve the network I/O performance.","PeriodicalId":442973,"journal":{"name":"2012 Third International Conference on Networking and Computing","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127905866","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
A Correlation Power Analysis Countermeasure for Enocoro-128 v2 Using Random Switching Logic 基于随机开关逻辑的Enocoro-128 v2相关功率分析对策
2012 Third International Conference on Networking and Computing Pub Date : 2012-12-05 DOI: 10.1109/ICNC.2012.62
H. Mizuno, Keisuke Iwai, Hidema Tanaka, T. Kurokawa
{"title":"A Correlation Power Analysis Countermeasure for Enocoro-128 v2 Using Random Switching Logic","authors":"H. Mizuno, Keisuke Iwai, Hidema Tanaka, T. Kurokawa","doi":"10.1109/ICNC.2012.62","DOIUrl":"https://doi.org/10.1109/ICNC.2012.62","url":null,"abstract":"This paper shows Correlation Power Analysis (CPA) on Enocoro-128 v2 and application effectiveness of a countermeasure. Enocoro is a hardware-oriented stream cipher developed by Hitachi, Ltd. Previous work shows that Enocoro-128 v2 has a weakness against CPA. Another work shows that a countermeasure using algorithm level masking, threshold implementation, is effective for CPA. This paper proposes application of a gate level masking, Random Switching Logic (RSL) as another countermeasure for Enocoro-128 v2. We implement the circuit of Enocoro-128 v2 using RSL on SASEBO-GII (Side-Channel Attack Standard Evaluation Board), and evaluate its CPA countermeasure ability. As a result, we confirmed that it is impossible to reveal secret key by measurement using less than 100,000 power consumption waveforms.","PeriodicalId":442973,"journal":{"name":"2012 Third International Conference on Networking and Computing","volume":"25 17","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131805690","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
Simplifying Brownian Cellular Automata: Two States and an Average of Two Rules Per Cell 简化布朗元胞自动机:每个细胞的两种状态和两个规则的平均值
2012 Third International Conference on Networking and Computing Pub Date : 2012-12-05 DOI: 10.1109/ICNC.2012.71
F. Peper
{"title":"Simplifying Brownian Cellular Automata: Two States and an Average of Two Rules Per Cell","authors":"F. Peper","doi":"10.1109/ICNC.2012.71","DOIUrl":"https://doi.org/10.1109/ICNC.2012.71","url":null,"abstract":"Brownian Cellular Automata (BCA) are asynchronous cellular automata in which local configurations are allowed to fluctuate in cell space. Used to drive the operations of BCA, these fluctuations facilitate a drastic reduction in the complexity of cells, with the best BCA models achieved up to now having three states and two transition rules. This paper proposes a further reduction to two states per cell, by employing cells of three different types. These three types require respectively three, two, and zero transition rules per cell. This result may bring physical implementations of BCA one step closer.","PeriodicalId":442973,"journal":{"name":"2012 Third International Conference on Networking and Computing","volume":"29 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132807507","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 Petri Net-Based Approach to Control of Boolean Networks 基于Petri网的布尔网络控制方法
2012 Third International Conference on Networking and Computing Pub Date : 2012-12-05 DOI: 10.1109/ICNC.2012.76
Koichi Kobayashi, K. Hiraishi
{"title":"A Petri Net-Based Approach to Control of Boolean Networks","authors":"Koichi Kobayashi, K. Hiraishi","doi":"10.1109/ICNC.2012.76","DOIUrl":"https://doi.org/10.1109/ICNC.2012.76","url":null,"abstract":"A Boolean network is a class of discrete-time nonlinear dynamical systems, and time evolution is expressed by a set of Boolean functions. This model is well known as one of the models of gene regulatory networks, and can express synchronous dynamics. In this paper, to express asynchronous dynamics, a new modeling method of Boolean networks with control inputs is proposed based on the Petri net framework. Furthermore, the optimal control problem of Petri nets expressing asynchronous dynamics of a Boolean network is formulated, and is reduced to an integer programming problem. The proposed approach will provide us one of the mathematical bases of control methods for gene regulatory networks.","PeriodicalId":442973,"journal":{"name":"2012 Third International Conference on Networking and Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130850455","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}
引用次数: 6
下一页 尾页
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学术官方微信