به نام خدا
Title: Secret Sharing Scheme Suitable for Cloud Computing
Authors: Satoshi Takahashi Keiichi Iwamura
Abstract: Secret sharing schemes have recently been considered to apply for cloud computing in which many users distribute multiple data to servers. However, when Shamir s(k,n) secret sharing is applied to cloud systems, the amount of share increases more than n times the amount of the secret. Therefore, in this paper we propose a new secret sharing scheme that can reduce the amount of share different from Ramp type secret sharing, suitable for cloud systems, and we prove that it is computationally secure.
Publish Year: 2013
Published in: AINA - IEEE
Number of Pages: 8
موضوع: رایانش ابری، امنیت
ایران سای – مرجع مقالات علمی فنی مهندسی
حامی دانش بومی ایرانیان
به نام خدا
Title: Engineering Mathematics: The Odd Order Theorem Proof
Authors: Georges Gonthier
Abstract: Even with the assistance of computer tools, the formalized description and verification of research-level mathematics remains a daunting task, not least because of the talent with which mathematicians combine diverse theories to achieve their ends. By combining tools and techniques from type theory, language design, and software engineering we have managed to capture enough of these practices to formalize the proof of the Odd Order theorem, a landmark result in Group Theory.
Publish Year: 2013
Published in: ACM-SIGPLAN-SIGACT
Number of Pages: 2
موضوع: ریاضی مهندسی
ایران سای – مرجع مقالات علمی فنی مهندسی
حامی دانش بومی ایرانیان
به نام خدا
Title: Qcompiler: Quantum compilation with the CSD method
Authors: YG Chen, JB Wang
Abstract: In this paper, we present a general quantum computation compiler, which maps any given quantum algorithm to a quantum circuit consisting a sequential set of elementary quantum logic gates based on recursive cosine sine decomposition. The resulting quantum circuit diagram is provided by directly linking the package output written in LaTeX to Qcircuit.tex We illustrate the use of the Qcompiler package through various examples with full details of the derived quantum circuits. Besides its accuracy, generality and simplicity, Qcompiler produces quantum circuits with significantly reduced number of gates when the systems under study have a high degree of symmetry.
Publish Year: 2013
Published in: Computer Physics Communications - Science Direct
Number of Pages: 13
موضوع: رایانش کوانتوم ، فیزیک
ایران سای – مرجع مقالات علمی فنی مهندسی
حامی دانش بومی ایرانیان
به نام خدا
Title: An efficient parallel architecture for ray-tracing
Authors: Alexandre S Nery Nadia Nedjah Felipe M G Franca
Abstract: Real time rendering of three-dimensional scenes in high photorealistic details is a hard task, such as in the ray tracing rendering algorithm. In general, the performance achieved by a sequential software-based implementation of ray tracing is far from satisfactory. However, parallel implementations of ray tracing have been enabling reasonable real time performance, as the algorithm is embarrassingly parallel. Thus, a custom parallel design in hardware is likely to achieve an even higher performance. In this paper, we propose a hardware parallel architecture capable of dealing with the main desirable features of ray tracing, such as shadows and reflection effects, imposing low area cost and a promising rendering performance. Such architecture, called Grid RT, is based on the Uniform Grid acceleration structure and is intended to deliver massive parallelism through parallel ray-triangle intersection tests as well as parallel processing of many rays. A hardware implementation of the proposed architecture is presented, together with some performance results and resources requirements. The rendering is reduced by 80% using a grid configuration of eight processing elements.
Publish Year: 2012
Published in: Analog Integrated Circuits and Signal Processing - Journal of Springer
Number of Pages: 14
موضوع: پردازش موازی
ایران سای – مرجع مقالات علمی فنی مهندسی
حامی دانش بومی ایرانیان
به نام خدا
Title: Electron repulsion integrals for self-energy calculations
Authors: Y Pavlyukh , J Berakdar
Abstract: A fast algorithm for the calculation of the electron repulsion integrals in an atomic basis is a prerequisite of any ab initio quantum chemistry method. Unlike the case of a self-consistent field (SCF) approach, correlated methods often require a full or partial integral transformation to the molecular basis. The run- time of such an algorithm scales unfavorably as O(N ? where N ? is the number of the basis function, and additionally poses high requirements on the computer memory. The problem is aggravated in the case of large highly symmetric molecules which can only be modeled by fully taking the symmetry into account (as was recently demonstrated by us in J. Chem. Phys. 135 (2011) 201103). Wedescribe here the algorithm for the calculation of the electron repulsion integrals, the transformation and their use in the correlated Green s function approach for systems with icosahedral symmetry.
Publish Year: 2013
Published in: Computer Physics Communications - Science Direct
Number of Pages: 9
موضوع: فیزیک
ایران سای – مرجع مقالات علمی فنی مهندسی
حامی دانش بومی ایرانیان