2012 Third International Conference on Networking and Computing最新文献_第4页

Implementation and Evaluation of an Pairing-Based Anonymous Credential System with Constant-Size Proofs and Efficient Proof Generations 具有恒大小证明和高效证明生成的基于配对的匿名证书系统的实现与评估

2012 Third International Conference on Networking and Computing Pub Date : 2012-12-05 DOI: 10.1109/ICNC.2012.48

Nasima Begum, T. Nakanishi, N. Funabiki

{"title":"Implementation and Evaluation of an Pairing-Based Anonymous Credential System with Constant-Size Proofs and Efficient Proof Generations","authors":"Nasima Begum, T. Nakanishi, N. Funabiki","doi":"10.1109/ICNC.2012.48","DOIUrl":"https://doi.org/10.1109/ICNC.2012.48","url":null,"abstract":"To enhance user privacy, anonymous credential systems allow the user to convince a verifier of the possession of a certificate issued by the issuing authority anonymously. In the systems, the user can prove logical relations on his/her attributes embedded into the certificate. Previously, we proposed a pairing-based system with constant-size proofs. In the system, the proof generation needs only multiplications depending on the size of the proved relations, and it is more efficient than other existing system that needs the exponentiations whose costs are much larger than multiplications. However, our efficient system has never been implemented, and thus the practicality is not evaluated. In this study, we implemented the system, and measured the processing times and data size, when changing the parameters describing the size of the proved relation. The verification time is very fast and constant, and the proof size is also constant, from which we can confirm the practicality. However, the proof generation time increases, when the parameters increase. Although we confirm the practicality in case of small relations, we clarify the problems in case of larger relations, which should be solved in our future works.","PeriodicalId":442973,"journal":{"name":"2012 Third International Conference on Networking and Computing","volume":"2 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":"134184660","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

An Automatic Host and Device Memory Allocation Method for OpenMPC 一种用于OpenMPC的主机和设备内存自动分配方法

2012 Third International Conference on Networking and Computing Pub Date : 2012-12-05 DOI: 10.1109/ICNC.2012.39

Hiroaki Uchiyama, Tomoaki Tsumura, Hiroshi Matsuo

引用次数: 2

Empirical Analysis of Periodically Bookmarked Web Pages in Social Bookmarking Systems 社会化书签系统中网页定期书签的实证分析

2012 Third International Conference on Networking and Computing Pub Date : 2012-12-05 DOI: 10.1109/ICNC.2012.21

Keisuke Tsunamoto, S. Kamei, S. Fujita

引用次数: 0

An Efficient GPU Implementation of Ant Colony Optimization for the Traveling Salesman Problem 旅行商问题蚁群优化的高效GPU实现

2012 Third International Conference on Networking and Computing Pub Date : 2012-12-05 DOI: 10.1109/ICNC.2012.22

Akihiro Uchida, Yasuaki Ito, K. Nakano

{"title":"An Efficient GPU Implementation of Ant Colony Optimization for the Traveling Salesman Problem","authors":"Akihiro Uchida, Yasuaki Ito, K. Nakano","doi":"10.1109/ICNC.2012.22","DOIUrl":"https://doi.org/10.1109/ICNC.2012.22","url":null,"abstract":"Graphics Processing Units (GPUs) are specialized microprocessors that accelerate graphics operations. Recent GPUs, which have many processing units connected with an off-chip global memory, can be used for general purpose parallel computation. Ant Colony Optimization (ACO) approaches have been introduced as ature-inspired heuristics to find good solutions of the Traveling Salesman Problem (TSP). In ACO approaches, a number of ants traverse the cities of the TSP to find better solutions of the TSP. The ants randomly select next visiting cities based on the probabilities determined by total amounts of their pheromone spread on routes. The main contribution of this paper is to present sophisticated and efficient implementation of one of the ACO approaches on the GPU. In our implementation, we have considered many programming issues of the GPU architecture including coalesced access of global memory, shared memory bank conflicts, etc. In particular, we present a very efficient method for random selection of next cities by a number of ants. Our new method uses iterative random trial which can find next cities in few computational costs with high probability. The experimental results on NVIDIA GeForce GTX 580 show that our implementation for 1002 cities runs in 8.71 seconds, while a conventional CPU implementation runs in 381.95 seconds. Thus, our GPU implementation attains a speed-up factor of 43.47.","PeriodicalId":442973,"journal":{"name":"2012 Third International Conference on Networking and Computing","volume":"22 18 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":"125392985","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}

引用次数: 57

On Reachability in Acyclic Well-Structured Workflow Nets 非循环结构良好工作流网络的可达性研究

2012 Third International Conference on Networking and Computing Pub Date : 2012-12-05 DOI: 10.1109/ICNC.2012.83

S. Yamaguchi

引用次数: 2

Real Estate Recommender: Location Query for Selecting Spatial Objects 房地产推荐:选择空间对象的位置查询

2012 Third International Conference on Networking and Computing Pub Date : 2012-12-05 DOI: 10.1109/ICNC.2012.51

Jinhao Xu, M. Arefin, Zhiming Chen, Y. Morimoto

引用次数: 1

Dynamic Processing Slots Scheduling for I/O Intensive Jobs of Hadoop MapReduce Hadoop MapReduce I/O密集型任务的动态处理槽调度

2012 Third International Conference on Networking and Computing Pub Date : 2012-12-05 DOI: 10.1109/ICNC.2012.53

Shiori Kurazumi, Tomoaki Tsumura, S. Saito, H. Matsuo

引用次数: 32

Asynchronous SN P Systems for Sorting 异步SN - P排序系统

2012 Third International Conference on Networking and Computing Pub Date : 2012-12-05 DOI: 10.1109/ICNC.2012.41

Shunsuke Aoki, A. Fujiwara

引用次数: 0

A Domain Specific Language and Toolchain for OpenCV Runtime Binary Acceleration Using GPU 基于GPU的OpenCV运行时二进制加速的领域特定语言和工具链

2012 Third International Conference on Networking and Computing Pub Date : 2012-12-05 DOI: 10.1109/ICNC.2012.34

Takaaki Miyajima, David B. Thomas, H. Amano

{"title":"A Domain Specific Language and Toolchain for OpenCV Runtime Binary Acceleration Using GPU","authors":"Takaaki Miyajima, David B. Thomas, H. Amano","doi":"10.1109/ICNC.2012.34","DOIUrl":"https://doi.org/10.1109/ICNC.2012.34","url":null,"abstract":"Computationally intensive applications, such as OpenCV, can be off-loaded to accelerators to reduce execution time. However, developing an accelerated system requires a significant amount of time, requiring the developer to first choose an accelerator and which parts to off-load, then to port and the offloaded kernels to the accelerator using many accelerator-specific tools. In addition to the low-level parallelism of the accelerator, the developer also needs to extract and utilize system-level parallelism found within the application, while making sure that the application still executes correctly. This paper presents Courier, a tool chain and a domain specific language for Runtime Binary Acceleration, designed to simplify many of the steps involved in accelerating an application. The Courier tool chain can extract dataflow from a running software binary file, explore the off-loaded execution time on an accelerator, and then actually accelerate the original binary. By utilizing Courier, both expert and non-expert users can easily extract system-level parallelism and decide which part should be off-loaded to accelerators in a mixed software-hardware environment, without special knowledge on the target application source code and accelerator architecture. In a case study an OpenCV application is accelerated by 2.06 times using Courier, without requiring the application source code or any re-compilation of the application.","PeriodicalId":442973,"journal":{"name":"2012 Third International Conference on Networking and Computing","volume":"702 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133322697","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

Constant-Time Approximation Algorithms for the Optimum Branching Problem on Sparse Graphs 稀疏图上最优分支问题的常时间逼近算法

2012 Third International Conference on Networking and Computing Pub Date : 2012-12-05 DOI: 10.1109/ICNC.2012.78

M. Kusumoto, Yuichi Yoshida, Hiro Ito

引用次数: 0