Luciano S. de Souza
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Luciano S. de Souza has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Jonathan H. A. de Carvalho
Universidade Federal de Pernambuco
4 shared publications - Tiago Alessandro Espindola Ferreira
Universidade Federal Rural de Pernambuco
4 shared publications - Fernando Maciano De Paula Neto
Universidade Federal de Pernambuco
1 shared publication - Henrique Correia Torres Santos
Universidade Federal Rural de Pernambuco
1 shared publication
Latest Publications
- Open Access
PESC -- Parallel Experiment for Sequential Code
The need for computational resources grows as computational algorithms gain popularity in different sectors of the scientific community. This search has stimulated the development of several cloud platforms that abstract the complexity of computational infrastructure. Unfortunately, the cost of accessing these resources could leave out various studies that could be carried by a simpler infrastructure. In this article, we present a platform for distributing computer simulations on resources available on a network using containers that abstracts the complexity needed to configure these execution environments and allows any user can benefit from this infrastructure. Simulations could be developed in any programming language (like Python, Java, C, R) and with specific execution needs within reach of the scientific community in a general way. We will present results obtained in running simulations that required more than 1000 runs with different initial parameters and various other experiments that benefited from using the platform.
Open AccessPESC -- Parallel Experiment for Sequential Code
The need for computational resources grows as computational algorithms gain popularity in different sectors of the scientific community. This search has stimulated the development of several cloud platforms that abstract the complexity of computational infrastructure. Unfortunately, the cost of accessing these resources could leave out various studies that could be carried by a simpler infrastructure. In this article, we present a platform for distributing computer simulations on resources available on a network using containers that abstracts the complexity needed to configure these execution environments and allows any user can benefit from this infrastructure. Simulations could be developed in any programming language (like Python, Java, C, R) and with specific execution needs within reach of the scientific community in a general way. We will present results obtained in running simulations that required more than 1000 runs with different initial parameters and various other experiments that benefited from using the platform.
- 28 November 2021
- Published by Springer Nature
- p. 249-263
Lackadaisical Quantum Walk in the Hypercube to Search for Multiple Marked Vertices
- 28 November 2021
- Published by Springer Nature
- p. 249-263
Lackadaisical Quantum Walk in the Hypercube to Search for Multiple Marked Vertices
- 13 January 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 71 (2) , 378-389
Classical Artificial Neural Network Training Using Quantum Walks as a Search Procedure
This article proposes a computational procedure that applies a quantum algorithm to train classical artificial neural networks. The goal of the procedure is to apply quantum walk as a search algorithm in a complete graph to find all synaptic weights of a classical artificial neural network. Each vertex of this complete graph represents a possible synaptic weight set in the$w$ -dimensional search space, where$w$ is the number of weights of the neural network. To know the number of iterations required a priori to obtain the solutions is one of the main advantages of the procedure. Another advantage is that the proposed method does not stagnate in local minimums. Thus, it is possible to use the quantum walk search procedure as an alternative to the backpropagation algorithm. The proposed method was employed for a$XOR$ problem to prove the proposed concept. To solve this problem, the proposed method trained a classical artificial neural network with nine weights. However, the procedure can find solutions for any number of dimensions. The results achieved demonstrate the viability of the proposal, contributing to machine learning and quantum computing researches.- 13 January 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 71 (2) , 378-389
Classical Artificial Neural Network Training Using Quantum Walks as a Search Procedure
This article proposes a computational procedure that applies a quantum algorithm to train classical artificial neural networks. The goal of the procedure is to apply quantum walk as a search algorithm in a complete graph to find all synaptic weights of a classical artificial neural network. Each vertex of this complete graph represents a possible synaptic weight set in the$w$ -dimensional search space, where$w$ is the number of weights of the neural network. To know the number of iterations required a priori to obtain the solutions is one of the main advantages of the procedure. Another advantage is that the proposed method does not stagnate in local minimums. Thus, it is possible to use the quantum walk search procedure as an alternative to the backpropagation algorithm. The proposed method was employed for a$XOR$ problem to prove the proposed concept. To solve this problem, the proposed method trained a classical artificial neural network with nine weights. However, the procedure can find solutions for any number of dimensions. The results achieved demonstrate the viability of the proposal, contributing to machine learning and quantum computing researches.- 13 October 2020
- Published by Springer Nature
- p. 122-135
Impacts of Multiple Solutions on the Lackadaisical Quantum Walk Search Algorithm
- 13 October 2020
- Published by Springer Nature
- p. 122-135
Impacts of Multiple Solutions on the Lackadaisical Quantum Walk Search Algorithm