Humberto Jose Longo
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Humberto Jose Longo has a total of 47 co-authors. Here are the top co-authors by number of shared publications:
- Leslie Richard Foulds
Instituto de Informática, Universidade Federal de Goiás, Goiânia, Brazil
10 shared publications - Hugo Alexandre Dantas Do Nascimento
Universidade Federal de Goiás
4 shared publications - Márcia Rodrigues Cappelle
Instituto de Informática, Universidade Federal de Goiás, Goiânia, Brazil
4 shared publications - Wellington Santos Martins
Instituto de Informática -Universidade Federal de Goiás (UFG) Caixa Postal 74.690-900 -Goiânia -GO -Brazil
4 shared publications - Dayllon Vinícius Xavier Lemos
Instituto de Informática -Universidade Federal de Goiás Alameda Palmeiras qd. D campus Samambaia 74001-970 Goiânia Goiás Brasil
3 shared publications - Dayllon Vinícius Xavier Lemos
Instituto de Informática, Universidade Federal de Goiás
2 shared publications
Latest Publications
- Open Access
- 14 December 2025
- Published by Association for Computing Machinery (ACM)
- p. 13-18
Efficient Service Placement and Node Allocation in Fog and Edge Computing
- 14 December 2025
- Published by Association for Computing Machinery (ACM)
- p. 13-18
Open AccessEfficient Service Placement and Node Allocation in Fog and Edge Computing
- 8 October 2025
- Published by Springer Nature in Matemática Contemporânea
- Vol. 62 (1) , 1-9
Independent Locating-Dominating Sets in Some Graphs Constructed from Cycles
- 8 October 2025
- Published by Springer Nature in Matemática Contemporânea
- Vol. 62 (1) , 1-9
Independent Locating-Dominating Sets in Some Graphs Constructed from Cycles
- Open Access
- 20 July 2025
- Published by Sociedade Brasileira de Computação
- p. 41-45
Independent locating-dominating sets in P4-sparse graphs
A vertex subset S of a graph of order n is termed independent locating-dominating (an ILD set for short) if it is independent, dominating and no two distinct vertices of V (G) \ S have the same open neighbourhood in S, i.e. NG(u)∩S ≠ NG(v)∩S, ∀ u, v ∈ V (G)\S, u≠ v. We study ILD sets in P4-sparse graphs and propose two algorithms: one for recognizing whether or not a graph admits an ILD set and another for computing an ILD set of minimum cardinality, both with time complexity O(n2).
- 20 July 2025
- Published by Sociedade Brasileira de Computação
- p. 41-45
Open AccessIndependent locating-dominating sets in P4-sparse graphs
A vertex subset S of a graph of order n is termed independent locating-dominating (an ILD set for short) if it is independent, dominating and no two distinct vertices of V (G) \ S have the same open neighbourhood in S, i.e. NG(u)∩S ≠ NG(v)∩S, ∀ u, v ∈ V (G)\S, u≠ v. We study ILD sets in P4-sparse graphs and propose two algorithms: one for recognizing whether or not a graph admits an ILD set and another for computing an ILD set of minimum cardinality, both with time complexity O(n2).
- Open Access
- 20 February 2025
- Published by Universidade Federal do Rio Grande do Sul in Revista de Informática Teórica e Aplicada
- Vol. 32 (1) , 158-165
YOLO and CNN for Cat Detection and Recognition
This paper proposes a processing architecture for recognizing domestic felines in videos and images based on facial features. Some photos of the cats to be identified in the videos and images need to be collected in advance. A key aspect of this study is avoiding the need to retrain the model whenever the set of cats to be identified changes. The architecture involves five processing stages: video processing, YOLOv8 for cat detection, InceptionV3 for feature extraction, KNN for database searching, and voting process to improve classification. Transfer learning and fine-tuning techniques are employed to improve performance. The proposed method achieves high accuracy, offering a scalable and non-invasive solution for cat recognition, which can contribute to urban management, cat loss prevention, and medical insurance control for domestic cats, among other applications.
- 20 February 2025
- Published by Universidade Federal do Rio Grande do Sul in Revista de Informática Teórica e Aplicada
- Vol. 32 (1) , 158-165
Open AccessYOLO and CNN for Cat Detection and Recognition
This paper proposes a processing architecture for recognizing domestic felines in videos and images based on facial features. Some photos of the cats to be identified in the videos and images need to be collected in advance. A key aspect of this study is avoiding the need to retrain the model whenever the set of cats to be identified changes. The architecture involves five processing stages: video processing, YOLOv8 for cat detection, InceptionV3 for feature extraction, KNN for database searching, and voting process to improve classification. Transfer learning and fine-tuning techniques are employed to improve performance. The proposed method achieves high accuracy, offering a scalable and non-invasive solution for cat recognition, which can contribute to urban management, cat loss prevention, and medical insurance control for domestic cats, among other applications.
- Open Access
- 21 July 2024
- Published by Sociedade Brasileira de Computação
- p. 72-75
Valid Paths, a short synthesis
A labeling of a graph is an assignment of labels to its vertices and/or edges. The Path Validity Problem seeks to optimise the quantity of 2-paths with the integer label associated with the middle vertex being smaller than those associated with the path endpoints. Recent research has investigated the behaviour of optimal labeling in several classes of graphs. This work provides a summary overview of recent advances in the study of this challenging problem and presents that the decision problem of its maximising variant is NP-Complete, while its minimising variant remains an open problem.
- 21 July 2024
- Published by Sociedade Brasileira de Computação
- p. 72-75
Open AccessValid Paths, a short synthesis
A labeling of a graph is an assignment of labels to its vertices and/or edges. The Path Validity Problem seeks to optimise the quantity of 2-paths with the integer label associated with the middle vertex being smaller than those associated with the path endpoints. Recent research has investigated the behaviour of optimal labeling in several classes of graphs. This work provides a summary overview of recent advances in the study of this challenging problem and presents that the decision problem of its maximising variant is NP-Complete, while its minimising variant remains an open problem.
- 25 April 2024
- Published by Springer Nature
- p. 205-222
Search Space Visualizations in the Context of Optimization Problems: A Literature Review
- 25 April 2024
- Published by Springer Nature
- p. 205-222
Search Space Visualizations in the Context of Optimization Problems: A Literature Review
- Open Access
Valid path-based graph vertex numbering
A labelling of a graph is an assignment of labels to its vertex or edge sets (or both), subject to certain conditions, a well established concept. A labelling of a graph G of order n is termed a numbering when the set of integers {1,...,n} is used to label the vertices of G distinctly. A 2-path (a path with three vertices) in a vertex-numbered graph is said to be valid if the number of its middle vertex is smaller than the numbers of its endpoints. The problem of finding a vertex numbering of a given graph that optimises the number of induced valid 2-paths is studied, which is conjectured to be in the NP-hard class. The reported results for several graph classes show that apparently there are not one or more numbering patterns applicable to different classes of graphs, which requires the development of a specific numbering for each graph class under study.
Open AccessValid path-based graph vertex numbering
A labelling of a graph is an assignment of labels to its vertex or edge sets (or both), subject to certain conditions, a well established concept. A labelling of a graph G of order n is termed a numbering when the set of integers {1,...,n} is used to label the vertices of G distinctly. A 2-path (a path with three vertices) in a vertex-numbered graph is said to be valid if the number of its middle vertex is smaller than the numbers of its endpoints. The problem of finding a vertex numbering of a given graph that optimises the number of induced valid 2-paths is studied, which is conjectured to be in the NP-hard class. The reported results for several graph classes show that apparently there are not one or more numbering patterns applicable to different classes of graphs, which requires the development of a specific numbering for each graph class under study.
- Open Access
- 6 February 2023
- Published by Taylor & Francis in International Journal of Geographical Information Science
- Vol. 37 (6) , 1388-1419
Scheduling distributed multiway spatial join queries: optimization models and algorithms
Multiway spatial joins are a commonly occurring and fundamental type of query for spatial data processing. This article presents models and algorithms to schedule this type of query in distributed database systems while attempting to strike a balance between makespan and communication costs. We propose three algorithms based on combinatorial optimization methods: the well-known linear relaxation technique of rounding a solution generated by linear programming (LP), a more sophisticated Lagrangian Relaxation method (LR), as well as a greedy heuristic (GR) for baseline comparison. Our evaluation shows that a schedule built using GR consumes, on average, 22% more processing and communication resources than a more elaborate schedule constructed via the LR method, when scheduling a query for 64 machines. The schedule provided by LR is also, on average, an order of magnitude closer to the optimal schedule for a query compared to GR. We show that scheduling Gigabyte-size multiway queries before execution can reduce its processing time by an order of magnitude compared to state-of-the-art frameworks for spatial data processing that do not have this capability, and can significantly reduce the amount of shuffled data in the network.
- 6 February 2023
- Published by Taylor & Francis in International Journal of Geographical Information Science
- Vol. 37 (6) , 1388-1419
Open AccessScheduling distributed multiway spatial join queries: optimization models and algorithms
Multiway spatial joins are a commonly occurring and fundamental type of query for spatial data processing. This article presents models and algorithms to schedule this type of query in distributed database systems while attempting to strike a balance between makespan and communication costs. We propose three algorithms based on combinatorial optimization methods: the well-known linear relaxation technique of rounding a solution generated by linear programming (LP), a more sophisticated Lagrangian Relaxation method (LR), as well as a greedy heuristic (GR) for baseline comparison. Our evaluation shows that a schedule built using GR consumes, on average, 22% more processing and communication resources than a more elaborate schedule constructed via the LR method, when scheduling a query for 64 machines. The schedule provided by LR is also, on average, an order of magnitude closer to the optimal schedule for a query compared to GR. We show that scheduling Gigabyte-size multiway queries before execution can reduce its processing time by an order of magnitude compared to state-of-the-art frameworks for spatial data processing that do not have this capability, and can significantly reduce the amount of shuffled data in the network.
- Open Access
- 25 October 2022
- Published by Sociedade Brasileira de Computação
- p. 181-184
Uma abordagem paralela para resolução do MWPSP
O problema de se identificar em um grafo G, ponderado nas arestas, um subgrafo planar de peso máximo pertence à classe NP-difícil. Esse problema é importante na modelagem e resolução de problemas das mais diversas áreas. É proposto um novo algoritmo heurístico de busca local, baseado em métodos previamente existentes de construção, o qual usa paralelismo de GPU.
- 25 October 2022
- Published by Sociedade Brasileira de Computação
- p. 181-184
Open AccessUma abordagem paralela para resolução do MWPSP
O problema de se identificar em um grafo G, ponderado nas arestas, um subgrafo planar de peso máximo pertence à classe NP-difícil. Esse problema é importante na modelagem e resolução de problemas das mais diversas áreas. É proposto um novo algoritmo heurístico de busca local, baseado em métodos previamente existentes de construção, o qual usa paralelismo de GPU.
- Open Access
- 25 October 2022
- Published by Sociedade Brasileira de Computação
- p. 24-35
Programação dinâmica paralela em GPU para os problemas da mochila uni e bi-dimensional
O trabalho apresenta algoritmos paralelos de granularidade fina, baseados em programação dinâmica, para a resolução do Problema da Mochila Uni e Bi-Multidimensional. É apresentado também um algoritmo para a resolução conjunta de várias instâncias do problema. Os testes computacionais realizados com implementações dos algoritmos em GPU mostraram um ganho de eficiência considerável, em comparação às suas versões sequenciais.
- 25 October 2022
- Published by Sociedade Brasileira de Computação
- p. 24-35
Open AccessProgramação dinâmica paralela em GPU para os problemas da mochila uni e bi-dimensional
O trabalho apresenta algoritmos paralelos de granularidade fina, baseados em programação dinâmica, para a resolução do Problema da Mochila Uni e Bi-Multidimensional. É apresentado também um algoritmo para a resolução conjunta de várias instâncias do problema. Os testes computacionais realizados com implementações dos algoritmos em GPU mostraram um ganho de eficiência considerável, em comparação às suas versões sequenciais.