A Genetic-Firefly Hybrid Algorithm to Find the Best Data Location in a Data Cube

Autor: M. Faridi Masouleh, Mahmood Alborzi, A. Toloie Eshlaghy, M. A. Afshar Kazemi

Publikováno v: Engineering, Technology & Applied Science Research, Vol 6, Iss 5, Pp 1187-1194 (2016)
Engineering, Technology & Applied Science Research, Vol 6, Iss 5 (2016)

Decision-based programs include large-scale complex database queries. If the response time is short, query optimization is critical. Users usually observe data as a multi-dimensional data cube. Each data cube cell displays data as an aggregation in w

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3459e46badd88a185e474e0c693d2462
http://etasr.com/index.php/ETASR/article/view/702/387

Utilizing Probabilistic Linear Equations in Cube Attacks

Autor: Bin Zhang, Yuan Yao, Wenling Wu

Publikováno v: Journal of Computer Science and Technology. 31:317-325

Cube attacks, proposed by Dinur and Shamir at EUROCRYPT 2009, have shown huge power against stream ciphers. In the original cube attacks, a linear system of secret key bits is exploited for key recovery attacks. However, we find a number of equations

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::12d2ca9791ee9f2084aa86b752ffff75
https://doi.org/10.1007/s11390-016-1629-3

A Linear Constrained Optimization Benchmark for Probabilistic Search Algorithms: The Rotated Klee-Minty Problem

Autor: Michael Hellwig, Hans-Georg Beyer

Publikováno v: Theory and Practice of Natural Computing ISBN: 9783030040697
TPNC

The development, assessment, and comparison of randomized search algorithms heavily rely on benchmarking. Regarding the domain of constrained optimization, the small number of currently available benchmark environments bears no relation to the vast n

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::a160598fed5cdbdf66cfa737b54117e9
https://doi.org/10.1007/978-3-030-04070-3_11

Formulas for cube roots in F3m using shifted polynomial basis

Autor: Seokhie Hong, Nam Su Chang, Young In Cho

Publikováno v: Information Processing Letters. 114:331-337

Evaluation of cube roots in characteristic three finite fields is required for Tate (or modified Tate) pairing computation. The Hamming weight of x 1 / 3 means that the number of nonzero coefficients in the polynomial representation of x 1 / 3 in F 3

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::b3fdc925a10010d5d597fec986f3b0be
https://doi.org/10.1016/j.ipl.2014.01.001

A lower bound on the number of Hamiltonian cycles through a prescribed edge in a crossed cube

Autor: Chia-Jui Lai, Pao-Lien Lai, Jheng-Cheng Chen, Chang-Hsiung Tsai

Publikováno v: Applied Mathematics and Computation. 219:9885-9892

The crossed cube proposed by Efe is one of the most notable variations of the hypercube, but some properties of the former are superior to those of the latter. For example, the diameter of the crossed cube is almost the half that of the hypercube. In

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::4db02e714a7a764142b53c792f5bcd41
https://doi.org/10.1016/j.amc.2013.03.128